Pith. sign in

Explain the Lean def `picLyapunovCert` 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.

Big AI job. Grok 4.3 reads the canon and writes a Lean-grounded derivation; usually 20 seconds to 2 minutes. Your answer will appear below.
confidence: high in recognition cached

(1) Plain English

The declaration picLyapunovCert builds a concrete instance of the PICLyapunovCert structure. This structure bundles three proved properties of the function lyapunovAt k, which gives the Lyapunov exponent at PIC resolution rung k (higher k means finer macro-particle resolution and lower numerical heating). The properties are: the exponent is always positive; it multiplies by phi⁻¹ on each rung increase; and the ratio between adjacent rungs is exactly phi⁻¹. In short, it certifies that the Lyapunov scaling follows the golden-ratio ladder with no exceptions.

(2) Why it matters in Recognition Science

Recognition Science predicts that plasma-kinetic instabilities and numerical heating in particle-in-cell simulations lie on the same self-similar phi-ladder that governs recognition cost, Turing patterns, and boson mass ratios. The certificate supplies a machine-checked witness for the structural claim that doubling N_ppc reduces the exponent by the factor phi⁻¹, matching the phi² canonical scaling noted in the module docstring.

(3) How to read the formal statement

PICLyapunovCert is a Lean structure with three fields, each a ∀ k : ℕ statement:

  • lyapunov_pos : ∀ k, 0 < lyapunovAt k
  • one_step_ratio : ∀ k, lyapunovAt (k + 1) = lyapunovAt k * phi⁻¹
  • adjacent_ratio : ∀ k, lyapunovAt (k + 1) / lyapunovAt k = phi⁻¹ The definition picLyapunovCert then supplies the three theorems that inhabit these fields. In standard math notation this is simply the conjunction of positivity, geometric decay by phi⁻¹, and the exact adjacent ratio.

(4) Visible dependencies or certificates

The definition directly references lyapunovAt_pos, lyapunovAt_succ_ratio, and lyapunovAt_adjacent_ratio. These rest on the definitions lyapunovAt and referenceExponent, which in turn import phi from IndisputableMonolith.Constants. The module header states zero sorry and zero axioms.

(5) What this declaration does not prove

It does not derive the phi scaling from the J-cost functional equation, does not connect to the forcing chain or Alexander duality, and does not address empirical falsifiers or calibration to laboratory PIC data.

outside recognition

Aspects Recognition does not yet address:

  • Empirical comparison to Dawson 1983 or Birdsall-Langdon 2004 data
  • Derivation of the phi-ladder from the J-cost uniqueness theorem or Universal Forcing chain

recognition modules consulted

The Recognition library is at github.com/jonwashburn/shape-of-logic. The model is restricted to the supplied Lean source and instructed not to invent theorem names. Treat output as a starting point, not a verified proof.