Repository navigation
Prove multiplicative floor-error budgets at arbitrary odd counts - #18
Merged
Merged
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
1 participant
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.
The linear affine-error budget becomes trivial once the odd count reaches its floor weight. Multiply the individual odd-step factors to obtain an exponential paid-offset bound that remains informative at every odd count.
Assumptions are explicitly finite prefix lower survival. This proves no universal descent or convergence; priority is unassessed. Depends on PR #17's floor definitions.
Validation: six core Lean theorem footprints; 278,684 product checks, including 192,568 beyond the linear budget; 1,001 sharp factor controls; 84,000 two-endpoint band budgets; two false statements rejected. Audit added to CI.
The two-endpoint product budget eliminates the source without an initial upper bound. Established product/minimum methods are documented against Simons–de Weger §3.2; no frontier novelty is claimed.
Strict product spread now produces accelerated and standard exits within twice the horizon. The bounded comparison checks 98,910 product and 55,137 linear certificates, including 44,824 additional product certificates; no universal coverage is claimed.