IndisputableMonolith.NumberTheory.AnalyticTrace
The AnalyticTrace module supplies the sampled Euler CostCoveringPackage for any σ₀ > 1/2, built from zero-winding certificates on the contour rather than synthetic zero-charge traces. Researchers on the analytic RH route in Recognition Science cite it for delivering honest zeta-derived phase data. The module assembles this package from upstream annular J-cost and contour winding results.
claimThe module defines the CostCoveringPackage for the sampled Euler carrier at σ₀ > 1/2, where the package encodes J-cost covering derived from the zero winding number of the holomorphic nonvanishing function on the contour.
background
The module operates in the NumberTheory domain after the RS cost-covering architecture is made realizable. It imports AnnularCost, where phiCost u := cosh((log φ)·u) − 1 = J(φ^u), and ContourWinding, which packages WindingData (center, radius, integer winding charge) and proves zero winding for holomorphic nonvanishing functions. ArgumentPrincipleProved eliminates the argument_principle_sampling axiom, upgrading the analytic route toward honest witnessed ζ⁻¹ phase-family data. Constants supplies the RS time quantum τ₀ = 1 tick.
proof idea
This is a definition module that packages the CostCoveringPackage from the zero-winding certificate. It composes the imported results on annular J-cost, contour winding, and the proved argument principle into a single sampled object for σ₀ > 1/2.
why it matters in Recognition Science
The module feeds HonestPhaseAdmissibility, which defines the admissibility predicate for honest zeta-derived phase data and proves equivalence to the charge-zero conclusion needed by AnalyticTrace.ZeroFreeCriterion. It advances the analytic RH target in the Recognition Science cost-covering bridge, using the zero-winding certificate to narrow the phase-family data.
scope and limits
- Does not prove the Riemann Hypothesis.
- Does not apply for σ₀ ≤ 1/2.
- Does not use synthetic zero-charge traces.
- Does not replace the full CostCoveringBridge architecture.
used by (1)
depends on (13)
-
IndisputableMonolith.Constants -
IndisputableMonolith.Cost -
IndisputableMonolith.NumberTheory.AnnularCost -
IndisputableMonolith.NumberTheory.ArgumentPrincipleProved -
IndisputableMonolith.NumberTheory.ContourWinding -
IndisputableMonolith.NumberTheory.CostCoveringBridge -
IndisputableMonolith.NumberTheory.EulerCarrierComplex -
IndisputableMonolith.NumberTheory.EulerInstantiation -
IndisputableMonolith.NumberTheory.HonestPhaseBudgetBridge -
IndisputableMonolith.NumberTheory.MeromorphicCircleOrder -
IndisputableMonolith.NumberTheory.SampledTrace -
IndisputableMonolith.NumberTheory.ZeroCompositionInterface -
IndisputableMonolith.Unification.UnifiedRH
declarations in this module (28)
-
def
eulerSampledCoveringPackage -
theorem
floorCovered_iff_charge_zero -
theorem
carrier_side_obstruction -
theorem
charge_zero_of_covered -
structure
ZeroFreeCriterion -
theorem
rh_from_zero_free_criterion -
structure
HonestPhaseCostBridge -
theorem
charge_zero_of_honest_phase_of_costBridge -
def
zeroFreeCriterion_of_honestPhaseCostBridge -
theorem
direct_rh_from_honestPhaseCostBridge -
theorem
honestPhase_routeC_bottleneck -
structure
HonestPhaseChargeZeroBridge -
theorem
charge_zero_of_honest_phase_of_chargeZeroBridge -
def
zeroFreeCriterion_of_honestPhaseChargeZeroBridge -
theorem
direct_rh_from_honestPhaseChargeZeroBridge -
structure
VectorCChargeZeroBridge -
theorem
charge_zero_of_honest_phase_of_vectorC -
def
zeroFreeCriterion_of_vectorC -
theorem
direct_rh_from_vectorC_bridge -
theorem
analytic_rh -
theorem
direct_rh_from_zero_free_criterion -
theorem
rh_frontier_inventory -
theorem
rh_chain_summary_legacy -
theorem
HonestPhaseCostBridge_of_rh -
theorem
HonestPhaseCostBridge_iff_rh -
theorem
honestPhaseCostBridge_of_EBBA -
def
zeroFreeCriterion_of_EBBA -
theorem
direct_rh_from_EBBA_via_analytic