results register.

every theorem, criterion, identity, computation and open problem from the descent programme around the chebyshev trace, filed by thread and stamped with how it stands. nothing here claims the riemann hypothesis.

entries
55
proved
41
lean-checked
7
numerical
18
conjectures
8
open problems
3

Register entries

55 of 55 entries shown

cubic descent & trace · criterion (RH-equivalent)

chebyshev trace criterion

proved

RH holds if and only if |u_n| ≤ u₀ for every n, where u_n = Σ θ_ρ T_n(1 − 2θ_ρ) and θ_ρ = −27/(4q(ρ)²); equivalently (u_n) is bounded, or limsup |u_n|^{1/n} ≤ 1.

A Chebyshev trace criterion for the Riemann hypothesis

cubic descent & trace · criterion (RH-equivalent)

eleven-way equivalence chain

proved

RH ⇔ zeros of K in (−∞, −27/4] ⇔ Hankel positivity ⇔ Hausdorff/beta ⇔ compact Jacobi ⇔ completely monotone boundary ⇔ |u_n| ≤ u₀ ⇔ bounded ⇔ generating function holomorphic on the disk ⇔ Carathéodory ⇔ Schur.

The cubic descent of the Riemann xi function (merged manuscript)

cubic descent & trace · criterion (RH-equivalent)

one hankel tower

proved

RH ⇔ the single unshifted Hankel tower [m_{i+j}] built from the cubic descent moments is positive semidefinite for every size; the cubic geometry supplies the support restriction.

The cubic descent of the Riemann xi function

cubic descent & trace · identity

local formula for u₀

provednumerical

Unconditionally u₀ = (4/3)(ℓ(2) + ℓ′(2)) + (1/24)ℓ′(½) = 0.15496752570039314..., with ℓ = ξ′/ξ; every u_n is a rational linear form in finitely many derivatives of ξ′/ξ at 2 and ½.

Digits certified by ball arithmetic.

A local formula for the zeroth Chebyshev trace

cubic descent & trace · theorem

square-root resolution frontier

proved

Within the finite local reflection-invariant polynomial class generated by h₀...h_n, the γ⁻² escape exponent of a high off-line zero is optimal (Bernstein–Walsh); e-folding scale n ≍ γ²/|η|.

Circle trace (v4)

cubic descent & trace · conditional theorem (RH)

criticality: zero margin

proved

Under RH, limsup u_n = u₀ exactly (Dirichlet simultaneous approximation), with near-extremal indices of positive lower density; no bound |u_n| ≤ (1 − δ)u₀ can hold.

A tangent uniformization of the cubic descent

cubic descent & trace · theorem

support theorem

proved

The trace measure is supported in |φ| ≤ φ₁ = 0.36601674861975873..., sharpening the Hausdorff normalization 27/4 to B(γ₁)² = 203.805426808998669...

A tangent uniformization of the cubic descent

cubic descent & trace · identity

exact escape law

proved

An off-line zero escapes at rate g_ρ = 2|Re arcsinh(√(27/4)/q(ρ))| = √27|η|/γ²(1 − (η² + 21/8)/γ² + ...).

A tangent uniformization of the cubic descent

cubic descent & trace · theorem

unconditional boundary law

proved

F(X) = XK′/K = (√X/4)log(√X/2π) + O(log X) and log K(X) = πN(√X) + O(log² X), unconditionally.

A tangent uniformization of the cubic descent

cubic descent & trace · open problem

the completed trace bound

open

Open Problem 11.1: the completed cubic positivity / completed trace bound left open by the descent papers.

Circle trace / cubic descent

cubic descent & trace · open problem

the δ₀ gap

open

The proven frontier is a hard constant δ₀ ≈ 1.87×10⁻³; the heuristic prediction is four orders of magnitude better. Close the gap.

The cubic descent of the Riemann xi function

cubic descent & trace · theorem

boundary-layer calculus for prime filters

proved

