feat: verify polynomial-coefficient recurrences - #902
Conversation
There was a problem hiding this comment.
💡 Codex Review
Here are some automated review suggestions for this pull request.
Reviewed commit: 553877483f
ℹ️ 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".
There was a problem hiding this comment.
💡 Codex Review
Here are some automated review suggestions for this pull request.
Reviewed commit: d3866c2c56
ℹ️ 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".
d3866c2 to
6dccf52
Compare
There was a problem hiding this comment.
💡 Codex Review
Here are some automated review suggestions for this pull request.
Reviewed commit: 6dccf52bc0
ℹ️ 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".
There was a problem hiding this comment.
💡 Codex Review
Here are some automated review suggestions for this pull request.
Reviewed commit: b55b346f64
ℹ️ 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".
Summary
Adds bounded exact evaluation and independent verification for polynomial-coefficient linear recurrences.
combinatorics.recurrence.p_recursive.evaluatecombinatorics.recurrence.p_recursive.verifycompanionp_j(n)canonically in ascending rational powersPREFIXprojection, bound recurrence order, and every exact residual over the required consecutive rangeCloses #900.
Why
A held-out
gpt-5.4-miniaudit of Tong Niu's 2026 proof of Mathar's OEIS A176677 recurrence correctly refused Jacobian's constant-coefficient recurrence tool, then made an unsupported late arithmetic error and falsely reported that the recurrence failed at n=16. The new exact capability computes the correct final valuea(16)=3949969and independently verifies zero residuals over the declared finite range.This does not prove a recurrence for all indices or derive it from an external theorem. Production remains
COMPUTED; only the standard-libraryFractionchecker can returnVERIFIED.Validation
make check— 880 unit tests passed; Ruff, format, complexity, and mypy passedmake check-static— dependency, dead-code, architecture, typing, and package-build checks passedmake docs-linkcheckandgit diff --check— passedFocused adversarial coverage includes omitted, duplicate, out-of-order, out-of-range, and boolean result records; a corrupted late candidate; an exact A176677 regression through n=16; and rejection when the leading coefficient polynomial vanishes at a required step.