Globally periodic rational difference equations of arbitrary order

Get email updates

John F. Rudge

A recurrence of any positive order whose next value is a ratio of two affine functions with nonnegative real coefficients has a common period for all positive initial states exactly when it comes from one of five known recurrences by positive rescaling and unfolding. Each affine function must have at least one positive coefficient, counting the constant term. Unfolding multiplies the index gaps by a positive integer.

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 AI-led

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.

Importance Notable

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 Formal (Lean, nanoda and con-ron)

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

Human understanding Few

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

2026-11-08 · publication

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