1. Analysis
  2. 6.3. Suprema and Infima of sequences
Imports
import Mathlib.Tactic import Analysis.Section_6_1 import Analysis.Section_6_2 import Mathlib.Analysis.SpecialFunctions.Trigonometric.Basic

Analysis I, Section 6.3: Suprema and infima of sequences

I have attempted to make the translation as faithful a paraphrasing as possible of the original text. When there is a choice between a more idiomatic Lean solution and a more faithful translation, I have generally chosen the latter. In particular, there will be places where the Lean code could be "golfed" to be more elegant and idiomatic, but I have consciously avoided doing so.

Main constructions and results of this section:

  • Suprema and infima of sequences.

namespace Chapter6

Definition 6.3.1 (supremum of a sequence)

noncomputable abbrev Sequence.sup (a:Sequence) : EReal := sSup { x | ∃ n ≥ a.m, x = a n }

Definition 6.3.1 (infimum of a sequence)

noncomputable abbrev Sequence.inf (a:Sequence) : EReal := sInf { x | ∃ n ≥ a.m, x = a n }
/-- Example 6.3.3 (a) -/ declaration uses `sorry`example : ((fun (n:ℕ) ↦ (-1:ℝ)^(n+1)):Sequence).sup = 1 := ⊢ (↑fun n ↦ (-1) ^ (n + 1)).sup = 1 All goals completed! 🐙/-- Example 6.3.3 (b) -/ declaration uses `sorry`example : ((fun (n:ℕ) ↦ (-1:ℝ)^(n+1)):Sequence).inf = -1 := ⊢ (↑fun n ↦ (-1) ^ (n + 1)).inf = -1 All goals completed! 🐙/-- Example 6.3.4 / Exercise 6.3.1 (a) -/ declaration uses `sorry`example : ((fun (n:ℕ) ↦ 1/((n:ℝ)+1)):Sequence).sup = 1 := ⊢ (↑fun n ↦ 1 / (↑n + 1)).sup = 1 All goals completed! 🐙/-- Example 6.3.4 / Exercise 6.3.1 (b) -/ declaration uses `sorry`example : ((fun (n:ℕ) ↦ 1/((n:ℝ)+1)):Sequence).inf = 0 := ⊢ (↑fun n ↦ 1 / (↑n + 1)).inf = 0 All goals completed! 🐙/-- Example 6.3.5 (a) -/ declaration uses `sorry`example : ((fun (n:ℕ) ↦ (n+1:ℝ)):Sequence).sup = ⊤ := ⊢ (↑fun n ↦ ↑n + 1).sup = ⊤ All goals completed! 🐙/-- Example 6.3.5 (b) -/ declaration uses `sorry`example : ((fun (n:ℕ) ↦ (n+1:ℝ)):Sequence).inf = 1 := ⊢ (↑fun n ↦ ↑n + 1).inf = 1 All goals completed! 🐙abbrev Sequence.BddAboveBy (a:Sequence) (M:ℝ) : Prop := ∀ n ≥ a.m, a n ≤ Mabbrev Sequence.BddAbove (a:Sequence) : Prop := ∃ M, a.BddAboveBy Mabbrev Sequence.BddBelowBy (a:Sequence) (M:ℝ) : Prop := ∀ n ≥ a.m, a n ≥ Mabbrev Sequence.BddBelow (a:Sequence) : Prop := ∃ M, a.BddBelowBy Mtheorem declaration uses `sorry`Sequence.bounded_iff (a:Sequence) : a.IsBounded ↔ a.BddAbove ∧ a.BddBelow := a:Sequence⊢ a.IsBounded ↔ a.BddAbove ∧ a.BddBelow All goals completed! 🐙theorem declaration uses `sorry`Sequence.sup_of_bounded {a:Sequence} (h: a.IsBounded) : a.sup.IsFinite := a:Sequenceh:a.IsBounded⊢ a.sup.IsFinite All goals completed! 🐙theorem declaration uses `sorry`Sequence.inf_of_bounded {a:Sequence} (h: a.IsBounded) : a.inf.IsFinite := a:Sequenceh:a.IsBounded⊢ a.inf.IsFinite All goals completed! 🐙

