What was already known
Cima, Gasull and Mañosas reduced the problem to a reciprocal family with symmetric coefficients and settled several orders. Gasull’s survey asked whether the five known families exhaust the possibilities at every order.
AI involvement
John F. Rudge reports that Claude found the proof and wrote the Lean development. Rudge set the task, supplied relevant papers and directed the work from individual orders to the general case.
- Rudge’s classification theorem and proof
- Rudge’s AI disclosureProvenance statement
Importance
The result completes the classification at all orders. The proof uses growing perturbations of a simpler recurrence to rule out periodicity across whole families of coefficients.
Technical verification
The pinned challenge states both directions for the common-period condition and the five coefficient families. Rudge reports that Comparator matched the solution to the challenge, with acceptance by Lean, nanoda and con-ron using the three standard axioms.
Formal checking
The pinned challenge states both directions for the common-period condition and the five coefficient families. Rudge reports that Comparator matched the solution to the challenge, with acceptance by Lean, nanoda and con-ron using the three standard axioms.
- Checker
- Lean, nanoda and con-ron, reported by Rudge and Palomar
- Scope
- Both directions of the common-period classification
- Basis
- Reported by the linked checker
- Pinned Lean statement of Gasull’s Problem 11
- Palomar checking recordComparator and independent kernel report
Human understanding
Rudge says he understands the statement and some of the proof strategy. He identifies the detailed argument as a gap in his understanding.
Correction and publication history
Newly reviewed classification of globally periodic rational recurrences at every order, with central Claude work and reported checking of the exact equivalence.
Read this published revision