Repository navigation
Certify finite descent from source-floor corrected coefficients - #22
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.
Prove accelerated descent by j, and ordinary descent by 2j, from the source-floor corrected coefficient inequality. The criterion uses the actual odd count but no individual odd-state product. No universal eventual certificate or novelty is claimed.
Validation: two Lean theorem footprints; 202,000 horizons with 179,921 valid certificates; two false controls rejected. For sources 2..2000, first certificates matched first descent in 1995 cases and lagged in four; none missing through horizon 200. Largest lag six at source 27. These are finite observations, not completeness evidence. Audit added to CI; depends on integration through PR #21.