Proposition 6.3.6 (a) (Least upper bound property) / Exercise 6.3.2

theorem declaration uses `sorry`Sequence.le_sup {a:Sequence} {n:ℤ} (hn: n ≥ a.m) : a n ≤ a.sup := a:Sequencen:ℤhn:n ≥ a.m⊢ ↑(a.seq n) ≤ a.sup All goals completed! 🐙

Proposition 6.3.6 (b) (Least upper bound property) / Exercise 6.3.2

theorem declaration uses `sorry`Sequence.sup_le_upper {a:Sequence} {M:EReal} (h: ∀ n ≥ a.m, a n ≤ M) : a.sup ≤ M := a:SequenceM:ERealh:∀ n ≥ a.m, ↑(a.seq n) ≤ M⊢ a.sup ≤ M All goals completed! 🐙

Proposition 6.3.6 (c) (Least upper bound property) / Exercise 6.3.2

theorem declaration uses `sorry`Sequence.exists_between_lt_sup {a:Sequence} {y:EReal} (h: y < a.sup ) : ∃ n ≥ a.m, y < a n ∧ a n ≤ a.sup := a:Sequencey:ERealh:y < a.sup⊢ ∃ n ≥ a.m, y < ↑(a.seq n) ∧ ↑(a.seq n) ≤ a.sup All goals completed! 🐙

Remark 6.3.7 (a)

theorem declaration uses `sorry`Sequence.ge_inf {a:Sequence} {n:ℤ} (hn: n ≥ a.m) : a n ≥ a.inf := a:Sequencen:ℤhn:n ≥ a.m⊢ ↑(a.seq n) ≥ a.inf All goals completed! 🐙

Remark 6.3.7 (b)

theorem declaration uses `sorry`Sequence.inf_ge_lower {a:Sequence} {M:EReal} (h: ∀ n ≥ a.m, a n ≥ M) : a.inf ≥ M := a:SequenceM:ERealh:∀ n ≥ a.m, ↑(a.seq n) ≥ M⊢ a.inf ≥ M All goals completed! 🐙

Remark 6.3.7 (c)

theorem declaration uses `sorry`Sequence.exists_between_gt_inf {a:Sequence} {y:EReal} (h: y > a.inf ) : ∃ n ≥ a.m, y > a n ∧ a n ≥ a.inf := a:Sequencey:ERealh:y > a.inf⊢ ∃ n ≥ a.m, y > ↑(a.seq n) ∧ ↑(a.seq n) ≥ a.inf All goals completed! 🐙
abbrev Sequence.IsMonotone (a:Sequence) : Prop := ∀ n ≥ a.m, a (n+1) ≥ a nabbrev Sequence.IsAntitone (a:Sequence) : Prop := ∀ n ≥ a.m, a (n+1) ≤ a n

Proposition 6.3.8 (a) / Exercise 6.3.3

theorem declaration uses `sorry`Sequence.convergent_of_monotone {a:Sequence} (hbound: a.BddAbove) (hmono: a.IsMonotone) : a.Convergent := a:Sequencehbound:a.BddAbovehmono:a.IsMonotone⊢ a.Convergent All goals completed! 🐙

Proposition 6.3.8 (b) / Exercise 6.3.3

theorem declaration uses `sorry`Sequence.lim_of_monotone {a:Sequence} (hbound: a.BddAbove) (hmono: a.IsMonotone) : lim a = a.sup := a:Sequencehbound:a.BddAbovehmono:a.IsMonotone⊢ ↑(lim a) = a.sup All goals completed! 🐙
theorem declaration uses `sorry`Sequence.convergent_of_antitone {a:Sequence} (hbound: a.BddBelow) (hmono: a.IsAntitone) : a.Convergent := a:Sequencehbound:a.BddBelowhmono:a.IsAntitone⊢ a.Convergent All goals completed! 🐙theorem declaration uses `sorry`Sequence.lim_of_antitone {a:Sequence} (hbound: a.BddBelow) (hmono: a.IsAntitone) : lim a = a.inf := a:Sequencehbound:a.BddBelowhmono:a.IsAntitone⊢ ↑(lim a) = a.inf All goals completed! 🐙theorem declaration uses `sorry`Sequence.convergent_iff_bounded_of_monotone {a:Sequence} (ha: a.IsMonotone) : a.Convergent ↔ a.IsBounded := a:Sequenceha:a.IsMonotone⊢ a.Convergent ↔ a.IsBounded All goals completed! 🐙theorem declaration uses `sorry`Sequence.bounded_iff_convergent_of_antitone {a:Sequence} (ha: a.IsAntitone) : a.Convergent ↔ a.IsBounded := a:Sequenceha:a.IsAntitone⊢ a.Convergent ↔ a.IsBounded All goals completed! 🐙

