Corpus v3 · Definition
cid001444
DEF0214canonicalv1Sieve-Accelerated Goldbach
Goldbach verification using sieve primality. Pushes bound from 100 to 500.
Payload
Sieve-Accelerated Goldbach
Goldbach verification using sieve primality. Pushes bound from 100 to 500.
Sieve-Accelerated Goldbach
Summary
Goldbach verification using sieve primality. Pushes bound from 100 to 500.
Statement
\label{def:goldbach-sieve}
$G(n)$~holds if there exist primes $p, q$ with $p + q = n$.
Using sieve-based primality, Goldbach is verified for all even
$n \in [4, 500]$.
\textbf{Lean:} \texttt{goldbach\_sieve\_check}.\quad
\textbf{Registry:} III.D102.
Proof / Justification
This item is definitional. No manuscript proof is required.
Source Context
- Registry source:
book-03.jsonlline 257 - Manuscript source:
2nd-edition/book-iii-categorical-spectrum/02_mainmatter/part10/ch81-additive-conjectures-deep.texlines 142-149
Lean / Formalization Notes
- Formalization:
formalized - Module:
TauLib.BookIII.Spectral.GoldbachDeep - Name:
goldbach_sieve_check
Dependencies
- Canonical: III.D99, III.D95
Related Results
Generated by later projection phases.
Related Publications
Generated by later projection phases.
Revision Notes
- 2026-04-24: Initial pilot migration.
Identifiers
Aliases & legacy IDs
III.D102sieve-accelerated-goldbachdef:goldbach-sieveRelease lines
corpus_v3_workingcorpus_v2Relations
Appears in (1)
Sources
Version & History
Status disclaimer
A Corpus Item page reports the program's current internal record for this item. It does not imply external verification, scientific consensus, or final proof unless explicitly stated. Read it together with its dependencies, formalization status, and the program's overall stance.