certification.md

back to table · edit · history · where entries came from · files · download

8094 bytes, as of the version from 2026-11-10 11:25 (current). Recorded here, not run.

# Certification of T705

The recorded quantity is a real zero of the particular polynomial in
O'Sullivan, arXiv:2007.13582v2, equation (1.4), using the completion with
factor 1/2 and the physicists' Hermite convention exp(2Xt-t²).
There is no rescaling of X, no magnitude-only conversion, and no free
Gaussian deformation. Each polynomial contributes all its roots in
increasing order. Computed simplicity makes multiplicity unambiguous.

## Primary computation

The generator expands the completed product at exactly s=1/2 through Taylor
order 40 in Arb complex ball arithmetic at 896 bits. Multiplying the even
Taylor coefficient of order 2m by m! gives gamma_m, for 0<=m<=20.
Truncated power series extract coefficients, not approximate values at a
nonzero argument. All odd coefficient balls contain zero, as required by
the functional equation. All even coefficients are finite and positive;
the minimum relative accuracy of gamma is 649 bits. Stored T15 decimals
are comparisons only, never inputs.

The Hermite polynomials are built over ZZ[X] using H_0=1, H_1=2X and
H_(r+1)=2X H_r-2r H_(r-1). Multiplication by binomial(d,j)*gamma_(n+j)
and summation produce P^(d,n) in ball arithmetic, propagating every error.
The leading coefficient is 2^d gamma_n>0.

Complex ball polynomial roots supply candidates only. Around each real
midpoint we construct a ball of radius 2^-400 max(1,abs(midpoint)). The
exact dyadic endpoints have strict opposite signs under the actual
ball-coefficient polynomial. The d intervals are disjoint and ordered.
The intermediate value theorem provides at least one real root per
interval. A degree-d polynomial has exactly d complex roots counted with
multiplicity, so these intervals exhaust the roots and each root is simple.
No assumption about RH and no test of a small imaginary part replaces this
argument. Imaginary candidate balls containing zero are only a preliminary
sanity check.

The least accurate returned root enclosure has 391 relative-accuracy bits,
more than 117 decimal digits. This is conservative bracket precision;
896 working bits are not claimed as the precision of the output. All
605 values are written to 100 significant digits using numberdb.to_text.
Independent strict endpoint signs certify the actual interval represented
by each written string, not only the midpoint residual.

## Independent coefficient and polynomial route

The theta-moment routine was adapted from the website attachments of T659
and T704 retrieved on 2026-11-10. Its derivation was checked against the
split Mellin representation in Griffin, Ono, Rolen and Zagier,
arXiv:1902.07321v2, section 4. That paper's gamma sequence is eight times
ours; the integral formula is converted to the completion used here:

    xi(1/2+z) = 1/2 + (z²-1/4) integral_1^infinity
        u^(-3/4) theta_0(u) cosh(z log(u)/2) du,
    theta_0(u) = sum_(ell>=1) exp(-pi ell² u).

Writing I_j for the integral of
u^(-3/4) theta_0(u) (log(u)/2)^(2j)/(2j)! gives

    gamma_0 = 1/2-I_0/4,
    gamma_j = j! (I_(j-1)-I_j/4), j>=1.

This computation evaluates neither zeta nor gamma. The first 12 theta terms
are integrated over [1,256], subdivided at powers of two, with rigorous
complex-ball quadrature at 832 bits and absolute and relative tolerances
2^-750. The logarithm respects the integrator's analytic flag. Requested
tolerances are not accuracy claims; measured enclosure widths are checked.

For completeness, the omitted errors have explicit bounds. Set m=2j,
A=169*pi and U=256. Since (13+r)²>=169+27r, the omitted theta terms over
all u>=1 contribute at most

    E_theta = exp(-A)/((1-exp(-27*pi)) (A-m) 2^m m!).

Use u^(-3/4)<=1, log(u)<=u and u^m<=exp(m(u-1)). For u>=U, use
ell²>=1+3(ell-1) and u^m<=U^m exp(m(u-U)/U), giving the entire tail bound

    E_integral = U^m exp(-pi U)/
        ((1-exp(-3*pi U)) (pi-m/U) 2^m m!).

