Why Multiply the Series?
A function can be built from familiar pieces even when its Taylor series is not immediately visible. For \(f(x)=\sqrt{1+x}\ln(1+x)\), the square-root factor has a binomial series and the logarithm has a Maclaurin series. Multiplying those expansions produces a series for the product, but the coefficients must be combined carefully.
The central calculation is called coefficient convolution: the coefficient of \(x^n\) in a product receives contributions from every pair of terms whose powers add to \(n\). After finding the coefficients, we must separately determine where the series converges, including at the boundary points.
The Two Series and Their Product
For \(|x|<1\), the binomial expansion with exponent \(1/2\) gives
The generalized binomial coefficient is defined by \(\binom{\alpha}{0}=1\) and, for \(k\geq 1\), by \(\binom{\alpha}{k}=\alpha(\alpha-1)\cdots(\alpha-k+1)/k!\). The logarithm expansion, also valid for \(|x|<1\), is
Write \(b_k=\binom{1/2}{k}\) and \(l_m=(-1)^{m+1}/m\) for \(m\geq1\), with \(l_0=0\). If the product is written as \(\sum_{n=0}^{\infty}c_nx^n\), then
Because \(l_0=0\), \(c_0=0\). For \(n\geq1\), the same formula can be written explicitly as
Worked Example: Computing the First Coefficients
Worked Example: Computing the First Coefficients
Find \(c_1,c_2,c_3,c_4\) by convolution. For \(n=1\), only \(b_0l_1\) contributes, so \(c_1=1\cdot1=1\).
For \(n=2\), the contributing pairs are \((b_0,l_2)\) and \((b_1,l_1)\):
For \(n=3\), the three contributions are
For \(n=4\), include all four pairs whose indices sum to \(4\):
Thus the series begins \(x-\frac1{24}x^3+\frac1{24}x^4+\cdots\). As a check, multiplying the input series through degree \(4\) gives the same coefficients: the \(x^2\) coefficient is \(-1/2+1/2=0\), the \(x^3\) coefficient is \(1/3-1/4-1/8=-1/24\), and the \(x^4\) coefficient is \(-1/4+1/6+1/16+1/16=1/24\).
Why Convolution Gives the Coefficients
For finite polynomials, the coefficient of \(x^n\) in a product comes from multiplying a term \(b_kx^k\) by a term \(l_mx^m\) with \(k+m=n\). Therefore that coefficient is the sum of all \(b_kl_m\) with \(m=n-k\). For power series, the same coefficient rule holds when the Cauchy product is valid. Here both series converge absolutely for \(|x|<1\), which is sufficient for the product series to converge to the product there.
It is useful to have a second expression for \(c_n\). For a parameter \(a\), the coefficient of \(x^n\) in \((1+x)^a\) is \(B_n(a)=a(a-1)\cdots(a-n+1)/n!\), with \(B_0(a)=1\). Differentiating with respect to \(a\) gives the coefficient of \(x^n\) in \((1+x)^a\ln(1+x)\). At \(a=1/2\), this is the product under consideration.
For \(n\geq1\), differentiating the finite product gives \(B_n'(a)=B_n(a)\sum_{j=0}^{n-1}1/(a-j)\), at values of \(a\) where the displayed factors are nonzero.
The derivative of \((1+x)^a\) with respect to \(a\) is \((1+x)^a\ln(1+x)\). Hence \(c_n=B_n'(1/2)\).
Substitution yields \(c_n=\binom{1/2}{n}\sum_{j=0}^{n-1}1/(1/2-j)\). This agrees with the convolution coefficients.
The differentiation can be performed for \(|x|<1\), where the binomial series and its parameter derivative are valid locally uniformly for \(a\) near \(1/2\). The resulting formula is also a useful way to estimate the coefficients at the boundary.
Worked Example: Checking the Parameter Formula
Worked Example: Checking the Parameter Formula
Use the formula to verify \(c_3\). First,
The reciprocal sum is
Therefore
This matches the direct convolution calculation. In the same formula, \(c_1=(1/2)(2)=1\), and \(c_2=(-1/8)(2-2)=0\), providing two further checks.
The Radius and the Endpoints
The two original series both have radius of convergence \(1\), so their product series certainly represents the function for \(|x|<1\). To settle the full interval of convergence, we need to examine the coefficients and then check the endpoints rather than infer their behavior from the open interval.
For \(n\geq1\), the exact formula above gives a useful bound. The reciprocal sum satisfies
Indeed, after the first term its terms have magnitudes \(1/(j-1/2)\), whose sum grows at most proportionally to the harmonic sum. Also, \(\left|\binom{1/2}{n}\right|=O(n^{-3/2})\): this follows, for example, by expressing its magnitude using a central binomial coefficient and applying Stirling’s estimate. Consequently,
The comparison series \(\sum_{n=1}^{\infty}\log(n+1)/n^{3/2}\) converges, so \(\sum |c_n|\) converges. Thus the product series converges absolutely at both \(x=1\) and \(x=-1\). The same coefficient estimate, together with the reciprocal sum’s logarithmic growth and the binomial coefficient’s \(n^{-3/2}\) scale, shows that the coefficients have \(n\)th-root limit \(1\); hence the radius is exactly \(1\), not larger.
At \(x=1\), the series equals the limit of the product as \(x\) approaches \(1\) from within the interval, namely \(\sqrt{2}\ln 2\). At \(x=-1\), the product has limiting value \(0\). To see the latter, put \(u=1+x\); then \(\sqrt{1+x}\ln(1+x)=\sqrt{u}\ln u\), which tends to \(0\) as \(u\) decreases to \(0\). Absolute convergence at each endpoint allows the sum there to agree with this radial limit. Therefore the interval of convergence is \([-1,1]\), and the series represents the continuous endpoint values as well.
Worked Example: Evaluating the Series at an Endpoint
Worked Example: Evaluating the Series at an Endpoint
At \(x=-1\), the series has terms \(c_n(-1)^n\). The absolute coefficient estimate gives
for some constant \(C\) and all sufficiently large \(n\). Thus the endpoint series converges absolutely. For \(-1<x<1\), its sum is \(\sqrt{1+x}\ln(1+x)\); taking the limit as \(x\) decreases to \(-1\) gives \(0\). Absolute convergence ensures the endpoint sum is this same limit. The check against the function is \(\lim_{u\to0^+}\sqrt{u}\ln u=0\), so the endpoint value agrees.
Common Pitfall: Stopping at the Open Interval
A frequent error is to conclude that the product series is valid only for \(-1<x<1\) because that is where the two input series converge absolutely. That establishes the product inside the interval, but it does not determine convergence at either endpoint. Conversely, substituting an endpoint into each input series and multiplying their sums can be invalid if one of those series does not converge there in the required way.
For this product, the coefficient estimate proves absolute convergence at both endpoints. The endpoint values are \(0\) at \(x=-1\) and \(\sqrt{2}\ln 2\) at \(x=1\). The complete interval is therefore \([-1,1]\), not merely the open interval.
Summary
The construction combines the binomial series for \(\sqrt{1+x}\) and the logarithm series for \(\ln(1+x)\). Their coefficients combine by finite convolution, and the first terms are
The exact coefficient formula and its estimate show that the radius of convergence is \(1\), while the endpoint coefficients are absolutely summable. The series therefore converges throughout \([-1,1]\) and represents the product there, using the limiting value \(0\) at \(x=-1\).
Check Your Understanding
Use the coefficient formula and endpoint reasoning to test your understanding.
- Write the convolution formula for the coefficient of \(x^n\) in the product, and explain why the sum is finite.
- Compute \(c_2\) and \(c_3\) directly from the two factor series.
- Why is absolute convergence of both factor series sufficient for the Cauchy product when \(|x|<1\)?
- What coefficient estimate proves absolute convergence at both endpoints?
- What are the series’ sums at \(x=-1\) and \(x=1\), and how can each be checked against the product function?