Math 2.0

Functions of a complex variable Proof

Proof of the ratio formula for the radius of convergence

Builds on Radius of convergencePower seriesEpsilon-N definition of the limit of a sequenceSupremumBinomial theoremThe reals are Archimedean

Proof

We compare consecutive terms ∣an∣rn\abs{a_n} r^n directly, as in the ratio test.

  1. Let ∑an(x−c)n\sum a_n (x - c)^n be a real power series. Let n0n_0 be such that an≠0a_n \ne 0 for all n≥n0n \ge n_0.
  2. For n≥n0n \ge n_0 let ρn=∣an+1∣/∣an∣\rho_n = \abs{a_{n+1}} / \abs{a_n}. By hypothesis ρn→L∈[0,∞]\rho_n \to L \in [0, \infty]. When L=∞L = \infty, this means that for each KK there is NN with ρn>K\rho_n > K for all n≥Nn \ge N.
  3. Let TT be the set of r≥0r \ge 0 for which (∣an∣rn)(\abs{a_n} r^n) is bounded. By the definition, R=sup⁡TR = \sup T, with R=∞R = \infty when TT is not bounded above.
  4. The number 00 lies in TT, since ∣an∣0n=0\abs{a_n} 0^n = 0 for n≥1n \ge 1.
  5. Claim A: if L<∞L < \infty, r>0r > 0 and rL<1r L < 1, then r∈Tr \in T. To see this, pick qq with rL<q<1r L < q < 1. Then L<q/rL < q / r.
  6. By the epsilon-N form with ε=q/r−L\varepsilon = q/r - L, there is N≥n0N \ge n_0 with ρn<q/r\rho_n < q / r for all n≥Nn \ge N.
  7. For n≥Nn \ge N, step 6 gives ∣an+1∣rn+1=ρnr∣an∣rn<q∣an∣rn≤∣an∣rn\abs{a_{n+1}} r^{n+1} = \rho_n r \abs{a_n} r^n < q \abs{a_n} r^n \le \abs{a_n} r^n.
  8. By induction on nn, step 7 gives ∣an∣rn≤∣aN∣rN\abs{a_n} r^n \le \abs{a_N} r^N for all n≥Nn \ge N. The finitely many terms with n<Nn < N are bounded by their maximum. So r∈Tr \in T.
  9. Claim B: if L>0L > 0, r>0r > 0 and rL>1r L > 1, then r∉Tr \notin T. Here rL>1r L > 1 is read as true for all r>0r > 0 when L=∞L = \infty.
  10. Pick qq with 1<q<rL1 < q < r L. When L=∞L = \infty, take q=2q = 2. Then q/r<Lq / r < L.
  11. If L<∞L < \infty, the epsilon-N form with ε=L−q/r\varepsilon = L - q/r gives N≥n0N \ge n_0 with ρn>q/r\rho_n > q/r for n≥Nn \ge N. If L=∞L = \infty, step 2 with K=q/rK = q/r gives such an NN.
  12. For n≥Nn \ge N, as in step 7, ∣an+1∣rn+1>q∣an∣rn\abs{a_{n+1}} r^{n+1} > q \abs{a_n} r^n. By induction, ∣an∣rn≥Dqn−N\abs{a_n} r^n \ge D q^{n - N} for all n≥Nn \ge N, where D=∣aN∣rN>0D = \abs{a_N} r^N > 0.
  13. By the binomial theorem, qj=(1+(q−1))j≥1+j(q−1)q^j = (1 + (q - 1))^j \ge 1 + j (q - 1) for all natural numbers jj, since every term of the expansion is nonnegative.
  14. Let CC be a real number. The reals are Archimedean, so there is jj with Dj(q−1)>CD j (q - 1) > C. Then n=N+jn = N + j gives ∣an∣rn≥D(1+j(q−1))>C\abs{a_n} r^n \ge D (1 + j(q-1)) > C.
  15. So (∣an∣rn)(\abs{a_n} r^n) is not bounded, and r∉Tr \notin T.
  16. Case L=0L = 0. Claim A gives every r>0r > 0 in TT. So TT is not bounded above, and R=∞=1/LR = \infty = 1/L.
  17. Case L=∞L = \infty. Claim B and step 4 give T={0}T = \set{0}. So R=0=1/LR = 0 = 1/L.
  18. Case 0<L<∞0 < L < \infty. By Claim B, 1/L1/L is an upper bound of TT. By Claim A, every rr with 0<r<1/L0 < r < 1/L lies in TT.
  19. So no number below 1/L1/L is an upper bound of TT. By the definition of the supremum, R=1/LR = 1/L.
  20. In all cases R=1/LR = 1/L, with the conventions 1/0=∞1/0 = \infty and 1/∞=01/\infty = 0.

