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

k_n_properties

PrimeNumberTheoremAnd.Unused.Hardy_Tauberian_theorem · PrimeNumberTheoremAnd/Unused/Hardy_Tauberian_theorem.lean:171 to 177

Mathematical statement

Exact Lean statement

lemma k_n_properties (ε : ℝ) (hε : 0 < ε) :
    Filter.IsBoundedUnder (· ≤ ·) Filter.atTop (fun (n : ℕ) => (n : ℝ) / Nat.floor (ε * n)) ∧
    ∀ᶠ n in Filter.atTop, 0 < Nat.floor (ε * n)

Complete declaration

Lean source

Canonical source
Full Lean sourceLean 4
lemma k_n_properties (ε : ) (hε : 0 < ε) :    Filter.IsBoundedUnder (·  ·) Filter.atTop (fun (n : ) => (n : ) / Nat.floor* n))     ᶠ n in Filter.atTop, 0 < Nat.floor* n) := by  constructor <;> norm_num [ Filter.IsBoundedUnder, Filter.IsBounded ];  · use 2 / ε;    exact  ⌈ε⁻¹ * 2⌉₊ + 1, fun n hn => by rw [ div_le_div_iff₀ ] <;> nlinarith [ Nat.le_ceil ( ε⁻¹ * 2 ), Nat.lt_of_ceil_lt hn, Nat.floor_le ( show 0  ε * ↑n by positivity ), Nat.lt_floor_add_one ( ε * ↑n ), mul_inv_cancel₀ ( ne_of_gt hε ), mul_div_cancel₀ ( 2 :  ) hε.ne' ] ;  · exact  1 / ε + 1, fun x hx => Nat.floor_pos.2 <| by nlinarith [ mul_div_cancel₀ 1 hε.ne' ]