Skip to content

Prove exact four-column capacity over fifteenth roots - #7769

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

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

Conversation

@aliromman

@aliromman aliromman commented Nov 19, 2026 •

Copy link
Copy Markdown
Contributor

Complete finite result: eight rows over fifteenth roots support exactly four orthogonal columns. An explicit matrix attains four; a complete extension graph excludes five. This resolves the smallest attainment question left by PR #7768, whose general defect bound permits five. No new kappa follows.

Read the proof and attaining matrix, complete graph certificate, checker, source pins and credits.

Normalize any pair to a constant column and the exponent vector (0,5,10,0,3,6,9,12). Of 20,160 possible normalized further columns, exactly 95 are orthogonal to this pair. Their compatibility graph has two six-cycles and 83 isolated vertices. It has no triangle, so three further columns cannot coexist. There are twelve normalized four-column sets; one is displayed and checked entry by entry. These are labeled counts for the fixed pair, not a classification under every matrix equivalence.

Python 3.12 and the standard library:

python3.12 -B scripts/research_package.py --package research/fifteenth-root-column-capacity

Both registered modes print:

PASS_FIFTEENTH_ROOT_COLUMN_CAPACITY
Exact maximum: four orthogonal columns in eight rows over fifteenth roots
116280 tail multisets; two enumerations of 20160 normalized columns; 95 extensions
4465 pairs; 138415 triples; graph = two six-cycles and 83 isolated vertices
Twelve normalized four-column sets; exact attaining Gram; 448 changed entries reject

The unchanged source census covers all 319,770 eight-root multisets and proves the pair normalization. The new seven-term-tail census and separate cycle-permutation enumeration agree on all candidates. Every pairing is checked by polynomial division and a separate tensor basis. Component traversal, all triples and edge common-neighbor bitsets independently exclude triangles. All 448 single-entry changes to the witness fail orthogonality; omitting conjugation gives the wrong graph.

Nineteen retained files are authenticated. The unchanged PR7762 and nested PR7744 verifiers, 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 the general defect bound and open question, and the finite census checker in PR #7762. Nick Petalas (@petalas) supplied the original two-prime question in PR #7744, with its pinned proof and question. All prior source notices, including the cycle theorem and atlas lineage, remain intact. The new finite capacity proof does not rely on the general spectral bound.

This result fixes the alphabet to fifteenth roots and the row count to eight. Roots of order 3*5^b for b>1, other row counts, approximate orthogonality, full matrix-equivalence classification, physical preparation and complete caller costs remain open. All five framework assumptions and the selected frontier remain unchanged. The selected cold replay, Lean and Docker were not run. No independent human/formal-kernel acceptance or 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