import OAI.NumberTheory.TwoPoint.Halasz.HalaszNormalizedStep namespace OAI /-! The geometric defect in the classical Vinogradov iteration. -/ namespace TwoPointCorrelations def halaszTriangularDegree (k : ℕ) : ℕ := k*(k-1)/2 def halaszTotalDegree (k : ℕ) : ℕ := k+halaszTriangularDegree k noncomputable def halaszClassicalDefect (k n : ℕ) : ℝ := (halaszTriangularDegree k:ℝ)*(1-1/(k:ℝ))^n noncomputable def halaszClassicalExponent (k n : ℕ) : ℝ := 2*(((n+1)*k:ℕ):ℝ)-(halaszTotalDegree k:ℝ)+halaszClassicalDefect k n lemma halasz_triangular_degree_cast {k : ℕ} (hk : 0 linarith [one_div_pos.mpr hk0] lemma halasz_classical_defect_bounds {k : ℕ} (hk : 0 exact (halasz_classical_exponent_zero k).ge | succ n ih => rw [halasz_classical_exponent_successor] linarith [hd n] · have hh := (halasz_classical_defect_bounds hk n).2 simp only [halaszClassicalExponent,halaszTotalDegree,Nat.cast_add, halaszStepExponent,Nat.cast_mul,Nat.cast_ofNat,Nat.cast_one] change 2*(((n:ℝ)+1)*k)-((k:ℝ)+(halaszTriangularDegree k:ℝ))+ halaszClassicalDefect k n ≤ 2*(((n:ℝ)+1)*k)+(halaszTriangularDegree k:ℝ) linarith [show (0:ℝ)≤(halaszTriangularDegree k:ℝ) from Nat.cast_nonneg _] lemma halasz_classical_exponent_normalization {k : ℕ} (hk : 0