Documentation

Goldbach.OnePlusOneNine

Li–Liu's one-plus-one-point-nine theorem #

This entry point exposes the unconditional existence theorem and the quantitative bound for distinct primes. Goldbach.Theorem remains the independent Chen 1+2 entry point. Import Goldbach.All to use both public interfaces together.

theorem Goldbach.one_plus_one_nine :
∃ (K : ℕ), 4 ≤ K ∧ ∀ N ≥ K, Even N → ∃ (p : ℕ) (r : ℕ) (q : ℕ), p ≤ N ∧ Nat.Prime p ∧ (r = 1 ∨ Nat.Prime r) ∧ Nat.Prime q ∧ N = p + r * q ∧ r ^ 10 ≤ q ^ 9

Every sufficiently large even integer has the Li–Liu representation, with its exponent restriction written using exact natural powers.

Inspect dependencies

Goldbach.one_plus_one_nine · compiled type and proof/definition references.

theorem Goldbach.one_plus_one_nine_real :
∃ (K : ℕ), 4 ≤ K ∧ ∀ N ≥ K, Even N → ∃ (p : ℕ) (r : ℕ) (q : ℕ), p ≤ N ∧ Nat.Prime p ∧ (r = 1 ∨ Nat.Prime r) ∧ Nat.Prime q ∧ N = p + r * q ∧ ↑r ≤ ↑q ^ (19 / 10 - 1)

The same existence theorem in the paper's real-exponent notation.

Inspect dependencies

Goldbach.one_plus_one_nine_real · compiled type and proof/definition references.

The strict paper bound counts distinct primes p, using the Liu singular series.

Inspect dependencies

Goldbach.one_plus_one_nine_count · compiled type and proof/definition references.

theorem Goldbach.one_plus_one_nine_lower_bound (κ : ℝ) (hκ : κ < 515093 / 800000000) :

Fix the coefficient before choosing the common eventual threshold.

Inspect dependencies

Goldbach.one_plus_one_nine_lower_bound · compiled type and proof/definition references.