Problem 13 - Complex Analysis

Question

Let \(\left(a_{n}\right)_{n \geq 0}\) and \(\left(b_{n}\right)_{n \geq 0}\) be two sequences of complex numbers and $$ A_{n}:=a_{0}+a_{1}+\cdots+a_{n}, \quad n \in \mathbb{N}_{0} $$ Show: For each \(m \geq 0\) and each \(n \geq m\) we have $$ \sum_{\nu=m}^{n} a_{\nu} b_{\nu}=\sum_{\nu=m}^{n} A_{\nu}\left(b_{\nu}-b_{\nu+1}\right)-A_{m-1} b_{m}+A_{n} b_{n+1} $$ (ABEL's partial summation, N. H. ABEL, 1826 ) where in the case \(m=0\) we set \(A_{-1}=0\) (empty sum).

Step-by-Step Solution

Answer

Use Abel's partial summation formula to restructure the series through indexing and sum manipulation.

Step 1: Express the sum as a telescopic sum

Observe that the sum \( \sum_{u=m}^{n} a_{u} b_{u} \) can be expressed as a telescopic sum. Consider the sequence where \( b_{u+1} \) is re-indexed and rewritten to frame the original series in a different light.

Step 2: Define and rearrange the terms

For \( m \leq u \leq n \), note that \( a_{u} = A_{u} - A_{u - 1} \). Hence the original expression becomes: \[ \sum_{u=m}^{n} (A_{u} - A_{u-1}) b_{u} = \sum_{u=m}^{n} A_{u} b_{u} - \sum_{u=m}^{n} A_{u-1} b_{u}. \]

Step 3: Transform the sums using partial fractions

Shift indices and rearrange terms to simplify: shift index of second sum to start at \( u = m \) by relabeling \( u \) to \( u + 1 \). You can then write: \[ \sum_{u=m}^{n} A_{u-1} b_{u} = \sum_{u=m-1}^{n-1} A_{u} b_{u+1}. \] Therefore, the expression becomes: \[ \sum_{u=m}^{n} A_{u} (b_{u} - b_{u+1}) + A_{n}b_{n+1} - A_{m-1}b_{m}. \]

Step 4: Combine terms

Compare the final expression \[ \sum_{u=m}^{n} a_{u} b_{u} = \sum_{u=m}^{n} A_{u} (b_{u} - b_{u+1}) - A_{m-1} b_{m} + A_{n} b_{n+1} \] with the required result. This confirms the original identity and completes the proof.

Key Concepts

Abel's Partial Summation

Abel's Partial Summation is a powerful technique used to transform sums into a more manageable form, especially when dealing with sequences. This method becomes particularly handy when studying series in calculus and analysis involving complex numbers. The primary idea behind Abel's partial summation is to utilize the partial sums of a sequence, also known as the running totals up to a certain point. It re-expresses the sum of products, \(\sum a_{n}b_{n}\), into a form that may reveal convergence or other properties more clearly.
Here is how it works:

• The sum of products is transformed by iterating through a combination of summands and recombining them.
• By redistributing terms, one sum cancels out another, eliminating specific terms, a key feature that's closely related to the telescopic sum principle.
• Each term in the rewritten sum has a straightforward form, allowing one to analyze the behavior of the summation integratively.

The adjusted form is often easier to evaluate in a calculative manner or to apply convergence tests on, facilitating deeper analysis.

Telescopic Sum

A telescopic sum is a mathematical series where most of the terms cancel each other out in sequence. This technique is analogous to a telescope collapsing onto itself, simplifying the series.
In the context of the exercise, telescopic sums are employed through:

• Expressing differences: Instead of adding each term in a series one by one, terms are expressed as a difference between consecutive sums (e.g., \(A_{u} - A_{u-1}\)).
• Cancellation over a range: As each intermediate term cancels with part of the next, only a few terms survive.
• Simplification of summation: This results in a series that can be analyzed by examining the endpoints, making precise calculations more straightforward.

Understanding telescopic sums allows the transformation of complex series into more manageable pieces, aligning them better for summation or further mathematical manipulation.

Complex Numbers

Complex numbers extend our familiar number system to include numbers in the form of \(a + bi\) where \(a\) and \(b\) are real numbers, and \(i\) is the imaginary unit, satisfying \(i^2 = -1\). They are vital in many areas of mathematics because they allow for solutions to all polynomial equations.
In the context of sequences and summation, complex numbers:

• Allow flexibility: The sequences involved might not always be real, leading to more generalized results.
• Enable rotation and scaling: Complex coefficients can rotate or scale sequence values, offering deeper insights into the sum or convergence behavior of the series.
• Make analysis comprehensive: Complex sequences provide a richer framework for solving problems where real-only solutions might fall short or become overly complicated.

These properties make complex numbers a natural fit for tackling complex sequences and mathematical summations.

Mathematical Induction

Mathematical induction is a proof technique used to demonstrate the truth of an infinite number of cases, typically involving an integer sequence. It is structured similarly to dominoes falling, where proving one case leads directly to proving the next.
To use mathematical induction:

• Base Case: First, prove the statement is true for an initial value (often for \(n = 0\) or \(n = 1\)). This serves as your starting point.
• Inductive Step: Assume the statement is true for \(n = k\). Then prove it holds for the next integer, \(n = k + 1\).
• Conclusion: If both the base case and inductive step are true, then by induction, the statement is true for all integers starting from the base case.

In the exercise, mathematical induction could be potentially used to prove properties related to the sequence sums, ensuring they hold for all relevant indices.