Math 2.0

definition

Subsequence

Definition

Let (an)n∈N(a_n)_{n \in \mathbb{N}} be a sequence in a set XX. Let (nk)k∈N(n_k)_{k \in \mathbb{N}} be a strictly increasing sequence of natural numbers: n0<n1<n2<⋯n_0 < n_1 < n_2 < \cdots. The sequence (ank)k∈N(a_{n_k})_{k \in \mathbb{N}} is a subsequence of (an)(a_n).

Remarks

Equivalently, a subsequence is the composite a∘φa \circ \varphi of the sequence a ⁣:N→Xa \colon \mathbb{N} \to X with a strictly increasing map φ ⁣:N→N\varphi \colon \mathbb{N} \to \mathbb{N}. By induction, nk≥kn_k \ge k for each kk. The even terms a0,a2,a4,…a_0, a_2, a_4, \dots form a subsequence, with nk=2kn_k = 2k.

Explanations

L1 human

You get a subsequence when you delete some terms of a sequence and keep infinitely many terms in their old order. From 1,2,3,4,…1, 2, 3, 4, \dots you can keep the even numbers 2,4,6,…2, 4, 6, \dots.

What this node needs for W2
  • edge instance_of in: one example (0 of 1)
  • edge not_instance_of in: one non-example that fails one clause (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 2 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. Subsequence definition

What depends on this

104 nodes use this node, directly or through other nodes.

Sources

  1. Web https://en.wikipedia.org/wiki/Sequence, Subsequences
  2. Web https://en.wikipedia.org/wiki/Subsequence, lead section