pith. the verified trust layer for science. sign in
def

hpOperator

definition
show as:
module
IndisputableMonolith.NumberTheory.HilbertPolyaFunctionField
domain
NumberTheory
line
52 · github
papers citing
none yet

plain-language theorem explainer

Number theorists working on explicit realizations of the Hilbert-Pólya conjecture in the function field setting cite this definition of the operator for an elliptic curve over F_q. It produces the 2x2 real matrix with off-diagonal entries given by the Frobenius angle θ determined by the field cardinality q and the trace a. The implementation is a direct matrix literal that references the angle computation.

Claim. Let $q$ be a natural number and $a$ an integer. The Hilbert-Pólya operator $T_E$ is the $2×2$ real matrix $[[0, θ], [θ, 0]]$, where $θ$ is the Frobenius angle of the elliptic curve with Frobenius trace $a$ over the field with $q$ elements.

background

This module constructs an explicit self-adjoint operator whose eigenvalues coincide with the imaginary parts of the nontrivial zeros of the zeta function of an elliptic curve over a finite field. The construction is unconditional because the Riemann hypothesis holds in the function field case by Weil's theorem. The Frobenius angle θ satisfies cos θ = a/(2√q) and is guaranteed real by the Hasse-Weil bound. Upstream dependencies include the definition of the Frobenius angle together with foundational structures for periods and minimizations.

proof idea

The definition is a one-line wrapper that builds the matrix by placing the Frobenius angle in the off-diagonal positions and zeros on the diagonal.

why it matters

The operator defined here is the central object in the theorem hilbert_polya_elliptic_curve, which proves self-adjointness and identifies the eigenvalues with the zeta zero imaginary parts. It completes the function-field Hilbert-Pólya statement for elliptic curves, as described in the module documentation. This provides a concrete matrix model that aligns with the self-similar fixed point and octave structures in the Recognition Science forcing chain, though the primary contribution is the unconditional verification in the function field setting.

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