Repository navigation
Count shared Schur-product rank pairs without matrix enumeration (no κ) - #4803
Merged
Mister-Meeseeks merged 1 commit intoOct 23, 2026
Conversation
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.
Summary
Scoped counting proof with exact finite corroboration. Adds an explicit finite-field joint law for nullity(H) and nullity(I-H), then substitutes it into ssafwann's #4678 binary sharp Schur-header theorem.
The dependence between the shifted ranks is retained. The bound counts arithmetic summands, not bit operations or a measured speedup. At d=4 with sector dimensions (4,4,4,4), the sharp split-pair count is 962018618785136640000 and the identity-pivot split-pair count is 8291457123053721102581760. Complete-header counts multiply these by |GL_12(F2)|. Those values are formula evaluations, not a GL_16 census. No new kappa or selected-frontier change.
This contribution was produced by Nick Petalas. Credit ssafwann #4678/#4671/#4657 for the header law, U/A factors and six-map setting; Nick Petalas #4597/#4278 and earlier header lineage; Ryanson Jonathan, lee-phys, Cinna Davis, source527, commdata2338 and Jose Manuel for the context retained in the package. Subspace inclusion-exclusion and Gaussian coefficients are classical. No historical priority claim for general finite-field enumeration is made. The cited predecessor theorem is a dependency, not the audit target.
The advance CLAIM and TASK.json record the explicit change from formal-interface-lemma to this algebraic side result. Only the six files in research/schur-rank-pair-law are added.
Evidence
Before, #4678 states that its exact shared-product sum is not efficient at large d and evaluates it through d=3. After, PROOF.md derives a double-sum joint law and gives the polynomial-summand substitution, including all disjointness and graph-lift factors.
From the repository root:
Any CPython 3.12 interpreter can replace the local path. Expected markers are PASS_SCHUR_RANK_PAIR_LAW, PASS_REGISTERED_RESEARCH_PACKAGE and PASS_RESEARCH_COMMIT_BYTES. Standalone verification uses only the standard library and writes no files. Publication/source-history checking requires full Git history.
Limitations and unrun obligations
The universal joint-nullity claim rests on the written proof. Finite execution corroborates the declared domains. The application assumes ssafwann's one-block binary header theorem, including its completion multiplicity; no later full-guard recursion is claimed. The executable formula domain is capped at d<=32 and prime-power q<=64, while the written formula is general. The literal matrix census is separately capped.
Physical request ensembles, header selection/emission, reads, dirty compensation/restoration, dispatch, precision, stock and complete consumer costs remain unknown. This supplies neither a physical supplier nor a complete multiplication theorem. Independent human and formal proof-kernel review are unclaimed. Lean, Docker and the selected scientific cold replay were not run. Every registered local check ran.
Related open work
Before DONE, this account's open PRs were refreshed. Nine, including this PR, were created since the CLAIM at 2026-10-22 20:12:56 UTC. Their titles/scopes and the related Schur/header bodies were read.
The remaining new account PRs #4804/#4805/#4808/#4809/#4810 concern right-vector factor costs or target counts over coefficient algebras. They do not assert this shared-product multiplicity or one-block Schur-header count. No conflicting overlapping value was found within the refreshed coverage.
The merged #4678 is the direct mathematical dependency. Its three displayed example counts agree exactly under the new regrouping as listed above. The live first-pivot/invertible-commutator and scalar-central-spectrum claims concern other state/count questions and are excluded from this scope. Canonical main remains 624de9d, priority revision 7. Submission overlap covered 326 open PR bodies and 3,754 Discussion records with complete remote pagination, supplemented by distinctive all-main README/merged-PR searches. Sparse local notes, arbitrary code diffs and unpublished work remain outside complete coverage.
Open next questions
CI notes
Both hosted checks passed on contribution head
7fceedc146a3f4dc53e99a304c9e03461af36342in run 39848046038: plan in 2m44s and the registered research/schur-rank-pair-law replay in 2m0s. Run metadata confirms this exact head and conclusion success. The registered replay executes both warning-strict normal and optimized verification commands. Every registered local check, committed-byte/source-history preflight, export integrity and read-only Git-free replay also passed. Hosted CI certifies these bounded executions; independent human and formal proof-kernel acceptance of the universal proof remain unclaimed.Merge danger
Door: two-way. Blast radius: package. This isolated addition changes no shared implementation, predecessor source, frozen evidence or selected-frontier file.