pith. sign in
module module high

IndisputableMonolith.NumberTheory.DefectSampledTrace

show as:
view Lean formalization →

DefectSampledTrace constructs AnnularMesh objects from DefectPhaseFamily data by sampling each ring at the canonical 8n equispaced angles. Researchers closing the RS cost-covering bridge for the Riemann hypothesis cite it when realizing concrete defect traces on circles. The module consists entirely of definitions that link phase families to annular cost bounds via the imported AnnularCost and MeromorphicCircleOrder machinery.

claimFor a defect phase family $F$, the sampled trace yields an annular mesh by evaluating $F$ at the $8n$ equispaced angles $2k/8n$ on each ring of radius $r_n$.

background

The module operates inside the NumberTheory layer of Recognition Science and imports the annular J-cost framework, the cost-covering bridge, and meromorphic circle order. From AnnularCost the key object is phiCost u := cosh((log φ)·u) − 1 = J(φ^u). From MeromorphicCircleOrder a meromorphic function with order n at ρ factors locally as (z−ρ)^n g(z) with g analytic and g(ρ)≠0. The module supplies the concrete sampling step that turns an abstract DefectPhaseFamily into a realizable AnnularMesh for later budget comparisons.

proof idea

This is a definition module, no proofs.

why it matters in Recognition Science

The module supplies the sampled defect data consumed by ArgumentPrincipleProved (eliminates argument_principle_sampling axiom), CarrierBudgetComparison (carrier-defect budget comparison on the same circles), EulerInstantiation (Euler product instantiation of the RS carrier/sensor framework), and HonestPhaseBudgetBridge (perturbation witness for honest phase families). It fills the canonical 8n sampling step required by the RS cost-covering architecture for RH.

scope and limits

used by (4)

From the project-wide theorem graph. These declarations reference this one in their body.

depends on (3)

Lean names referenced from this declaration's body.

declarations in this module (25)