Bennett Two Beta Factor succ
ProvedD1Bound5.bennettTwoBetaFactor_succdiophantine-tuplesnumber-theory
The actual Gamma sequence obeys the rational recurrence used in the paper.
Preamble
import Lean.Elab.Tactic.Omega import Mathlib.Analysis.SpecialFunctions.Gaussian.GaussianIntegral import Mathlib.Tactic.FieldSimp import Mathlib.Tactic.Linarith import Mathlib.Tactic.NormNum import Mathlib.Tactic.Positivity import Mathlib.Tactic.Ring import Definitions.Def_D1Bound5_BennettTwoBetaBound_Definitions
Formal statement
section
namespace D1Bound5
theorem _root_.D1Bound5.bennettTwoBetaFactor_succ (k : ℕ) (hk : 1 ≤ k) :
bennettTwoBetaFactor (k + 1) = bennettTwoBetaFactor k *
(((27 / 4 : ℝ) * ((k : ℝ) + 3 / 2) * (2 * (k : ℝ) - 1 / 2) *
(2 * (k : ℝ) + 1 / 2)) /
((3 * (k : ℝ) + 1) * (3 * (k : ℝ) + 2) * (3 * (k : ℝ) + 3))) := by sorry
end D1Bound5
end
Source
D1Bound5/BennettTwoBetaBound.lean, lines 48-80, SHA-256 6be0ec4b4373f2704cbfdc6beb52a3796d8063f1c67fa2c91242af5752323182. Project: https://github.com/tomislav-math/d1-bound5-lean