Understanding the Cauchy-Hadamard Formula: Finding the Convergence of a Power Series

Introduction

Have you ever wondered how mathematicians determine whether an infinite series makes sense for different values? When dealing with power series—expressions like:

S = a_0 + a_1z + a_2z^2 + a_3z^3 + ...

we need to check where this series actually sums to a meaningful number. The Cauchy-Hadamard formula helps us do exactly that!

In this post, we will break down this formula step by step in a way that is easy to understand. By the end, you’ll be able to find the radius of convergence of a power series using simple calculations. Let's dive in!

Understanding the Radius of Convergence

A power series is a type of infinite sum where each term includes a power of a variable z. But for what values of z does this series actually add up to a meaningful number?

The radius of convergence RR is the boundary that tells us where the series behaves well. If we pick a value of z inside this boundary, the series will add up to a finite number. Outside this boundary, the sum might go off to infinity, which is not useful.

The Cauchy-Hadamard formula tells us how to find RR:

R = 1 / lim sup (|a_n|^(1/n))

where lim sup stands for limit superior, which means we look at the largest values that occur as n gets really big.

Step-by-Step Explanation of the Formula

Let’s break the formula down:

  1. Take the absolute value of the coefficients: If the power series is

    S = a_0 + a_1z + a_2z^2 + a_3z^3 + ...

    then we focus on |a_n|, which is just the absolute value of each coefficient.

  2. Compute the nth root: This means taking |a_n|^(1/n) for each coefficient.

  3. Find the limit superior: This part, lim sup, means we look at what happens to the biggest values of |a_n|^(1/n) as n grows very large.

  4. Take the reciprocal: Finally, we take 1 divided by this number to find RR, the radius of convergence.

If the result is R = 3, for example, it means the power series is valid for all |z| < 3, but not necessarily for |z| ≥ 3.

Example 1: Finding the Radius of Convergence

Let's find the radius of convergence for the series:

S = 1 + (1/2)z + (1/3)z^2 + (1/4)z^3 + ...

Here, the coefficients are a_n = 1/(n+1).

  1. Compute the nth root:

    (|a_n|)^(1/n) = (1/(n+1))^(1/n)

  2. Take the lim sup (largest limit value):

    As n gets really large, the term (1/(n+1))^(1/n) behaves like 1.

  3. Apply the formula:

    R = 1 / 1 = 1

So, the radius of convergence is R = 1, meaning this power series converges for all |z| < 1.

Example 2: When the Series Converges Everywhere

Consider the famous series:

S = 1 + (1/2!)z + (1/3!)z^2 + (1/4!)z^3 + ...

where a_n = 1/n!.

  1. Compute the nth root:

    (|a_n|)^(1/n) = (1/n!)^(1/n)

  2. Take the lim sup:

    Since factorials grow extremely fast, the value of (1/n!)^(1/n) gets smaller and smaller, approaching 0.

  3. Apply the formula:

    R = 1 / 0 = ∞

So, this power series converges for all values of z (entirely in the complex plane)!

Conclusion

The Cauchy-Hadamard formula gives us a way to determine the valid range of a power series. By following these steps:

  1. Take the absolute value of coefficients.
  2. Compute the nth root.
  3. Find the lim sup.
  4. Take the reciprocal.

we can easily determine where the series converges. If the radius is finite, the series works only within a disk of that size. If R = ∞, the series converges everywhere.

Understanding this method is crucial for deeper studies in calculus and beyond. Try applying this formula to other power series and see what you get.

Comments

Post a Comment

Popular posts from this blog

What is Mathematical Fluency?

What does it really mean for students to be mathematically fluent? If you’ve been in any math PD over the past few years, you’ve likely heard the phrase everywhere. We talk about fluency as something students should develop, strengthen, and demonstrate, but it can still feel abstract when we try to describe it in observable, classroom-ready terms. This post breaks down mathematical fluency into the two simplest frames we can use as teachers: what it looks like and what it sounds like . These descriptions can guide instruction, assessment, student goal-setting, and even walkthrough conversations with colleagues or administrators. What Mathematical Fluency Looks Like In a classroom where students are developing mathematical fluency, you see students making choices about strategies rather than following steps robotically. They use representations—number lines, diagrams, tables, graphs, manipulatives, symbolic expressions—and switch between them to make sense of a problem. They move ...
Read more

Unlocking the Group: Cosets, Cayley’s Theorem, and Lagrange’s Theorem

Mathematics is full of elegant ideas that take simple definitions and build deep, powerful structures. In group theory, three such concepts—cosets, Cayley's Theorem, and Lagrange’s Theorem—form a foundational trio that unveils the internal symmetry of algebraic systems. Let’s explore what they mean and why they matter. What’s a Coset, Really? Imagine you have a group and a smaller subgroup inside it. Now, pick any element from the big group and use it to shift every element in the subgroup by multiplying on the left. The resulting set is called a left coset . You can also do this multiplication on the right, forming a right coset . These cosets aren’t usually groups themselves—but they do break the original group into equal-sized, non-overlapping pieces. Intuitively , cosets act like “shifts” of the subgroup across the whole group. Think of tiling a floor: each tile is a copy of the same shape (the subgroup) placed in different locations (cosets). Lagrange’s Theorem: Size Matt...
Read more

Verifying the Binomial Formula with Mathematical Induction

The binomial formula states: ( z 1 + z 2 ) n = ∑ k = 0 n ( n k ) z 1 n − k z 2 k (z_1 + z_2)^n = \sum_{k=0}^n \binom{n}{k} z_1^{n-k} z_2^k where ( n k ) = n ! k ! ( n − k ) ! \binom{n}{k} = \frac{n!}{k!(n-k)!} and n = 1 , 2 , … n = 1, 2, \ldots . This is a powerful formula in algebra, expressing the expansion of ( z 1 + z 2 ) n (z_1 + z_2)^n as a sum of terms involving powers of z 1 z_1 and z 2 z_2 . We’ll verify this formula using mathematical induction . Mathematical induction is a logical method to prove that a statement holds for all positive integers n n . The process involves two steps: Base Case : Verify the formula for the smallest value of n n , typically n = 1 n = 1 . Inductive Step : Assume the formula holds for some n = k n = k , and then prove it holds for n = k + 1 n = k+1 . Step 1: Base Case ( n = 1 n = 1 ) For n = 1 n = 1 , the formula becomes: ( z 1 + z 2 ) 1 = ∑ k = 0 1 ( 1 k ) z 1 1 − k z 2 k (z_1 + z_2)^1 = \sum_{k=0}^1 \binom{1}{k} z_1^{1-k} z_2^k L...
Read more