English

A Composition Theorem for Binomially Weighted Averages

General Mathematics 2026-04-16 v1

Abstract

We study binomially weighted summation methods given by (xn)nN(k=0n(nk)rk(1r)nkxk)nN (x_n)_{n\in \mathbb{N}} \mapsto \left(\sum_{k=0}^n\binom{n}{k}r^k(1-r)^{n-k}x_k\right)_{n\in \mathbb{N}} for r(0,1)r\in (0,1), and their behavior under composition with summation methods of the form (xn)nN(k=0nλkxnk)nN. (x_n)_{n\in \mathbb{N}} \mapsto \left(\sum_{k=0}^n\lambda_k x_{n-k}\right)_{n\in \mathbb{N}}. Our main result shows that if the binomially weighted averages of a sequence (xn)nN(x_n)_{n\in \mathbb{N}} converge to a limit then the binomially weighted averages of the sequence (k=0nλkxnk)nN\left(\sum_{k=0}^n\lambda_kx_{n-k}\right)_{n\in \mathbb{N}} converge to the same limit whenever (λn)nN(\lambda_n)_{n\in\mathbb{N}} is an absolutely summable sequence with k=0λk=1\sum_{k=0}^{\infty}\lambda_k = 1. This result disproves a theorem appearing in the literature. Additionally, we discuss applications and extensions of our main result to compositions with weighted Ces\`aro averages.

Keywords

Cite

@article{arxiv.2604.13086,
  title  = {A Composition Theorem for Binomially Weighted Averages},
  author = {Andy Liu and Michael Reilly},
  journal= {arXiv preprint arXiv:2604.13086},
  year   = {2026}
}
R2 v1 2026-07-01T12:09:26.237Z