Repository navigation
Prove sharp seven- and nine-line rational anchor-box floors - #3420
Merged
Mister-Meeseeks merged 1 commit intoOct 18, 2026
Merged
Conversation
This was referenced Oct 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.
Nine rational lines with three totals, nonzero diagonal pairings and nonempty canonical tied sets admit an anchor box of six. The same proof gives five at seven lines. Exact duplications of Aaron Wang's PR #2978 core attain both bounds.
The new analytic matrix theorem works over any field: a rank-at-most-three nine-by-nine matrix with nonzero diagonal has disjoint ordered nonzero blocks of sizes 3+3 or 4+2. A six-row dichotomy, seven-row consequence and exchange across two diagonal bases prove the result. PR #3409's asymmetric label construction transfers it to the rational box contract. The alternative 4+2 matters:
diag(J5,J2,J2)refutes the narrower claim that two disjoint triples must always exist.The focused package is
research/fstar-nine-line-floor/, containing the proof, exact constructor, sharp fixtures, finite controls, source pins and open next questions. The sharpness argument is analytic: a box meeting all three fixture blocks would require a rank-three binary label-dot matrix with target labels in a two-dimensional space.Validation: registered Python 3.12.15 normal and isolated/optimized/warnings-as-errors replay, package metadata/source pins, exact frozen-source lineage, publication source history and whitespace checks. The controls exercise directed ordering, the rank/diagonal/tie/parity hypotheses, both cycle-minor branches, diagonal-basis reconstruction, bipartite-family classification, and counterfeit-source rejection before execution. Same-session agent audits checked the argument and package; these are not human acceptance or formal proof checks.
Attribution: DreamingOfClouds's PR #1590/#2111 definitions, Aaron Wang/navinor's PR #2914/#2978/#3031 box/SG/core lineage, the related Arham Tahir PR #3105 classification, and the PR #3332/#3393/#3409 finite-floor work are retained. The independent oracle is copied unchanged from corrected PR #3393 at
8e1e574fa68465dc0ec69d07852266b9597f9597; it is reused checking code, not a newly independent implementation. Exact provenance is inSOURCES.json.Coordination: canonical claim and handoff. This continues PR #3409's nine-line question from refreshed canonical main; no selected-frontier change.
Limits: analytic proof, not formal verification or an exhaustive matrix census. Nonempty ties remain an explicit hypothesis. The full F-star supplier and the eleven-line floor-seven question remain open; κ is unchanged.