Math 2.0

Sequences, series, summability Definition

Subsequence

Builds on Sequence

Definition

Let (an)n∈ℕ(a_n)_{n \in \mathbb{N}} be a sequence in a set XX. Let (nk)k∈ℕ(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∈ℕ(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 ⁣:ℕ→Xa \colon \mathbb{N} \to X with a strictly increasing map φ ⁣:ℕ→ℕ\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.

Reading path

To understand this page from the ground up, read these 2 pages in order. The foundations come first.

Show the path as a graph
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Sequence definition
  2. Subsequence definition

Where this leads

172 pages build on this one.

Further reading

  1. Web https://en.wikipedia.org/wiki/Sequence, Subsequences
  2. Web https://en.wikipedia.org/wiki/Subsequence, lead section
About this page
Tag0R8J3ZQMJS
URIm2://0R8J3ZQMJS
Kinddefinition
WritingW1 stated
MSC40A05
DefinesSubsequence
UsesSequence

Markdown · JSON · Edit on GitHub

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

What links here

Used by