Near s = 2 the two orders of operation split; the regularized seed is g₀ = (2μ/3)(E_{2,2}(z²) − 1) with E_{2,2}(z²) = sinh z/z, and successive diagonals g_j = μ^{−j}p_j(D)g₀ with p_j(n) = (−1)^j(2n+1)_j L_j(n).

A boundary-layer calculus for Chebyshev prime filters

hardy & hamburger · theorem

critical hardy-space contraction

proved

In χ = (s − 2)/(s + 1), the trace has a Schur factorization with multiplier φ = ψ², φ(0) = 16/27, and the uniform bound ∫e^{−3x}|Π_n|² = O(1); the remaining obstruction is localized to interior poles of ξ′/ξ in the critical disk.

A critical Hardy-space contraction for the cubic Chebyshev trace

hardy & hamburger · theorem

isometric-arc sharpness

proved

|φ| = 1 on the arc {1 + 2cos θ ≥ 0}, so lim‖Gφ^m‖² > 0: inner/outer factorization cannot upgrade the uniform bound to decay.

A critical Hardy-space contraction for the cubic Chebyshev trace

hardy & hamburger · criterion (RH-equivalent)

self-weighted hamburger rigidity

proved

With v_ρ = −(ρ − ½)⁻², RH ⇔ [τ_{i+j+1}] ⪰ 0 for all sizes, with no simplicity hypothesis; Pick-kernel realization.

Self-weighted Hamburger rigidity for the Riemann xi function

hardy & hamburger · identity

discriminant transport

provedlean

Disc(F_Z)·E_M^{4M−1} = D_M^{4M+1}; the finite statements are checked in Lean 4 / Mathlib with no sorry, and the certification boundary is stated explicitly.

Hamburger rigidity and discriminant transport in the cubic descentlean: finite statements

visibility & horizon · theorem

conservation of visibility

proved

A vantage point at horizontal offset b from the critical line carries exactly 2π·min(b, δ) of visibility along Re s = ½ + δ; to first order the visibility rate is δ times the vantage's angular speed.

How far can you see a rogue zero?

visibility & horizon · theorem

no free lunch

proved

Fixed vantages are parabolically blind (rate of order δ/γ²); for any m vantage points some height below T is seen at rate at most πmδ/T.

How far can you see a rogue zero?

visibility & horizon · theorem

the cubic edge

proved

For γ ≥ 12, |θ(ρ)| ≤ 27/(4γ²) and g(ρ) = 3√3·δ/γ²·(1 + O(γ⁻²)): √3 times its own vantage s = 2 and 3√3 times Li's criterion (√3 per Taylor coefficient).

How far can you see a rogue zero?

visibility & horizon · theorem (unconditional)

the horizon and the disk

proved

With RH verified to 3·10¹², |u_n| ≤ u₀ + 2.1·10⁻¹¹ for every n ≤ 10²⁴, the trace's Hardy-space function has no poles in |χ| < 1 − 1.7·10⁻²⁵, and the tail bound holds for every n.

How far can you see a rogue zero?

trace as a sequence · theorem

the generating function

proved

Σ u_n zⁿ = (27/8)[L(0) + ((1 + z)/(1 − z))·L(27z/(1 − z)²)] with L = K′/K: a log-derivative read along a Koebe curve. RH ⇔ it is holomorphic on the disk ⇔ radius exactly 1.

The cubic Chebyshev trace as a sequence (unpublished)

trace as a sequence · theorem

the laplacian ladder

provedlean

Σ θ^{k+1} T_h(y) = ((−¼Δ²)^k u)_h; on generating functions −¼Δ² is multiplication by θ(X(z)) = −(1 − z)²/(4z). Under RH each zero's wave carries its own Laplacian eigenvalue sin²(Θ/2).

The cubic Chebyshev trace as a sequence (unpublished)lean: RBTrace.ladder, wave_eigen, power_sum_local

trace as a sequence · theorem

self-correlation and simple zeros

provedlean

