Repository navigation
Conversation
This was referenced Nov 18, 2026
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.
The binary matching image bound is sharp for every positive even k−nu, with one small exception. For an irreducible collection of rank-one idempotents with nonzero off-patterns, let k be its actual pattern dimension, nu the matching number of its matrix-unit graph, and n its joint-image dimension. The exact maximum is
(3k+nu−2)/2, except at(k,nu)=(2,0), where it is one.Read the proof, receipt, checker and source credit.
Two fresh links to the disjoint pair/triple core attain every regular case. Their complete pools have n members, except at
(k,nu,n)=(4,0,5), where an additional lift gives six members. The proof includes that member. A two-dimensional restriction argument excludes n=2 in the small exception, and a complete one-dimensional pool attains its maximum. At k=nu, only k=1 permits an irreducible collection, as a proper subcollection of its pool. Together with the prior sharp odd case, this gives all fixed-(k,nu) maxima and existence cases. The dimension-five instance was already attained by a different five-member pool in PR #7094, credited below. It does not classify every maximizing pool or a prescribed edge graph.No new kappa. Image capacity supplies no legal paid word, relation lattice, native implementation, owned storage, restoration or complete signed recursive invoice. The selected value remains
363005817/100000000000and all five assumptions remain. The existing single-bridge word obstruction does not automatically cover this two-link alphabet.Canonical base:
e54523517d0f03e58352e647c403a5af3e525a57. Cardbit-helper-contractchanges scope to the remaining geometric maximum; the scoped claim states its relevance and stop rule. Current main, live handoffs, open/closed PR overlap and the exact predecessor heads were checked. Sparse local and unpublished work remain overlap limits. Only the new package is changed.With CPython 3.12 and no third-party dependency:
Expected direct marker:
Both registered modes pass. All 42256 nonzero patterns in 24 attaining fixtures are lifted, with exact complete-pool, rank, matching, Gram and connectivity checks. Every nonzero-vector orbit is checked when n≤9. Raw factor scans independently reconstruct the four smaller family pools and the exceptional witness. All 36 ordered pairs and 216 ordered triples on F2² are checked; every pair and the 168 triples with idempotent sum have an invariant line. All 126 one-per-edge choices through k=6 are checked. Wrong-parity links and idempotent links with connected action but a common kernel provide failure controls. The prior five-member pool is also checked as a prior-result comparison, including all its patterns and nonzero-vector orbits.
The all-width result uses the written proof and the cited matching upper bound; the finite checks are corroboration. Syntax and indentation, committed bytes/modes, source history, export input coverage and optimized sealed Git-free replay pass. Sealed source hashes and read-only modes remain unchanged. Validation details list the domains and limits. Complete predecessor suites, selected cold replay, native, Lean, Docker, independent human and formal-kernel review were not run. 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.Credit Ali Romman (@aliromman), with substantial OpenAI Codex assistance, for the consumed PR #7692 matching theorem, head
c2870a38841f515db7203a0761cd77f014f7fb7a, and PR #7703 odd-difference proof, head2523029b27d40526b811591ce0fb85f9bc1b1df7. The latter's binary primitives and old-core constructor are adapted here. Its odd maxima are prior results, not recounted as new.Credit Nick Petalas (@petalas) for PR #6785, head
5dbf2c05220bea53d84b510efe5910c4cec8f182: its one-edge proof gives the upper bound four at (3,1) and leaves attainment open. The new family attains it. The linked credits retain the earlier fiber and normal-triple contributors. Credit @unpaidmoon for PR #7094, headb5f0a0df3d22e8ad40d67d6be4d1c7ff24d180c5: its proof already attains (4,0,5) with five members and discloses substantial Cursor Grok assistance. That instance and the earlier matching upper bound already give its maximum. The new six-member fixture does not claim first attainment. Prepared by Ali Romman with substantial OpenAI Codex assistance, Apache-2.0.Open next questions: classify all even maximizers, or give a legal full-endpoint word on the new alphabet with a complete bill. Neither follows from the maximum theorem, and neither is reserved.