Repository navigation
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
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.
A common merge frame does not establish the source-normal retention used to apply #6315's merge lemmas when public relays are allowed. Exact receiver-covering walks expose that missing implication; the Lean theorem statements themselves are not refuted. Prove the repaired bound total+(k-1)tau >= 7k+sum(eta_c), recovering 8k under explicit source-normal retention.
Base: 2485805.
Audited #6315: 3667554. Exact source blobs/hashes: PREDECESSOR.json and SOURCES.json.
Reproduce (CPython 3.12, stdlib):
Expected: PASS_REGISTERED_RESEARCH_PACKAGE.
Executed: four normal/optimized primary and independent commands; all 247 carrier subsets, two actual endpoint-chart examples, 2,457 small-lattice instances and 383 independent dimension tuples. Wrong geometry and missing source/coverage hypotheses reject. Sixteen actual source/manifest/receipt corruptions reject; committed bytes/modes, export integrity and read-only Git-free replays pass. Fixed exhaustive domains; no random search. Complete remote tree equals the tested tree.
No new κ. This is an abstract-walk premise audit and scoped dimension proof, not a cheaper dirty-restored physical program or a counterexample to the pair floor 14. Purity/restoration, full-span and no-cover implications remain open; all five framework assumptions remain. No Lean build, hosted CI, selected cold replay or complete-history preflight claimed.
Prepared for @CubeJerry with substantial OpenAI Codex assistance, including separate source/geometry review. Credit Matarener (#6315) and DreamingOfClouds (#6030), with retained lineage. Apache-2.0.
Proof, validation and open questions:
https://github.com/CubeJerry/integer-mult-bounds/tree/f3bebf8236dec18dea8ec6b714a12dda6cf25243/research/carrier-merge-relay-premise