Under RH, lim (1/N)Σ u_n u_{n+h} = ½Σ m_γ² θ² cos(hΘ); RH and simplicity ⇔ mean u_n² = (u₀ − u₁)/4 = 0.000821184005...; if RH fails the mean square is unbounded.

The cubic Chebyshev trace as a sequence (unpublished)lean: RBTrace.variance_law (finite nodes)

trace as a sequence · theorem

dihedral family

provednumerical

Weights θ = −tan²(k·arctan(c/(s − ½))); k = 3, c = √3/2 is the cubic trace. Even k: invariant under γ ↦ c²/γ, angle collisions exactly when γγ′ = c²; large c gives prime formulas (Weil explicit formula instances).

The cubic Chebyshev trace as a sequence (unpublished)

trace as a sequence · computation

first 10⁵ terms, certified

provednumerical

u₀ ... u_{100000} computed from values of ξ with proved radius ≤ 6.6·10⁻¹⁹ (Krawczyk roots, ball arithmetic, rigorous DFT, unconditional aliasing bound); under RH the spectrum locates the first 71 zero ordinates.

Reproduced byte for byte from a clean copy; a second run on a 2¹⁸ grid gives intersecting enclosures.

The cubic Chebyshev trace as a sequence (unpublished)

trace as a sequence · conditional theorem

conditional fourth moment

provedleannumerical

Under RH, simple zeros and four-term nonresonance, mean u_n⁴ = 3A(0)² − (3/8)Σθ⁴; data over 10⁴ ≤ n < 10⁵ give 1.5512·10⁻⁶ against 1.5451·10⁻⁶.

The cubic Chebyshev trace as a sequence (unpublished)lean: RBTrace.fourth_moment (finite nodes)

rotation tower · theorem

rotation tower and amplification law

provednumerical

A full descent exists at every odd order m (only ξ(1 − s) = ξ(s) is arithmetic); escape g^{(m)} = (ma|η|/γ²)sech(ma/2γ)(1 + O(γ⁻¹)), optimal at λ = ma/2 ≈ 1.19967864γ with value 1.32548684|η|/γ: the finite-local exponent is γ⁻¹, not γ⁻².

The rotation tower of the Riemann xi function (v2)

rotation tower · criterion (RH-equivalent)

coprime levels

proved

For gcd(m, m′) = 1 the two spurious families meet only on the critical line, so the pair of criteria is unconditionally RH-equivalent with no auxiliary zero-free region.

The rotation tower of the Riemann xi function (v2)

rotation tower · identity

continuum explicit formula

provednumerical

Σ_{γ>0} tanh²(λ/γ) = (16λ/π³) Σ_{j≥0} (2j+1)⁻³[ℓ(p_j) + (λ/(π(2j+1)))ℓ′(p_j)], p_j = ½ + 2λ/(π(2j+1)); λ → 0 recovers Σγ⁻² = ½ℓ′(½).

The rotation tower of the Riemann xi function (v2)

rotation tower · criterion (RH-equivalent)

irrational transversality

provednumerical

Two scales share a spurious component iff λ/λ′ ∈ ℚ, so RH ⇔ the criterion at two scales of irrational ratio, unconditionally.

Where the vault is (synthesis note)

rotation tower · theorem

no certification on the true branch

proved

By a dimension count, no finite set of scales and depths certifies an RH-true configuration: the tower is a pure falsification instrument, and any proof must be an identity, not an inequality with slack.

Where the vault is (synthesis note)

rotation tower · conjecture

tower as a discretization of the hardy contraction

conjectured

The harmonic lattice accumulates at s = ½, which is χ = −1 where the Schur multiplier vanishes; conjecture: the rotation tower discretizes the Hardy-space contraction.

The rotation tower of the Riemann xi function (v2)

scale flow · criterion (RH-equivalent)

the scale flow

provednumerical

