import Development.AutomorphicArithmetic.CharacterBoxes.TwistForm open Formalism.HC UpperTheory.Top theorem UpperTheory.Top.winPairs : ∀ (ψ : PChar) (eps c : ℝ), 0 < eps → eps < 1 / 52 → 1 ≤ c → VWinAt ψ 401 → PairEx → ∃ J : ℝ, 1 ≤ J ∧ ∀ y : ℝ, ∃ Z : ℝ, y ≤ Z ∧ ∀ x : ℝ, Z ≤ x → x ≤ Z ^ ((3 : ℝ) / 2) → ∃ (Y : ℝ) (q d e : ℕ), WinDatum ψ eps J c x Y q d e := by intro ψ eps c heps heps52 hc hV hP obtain ⟨e, he⟩ := exists_pageN eps heps obtain ⟨J, hJ, X0, hX0⟩ := hV eps heps heps52 e he have hN : 0 < ψ.N := Nat.pos_of_ne_zero (NeZero.ne _) obtain ⟨Y1, hY1⟩ := hP ψ.N hN eps J heps heps52 hJ have ha : 0 < 2 + 8 * eps := by linarith have hc0 : 0 ≤ c := by linarith obtain ⟨k, hk1, hka⟩ : ∃ k : ℝ, 1 ≤ k ∧ k ^ (2 + 8 * eps) = c := by refine ⟨c ^ (1 / (2 + 8 * eps)), Real.one_le_rpow hc (one_div_nonneg.2 ha.le), ?_⟩ rw [one_div, Real.rpow_inv_rpow hc0 ha.ne'] have hk0 : 0 ≤ k := by linarith refine ⟨J, hJ, fun y => ?_⟩ have hJ0 : J ≠ 0 := ne_of_gt (by linarith) have hJi : 0 ≤ 1 / J := one_div_nonneg.2 (by linarith) obtain ⟨M, hM1, hMy, hMY1, hMk3, hMk400⟩ : ∃ M : ℝ, 1 ≤ M ∧ y ≤ M ∧ Y1 ≤ M ∧ k ^ (3 : ℝ) ≤ M ∧ k ^ (400 : ℝ) ≤ M := ⟨max 1 (max y (max Y1 (max (k ^ (3 : ℝ)) (k ^ (400 : ℝ))))), by simp, by simp, by simp, by simp, by simp⟩ obtain ⟨X, hXX0, hXM⟩ : ∃ X : ℝ, X0 ≤ X ∧ M ^ J ≤ X := ⟨max X0 (M ^ J), le_max_left _ _, le_max_right _ _⟩ have hM0 : 0 ≤ M := by linarith have hX1 : 1 ≤ X := (Real.one_le_rpow hM1 (by linarith)).trans hXM have hX0' : 0 ≤ X := by linarith have hY0M : M ≤ X ^ (1 / J) := by calc M = (M ^ J) ^ (1 / J) := by rw [one_div, Real.rpow_rpow_inv hM0 hJ0] _ ≤ X ^ (1 / J) := Real.rpow_le_rpow (Real.rpow_nonneg hM0 _) hXM hJi have hXJ : (X ^ (1 / J)) ^ J = X := by rw [one_div, Real.rpow_inv_rpow hX0' hJ0] obtain ⟨q, d, hpg⟩ := hY1 (X ^ (1 / J)) (hMY1.trans hY0M) obtain ⟨W, hW0, hW2, hWV⟩ := hX0 X hXX0 q d hpg.pair have hWM : M ≤ W := hY0M.trans hW0 have hW1 : 1 ≤ W := hM1.trans hWM have hWnn : 0 ≤ W := by linarith have hk3 : k ^ (3 : ℝ) ≤ W := hMk3.trans hWM have hlem : (k * W) ^ ((3 : ℝ) / 2) ≤ W ^ (2 : ℝ) := by have h1 : (k * W) ^ ((3 : ℝ) / 2) = ((k * W) ^ (3 : ℝ)) ^ ((1 : ℝ) / 2) := by rw [← Real.rpow_mul (mul_nonneg hk0 hWnn)] norm_num have h2 : W ^ (2 : ℝ) = (W ^ (4 : ℝ)) ^ ((1 : ℝ) / 2) := by rw [← Real.rpow_mul hWnn] norm_num rw [h1, h2] apply Real.rpow_le_rpow (Real.rpow_nonneg (mul_nonneg hk0 hWnn) _) _ (by norm_num) rw [Real.mul_rpow hk0 hWnn, show (4 : ℝ) = 1 + 3 by norm_num, Real.rpow_add (by linarith : 0 < W), Real.rpow_one] exact mul_le_mul_of_nonneg_right hk3 (Real.rpow_nonneg hWnn _) refine ⟨k * W, hMy.trans (hWM.trans (le_mul_of_one_le_left hWnn hk1)), fun x hZx hxZ => ?_⟩ have hkpos : 0 < k := by linarith have hxW2 : x ≤ W ^ (2 : ℝ) := hxZ.trans hlem have hxX : x ≤ X := hxW2.trans hW2 have hx1 : W ≤ x := (le_mul_of_one_le_left hWnn hk1).trans hZx have hx0 : 0 ≤ x := by linarith obtain ⟨x', rfl⟩ : ∃ x', x = k * x' := ⟨x / k, by field_simp⟩ have hWx' : W ≤ x' := le_of_mul_le_mul_left hZx hkpos have hx'0 : 0 ≤ x' := hWnn.trans hWx' have hx'1 : 1 ≤ x' := hW1.trans hWx' have hx'x : x' ≤ k * x' := le_mul_of_one_le_left hx'0 hk1 have hpage : x' ^ (2 + 8 * eps) ≤ 2 ^ (e x') ∧ 2 ^ (e x') ≤ 2 * x' ^ (2 + 8 * eps) := he x' hx'1 have hpow : (k * x') ^ (2 + 8 * eps) = c * x' ^ (2 + 8 * eps) := by rw [Real.mul_rpow hk0 hx'0, hka] refine ⟨X ^ (1 / J), q, d, e x', ?_, ?_, ?_, ?_, ?_, ?_⟩ · exact Real.rpow_le_rpow hx0 hxX hJi · exact hW0.trans hx1 · exact hpg.mono (by rw [hXJ]; exact hxX) · rw [hpow] exact mul_le_mul_of_nonneg_left hpage.1 hc0 · rw [hpow] calc c * 2 ^ (e x') ≤ c * (2 * x' ^ (2 + 8 * eps)) := mul_le_mul_of_nonneg_left hpage.2 hc0 _ = 2 * (c * x' ^ (2 + 8 * eps)) := by ring · intro E _ _ hE have hv := hWV x' hWx' (hx'x.trans hxW2) E hE refine hv.mono ?_ ?_ · apply Nat.floor_mono rw [Real.mul_rpow hk0 hx'0, show (401 : ℝ) = 1 + 400 by norm_num, Real.rpow_add (by linarith : 0 < x'), Real.rpow_one] exact mul_le_mul_of_nonneg_right (hMk400.trans (hWM.trans hWx')) (Real.rpow_nonneg hx'0 _) · exact Real.sqrt_le_sqrt (Real.exp_le_exp.2 (Real.rpow_le_rpow hx'0 hx'x heps.le))