Bender's lemma
TheoremBender's lemma without a radius condition on the second series#✓fully proved
Let \((a_n)\) and \((b_n)\) be real sequences, let \(A(z) = \sum_n a_n z^n\) have radius of convergence \(\alpha \in [0, \infty]\), and let \(\beta \ge 0\) be a real number with \(\beta < \alpha\). Suppose that \(b_n \neq 0\) for all sufficiently large \(n\), that \(b_{n-1} / b_n \to \beta\) as \(n \to \infty\), and that \(A(\beta) \neq 0\). Then the coefficients \(c_n = \sum_{k=0}^{n} a_k b_{n-k}\) of the product of the formal power series \(\sum_n a_n z^n\) and \(\sum_n b_n z^n\) satisfy \(c_n \sim A(\beta) \, b_n\) as \(n \to \infty\).
Unlike Bender's original lemma, nothing is assumed about the radius of convergence of \(\sum_n b_n z^n\).
theorem bender_product_coefficient_asymptotic_general
(a b : ℕ → ℝ) (α : ENNReal) (β : NNReal)
(hA : (FormalMultilinearSeries.ofScalars ℝ a).radius = α)
(hαβ : ENNReal.ofNNReal β < α)
(hbnz : ∀ᶠ n in atTop, b n ≠ 0)
(hratio : Tendsto (fun n => b (n - 1) / b n) atTop (nhds (β : ℝ)))
(hAβ : FormalMultilinearSeries.ofScalarsSum (E := ℝ) a (β : ℝ) ≠ 0) :
Asymptotics.IsEquivalent atTop
(fun n => PowerSeries.coeff n (PowerSeries.mk a * PowerSeries.mk b))
(fun n => FormalMultilinearSeries.ofScalarsSum (E := ℝ) a (β : ℝ) * b n)
Used by 1
TheoremBender's lemma on coefficients of a product of power series#✓fully proved
Let \((a_n)\) and \((b_n)\) be real sequences such that \(A(z) = \sum_n a_n z^n\) has radius of convergence \(\alpha \in [0, \infty]\) and \(\sum_n b_n z^n\) has radius of convergence \(\beta\), where \(\beta \ge 0\) is a real number with \(\beta < \alpha\). Suppose that \(b_n \neq 0\) for all sufficiently large \(n\), that \(b_{n-1} / b_n \to \beta\) as \(n \to \infty\), and that \(A(\beta) \neq 0\). Then the coefficients \(c_n = \sum_{k=0}^{n} a_k b_{n-k}\) of the product of the formal power series \(\sum_n a_n z^n\) and \(\sum_n b_n z^n\) satisfy \(c_n \sim A(\beta) \, b_n\) as \(n \to \infty\).
The hypothesis that \(b_n\) is eventually nonzero makes the ratios \(b_{n-1} / b_n\) meaningful; with the convention \(x / 0 = 0\) the statement fails at \(\beta = 0\) without it: for \(A(z) = 1 + z\) and \(b\) vanishing at every even index and growing fast at odd indices, every ratio is \(0\) while the even product coefficients stay nonzero.
theorem bender_product_coefficient_asymptotic
(a b : ℕ → ℝ) (α : ENNReal) (β : NNReal)
(hA : (FormalMultilinearSeries.ofScalars ℝ a).radius = α)
(hB : (FormalMultilinearSeries.ofScalars ℝ b).radius = ENNReal.ofNNReal β)
(hαβ : ENNReal.ofNNReal β < α)
(hbnz : ∀ᶠ n in atTop, b n ≠ 0)
(hratio : Tendsto (fun n => b (n - 1) / b n) atTop (nhds (β : ℝ)))
(hAβ : FormalMultilinearSeries.ofScalarsSum (E := ℝ) a (β : ℝ) ≠ 0) :
Asymptotics.IsEquivalent atTop
(fun n => PowerSeries.coeff n (PowerSeries.mk a * PowerSeries.mk b))
(fun n => FormalMultilinearSeries.ofScalarsSum (E := ℝ) a (β : ℝ) * b n)
Sources
- Dennis E. Davenport, Louis W. Shapiro, Lara K. Pudwell, and Leon C. Woodson, "The Boundary of Ordered Trees," Journal of Integer Sequences 18 (2015). Source file: https://cs.uwaterloo.ca/journals/JIS/VOL18/Davenport/dav3.tex (Bender's lemma, lines 521-523). It follows from
bender_product_coefficient_asymptotic_general; the hypothesishBis unused and keeps the source's shape.
Uses 1
Loading dependency explorer…
The dependency explorer needs JavaScript and its graph data.