λ∂θ/∂λ = V(θ) = 2√θ(1 − θ)artanh√θ, one autonomous holomorphic field whose conserved quantity is the zero itself; RH ⇔ every nontrivial zero lies on the heteroclinic orbit (0, 1).

The scale flow of the Riemann zeros

scale flow · identity

dilation divisor and mellin duality

provednumerical

H(λ) = Σ_ρ θ_λ(ρ) has double poles exactly on π(ℤ + ½)·{ρ − ½}; H̃(w) = M(w)Z(w) with Z the secondary zeta function and M(w) built from ζ(w + 2).

The scale flow of the Riemann zeros

scale flow · open problem

a positivity property of the flow

open

Find a positivity, Schwarzian or transfer-operator property of V equivalent to RH; and decide whether the multiplicative dilation divisor interacts with the Euler product.

The scale flow of the Riemann zeros

trace distribution · conditional theorem

the trace has a law

provednumerical

Under RH, (u_n) has a limiting distribution (and RH ⇔ it exists). If the trace angles are linearly independent, it is the law of Σ θ_γ cos(2πU_γ), with characteristic function ∏ J₀(θ_γ t), bounded support [−u₀, u₀], and every cumulant local: κ_{2r} is a constant times Σθ^{2r}.

Against 10⁶ certified terms: κ₂, κ₄, κ₆, κ₈ match the local predictions to 0.01%, 0.2%, 0.3%, 0.4%; skewness −0.0004; tail frequencies match the model down to 8·10⁻⁵.

Distribution hunt (unpublished)

trace distribution · prediction

local excess kurtosis

provedleannumerical

Excess kurtosis of the trace = −(3/2)Σθ⁴/(Σθ²)² = −0.708682 from local data alone; measured −0.70727 over 10⁶ certified terms.

Distribution hunt (unpublished)lean: RBTrace.fourth_moment (finite nodes)

trace distribution · conditional theorem (sketch)

the edge law

numerical

−log P(u_n ≥ u₀ − ε) ~ A²·log²(1/ε)/ε with A = 0.575191; the refined form sup_s[A√s(log s + b) − εs], b = −3.152912, matches the exact model to 0.01%.

Conditional on RH and trace linear independence; de Bruijn's Tauberian theorem plus Riemann–von Mangoldt. Needs a full writeup.

Distribution hunt (unpublished)

trace distribution · conjecture

record law

conjectured

u₀ − max_{n≤N} u_n ~ A²(log log N)²/log N: how fast the trace's records creep toward its threshold.

Distribution hunt (unpublished)

trace distribution · theorem

odd moments detect additive relations

provedleannumerical

Under RH the third moment equals (3/4)Σ over Θ_c = Θ_a + Θ_b of the weight products; the trace's skewness vanishes iff no trace angle is the sum of two others.

Measured skewness −0.004; closest near-relation among the first 3000 angles misses by 7.9·10⁻¹⁰.

Distribution hunt (unpublished)lean: RBTrace.third_moment_vanishes (finite nodes)

trace distribution · theorem

algebraic independence ⇒ trace li

proved

If the zero ordinates are algebraically independent over ℚ, then 1 and the trace angles Θ_γ/2π are linearly independent over ℚ; the same holds for every algebraic angle map (all finite tower levels, the dihedral family).

Proof by a derivation argument; written out, not yet formalized.

Distribution hunt (unpublished)

trace distribution · conditional theorem

simplicity tests at every order

provedlean

With multiplicities, each even cumulant exceeds its local value by a multiple of Σ(m^{2r} − m)θ^{2r} ≥ 0, with equality iff all zeros are simple: an infinite family of simplicity tests extending the mean-square test.

Distribution hunt (unpublished)lean: RBTrace.mult_le, mult_eq_iff

trace distribution · identity

an euler product over zeros

provednumerical

exp(Σ u_n zⁿ/n) = ∏_γ (1 − 2cos Θ_γ·z + z²)^{−θ_γ/2}; RH ⇔ every Satake-type parameter e^{±iΘ} is unimodular. At z = 1: Σ u_n/n = −½Σθ log(4θ) = 0.36746.

