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

BKLNW.rpow_le_of_pow_le

PrimeNumberTheoremAnd.IEANTN.BKLNW.BKLNW_tables · PrimeNumberTheoremAnd/IEANTN/BKLNW/BKLNW_tables.lean:86 to 100

Mathematical statement

Exact Lean statement

lemma rpow_le_of_pow_le {a c : ℝ} (ha : 0 ≤ a) (hc : 0 ≤ c) {p q : ℕ} (hq : q ≠ 0)
    (h : a ^ p ≤ c ^ q) : a ^ (p / (q : ℝ)) ≤ c

Complete declaration

Lean source

Canonical source
Full Lean sourceLean 4
lemma rpow_le_of_pow_le {a c : } (ha : 0  a) (hc : 0  c) {p q : } (hq : q  0)    (h : a ^ p  c ^ q) : a ^ (p / (q : ))  c := by  have hpow : (a ^ (p / (q : ))) ^ q = a ^ p := by    have hq' : (q : )  0 := by exact_mod_cast hq    calc      (a ^ (p / (q : ))) ^ q = a ^ ((p / (q : )) * q) := by        symm        exact Real.rpow_mul_natCast ha (p / (q : )) q      _ = a ^ (p : ) := by        field_simp [hq']      _ = a ^ p := by        simp [Real.rpow_natCast]  have h' : (a ^ (p / (q : ))) ^ q  c ^ q := by    simpa [hpow] using h  exact (pow_le_pow_iff_left₀ (by positivity) hc hq).1 h'