Example 6.3.9 (a)

noncomputable abbrev Example_6_3_9 (n:ℕ) := ⌊ Real.pi * 10^n ⌋ / (10:ℝ)^n
/-- Example 6.3.9 (b) -/ declaration uses `sorry`example : (Example_6_3_9:Sequence).IsMonotone := ⊢ (↑Example_6_3_9).IsMonotone All goals completed! 🐙/-- Example 6.3.9 (c) -/ declaration uses `sorry`example : (Example_6_3_9:Sequence).BddAboveBy 4 := ⊢ (↑Example_6_3_9).BddAboveBy 4 All goals completed! 🐙/-- Example 6.3.9 (d) -/ declaration uses `sorry`example : (Example_6_3_9:Sequence).Convergent := ⊢ (↑Example_6_3_9).Convergent All goals completed! 🐙/-- Example 6.3.9 (e) -/ declaration uses `sorry`example : lim (Example_6_3_9:Sequence) ≤ 4 := ⊢ lim ↑Example_6_3_9 ≤ 4 All goals completed! 🐙

Proposition 6.3.1

theorem declaration uses `sorry`lim_of_exp {x:ℝ} (hpos: 0 < x) (hbound: x < 1) : ((fun (n:ℕ) ↦ x^n):Sequence).Convergent ∧ lim ((fun (n:ℕ) ↦ x^n):Sequence) = 0 := x:ℝhpos:0 < xhbound:x < 1⊢ (↑fun n ↦ x ^ n).Convergent ∧ (lim ↑fun n ↦ x ^ n) = 0 -- This proof is written to follow the structure of the original text. x:ℝhpos:0 < xhbound:x < 1a:Sequence := ↑fun n ↦ x ^ n⊢ a.Convergent ∧ lim a = 0 x:ℝhpos:0 < xhbound:x < 1a:Sequence := ↑fun n ↦ x ^ nwhy:a.IsAntitone⊢ a.Convergent ∧ lim a = 0 have hbound : a.BddBelowBy 0 := x:ℝhpos:0 < xhbound:x < 1⊢ (↑fun n ↦ x ^ n).Convergent ∧ (lim ↑fun n ↦ x ^ n) = 0 intro n x:ℝhpos:0 < xhbound:x < 1a:Sequence := ↑fun n ↦ x ^ nwhy:a.IsAntitonen:ℤa✝:n ≥ a.m⊢ a.seq n ≥ 0; All goals completed! 🐙 have hbound' : a.BddBelow := x:ℝhpos:0 < xhbound:x < 1⊢ (↑fun n ↦ x ^ n).Convergent ∧ (lim ↑fun n ↦ x ^ n) = 0 All goals completed! 🐙 x:ℝhpos:0 < xhbound✝:x < 1a:Sequence := ↑fun n ↦ x ^ nwhy:a.IsAntitonehbound:a.BddBelowBy 0hbound':a.BddBelowhconv:a.Convergent⊢ a.Convergent ∧ lim a = 0 x:ℝhpos:0 < xhbound✝:x < 1a:Sequence := ↑fun n ↦ x ^ nwhy:a.IsAntitonehbound:a.BddBelowBy 0hbound':a.BddBelowhconv:a.ConvergentL:ℝ := lim a⊢ a.Convergent ∧ L = 0 have : lim ((fun (n:ℕ) ↦ x^(n+1)):Sequence) = x * L := x:ℝhpos:0 < xhbound:x < 1⊢ (↑fun n ↦ x ^ n).Convergent ∧ (lim ↑fun n ↦ x ^ n) = 0 x:ℝhpos:0 < xhbound✝:x < 1a:Sequence := ↑fun n ↦ x ^ nwhy:a.IsAntitonehbound:a.BddBelowBy 0hbound':a.BddBelowhconv:a.ConvergentL:ℝ := lim a⊢ (lim ↑fun n ↦ x ^ (n + 1)) = lim (x • a); x:ℝhpos:0 < xhbound✝:x < 1a:Sequence := ↑fun n ↦ x ^ nwhy:a.IsAntitonehbound:a.BddBelowBy 0hbound':a.BddBelowhconv:a.ConvergentL:ℝ := lim a⊢ (↑fun n ↦ x ^ (n + 1)) = x • a; x:ℝhpos:0 < xhbound✝:x < 1a:Sequence := ↑fun n ↦ x ^ nwhy:a.IsAntitonehbound:a.BddBelowBy 0hbound':a.BddBelowhconv:a.ConvergentL:ℝ := lim a⊢ (↑fun n ↦ x ^ (n + 1)).m = (x • a).mx:ℝhpos:0 < xhbound✝:x < 1a:Sequence := ↑fun n ↦ x ^ nwhy:a.IsAntitonehbound:a.BddBelowBy 0hbound':a.BddBelowhconv:a.ConvergentL:ℝ := lim an:ℤ⊢ (↑fun n ↦ x ^ (n + 1)).seq n = (x • a).seq n; x:ℝhpos:0 < xhbound✝:x < 1a:Sequence := ↑fun n ↦ x ^ nwhy:a.IsAntitonehbound:a.BddBelowBy 0hbound':a.BddBelowhconv:a.ConvergentL:ℝ := lim an:ℤ⊢ (↑fun n ↦ x ^ (n + 1)).seq n = (x • a).seq n All goals completed! 🐙 have why2 : lim ((fun (n:ℕ) ↦ x^(n+1)):Sequence) = lim ((fun (n:ℕ) ↦ x^n):Sequence) := x:ℝhpos:0 < xhbound:x < 1⊢ (↑fun n ↦ x ^ n).Convergent ∧ (lim ↑fun n ↦ x ^ n) = 0 All goals completed! 🐙 x:ℝhpos:0 < xhbound✝:x < 1a:Sequence := ↑fun n ↦ x ^ nwhy:a.IsAntitonehbound:a.BddBelowBy 0hbound':a.BddBelowhconv:a.ConvergentL:ℝ := lim athis:(lim ↑fun n ↦ x ^ (n + 1)) = x * Lwhy2:(lim ↑fun n ↦ x ^ (n + 1)) = lim ↑fun n ↦ x ^ n⊢ (lim ↑fun n ↦ x ^ n) = 1 * Lx:ℝhpos:0 < xhbound✝:x < 1a:Sequence := ↑fun n ↦ x ^ nwhy:a.IsAntitonehbound:a.BddBelowBy 0hbound':a.BddBelowhconv:a.ConvergentL:ℝ := lim athis:(lim ↑fun n ↦ x ^ (n + 1)) = x * Lwhy2:x * L = 1 * L⊢ a.Convergent ∧ L = 0; x:ℝhpos:0 < xhbound✝:x < 1a:Sequence := ↑fun n ↦ x ^ nwhy:a.IsAntitonehbound:a.BddBelowBy 0hbound':a.BddBelowhconv:a.ConvergentL:ℝ := lim athis:(lim ↑fun n ↦ x ^ (n + 1)) = x * Lwhy2:x * L = 1 * L⊢ a.Convergent ∧ L = 0 have hx : x ≠ 1 := x:ℝhpos:0 < xhbound:x < 1⊢ (↑fun n ↦ x ^ n).Convergent ∧ (lim ↑fun n ↦ x ^ n) = 0 All goals completed! 🐙 All goals completed! 🐙

Exercise 6.3.4

theorem declaration uses `sorry`lim_of_exp' {x:ℝ} (hbound: x > 1) : ¬((fun (n:ℕ) ↦ x^n):Sequence).Convergent := x:ℝhbound:x > 1⊢ ¬(↑fun n ↦ x ^ n).Convergent All goals completed! 🐙
end Chapter6