Repository navigation
Conversation
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 proof over F₂, produced by Nick Petalas. Fix an
n × nfirst factorAin the ordered identity(I+xA)(I+xB)(I+xC)=(1+x)I. Prescribe the multiplicitiesb,cof1+xin the companion determinants. A completion exists exactly whenA³=A²andb,care nonnegative integers withb+c=n-rank(A²). Ifr=rank(A+A²), the minimum ordinary rank sum isThe lower bound comes from
BC=A+A². Explicit blocks attain both companion rank bounds together. The shared two-dimensional block comes from unpaidmoon's #7027 at1ba2ac5adfe58fbe9dba34d50d4e5d30633ce3d0. Credit aliromman for the paired-star setting in #5747 and the idempotent-leading classification in #7706 at79ff656972d66915977e816b23ffdcef42fb0e12.The
joint-query-controllercard changes scope to the algebraic rank requirement for this stage. Canonical basee54523517d0f03e58352e647c403a5af3e525a57. Advance claim.Evidence
The earlier example gives one non-idempotent first factor with a completion. The proof gives the exact minimum for every fixed first factor and admissible split. The replay explicitly multiplies all 232,576 candidate pairs with non-idempotent first factors through dimension three, finds minima in 345 feasible valuation fibers, and checks 930 attaining block witnesses through dimension ten. Reversing one companion pair is rejected.
From the repository root with CPython 3.12.15 and the standard library:
Both registered modes pass locally in 0.90 seconds each and print
PASS_PAIRED_STAR_FACTOR_RANK pairs=232576 fibers=345 witnesses=930 controls=1. Committed bytes and source history also pass.The proof covers the formal stage and ordinary rank. Native frames, owned storage, restoration, the full signed caller invoice and any κ improvement remain open. The full selected replay, native and Lean replays, independent human review and formal proof-kernel review were unrun.
Open next questions
T.Related open work
CI notes
This PR carries the shared CI-doc and replay-gap sync used by other open PRs.
All six current-status tests and the registered historical replay passed locally on CPython 3.12.15. The base planning test failed on the stale CI guide in #7732 and #7734.
All three hosted checks passed on
60cb1ef9a197b76b7c9c55536b6629a4837919a9: planning, the historical replay-gap package, and the paired-star factor-rank package. CI run