Descent target is the census

NOT A NOVELTY CLAIM. This is a machine-checked formalisation, checked by the Lean 4 kernel and depending on no axiom. It is dated and citable. Prior art, where it exists, is cited below. No discovery is claimed.

The target is the census theorem, recomputed rather than repeated: ΣF(7..10).

Proposition

fib 7 + fib 8 + fib 9 + fib 10 = 123

Proof

By decide in wave-57-extraction-verified.lean. Checked by the Lean kernel: it depends on no axiom.

Sources and identifiers

• Lean source · src/pair/lean/proofs/wave-57-extraction-verified.lean
• Typeset paper · src/research/lean-theorems.tex
• Repository deposit · doi:10.5281/zenodo.21787144
• Author · ORCID 0009-0000-7312-9778

Proved in the same file

• First descent is six
• The descent is strictly monotone
• Remaining falls with the count
• The distance to the target round trips on the record
• Merging strictly decreases
• Line ceiling is fibonacci

All machine-checked theorems