Idea

If ∣an+1∣/∣an∣\abs{a_{n+1}} / \abs{a_n} is close to LL, then ∣an∣rn\abs{a_n} r^n is eventually multiplied by about LrL r at each step. When Lr<1L r < 1 the terms shrink, and when Lr>1L r > 1 they grow like a geometric sequence with ratio above 11. So the cutoff is r=1/Lr = 1/L.

Reading path

To understand this page from the ground up, read these 58 pages in order. The foundations come first. The path takes the proofs Proof of the approximation property of the supremum, Proof that the reals form an ordered field, with the Cauchy sequence construction, Proof of Pascal's rule from the recursive definition, Proof of the epsilon-N definition of the limit of a sequence, Proof of the factorial formula for binomial coefficients by induction, Proof of the binomial theorem by induction, Proof that the reals are Archimedean from the completeness axiom.

  1. Binomial coefficient definition
  2. Construction of the reals from Cauchy sequences concept
  3. Element definition
  4. Factorial definition
  5. Group concept
  6. Integers object
  7. Ordered field definition
  8. Proposition concept
  9. Rational numbers object
  10. Real numbers object
  11. Sequence definition
  12. Set bounded above definition
  13. Proof of Pascal's rule from the recursive definition proof
  14. Set definition
  15. Ring definition
  16. Ring of integers statement
  17. Archimedean ordered field definition
  18. Implication definition
  19. Predicate definition
  20. The reals form a field statement
  21. Real sequence definition
  22. Supremum definition
  23. Pascal's rule statement
  24. Ordered pair definition
  25. Commutative ring definition
  26. The rationals form a field statement
  27. Universal quantifier definition
  28. Bounded sequence definition
  29. Limit of a sequence definition
  30. Series definition
  31. Completeness axiom statement
  32. Cartesian product definition
  33. Proof of the factorial formula for binomial coefficients by induction proof
  34. Subset definition
  35. The rationals form an ordered field statement
  36. Power series definition
  37. Binary relation definition
  38. Factorial formula for binomial coefficients statement
  39. Order on the reals definition
  40. Radius of convergence definition
  41. Antisymmetric relation definition
  42. Reflexive relation definition
  43. Transitive relation definition
  44. Proof of the binomial theorem by induction proof
  45. Binomial theorem statement
  46. Preorder definition
  47. Partial order definition
  48. Total order definition
  49. Proof that the reals form an ordered field, with the Cauchy sequence construction proof
  50. The reals form an ordered field statement
  51. Absolute value definition
  52. Proof of the approximation property of the supremum proof
  53. Proof of the epsilon-N definition of the limit of a sequence proof
  54. Approximation property of the supremum statement
  55. Epsilon-N definition of the limit of a sequence statement
  56. Proof that the reals are Archimedean from the completeness axiom proof
  57. The reals are Archimedean statement
  58. Proof of the ratio formula for the radius of convergence proof

Where this leads

396 pages build on this one.

Further reading

  1. Web https://en.wikipedia.org/wiki/Radius_of_convergence, Theoretical radius
About this page
TagWV3KXKPG7T
URIm2://WV3KXKPG7T
Kindproof
WritingW0 stub
MSC30B10
ProvesRatio formula for the radius of convergence
UsesRadius of convergence, Power series, Epsilon-N definition of the limit of a sequence, Supremum, Binomial theorem, The reals are Archimedean
Changed4 November 2026

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • an inventory row: the row of the inventory that the node accounts for (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

No page links to this page yet.