CUT arithmetic periodicity with a preperiod

What Lean checks

The uniform terminating decision test and exhaustive candidate enumeration are proved for every finite cut set and proposed arithmetic tail. Compact quotient/residue certificates identify both actual example games at every pile size and prove least eventual period 12, saltus 8, and earliest start 7, hence positive-pile preperiod 6.

Collection · Catalogue · Verification · Lean status

Result

Dailly et al., Open Problem 4: finite arithmetic-periodicity test; both examples have preperiod 6, period 12, saltus 8.

Proof and sources

Read the proof for the original problem, assumptions, argument, and cited sources. These notes are unrefereed.

Verification

Run from the repository root:

python3 results/cut-arithmetic-periodicity/verify.py

See the verification guide for dependencies and the distinction between computational checks and formal proofs.

Formalization

The general finite decision test, exhaustive candidate enumeration, and both concrete games are completely formalized. The decision construction proves exact graph, lower-value, and actual-option recognizers for every finite cut set and proposed finite-prefix arithmetic sequence.

CutPeriod.Weight.both_games_exact identifies the actual recursively defined games for cuts {1,2,8} and {1,2,7,8} with the stated sequence at every pile size, including zero. Both have least positive eventual arithmetic period 12, saltus 8, and earliest period-12 start at pile 7, hence preperiod 6 on positive piles. The proof uses finite quotient/residue tables, a proved collision bound, and explicit lower-option constructions. It does not depend on the unfinished large higher-pile automata certificates.

All seven new modules passed source checks and the ownership-based axiom audit; all 23 modules in their exact project closure passed independent kernel replay. See the general Lean proof, the concrete proof plan, and the status report.

Supporting files