Every denominator is positive for 0<=m<=40. The sum's upper endpoint is
added as a symmetric error radius; double counting the omitted terms
beyond U is conservative. The resulting 21 gamma balls retain at least
631 relative-accuracy bits. They agree with the primary series route and
with a supplemental 1024-bit series run. Every gamma_j/j! also lies inside
the corresponding existing T15 decimal interval.

The independent polynomial computation does not call the Hermite recurrence.
It extracts coefficients from exp(2Xt-t²) Theta^(n)(t) directly:

    [X^i] P^(d,n) = (d! 2^i / i!) sum_(r=0..floor((d-i)/2))
        (-1)^r gamma_(n+d-i-2r) / ((d-i-2r)! r!).

All rational factors are formed in QQ, avoiding division of Python ints.
For each stored decimal, this independent polynomial has strict opposite
signs at the exact rational endpoints denoted by that decimal. All d
intervals are disjoint; this independently certifies all the recorded roots
and their precision. The derivative excludes zero on every whole interval.
The closest within-polynomial gap exceeds 0.6858; no ordering ambiguity
approaches the recorded precision. The smallest absolute derivative is
about 4.08e-18, reflecting the small overall coefficient scale, not a
failure of the interval root certificate.

## Controls and identities

Controls run before measurements. Quadrature checks the nonzero integral of
exp(-pi u) on [1,256] against its elementary antiderivative and the integral
of -u² on [0,1] against -1/3. For the coefficient triple (1,1,2), the
independent construction gives P=4X(X+1) and sign brackets around -1 and 0,
while the ordinary Jensen polynomial 1+2X+2X² has discriminant -4. This
checks both the construction and the failure of a finite converse from
Hermite-combination hyperbolicity to ordinary Jensen hyperbolicity.

All 11 Hermite basis polynomials are checked exactly against their finite
factorial formula and the stored T103 polynomials. The independent
polynomial coefficients agree with the generator over every selected
(d,n). Scaling the coefficients by eight is checked for all 110 polynomials.
The identities dP^(d,n)/dX=2d P^(d-1,n) are checked for all 110
polynomials, including d=1 with P^(0,n)=gamma_n.

For all 605 roots, both intervals shifted by plus or minus ten last-place
units are rejected: endpoint signs are equal and strict, and the derivative
excludes zero throughout the shifted interval. All 1,210 negative controls
therefore certify absence of a root rather than merely a failed sign test.
Vieta reconstruction from every complete set of written intervals checks
all monic coefficients and the root-sum identity. All 11 linear formulas,
22 quadratic root formulas, and 11 relations x_(1,n,1)=1/(2r_(1,n,1)) to
ordinary Jensen roots in T659 are checked. The generator's complete root
computation is repeated at 1024 bits and contained in the written intervals.

The same independent checks run again on values fetched from the database
with the contributor's key. `Generator.verify(sample=None)` separately
compares all stored entries with the generator. Numerical evidence retains
the measured precisions and per-entry sign-certification results; raw logs
retain moment balls and both tail bounds.

## Reproduction, scope and policy

Download generate.py, checks.py, T15.json, T103.json and T659.json to one
directory. `sage -python checks.py` checks the generated strings without a
key. To check a private draft, configure your own key, then use
`sage -python checks.py --stored` and `sage -python generate.py`.
The generator uses no saved numerical results as inputs. Snapshot tables
provide comparison evidence; neither their decimals nor their attachments
are imported by the generator.

These are build checks, not the controller's separate independent critique.
No offer, review or publication operation is performed. Argument selection
is explained in argument-selection.md and remains subject to that critique.

The governing archived manifest is
`agents/runs/20261110T105402Z-build-skills/manifest.json`. Both archived
versions have SHA-256
`886390324dd1971e381a43cf3b46b822ab0bc67d62f31d8481e29ec79556746b`.
The attached skill-evidence.json records both versions and the manifest path.