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

Complex.logTaylor_succ_neg

PrimeNumberTheoremAnd.Mathlib.Analysis.SpecialFunctions.Complex.LogBounds · PrimeNumberTheoremAnd/Mathlib/Analysis/SpecialFunctions/Complex/LogBounds.lean:59 to 73

Mathematical statement

Exact Lean statement

lemma logTaylor_succ_neg (n : ℕ) (z : ℂ) :
    logTaylor (n + 1) (-z) = logTaylor n (-z) - z ^ n / n

Complete declaration

Lean source

Canonical source
Full Lean sourceLean 4
lemma logTaylor_succ_neg (n : ) (z : ℂ) :    logTaylor (n + 1) (-z) = logTaylor n (-z) - z ^ n / n := by  rw [logTaylor_succ, Pi.add_apply]  have hsign : (-1 : ℂ) ^ (n + 1) * (-z) ^ n = -z ^ n := by    have hzpow : (-z) ^ n = (((-1 : ℂ) * z) ^ n) := by simp    rw [hzpow, mul_pow,  mul_assoc,  pow_add]    have hpow : (-1 : ℂ) ^ (n + 1 + n) = (-1 : ℂ) := by      rw [show n + 1 + n = 2 * n + 1 by omega, pow_add, pow_mul]      norm_num    rw [hpow]    ring  rw [show (-1 : ℂ) ^ (n + 1) * (-z) ^ n / n = -(z ^ n / n) by    rw [hsign]    ring]  abel