Skip to content

Prove sharp edge-matching image bounds at every pattern dimension (no κ) - #7692

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

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

Conversation

@aliromman

@aliromman aliromman commented Nov 18, 2026 •

Copy link
Copy Markdown
Contributor

Result and scope

The sharp universal joint-image maxima are 2k in total and 2k-1 for irreducible action, at every pattern dimension k>=1. This scoped proof concerns binary rank-one idempotents with nonzero off-diagonal patterns. Matrix units are allowed. The collection need not be complete or have independent images.

Read the proof, exact receipt, verifier and scope record. If nu is the maximum matching size of the graph of matrix units in the pattern space, the stronger bounds are 2 dim(V)<=3k+nu, and 2 dim(V)<=3k+nu-1 for a nonzero irreducible image. The total bound is sharp for every pair (k,nu). Complete attaining pools are given. Sharpness for each fixed edge graph or each refined irreducible pair is not claimed.

The new argument extends the disjoint-relation proof to two-member circuits. Their edge endpoints are disjoint, so they form a matching. A full-pool equality argument gives the strict irreducible bound. This removes exponential growth from the earlier universal edge-quotient estimate. That predecessor's graph-specific bound can still be smaller and remains valid. The known three-dimensional total maximum six and two-edge irreducible maximum five are prior results.

No new kappa, paid BIT word, native operator or complete invoice is supplied. The selected frontier and all five assumptions remain unchanged. A scalar image bound does not provide a legal paid construction. This completes the advance claim.

Evidence and reproduction

Normal and optimized CPython 3.12.16 replay passed on macOS arm64. The verifier checks all 224036 image-basis collections of sizes one through three at widths three and four; 202057 have nonzero patterns, including 1236 with two-member circuits. It checks all 2825 pattern spaces at width three, with separate raw rank-one scans and literal-pattern lifts. All nonzero-vector orbit checks identify 1166 irreducible pools and verify the strict bound.

All 65 total attaining families with 1<=k<=10, 0<=nu<=k, and eight irreducible families with 1<=k<=8 pass complete-pool checks over 20917 nonzero patterns. The irreducible examples have exact star/Gram certificates; those of image dimension at most nine also pass 677 direct nonzero-vector orbit checks. Controls distinguish overlapping edges from a matching, reject coordinate projectors, retain the unchanged prior five-projector witness, and check both a column-triple equality case and an orthogonal triple whose extra edge prevents equality.

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. The unbounded claims rest on the written proof, not the finite census.

With CPython 3.12 and its standard library, from the repository root:

python3.12 -I -W error -B research/edge-matching-image-bound/verify.py
python3.12 -I -W error -B -O research/edge-matching-image-bound/verify.py
python3.12 -B scripts/research_package.py --package research/edge-matching-image-bound
python3.12 -B scripts/check_research_commit.py --package research/edge-matching-image-bound --check-source-history --check-modes

Expected markers:

PASS_EDGE_MATCHING_IMAGE_BOUND
PASS_REGISTERED_RESEARCH_PACKAGE
PASS_RESEARCH_COMMIT_BYTES

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. Full predecessor package replays, selected cold replay, Lean and Docker were not run. The exact PR #6782 witness was 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-relation method and reused matrix/lift routines. Its proof retains unpaidmoon's normal/column block credit. Ali Romman's PR #7691, exact proof, supplies the column-support invariant lemma. The needed arguments are restated in full.

@CubeJerry supplied the edge-quotient bound and five-projector two-edge core in PR #6782, exact proof. That source credits Nick Petalas's PR #5921 for the fiber theorem, proved again here. Nick Petalas (@petalas) supplied the one-edge pattern-three exclusion in PR #6785, exact proof. CubeJerry's PR #6838, exact proof, already gives the universal pattern-three total bound six. Those special cases are not relabelled as new. Credit details separate proof inputs, reused routines and context. New work is Apache-2.0.

Base: canonical main e54523517d0f03e58352e647c403a5af3e525a57, priority revision 8. Card bit-new-register-model, scope changed to an edge-allowed scalar theorem; the native construction gate remains unmet. Refreshed open/closed PR and Discussion overlap and live handoffs show no competing general matching-bound claim. Sparse local and unpublished work remain coverage limits. Further construction must specify the legal alphabet, relation lattice, endpoint basis, counted roles and complete producer/consumer invoice.

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