pith. sign in
module module high

IndisputableMonolith.NumberTheory.LogicRH_From_RCL

show as:
view Lean formalization →

This module assembles RH decomposition data that augments the classical analytic stack with an explicit recovered-prime-ledger component. The primeLedgerLogic field records transport equivalence from LogicNat primality atoms to the classical ledger. Researchers deriving the Riemann Hypothesis from the Recognition Composition Law cite it for the arithmetic recovery step. The module is a composition layer with no new proofs, importing directly from RH_From_RCL and LogicPrimeLedgerAtom.

claimRH decomposition data over classical fields in $ℕ,ℂ$ equipped with a primeLedgerLogic component recovered from LogicNat via the transport equivalence LogicNat.toNat.

background

The module sits in the NumberTheory domain and extends the final assembly of RH_From_RCL, whose only remaining nontrivial datum is BoundaryTransportCert, the explicit RS physical bridge transporting annular collapse to the T1-bounded Euler ledger boundary. It incorporates LogicPrimeLedgerAtom, the first recovered-number adapter stating primality on LogicNat and transporting it through the recovery equivalence LogicNat.toNat. The classical field is retained so the analytic zeta stack continues to speak Mathlib's $ℕ$ and $ℂ$.

proof idea

This is a definition module, no proofs.

why it matters in Recognition Science

The module supplies the recovered prime ledger needed by the downstream siblings riemann_hypothesis_from_rcl_logicPrime and rh_from_rcl_logicPrime_completion_boundary. It completes the arithmetic ledger recovery inside the RS physical thesis data logic, linking the logic-native atoms to the classical Euler ledger boundary.

scope and limits

depends on (2)

Lean names referenced from this declaration's body.

declarations in this module (6)