structure
definition
DefectSensor
show as:
view math explainer →
open explainer
Generate a durable explainer page for this declaration.
open lean source
IndisputableMonolith.NumberTheory.CostCoveringBridge on GitHub at line 103.
browse module
All declarations in this module, on Recognition.
explainer page
depends on
used by
-
analytic_rh -
carrier_side_obstruction -
charge_zero_of_covered -
floorCovered_iff_charge_zero -
rh_chain_summary_legacy -
argument_principle_honest -
argument_principle_trivial -
honest_argument_principle_phase_family -
rh_from_single_axiom -
ArgumentPrincipleSensorCert -
zeta_zero_gives_charged_sensor -
boundaryTransportCert_iff_rh_core -
divergence_witnesses_boundary_of_cert -
no_cost_divergent_sensor_of_boundary_transport -
carrier_defect_budget_contradiction -
carrier_defect_comparison_rh -
defect_cost_exceeds_carrier_budget -
defect_floor_exceeds_any_bound -
mkSharedCirclePair -
mkSharedCirclePair_carrier_excess_bounded -
SharedCircleFamilyPair -
primeEulerEvent_mem_sensorEulerLedger -
reciprocal_primeEulerEvent_mem_sensorEulerLedger -
sensorEulerLedger -
sensorEulerLedger_balanced -
sensorEulerLedger_cost_formula -
sensorEulerLedger_identification -
sensorEulerLedger_net_flow_zero -
sensor_realPart_pos -
defectWindingData -
defect_winding_eq_charge -
CostCoveringCert -
CostCoveringCert -
defect_cost_unbounded -
DefectTopologicalFloorCovered -
defect_topological_floor_unbounded -
not_DefectTopologicalFloorCovered -
rh_from_cost_covering -
riemann_hypothesis_conditional -
canonicalDefectSampledFamily
formal source
100
101/-- A defect sensor at a point ρ: the field ζ(s)⁻¹ has a pole of
102 order m at ρ (where m is the multiplicity of the zero of ζ). -/
103structure DefectSensor where
104 /-- The multiplicity of the zero (= order of the pole of ζ⁻¹). -/
105 charge : ℤ
106 /-- The real part of the zero location. -/
107 realPart : ℝ
108 /-- The zero is in the right half of the critical strip. -/
109 in_strip : 1/2 < realPart ∧ realPart < 1
110
111/-! ### §3. The explicit cost-covering package -/
112
113/-- An explicit carrier package for the RS cost-covering bridge.
114
115This is the honest replacement for the former naked axiom. Any consumer of the
116bridge must now supply a concrete `BudgetedCarrier` witness for the realized
117carrier trace. -/
118structure CostCoveringPackage where
119 carrier : BudgetedCarrier
120
121/-- The remaining topological step in the RH bridge: the defect topological
122floor must be controlled by the same carrier scale. -/
123def DefectTopologicalFloorCovered (pkg : CostCoveringPackage) (sensor : DefectSensor) : Prop :=
124 ∀ N : ℕ, annularTopologicalFloor N sensor.charge ≤ carrierBudgetScale pkg.carrier
125
126/-! ### §4. The conditional Riemann Hypothesis -/
127
128/-- The uniform charge ring sample exactly saturates the topological floor. -/
129theorem uniformRingSample_cost_eq_topologicalFloor (n : ℕ) (m : ℤ) :
130 ringCost (uniformRingSample n m) = topologicalFloor (n + 1) m := by
131 unfold ringCost topologicalFloor uniformRingSample
132 simp [Finset.sum_const, nsmul_eq_mul]
133