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.
The irreducible edge-matching image bound has a parity restriction, and the exact maximum is now known whenever k−nu is odd. For binary rank-one idempotents with nonzero off-patterns, k is the pattern dimension, nu is the matrix-unit graph's maximum matching size, and n is the joint-image dimension.
k−nu = 1 modulo 4, the sharp maximum isn=(3k+nu−1)/2.k−nu = 3 modulo 4, the sharp maximum isn=(3k+nu−3)/2.Read the proof, receipt, finite exceptional certificates and checker. These are all-dimension results with two explicit finite proof steps after reduction to widths three and four.
Every pool attaining
2n=3k+nu−1is classified: nu disjoint unit pairs, an even number(k−nu−1)/2of normal triples and one fresh link, with the one-dimensional case stated separately. It has exactly n projectors and odd n. The classification treats the complete pool, including extra lifts; it does not assume an irreducible image-basis subcollection. A second construction attains the improved bound for the other odd residue class. The even-difference maximum and classification of the lower attainers remain open.No new kappa, paid word, G20 provider, native realization or complete invoice is supplied. Coordinate projectors are excluded. The selected frontier and all five assumptions remain. The existing orthogonal-basis single-bridge word obstruction still applies where its relation-lattice premises hold. This completes the advance claim.
Normal and optimized CPython 3.12.16 checks pass on macOS arm64. The finite reduction enumerates all 868 unordered invertible bases at widths three and four. All 357 qualifying complete pools have a retained proper invariant subspace. Raw rank-one scans and separate pattern lifting agree; every nonzero-vector orbit is also checked. The normal-triple lemma is rechecked. All 23133 nonzero patterns of 37 attaining fixtures are lifted. Another 1050 links in two column-triple domains check the complete-pool covector obstruction, including pools with extra members. Odd-triple trace/kernel controls and an irreducible even-image control show the theorem's boundaries.
Metadata, source history, committed bytes, modes, export, archive integrity and read-only optimized replay without Git or a usable PATH pass. 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. Selected cold replay, full predecessor package replays, native, Lean and Docker checks were not run. Independent human and formal-kernel review are unclaimed. The unrestricted conclusion uses the written support argument and the explicitly complete finite exceptional certificates, not extrapolation from examples.Prepared by @aliromman with substantial OpenAI Codex assistance. The consumed matching and disjoint-relation theorem is Ali Romman's PR #7692, pinned proof. Its binary pool and orbit primitives are adapted. The complete-coset argument extends PR #7691, pinned seven-image proof. The exceptional lower construction uses the three-copy pool lemma of PR #7688, pinned proof.
The all-pair endpoint in PR #7693 and the two-triple endpoint in PR #7691 remain prior classifications. The relevant word obstruction is PR #7695, pinned proof. Credit details preserve the matrix-unit fiber, normal-triple and fresh-link results of Jerry Chen (@CubeJerry), Nick Petalas (@petalas) and @unpaidmoon. Those blocks and special cases are not newly claimed. New work is Apache-2.0.
Base: canonical main
e54523517d0f03e58352e647c403a5af3e525a57, priority revision 8. Cardbit-helper-contract, scope changed from an emitted G20 helper edit to the source theorem's open fixed-matching geometry question. Current G20 proposals were read for orientation. Live handoffs, refreshed PR/Discussion overlap and source-reference intake were checked; the complete closed snapshot and updated-order delta show no later changes. Sparse local and unpublished work remain coverage limits. Task and limits.