The Hypothesis, Stated Four Ways

Three classical equivalents, and one native to the presence grammar

Reference · 2026

The Riemann hypothesis has many equivalent forms. Three below are classical and standard; the fourth is native to the presence grammar developed here, and is stated in a language in which every numeral is formed by strokes [the numeral zero stands outside the inventory]. Setting them side by side is the clearest short account of what this programme adds.

The classical statement

Let \(\zeta\) be the Riemann zeta function and let

\[ \xi(s)=\tfrac12 s(s-1)\pi^{-s/2}\Gamma\!\left(\tfrac{s}{2}\right)\zeta(s) \]

be the completed function, which is entire and satisfies \(\xi(s)=\xi(1-s)\) and \(\xi(\bar s)=\overline{\xi(s)}\).

RH, classical.

Every nontrivial zero of \(\zeta\) has real part \(\tfrac12\).

Three equivalents

R1 — reality of \(\Xi\).

Every root of \(\Xi(t)=\xi(\tfrac12+it)\) is real.

R2 — the mirror axis.

Every exit locus of \(\xi\) is fixed by the involution \(s\mapsto 1-\bar s\).

R3 — orbit size.

Every exit-locus orbit under the Klein four-group generated by \(s\mapsto 1-s\) and \(s\mapsto\bar s\) has size at most two — together with the classical fact that \(\xi\) has no real exit loci.

A fourth form sometimes offered — detection by sign change — stands beside the three unconditional equivalents: a root of odd multiplicity produces a sign change, but a root of even multiplicity need not.

The native statement

In the presence grammar the literal zero-locus sentence does not form: the grammar contains neither a numerical zero term nor a sentence constructor comparing a presence-valued evaluation with such a term. What forms instead is a statement about records. An exit-locus record consists of a positively presented parameter together with a certificate that the declared evaluation procedure ran to completion there. Both are positive data; the withheld value stays a metalanguage judgment.

RH, native.

For every certified exit-locus record of the completed prime-fused descent, the presented parameter is fixed by the mirror-axis involution: \(s = 1-\bar s\).

The adopted theory \(\mathsf P^{\dagger} = \mathsf P + \mathrm{Adm}_{\zeta}\) derives this sentence. Under the named analytic interface \(I\),

\[ I(\mathrm{Adm}_{\zeta}) \Longleftrightarrow \mathsf{RH}_{\mathrm C}, \]

so the classical hypothesis is the reading the interface makes of the adopted native law — and it enters at that interface and nowhere else.

The resolution, at its own registers.

\(\mathsf P^{\dagger}\vdash\mathsf{RH}_{\mathrm M}\) is a native proof. \(\mathrm{Adm}_{\zeta}\) is present in \(\mathsf P^{\dagger}\) by declaration, sponsored by \(\alpha_{\zeta}\), at a fork the independence theorem proves inhabited on both sides: over the declared base, class-wide Admission and its counter-inscription are each witnessed by a finite model in exact rationals. Under the interface, \(\mathsf{RH}_{\mathrm C}\) accordingly holds, with the verdict carrying its sponsor on its face. The register convention is the mechanism by which each of these statements names its sponsor. The interface is a definition, and a definition is its own warrant. The sponsor is the terminal constructor: by the Selection Jump a coherent family forms by a presented family, by a generator with a presented uniform keeping law, or by an explicit sponsor; the Emmerson–Buchanan barrier hierarchy forces the second into ladders, and the third forms the seal. Sealed, sponsored, armed: that is the final form a verdict on this question takes. The companion paper Deprogramming Zero proves why the sign was the obstacle, reads the Admission law on the prime side as Lagarias positivity and Li’s criterion, and states the resolution with its trace.

Why the content lies beyond symmetry

R2 and R3 are statements about symmetry, which invites the thought that symmetry might settle the matter. The witness settles it: there is an explicit polynomial carrying every symmetry named above and an off-axis quartet besides. Watch it fail →

Sources