Sum of three primes
DefinitionLL_Decomp1535a_IsTernarySumA natural number is a sum of three primes if there exist primes with .
import Mathlib namespace LL_Decomp1535a noncomputable section def IsTernarySum (n : ℕ) : Prop := ∃ p q r : ℕ, p.Prime ∧ q.Prime ∧ r.Prime ∧ p + q + r = n end end LL_Decomp1535a
Read-back
What the Lean code literally says, in plain math · claude-haiku
Read-back: IsTernarySum
This is a definition of a predicate on a natural number . The proposition holds exactly when there exist natural numbers , and such that , and are all prime and
Quantifiers. The existential ranges over all natural numbers. The three summands need not be distinct, so , or are all allowed.
Primality. Each of , , must be a prime in the usual sense: at least , with no divisors other than and itself. So and are never admissible summands, and the smallest admissible summand is .
Arithmetic. The sum is ordinary addition of natural numbers, with no truncation.
Edge cases. The smallest possible sum is . Hence is false for . It holds for (as ) and (as ). No hypothesis is imposed on , and the predicate is satisfiable, so it is not vacuous.
Scope. The file contains only this definition. It asserts no theorem by itself; it names the set of natural numbers expressible as a sum of three primes.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.