numerical-evidence.md

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

3708 bytes, as of the version from 2026-11-17 11:01 (current). Recorded here, not run.

# Numerical evidence for T735

The selected quantity is the unnormalized trace-additive cubic Eisenstein Gauss
sum, with c=a+b*omega congruent to 1 modulo 3 and omega=(-1+i*sqrt(3))/2.
All 176 nonunit squarefree ideals prime to 3 of norm <=500 were computed.
Independent ideal-product enumeration agrees exactly with the lattice selection:
90 split primes, 4 inert primes and 82 composites. The largest norm is 499.

Exact finite sums are represented by integer polynomials at exp(2*pi*i/(3*N)).
entries.json retains both their original term counts and reduced cyclotomic
coefficients. The final generator evaluates the unreduced integer polynomial
at 512 bits with Arb. The narrowest nonzero component supports
487 relative bits; 100 significant digits
are encoded. Rational-generator values are exact integers by conjugation and
the cube relation, also checked in the direct exact data. All nonreal components
have finite enclosures excluding zero. No truncation or float input is used.
The existing dry_run.py/check.py returned clean: 176 entries, longest native
ball representation 343 characters, block estimate 63.2 KB; no disguised exact
values or import/prose faults were found.

build_check.py independently factors rational primes and constructs finite
residue fields. At every split prime the exact unweighted cubic exponential
sum and the cube relation select the phase and reject both wrong cubic roots.
Inert sums equal the rational prime. Independent finite-field residue symbols
supply every composite CRT phase. Exact cube and norm identities and 640-bit
containment in every encoded decimal interval pass on all 176 rows.
The checker accepts G3(-2)=2 and rejects the wrong cyclotomic embedding, the
missing norm-91 CRT factor, a 10^(-60) perturbation and a broad ball.

local_controls.py separately reconstructs every prime character sum in finite
fields and checks trace/different-additive conversion and unit-generator
behavior at all 94 prime ideals. The denominator sign -1 is invariant in the
cubic case; an omega unit may change phase. It checks 14 small prime-power and
shift cases, including nonzero shared-prime cases and unshifted squareful
zeros, the exact Gauss–Jacobi and ordered-period identities over F7, the
Programs example, the T142 (7,2) stored interval, and all 176 conjugate indices.

Independence limits: these implementations share Sage/cyclotomic arithmetic
and the defining roots of unity. They differ in quotient enumeration,
finite-field construction and prime/composite phase checks. The builder's
checks are not a fresh scientific critique. The controller must obtain the
independent revision-bound scientific and argument-selection verdicts before
offering the private draft. check_stored.py is the additional read-back check;
its actual results are preserved separately after upload.

The initial decimal evaluation using the field's full root-of-unity order was
rejected offline; its exact sums were retained. An intentionally stopped slow
verification used repeated polynomial substitution for conjugation. The final
checker uses the exact exponent permutation, tested against Sage on small
controls, and then ran the complete checks. The old source, logs and profiler
output remain in this work directory. No failed result was uploaded.

Skill archive: ../20261117T084433Z-build-skills/manifest.json.
Attached manifest SHA-256: 27ec6a391956d87a58148a74289700551986207fd04c93537b499a2711ae9cb0.
Matching local/live bundle SHA-256:
984965681e2f8925c511a121c118efcde59581c7b0d906cac8b641bf6925e55a.
Dependency versions are in dependency-versions.json. Source URLs and archive
hashes are in sources.json. Exact artifact hashes are in evidence-manifest.json.