Repository navigation
Conversation
This was referenced Nov 18, 2026
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.
Result and scope
Every complete unit-free pattern-dimension-five pool with irreducible image dimension seven has exactly seven projectors and the two-block hub-link form. After a coordinate permutation, it consists of two disjoint normal triples and one link
(h+a)(h+b)^T, where h is the sum of their hubs, a,b use fresh coordinates anda dot b=1. These conditions are also sufficient at every ambient width.Read the proof, exact receipt, verifier and scope record. This closes question 2 of PR #7281. Prior work classified links after the two blocks were fixed. The new proof forces those blocks for an arbitrary complete pool, without assuming an irreducible image-basis subcollection. It excludes the triple-plus-quad case, every column-triple case and the zero fresh-covector boundary.
Every resulting action on the joint image is isomorphic to six coordinate projectors plus the all-one seven-by-seven matrix. The parameterization permits arbitrary fresh supports; it is not a count of coordinate-permutation orbits or a unique orbit representative. The existing positive family and its fixed-coordinate counts remain prior work.
No new kappa, paid BIT word, native operator or complete invoice is supplied. The selected frontier and all five assumptions remain unchanged. The missing step is now a legal word-level realization and reduction, not another scalar link search. This completes the advance claim.
Evidence and reproduction
Normal and optimized CPython 3.12.16 replay passed on macOS arm64. The verifier enumerates all 40768 rank-one idempotents at widths seven and eight. Three stated link domains contain 30679 candidate links and 30376 distinct unit-free spaces, with distinctness counted within each domain. Complete pools from a raw idempotent index agree with separate literal-pattern lifting. Every excluded space has a checked invariant-subspace certificate. Pools of up to ten members are included; the tests do not truncate them to seven generators.
Four triple-plus-quad fixtures cover active quad ranks two and four and both triple types. Their complete pools have seven or eight members. The normal-form lemma checks all 168 three-coordinate bases, with 18 ordered survivors. Six prior positive links at widths seven through ten pass complete-pool and all-127-vector orbit checks. The prior eight-member pool generated by
(64,69)retains its extra member(70,5)and has an invariant fresh line.The all-width reduction uses the disjoint-circuit theorem from PR #7690, the stated finite three-coordinate normal-form lemma, and the fixed-block proof from PR #7676. The finite link scans cover the named coordinate domains, not every ambient embedding. The complete fixed-block predecessor census was not rerun; its proof and the listed controls are reused with credit.
Metadata, committed bytes, modes, source ancestry, eight-file export and archive integrity pass. A read-only optimized export replay passes without Git or a usable PATH; all nine payload/manifest hashes and modes stay unchanged.
With CPython 3.12 and its standard library, from the repository root:
Expected markers:
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. Full predecessor scientific replays, selected cold replay, Lean and Docker were not run. The listed predecessor witnesses were rechecked. Independent human and formal-kernel review are unclaimed.Sources and credit
Prepared by @aliromman with substantial OpenAI Codex assistance. Ali Romman's PR #7690, exact proof, supplies the disjoint-circuit reduction and reused matrix/lift routines. Its source record retains @CubeJerry's earlier support-method credit.
@unpaidmoon supplied the normal-form lemma in PR #6921, exact proof, and the two-block family and question in PR #7237 and PR #7281, exact source. Nick Petalas (@petalas) supplied the nonsymmetric link in PR #7648, exact source, and the earlier fiber context. Ali Romman's PR #7676, exact proof, supplies the fixed-block complete-pool classification, restated with credit. The earlier restricted result PR #7686 and general extraction failure PR #7688 mark the scope extended here. New work is Apache-2.0; no external runtime package is needed.
Base: canonical main
e54523517d0f03e58352e647c403a5af3e525a57, priority revision 8. Cardbit-new-register-model, scope changed to this scalar classification; the native construction gate remains unmet. Refreshed open/closed PR and Discussion overlap and live handoffs show the distinct predecessors and no competing full-classification claim. Sparse local and unpublished work remain coverage limits. The next useful work must state a legal paid alphabet, all counted roles, the reduction hypotheses and the complete producer/consumer invoice.