Repository navigation
Mode-fiber rounding radius R ≤ 3/2 via a balancing lemma (no κ) - #6333
Merged
Mister-Meeseeks merged 1 commit intoOct 31, 2026
Merged
Mister-Meeseeks merged 1 commit into
Mister-Meeseeks merged 1 commit into
Conversation
Theorem D: snapping a vertex of the centred fiber polytope to +-1/2 reduces exact mode-preserving rounding to a signed balancing problem that the block pair structure of the PR4933 mode matrix solves outright. With the CrocSwap#6312 lower bound this gives 1 <= R <= 3/2, superseding the R <= 2 of CrocSwap#6320. Standard-library exact verifier and constructive rounder included. 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.
Summary
New package
research/mode-fiber-radius-three-halves. It continues the merged #6320, which partly answered #6312's open question.Theorem D: R ≤ 3/2. With #6312's lower bound, the least uniform ℓ∞ radius of exact mode-preserving rounding for the PR4933 mode matrix M now satisfies 1 ≤ R ≤ 3/2. This replaces the R ≤ 2 of #6320 (Theorem C). The bound holds for every x, with no genericity assumption.
Argument. It is shorter than #6320's and needs neither its genericity reduction nor its Hall lemma:
Verification
verify.pyuses the standard library and exact arithmetic, and runs in about 5 s, both normally and with-O. It checks:rounder.py, covering all three parity cases (worst error 503/336).research_package.py --check-onlyprints PASS_PACKAGE_METADATA_AND_PINS. The Python 3.12 replay is left to CI.Scope
AI assistance: Anthropic Claude (Claude Code) found the argument, wrote the code and ran the checks under apoursh's direction (disclosed in TASK.json).
🤖 Generated with Claude Code