Development/AbelianVarietyTheory/Proofs/GlobalInterpolation/ExistsRanksRankValFrame.lean
101theorem exists_ranks_cyclic_frame : ∀ eps : ℝ, 0 < eps → eps < 1 / 52 → ∃ x0 : ℝ, ∀ s : Scale, s.eps = eps → x0 ≤ s.x →102∃ R : Ranks, RankVal s R ∧ 2 ≤ R.e ∧ R.toFrame = Formalism.HC.cyclicFrame R.e := by103intro eps h0 h1104obtain ⟨x0, h⟩ := exists_ranks_rankVal_frame eps h0 h1105refine ⟨max x0 2, fun s hs hx => ?_⟩106have hx2 : (2 : ℝ) ≤ s.x := (le_max_right _ _).trans hx107have hH1 : s.x ^ 2 ≤ s.x ^ (2 + 8 * s.eps) := by108rw [← Real.rpow_natCast]109exact Real.rpow_le_rpow_of_exponent_le (by linarith) (by push_cast; linarith)110have p2 : 4 ≤ s.x ^ 2 := by nlinarith111obtain ⟨e, he1, he2⟩ := exists_two_pow_between (s.x ^ (2 + 8 * s.eps)) (by linarith)112have a5 : 2 ≤ e := by113have : ((4 : ℕ) : ℝ) ≤ ((2 ^ e : ℕ) : ℝ) := by114have : ((4 : ℕ) : ℝ) = 4 := by norm_num115linarith116have h4 : 2 ^ 2 ≤ 2 ^ e := by exact_mod_cast this117exact (Nat.pow_le_pow_iff_right (by norm_num)).1 h4118obtain ⟨R, hφ, hR⟩ := h s hs ((le_max_left _ _).trans hx) (Formalism.HC.cyclicFrame e)119he1 he2120have hRe : R.e = e := congrArg Formalism.HC.Frame.e hφ121exact ⟨R, hR, hRe ▸ a5, hRe ▸ hφ⟩122123end GlobalTheory.EX