IndisputableMonolith.NumberTheory.HilbertPolyaCandidate
This module defines MultIndex as the finitely supported functions from primes to integers, indexing the multiplicative group of positive rationals. Researchers formalizing the cost operator T_J in Recognition Science would cite it when building the state space for spectral analysis. The module supplies supporting definitions and lemmas on toRat and costAt with no proofs.
claimLet $M$ be the set of finitely supported functions from the primes to $Z$. The map toRat sends each such index to an element of $Q_{>0}^×$, and costAt evaluates the J-cost at that index.
background
The module sits in the NumberTheory domain and imports only Mathlib and IndisputableMonolith.Cost. Its central definition, MultIndex, is described as the index for the multiplicative group $Q_{>0}^×$: a finitely-supported function from primes to integers. Sibling definitions include toRat (conversion to rationals), costAt (evaluation of the cost function), StateSpace (finite-support states), and the diagonal and shift operators diagOp and shiftOp.
proof idea
This is a definition module, no proofs.
why it matters in Recognition Science
The module supplies the state space and index structure required by the downstream module CostOperatorRegularity, which constructs the dense domain $D$ of finite-support states and states the three regularity sub-conjectures for the cost operator $T_J$. It therefore supplies the concrete objects on which essential self-adjointness, discrete spectrum, and trace-class properties are later imposed.
scope and limits
- Does not prove any spectral properties of the cost operator.
- Does not reference the forcing chain T0-T8 or the Recognition Composition Law.
- Does not define the cost operator $T_J$ itself.
- Does not address the alpha band or mass ladder.
used by (1)
depends on (1)
declarations in this module (29)
-
abbrev
MultIndex -
def
toRat -
def
costAt -
theorem
toRat_zero -
theorem
toRat_pos -
theorem
toRat_add -
theorem
toRat_neg -
theorem
costAt_neg_eq -
abbrev
StateSpace -
def
diagOp -
theorem
diagOp_single -
def
shiftOp -
theorem
shiftOp_single -
def
shiftInvOp -
theorem
shiftInvOp_single -
def
involutionOp -
theorem
involutionOp_single -
theorem
involutionOp_involutive -
theorem
involutionOp_diagOp_comm -
theorem
involutionOp_shiftOp -
theorem
involutionOp_shiftInvOp -
theorem
shiftOp_shiftInvOp -
theorem
shiftInvOp_shiftOp -
def
primeHop -
theorem
involutionOp_primeHop -
def
candidateOp -
theorem
involutionOp_sum_primeHop -
theorem
involutionOp_candidateOp -
theorem
hilbert_polya_candidate_certificate