Skip to content

Prove higher-power phase descent and exact eight-row capacity four - #7775

Open
aliromman wants to merge 1 commit into
CrocSwap:mainfrom
aliromman:codex/consecutive-result-086
Open

aliromman wants to merge 1 commit into
CrocSwap:mainfrom
aliromman:codex/consecutive-result-086

Conversation

@aliromman

@aliromman aliromman commented Nov 19, 2026 •

Copy link
Copy Markdown
Contributor

Scoped alphabet theorem: for every prime q>=5 and positive a,b, a q+3-row matrix with at least four pairwise orthogonal columns over mu_(3^a q^b) can be changed by row and column phases into a matrix over mu_(3q). Consequently, the maximum number of orthogonal eight-entry columns is exactly four for every mu_(3^a 5^b). This resolves the higher-power question from PR #7769. No new kappa or physical supplier follows.

Read the all-power proof and sharpness construction, exact certificates, checker, source pins and credits.

Statement Exact scope
Alphabet descent q prime >=5, a,b>=1, q+3 rows, at least four orthogonal columns
Exact capacity four Eight rows, every alphabet mu_(3^a 5^b)
Sharp threshold Three-column higher-phase examples cannot descend when 3^a q^b>3q

Lam and Leung's classical two-prime cycle theorem makes each pairwise zero sum one 3-cycle plus one q-cycle. Modulo the smaller alphabet, a nonconstant column therefore has one exceptional three-row subset. The new simultaneous-column argument proves that all such subsets coincide. If any higher quotient phase remains, restrictions to those three rows must be pairwise orthogonal: a same-phase pair is either orthogonal or proportional, and proportionality would repeat one root three times in a two-cycle zero sum. Thus an essential higher phase permits at most three columns.

The transformation is explicit double dephasing, and every two-by-two cross ratio must lie in mu_(3q). A three-column construction combines a phased three-row Fourier block with q Fourier rows. Its Gram is diagonal, but one cross ratio is a primitive higher-order root. This proves that the four-column hypothesis cannot be reduced to three.

Python 3.12 and the standard library:

python3.12 -B scripts/research_package.py --package research/two-prime-alphabet-descent

Both modes print:

PASS_TWO_PRIME_ALPHABET_DESCENT
At least four orthogonal columns with q+3 rows descend from mu_(3^a*q^b) to mu_(3q)
Exact eight-row capacity four for all a,b>=1; three-column boundary is sharp
Exact quotient-pattern, prime-cycle, Fourier-line, cross-ratio and lifted-attainment checks pass
Unchanged complete fifteenth-root capacity and nested source checks pass

New exact checks cover 10,272 canonical quotient patterns, 173,600 full subset-pair cases and all 14,400 prime-cycle pairs in eight alphabets of orders 15,45,75,225,21,63,147,441. Exact cyclotomic basis lookup finds every normalized three-root zero sum. The three-column counterexamples, higher-phase cross ratios, lifted four-column attainment and row/column phase recovery give 200 exact Gram checks. A composite-q=6 pattern shows why the quotient-count proof excludes that size. These checks support the written universal proof; they do not enumerate all matrices or replace the classical cycle theorem.

All 28 retained files are authenticated. The complete fifteenth-root capacity verifier runs unchanged, including the 95-vertex extension graph, exhaustive triangle exclusion, attaining matrix and nested predecessor replays. Normal/optimized registered replay, syntax/indentation, committed bytes/source history/modes, export and sealed read-only Git-free serial replay pass. Hosted CI did not certify this package. The plan job failed in the shared test_current_ci_section_matches_selected_record: the base guide names frontier6030 while the selected record requires make frontier7000-verify. The log reports 760 tests, one failure and 24 skipped; package replay was skipped. This package changes no shared CI file. Local replay remains the scientific evidence.

Ali Romman (@aliromman) supplied PR #7769's finite capacity proof, certificate and checker, building on PR #7762's eight-root census. PR #7768's general defect bound motivated the attainment question but is not used in the new descent proof.

Nick Petalas (@petalas) supplied PR #7744's two-prime completion question and projection. T. Y. Lam and K. H. Leung supplied the classical input in On Vanishing Sums of Roots of Unity, Corollary 3.4. All earlier notices, completion credit and atlas credit remain intact.

Other row counts, a third prime divisor, approximate orthogonality, full equivalence classification, native preparation and complete caller prices remain outside the result. The source capacity remains a finite certificate; no selected cold replay, Lean, Docker, independent human acceptance or formal-kernel acceptance is claimed. All five framework assumptions and the selected frontier remain unchanged. No global literature priority is claimed.

Base: canonical main e54523517d0f03e58352e647c403a5af3e525a57, priority revision 8. Source pins do not assert ancestry. Prepared by Ali Romman with substantial OpenAI Codex assistance in research, implementation, verification and writing. Apache-2.0. Canonical claim.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

None yet

Projects

None yet

Development

Successfully merging this pull request may close these issues.

1 participant