Repository navigation
Compare floor-error budgets using classical Bernoulli inequalities - #20
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.
Compare the linear and multiplicative finite-floor error budgets by a core-Lean proof of the classical integer Bernoulli inequality. The multiplicative paid-offset ratio is no worse where the linear denominator is positive. This compares numerical bounds, not certificate sets whose other assumptions differ.
No frontier novelty is claimed. Depends on PR #19 for the integrated audit sequence, and PR #18 for the product definitions.
Validation: three theorem footprints; 20,301 exact comparisons including zero base; two false statements rejected. Audit included in CI.