Bennett Two Beta Factor pos

Proved

D1Bound5.bennettTwoBetaFactor_pos

by tp · Oct 24, 2026 · Mathlib 0df444a (Lean v4.33.1)

diophantine-tuplesnumber-theory

Auxiliary result bennettTwoBetaFactor_pos in the proof of the bound five for Diophantine D(1) sets in imaginary quadratic integer rings. The formal statement specifies its hypotheses and conclusion; a mathematical prose description remains to be supplied.

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_pos (k : ℕ) (hk : 1 ≤ k) :
    0 < bennettTwoBetaFactor k := by sorry













end D1Bound5
end

Source

D1Bound5/BennettTwoBetaBound.lean, lines 29-36, SHA-256 6be0ec4b4373f2704cbfdc6beb52a3796d8063f1c67fa2c91242af5752323182. Project: https://github.com/tomislav-math/d1-bound5-lean

View graph