pith. machine review for the scientific record. sign in
theorem proved term proof

closure_populates_next

show as:
view Lean formalization →

No prose has been written for this declaration yet. The Lean source and graph data below render without it.

generate prose now

formal statement (Lean)

 341theorem closure_populates_next (n : ℤ) :
 342    PhiForcingDerived.ledgerCompose (PhiForcing.φ ^ n) (PhiForcing.φ ^ (n + 1)) =
 343    PhiForcing.φ ^ (n + 2) := by

proof body

Term-mode proof.

 344  unfold PhiForcingDerived.ledgerCompose
 345  exact fibonacci_cascade n
 346
 347/-- **Rung Generation**: Every rung k ≥ 2 is the ledger composition
 348    of the two preceding rungs. Starting from rung 0 (= 1, ground state)
 349    and rung 1 (= φ, forced by T4 + T6), repeated application generates
 350    all rungs: 0,1 → 2 → 3 → 4 → ...
 351
 352    This is not a cost bound — it is a structural IDENTITY from closure. -/

depends on (31)

Lean names referenced from this declaration's body.

… and 1 more