Weighted coefficient bound for a product of power series
ProvedOAI.PiExponent.LiteralAnalytic.coeff_mul_norm_le_choose_weighted_succ_generalnumber-theoryopenai-pi-exponent-017
For nonnegative C and k ≥ 1, if the coefficients of f satisfy the degree-r binomial bound with scale C^k and the coefficients of g are bounded by C, then the degree-n coefficient of f*g satisfies the successor binomial bound.
Preamble
import Mathlib.Tactic import Mathlib.RingTheory.PowerSeries.Order open scoped BigOperators
Formal statement
theorem OAI.PiExponent.LiteralAnalytic.coeff_mul_norm_le_choose_weighted_succ_general
(f g : PowerSeries ℂ) (k n : ℕ) (C : ℝ)
(hC : 0 ≤ C)
(hf : ∀ r, ‖PowerSeries.coeff r f‖ ≤
C ^ k * (Nat.choose (r + k - 1) r : ℝ))
(hg : ∀ r, ‖PowerSeries.coeff r g‖ ≤ C)
(hk : 1 ≤ k) :
‖PowerSeries.coeff n (f * g)‖ ≤
C ^ (k + 1) * (Nat.choose (n + (k + 1) - 1) n : ℝ) := by
sorrySource