TnDex · paper

Reading the Fold

A Global Newton Series for the Riemann Xi Function

Jeffery Huckstead · Cerebral Graphix · Version 1.3 · 20 October 2026 · DOI 10.5281/zenodo.23511096

The fold

The Riemann zeta function hides its zeros behind a symmetry: the completed function ξ takes the same value at s and at 1 − s. The triangular coordinate q = s(1 − s) = −2T(s − 1) cannot tell the two apart, so ξ(s) = X(q) for a single entire function X. The critical line becomes the ray q ≥ ¼, and the real axis beyond s = 1 becomes the negative axis.

The fold is a parabola. Write J = 2s − 1. A square of side 2n + 1 splits into eight triangles of T(n) dots around one centre dot, (2n + 1)² = 8T(n) + 1. Put s − 1 in place of n and this becomes J² = 8T(s − 1) + 1, so q = (1 − J²)/4. Real J carries the real axis, where ξ is positive and easy to compute. Imaginary J carries the critical line, where q = ¼ + t². The two branches touch only at the vertex q = ¼.

The half index. The vertex is the half index s − 1 = −½, where the square's side is 0 and T(−½) = −1/8. The triangular product Πn(y) = (1 + y)(1 + 2y)⋯(1 + ny) has coefficients that are polynomials in n. Evaluated at −½ they give 1, −1/8, 1/128, 5/1024, …, the classical expansion behind the central binomial coefficients.

What the paper proves

It rebuilds the whole function, including its values on the critical-line branch, from samples at q = 0, −1, −2, … (the value at q = 0 is exactly ½). The finite differences of those samples are the coefficients η₀, η₁, η₂, ….

What it does not do. Positivity of the individual coefficients does not decide the Riemann hypothesis. That question is equivalent to a whole family of determinant inequalities. The paper states exactly where they sit, and gives small examples showing that these structural properties alone cannot force them.

Around the fold

The averaging rule behind the series puts it in one family with Taylor's series, the Euler–Maclaurin formula and a triangular Bernoulli family. In that family the reciprocal triangular numbers sum to 2 because a triangle's edge cancels a pole. The same framework, developed by J.-F. Burnol, proves a pattern in digit-restricted harmonic sums: sums over integers with exactly n nines approach 10 ln 10, and for every n ≥ 1 the corrections come in powers of 1/91, 1/991, 1/9991.

Entropy. Halve the reciprocal triangular numbers and they become probabilities, ½, ⅙, 1/12, …, summing to 1. Their entropy is 2.0462774528… nats, a sum over the even zeta values: −2Σζ′(2k) = ln 2 + 2Σ(ζ(2k) − 1)/(2k − 1). This is the classical entropy of the Lüroth map. On the real segment 0 < s < 1 the fold q = s(1 − s) is a coin's variance. The coin's entropy curves at the rate −1/q, and its maximum, ln 2, sits at the vertex q = ¼.

The 7/8. On the critical line, |ξ| is |ζ| times a completion factor. That factor's size is q^(7/8) times a decaying exponential: q¹ from the polynomial factor and q^(−1/8) from Gamma. The same 1 − 1/8 is the constant in the count of zeros up to height t.

100 over 990. Neighbouring even zeta values divide by Euler's formula. At one rung the ratio arrives, before any cancellation, as ζ(10)/ζ(8) = (2·5·π)²/(9·10·11) = (10π)²/990: the 2π of the formula, a 5 from each Bernoulli number, 9·10 from the factorials and 11 from the denominator of B10. That 990 is also the triangular number T44 is a rarer coincidence: among the products n(n + 1)(n + 2) with n < 2·10⁶, only six are triangular.

Figures

Eight triangular blocks make the odd square; the fold as a parabola with its real and imaginary branches
The square and the parabola: eight triangles around a centre, (2n + 1)² = 8T(n) + 1, read as q = (1 − J²)/4 on real and on imaginary J (§2.3).
The s-plane with the real samples and the first zeros, and the folded q-line
The fold: real samples sj and the first zeros in the s-plane, and the folded line where the zeros sit at q = ¼ + t² (§1).
A uniform triangle and tetrahedron casting the B-spline shadows M2 and M3
The simplex shadow: any uniform triangle over 0, −1, −2 casts the same hat M₂, and a tetrahedron casts M₃. Each coefficient averages a derivative under such a shadow (§3.2).
The coefficients and their rate of decay
How fast the coefficients fall: log₁₀ ηₙ for n ≤ 128 with the two corrections, and the root scale n·ηₙ^(1/n)/(ln n)² on its slow climb to e/16 (§5).
Xi on the critical line scaled to constant size, and the reconstruction error for K = 25 to 100
ξ on the critical line with its q^(7/8) Gamma envelope removed, and the error of the K-term reconstruction against the proved bounds (§6).
Four averaging rules and the degree-two member each produces
Four averaging rules, Taylor, Euler–Maclaurin, the triangle and the simplex, and the degree-two member each produces (§7).
Binary entropy against the fold, the reciprocal-triangular law, and two ways to sum its entropy
The fold as a coin's variance, the reciprocal-triangular law and its entropy, and two ways to sum it: directly, or over the even zeta values (§7).

Several of these shapes can be moved by hand in Shape Court: the eight triangles, the staircase to ½, the fold and the bit, and the shadow of an equilateral.

Versions

versiondateDOI
1.3 (this page)20 October 202610.5281/zenodo.23511096
1.218 October 202610.5281/zenodo.23447547
1.118 October 202610.5281/zenodo.23443895
117 October 202610.5281/zenodo.23438542

Cite

@misc{huckstead2026fold,
  author    = {Huckstead, Jeffery},
  title     = {Reading the Fold: A Global Newton Series for the Riemann Xi Function},
  year      = {2026},
  version   = {1.3},
  publisher = {Zenodo},
  doi       = {10.5281/zenodo.23511096},
  url       = {https://doi.org/10.5281/zenodo.23511096}
}