number-theory / Additive number theory; sumsets and the primes

Ostmann's inverse Goldbach conjecture

Theorem 1.1: if A,B⊆N0A,B\subseteq\mathbb N_0 have ∣A∣,∣B∣≥2|A|,|B|\ge2, then (A+B)△P(A+B)\triangle\mathcal P is infinite. After the Laffer-Mann reduction to two infinite summands, the proof combines residue restrictions at every prime, decorrelation from translated multiplicative characters, prime coverage and a positive statistic averaged over arrangements; it does not use Green and Harper's conditional inverse-sieve route. In particular, if A+BA+B contains every large prime it contains infinitely many composites. No quantitative version is claimed.

28Significance / 100
1Frontier events
0Verification tasks
0Recorded attempts

Temporal state

Current frontier

No reconciled state yet.

Append-only history

Frontier timeline

number-theorySep 24, 2026Significance 28/100Registry: lean checked

Ostmann's inverse Goldbach conjecture

Prior state unknown→proved

Theorem 1.1: if A,B⊆N0A,B\subseteq\mathbb N_0 have ∣A∣,∣B∣≥2|A|,|B|\ge2, then (A+B)△P(A+B)\triangle\mathcal P is infinite. After the Laffer-Mann reduction to two infinite summands, the proof combines residue restrictions at every prime, decorrelation from translated multiplicative characters, prime coverage and a positive statistic averaged over arrangements; it does not use Green and Harper's conditional inverse-sieve route. In pa…

SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review

Research memory

Claims and attempts

Scoped claims

Source authenticated

Theorem 1.1: if A,B⊆N0A,B\subseteq\mathbb N_0 have ∣A∣,∣B∣≥2|A|,|B|\ge2, then (A+B)△P(A+B)\triangle\mathcal P is infinite. After the Laffer-Mann reduction to two infinite summands, the proof combines residue restrictions at every prime, decorrelation from translated multiplicative characters, prime coverage and a positive statistic averaged over arrangements; it does not use Green and Harper's conditional inverse-sieve route. In particular, if A+BA+B contains every large prime it contains infinitely many composites. No quantitative version is claimed.

Theorem 1.1: if A,B⊆N0A,B\subseteq\mathbb N_0 have ∣A∣,∣B∣≥2|A|,|B|\ge2, then (A+B)△P(A+B)\triangle\mathcal P is infinite. After the Laffer-Mann reduction to two infinite summands, the proof combines residue restrictions at every prime, decorrelation from translated multiplicative characters, prime coverage and a positive statistic averaged over arrangements; it does not use Green and Harper's conditional inverse-sieve route. In particular, if A+BA+B contains every large prime it contains infinitely many composites. No quantitative version is claimed.

Recorded attempts

Evidence graph

Connected research record