---
title: Chain sequence
slug: chain-sequence
qid: 
snapshot: enwiki-001377314497
content_hash: 
license: CC BY-SA 4.0
source: https://en.wikipedia.org/w/index.php?oldid=1377314497
tags: [25360575]
---

# Chain sequence

> [!note] Provenance
> Snapshot `enwiki-001377314497` · content root `…`
> Derived from <https://en.wikipedia.org/w/index.php?oldid=1377314497> · Licensed CC BY-SA 4.0

In the analytic theory of continued fractions, a chain sequence is an infinite sequence {a n } of non-negative real numbers chained together with another sequence {g n } of non-negative real numbers by the equations a_1 = (1-g_0)g_1 \quad a_2 = (1-g_1)g_2 \quad a_n = (1-g_{n-1})g_n where either (a) 0 &le; g n n &le; 1. Chain sequences arise in the study of the convergence problem &ndash; both in connection with the parabola theorem, and also as part of the theory of positive definite continued fractions. The infinite continued fraction of Worpitzky's theorem contains a chain sequence. A closely related theorem shows that f(z) = \cfrac{a_1z}{1 + \cfrac{a_2z}{1 + \cfrac{a_3z}{1 + \cfrac{a_4z}{\ddots}}}} \, converges uniformly on the closed unit disk |z| &le; 1 if the coefficients {a n } are a chain sequence.

In the analytic theory of continued fractions, a chain sequence is an infinite sequence {a n } of non-negative real numbers chained together with another sequence {g n } of non-negative real numbers by the equations a_1 = (1-g_0)g_1 \quad a_2 = (1-g_1)g_2 \quad a_n = (1-g_{n-1})g_n where either (a) 0&nbsp;&le;&nbsp;g n &nbsp; n &nbsp;&le;&nbsp;1. Chain sequences arise in the study of the convergence problem &ndash; both in connection with the parabola theorem, and also as part of the theory of positive definite continued fractions. The infinite continued fraction of Worpitzky's theorem contains a chain sequence. A closely related theorem shows that f(z) = \cfrac{a_1z}{1 + \cfrac{a_2z}{1 + \cfrac{a_3z}{1 + \cfrac{a_4z}{\ddots}}}} \, converges uniformly on the closed unit disk |z|&nbsp;&le;&nbsp;1 if the coefficients {a n } are a chain sequence. ==An example== The sequence { , , , ...} appears as a limiting case in the statement of Worpitzky's theorem. Since this sequence is generated by setting g 0 &nbsp;=&nbsp;g 1 &nbsp;=&nbsp;g 2 &nbsp;=&nbsp;... =&nbsp; , it is clearly a chain sequence. This sequence has two important properties. Since f(x)&nbsp;=&nbsp;x&nbsp;&minus;&nbsp;x 2 is a maximum when x&nbsp;=&nbsp; , this example is the "biggest" chain sequence that can be generated with a single generating element; or, more precisely, if {g n }&nbsp;=&nbsp;{x}, and x&nbsp; n } will be an endless repetition of a real number y that is less than . The choice g n &nbsp;=&nbsp; is not the only set of generators for this particular chain sequence. Notice that setting g_0 = 0 \quad g_1 = {\textstyle\frac{1}{4}} \quad g_2 = {\textstyle\frac{1}{3}} \quad g_3 = {\textstyle\frac{3}{8}} \;\dots generates the same unending sequence { , , , ...}. ==Notes== ==References== H. S. Wall, Analytic Theory of Continued Fractions, D. Van Nostrand Company, Inc., 1948; reprinted by Chelsea Publishing Company, (1973),
