my-server
← Wiki

Chain sequence

In the analytic theory of continued fractions, a chain sequence is an infinite sequence {a<sub>n</sub>} of non-negative real numbers chained together with another sequence {g<sub>n</sub>} of non-negative real numbers by the equations

where either (a) 0&nbsp;&le;&nbsp;g<sub>n</sub>&nbsp;<&nbsp;1, or (b) 0&nbsp;<&nbsp;g<sub>n</sub>&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

converges uniformly on the closed unit disk |z|&nbsp;&le;&nbsp;1 if the coefficients {a<sub>n</sub>} 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<sub>0</sub>&nbsp;=&nbsp;g<sub>1</sub>&nbsp;=&nbsp;g<sub>2</sub>&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<sup>2</sup> 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<sub>n</sub>}&nbsp;=&nbsp;{x}, and x&nbsp;<&nbsp;, the resulting sequence {a<sub>n</sub>} will be an endless repetition of a real number y that is less than .
  • The choice g<sub>n</sub>&nbsp;=&nbsp; is not the only set of generators for this particular chain sequence. Notice that setting
:
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),