Skip

Number theory · 1 manuscript(s)

Ostmann’s inverse Goldbach conjecture

Verified by Lean
Open on GitHub

1 · The essentials

Can the prime numbers be obtained by adding numbers from two simpler lists? Here, we take every possible sum of one number from the first list and one from the second. Each list must contain at least two numbers, all of them whole numbers that are zero or positive. The reported result says that these sums cannot give exactly the prime numbers. Even adding or removing finitely many elements from the set of primes does not make this possible. This answers Ostmann’s inverse Goldbach conjecture. The main result has a Lean formalization.

A picture to help (an imperfect image, not to be taken literally)

Imagine two price lists: you choose one price from each and record every possible total. This is an imperfect image, but the result says that with at least two nonnegative whole-number prices on each list, those totals cannot match the primes exactly, even after finitely many corrections.

Why it matters

The result rules out a precise way of building the primes from two simpler sets. It concerns more than the exact set of primes: the impossibility persists after any finite modification. The manuscript presents this as a resolution of Ostmann’s inverse Goldbach conjecture.

2 · Going further

For two sets , their sumset is defined by . The question is whether a set differing from the set of primes by only finitely many elements can be written as , with and . The main result rules out every such representation.

The condition on permits both adding and removing finitely many elements. The required equality is exact: every sum must belong to , and every element of must occur as a sum. This is the precise sense in which the manuscript’s title describes the primes as additively indecomposable.

The repository summary and the manuscript abstract present this statement as a resolution of Ostmann’s inverse Goldbach conjecture. However, the supplied abstract describes neither the method nor the steps of the argument, so it does not support an explanation of the proof strategy here. The main result has a Lean formalization, but the supplied text does not detail its technical scope. No companion manuscript is supplied.

Useful notions

  • Prime numbers
  • Nonnegative integers
  • Sets and membership
  • Sets of all possible sums
  • Finite modification of a set

What was known before / what is new

Before

The source identifies the question as Ostmann’s inverse Goldbach conjecture. It supplies neither a detailed history nor earlier partial results.

New

The manuscript reports that no finite modification of the primes can be written as for two sets of nonnegative integers containing at least two elements each. The repository summary presents this as a resolution of Ostmann’s conjecture. The main result has a Lean formalization.

Limits and assumptions

The statement concerns sets of nonnegative integers, each containing at least two elements, and requires exact equality with the set of all their sums. It covers only sets differing from the primes by finitely many elements; it gives no conclusion for infinite modifications or other number domains. A Lean formalization of the main result is reported, but its detailed scope and the mathematical argument are absent from the supplied text. The source mentions no remaining open question.

Mini glossary

Prime number
—
An integer greater than 1 whose only positive divisors are 1 and itself.
Sumset
—
The set consists of every number with and .
Finite modification
—
A change to a set made by adding or removing finitely many elements.
Additive indecomposability
—
In this statement, the impossibility of writing the set in question as with two sets of nonnegative integers containing at least two elements each.

Keywords : Prime numbers · Additive indecomposability · Ostmann’s conjecture

AI-generated explanation based on the manuscript. Unofficial. Refer to the manuscript for the authoritative version.

3 · Technical details and sources

Claim made in the manuscript (source text)

Proves that no finite modification of the primes can be written as with each containing at least two elements. This resolves Ostmann's inverse Goldbach conjecture on additive indecomposability.

Verified by Lean: the Lean software checked the part of the reasoning described below, sometimes only part of the manuscript. This does not mean independent mathematicians have validated the result.

Scope of the Lean formalization (source text)

…

lean/docs/013.md

Manuscripts in this family

★

The additive indecomposability of the primes

24/09/2026
To be verified

We prove Ostmann's inverse Goldbach conjecture: no set differing from the primes by finitely many elements can be written as , where A and B are sets of nonnegative integers with at least two elements each.