Explain the Lean def `lyapunovAt` in module `IndisputableMonolith.Astrophysics.PICSimulationLyapunov`. Write for an educated reader who knows science and programming but may not know Lean. Cover: (1) what the declaration says in plain English, (2) why it matters in Recognition Science, (3) how to read the formal statement, (4) visible dependencies or certificates in the supplied source, and (5) what this declaration does not prove. Cite only declarations present in the supplied Recognition source.

1. Plain English Translation

The declaration lyapunovAt defines a mathematical sequence representing the numerical heating rate (Lyapunov exponent) of a plasma simulation at different discrete resolution levels. For a given resolution "rung" $k$, the exponent is calculated as the golden ratio $\phi$ raised to the power of $-k$.

2. Why it Matters in Recognition Science

Recognition Science posits that fundamental physical and informational structures scale geometrically along a $\phi$-ladder. This module applies that principle as an empirical HYPOTHESIS to particle-in-cell (PIC) simulations. It predicts that the artificial chaos (numerical heating) introduced by discrete macro-particles falls off at canonical $\phi$-steps as resolution (number of macro-particles per Debye cell, $N_{ppc}$) increases. The docstring notes empirical benchmarks suggesting that a doubling of $N_{ppc}$ improves the exponent by $\phi^2$, structurally tying numerical plasma kinetics to the same canonical ratios found elsewhere in the framework.

3. Reading the Formal Statement

def lyapunovAt (k : ℕ) : ℝ := referenceExponent * phi ^ (-(k : ℤ))

• (k : ℕ): The function takes a natural number $k$, representing the resolution rung.
• : ℝ: It returns a real number.
• The value is calculated by taking referenceExponent (which is defined as 1) and multiplying it by $\phi^{-k}$.

4. Visible Dependencies and Certificates

In the supplied module, this definition serves as the basis for a formal structural certificate, picLyapunovCert, which rigorously bundles three proved THEOREMS:

• lyapunovAt_pos proves the exponent is always strictly positive.
• lyapunovAt_succ_ratio proves that moving one step up the ladder ($k+1$) equals the previous step multiplied by $\phi^{-1}$.
• lyapunovAt_adjacent_ratio formally proves the ratio between adjacent rungs is exactly $\phi^{-1}$.

5. What this Declaration Does Not Prove

The Lean code MODELS the theoretical sequence and proves its internal algebraic consistency. It does not mathematically prove that an actual computer code executing a PIC simulation will generate this heating rate. The mapping between the abstract lyapunovAt sequence and actual computational physics output is an empirical PREDICTION, requiring physical simulation data (such as the cited Dawson or Birdsall-Langdon benchmarks) for falsification or confirmation.