Repository navigation
Prove the downward rounding contract for across-cell Gaussian entries - #4449
Merged
Mister-Meeseeks merged 1 commit intoOct 22, 2026
Merged
Conversation
This was referenced Oct 21, 2026
Mister-Meeseeks
pushed a commit
that referenced
this pull request
Oct 22, 2026
…act exponent, repair lemma, sharpness; no new κ) Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com>
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.
PR #4442 leaves the across-cell inequality
0 <= H[i,i+h] <= n[i,h]as a rounding premise. This package supplies the missing caller instantiation: the original square-gap exponent is exactlypi*j/kwith nonnegative integerj, so the retained negative-exponential contract and two-ulp subtraction/clipping produce a P-grid coefficient with0 <= n-H < 4*2^-P.The repair itself is credited predecessor work. The addition is the exact integer argument, a written proof covering cell transitions and physical period cuts, the across-cell perturbation allowance, and a separately written rational checker. It also demonstrates why the bare Toeplitz kernel is the wrong argument and why later nearest rounding to a coarser grid can undo the guarantee.
Start with the proof and scope and the exact receipt. Only the new six-file package is changed.
Evidence at
1fb77b377f570ca84a89a465b2ee4ce8674b7159:Reproduce from the repository root:
Boundary: this proves the coefficient guarantee when the stated routine is used. It does not establish that an existing online page generator uses it, audit #4442's halo/minimality argument, run a Schur/native/selected cold replay, or prove an unconditional multiplication theorem. The numerical checker uses its own rational enclosure oracle, not an implementation of the published fast exponential routine. No new kappa is claimed; the selected
23/10000is unchanged. Hosted CI is separate from the local evidence.Sources and coordination: started from canonical main
2a13eb1827784206202db90e5dc8327cf8a250db, priority revision 7; canonical main was fetched again before submission and was unchanged. The handoff is #4442 atd079c2b058ebd3d7a9ff424113b095bf61175427; its unmerged objects are not replay dependencies. All live source pins are from main. Discussion #4444 is the canonical investigation, linked from the #1166 handoff. Final overlap refresh at 21:15–21:17 UTC paginated 303 open PRs, 3,294 Discussion records and 3,787 closed PRs, and searched all 5,731 tracked top-level note paths at the base. This is bounded text coverage, not an exhaustive diff search or novelty claim.Credit James Reed, the retained RaD phase-cell producer/reviewer, Vlado Vojdanovski/PR1673, Chafik Boukhalfa, Cinna Davis, Ryanson Jonathan, David Harvey and Joris van der Hoeven, and the full lineage recorded in the README. Existing directed-rounding work by Mason Hale and Dugongue is acknowledged. Prepared for mihir-s-05 with substantial OpenAI Codex assistance; no subagents. Apache-2.0.