Ternary statement above
DefinitionLL_Decomp1535a_TernaryAboveFor a real , the statement that every odd natural number with is a sum of three primes.
Definition code
import Mathlib import Definitions.Def_LL_Decomp1535a_IsTernarySum namespace LL_Decomp1535a noncomputable section def TernaryAbove (C : ℝ) : Prop := ∀ n : ℕ, Odd n → C ≤ n → IsTernarySum n end end LL_Decomp1535a
Read-back
What the Lean code literally says, in plain math · claude-haiku
Read-back: TernaryAbove
Declaration. For a real number , the proposition holds exactly when, for every natural number :
Binders and hypotheses. There is one parameter, , and one universally quantified variable, . There are no other hypotheses or typeclass assumptions. The bound is an inequality in , with viewed as a real number. It is non-strict, so is included when is a natural number.
Predicate used. is taken from the imported definition bundle. Its meaning was not provided to me, so I have not expanded it. It must be checked separately.
Edge cases.
- Only odd are constrained. The value and all even impose no requirement.
- The proposition is never vacuous. For every real there are infinitely many odd natural numbers , so the condition always applies to infinitely many .
- If , every odd natural number must satisfy , including .
- Monotonicity: if , then implies .
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.