pith. machine review for the scientific record. sign in

Explain the Lean def `zeroFreeCriterion_of_honestPhaseCostBridge` in module `IndisputableMonolith.NumberTheory.AnalyticTrace`. 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. The page will refresh to your answer when it’s ready.
confidence: high in recognition cached

The declaration zeroFreeCriterion_of_honestPhaseCostBridge is a noncomputable definition in module IndisputableMonolith.NumberTheory.AnalyticTrace.

(1) In plain English it takes a witness hb of type HonestPhaseCostBridge (a structure asserting that honest zeta-derived phase families have bounded realized annular cost) and assembles a complete ZeroFreeCriterion structure. The four fields are filled by: (a) the already-proved bound on the logarithmic derivative, (b) the proved non-vanishing of the carrier on the strip, (c) the proved honest phase-family construction, and (d) the charge-zero conclusion obtained by feeding hb into the auxiliary lemma charge_zero_of_honest_phase_of_costBridge.

(2) In Recognition Science this supplies the missing analytic-route bridge to the Riemann Hypothesis. The ZeroFreeCriterion contract encodes the honest-phase target; once instantiated, the theorem rh_from_zero_free_criterion immediately yields that no WitnessedDefectSensor can have nonzero charge, which is the formal statement of the zero-free criterion.

(3) The formal statement is read as: noncomputable def name (hb : HonestPhaseCostBridge) : ZeroFreeCriterion where field1 := term1; field2 := term2; .... In Lean this is a structure constructor; each field is an explicit lambda or identifier that satisfies the corresponding field type of ZeroFreeCriterion. The noncomputable marker indicates the definition relies on noncomputable constants imported from Mathlib or upstream modules.

(4) Visible dependencies inside the supplied source are the structure HonestPhaseCostBridge, the structure ZeroFreeCriterion, the lemmas carrierDerivBound_pos, carrier_nonvanishing, honest_argument_principle_phase_family, and the auxiliary theorem charge_zero_of_honest_phase_of_costBridge. All are defined or imported within the same module file.

(5) The declaration does not prove the existence of any HonestPhaseCostBridge instance, does not prove that the honest sampled family actually satisfies bounded total annular cost, and does not prove the Riemann Hypothesis itself; it only shows that any such bridge would immediately produce a ZeroFreeCriterion and therefore the analytic-route RH statement direct_rh_from_honestPhaseCostBridge.

cited recognition theorems

outside recognition

Aspects Recognition does not yet address:

  • Existence of any concrete HonestPhaseCostBridge instance
  • Proof that the honest sampled family has bounded total annular cost (only excess is proved bounded)
  • The full Riemann Hypothesis; only the conditional analytic route is formalized

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.