pith. sign in
theorem

involutionOp_shiftOp

proved
show as:
module
IndisputableMonolith.NumberTheory.HilbertPolyaCandidate
domain
NumberTheory
line
181 · github
papers citing
none yet

plain-language theorem explainer

The reciprocal involution intertwines each prime-shift operator with its inverse on the multiplicative index space. Number theorists exploring operator models for the Riemann hypothesis would reference this symmetry. The argument reduces the operator equation to an identity on basis elements via direct simplification and commutativity of addition.

Claim. Let $U$ be the reciprocal involution operator and $V_p$ the shift operator for prime $p$ on the free real module over multiplicative indices. Then $U V_p = V_p^{-1} U$.

background

The module builds an algebraic candidate for a Hilbert-Pólya operator on the free real module whose basis is the multiplicative index space (free abelian group on the primes, isomorphic to the positive rationals under multiplication). The cost function J from Recognition Science supplies the diagonal operator, while the reciprocal symmetry J(q) = J(1/q) induces the involution operator U that sends each basis vector to its reciprocal index. Shift operators V_p implement multiplication by the prime p. The local setting is the algebraic skeleton of this candidate; the module explicitly states that it does not prove the spectrum matches the imaginary parts of zeta zeros.

proof idea

The term-mode proof extends the operator equality to a general vector v, applies the single-action lemmas for shiftOp, involutionOp and shiftInvOp, then reduces the resulting exponents via the abelian group law on the index space.

why it matters

This supplies one of the four structural properties assembled in the master certificate hilbert_polya_candidate_certificate. It realizes the functional-equation symmetry s ↔ 1-s at the operator level, using the reciprocal property of J that follows from the Recognition Science forcing chain. The same relation is invoked to prove that the involution preserves the prime-hop operator V_p + V_p^{-1}.

Switch to Lean above to see the machine-checked source, dependencies, and usage graph.