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.
Result
Scoped proof. An exact-sum Gaussian-pair rounder with Euclidean error at most one can have finite global least period
mexactly when4dividesm. Its sharp outward norm slack iswhere
Ris the least odd integer at least five that does not dividem. The proof joinsm/4four-cycles in the sum-one fiber into one cycle of lengthm). Alternating the switches between opposite sides of adjacent rings keeps all new edges at error one. The chosen position places their absolute radial changes below the sharp bound. At exact period eight the optimum issqrt(19)-sqrt(13)`.This contribution was produced by Nick Petalas. aliromman's #7714 at
ba5e006ed70119b23d6ef9e2e8627e43a3f4f18bsupplies the lower bound and starting map. CubeJerry's #7570 supplies the annular matching, and aliromman's #7699 and #6509 supply the ring lower-bound framework and the Gaussian transform. Advance claimEvidence and reproduction
Both verifier modes checked 20 orbits through period 13,860, 16,940 Gaussian edges, 8,430 switched successors and four controls. Each registered command took under 0.1 seconds locally on macOS arm64. The written proof covers all admissible periods.
Run from the repository root with CPython 3.12.15 and the standard library.
The two verifier modes print
PASS_GAUSSIAN_ROUNDER_EXACT_PERIOD. The metadata and commit preflight printPASS_REGISTERED_RESEARCH_PACKAGEandPASS_RESEARCH_COMMIT_BYTES.Limitations
The proof uses the iterate theorem as a cited premise. The predecessor replays, selected cold replay, Lean, Docker and physical caller checks were unrun. Independent human and formal proof-kernel review are unclaimed. Physical caller admission, tape and stock pricing and any change to κ remain open.
Open next questions
Identify a physical caller that requires a prescribed least period. The first step is to specify its row and address schedule before pricing the splice predicate, coordinate arithmetic and workspace restoration.
Related open work
CI notes
The registered normal and optimized replays and the committed-byte/source-history preflight passed locally. The plan job and both package replays passed on
5f51e20e702c99f2bf1c878e17c72efac98f2136. Hosted run 44400042294This PR carries the shared CI-doc and replay-gap sync used by other open PRs. The current-status tests and historical replay-gap package passed locally.