← 51 Twins · calibration report · RH OPEN
Twin calibration.
The Davenport–Heilbronn function has the same reflection symmetry as completed zeta, F(s) = F(1 − s), but a different Gamma factor and no Euler product, and it has zeros off the critical line. Run through the TN Postmaster ladder, it shows how far a positivity test can go before it sees an off-line zero. The numbers here are the ones printed in TN Postmaster Volume I v5.2, Technical Dossier §§69A–69B.
- PROVEDshort argument given
- CERTexplicit object, replayed
- EVIDnumerical, not a theorem
- OPENunresolved
1 · The function
Same reflection, different Gamma factor, no Euler product.
Let κ = (√(10 − 2√5) − 2)/(√5 − 1) = 0.2840790438… and let an repeat with period 5 as (1, κ, −κ, −1, 0). Then f(s) = Σ an n−s and F(s) = (5/π)s/2 Γ((s+1)/2) f(s) = F(1 − s). The identity checks to 2 × 10−13 in double precision and 10−39 at 40 digits. Completed zeta is π−s/2Γ(s/2)ζ(s). The twin keeps the reflection s ↔ 1 − s but carries the Gamma factor Γ((s+1)/2) of an odd character, and conductor 5. The textbook odd-character completion uses (5/π)(s+1)/2. It differs from the factor above only by the constant (5/π)1/2 ≈ 1.2616, which cancels in F(s) = F(1 − s) and in d/ds log F, the only quantity the rungs and the Löwner test use. The form above is kept deliberately (both forms checked at 40 digits, PP276 monitoring). The coefficients c(n) of −f′/f play the role of Λ(n), but they are signed and live on composites too:
| n | 2 | 3 | 4 | 6 | 9 | 11 | 12 | 13 | 14 | 19 | 21 |
|---|---|---|---|---|---|---|---|---|---|---|---|
| twin c(n) | +0.197 | −0.312 | −1.442 | +1.936 | −2.286 | +2.398 | −0.763 | −0.729 | −2.852 | −2.944 | +3.290 |
| ζ: Λ(n) | 0.693 | 1.099 | 0.693 | 0 | 1.099 | 2.398 | 0 | 2.565 | 0 | 2.944 | 0 |
PROVED Some Widder rung of the twin is negative (Dossier Theorem 69A.1): the argument behind (R.4) uses only the absolutely convergent folded resolvent, and a Stieltjes function cannot have the poles that off-line zeros put off the negative axis.
2 · Census and the rung ladder
Where each off-line zero is first seen.
The census covers −0.45 ≤ σ ≤ 1.45 up to height 640 in windows of 5. In every window, the argument-principle count equals the on-line zeros plus twice the off-line zeros. It finds 501 on-line zeros and 16 off-line pairs. An independent 20-digit census over 260–600 flags the same windows. EVID
| # | off-line zero (σ > ½) | δ | a | first failing rung k* | k* / ((π/2)t²/(aδ)) |
|---|---|---|---|---|---|
| 0 | 0.808517182 + 85.699348485i | 0.3085 | 1.9481 | 16,589 | 0.864 |
| 1 | 0.650830081 + 114.163342731i | 0.1508 | 1.7869 | 59,814 | 0.787 |
| 2 | 0.574356050 + 166.479305913i | 0.0744 | 1.8449 | 269,777 | 0.850 |
| 3 | 0.724257695 + 176.702461243i | 0.2243 | 1.4674 | 119,953 | 0.805 |
| 4 | 0.869530580 + 240.404672351i | 0.3695 | 1.3365 | 148,116 | 0.806 |
| 5 | 0.819549592 + 320.876489669i | 0.3195 | 1.5022 | 313,749 | 0.931 |
| 6 | 0.768223124 + 331.050259408i | 0.2682 | 1.1843 | 402,203 | 0.742 |
| 7 | 0.628508108 + 366.640907576i | 0.1285 | 1.3254 | 1,164,418 | 0.939 |
| 8 | 0.815873678 + 411.796737549i | 0.3159 | 1.1367 | 503,773 | 0.679 |
| 9 | 0.708882224 + 440.484510740i | 0.2089 | 1.2136 | 868,748 | 0.723 |
| 10 | 0.515918314 + 520.943801035i | 0.0159 | 1.1050 | 18,519,801 | 0.764 |
| 11 | 0.846953803 + 531.279726897i | 0.3470 | 1.3622 | 841,972 | 0.898 |
| 12 | 0.729533400 + 548.906793778i | 0.2295 | 1.1494 | 1,593,139 | 0.888 |
| 13 | 0.786559082 + 566.509712911i | 0.2866 | 1.1907 | 1,542,049 | 1.044 |
| 14 | 0.582855670 + 595.023378028i | 0.0829 | 1.4920 | 3,593,590 | 0.799 |
| 15 | 0.628251983 + 611.775097639i | 0.1283 | — | — | local list incomplete |
Here δ = σ − ½, and a is the distance to the nearest on-line zero. Row 10 is computed on its own, because zero 11 fails first in any window that contains both.
- Sector bound. θmax = 7.1997 × 10−3 comes from zero 0; the zero-free strip bounds the tail above 640 by 2.8 × 10−3. So every rung k ≤ 218 is positive at every x > 0. The implication is PROVED; the value rests on the census, which is not interval-certified.
- First failure. Every rung 219 ≤ k ≤ 16,589 was evaluated near each off-line node of the census to 260. A full-orbit scan over 0.524 ≤ x ≤ 43,264 at k = 219, 500, 1000, 3000, 8000, 12000 and 16588 finds no negative minimum. At k = 16,589 there is exactly one. A 40-digit recheck gives positive-rescaled finite-census sums +1.7592739 × 10−4 at k = 16,588 and −4.6600915 × 10−5 at k = 16,589 at x = 7140.06626. An independent replay at 60 and 100 digits on the same list of zeros below height 260 gives +1.759274 × 10−4 and −4.660091 × 10−5. Both signs survive moving every listed zero by 10−12. Precision is therefore not the limit; the scope is the finite zero list. EVID
- The scans use a finite zero list, sampled x grids and numerical refinement. They do not certify the omitted tail or all x, including between sample points. Positivity for all 219 ≤ k ≤ 16,588 and all x > 0 is not established.
3 · The principal route
A hundred nodes, at 250 digits.
By the Dobsch–Donoghue theorem, every N-node Löwner matrix of h = xS is positive semidefinite exactly when the local matrix [h(i+j+1)(x₀)/(i+j+1)!] is, at every centre x₀. The Taylor coefficients come from the twin’s source formula, so every zero is included.
| centre x₀ | PSD through (tested) | first tested size with a negative pivot | smallest pivot there | exact first failure N* |
|---|---|---|---|---|
| 7124.38 = 0.97|q₀| | N = 100 | N = 105 | 1.0 × 10−141 | 105 |
| 7344.72 = |q₀| | N = 105 | N = 110 | 1.3 × 10−149 | 106 |
| 7565.07 = 1.03|q₀| | N = 105 | N = 110 | 1.2 × 10−148 | 107 |
The original run tested multiples of 5 only. Leading sections are nested, so one elimination of a 112-node matrix reads every leading minor at once: its first negative pivot is the exact first failing size. That gives N* = 105, 106 and 107 at the three centres, and the pivots at the tested sizes reproduce the table (Team B replay, provenance/v5_2/evidence/team_b_replay/). Positivity is established only at these three centres; the Dobsch–Donoghue criterion needs every centre. An N-node test uses about 2N ≈ 210 derivatives; the first failing rung uses about 33,000. The principal route sees the twin with far fewer derivatives, but only with arithmetic beyond 150 digits. In double precision the twin is indistinguishable from an on-line control through N = 64. EVID
4 · Why it takes so long
Parity, a Gaussian, and the detection law.
- Parity lemma (TW.1). A real test at real nodes sees a conjugate folded pair as F(qr + iη) + F(qr − iη) = 2F(qr) − η²F″(qr) + O(η⁴). The first-order, orientation-carrying term cancels. PROVED
- Local Gaussian form (TW.2). With q = ¼ + z² and x = ¼ + τ², log(4xq/(x+q)²) = −ε²/4 + ε³/4 − 7ε⁴/32 + …, where ε = (z² − τ²)/x. So a high rung is a Gaussian smoothing of the zero ordinates, of width τ/√(2k). PROVED
- Detection law (TW.3). An off-line zero at height t, displacement δ and gap a is first seen near k* ≈ 1.3 t²/(aδ). The median ratio is 0.81 on the 15 twin zeros above. On 90 off-line pairs planted among Platt’s zeta zeros (heights 1.9 × 10³ to 10⁹, δ ∈ {0.02, 0.1, 0.3}) it is 0.82, with 10–90% range 0.57–1.09. The older reading k*θ² ≈ constant spreads over a factor of 71 on the same plants. EVID
- Consequence. KH = 4,712,664,392,502 is a guarantee from phase alone, linear in the verified height. The detection scale is quadratic. An off-line zeta zero just above the verified height, with δ ≈ a ≈ 0.1, would first break the ladder near k ~ 1027.
5 · Corrections carried into v5.2
What the calibration fixed.
- An earlier working paper (PP199) quoted a twin zero at 1.10078201 + 86.14311231i. It does not reproduce: |f| = 0.576 there, and there is no twin zero with σ > 1 below height 640.
- Reference [66] now carries its arXiv title (“simple and on the critical line”), and Alpöge–Furman, the primary source of the unconditional two-thirds theorem, is cited.
- Two firewalls proved in the v0.3 edition, orientation annihilation and compact Euler-ray instability, are restored as Dossier §69C.
- Site v2.8.1 (Fork-A research pass): the rung results are scoped to the finite zero list and sampled x grids, and the 218 sector-safe rungs are conditional on the un-certified census.
- Site v2.8.3 (Team B): the twin is described as sharing ξ's reflection, not its Gamma factor; the rung signs are replayed at 60 and 100 digits; Löwner sizes are reported as first tested failures, beside the exact first failures N* = 105, 106 and 107; and a finite ladder prefix is not said to decide RH.
Evidence
Where to replay it.
The programs, zero lists and Colab transcripts are in provenance/v5_2/evidence/ of the TN Postmaster v5.2 source package, which maps every printed number to its file. The census to height 260 used by the 51 Twins plates is also here as evidence/dh-zeros-T260.json. RH STATUS: OPEN.