@[reducible, inline]

abbrev Chapter6.Sequence.subseq (a b : ℕ → ℝ) : Prop

Definition 6.6.1

Equations

• Chapter6.Sequence.subseq a b = ∃ (f : ℕ → ℕ), StrictMono f ∧ ∀ (n : ℕ), b n = a (f n)

theorem Chapter6.Sequence.subseq_self (a : ℕ → ℝ) : subseq a a

Lemma 6.6.4 (reflexivity) / Exercise 6.6.1

theorem Chapter6.Sequence.subseq_trans {a b c : ℕ → ℝ} (hab : subseq a b) (hbc : subseq b c) : subseq a c

Lemma 6.6.4 (transitivity) / Exercise 6.6.1

theorem Chapter6.Sequence.convergent_iff_subseq (a : ℕ → ℝ) (L : ℝ) : (↑a).TendsTo L ↔ ∀ (b : ℕ → ℝ), subseq a b → (↑b).TendsTo L

Proposition 6.6.5 / Exercise 6.6.4

theorem Chapter6.Sequence.limit_point_iff_subseq (a : ℕ → ℝ) (L : ℝ) : (↑a).LimitPoint L ↔ ∃ (b : ℕ → ℝ), subseq a b ∧ (↑b).TendsTo L

Proposition 6.6.6 / Exercise 6.6.5

theorem Chapter6.Sequence.convergent_of_subseq_of_bounded {a : ℕ → ℝ} (ha : (↑a).IsBounded) : ∃ (b : ℕ → ℝ), subseq a b ∧ (↑b).Convergent

Theorem 6.6.8 (Bolzano-Weierstrass theorem)

def Chapter6.Sequence.exist_subseq_of_subseq : Decidable (∃ (a : ℕ → ℝ) (b : ℕ → ℝ), a ≠ b ∧ subseq a b ∧ subseq b a)

Exercise 6.6.2

Equations

• Chapter6.Sequence.exist_subseq_of_subseq = sorry

theorem Chapter6.Sequence.subseq_of_unbounded {a : ℕ → ℝ} (ha : ¬(↑a).IsBounded) : ∃ (b : ℕ → ℝ), subseq a b ∧ (↑b)⁻¹.TendsTo 0

Exercise 6.6.3. You may find the API around Mathlib's Nat.find to be useful (and open Classical to avoid any decidability issues)