pith. sign in
module module high

IndisputableMonolith.NumberTheory.HilbertPolyaCandidate

show as:
view Lean formalization →

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

used by (1)

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

depends on (1)

Lean names referenced from this declaration's body.

declarations in this module (29)