11.1: Sequences

Definition: counting set

the set

ℕ<𝑚={𝑛∈ℕ|𝑛<𝑚}={0,1,…,𝑚−1}

The set ℕ<𝑚 has exactly 𝑚 elements in it. In Chapter 12 we will use these counting sets to, well, count the elements in other sets. For now, we will use them to index the objects in an ordered list.

Definition: Finite sequence(from a set 𝐴)

a function ℕ<𝑚 →𝐴

Definition: infinite sequence (from a set 𝐴)

a function ℕ →𝐴

Definition: term in a sequence

one of the image elements of the function defining the sequence

Definition: 𝑎𝑘

the 𝑘𝑡⁢ℎ term in a sequence, so that if 𝑓 :ℕ<𝑚 →𝐴 or 𝑓 :ℕ →𝐴 is a sequence then 𝑎𝑘 =𝑓⁡(𝑘)

Definition: {𝑎𝑘}

the collection of all terms in a sequence

Definition: {𝑎𝑘}𝑚0

the collection of the terms in a sequence up to (and including) the 𝑚𝑡⁢ℎ term (if the sequence is finite, this could represent all terms in the sequence for the appropriate 𝑚 value)

Definition: {𝑎𝑘}∞0

the collection of all terms in a sequence, where we are explicit that it is an infinite sequence

Remark

• Of course, we do not restrict ourselves to the letter 𝑎 to represent the terms of a sequence. We might write 𝑏𝑘, or 𝑠𝑘, etc..
• While we use set-like notation {} to represent the collection of all terms in a sequence, this collection is not a set, since order and repetition matter.

Example 11.1.1: Sequence of squares.

The sequence {𝑘2} has terms 0, 1, 4, 9, 16, 25, …, 𝑘2, ….

Example 11.1.2: Sequence of definite integral values.

The sequence

{(−1)𝑘⁢∫𝑘+11𝑑𝑥𝑥}
has terms 0, −ln⁡2, ln⁡3, −ln⁡4, …, (−1)𝑘 ⁢ln⁡(𝑘 +1), ….