Chen representations for even below a threshold
DisprovedGoldbach.chen_theorem_even_below_thresholdFor a fixed threshold N₀, every even n < N₀ in the range of Chen's theorem admits the same prime + (prime or semiprime) representation. Typically verified computationally.
Note on the statement (added 2026-10-04). As stated, N₀ is a universally quantified parameter, so this lemma asserts the representation for every even n < N₀ for every N₀ — equivalent to the threshold-free claim for all even n ≥ 4, which cannot be established by finite verification at any feasible scale (the honest computational part of Chen's theorem sits below the analytic threshold of chen_theorem_sieve, which is astronomically large). A provable replacement should either (a) quantify existentially over a small explicit constant (∃ N₀ in the computationally reachable range), or (b) fix N₀ to the analytic threshold and carry the finite verification as an explicitly assumed Open child. Until then this child is infeasible as stated.
import Mathlib
namespace Goldbach
/-- For a fixed threshold `N₀`, every even `n < N₀` in the range of Chen's theorem
admits the same prime + (prime or semiprime) representation. Typically verified computationally. -/
theorem chen_theorem_even_below_threshold (N₀ : ℕ) :
∀ n : ℕ, Even n → n < N₀ →
∃ p q : ℕ, Nat.Prime p ∧
(Nat.Prime q ∨ ∃ r s : ℕ, Nat.Prime r ∧ Nat.Prime s ∧ q = r * s) ∧ n = p + q := by sorry
end Goldbach