closure_populates_next
plain-language theorem explainer
Ledger composition of entries at scales φ^n and φ^{n+1} produces an entry at φ^{n+2} for integer n. Researchers tracing the generative structure of the phi-ladder from T6 closure cite this result to show how the ground state populates all higher rungs. The proof is a one-line term reduction that unfolds ledgerCompose and invokes the fibonacci_cascade identity.
Claim. For any integer $n$, the additive ledger composition of scales $φ^n$ and $φ^{n+1}$ equals the scale $φ^{n+2}$.
background
The StillnessGenerative module shows that the unique zero-defect ground state x=1 is not passive but forces non-trivial structure via the T0–T8 chain. LedgerCompose is the additive operation on ledger entries that follows from T6 closure on geometric scales. PhiForcing.φ denotes the golden ratio fixed point forced by self-similarity (T6). The phi-ladder is the discrete sequence of scales φ^k for k ∈ ℤ generated by repeated composition starting from rung 0 (=1) and rung 1 (=φ).
proof idea
The term proof first unfolds the definition of PhiForcingDerived.ledgerCompose, then applies the fibonacci_cascade lemma at n to obtain the required equality.
why it matters
This is the population step that realizes the Fibonacci cascade quoted in the module doc-comment: repeated application of the identity φ^n + φ^{n+1} = φ^{n+2} generates the entire ladder from the initial rungs forced by T4, T5 and T6. It supplies the structural mechanism behind the claim that x=1 is the maximally creative source, without introducing external assumptions. No downstream uses are recorded yet.
Switch to Lean above to see the machine-checked source, dependencies, and usage graph.