Math 2.0

definition

Contractive sequence

Definition

Let (an)(a_n) be a real sequence. The sequence is contractive if there is a real number CC with 0<C<10 < C < 1 such that ∣an+2−an+1∣≤C ∣an+1−an∣for all n∈N.|a_{n+2} - a_{n+1}| \le C\, |a_{n+1} - a_n| \quad \text{for all } n \in \mathbb{N}.

Remarks

Each contractive sequence is a Cauchy sequence. By induction ∣an+1−an∣≤Cn∣a1−a0∣|a_{n+1} - a_n| \le C^n |a_1 - a_0|, and the geometric series bounds ∣am−an∣|a_m - a_n|. So each contractive sequence converges. If f ⁣:R→Rf \colon \mathbb{R} \to \mathbb{R} is a contraction mapping, so that ∣f(x)−f(y)∣≤C∣x−y∣|f(x) - f(y)| \le C|x - y| with C<1C < 1, then each sequence an+1=f(an)a_{n+1} = f(a_n) is contractive. It is not enough that ∣an+2−an+1∣<∣an+1−an∣|a_{n+2} - a_{n+1}| < |a_{n+1} - a_n| for all nn. The partial sums of the harmonic series satisfy this, and they diverge.

Explanations

L1 human

In a contractive sequence, each step is at most a fixed fraction of the step before. The steps shrink like a geometric sequence, so the total distance travelled is finite, and the sequence converges.

What this node 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 node is. They do not measure its truth.

What this needs

To read this node, read these 3 nodes in this order. The foundations come first, and the list ends with this node.

Each node uses the nodes above it. The colour of the bar on a box shows the evidence level, and the box also gives it as text. The list below has the same nodes.
  • no evidence level
  1. Sequence definition
  2. Real sequence definition
  3. Contractive sequence definition

Sources

  1. Web https://en.wikipedia.org/wiki/Contraction_mapping, lead section