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.
Result and scope
An irreducible binary projector collection with independent images satisfies
2n <= 3k-1. Here n is the number of rank-one idempotents, k is the dimension of their off-diagonal pattern span, every pattern is nonzero, and that span contains no matrix unit. The collection need not be a complete pool.Equality for
n>1forces an even number d of disjoint normal-form triples and one link, withn=3d+1andk=2d+1. The link has factorsh+aandh+b, where h is the sum of the block hubs, a,b use fresh coordinates, and their pairing is one. Conversely, each such family is an irreducible complete pool and attains equality.Read the proof, exact receipt, verifier and scope record. The result forces the known two-block structure for seven projectors with seven-dimensional image and pattern dimension at most five, which resolves the minimum-cardinality case of PR #7281's open structural question. Prior work fixed the blocks before classifying links. This proof derives the blocks from the diagonal kernel.
No new kappa. The theorem does not cover larger collections with dependent images. Irreducibility of a complete pool does not establish that it has an irreducible image-basis subcollection. The general image bound at pattern dimension five, a paid BIT word, native conversion and the complete invoice remain open. The selected frontier and all five assumptions are unchanged. This completes the advance claim.
Evidence and reproduction
Normal and optimized CPython 3.12.16 replay passed on macOS arm64. The all-width argument uses an exhaustive three-coordinate normal-form lemma: all 168 bases, with 18 ordered survivors and three unordered triples. The verifier also checks all 2156 image-basis collections at width three: 146 have nonzero unit-free patterns and 19 are irreducible. Incidence and direct orbit tests agree on all 146.
Nine equality fixtures with 2,4,6 blocks cover all 26199 nonzero patterns in their spaces. Complete pool membership, diagonal sectors, image/covector ranks and irreducibility pass. All 127 nonzero vector orbits are checked for each seven-image fixture. The lift method agrees with complete idempotent scans at widths 2,3,4. Reducible and matrix-unit controls violate the bound after the respective hypothesis is removed; odd-block stars have a nonzero common kernel.
Metadata, committed bytes, modes, source ancestry, the eight-file official export and integrity check pass. A read-only optimized export replay passes without Git or a usable PATH; all nine payload/manifest hashes and modes stay unchanged. The finite tests support the written theorem; they do not enumerate arbitrary ambient widths.
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. Predecessor scientific replays, the selected cold replay, Lean and Docker were not run. Independent human and formal-kernel review are unclaimed.Sources and credit
Prepared by @aliromman with substantial OpenAI Codex assistance. @unpaidmoon supplied the normal-form lemma in PR #6921, exact proof, the two-block construction in PR #7237, and the fresh-link family and structural question in PR #7281, exact proof. Nick Petalas (@petalas) supplied the nonsymmetric link in PR #7648, exact source, and the earlier fiber lemma credited by the source of PR #6921. Ali Romman's PR #7676, exact proof, supplies the prior fixed-block classification. These earlier examples and the small normal-form lemma are not new results here. New work is Apache-2.0.
Base: canonical main
e54523517d0f03e58352e647c403a5af3e525a57, priority revision 8. Cardbit-new-register-model, scope changed to the scalar structural question; the original construction gate is unmet. Refreshed handoffs and open/closed PR/Discussion overlap identify the predecessors and no conflicting claim for this restricted theorem. Sparse local and unpublished work remain coverage limits. The next useful question is whether larger pools must contain an irreducible image-basis subcollection; the present proof must not be used before that condition is checked.