Skip to content

Mode-fiber rounding radius R ≤ 3/2 via a balancing lemma (no κ) - #6333

Merged
Mister-Meeseeks merged 1 commit into
CrocSwap:mainfrom
apoursh:research/mode-fiber-radius-three-halves
Oct 31, 2026
Merged

Mister-Meeseeks merged 1 commit into
CrocSwap:mainfrom
apoursh:research/mode-fiber-radius-three-halves

Conversation

@apoursh

@apoursh apoursh commented Oct 31, 2026

Copy link
Copy Markdown
Contributor

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:

  1. Centre x at its nearest integer vector.
  2. Take a vertex of the fiber polytope in [−½,½]^112. All but at most 8 rows land exactly at ±½. Snapping the rest leaves a demand u ∈ L with ‖u‖∞ ≤ 4.
  3. Balancing lemma. Each block of 8 rows has one pinned coordinate and three free ones, so it splits into four sign-free pairs worth ±2e_j each. With a rainbow matching in every block, each coordinate gets 7 pairs. Making one or two blocks straight fixes the parity class of u in H8. That leaves 6–10 pairs per coordinate against a demand of at most 4.
  4. Set eᵢ = (sᵢ + κᵢ)/2 ∈ {−1,0,1}. Then the error is at most 1 + ½.

Verification

Scope

  • This is a property of the exact-mode contract only. Complete κ and the selected frontier are unchanged.
  • It is not a claim that any caller needs the contract.
  • It supplies no physical rounder, error or tape bill.
  • R = 1 stays open; TASK.json records the next step and its blocker.

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

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>
@Mister-Meeseeks
Mister-Meeseeks merged commit e06834e into CrocSwap:main Oct 31, 2026
2 checks passed
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

None yet

Projects

None yet

Development

Successfully merging this pull request may close these issues.

2 participants