IndisputableMonolith.NumberTheory.EulerInstantiation
The EulerInstantiation module defines the set of primes as a subset of natural numbers together with prime sums, Hilbert-Schmidt norms, and related carrier objects for the Euler product. Researchers working on the analytic trace and zeta-ledger bridges cite it as the arithmetic base layer for the Recognition Science treatment of the Riemann hypothesis. The module assembles these objects from imported constants, annular costs, and sampled traces with no internal proofs.
claimLet $P = {p in mathbb{N} | p text{ is prime}}$. The module supplies $text{PrimeSum}(sigma) = sum_{p in P} p^{-sigma}$, the squared Hilbert-Schmidt norm of the associated operator, and the Euler carrier $C(s) = det_2(I - A(s))^2 = prod_p (1 - p^{-s})^2 exp(2 p^{-s})$ on the half-plane Re$(s) > 1/2$.
background
Recognition Science places this module inside the number-theory layer that supports the cost-covering bridge for the Riemann hypothesis. It imports the fundamental time quantum $tau_0 = 1$ tick from Constants and the phi-weighted cost $phiCost(u) := cosh((log phi) u) - 1 = J(phi^u)$ from AnnularCost. DefectSampledTrace supplies the annular meshes attached to hypothetical zeta defects, while EulerCarrierComplex upgrades the real-axis carrier to a holomorphic non-vanishing function on Re$(s) > 1/2$. CostCoveringBridge and SampledTrace provide the surrounding architecture that eliminates prior axioms.
proof idea
This is a definition module, no proofs.
why it matters in Recognition Science
The module feeds AnalyticTrace, ArgumentPrincipleProved, CarrierBudgetComparison, ConcreteEulerLedger, ZetaLedgerBridge, and UnifiedRH. It supplies the concrete prime-based ledger and Euler carrier required for the three-component architecture that replaces the former OntologicalPrimeLedger with bounded annular cost. It fills the arithmetic-to-ledger identification step in the RH closure plan and enables the carrier-defect budget comparison on the same circles.
scope and limits
- Does not prove convergence of the Euler product for Re(s) <= 1.
- Does not locate any zeta zeros or establish zero-free regions.
- Does not perform numerical evaluation of sums or determinants.
- Does not contain analytic continuation arguments.
- Does not discharge any hypothesis_interface or scaffolding stubs.
used by (6)
-
IndisputableMonolith.NumberTheory.AnalyticTrace -
IndisputableMonolith.NumberTheory.ArgumentPrincipleProved -
IndisputableMonolith.NumberTheory.CarrierBudgetComparison -
IndisputableMonolith.NumberTheory.ConcreteEulerLedger -
IndisputableMonolith.NumberTheory.ZetaLedgerBridge -
IndisputableMonolith.Unification.UnifiedRH
depends on (7)
-
IndisputableMonolith.Constants -
IndisputableMonolith.Cost -
IndisputableMonolith.NumberTheory.AnnularCost -
IndisputableMonolith.NumberTheory.CostCoveringBridge -
IndisputableMonolith.NumberTheory.DefectSampledTrace -
IndisputableMonolith.NumberTheory.EulerCarrierComplex -
IndisputableMonolith.NumberTheory.SampledTrace
declarations in this module (81)
-
def
Primes -
def
PrimeSum -
def
HilbertSchmidtNormSq -
theorem
hilbert_schmidt_convergent -
theorem
eigenvalue_lt_one -
theorem
eigenvalue_pos -
def
det2Factor -
def
det2LogFactor -
theorem
det2_log_factor_bound -
theorem
det2_log_summable -
theorem
det2_product_convergent -
def
carrierLog -
def
carrierValue -
theorem
carrier_log_convergent -
theorem
carrier_pos -
theorem
carrier_nonvanishing -
def
carrierDerivTerm -
def
carrierDerivBound -
theorem
carrierDerivTerm_nonneg -
theorem
carrierDerivBound_summable -
theorem
carrierDerivBound_finite -
theorem
carrierDerivBound_pos -
theorem
carrier_zeta_identity -
theorem
zeros_in_continuation -
def
primeLog -
def
eulerPrimePowerComplex -
def
eulerDet2FactorComplex -
def
eulerPrimeLogDerivTermComplex -
def
zetaReciprocal -
def
defectSensorCenter -
def
defectSensorCirclePoint -
def
zetaReciprocalOnSensorCircle -
theorem
defectSensorCirclePoint_re -
theorem
defectSensorCirclePoint_mem_strip -
theorem
norm_eulerPrimePowerComplex -
theorem
norm_eulerPrimePowerComplex_lt_one -
theorem
norm_eulerPrimePowerComplex_lt_one_on_sensorCircle -
theorem
one_sub_eulerPrimePowerComplex_ne_zero -
theorem
eulerDet2FactorComplex_ne_zero -
theorem
zetaReciprocal_differentiableAt -
theorem
norm_eulerPrimePowerComplex_eq_rpow -
theorem
norm_eulerPrimeLogDerivTermComplex_le -
theorem
norm_form_eq_carrierDerivTerm -
theorem
norm_eulerPrimeLogDerivTermComplex_le_carrierDerivTerm -
theorem
eulerPrimeLogDerivTermComplex_summable -
theorem
analyticAt_riemannZeta -
theorem
zetaReciprocal_meromorphicAt -
theorem
meromorphicOrderAt_zetaReciprocal -
theorem
zetaReciprocal_order_at_zero -
structure
remembers -
structure
WitnessedDefectSensor -
theorem
zetaReciprocal_local_factorization -
def
eulerQuantitativeFactorization -
theorem
eulerQuantitativeFactorization_logDerivBound -
theorem
eulerQuantitativeFactorization_center -
theorem
eulerQuantitativeFactorization_order -
def
eulerCarrierInstance -
def
eulerRegularCarrier -
theorem
euler_regular_carrier_covers_strip -
def
EulerBudgetUpgradeTarget -
theorem
euler_budget_upgrade_extends_regular -
def
eulerZeroTrace -
def
eulerBudgetedCarrier -
theorem
euler_budget_upgrade_target -
def
eulerCostCoveringPackage -
theorem
argument_principle_sampling -
def
DeprecatedDefectAnnularCostBounded -
theorem
defect_annular_cost_bounded_inconsistent -
theorem
rh_from_complex_analysis_axioms -
theorem
rh_no_zeros_in_strip -
theorem
defect_bounded_impossible -
def
zetaDefectSensor -
theorem
sensor_carrier_compatible -
structure
EulerInstantiationCert -
def
mkEulerInstantiationCert -
theorem
euler_rh_conditional -
theorem
riemann_hypothesis_euler_conditional -
def
eulerSampledBudgetedCarrier -
theorem
eulerSampledBudgetedCarrier_scale_zero -
def
eulerSampledPackage