Sequences

A sequence is a function which takes natural numbers as inputs, and returns numbers as outputs.

The Cauchy condition

Suppose that Failed to parse (SVG (MathML can be enabled via browser plugin): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle \{ a_n \}_{n=1}^\infty} is a sequence that computes π.

The practical question to answer, for someone computing this sequence on a computer, is "after how many steps can I stop running the computer program?" The answer is that you should wait until successive steps of the sequence vary by amounts smaller than your desired accuracy.

For example, if your target accuracy is 0.01, and if the printout looks like

Failed to parse (SVG (MathML can be enabled via browser plugin): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle n}	Failed to parse (SVG (MathML can be enabled via browser plugin): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle a_n}
1	4
2	3.0
3	3.2
4	3.09
5	3.16
6	3.139
7	3.143
8	3.1408
9	3.1419
10	3.14149
...	...

then we can stop computing around step 9, because at that point the output of the programming is varying by amounts much smaller than 0.01.

What I have done in the above paragraph is I have inadvertently assumed that the sequence satisfies the Cauchy condition. A sequence is said to satisfy the Cauchy condition if, for any level of desired accuracy, there is some point beyond which any two outputs of the algorithm differ by an amount smaller than the desired accuracy. More formally, Failed to parse (SVG (MathML can be enabled via browser plugin): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle \{a_n\}_{n=1}^\infty} satisfies the Cauchy condition if for any Failed to parse (SVG (MathML can be enabled via browser plugin): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle \epsilon : \mathbb{Q}} such that Failed to parse (SVG (MathML can be enabled via browser plugin): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle \epsilon > 0, } there exists an Failed to parse (SVG (MathML can be enabled via browser plugin): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle N : \mathbb{N}} such that if Failed to parse (SVG (MathML can be enabled via browser plugin): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle n,m \geq N} then Failed to parse (SVG (MathML can be enabled via browser plugin): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle |a_n - a_m | \leq \epsilon} .

Examples

The sequence Failed to parse (SVG (MathML can be enabled via browser plugin): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle \{2n+1\}_{n=0}^\infty} could be properly thought of as that concept which---in appropriate contexts---subsumes the following concretes:

• the method that a child uses to produce the nth odd number
• a C++ program which takes in a uint32, n, and outputs 2n+1
• the following table on my screen [a screenshot of a few rows of an excel table where the entries are 2*row + 1 ]
• etc.