pith. sign in
module module high

IndisputableMonolith.NumberTheory.AnnularCost

show as:
view Lean formalization →

The AnnularCost module defines the φ-cost in logarithmic coordinates as f(u) = cosh((log φ) u) − 1, which equals J(φ^u) via the hyperbolic representation of J. Number theorists building analytic traces and carrier-defect comparisons in the Recognition Science framework cite these definitions for cost bounds on annular samples. The module supplies the core function together with elementary properties such as nonnegativity and quadratic lower bounds, all derived from upstream convexity statements.

claimThe φ-cost in log-coordinates is the function $f(u) = cosh( (log φ) · u ) − 1$, which satisfies $f(u) = J(φ^u)$ where $J(x) = ½(x + x^{-1}) − 1$.

background

This module belongs to the NumberTheory section and imports the RS time quantum τ₀ from Constants together with the J-cost and its convexity properties. The central object is the φ-cost expressed in log-coordinates, which converts the multiplicative J-cost into an additive function on the real line via the identity J(x) = cosh(log x) − 1. The Convexity module supplies the strict convexity of Jlog(t) = cosh t − 1 on ℝ, which is foundational for the J-uniqueness step T5.

proof idea

This is a definition module, no proofs. It introduces phiCost directly from the cosh representation, then records the immediate consequences phiCost_zero, phiCost_symm, phiCost_nonneg, phiCost_quadratic_lb, and the coefficient extractions phiCostLinearCoeff and phiCostQuadraticCoeff.

why it matters in Recognition Science

The definitions feed the analytic infrastructure used by AnalyticTrace, ArgumentPrincipleProved, CarrierBudgetComparison, CirclePhaseLift, ContourWinding, and CostCoveringBridge. These modules assemble the axiom-free RH bridge and the carrier-defect budget comparison on circles, placing the annular cost layer inside the cost-covering architecture that closes the Riemann hypothesis route. The module thereby connects the T5 J-uniqueness result to concrete sampling on the phi-ladder.

scope and limits

used by (10)

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 (43)