Repository navigation
Conversation
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
Alphabet reduction and block classification: for every pair of distinct odd primes p<q and positive a,b, the maximum number of orthogonal columns with p+q entries is the same over mu_(p^a q^b) as over mu_(pq). Higher prime powers cannot increase this exact capacity. Every matrix that cannot descend has at most p columns and splits, after row permutation and phase changes, into a p-row mu_p block and a q-row mu_q block with relative column phases. No new kappa or physical supplier follows.
Read the universal proof, exact certificates, checker, source pins and credits. This extends PR #7775's p=3 theorem with a product invariant that works for every odd prime.
[A D; B], with orthogonal columns in A over mu_p and B over mu_qLam and Leung's classical cycle theorem makes each pairwise zero sum one p-cycle plus one q-cycle. Quotient phases force one common p-row subset. For two columns in the same phase class, ratios to a third class give two permutations of a prime cycle. Their product invariant prevents replacing one root of that cycle by a different root. Thus the column restrictions are orthogonal on both blocks. Dimension gives at most p columns, and phase normalization gives the stated block form. A stacked Fourier construction attains p columns already in the smaller alphabet, which completes the capacity equality. The actual squarefree capacity remains unknown here except for the retained eight-row result.
Python 3.12 and the standard library:
Both modes print:
Exact checks cover 82,728 canonical quotient cases and 1,252,944 full subset cases for five-row subsets of twelve rows in Z/3. The latter tests the odd-group combinatorial lemma beyond the root quotients for primes 5 and 7. All 5,166 relative permutations for p=3,5,7 are checked; they represent arbitrary permutation pairs up to a common row permutation. The checker covers all 82,906 rotated cycle pairs in twelve stated alphabets, 124,766 relevant product submultisets, 3,448 recorded Gram entries, explicit same-class examples and 24 single-entry mutants. A p=2 example demonstrates failure of the product implication outside the odd-prime hypothesis. These are finite controls for the written universal proof, not an enumeration of all matrices.
All 37 retained files are authenticated. The complete p=3 verifier and its nested eight-row capacity certificate run unchanged. Normal/optimized registered checks, 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 requiresmake 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 #7775's p=3 proof, certificate and checker. Nick Petalas (@petalas) supplied PR #7744's two-prime completion question. T. Y. Lam and K. H. Leung supplied the classical input in On Vanishing Sums of Roots of Unity, Corollary 3.4. All predecessor notices remain intact; no global literature priority is claimed.
The squarefree optimization, classification of the smaller blocks, even-prime cases, a third prime divisor, other row counts, approximate orthogonality, native realization and complete caller costs remain outside this result. No selected cold replay, Lean, Docker, independent human or formal-kernel acceptance is claimed. All five framework assumptions and the selected frontier remain unchanged.
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.