Skip to main content
AlexKontorovich/PrimeNumberTheoremAnd
Source indexedlemma · leanprover/lean4:v4.32.0

R_linear_bound

PrimeNumberTheoremAnd.Consequences · PrimeNumberTheoremAnd/Consequences.lean:1846 to 1852

Mathematical statement

Exact Lean statement

lemma R_linear_bound (ε : ℝ) (hε : 0 < ε) : ∃ C, 0 ≤ C ∧ ∀ y, 1 ≤ y → |R y| ≤ ε * y + C

Complete declaration

Lean source

Canonical source
Full Lean sourceLean 4
lemma R_linear_bound (ε : ) (hε : 0 < ε) :  C, 0  C   y, 1  y  |R y|  ε * y + C := by  obtain A, hA :  A : , 0 < A   y : , A  y  |R y|  ε * y := by    have := R_isLittleO.def    rw [Filter.eventually_atTop] at this; rcases this with A, hA ; exact Max.max A 1, by positivity, fun y hy => by simpa [abs_of_nonneg (show 0  y by linarith [le_max_right A 1])] using hA y (le_trans (le_max_left A 1) hy)  obtain CA, hCA :  CA : ,  y  Set.Icc 0 A, |R y|  CA := by    exact R_locally_bounded A hA.1.le |> fun CA, hCA => CA, fun y hy => hCA y hy  exact Max.max CA 0, by positivity, fun y hy => if hy' : y  A then le_trans (hCA y by linarith, by linarith) (by linarith [le_max_left CA 0, le_max_right CA 0, show 0  ε * y by nlinarith]) else le_trans (hA.2 y (by linarith)) (by linarith [le_max_left CA 0, le_max_right CA 0, show 0  ε * y by nlinarith])