Proved
LL_Linnik1536a.four_pow_lenumber-theory
For every natural , .
Preamble
import Mathlib import Definitions.Def_LL_Linnik1536a_Gpow import Definitions.Def_LL_Linnik1536a_Spow import Definitions.Def_LL_Linnik1536a_EL import Definitions.Def_LL_Linnik1536a_devSet open Real MeasureTheory Finset
Formal statement
namespace LL_Linnik1536a theorem four_pow_le (j : ℕ) : (4 : ℝ) ^ j ≤ (2 * j + 1) * Nat.centralBinom j := by sorry end LL_Linnik1536a
Source
J. Pintz and I. Z. Ruzsa, On Linnik's approximation to Goldbach's problem, I, Acta Arith. 109 (2003), 169-194, Sections 4 and 7
Read-back
What the Lean code literally says, in plain math · claude-haiku
Binders: natural, no hypotheses. The conclusion is as real numbers, for every natural including . Sample values: , , .
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.