feat(opening): prove affine binder exact - #70
Conversation
![chatgpt-codex-connector[bot]](https://avatars.githubusercontent.com/in/1144995?s=60&v=4){kind=small}
There was a problem hiding this comment.
💡 Codex Review
Here are some automated review suggestions for this pull request.
Reviewed commit: 7685eafc92
ℹ️ About Codex in GitHub
Your team has set up Codex to review pull requests in this repo. Reviews are triggered when you
- Open a pull request for review
- Mark a draft as ready
- Comment "@codex review".
If Codex has suggestions, it will comment; otherwise it will react with 👍.
Codex can also answer questions or update the PR. Try commenting "@codex address that feedback".
| `ExactOpeningStep` interface. Every false affine claim and every committed | ||
| three-bit syndrome expose a false coordinate child. |
There was a problem hiding this comment.
When claim.linear = 0 and claim.claimed ≠ 0, run immediately returns .reject, so no false coordinate child is exposed. The module contract therefore overstates the result for this valid class of false claims; qualify the statement with the nonzero-functional assumption or say that false claims either reject or expose a false child.
AGENTS.md reference: AGENTS.md:L21-L22
Useful? React with 👍 / 👎.
1 participant
What does this change?
Packages the four-coordinate affine binder as an exact opening step and proves completeness and false-claim rejection. The result is finite semantic exactness and does not assert an asymptotic resource bound.
How was it tested?
lake build --wfailpasses on stacked tip16b7318lake lintpasses on stacked tip16b7318sorryor new axioms, or this PR does not change Lean proofsgit diff --checkpasses