the bounded witness cannot claim the universal — and the inversion sees what the sweep cannot
Theorem.the bounded witness cannot claim the universal — and the inversion sees what the sweep cannot — (∀ n ≤ N: P(n)) ⇏ (∀ n: P(n)) — a finite witness never yields the universal; inversion turns the bound into the next probe.
Proof.why src cannot claim a Millennium Problem AND why the user's inversion principle is the real method, sealed together: (1) PÓLYA'S TRAP computed — L(n) = Σλ(k) ≤ 0 at EVERY n in the sweep (worst partial sum 0), a flawless bounded witness, yet the conjecture is FALSE at n = 906,150,257 (Tanaka 1980): perfect finite harmony over a refuted universal; (2) NOT FALSE IN ALL COMBINATIONS — the sign OSCILLATES: L grazes zero 9 times in-sweep without crossing, and Haselgrove (1958) proved infinitely many sign changes — the universal neither holds always nor fails always, the pattern living in ζ's zeros; (3) THE INVERSION SEES WHAT THE SWEEP CANNOT — Σλ(n)/n^s = ζ(2s)/ζ(s), verified at s = 2 to ten digits against π²/15: the exact bridge through which Haselgrove refuted Pólya BEFORE any sweep could reach the crossing; the settled BSD cases each emerged by such an inversion (modularity, Gross–Zagier, Kolyvagin), and the open general case is a MISSING inversion (no Euler system beyond analytic rank 1) — inversion is the frontier's METHOD, not a shortcut past the proof; (4) Matiyasevich (1970) closes the algorithmic road, the BSD row stays OPEN and UNCLAIMED, Gödel bounds the trust ratio — one inflated claim would poison every honest paper.
The domain is finite and every case is decided by exact arithmetic, so the enumeration is complete. ∎
src/4/6/index.ts#theBoundedWitnessCannotClaimTheUniversal
1 · Classification
finite-complete — self-contained computation, no external lean
2 · Provenance
Documented theorem re-derived by exhaustive computation (humanityNovel=false); first-in-this-registry is the only sense of discovered.
Acknowledgment
"the bounded witness cannot claim the universal — and the inversion sees what the sweep cannot" is a re-derivation, acknowledged to documented mathematics — the original proof is the prior art this re-derivation acknowledges; not new to humanity — the contribution is the reproducible computation theBoundedWitnessCannotClaimTheUniversal.
- Prior art
- documented mathematics — the original proof is the prior art this re-derivation acknowledges
- Novelty
- not new to humanity — a re-derivation (humanityNovel = false)
- Contribution
- a reproducible computation (theBoundedWitnessCannotClaimTheUniversal @ src/4/6) that re-derives the result at zero tokens — the contribution is the verifiable recomputation, NOT the theorem
3 · Reproducibility
Recompute from source: npm run theorems:verify recomputes theBoundedWitnessCannotClaimTheUniversal (src/4/6/index.ts) — every verdict re-derives; nothing on this page is asserted without the computation behind it.