Distribution hunt (unpublished)

trace distribution · computation

the first zero from shuffled values

numerical

The first zero of the trace's empirical characteristic function sits at j₀,₁/θ(γ₁): from the histogram of u_n alone, with the order of n thrown away, γ₁ ≈ 14.1386 from 10⁶ terms (true 14.134725).

Distribution hunt (unpublished)

trace distribution · computation

first 10⁶ terms, certified

provednumerical

u₀ ... u_{1000000} computed from values of ξ on a 2²² grid, every term with proved radius ≤ 6.6·10⁻¹⁹; the enclosures intersect the independent 2¹⁹-grid run at all 100,001 shared terms. 1229 seconds on two cores.

Distribution hunt (unpublished)

trace distribution · observation

a five-zero alignment at n = 844,054

numerical

New record u_{844054} = 0.10039 = 0.648·u₀ (previous record 0.567·u₀). The first five zero angles line up almost exactly (cos nΘ_j = 0.999, 0.997, 1.000, 0.996, 0.976), and the LI model puts this at roughly a one-in-several-hundred event for 10⁶ terms.

Either luck or Diophantine structure among the first trace angles; worth an LLL look.

Distribution hunt (unpublished)

primes & moments · theorem / conditional theorem

quartic spectral certificate

proved

An unconditional quartic spectral certificate, with a conditional 13/18 theorem aimed at the simple-zero proportion record.

A quartic spectral certificate and a conditional thirteen-eighteenths theorem

primes & moments · theorem

prime-gap third moments

proved

Third moments of prime gaps through an exponential-kernel projection.

Prime-gap third moments and exponential-kernel projection

primes & moments · conjecture

rouyea–bourgeois mirror conjecture

numericalconjectured

g(q) = min |Re L(1, χ) − ½| decays like q^{−α}, α ≈ 1.87, with Tracy–Widom GUE edge statistics.

Mirror conjecture note

earlier threads · conjecture

arnet floor bound

conjectured

The automorphic product F(s) = ζ(s)ζ(w(s))ζ(w²(s)) satisfies a floor bound (Conjecture 10.7), claimed equivalent to RH.

The arithmetical network

earlier threads · theorem

affine clock triangle

proved

A Pascal-type array with left border 1 and right border (−1)ⁿBₙ, a unique spectral zero at ω = π, four laws, and a prime constant invariant at stabilization depth 5.

The affine clock triangle and the prime constant invariant

structural · conjecture

missing world conjecture

conjectured

For cross-intersecting Sperner families, the binary equilibrium gap satisfies μ(U) ≥ L^{−C}.

The missing world conjecture

structural · conjecture

binding-discovery conjecture

conjectured

Minimal binding sets are minimal covers of the counterworld set by exclusion sets; conjecture on discovering them.

On binding truth

structural · conjecture

choice conjecture

conjectured

P = NP ⇔ every efficiently recognizable, polynomially bounded relation has a polynomial-time selector.

The choice conjecture

structural · conjecture

conservation of silence

conjectured

Exposure cost Σ_R = b_R + log T_R = log(T_R/p_R) of a reduced description; conjecture Σ_R ≥ c·q(L).

The conservation of silence

reproduce it

the lean project rbtrace builds against mathlib on lean 4. every lean-stamped theorem above depends only on propext, Classical.choice, Quot.sound, with no sorry and no custom axioms.

toolchain
leanprover/lean4:v4.36.0-rc2
mathlib
0ea073b33f73
build
lake exe cache get && lake build
axioms
lake env lean RBTrace/Axioms.lean

what the stamps mean

  • proved means proved on paper.
  • lean means a machine-checked version exists, usually the finite or algebraic core.
  • numerical means supported by computation.
  • conjectured and open mean what they say.
  • conditional in the kind line means the statement assumes RH or a stated hypothesis.