IndisputableMonolith.NumberTheory.EulerInstantiation
EulerInstantiation supplies the set of primes as a subset of the naturals together with prime sums and Hilbert-Schmidt norms that instantiate the real-axis Euler carrier for the Recognition Science zeta construction. Analytic-trace and RH-bridge modules cite it for the concrete arithmetic data. The module consists entirely of definitions and supporting lemmas with no top-level theorem.
claimLet $\mathbb{P} \subset \mathbb{N}$ be the set of prime numbers. The module also introduces the prime-sum function over $\mathbb{P}$ and the squared Hilbert-Schmidt norm on the associated carrier operator.
background
The module sits inside the NumberTheory domain and imports the RS time quantum $\tau_0$, the J-cost framework, annular sampling, and the cost-covering bridge. Its immediate purpose is to realize the real-axis Euler product that EulerCarrierComplex later lifts to the half-plane Re$(s) > 1/2$. The supplied doc-comment identifies the central object as the set of primes inside $\mathbb{N}$.
proof idea
This is a definition module, no proofs.
why it matters in Recognition Science
It supplies the arithmetic foundation consumed by AnalyticTrace, ArgumentPrincipleProved, CarrierBudgetComparison, ConcreteEulerLedger, ZetaLedgerBridge, and UnifiedRH. These modules use the prime data to eliminate former axioms and close the ledger-to-zeta identification required for the T1-bounded realizability architecture.
scope and limits
- Does not define or prove properties of the Riemann zeta function itself.
- Does not contain the complex-analytic Euler carrier.
- Does not address defect sampling or annular cost bounds.
- Does not implement the argument principle or contour integration.
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