Repository navigation
Prove identity-pivot Schur dimension bounds; attain 4d (no κ) - #4657
Merged
Mister-Meeseeks merged 1 commit intoOct 22, 2026
Merged
Conversation
This was referenced Oct 22, 2026
This was referenced Oct 22, 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.
Change and mathematical scope
PR #4634 leaves open what changes when both leading blocks must be identities. This adds one self-contained package,
research/identity-pivot-schur/, proving that for commuting binary idempotents with leading blocksI_dand Schur-commutator rank2d:n >= L(d) = min_{t=0,...,d} max(3d+2t, 4d-3t) >= ceil(17d/5). In particular the unrestricted-pivot optimumn=3dis impossible.n=4dfor everyd>=2, improving Binary commuting projectors attain the Schur-commutator bound 2d for every d at n=5d (follow-up to #4597 OQ2 and #4609; no new κ) #4617's identity-pivot5dfamily.4dis optimal within the class whereH+H^2is invertible, with H the leading block of PQ.The proof specializes Nick Petalas's ordered factorization to
K=ABand derivesBA=[[J,0],[J,J]], whereJ=H+H^2. Rank-nullity and the four joint-sector projectors give the lower bounds. A four-block change of basis supplies the upper bound. README Sections 1–3 contain the complete argument and a literal 8-by-8 witness.No new κ, header density, physical caller or supplier admission. At this package's first publication the unrestricted identity-pivot minimum lay between L(d) and 4d. Successor PR #4671 now closes that gap with the exact minimum n(H)=4d+nullity(H+H²) for every prescribed leading block H of PQ, hence 4d for all d>=2. Universal claims rest on the written proof, not extrapolation from samples.
Task and overlap
Canonical base and submission refresh:
b58ad9ef4d4e861b0eaa5dba41742bdc072dca51, priority revision 7, selected conditional κ=0.00302015. Head:b79f90bc8d839a4998a40b10bcb437e87baa8397.Handoff-first scope, coordinated in Discussion #4653 and the #1166 reply.
formal-interface-lemmais explicitly marked changed to a written algebraic side result, rather than a Lean formalization or selected-caller audit.Nearest predecessors: #4597 (
dfeb8ca7, factorization), #4609 (eb5ccf92, scalar witness), #4617 (96c01a21, 5d family), #4634 (9f053f70, unrestricted 3d optimum and this open question). Full hashes and source paths are in TASK.json. All four heads were unchanged on the final live check.The final overlap refresh covered 426 open PR bodies (14:27 UTC), 3,588 Discussion records (14:29 UTC), and every one of 5,862 in-scope local notes, with no coverage warnings. It located the credited open question and this claim, not a duplicate result. This is not a search of every diff, closed PR or unpublished result.
Validation
Python 3.12.11 / macOS arm64, standard library only:
-I -O -B, no Git checkout andPATH=/nonexistent; all six export files, including its receipt, remain unchanged.research/identity-pivot-schur; the working tree is clean.Pending predecessors are citations, not replay-time Git dependencies. The two attributed scalar control matrices are contained in the checker. No predecessor executable is imported.
No independent human or formal-kernel review is claimed. Lean, Docker and the selected scientific cold replay were not run. The separate selected baseline attempt stopped at an omitted sparse-checkout checkpoint; no baseline pass is claimed. Hosted CI is separate from these local results. The Registered research packages run on exact head
b79f90bc8d839a4998a40b10bcb437e87baa8397reportsaction_required: a maintainer must approve the fork workflow before it can run. No hosted replay pass is claimed.Credit
Nick Petalas supplies the block-Schur factorization and #4278/#4259/#4228 lineage; Ryanson Jonathan supplies the binary scalar witness and 5d tensor family; lee-phys supplies the unrestricted 3d construction, reused binary seeds and explicit identity-pivot question. Cinna Davis supplies the earlier BIT request/header setting. Predecessor AI disclosures and Apache-2.0 attribution are retained.
Prepared for ssafwann with substantial OpenAI Codex (gpt-6-astra) assistance, by one agent. No shared code, frozen evidence or selected frontier changes.
Open next questions
The original singular-J dimension question is answered by successor PR #4671: sharpness requires n>=4d+nullity(J), and the bound is attained for every H. The remaining complete-header counting question and its scope are recorded there and in Discussion #4653. This PR retains the first proof, bounds, construction and verification artifact unchanged.