57760e81 - mathematics_in

Authored by: Patrick Massot
Authored at: 2024-08-22 19:01:17 +0200
Committed by: Patrick Massot
Committed at: 2024-08-22 19:01:17 +0200
Object name: 57760e8175942c39a59d7fa7b9362adcb5ef6f9c
Parent: ec9a73fd

Update jeu. 22 août 2024 19:01:17 CEST

Changes

33 changed files (+3549/-3502)

MIL/C02_Basics/S03_Using_Theorems_and_Lemmas.lean
- @@ -21,7 +21,7 @@ end
  example (x y z : ℝ) (h₀ : x ≤ y) (h₁ : y ≤ z) : x ≤ z := by apply le_trans · apply h₀ - . apply h₁ + · apply h₁ example (x y z : ℝ) (h₀ : x ≤ y) (h₁ : y ≤ z) : x ≤ z := by apply le_trans h₀
MIL/C03_Logic/S05_Disjunction.lean
- @@ -25,7 +25,7 @@ example : x < |y| → x < y ∨ x < -y := by
 rcases le_or_gt 0 y with h | h · rw [abs_of_nonneg h] intro h; left; exact h - . rw [abs_of_neg h] + · rw [abs_of_neg h] intro h; right; exact h example : x < |y| → x < y ∨ x < -y := by
- @@ -81,13 +81,13 @@ example {x : ℝ} (h : x ≠ 0) : x < 0 ∨ x > 0 := by
 · left exact xlt · contradiction - . right; exact xgt + · right; exact xgt example {m n k : ℕ} (h : m ∣ n ∨ m ∣ k) : m ∣ n * k := by rcases h with ⟨a, rfl⟩ | ⟨b, rfl⟩ · rw [mul_assoc] apply dvd_mul_right - . rw [mul_comm, mul_assoc] + · rw [mul_comm, mul_assoc] apply dvd_mul_right example {z : ℝ} (h : ∃ x y, z = x ^ 2 + y ^ 2 ∨ z = x ^ 2 + y ^ 2 + 1) : z ≥ 0 := by
- @@ -115,7 +115,7 @@ example (P : Prop) : ¬¬P → P := by
 intro h cases em P · assumption - . contradiction + · contradiction example (P : Prop) : ¬¬P → P := by intro h
MIL/C03_Logic/solutions/Solutions_S05_Disjunction.lean
- @@ -12,20 +12,20 @@ namespace MyAbs
 theorem le_abs_self (x : ℝ) : x ≤ |x| := by rcases le_or_gt 0 x with h | h · rw [abs_of_nonneg h] - . rw [abs_of_neg h] + · rw [abs_of_neg h] linarith theorem neg_le_abs_self (x : ℝ) : -x ≤ |x| := by rcases le_or_gt 0 x with h | h · rw [abs_of_nonneg h] linarith - . rw [abs_of_neg h] + · rw [abs_of_neg h] theorem abs_add (x y : ℝ) : |x + y| ≤ |x| + |y| := by rcases le_or_gt 0 (x + y) with h | h · rw [abs_of_nonneg h] linarith [le_abs_self x, le_abs_self y] - . rw [abs_of_neg h] + · rw [abs_of_neg h] linarith [neg_le_abs_self x, neg_le_abs_self y] theorem lt_abs : x < |y| ↔ x < y ∨ x < -y := by
- @@ -35,19 +35,19 @@ theorem lt_abs : x < |y| ↔ x < y ∨ x < -y := by
 · intro h' left exact h' - . intro h' + · intro h' rcases h' with h' | h' · exact h' - . linarith + · linarith rw [abs_of_neg h] constructor · intro h' right exact h' - . intro h' + · intro h' rcases h' with h' | h' · linarith - . exact h' + · exact h' theorem abs_lt : |x| < y ↔ -y < x ∧ x < y := by rcases le_or_gt 0 x with h | h
- @@ -57,16 +57,16 @@ theorem abs_lt : |x| < y ↔ -y < x ∧ x < y := by
 constructor · linarith exact h' - . intro h' + · intro h' rcases h' with ⟨h1, h2⟩ exact h2 - . rw [abs_of_neg h] + · rw [abs_of_neg h] constructor · intro h' constructor · linarith - . linarith - . intro h' + · linarith + · intro h' linarith end MyAbs
- @@ -84,7 +84,7 @@ example {x : ℝ} (h : x ^ 2 = 1) : x = 1 ∨ x = -1 := by
 rcases eq_zero_or_eq_zero_of_mul_eq_zero h'' with h1 | h1 · right exact eq_neg_iff_add_eq_zero.mpr h1 - . left + · left exact eq_of_sub_eq_zero h1 example {x y : ℝ} (h : x ^ 2 = y ^ 2) : x = y ∨ x = -y := by
- @@ -95,7 +95,7 @@ example {x y : ℝ} (h : x ^ 2 = y ^ 2) : x = y ∨ x = -y := by
 rcases eq_zero_or_eq_zero_of_mul_eq_zero h'' with h1 | h1 · right exact eq_neg_iff_add_eq_zero.mpr h1 - . left + · left exact eq_of_sub_eq_zero h1 section
- @@ -110,7 +110,7 @@ example (h : x ^ 2 = 1) : x = 1 ∨ x = -1 := by
 rcases eq_zero_or_eq_zero_of_mul_eq_zero h'' with h1 | h1 · right exact eq_neg_iff_add_eq_zero.mpr h1 - . left + · left exact eq_of_sub_eq_zero h1 example (h : x ^ 2 = y ^ 2) : x = y ∨ x = -y := by
- @@ -121,7 +121,7 @@ example (h : x ^ 2 = y ^ 2) : x = y ∨ x = -y := by
 rcases eq_zero_or_eq_zero_of_mul_eq_zero h'' with h1 | h1 · right exact eq_neg_iff_add_eq_zero.mpr h1 - . left + · left exact eq_of_sub_eq_zero h1 end
- @@ -132,10 +132,10 @@ example (P Q : Prop) : P → Q ↔ ¬P ∨ Q := by
 by_cases h' : P · right exact h h' - . left + · left exact h' rintro (h | h) · intro h' exact absurd h' h - . intro + · intro exact h
MIL/C04_Sets_and_Functions/S01_Sets.lean
- @@ -34,14 +34,14 @@ example : s ∩ (t ∪ u) ⊆ s ∩ t ∪ s ∩ u := by
  · left show x ∈ s ∩ t exact ⟨xs, xt⟩ - . right + · right show x ∈ s ∩ u exact ⟨xs, xu⟩ example : s ∩ (t ∪ u) ⊆ s ∩ t ∪ s ∩ u := by rintro x ⟨xs, xt | xu⟩ · left; exact ⟨xs, xt⟩ - . right; exact ⟨xs, xu⟩ + · right; exact ⟨xs, xu⟩ example : s ∩ t ∪ s ∩ u ⊆ s ∩ (t ∪ u) := by sorry
- @@ -56,7 +56,7 @@ example : (s \ t) \ u ⊆ s \ (t ∪ u) := by
  -- x ∈ t ∨ x ∈ u rcases xtu with xt | xu · show False; exact xnt xt - . show False; exact xnu xu + · show False; exact xnu xu example : (s \ t) \ u ⊆ s \ (t ∪ u) := by rintro x ⟨⟨xs, xnt⟩, xnu⟩
- @@ -70,7 +70,7 @@ example : s ∩ t = t ∩ s := by
  simp only [mem_inter_iff] constructor · rintro ⟨xs, xt⟩; exact ⟨xt, xs⟩ - . rintro ⟨xt, xs⟩; exact ⟨xs, xt⟩ + · rintro ⟨xt, xs⟩; exact ⟨xs, xt⟩ example : s ∩ t = t ∩ s := Set.ext fun x ↦ ⟨fun ⟨xs, xt⟩ ↦ ⟨xt, xs⟩, fun ⟨xt, xs⟩ ↦ ⟨xs, xt⟩⟩
- @@ -80,7 +80,7 @@ example : s ∩ t = t ∩ s := by ext x; simp [and_comm]
  example : s ∩ t = t ∩ s := by apply Subset.antisymm · rintro x ⟨xs, xt⟩; exact ⟨xt, xs⟩ - . rintro x ⟨xt, xs⟩; exact ⟨xs, xt⟩ + · rintro x ⟨xt, xs⟩; exact ⟨xs, xt⟩ example : s ∩ t = t ∩ s := Subset.antisymm sorry sorry
MIL/C04_Sets_and_Functions/solutions/Solutions_S01_Sets.lean
- @@ -10,7 +10,7 @@ open Set
 example : s ∩ t ∪ s ∩ u ⊆ s ∩ (t ∪ u) := by rintro x (⟨xs, xt⟩ | ⟨xs, xu⟩) · use xs; left; exact xt - . use xs; right; exact xu + · use xs; right; exact xu example : s \ (t ∪ u) ⊆ (s \ t) \ u := by rintro x ⟨xs, xntu⟩
- @@ -29,20 +29,20 @@ example : s ∩ (s ∪ t) = s := by
 ext x; constructor · rintro ⟨xs, _⟩ exact xs - . intro xs + · intro xs use xs; left; exact xs example : s ∪ s ∩ t = s := by ext x; constructor · rintro (xs | ⟨xs, xt⟩) <;> exact xs - . intro xs; left; exact xs + · intro xs; left; exact xs example : s \ t ∪ t = s ∪ t := by ext x; constructor · rintro (⟨xs, nxt⟩ | xt) · left exact xs - . right + · right exact xt by_cases h : x ∈ t · intro
- @@ -61,7 +61,7 @@ example : s \ t ∪ t \ s = (s ∪ t) \ (s ∩ t) := by
 exact xs rintro ⟨_, xt⟩ contradiction - . constructor + · constructor right exact xt rintro ⟨xs, _⟩
- @@ -72,7 +72,7 @@ example : s \ t ∪ t \ s = (s ∪ t) \ (s ∩ t) := by
 intro xt apply nxst constructor <;> assumption - . right; use xt; intro xs + · right; use xt; intro xs apply nxst constructor <;> assumption
MIL/C04_Sets_and_Functions/solutions/Solutions_S02_Functions.lean
- @@ -55,28 +55,28 @@ example : f ⁻¹' (u ∪ v) = f ⁻¹' u ∪ f ⁻¹' v := by
  example : f '' (s ∩ t) ⊆ f '' s ∩ f '' t := by rintro y ⟨x, ⟨xs, xt⟩, rfl⟩ constructor - . use x, xs - . use x, xt + · use x, xs + · use x, xt example (h : Injective f) : f '' s ∩ f '' t ⊆ f '' (s ∩ t) := by rintro y ⟨⟨x₁, x₁s, rfl⟩, ⟨x₂, x₂t, fx₂eq⟩⟩ use x₁ constructor - . use x₁s + · use x₁s rw [← h fx₂eq] exact x₂t - . rfl + · rfl example : f '' s \ f '' t ⊆ f '' (s \ t) := by rintro y ⟨⟨x₁, x₁s, rfl⟩, h⟩ use x₁ constructor - . constructor - . exact x₁s - . intro h' + · constructor + · exact x₁s + · intro h' apply h use x₁, h' - . rfl + · rfl example : f ⁻¹' u \ f ⁻¹' v ⊆ f ⁻¹' (u \ v) := fun x ↦ id
MIL/C05_Elementary_Number_Theory/S03_Infinitely_Many_Primes.lean
- @@ -47,7 +47,7 @@ theorem primes_infinite : ∀ n, ∃ p > n, Nat.Prime p := by
  have : 2 ≤ Nat.factorial (n + 1) + 1 := by sorry rcases exists_prime_factor this with ⟨p, pp, pdvd⟩ - refine' ⟨p, _, pp⟩ + refine ⟨p, ?_, pp⟩ show p > n by_contra ple push_neg at ple
MIL/C05_Elementary_Number_Theory/solutions/Solutions_S03_Infinitely_Many_Primes.lean
- @@ -36,7 +36,7 @@ theorem primes_infinite : ∀ n, ∃ p > n, Nat.Prime p := by
  apply Nat.succ_le_succ exact Nat.succ_le_of_lt (Nat.factorial_pos _) rcases exists_prime_factor this with ⟨p, pp, pdvd⟩ - refine' ⟨p, _, pp⟩ + refine ⟨p, ?_, pp⟩ show p > n by_contra ple push_neg at ple
MIL/C09_Topology/solutions/Solutions_S02_Metric_Spaces.lean
- @@ -94,7 +94,7 @@ example {u : ℕ → X} (hu : Tendsto u atTop (𝓝 a)) {s : Set X} (hs : ∀ n,
 rw [Metric.mem_closure_iff] intro ε ε_pos rcases hu ε ε_pos with ⟨N, hN⟩ - refine' ⟨u N, hs _, _⟩ + refine ⟨u N, hs _, ?_⟩ rw [dist_comm] exact hN N le_rfl
- @@ -288,7 +288,7 @@ example [CompleteSpace X] (f : ℕ → Set X) (ho : ∀ n, IsOpen (f n)) (hd :
 rw [dist_comm] at xy obtain ⟨r, rpos, hr⟩ : ∃ r > 0, closedBall y r ⊆ f n := nhds_basis_closedBall.mem_iff.1 (isOpen_iff_mem_nhds.1 (ho n) y ys) - refine' ⟨y, min (min (δ / 2) r) (B (n + 1)), _, _, fun z hz ↦ ⟨_, _⟩⟩ + refine ⟨y, min (min (δ / 2) r) (B (n + 1)), ?_, ?_, fun z hz ↦ ⟨?_, ?_⟩⟩ show 0 < min (min (δ / 2) r) (B (n + 1)) exact lt_min (lt_min (half_pos δpos) rpos) (Bpos (n + 1)) show min (min (δ / 2) r) (B (n + 1)) ≤ B (n + 1)
- @@ -309,7 +309,7 @@ example [CompleteSpace X] (f : ℕ → Set X) (ho : ∀ n, IsOpen (f n)) (hd :
 _ ≤ r := (min_le_left _ _).trans (min_le_right _ _) ) choose! center radius Hpos HB Hball using this - refine' fun x ↦ (mem_closure_iff_nhds_basis nhds_basis_closedBall).2 fun ε εpos ↦ _ + refine fun x ↦ (mem_closure_iff_nhds_basis nhds_basis_closedBall).2 fun ε εpos ↦ ?_ /- `ε` is positive. We have to find a point in the ball of radius `ε` around `x` belonging to all `f n`. For this, we construct inductively a sequence `F n = (c n, r n)` such that the closed ball `closedBall (c n) (r n)` is included in the previous ball and in `f n`, and such that
- @@ -351,13 +351,13 @@ example [CompleteSpace X] (f : ℕ → Set X) (ho : ∀ n, IsOpen (f n)) (hd :
 use y have I : ∀ n, ∀ m ≥ n, closedBall (c m) (r m) ⊆ closedBall (c n) (r n) := by intro n - refine' Nat.le_induction _ fun m hnm h ↦ _ + refine Nat.le_induction ?_ fun m hnm h ↦ ?_ · exact Subset.rfl · exact (incl m).trans (Set.inter_subset_left.trans h) have yball : ∀ n, y ∈ closedBall (c n) (r n) := by intro n - refine' isClosed_ball.mem_of_tendsto ylim _ - refine' (Filter.eventually_ge_atTop n).mono fun m hm ↦ _ + refine isClosed_ball.mem_of_tendsto ylim ?_ + refine (Filter.eventually_ge_atTop n).mono fun m hm ↦ ?_ exact I n m hm (mem_closedBall_self (rpos _).le) constructor · suffices ∀ n, y ∈ f n by rwa [Set.mem_iInter]
MIL/C09_Topology/solutions/Solutions_S03_Topological_Spaces.lean
- @@ -56,7 +56,7 @@ example {α : Type*} (n : α → Filter α) (H₀ : ∀ a, pure a ≤ n a)
  (H : ∀ a : α, ∀ p : α → Prop, (∀ᶠ x in n a, p x) → ∀ᶠ y in n a, ∀ᶠ x in n y, p x) : ∀ a, ∀ s ∈ n a, ∃ t ∈ n a, t ⊆ s ∧ ∀ a' ∈ t, s ∈ n a' := by intro a s s_in - refine' ⟨{ y | s ∈ n y }, H a (fun x ↦ x ∈ s) s_in, _, by tauto⟩ + refine ⟨{ y | s ∈ n y }, H a (fun x ↦ x ∈ s) s_in, ?_, by tauto⟩ rintro y (hy : s ∈ n y) exact H₀ y hy
- @@ -172,7 +172,7 @@ example [TopologicalSpace Y] {f : X → Y} (hf : Continuous f) {s : Set X} (hs :
  rwa [map_eq, inf_of_le_right F_le] have Hle : 𝓟 s ⊓ comap f F ≤ 𝓟 s := inf_le_left rcases hs Hle with ⟨x, x_in, hx⟩ - refine' ⟨f x, mem_image_of_mem f x_in, _⟩ + refine ⟨f x, mem_image_of_mem f x_in, ?_⟩ apply hx.map hf.continuousAt rw [Tendsto, map_eq] exact inf_le_right
MIL/C10_Differential_Calculus/S02_Differential_Calculus_in_Normed_Spaces.lean
- @@ -106,7 +106,7 @@ example {ι : Type*} [CompleteSpace E] {g : ι → E →L[𝕜] F} (h : ∀ x,
 have real_norm_le : ∀ z ∈ ball x ε, ∀ (i : ι), ‖g i z‖ ≤ m sorry have εk_pos : 0 < ε / ‖k‖ := sorry - refine' ⟨(m + m : ℕ) / (ε / ‖k‖), fun i ↦ ContinuousLinearMap.opNorm_le_of_shell ε_pos _ hk _⟩ + refine ⟨(m + m : ℕ) / (ε / ‖k‖), fun i ↦ ContinuousLinearMap.opNorm_le_of_shell ε_pos ?_ hk ?_⟩ sorry sorry
MIL/C10_Differential_Calculus/solutions/Solutions_S02_Differential_Calculus_in_Normed_Spaces.lean
- @@ -28,7 +28,7 @@ example {ι : Type*} [CompleteSpace E] {g : ι → E →L[𝕜] F} (h : ∀ x,
 isClosed_iInter fun i ↦ isClosed_le (g i).cont.norm continuous_const -- the union is the entire space; this is where we use `h` have hU : (⋃ n : ℕ, e n) = univ := by - refine' eq_univ_of_forall fun x ↦ _ + refine eq_univ_of_forall fun x ↦ ?_ rcases h x with ⟨C, hC⟩ obtain ⟨m, hm⟩ := exists_nat_ge C exact ⟨e m, mem_range_self m, mem_iInter.mpr fun i ↦ le_trans (hC i) hm⟩
- @@ -43,7 +43,7 @@ example {ι : Type*} [CompleteSpace E] {g : ι → E →L[𝕜] F} (h : ∀ x,
 replace hz := mem_iInter.mp (interior_iInter_subset _ (hε hz)) i apply interior_subset hz have εk_pos : 0 < ε / ‖k‖ := div_pos ε_pos (zero_lt_one.trans hk) - refine' ⟨(m + m : ℕ) / (ε / ‖k‖), fun i ↦ ContinuousLinearMap.opNorm_le_of_shell ε_pos _ hk _⟩ + refine ⟨(m + m : ℕ) / (ε / ‖k‖), fun i ↦ ContinuousLinearMap.opNorm_le_of_shell ε_pos ?_ hk ?_⟩ · exact div_nonneg (Nat.cast_nonneg _) εk_pos.le intro y le_y y_lt calc
html/.buildinfo
- @@ -1,4 +1,4 @@
  # Sphinx build info version 1 # This file hashes the configuration used when building these files. When it is not found, a full rebuild will be done. - config: dfa3c760a9c309561b2de03685612f6b + config: 641199866dfd7d43f34ecf960cb67cbc tags: 645f666f9bcd5a90fca523b33c5a78b7
html/C01_Introduction.html
- @@ -18,7 +18,7 @@
 <script src="_static/jquery.js?v=5d32c60e"></script> <script src="_static/_sphinx_javascript_frameworks_compat.js?v=2cd50e6c"></script> <script src="_static/documentation_options.js?v=2709fde1"></script> - <script src="_static/doctools.js?v=888ff710"></script> + <script src="_static/doctools.js?v=9a2dae69"></script> <script src="_static/sphinx_highlight.js?v=dc90522c"></script> <script src="_static/js/theme.js"></script> <link rel="index" title="Index" href="genindex.html" />
- @@ -161,7 +161,7 @@ which is why we suggested making a copy.)
 We intend for you to work on the exercises in the <code class="docutils literal notranslate">MIL</code> folder while reading the textbook, which contains explanations, instructions, and hints. The text will often include examples, like this one: - <div class="highlight-lean notranslate"><div class="highlight"><pre>#eval "Hello, World!" + <div class="highlight-lean notranslate"><div class="highlight"><pre>#eval "Hello, World!" </pre></div> </div> You should be able to find the corresponding example in the associated
- @@ -188,35 +188,35 @@ known as dependent type theory.
 print it. Some expressions have types like <cite>ℕ</cite> or <cite>ℕ → ℕ</cite>. These are mathematical objects. - <div class="highlight-lean notranslate"><div class="highlight"><pre>#check 2 + 2 + <div class="highlight-lean notranslate"><div class="highlight"><pre>#check 2 + 2 - def f (x : ℕ) := - x + 3 + def f (x : ℕ) := + x + 3 - #check f + #check f </pre></div> </div> Some expressions have type <cite>Prop</cite>. These are mathematical statements. - <div class="highlight-lean notranslate"><div class="highlight"><pre>#check 2 + 2 = 4 + <div class="highlight-lean notranslate"><div class="highlight"><pre>#check 2 + 2 = 4 - def FermatLastTheorem := - ∀ x y z n : ℕ, n > 2 ∧ x * y * z ≠ 0 → x ^ n + y ^ n ≠ z ^ n + def FermatLastTheorem := + ∀ x y z n : ℕ, n > 2 ∧ x * y * z ≠ 0 → x ^ n + y ^ n ≠ z ^ n - #check FermatLastTheorem + #check FermatLastTheorem </pre></div> </div> Some expressions have a type, <cite>P</cite>, where <cite>P</cite> itself has type <cite>Prop</cite>. Such an expression is a proof of the proposition <cite>P</cite>. - <div class="highlight-lean notranslate"><div class="highlight"><pre>theorem easy : 2 + 2 = 4 := - rfl + <div class="highlight-lean notranslate"><div class="highlight"><pre>theorem easy : 2 + 2 = 4 := + rfl - #check easy + #check easy - theorem hard : FermatLastTheorem := - sorry + theorem hard : FermatLastTheorem := + sorry - #check hard + #check hard </pre></div> </div> If you manage to construct an expression of type <code class="docutils literal notranslate">FermatLastTheorem</code> and
- @@ -245,27 +245,27 @@ we can write down the expressions themselves
 or we can provide Lean with instructions as to how to construct them. For example, the following expression represents a proof of the fact that if <code class="docutils literal notranslate">n</code> is even then so is <code class="docutils literal notranslate">m * n</code>: - <div class="highlight-lean notranslate"><div class="highlight"><pre>example : ∀ m n : Nat, Even n → Even (m * n) := fun m n ⟨k, (hk : n = k + k)⟩ ↦ - have hmn : m * n = m * k + m * k := by rw [hk, mul_add] - show ∃ l, m * n = l + l from ⟨_, hmn⟩ + <div class="highlight-lean notranslate"><div class="highlight"><pre>example : ∀ m n : Nat, Even n → Even (m * n) := fun m n ⟨k, (hk : n = k + k)⟩ ↦ + have hmn : m * n = m * k + m * k := by rw [hk, mul_add] + show ∃ l, m * n = l + l from ⟨_, hmn⟩ </pre></div> </div> The proof term can be compressed to a single line: - <div class="highlight-lean notranslate"><div class="highlight"><pre>example : ∀ m n : Nat, Even n → Even (m * n) := - fun m n ⟨k, hk⟩ ↦ ⟨m * k, by rw [hk, mul_add]⟩ + <div class="highlight-lean notranslate"><div class="highlight"><pre>example : ∀ m n : Nat, Even n → Even (m * n) := + fun m n ⟨k, hk⟩ ↦ ⟨m * k, by rw [hk, mul_add]⟩ </pre></div> </div> The following is, instead, a tactic-style proof of the same theorem, where lines starting with <code class="docutils literal notranslate">--</code> are comments, hence ignored by Lean: - <div class="highlight-lean notranslate"><div class="highlight"><pre>example : ∀ m n : Nat, Even n → Even (m * n) := by - -- Say m and n are natural numbers, and assume n=2*k. - rintro m n ⟨k, hk⟩ - -- We need to prove m*n is twice a natural number. Let's show it's twice m*k. - use m * k - -- Substitute for n, - rw [hk] - -- and now it's obvious. - ring + <div class="highlight-lean notranslate"><div class="highlight"><pre>example : ∀ m n : Nat, Even n → Even (m * n) := by + -- Say m and n are natural numbers, and assume n=2*k. + rintro m n ⟨k, hk⟩ + -- We need to prove m*n is twice a natural number. Let's show it's twice m*k. + use m * k + -- Substitute for n, + rw [hk] + -- and now it's obvious. + ring </pre></div> </div> As you enter each line of such a proof in VS Code,
- @@ -297,8 +297,8 @@ We will also see that, conversely,
 it is often useful to insert a short proof term in the middle of a tactic proof. That said, in this book, our emphasis will be on the use of tactics. In our example, the tactic proof can also be reduced to a one-liner: - <div class="highlight-lean notranslate"><div class="highlight"><pre>example : ∀ m n : Nat, Even n → Even (m * n) := by - rintro m n ⟨k, hk⟩; use m * k; rw [hk]; ring + <div class="highlight-lean notranslate"><div class="highlight"><pre>example : ∀ m n : Nat, Even n → Even (m * n) := by + rintro m n ⟨k, hk⟩; use m * k; rw [hk]; ring </pre></div> </div> Here we have used tactics to carry out small proof steps.
- @@ -307,8 +307,8 @@ and justify longer calculations and bigger inferential steps.
 For example, we can invoke Lean’s simplifier with specific rules for simplifying statements about parity to prove our theorem automatically. - <div class="highlight-lean notranslate"><div class="highlight"><pre>example : ∀ m n : Nat, Even n → Even (m * n) := by - intros; simp [*, parity_simps] + <div class="highlight-lean notranslate"><div class="highlight"><pre>example : ∀ m n : Nat, Even n → Even (m * n) := by + intros; simp [*, parity_simps] </pre></div> </div> Another big difference between the two introductions is that
html/C02_Basics.html
- @@ -18,7 +18,7 @@
 <script src="_static/jquery.js?v=5d32c60e"></script> <script src="_static/_sphinx_javascript_frameworks_compat.js?v=2cd50e6c"></script> <script src="_static/documentation_options.js?v=2709fde1"></script> - <script src="_static/doctools.js?v=888ff710"></script> + <script src="_static/doctools.js?v=9a2dae69"></script> <script src="_static/sphinx_highlight.js?v=dc90522c"></script> <script async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-mml-chtml.js"></script> <script src="_static/js/theme.js"></script>
- @@ -124,9 +124,9 @@ so the left-hand side of <code class="docutils literal notranslate"> Let’s try out <code class="docutils literal notranslate">rw</code>. - <div class="highlight-lean notranslate" id="index-1"><div class="highlight"><pre>example (a b c : ℝ) : a * b * c = b * (a * c) := by - rw [mul_comm a b] - rw [mul_assoc b a c] + <div class="highlight-lean notranslate" id="index-1"><div class="highlight"><pre>example (a b c : ℝ) : a * b * c = b * (a * c) := by + rw [mul_comm a b] + rw [mul_assoc b a c] </pre></div> </div> The <code class="docutils literal notranslate">import</code> lines at the beginning of the associated examples file
- @@ -150,12 +150,12 @@ Lean reports on the current proof state in the
 As you move your cursor past each step of the proof, you can see the state change. A typical proof state in Lean might look as follows: - <div class="highlight-lean notranslate"><div class="highlight"><pre>1 goal - x y : ℕ, - h₁ : Prime x, - h₂ : ¬Even x, - h₃ : y > x - ⊢ y ≥ 4 + <div class="highlight-lean notranslate"><div class="highlight"><pre>1 goal + x y : ℕ, + h₁ : Prime x, + h₂ : ¬Even x, + h₃ : y > x + ⊢ y ≥ 4 </pre></div> </div> The lines before the one that begins with <code class="docutils literal notranslate">⊢</code> denote the context:
- @@ -182,20 +182,20 @@ For example, <code class="docutils literal notranslate">rw</sp
 replaces <code class="docutils literal notranslate">a * (b * c)</code> by <code class="docutils literal notranslate">a * b * c</code> in the current goal. Note that the left-pointing arrow refers to going from right to left in the identity provided by <code class="docutils literal notranslate">mul_assoc</code>, it has nothing to do with the left or right side of the goal. - <div class="highlight-lean notranslate"><div class="highlight"><pre>example (a b c : ℝ) : c * b * a = b * (a * c) := by - sorry + <div class="highlight-lean notranslate"><div class="highlight"><pre>example (a b c : ℝ) : c * b * a = b * (a * c) := by + sorry - example (a b c : ℝ) : a * (b * c) = b * (a * c) := by - sorry + example (a b c : ℝ) : a * (b * c) = b * (a * c) := by + sorry </pre></div> </div> You can also use identities like <code class="docutils literal notranslate">mul_assoc</code> and <code class="docutils literal notranslate">mul_comm</code> without arguments. In this case, the rewrite tactic tries to match the left-hand side with an expression in the goal, using the first pattern it finds. - <div class="highlight-lean notranslate"><div class="highlight"><pre>example (a b c : ℝ) : a * b * c = b * c * a := by - rw [mul_assoc] - rw [mul_comm] + <div class="highlight-lean notranslate"><div class="highlight"><pre>example (a b c : ℝ) : a * b * c = b * c * a := by + rw [mul_assoc] + rw [mul_comm] </pre></div> </div> You can also provide partial information.
- @@ -204,43 +204,43 @@ For example, <code class="docutils literal notranslate">mul_co
 Try doing the first of these examples without providing any arguments at all, and the second with only one argument. - <div class="highlight-lean notranslate"><div class="highlight"><pre>example (a b c : ℝ) : a * (b * c) = b * (c * a) := by - sorry + <div class="highlight-lean notranslate"><div class="highlight"><pre>example (a b c : ℝ) : a * (b * c) = b * (c * a) := by + sorry - example (a b c : ℝ) : a * (b * c) = b * (a * c) := by - sorry + example (a b c : ℝ) : a * (b * c) = b * (a * c) := by + sorry </pre></div> </div> You can also use <code class="docutils literal notranslate">rw</code> with facts from the local context. - <div class="highlight-lean notranslate"><div class="highlight"><pre>example (a b c d e f : ℝ) (h : a * b = c * d) (h' : e = f) : a * (b * e) = c * (d * f) := by - rw [h'] - rw [← mul_assoc] - rw [h] - rw [mul_assoc] + <div class="highlight-lean notranslate"><div class="highlight"><pre>example (a b c d e f : ℝ) (h : a * b = c * d) (h' : e = f) : a * (b * e) = c * (d * f) := by + rw [h'] + rw [← mul_assoc] + rw [h] + rw [mul_assoc] </pre></div> </div> Try these, using the theorem <code class="docutils literal notranslate">sub_self</code> for the second one: - <div class="highlight-lean notranslate"><div class="highlight"><pre>example (a b c d e f : ℝ) (h : b * c = e * f) : a * b * c * d = a * e * f * d := by - sorry + <div class="highlight-lean notranslate"><div class="highlight"><pre>example (a b c d e f : ℝ) (h : b * c = e * f) : a * b * c * d = a * e * f * d := by + sorry - example (a b c d : ℝ) (hyp : c = b * a - d) (hyp' : d = a * b) : c = 0 := by - sorry + example (a b c d : ℝ) (hyp : c = b * a - d) (hyp' : d = a * b) : c = 0 := by + sorry </pre></div> </div> Multiple rewrite commands can be carried out with a single command, by listing the relevant identities separated by commas inside the square brackets. - <div class="highlight-lean notranslate"><div class="highlight"><pre>example (a b c d e f : ℝ) (h : a * b = c * d) (h' : e = f) : a * (b * e) = c * (d * f) := by - rw [h', ← mul_assoc, h, mul_assoc] + <div class="highlight-lean notranslate"><div class="highlight"><pre>example (a b c d e f : ℝ) (h : a * b = c * d) (h' : e = f) : a * (b * e) = c * (d * f) := by + rw [h', ← mul_assoc, h, mul_assoc] </pre></div> </div> You still see the incremental progress by placing the cursor after a comma in any list of rewrites. Another trick is that we can declare variables once and for all outside an example or theorem. Lean then includes them automatically. - <div class="highlight-lean notranslate"><div class="highlight"><pre>variable (a b c d e f : ℝ) + <div class="highlight-lean notranslate"><div class="highlight"><pre>variable (a b c d e f : ℝ) - example (h : a * b = c * d) (h' : e = f) : a * (b * e) = c * (d * f) := by - rw [h', ← mul_assoc, h, mul_assoc] + example (h : a * b = c * d) (h' : e = f) : a * (b * e) = c * (d * f) := by + rw [h', ← mul_assoc, h, mul_assoc] </pre></div> </div> Inspection of the tactic state at the beginning of the above proof
- @@ -250,16 +250,16 @@ in a <code class="docutils literal notranslate">section
 Finally, recall from the introduction that Lean provides us with a command to determine the type of an expression: <div class="highlight-lean notranslate"><div class="highlight"><pre>section - variable (a b c : ℝ) + variable (a b c : ℝ) - #check a - #check a + b - #check (a : ℝ) - #check mul_comm a b - #check (mul_comm a b : a * b = b * a) - #check mul_assoc c a b - #check mul_comm a - #check mul_comm + #check a + #check a + b + #check (a : ℝ) + #check mul_comm a b + #check (mul_comm a b : a * b = b * a) + #check mul_assoc c a b + #check mul_comm a + #check mul_comm end </pre></div>
- @@ -279,10 +279,10 @@ that <code class="docutils literal notranslate">2 add_assoc</code> expresses the associativity of addition. Use the <code class="docutils literal notranslate">#check</code> command to see the precise statements. - <div class="highlight-lean notranslate" id="index-3"><div class="highlight"><pre>example : (a + b) * (a + b) = a * a + 2 * (a * b) + b * b := by - rw [mul_add, add_mul, add_mul] - rw [← add_assoc, add_assoc (a * a)] - rw [mul_comm b a, ← two_mul] + <div class="highlight-lean notranslate" id="index-3"><div class="highlight"><pre>example : (a + b) * (a + b) = a * a + 2 * (a * b) + b * b := by + rw [mul_add, add_mul, add_mul] + rw [← add_assoc, add_assoc (a * a)] + rw [mul_comm b a, ← two_mul] </pre></div> </div> Whereas it is possible to figure out what it going on in this proof
- @@ -290,14 +290,14 @@ by stepping through it in the editor,
 it is hard to read on its own. Lean provides a more structured way of writing proofs like this using the <code class="docutils literal notranslate">calc</code> keyword. - <div class="highlight-lean notranslate"><div class="highlight"><pre>example : (a + b) * (a + b) = a * a + 2 * (a * b) + b * b := - calc - (a + b) * (a + b) = a * a + b * a + (a * b + b * b) := by - rw [mul_add, add_mul, add_mul] - _ = a * a + (b * a + a * b) + b * b := by - rw [← add_assoc, add_assoc (a * a)] - _ = a * a + 2 * (a * b) + b * b := by - rw [mul_comm b a, ← two_mul] + <div class="highlight-lean notranslate"><div class="highlight"><pre>example : (a + b) * (a + b) = a * a + 2 * (a * b) + b * b := + calc + (a + b) * (a + b) = a * a + b * a + (a * b + b * b) := by + rw [mul_add, add_mul, add_mul] + _ = a * a + (b * a + a * b) + b * b := by + rw [← add_assoc, add_assoc (a * a)] + _ = a * a + 2 * (a * b) + b * b := by + rw [mul_comm b a, ← two_mul] </pre></div> </div> Notice that the proof does not begin with <code class="docutils literal notranslate">by</code>:
- @@ -314,44 +314,44 @@ try changing the indentation in the proof above to see what happens.
 using the <code class="docutils literal notranslate">sorry</code> tactic for justification, make sure Lean accepts the expression modulo these, and then justify the individual steps using tactics. - <div class="highlight-lean notranslate"><div class="highlight"><pre>example : (a + b) * (a + b) = a * a + 2 * (a * b) + b * b := - calc - (a + b) * (a + b) = a * a + b * a + (a * b + b * b) := by - sorry - _ = a * a + (b * a + a * b) + b * b := by - sorry - _ = a * a + 2 * (a * b) + b * b := by - sorry + <div class="highlight-lean notranslate"><div class="highlight"><pre>example : (a + b) * (a + b) = a * a + 2 * (a * b) + b * b := + calc + (a + b) * (a + b) = a * a + b * a + (a * b + b * b) := by + sorry + _ = a * a + (b * a + a * b) + b * b := by + sorry + _ = a * a + 2 * (a * b) + b * b := by + sorry </pre></div> </div> Try proving the following identity using both a pure <code class="docutils literal notranslate">rw</code> proof and a more structured <code class="docutils literal notranslate">calc</code> proof: - <div class="highlight-lean notranslate"><div class="highlight"><pre>example : (a + b) * (c + d) = a * c + a * d + b * c + b * d := by - sorry + <div class="highlight-lean notranslate"><div class="highlight"><pre>example : (a + b) * (c + d) = a * c + a * d + b * c + b * d := by + sorry </pre></div> </div> The following exercise is a little more challenging. You can use the theorems listed underneath. - <div class="highlight-lean notranslate"><div class="highlight"><pre>example (a b : ℝ) : (a + b) * (a - b) = a ^ 2 - b ^ 2 := by - sorry + <div class="highlight-lean notranslate"><div class="highlight"><pre>example (a b : ℝ) : (a + b) * (a - b) = a ^ 2 - b ^ 2 := by + sorry - #check pow_two a - #check mul_sub a b c - #check add_mul a b c - #check add_sub a b c - #check sub_sub a b c - #check add_zero a + #check pow_two a + #check mul_sub a b c + #check add_mul a b c + #check add_sub a b c + #check sub_sub a b c + #check add_zero a </pre></div> </div> We can also perform rewriting in an assumption in the context. For example, <code class="docutils literal notranslate">rw [mul_comm a b] at hyp</code> replaces <code class="docutils literal notranslate">a * b</code> by <code class="docutils literal notranslate">b * a</code> in the assumption <code class="docutils literal notranslate">hyp</code>. - <div class="highlight-lean notranslate"><div class="highlight"><pre>example (a b c d : ℝ) (hyp : c = d * a + b) (hyp' : b = a * d) : c = 2 * a * d := by - rw [hyp'] at hyp - rw [mul_comm d a] at hyp - rw [← two_mul (a * d)] at hyp - rw [← mul_assoc 2 a d] at hyp - exact hyp + <div class="highlight-lean notranslate"><div class="highlight"><pre>example (a b c d : ℝ) (hyp : c = d * a + b) (hyp' : b = a * d) : c = 2 * a * d := by + rw [hyp'] at hyp + rw [mul_comm d a] at hyp + rw [← two_mul (a * d)] at hyp + rw [← mul_assoc 2 a d] at hyp + exact hyp </pre></div> </div> In the last step, the <code class="docutils literal notranslate">exact</code> tactic can use <code class="docutils literal notranslate">hyp</code> to solve the goal
- @@ -360,18 +360,18 @@ because at that point <code class="docutils literal notranslate">ring</code> tactic, which is designed to prove identities in any commutative ring as long as they follow purely from the ring axioms, without using any local assumption. - <div class="highlight-lean notranslate"><div class="highlight"><pre>example : c * b * a = b * (a * c) := by - ring + <div class="highlight-lean notranslate"><div class="highlight"><pre>example : c * b * a = b * (a * c) := by + ring - example : (a + b) * (a + b) = a * a + 2 * (a * b) + b * b := by - ring + example : (a + b) * (a + b) = a * a + 2 * (a * b) + b * b := by + ring - example : (a + b) * (a - b) = a ^ 2 - b ^ 2 := by - ring + example : (a + b) * (a - b) = a ^ 2 - b ^ 2 := by + ring - example (hyp : c = d * a + b) (hyp' : b = a * d) : c = 2 * a * d := by - rw [hyp, hyp'] - ring + example (hyp : c = d * a + b) (hyp' : b = a * d) : c = 2 * a * d := by + rw [hyp, hyp'] + ring </pre></div> </div> The <code class="docutils literal notranslate">ring</code> tactic is imported indirectly when we
- @@ -386,9 +386,9 @@ structures.
 Possible matches are enumerated starting with 1, so in the following example, <code class="docutils literal notranslate">nth_rw 2 [h]</code> replaces the second occurrence of <code class="docutils literal notranslate">a + b</code> with <code class="docutils literal notranslate">c</code>. - <div class="highlight-lean notranslate"><div class="highlight"><pre>example (a b c : ℕ) (h : a + b = c) : (a + b) * (a + b) = a * c + b * c := by - nth_rw 2 [h] - rw [add_mul] + <div class="highlight-lean notranslate"><div class="highlight"><pre>example (a b c : ℕ) (h : a + b = c) : (a + b) * (a + b) = a * c + b * c := by + nth_rw 2 [h] + rw [add_mul] </pre></div> </div> </section>
- @@ -405,17 +405,17 @@ and multiplication distributes over addition.</li>
 </ul> In Lean, the collection of objects is represented as a type, <code class="docutils literal notranslate">R</code>. The ring axioms are as follows: - <div class="highlight-lean notranslate"><div class="highlight"><pre>variable (R : Type*) [Ring R] + <div class="highlight-lean notranslate"><div class="highlight"><pre>variable (R : Type*) [Ring R] - #check (add_assoc : ∀ a b c : R, a + b + c = a + (b + c)) - #check (add_comm : ∀ a b : R, a + b = b + a) - #check (zero_add : ∀ a : R, 0 + a = a) - #check (add_left_neg : ∀ a : R, -a + a = 0) - #check (mul_assoc : ∀ a b c : R, a * b * c = a * (b * c)) - #check (mul_one : ∀ a : R, a * 1 = a) - #check (one_mul : ∀ a : R, 1 * a = a) - #check (mul_add : ∀ a b c : R, a * (b + c) = a * b + a * c) - #check (add_mul : ∀ a b c : R, (a + b) * c = a * c + b * c) + #check (add_assoc : ∀ a b c : R, a + b + c = a + (b + c)) + #check (add_comm : ∀ a b : R, a + b = b + a) + #check (zero_add : ∀ a : R, 0 + a = a) + #check (add_left_neg : ∀ a : R, -a + a = 0) + #check (mul_assoc : ∀ a b c : R, a * b * c = a * (b * c)) + #check (mul_one : ∀ a : R, a * 1 = a) + #check (one_mul : ∀ a : R, 1 * a = a) + #check (mul_add : ∀ a b c : R, a * (b + c) = a * b + a * c) + #check (add_mul : ∀ a b c : R, (a + b) * c = a * c + b * c) </pre></div> </div> You will learn more about the square brackets in the first line later,
- @@ -452,18 +452,18 @@ form a ring in which commutativity usually fails. If we declare <code class="doc
 commutative ring, in fact, all the theorems in the last section continue to hold when we replace <code class="docutils literal notranslate">ℝ</code> by <code class="docutils literal notranslate">R</code>. - <div class="highlight-lean notranslate"><div class="highlight"><pre>variable (R : Type*) [CommRing R] - variable (a b c d : R) + <div class="highlight-lean notranslate"><div class="highlight"><pre>variable (R : Type*) [CommRing R] + variable (a b c d : R) - example : c * b * a = b * (a * c) := by ring + example : c * b * a = b * (a * c) := by ring - example : (a + b) * (a + b) = a * a + 2 * (a * b) + b * b := by ring + example : (a + b) * (a + b) = a * a + 2 * (a * b) + b * b := by ring - example : (a + b) * (a - b) = a ^ 2 - b ^ 2 := by ring + example : (a + b) * (a - b) = a ^ 2 - b ^ 2 := by ring - example (hyp : c = d * a + b) (hyp' : b = a * d) : c = 2 * a * d := by - rw [hyp, hyp'] - ring + example (hyp : c = d * a + b) (hyp' : b = a * d) : c = 2 * a * d := by + rw [hyp, hyp'] + ring </pre></div> </div> We leave it to you to check that all the other proofs go through unchanged.
- @@ -492,17 +492,17 @@ in the next example we put our versions of the library
 theorems in a new namespace called <code class="docutils literal notranslate">MyRing.</code> The next example shows that we do not need <code class="docutils literal notranslate">add_zero</code> or <code class="docutils literal notranslate">add_right_neg</code> as ring axioms, because they follow from the other axioms. - <div class="highlight-lean notranslate"><div class="highlight"><pre>namespace MyRing - variable {R : Type*} [Ring R] + <div class="highlight-lean notranslate"><div class="highlight"><pre>namespace MyRing + variable {R : Type*} [Ring R] - theorem add_zero (a : R) : a + 0 = a := by rw [add_comm, zero_add] + theorem add_zero (a : R) : a + 0 = a := by rw [add_comm, zero_add] - theorem add_right_neg (a : R) : a + -a = 0 := by rw [add_comm, add_left_neg] + theorem add_right_neg (a : R) : a + -a = 0 := by rw [add_comm, add_left_neg] - #check MyRing.add_zero - #check add_zero + #check MyRing.add_zero + #check add_zero - end MyRing + end MyRing </pre></div> </div> The net effect is that we can temporarily reprove a theorem in the library,
- @@ -517,21 +517,21 @@ This declares <code class="docutils literal notranslate">R</sp
 We will explain what this means in a moment, but don’t worry about it in the meanwhile.) Here is a useful theorem: - <div class="highlight-lean notranslate"><div class="highlight"><pre>theorem neg_add_cancel_left (a b : R) : -a + (a + b) = b := by - rw [← add_assoc, add_left_neg, zero_add] + <div class="highlight-lean notranslate"><div class="highlight"><pre>theorem neg_add_cancel_left (a b : R) : -a + (a + b) = b := by + rw [← add_assoc, add_left_neg, zero_add] </pre></div> </div> Prove the companion version: - <div class="highlight-lean notranslate"><div class="highlight"><pre>theorem add_neg_cancel_right (a b : R) : a + b + -b = a := by - sorry + <div class="highlight-lean notranslate"><div class="highlight"><pre>theorem add_neg_cancel_right (a b : R) : a + b + -b = a := by + sorry </pre></div> </div> Use these to prove the following: - <div class="highlight-lean notranslate"><div class="highlight"><pre>theorem add_left_cancel {a b c : R} (h : a + b = a + c) : b = c := by - sorry + <div class="highlight-lean notranslate"><div class="highlight"><pre>theorem add_left_cancel {a b c : R} (h : a + b = a + c) : b = c := by + sorry - theorem add_right_cancel {a b c : R} (h : a + b = c + b) : a = c := by - sorry + theorem add_right_cancel {a b c : R} (h : a + b = c + b) : a = c := by + sorry </pre></div> </div> With enough planning, you can do each of them with three rewrites.
- @@ -559,10 +559,10 @@ So, given the statement of the theorem above,
 the correct expression is simply <code class="docutils literal notranslate">add_left_cancel h</code>. To illustrate, let us show that <code class="docutils literal notranslate">a * 0 = 0</code> follows from the ring axioms. - <div class="highlight-lean notranslate"><div class="highlight"><pre>theorem mul_zero (a : R) : a * 0 = 0 := by - have h : a * 0 + a * 0 = a * 0 + 0 := by - rw [← mul_add, add_zero, add_zero] - rw [add_left_cancel h] + <div class="highlight-lean notranslate"><div class="highlight"><pre>theorem mul_zero (a : R) : a * 0 = 0 := by + have h : a * 0 + a * 0 = a * 0 + 0 := by + rw [← mul_add, add_zero, add_zero] + rw [add_left_cancel h] </pre></div> </div> We have used a new trick!
- @@ -592,26 +592,26 @@ than <code class="docutils literal notranslate">apply</
 human readers and easier to maintain when the library evolves. Remember that multiplication is not assumed to be commutative, so the following theorem also requires some work. - <div class="highlight-lean notranslate"><div class="highlight"><pre>theorem zero_mul (a : R) : 0 * a = 0 := by - sorry + <div class="highlight-lean notranslate"><div class="highlight"><pre>theorem zero_mul (a : R) : 0 * a = 0 := by + sorry </pre></div> </div> By now, you should also be able replace each <code class="docutils literal notranslate">sorry</code> in the next exercise with a proof, still using only facts about rings that we have established in this section. - <div class="highlight-lean notranslate"><div class="highlight"><pre>theorem neg_eq_of_add_eq_zero {a b : R} (h : a + b = 0) : -a = b := by - sorry + <div class="highlight-lean notranslate"><div class="highlight"><pre>theorem neg_eq_of_add_eq_zero {a b : R} (h : a + b = 0) : -a = b := by + sorry - theorem eq_neg_of_add_eq_zero {a b : R} (h : a + b = 0) : a = -b := by - sorry + theorem eq_neg_of_add_eq_zero {a b : R} (h : a + b = 0) : a = -b := by + sorry - theorem neg_zero : (-0 : R) = 0 := by - apply neg_eq_of_add_eq_zero - rw [add_zero] + theorem neg_zero : (-0 : R) = 0 := by + apply neg_eq_of_add_eq_zero + rw [add_zero] - theorem neg_neg (a : R) : - -a = a := by - sorry + theorem neg_neg (a : R) : - -a = a := by + sorry </pre></div> </div> We had to use the annotation <code class="docutils literal notranslate">(-0 : R)</code> instead of <code class="docutils literal notranslate">0</code> in the third theorem
- @@ -620,16 +620,16 @@ it is impossible for Lean to infer which <code class="docutils literal notransla
 and by default it would be interpreted as a natural number. In Lean, subtraction in a ring is provably equal to addition of the additive inverse. - <div class="highlight-lean notranslate"><div class="highlight"><pre>example (a b : R) : a - b = a + -b := - sub_eq_add_neg a b + <div class="highlight-lean notranslate"><div class="highlight"><pre>example (a b : R) : a - b = a + -b := + sub_eq_add_neg a b </pre></div> </div> On the real numbers, it is defined that way: - <div class="highlight-lean notranslate"><div class="highlight"><pre>example (a b : ℝ) : a - b = a + -b := - rfl + <div class="highlight-lean notranslate"><div class="highlight"><pre>example (a b : ℝ) : a - b = a + -b := + rfl - example (a b : ℝ) : a - b = a + -b := by - rfl + example (a b : ℝ) : a - b = a + -b := by + rfl </pre></div> </div> The proof term <code class="docutils literal notranslate">rfl</code> is short for “reflexivity”.
- @@ -644,8 +644,8 @@ but in some contexts, when dealing with the real numbers,
 you can use the two sides of the equation interchangeably. For example, you now have enough information to prove the theorem <code class="docutils literal notranslate">self_sub</code> from the last section: - <div class="highlight-lean notranslate"><div class="highlight"><pre>theorem self_sub (a : R) : a - a = 0 := by - sorry + <div class="highlight-lean notranslate"><div class="highlight"><pre>theorem self_sub (a : R) : a - a = 0 := by + sorry </pre></div> </div> Show that you can prove this using <code class="docutils literal notranslate">rw</code>,
- @@ -656,11 +656,11 @@ using either <code class="docutils literal notranslate">apply<
 With a bit of effort, you can use that to prove the theorem <code class="docutils literal notranslate">two_mul</code> from the last section: - <div class="highlight-lean notranslate"><div class="highlight"><pre>theorem one_add_one_eq_two : 1 + 1 = (2 : R) := by - norm_num + <div class="highlight-lean notranslate"><div class="highlight"><pre>theorem one_add_one_eq_two : 1 + 1 = (2 : R) := by + norm_num - theorem two_mul (a : R) : 2 * a = a + a := by - sorry + theorem two_mul (a : R) : 2 * a = a + a := by + sorry </pre></div> </div> We close this section by noting that some of the facts about
- @@ -668,11 +668,11 @@ addition and negation that we established above do not
 need the full strength of the ring axioms, or even commutativity of addition. The weaker notion of a group can be axiomatized as follows: - <div class="highlight-lean notranslate"><div class="highlight"><pre>variable (A : Type*) [AddGroup A] + <div class="highlight-lean notranslate"><div class="highlight"><pre>variable (A : Type*) [AddGroup A] - #check (add_assoc : ∀ a b c : A, a + b + c = a + (b + c)) - #check (zero_add : ∀ a : A, 0 + a = a) - #check (add_left_neg : ∀ a : A, -a + a = 0) + #check (add_assoc : ∀ a b c : A, a + b + c = a + (b + c)) + #check (zero_add : ∀ a : A, 0 + a = a) + #check (add_left_neg : ∀ a : A, -a + a = 0) </pre></div> </div> It is conventional to use additive notation when
- @@ -681,25 +681,25 @@ and multiplicative notation otherwise.
 So Lean defines a multiplicative version as well as the additive version (and also their abelian variants, <code class="docutils literal notranslate">AddCommGroup</code> and <code class="docutils literal notranslate">CommGroup</code>). - <div class="highlight-lean notranslate"><div class="highlight"><pre>variable {G : Type*} [Group G] + <div class="highlight-lean notranslate"><div class="highlight"><pre>variable {G : Type*} [Group G] - #check (mul_assoc : ∀ a b c : G, a * b * c = a * (b * c)) - #check (one_mul : ∀ a : G, 1 * a = a) - #check (mul_left_inv : ∀ a : G, a⁻¹ * a = 1) + #check (mul_assoc : ∀ a b c : G, a * b * c = a * (b * c)) + #check (one_mul : ∀ a : G, 1 * a = a) + #check (mul_left_inv : ∀ a : G, a⁻¹ * a = 1) </pre></div> </div> If you are feeling cocky, try proving the following facts about groups, using only these axioms. You will need to prove a number of helper lemmas along the way. The proofs we have carried out in this section provide some hints. - <div class="highlight-lean notranslate"><div class="highlight"><pre>theorem mul_right_inv (a : G) : a * a⁻¹ = 1 := by - sorry + <div class="highlight-lean notranslate"><div class="highlight"><pre>theorem mul_right_inv (a : G) : a * a⁻¹ = 1 := by + sorry - theorem mul_one (a : G) : a * 1 = a := by - sorry + theorem mul_one (a : G) : a * 1 = a := by + sorry - theorem mul_inv_rev (a b : G) : (a * b)⁻¹ = b⁻¹ * a⁻¹ := by - sorry + theorem mul_inv_rev (a b : G) : (a * b)⁻¹ = b⁻¹ * a⁻¹ := by + sorry </pre></div> </div> Explicitly invoking those lemmas is tedious, so Mathlib provides
- @@ -722,8 +722,8 @@ We have already seen that theorems can be applied to arguments and hypotheses,
 and that the <code class="docutils literal notranslate">apply</code> and <code class="docutils literal notranslate">exact</code> tactics can be used to solve goals. In this section, we will make good use of these tools. Consider the library theorems <code class="docutils literal notranslate">le_refl</code> and <code class="docutils literal notranslate">le_trans</code>: - <div class="highlight-lean notranslate"><div class="highlight"><pre>#check (le_refl : ∀ a : ℝ, a ≤ a) - #check (le_trans : a ≤ b → b ≤ c → a ≤ c) + <div class="highlight-lean notranslate"><div class="highlight"><pre>#check (le_refl : ∀ a : ℝ, a ≤ a) + #check (le_trans : a ≤ b → b ≤ c → a ≤ c) </pre></div> </div> As we explain in more detail in <a class="reference internal" href="C03_Logic.html#implication-and-the-universal-quantifier">Section 3.1</a>,
- @@ -736,13 +736,13 @@ Rather, it expects to infer them from the context in which they are used.
 For example, when hypotheses <code class="docutils literal notranslate">h : a ≤ b</code> and <code class="docutils literal notranslate">h' : b ≤ c</code> are in the context, all the following work: - <div class="highlight-lean notranslate"><div class="highlight"><pre>variable (h : a ≤ b) (h' : b ≤ c) + <div class="highlight-lean notranslate"><div class="highlight"><pre>variable (h : a ≤ b) (h' : b ≤ c) - #check (le_refl : ∀ a : Real, a ≤ a) - #check (le_refl a : a ≤ a) - #check (le_trans : a ≤ b → b ≤ c → a ≤ c) - #check (le_trans h : b ≤ c → a ≤ c) - #check (le_trans h h' : a ≤ c) + #check (le_refl : ∀ a : Real, a ≤ a) + #check (le_refl a : a ≤ a) + #check (le_trans : a ≤ b → b ≤ c → a ≤ c) + #check (le_trans h : b ≤ c → a ≤ c) + #check (le_trans h h' : a ≤ c) </pre></div> </div> The <code class="docutils literal notranslate">apply</code> tactic takes a proof of a general statement or implication,
- @@ -752,23 +752,23 @@ If the given proof matches the goal exactly
 (modulo definitional equality), you can use the <code class="docutils literal notranslate">exact</code> tactic instead of <code class="docutils literal notranslate">apply</code>. So, all of these work: - <div class="highlight-lean notranslate"><div class="highlight"><pre>example (x y z : ℝ) (h₀ : x ≤ y) (h₁ : y ≤ z) : x ≤ z := by - apply le_trans - · apply h₀ - . apply h₁ + <div class="highlight-lean notranslate"><div class="highlight"><pre>example (x y z : ℝ) (h₀ : x ≤ y) (h₁ : y ≤ z) : x ≤ z := by + apply le_trans + · apply h₀ + · apply h₁ - example (x y z : ℝ) (h₀ : x ≤ y) (h₁ : y ≤ z) : x ≤ z := by - apply le_trans h₀ - apply h₁ + example (x y z : ℝ) (h₀ : x ≤ y) (h₁ : y ≤ z) : x ≤ z := by + apply le_trans h₀ + apply h₁ - example (x y z : ℝ) (h₀ : x ≤ y) (h₁ : y ≤ z) : x ≤ z := - le_trans h₀ h₁ + example (x y z : ℝ) (h₀ : x ≤ y) (h₁ : y ≤ z) : x ≤ z := + le_trans h₀ h₁ - example (x : ℝ) : x ≤ x := by - apply le_refl + example (x : ℝ) : x ≤ x := by + apply le_refl - example (x : ℝ) : x ≤ x := - le_refl x + example (x : ℝ) : x ≤ x := + le_refl x </pre></div> </div> In the first example, applying <code class="docutils literal notranslate">le_trans</code>
- @@ -783,26 +783,26 @@ In the fourth example and in the last example,
 we avoid going into tactic mode entirely: <code class="docutils literal notranslate">le_trans h₀ h₁</code> and <code class="docutils literal notranslate">le_refl x</code> are the proof terms we need. Here are a few more library theorems: - <div class="highlight-lean notranslate"><div class="highlight"><pre>#check (le_refl : ∀ a, a ≤ a) - #check (le_trans : a ≤ b → b ≤ c → a ≤ c) - #check (lt_of_le_of_lt : a ≤ b → b < c → a < c) - #check (lt_of_lt_of_le : a < b → b ≤ c → a < c) - #check (lt_trans : a < b → b < c → a < c) + <div class="highlight-lean notranslate"><div class="highlight"><pre>#check (le_refl : ∀ a, a ≤ a) + #check (le_trans : a ≤ b → b ≤ c → a ≤ c) + #check (lt_of_le_of_lt : a ≤ b → b < c → a < c) + #check (lt_of_lt_of_le : a < b → b ≤ c → a < c) + #check (lt_trans : a < b → b < c → a < c) </pre></div> </div> Use them together with <code class="docutils literal notranslate">apply</code> and <code class="docutils literal notranslate">exact</code> to prove the following: - <div class="highlight-lean notranslate"><div class="highlight"><pre>example (h₀ : a ≤ b) (h₁ : b < c) (h₂ : c ≤ d) (h₃ : d < e) : a < e := by - sorry + <div class="highlight-lean notranslate"><div class="highlight"><pre>example (h₀ : a ≤ b) (h₁ : b < c) (h₂ : c ≤ d) (h₃ : d < e) : a < e := by + sorry </pre></div> </div> In fact, Lean has a tactic that does this sort of thing automatically: - <div class="highlight-lean notranslate"><div class="highlight"><pre>example (h₀ : a ≤ b) (h₁ : b < c) (h₂ : c ≤ d) (h₃ : d < e) : a < e := by - linarith + <div class="highlight-lean notranslate"><div class="highlight"><pre>example (h₀ : a ≤ b) (h₁ : b < c) (h₂ : c ≤ d) (h₃ : d < e) : a < e := by + linarith </pre></div> </div> The <code class="docutils literal notranslate">linarith</code> tactic is designed to handle linear arithmetic. - <div class="highlight-lean notranslate"><div class="highlight"><pre>example (h : 2 * a ≤ 3 * b) (h' : 1 ≤ a) (h'' : d = 2) : d + a ≤ 5 * b := by - linarith + <div class="highlight-lean notranslate"><div class="highlight"><pre>example (h : 2 * a ≤ 3 * b) (h' : 1 ≤ a) (h'' : d = 2) : d + a ≤ 5 * b := by + linarith </pre></div> </div> In addition to equations and inequalities in the context,
- @@ -816,28 +816,28 @@ applying a fact or theorem <code class="docutils literal notranslate">f (x + y)</code>. Without the parentheses, <code class="docutils literal notranslate">f x + y</code> would be parsed as <code class="docutils literal notranslate">(f x) + y</code>. - <div class="highlight-lean notranslate"><div class="highlight"><pre>example (h : 1 ≤ a) (h' : b ≤ c) : 2 + a + exp b ≤ 3 * a + exp c := by - linarith [exp_le_exp.mpr h'] + <div class="highlight-lean notranslate"><div class="highlight"><pre>example (h : 1 ≤ a) (h' : b ≤ c) : 2 + a + exp b ≤ 3 * a + exp c := by + linarith [exp_le_exp.mpr h'] </pre></div> </div> Here are some more theorems in the library that can be used to establish inequalities on the real numbers. - <div class="highlight-lean notranslate"><div class="highlight"><pre>#check (exp_le_exp : exp a ≤ exp b ↔ a ≤ b) - #check (exp_lt_exp : exp a < exp b ↔ a < b) - #check (log_le_log : 0 < a → a ≤ b → log a ≤ log b) - #check (log_lt_log : 0 < a → a < b → log a < log b) - #check (add_le_add : a ≤ b → c ≤ d → a + c ≤ b + d) - #check (add_le_add_left : a ≤ b → ∀ c, c + a ≤ c + b) - #check (add_le_add_right : a ≤ b → ∀ c, a + c ≤ b + c) - #check (add_lt_add_of_le_of_lt : a ≤ b → c < d → a + c < b + d) - #check (add_lt_add_of_lt_of_le : a < b → c ≤ d → a + c < b + d) - #check (add_lt_add_left : a < b → ∀ c, c + a < c + b) - #check (add_lt_add_right : a < b → ∀ c, a + c < b + c) - #check (add_nonneg : 0 ≤ a → 0 ≤ b → 0 ≤ a + b) - #check (add_pos : 0 < a → 0 < b → 0 < a + b) - #check (add_pos_of_pos_of_nonneg : 0 < a → 0 ≤ b → 0 < a + b) - #check (exp_pos : ∀ a, 0 < exp a) - #check add_le_add_left + <div class="highlight-lean notranslate"><div class="highlight"><pre>#check (exp_le_exp : exp a ≤ exp b ↔ a ≤ b) + #check (exp_lt_exp : exp a < exp b ↔ a < b) + #check (log_le_log : 0 < a → a ≤ b → log a ≤ log b) + #check (log_lt_log : 0 < a → a < b → log a < log b) + #check (add_le_add : a ≤ b → c ≤ d → a + c ≤ b + d) + #check (add_le_add_left : a ≤ b → ∀ c, c + a ≤ c + b) + #check (add_le_add_right : a ≤ b → ∀ c, a + c ≤ b + c) + #check (add_lt_add_of_le_of_lt : a ≤ b → c < d → a + c < b + d) + #check (add_lt_add_of_lt_of_le : a < b → c ≤ d → a + c < b + d) + #check (add_lt_add_left : a < b → ∀ c, c + a < c + b) + #check (add_lt_add_right : a < b → ∀ c, a + c < b + c) + #check (add_nonneg : 0 ≤ a → 0 ≤ b → 0 ≤ a + b) + #check (add_pos : 0 < a → 0 < b → 0 < a + b) + #check (add_pos_of_pos_of_nonneg : 0 < a → 0 ≤ b → 0 < a + b) + #check (exp_pos : ∀ a, 0 < exp a) + #check add_le_add_left </pre></div> </div> Some of the theorems, <code class="docutils literal notranslate">exp_le_exp</code>, <code class="docutils literal notranslate">exp_lt_exp</code>
- @@ -847,9 +847,9 @@ phrase “if and only if.”
 We will discuss this connective in greater detail in the next chapter. Such a theorem can be used with <code class="docutils literal notranslate">rw</code> to rewrite a goal to an equivalent one: - <div class="highlight-lean notranslate"><div class="highlight"><pre>example (h : a ≤ b) : exp a ≤ exp b := by - rw [exp_le_exp] - exact h + <div class="highlight-lean notranslate"><div class="highlight"><pre>example (h : a ≤ b) : exp a ≤ exp b := by + rw [exp_le_exp] + exact h </pre></div> </div> In this section, however, we will use the fact that if <code class="docutils literal notranslate">h : A ↔ B</code>
- @@ -861,11 +861,11 @@ Here, <code class="docutils literal notranslate">mp</co
 You can also use <code class="docutils literal notranslate">h.1</code> and <code class="docutils literal notranslate">h.2</code> for <code class="docutils literal notranslate">h.mp</code> and <code class="docutils literal notranslate">h.mpr</code>, respectively, if you prefer. Thus the following proof works: - <div class="highlight-lean notranslate"><div class="highlight"><pre>example (h₀ : a ≤ b) (h₁ : c < d) : a + exp c + e < b + exp d + e := by - apply add_lt_add_of_lt_of_le - · apply add_lt_add_of_le_of_lt h₀ - apply exp_lt_exp.mpr h₁ - apply le_refl + <div class="highlight-lean notranslate"><div class="highlight"><pre>example (h₀ : a ≤ b) (h₁ : c < d) : a + exp c + e < b + exp d + e := by + apply add_lt_add_of_lt_of_le + · apply add_lt_add_of_le_of_lt h₀ + apply exp_lt_exp.mpr h₁ + apply le_refl </pre></div> </div> The first line, <code class="docutils literal notranslate">apply add_lt_add_of_lt_of_le</code>,
- @@ -875,14 +875,14 @@ proof of the first from the proof of the second.
 Try the following examples on your own. The example in the middle shows you that the <code class="docutils literal notranslate">norm_num</code> tactic can be used to solve concrete numeric goals. - <div class="highlight-lean notranslate"><div class="highlight"><pre>example (h₀ : d ≤ e) : c + exp (a + d) ≤ c + exp (a + e) := by sorry + <div class="highlight-lean notranslate"><div class="highlight"><pre>example (h₀ : d ≤ e) : c + exp (a + d) ≤ c + exp (a + e) := by sorry - example : (0 : ℝ) < 1 := by norm_num + example : (0 : ℝ) < 1 := by norm_num - example (h : a ≤ b) : log (1 + exp a) ≤ log (1 + exp b) := by - have h₀ : 0 < 1 + exp a := by sorry - apply log_le_log h₀ - sorry + example (h : a ≤ b) : log (1 + exp a) ≤ log (1 + exp b) := by + have h₀ : 0 < 1 + exp a := by sorry + apply log_le_log h₀ + sorry </pre></div> </div> From these examples, it should be clear that being able to
- @@ -912,9 +912,9 @@ and you can find similar theorems nearby.</li>
 <li>You can use the <code class="docutils literal notranslate">apply?</code> tactic, which tries to find the relevant theorem in the library.</li> </ul> - <div class="highlight-lean notranslate"><div class="highlight"><pre>example : 0 ≤ a ^ 2 := by - -- apply? - exact sq_nonneg a + <div class="highlight-lean notranslate"><div class="highlight"><pre>example : 0 ≤ a ^ 2 := by + -- apply? + exact sq_nonneg a </pre></div> </div> To try out <code class="docutils literal notranslate">apply?</code> in this example,
- @@ -922,23 +922,23 @@ delete the <code class="docutils literal notranslate">exact</s
 Using these tricks, see if you can find what you need to do the next example: - <div class="highlight-lean notranslate"><div class="highlight"><pre>example (h : a ≤ b) : c - exp b ≤ c - exp a := by - sorry + <div class="highlight-lean notranslate"><div class="highlight"><pre>example (h : a ≤ b) : c - exp b ≤ c - exp a := by + sorry </pre></div> </div> Using the same tricks, confirm that <code class="docutils literal notranslate">linarith</code> instead of <code class="docutils literal notranslate">apply?</code> can also finish the job. Here is another example of an inequality: - <div class="highlight-lean notranslate"><div class="highlight"><pre>example : 2 * a * b ≤ a ^ 2 + b ^ 2 := by - have h : 0 ≤ a ^ 2 - 2 * a * b + b ^ 2 - calc - a ^ 2 - 2 * a * b + b ^ 2 = (a - b) ^ 2 := by ring - _ ≥ 0 := by apply pow_two_nonneg + <div class="highlight-lean notranslate"><div class="highlight"><pre>example : 2 * a * b ≤ a ^ 2 + b ^ 2 := by + have h : 0 ≤ a ^ 2 - 2 * a * b + b ^ 2 + calc + a ^ 2 - 2 * a * b + b ^ 2 = (a - b) ^ 2 := by ring + _ ≥ 0 := by apply pow_two_nonneg - calc - 2 * a * b = 2 * a * b + 0 := by ring - _ ≤ 2 * a * b + (a ^ 2 - 2 * a * b + b ^ 2) := add_le_add (le_refl _) h - _ = a ^ 2 + b ^ 2 := by ring + calc + 2 * a * b = 2 * a * b + 0 := by ring + _ ≤ 2 * a * b + (a ^ 2 - 2 * a * b + b ^ 2) := add_le_add (le_refl _) h + _ = a ^ 2 + b ^ 2 := by ring </pre></div> </div> Mathlib tends to put spaces around binary operations like <code class="docutils literal notranslate">*</code> and <code class="docutils literal notranslate">^</code>,
- @@ -958,22 +958,22 @@ we can simply write the proof term <code class="docutils literal notranslate"><s
 out the hypothesis <code class="docutils literal notranslate">h</code>. Once we have it, the second calculation involves only linear arithmetic, and <code class="docutils literal notranslate">linarith</code> can handle it: - <div class="highlight-lean notranslate"><div class="highlight"><pre>example : 2 * a * b ≤ a ^ 2 + b ^ 2 := by - have h : 0 ≤ a ^ 2 - 2 * a * b + b ^ 2 - calc - a ^ 2 - 2 * a * b + b ^ 2 = (a - b) ^ 2 := by ring - _ ≥ 0 := by apply pow_two_nonneg - linarith + <div class="highlight-lean notranslate"><div class="highlight"><pre>example : 2 * a * b ≤ a ^ 2 + b ^ 2 := by + have h : 0 ≤ a ^ 2 - 2 * a * b + b ^ 2 + calc + a ^ 2 - 2 * a * b + b ^ 2 = (a - b) ^ 2 := by ring + _ ≥ 0 := by apply pow_two_nonneg + linarith </pre></div> </div> How nice! We challenge you to use these ideas to prove the following theorem. You can use the theorem <code class="docutils literal notranslate">abs_le'.mpr</code>. You will also need the <code class="docutils literal notranslate">constructor</code> tactic to split a conjunction to two goals; see <a class="reference internal" href="C03_Logic.html#conjunction-and-biimplication">Section 3.4</a>. - <div class="highlight-lean notranslate"><div class="highlight"><pre>example : |a * b| ≤ (a ^ 2 + b ^ 2) / 2 := by - sorry + <div class="highlight-lean notranslate"><div class="highlight"><pre>example : |a * b| ≤ (a ^ 2 + b ^ 2) / 2 := by + sorry - #check abs_le'.mpr + #check abs_le'.mpr </pre></div> </div> If you managed to solve this, congratulations!
- @@ -983,9 +983,9 @@ You are well on your way to becoming a master formalizer.
 <h2>2.4. More examples using apply and rw<a class="headerlink" href="#more-examples-using-apply-and-rw" title="Link to this heading"></a></h2> The <code class="docutils literal notranslate">min</code> function on the real numbers is uniquely characterized by the following three facts: - <div class="highlight-lean notranslate"><div class="highlight"><pre>#check (min_le_left a b : min a b ≤ a) - #check (min_le_right a b : min a b ≤ b) - #check (le_min : c ≤ a → c ≤ b → c ≤ min a b) + <div class="highlight-lean notranslate"><div class="highlight"><pre>#check (min_le_left a b : min a b ≤ a) + #check (min_le_right a b : min a b ≤ b) + #check (le_min : c ≤ a → c ≤ b → c ≤ min a b) </pre></div> </div> Can you guess the names of the theorems that characterize
- @@ -1010,16 +1010,16 @@ With time, these conventions will become second nature.
 real numbers are equal if each is less than or equal to the other. Using this and the facts above, we can show that <code class="docutils literal notranslate">min</code> is commutative: - <div class="highlight-lean notranslate"><div class="highlight"><pre>example : min a b = min b a := by - apply le_antisymm - · show min a b ≤ min b a - apply le_min - · apply min_le_right - apply min_le_left - · show min b a ≤ min a b - apply le_min - · apply min_le_right - apply min_le_left + <div class="highlight-lean notranslate"><div class="highlight"><pre>example : min a b = min b a := by + apply le_antisymm + · show min a b ≤ min b a + apply le_min + · apply min_le_right + apply min_le_left + · show min b a ≤ min a b + apply le_min + · apply min_le_right + apply min_le_left </pre></div> </div> Here we have used dots to separate proofs of
- @@ -1039,15 +1039,15 @@ but using them makes the proof easier to read and maintain.
 To foreshadow skills you will learn later on, we note that one way to avoid the repetition is to state a local lemma and then use it: - <div class="highlight-lean notranslate"><div class="highlight"><pre>example : min a b = min b a := by - have h : ∀ x y : ℝ, min x y ≤ min y x := by - intro x y - apply le_min - apply min_le_right - apply min_le_left - apply le_antisymm - apply h - apply h + <div class="highlight-lean notranslate"><div class="highlight"><pre>example : min a b = min b a := by + have h : ∀ x y : ℝ, min x y ≤ min y x := by + intro x y + apply le_min + apply min_le_right + apply min_le_left + apply le_antisymm + apply h + apply h </pre></div> </div> We will say more about the universal quantifier in
- @@ -1062,20 +1062,20 @@ uses <code class="docutils literal notranslate">h Another solution is to use the <code class="docutils literal notranslate">repeat</code> tactic, which applies a tactic (or a block) as many times as it can. - <div class="highlight-lean notranslate"><div class="highlight"><pre>example : min a b = min b a := by - apply le_antisymm - repeat - apply le_min - apply min_le_right - apply min_le_left + <div class="highlight-lean notranslate"><div class="highlight"><pre>example : min a b = min b a := by + apply le_antisymm + repeat + apply le_min + apply min_le_right + apply min_le_left </pre></div> </div> We encourage you to prove the following as exercises. You can use either of the tricks just described to shorten the first. - <div class="highlight-lean notranslate"><div class="highlight"><pre>example : max a b = max b a := by - sorry - example : min (min a b) c = min a (min b c) := by - sorry + <div class="highlight-lean notranslate"><div class="highlight"><pre>example : max a b = max b a := by + sorry + example : min (min a b) c = min a (min b c) := by + sorry </pre></div> </div> Of course, you are welcome to prove the associativity of <code class="docutils literal notranslate">max</code> as well.
- @@ -1098,10 +1098,10 @@ and in the second case, we have <code class="docutils literal notranslate">Section 3.5</a>, but for now we will stick to examples that don’t require the case split. Here is one such example: - <div class="highlight-lean notranslate"><div class="highlight"><pre>theorem aux : min a b + c ≤ min (a + c) (b + c) := by - sorry - example : min a b + c = min (a + c) (b + c) := by - sorry + <div class="highlight-lean notranslate"><div class="highlight"><pre>theorem aux : min a b + c ≤ min (a + c) (b + c) := by + sorry + example : min a b + c = min (a + c) (b + c) := by + sorry </pre></div> </div> It is clear that <code class="docutils literal notranslate">aux</code> provides one of the two inequalities
- @@ -1112,12 +1112,12 @@ As a hint, you can use the theorem <code class="docutils literal notranslate"><s
 and the <code class="docutils literal notranslate">linarith</code> tactic. Lean’s naming convention is made manifest in the library’s name for the triangle inequality: - <div class="highlight-lean notranslate"><div class="highlight"><pre>#check (abs_add : ∀ a b : ℝ, |a + b| ≤ |a| + |b|) + <div class="highlight-lean notranslate"><div class="highlight"><pre>#check (abs_add : ∀ a b : ℝ, |a + b| ≤ |a| + |b|) </pre></div> </div> Use it to prove the following variant, using also <code class="docutils literal notranslate">add_sub_cancel_right</code>: - <div class="highlight-lean notranslate"><div class="highlight"><pre>example : |a| - |b| ≤ |a - b| := - sorry + <div class="highlight-lean notranslate"><div class="highlight"><pre>example : |a| - |b| ≤ |a - b| := + sorry end </pre></div> </div>
- @@ -1132,15 +1132,15 @@ Rather, it is a unicode character obtained by
 typing <code class="docutils literal notranslate">\|</code> in VS Code. By convention, Mathlib uses <code class="docutils literal notranslate">dvd</code> to refer to it in theorem names. - <div class="highlight-lean notranslate"><div class="highlight"><pre>example (h₀ : x ∣ y) (h₁ : y ∣ z) : x ∣ z := - dvd_trans h₀ h₁ + <div class="highlight-lean notranslate"><div class="highlight"><pre>example (h₀ : x ∣ y) (h₁ : y ∣ z) : x ∣ z := + dvd_trans h₀ h₁ - example : x ∣ y * x * z := by - apply dvd_mul_of_dvd_left - apply dvd_mul_left + example : x ∣ y * x * z := by + apply dvd_mul_of_dvd_left + apply dvd_mul_left - example : x ∣ x ^ 2 := by - apply dvd_mul_left + example : x ∣ x ^ 2 := by + apply dvd_mul_left </pre></div> </div> In the last example, the exponent is a natural
- @@ -1149,8 +1149,8 @@ forces Lean to expand the definition of <code class="docutils literal notranslat
 <code class="docutils literal notranslate">x^1 * x</code>. See if you can guess the names of the theorems you need to prove the following: - <div class="highlight-lean notranslate"><div class="highlight"><pre>example (h : x ∣ w) : x ∣ y * (x * z) + x ^ 2 + w ^ 2 := by - sorry + <div class="highlight-lean notranslate"><div class="highlight"><pre>example (h : x ∣ w) : x ∣ y * (x * z) + x ^ 2 + w ^ 2 := by + sorry end </pre></div> </div>
- @@ -1159,18 +1159,18 @@ you need to prove the following:
 are analogous to <code class="docutils literal notranslate">min</code> and <code class="docutils literal notranslate">max</code>. Since every number divides <code class="docutils literal notranslate">0</code>, <code class="docutils literal notranslate">0</code> is really the greatest element with respect to divisibility: - <div class="highlight-lean notranslate"><div class="highlight"><pre>variable (m n : ℕ) + <div class="highlight-lean notranslate"><div class="highlight"><pre>variable (m n : ℕ) - #check (Nat.gcd_zero_right n : Nat.gcd n 0 = n) - #check (Nat.gcd_zero_left n : Nat.gcd 0 n = n) - #check (Nat.lcm_zero_right n : Nat.lcm n 0 = 0) - #check (Nat.lcm_zero_left n : Nat.lcm 0 n = 0) + #check (Nat.gcd_zero_right n : Nat.gcd n 0 = n) + #check (Nat.gcd_zero_left n : Nat.gcd 0 n = n) + #check (Nat.lcm_zero_right n : Nat.lcm n 0 = 0) + #check (Nat.lcm_zero_left n : Nat.lcm 0 n = 0) </pre></div> </div> See if you can guess the names of the theorems you will need to prove the following: - <div class="highlight-lean notranslate"><div class="highlight"><pre>example : Nat.gcd m n = Nat.gcd n m := by - sorry + <div class="highlight-lean notranslate"><div class="highlight"><pre>example : Nat.gcd m n = Nat.gcd n m := by + sorry </pre></div> </div> Hint: you can use <code class="docutils literal notranslate">dvd_antisymm</code>, but if you do, Lean will
- @@ -1192,13 +1192,13 @@ For example, a partial order consists of a set with a
 binary relation that is reflexive, transitive, and antisymmetric. like <code class="docutils literal notranslate">≤</code> on the real numbers. Lean knows about partial orders: - <div class="highlight-lean notranslate"><div class="highlight"><pre>variable {α : Type*} [PartialOrder α] - variable (x y z : α) + <div class="highlight-lean notranslate"><div class="highlight"><pre>variable {α : Type*} [PartialOrder α] + variable (x y z : α) - #check x ≤ y - #check (le_refl x : x ≤ x) - #check (le_trans : x ≤ y → y ≤ z → x ≤ z) - #check (le_antisymm : x ≤ y → y ≤ x → x = y) + #check x ≤ y + #check (le_refl x : x ≤ x) + #check (le_trans : x ≤ y → y ≤ z → x ≤ z) + #check (le_antisymm : x ≤ y → y ≤ x → x = y) </pre></div> </div> Here we are adopting the Mathlib convention of using
- @@ -1217,14 +1217,14 @@ which acts somewhat like <code class="docutils literal notranslate">x</code> is less than <code class="docutils literal notranslate">y</code> in this order is equivalent to saying that it is less-than-or-equal to <code class="docutils literal notranslate">y</code> and not equal to <code class="docutils literal notranslate">y</code>. - <div class="highlight-lean notranslate"><div class="highlight"><pre>#check x < y - #check (lt_irrefl x : ¬ (x < x)) - #check (lt_trans : x < y → y < z → x < z) - #check (lt_of_le_of_lt : x ≤ y → y < z → x < z) - #check (lt_of_lt_of_le : x < y → y ≤ z → x < z) + <div class="highlight-lean notranslate"><div class="highlight"><pre>#check x < y + #check (lt_irrefl x : ¬ (x < x)) + #check (lt_trans : x < y → y < z → x < z) + #check (lt_of_le_of_lt : x ≤ y → y < z → x < z) + #check (lt_of_lt_of_le : x < y → y ≤ z → x < z) - example : x < y ↔ x ≤ y ∧ x ≠ y := - lt_iff_le_and_ne + example : x < y ↔ x ≤ y ∧ x ≠ y := + lt_iff_le_and_ne </pre></div> </div> In this example, the symbol <code class="docutils literal notranslate">∧</code> stands for “and,”
- @@ -1236,17 +1236,17 @@ has the properties indicated.
 A lattice is a structure that extends a partial order with operations <code class="docutils literal notranslate">⊓</code> and <code class="docutils literal notranslate">⊔</code> that are analogous to <code class="docutils literal notranslate">min</code> and <code class="docutils literal notranslate">max</code> on the real numbers: - <div class="highlight-lean notranslate"><div class="highlight"><pre>variable {α : Type*} [Lattice α] - variable (x y z : α) + <div class="highlight-lean notranslate"><div class="highlight"><pre>variable {α : Type*} [Lattice α] + variable (x y z : α) - #check x ⊓ y - #check (inf_le_left : x ⊓ y ≤ x) - #check (inf_le_right : x ⊓ y ≤ y) - #check (le_inf : z ≤ x → z ≤ y → z ≤ x ⊓ y) - #check x ⊔ y - #check (le_sup_left : x ≤ x ⊔ y) - #check (le_sup_right : y ≤ x ⊔ y) - #check (sup_le : x ≤ z → y ≤ z → x ⊔ y ≤ z) + #check x ⊓ y + #check (inf_le_left : x ⊓ y ≤ x) + #check (inf_le_right : x ⊓ y ≤ y) + #check (le_inf : z ≤ x → z ≤ y → z ≤ x ⊓ y) + #check x ⊔ y + #check (le_sup_left : x ≤ x ⊔ y) + #check (le_sup_right : y ≤ x ⊔ y) + #check (sup_le : x ≤ z → y ≤ z → x ⊔ y ≤ z) </pre></div> </div> The characterizations of <code class="docutils literal notranslate">⊓</code> and <code class="docutils literal notranslate">⊔</code> justify calling them
- @@ -1301,28 +1301,28 @@ which takes <code class="docutils literal notranslate">yexact le_trans inf_le_left inf_le_right</code>, but this requires a lot more planning. - <div class="highlight-lean notranslate"><div class="highlight"><pre>example : x ⊓ y = y ⊓ x := by - sorry + <div class="highlight-lean notranslate"><div class="highlight"><pre>example : x ⊓ y = y ⊓ x := by + sorry - example : x ⊓ y ⊓ z = x ⊓ (y ⊓ z) := by - sorry + example : x ⊓ y ⊓ z = x ⊓ (y ⊓ z) := by + sorry - example : x ⊔ y = y ⊔ x := by - sorry + example : x ⊔ y = y ⊔ x := by + sorry - example : x ⊔ y ⊔ z = x ⊔ (y ⊔ z) := by - sorry + example : x ⊔ y ⊔ z = x ⊔ (y ⊔ z) := by + sorry </pre></div> </div> You can find these theorems in the Mathlib as <code class="docutils literal notranslate">inf_comm</code>, <code class="docutils literal notranslate">inf_assoc</code>, <code class="docutils literal notranslate">sup_comm</code>, and <code class="docutils literal notranslate">sup_assoc</code>, respectively. Another good exercise is to prove the absorption laws using only those axioms: - <div class="highlight-lean notranslate"><div class="highlight"><pre>theorem absorb1 : x ⊓ (x ⊔ y) = x := by - sorry + <div class="highlight-lean notranslate"><div class="highlight"><pre>theorem absorb1 : x ⊓ (x ⊔ y) = x := by + sorry - theorem absorb2 : x ⊔ x ⊓ y = x := by - sorry + theorem absorb2 : x ⊔ x ⊓ y = x := by + sorry </pre></div> </div> These can be found in Mathlib with the names <code class="docutils literal notranslate">inf_sup_self</code> and <code class="docutils literal notranslate">sup_inf_self</code>.
- @@ -1330,13 +1330,13 @@ using only those axioms:
 <code class="docutils literal notranslate">x ⊓ (y ⊔ z) = (x ⊓ y) ⊔ (x ⊓ z)</code> and <code class="docutils literal notranslate">x ⊔ (y ⊓ z) = (x ⊔ y) ⊓ (x ⊔ z)</code> is called a distributive lattice. Lean knows about these too: - <div class="highlight-lean notranslate"><div class="highlight"><pre>variable {α : Type*} [DistribLattice α] - variable (x y z : α) + <div class="highlight-lean notranslate"><div class="highlight"><pre>variable {α : Type*} [DistribLattice α] + variable (x y z : α) - #check (inf_sup_left x y z : x ⊓ (y ⊔ z) = x ⊓ y ⊔ x ⊓ z) - #check (inf_sup_right x y z : (x ⊔ y) ⊓ z = x ⊓ z ⊔ y ⊓ z) - #check (sup_inf_left x y z : x ⊔ y ⊓ z = (x ⊔ y) ⊓ (x ⊔ z)) - #check (sup_inf_right x y z : x ⊓ y ⊔ z = (x ⊔ z) ⊓ (y ⊔ z)) + #check (inf_sup_left x y z : x ⊓ (y ⊔ z) = x ⊓ y ⊔ x ⊓ z) + #check (inf_sup_right x y z : (x ⊔ y) ⊓ z = x ⊓ z ⊔ y ⊓ z) + #check (sup_inf_left x y z : x ⊔ y ⊓ z = (x ⊔ y) ⊓ (x ⊔ z)) + #check (sup_inf_right x y z : x ⊓ y ⊔ z = (x ⊔ z) ⊓ (y ⊔ z)) </pre></div> </div> The left and right versions are easily shown to be
- @@ -1347,14 +1347,14 @@ by providing an explicit description of a
 nondistributive lattice with finitely many elements. It is also a good exercise to show that in any lattice, either distributivity law implies the other: - <div class="highlight-lean notranslate"><div class="highlight"><pre>variable {α : Type*} [Lattice α] - variable (a b c : α) + <div class="highlight-lean notranslate"><div class="highlight"><pre>variable {α : Type*} [Lattice α] + variable (a b c : α) - example (h : ∀ x y z : α, x ⊓ (y ⊔ z) = x ⊓ y ⊔ x ⊓ z) : a ⊔ b ⊓ c = (a ⊔ b) ⊓ (a ⊔ c) := by - sorry + example (h : ∀ x y z : α, x ⊓ (y ⊔ z) = x ⊓ y ⊔ x ⊓ z) : a ⊔ b ⊓ c = (a ⊔ b) ⊓ (a ⊔ c) := by + sorry - example (h : ∀ x y z : α, x ⊔ y ⊓ z = (x ⊔ y) ⊓ (x ⊔ z)) : a ⊓ (b ⊔ c) = a ⊓ b ⊔ a ⊓ c := by - sorry + example (h : ∀ x y z : α, x ⊔ y ⊓ z = (x ⊔ y) ⊓ (x ⊔ z)) : a ⊓ (b ⊔ c) = a ⊓ b ⊔ a ⊓ c := by + sorry </pre></div> </div> It is possible to combine axiomatic structures into larger ones.
- @@ -1362,16 +1362,16 @@ For example, a strict ordered ring consists of a commutative ring toget
 with a partial order on the carrier satisfying additional axioms that say that the ring operations are compatible with the order: - <div class="highlight-lean notranslate"><div class="highlight"><pre>variable {R : Type*} [StrictOrderedRing R] - variable (a b c : R) + <div class="highlight-lean notranslate"><div class="highlight"><pre>variable {R : Type*} [StrictOrderedRing R] + variable (a b c : R) - #check (add_le_add_left : a ≤ b → ∀ c, c + a ≤ c + b) - #check (mul_pos : 0 < a → 0 < b → 0 < a * b) + #check (add_le_add_left : a ≤ b → ∀ c, c + a ≤ c + b) + #check (mul_pos : 0 < a → 0 < b → 0 < a * b) </pre></div> </div> <a class="reference internal" href="C03_Logic.html#logic">Chapter 3</a> will provide the means to derive the following from <code class="docutils literal notranslate">mul_pos</code> and the definition of <code class="docutils literal notranslate"><</code>: - <div class="highlight-lean notranslate"><div class="highlight"><pre>#check (mul_nonneg : 0 ≤ a → 0 ≤ b → 0 ≤ a * b) + <div class="highlight-lean notranslate"><div class="highlight"><pre>#check (mul_nonneg : 0 ≤ a → 0 ≤ b → 0 ≤ a * b) </pre></div> </div> It is then an extended exercise to show that many common facts
- @@ -1380,14 +1380,14 @@ numbers hold generically for any ordered ring.
 Here are a couple of examples you can try, using only properties of rings, partial orders, and the facts enumerated in the last two examples: - <div class="highlight-lean notranslate"><div class="highlight"><pre>example (h : a ≤ b) : 0 ≤ b - a := by - sorry + <div class="highlight-lean notranslate"><div class="highlight"><pre>example (h : a ≤ b) : 0 ≤ b - a := by + sorry - example (h: 0 ≤ b - a) : a ≤ b := by - sorry + example (h: 0 ≤ b - a) : a ≤ b := by + sorry - example (h : a ≤ b) (h' : 0 ≤ c) : a * c ≤ b * c := by - sorry + example (h : a ≤ b) (h' : 0 ≤ c) : a * c ≤ b * c := by + sorry </pre></div> </div> Finally, here is one last example.
- @@ -1395,19 +1395,19 @@ A metric space consists of a set equipped with a notion of
 distance, <code class="docutils literal notranslate">dist x y</code>, mapping any pair of elements to a real number. The distance function is assumed to satisfy the following axioms: - <div class="highlight-lean notranslate"><div class="highlight"><pre>variable {X : Type*} [MetricSpace X] - variable (x y z : X) + <div class="highlight-lean notranslate"><div class="highlight"><pre>variable {X : Type*} [MetricSpace X] + variable (x y z : X) - #check (dist_self x : dist x x = 0) - #check (dist_comm x y : dist x y = dist y x) - #check (dist_triangle x y z : dist x z ≤ dist x y + dist y z) + #check (dist_self x : dist x x = 0) + #check (dist_comm x y : dist x y = dist y x) + #check (dist_triangle x y z : dist x z ≤ dist x y + dist y z) </pre></div> </div> Having mastered this section, you can show that it follows from these axioms that distances are always nonnegative: - <div class="highlight-lean notranslate"><div class="highlight"><pre>example (x y : X) : 0 ≤ dist x y := by - sorry + <div class="highlight-lean notranslate"><div class="highlight"><pre>example (x y : X) : 0 ≤ dist x y := by + sorry </pre></div> </div> We recommend making use of the theorem <code class="docutils literal notranslate">nonneg_of_mul_nonneg_left</code>.
html/C03_Logic.html
- @@ -18,7 +18,7 @@
 <script src="_static/jquery.js?v=5d32c60e"></script> <script src="_static/_sphinx_javascript_frameworks_compat.js?v=2cd50e6c"></script> <script src="_static/documentation_options.js?v=2709fde1"></script> - <script src="_static/doctools.js?v=888ff710"></script> + <script src="_static/doctools.js?v=9a2dae69"></script> <script src="_static/sphinx_highlight.js?v=dc90522c"></script> <script async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-mml-chtml.js"></script> <script src="_static/js/theme.js"></script>
- @@ -110,13 +110,13 @@ that are built up in this way.
 <section id="implication-and-the-universal-quantifier"> <h2>3.1. Implication and the Universal Quantifier<a class="headerlink" href="#implication-and-the-universal-quantifier" title="Link to this heading"></a></h2> Consider the statement after the <code class="docutils literal notranslate">#check</code>: - <div class="highlight-lean notranslate"><div class="highlight"><pre>#check ∀ x : ℝ, 0 ≤ x → |x| = x + <div class="highlight-lean notranslate"><div class="highlight"><pre>#check ∀ x : ℝ, 0 ≤ x → |x| = x </pre></div> </div> In words, we would say “for every real number <code class="docutils literal notranslate">x</code>, if <code class="docutils literal notranslate">0 ≤ x</code> then the absolute value of <code class="docutils literal notranslate">x</code> equals <code class="docutils literal notranslate">x</code>”. We can also have more complicated statements like: - <div class="highlight-lean notranslate"><div class="highlight"><pre>#check ∀ x y ε : ℝ, 0 < ε → ε ≤ 1 → |x| < ε → |y| < ε → |x * y| < ε + <div class="highlight-lean notranslate"><div class="highlight"><pre>#check ∀ x y ε : ℝ, 0 < ε → ε ≤ 1 → |x| < ε → |y| < ε → |x * y| < ε </pre></div> </div> In words, we would say “for every <code class="docutils literal notranslate">x</code>, <code class="docutils literal notranslate">y</code>, and <code class="docutils literal notranslate">ε</code>,
- @@ -137,17 +137,17 @@ In particular, if you have proved a theorem of that form,
 you can apply it to objects and hypotheses in the same way. We will use as an example the following statement that we will help you to prove a bit later: - <div class="highlight-lean notranslate"><div class="highlight"><pre>theorem my_lemma : ∀ x y ε : ℝ, 0 < ε → ε ≤ 1 → |x| < ε → |y| < ε → |x * y| < ε := - sorry + <div class="highlight-lean notranslate"><div class="highlight"><pre>theorem my_lemma : ∀ x y ε : ℝ, 0 < ε → ε ≤ 1 → |x| < ε → |y| < ε → |x * y| < ε := + sorry section - variable (a b δ : ℝ) - variable (h₀ : 0 < δ) (h₁ : δ ≤ 1) - variable (ha : |a| < δ) (hb : |b| < δ) + variable (a b δ : ℝ) + variable (h₀ : 0 < δ) (h₁ : δ ≤ 1) + variable (ha : |a| < δ) (hb : |b| < δ) - #check my_lemma a b δ - #check my_lemma a b δ h₀ h₁ - #check my_lemma a b δ h₀ h₁ ha hb + #check my_lemma a b δ + #check my_lemma a b δ h₀ h₁ + #check my_lemma a b δ h₀ h₁ ha hb end </pre></div>
- @@ -157,15 +157,15 @@ to use curly brackets to make quantified variables implicit
 when they can be inferred from subsequent hypotheses. When we do that, we can just apply a lemma to the hypotheses without mentioning the objects. - <div class="highlight-lean notranslate"><div class="highlight"><pre>theorem my_lemma2 : ∀ {x y ε : ℝ}, 0 < ε → ε ≤ 1 → |x| < ε → |y| < ε → |x * y| < ε := - sorry + <div class="highlight-lean notranslate"><div class="highlight"><pre>theorem my_lemma2 : ∀ {x y ε : ℝ}, 0 < ε → ε ≤ 1 → |x| < ε → |y| < ε → |x * y| < ε := + sorry section - variable (a b δ : ℝ) - variable (h₀ : 0 < δ) (h₁ : δ ≤ 1) - variable (ha : |a| < δ) (hb : |b| < δ) + variable (a b δ : ℝ) + variable (h₀ : 0 < δ) (h₁ : δ ≤ 1) + variable (ha : |a| < δ) (hb : |b| < δ) - #check my_lemma2 h₀ h₁ ha hb + #check my_lemma2 h₀ h₁ ha hb end </pre></div>
- @@ -177,10 +177,10 @@ you are left with new goals that require you to prove
 each of the hypotheses. To prove a statement like this, use the <code class="docutils literal notranslate">intro</code> tactic. Take a look at what it does in this example: - <div class="highlight-lean notranslate"><div class="highlight"><pre>theorem my_lemma3 : - ∀ {x y ε : ℝ}, 0 < ε → ε ≤ 1 → |x| < ε → |y| < ε → |x * y| < ε := by - intro x y ε epos ele1 xlt ylt - sorry + <div class="highlight-lean notranslate"><div class="highlight"><pre>theorem my_lemma3 : + ∀ {x y ε : ℝ}, 0 < ε → ε ≤ 1 → |x| < ε → |y| < ε → |x * y| < ε := by + intro x y ε epos ele1 xlt ylt + sorry </pre></div> </div> We can use any names we want for the universally quantified variables;
- @@ -198,14 +198,14 @@ as we did in the last section.
 In a moment, we will see why it is sometimes necessary to introduce variables and hypotheses after the proof begins. To help you prove the lemma, we will start you off: - <div class="highlight-lean notranslate"><div class="highlight"><pre>theorem my_lemma4 : - ∀ {x y ε : ℝ}, 0 < ε → ε ≤ 1 → |x| < ε → |y| < ε → |x * y| < ε := by - intro x y ε epos ele1 xlt ylt - calc - |x * y| = |x| * |y| := sorry - _ ≤ |x| * ε := sorry - _ < 1 * ε := sorry - _ = ε := sorry + <div class="highlight-lean notranslate"><div class="highlight"><pre>theorem my_lemma4 : + ∀ {x y ε : ℝ}, 0 < ε → ε ≤ 1 → |x| < ε → |y| < ε → |x * y| < ε := by + intro x y ε epos ele1 xlt ylt + calc + |x * y| = |x| * |y| := sorry + _ ≤ |x| * ε := sorry + _ < 1 * ε := sorry + _ = ε := sorry </pre></div> </div> Finish the proof using the theorems
- @@ -226,22 +226,22 @@ The first says that <code class="docutils literal notranslate">f</code>, and the second says that <code class="docutils literal notranslate">a</code> is a lower bound on the values of <code class="docutils literal notranslate">f</code>. - <div class="highlight-lean notranslate"><div class="highlight"><pre>def FnUb (f : ℝ → ℝ) (a : ℝ) : Prop := - ∀ x, f x ≤ a + <div class="highlight-lean notranslate"><div class="highlight"><pre>def FnUb (f : ℝ → ℝ) (a : ℝ) : Prop := + ∀ x, f x ≤ a - def FnLb (f : ℝ → ℝ) (a : ℝ) : Prop := - ∀ x, a ≤ f x + def FnLb (f : ℝ → ℝ) (a : ℝ) : Prop := + ∀ x, a ≤ f x </pre></div> </div> In the next example, <code class="docutils literal notranslate">fun x ↦ f x + g x</code> is the function that maps <code class="docutils literal notranslate">x</code> to <code class="docutils literal notranslate">f x + g x</code>. Going from the expression <code class="docutils literal notranslate">f x + g x</code> to this function is called a lambda abstraction in type theory. - <div class="highlight-lean notranslate"><div class="highlight"><pre>example (hfa : FnUb f a) (hgb : FnUb g b) : FnUb (fun x ↦ f x + g x) (a + b) := by - intro x - dsimp - apply add_le_add - apply hfa - apply hgb + <div class="highlight-lean notranslate"><div class="highlight"><pre>example (hfa : FnUb f a) (hgb : FnUb g b) : FnUb (fun x ↦ f x + g x) (a + b) := by + intro x + dsimp + apply add_le_add + apply hfa + apply hgb </pre></div> </div> Applying <code class="docutils literal notranslate">intro</code> to the goal <code class="docutils literal notranslate">FnUb (fun x ↦ f x + g x) (a + b)</code>
- @@ -264,15 +264,15 @@ and gives you more control over how the goal is transformed.
 The last two <code class="docutils literal notranslate">apply</code> commands force Lean to unfold the definitions of <code class="docutils literal notranslate">FnUb</code> in the hypotheses. Try carrying out similar proofs of these: - <div class="highlight-lean notranslate"><div class="highlight"><pre>example (hfa : FnLb f a) (hgb : FnLb g b) : FnLb (fun x ↦ f x + g x) (a + b) := - sorry + <div class="highlight-lean notranslate"><div class="highlight"><pre>example (hfa : FnLb f a) (hgb : FnLb g b) : FnLb (fun x ↦ f x + g x) (a + b) := + sorry - example (nnf : FnLb f 0) (nng : FnLb g 0) : FnLb (fun x ↦ f x * g x) 0 := - sorry + example (nnf : FnLb f 0) (nng : FnLb g 0) : FnLb (fun x ↦ f x * g x) 0 := + sorry - example (hfa : FnUb f a) (hgb : FnUb g b) (nng : FnLb g 0) (nna : 0 ≤ a) : - FnUb (fun x ↦ f x * g x) (a * b) := - sorry + example (hfa : FnUb f a) (hgb : FnUb g b) (nng : FnLb g 0) (nna : 0 ≤ a) : + FnUb (fun x ↦ f x * g x) (a * b) := + sorry </pre></div> </div> Even though we have defined <code class="docutils literal notranslate">FnUb</code> and <code class="docutils literal notranslate">FnLb</code> for functions
- @@ -288,15 +288,15 @@ but it is worth knowing that the natural numbers, integers, rationals,
 and real numbers are all instances. So if we prove the theorem <code class="docutils literal notranslate">fnUb_add</code> at that level of generality, it will apply in all these instances. - <div class="highlight-lean notranslate"><div class="highlight"><pre>variable {α : Type*} {R : Type*} [OrderedCancelAddCommMonoid R] + <div class="highlight-lean notranslate"><div class="highlight"><pre>variable {α : Type*} {R : Type*} [OrderedCancelAddCommMonoid R] - #check add_le_add + #check add_le_add - def FnUb' (f : α → R) (a : R) : Prop := - ∀ x, f x ≤ a + def FnUb' (f : α → R) (a : R) : Prop := + ∀ x, f x ≤ a - theorem fnUb_add {f g : α → R} {a b : R} (hfa : FnUb' f a) (hgb : FnUb' g b) : - FnUb' (fun x ↦ f x + g x) (a + b) := fun x ↦ add_le_add (hfa x) (hgb x) + theorem fnUb_add {f g : α → R} {a b : R} (hfa : FnUb' f a) (hgb : FnUb' g b) : + FnUb' (fun x ↦ f x + g x) (a + b) := fun x ↦ add_le_add (hfa x) (hgb x) </pre></div> </div> You have already seen square brackets like these in
- @@ -309,8 +309,8 @@ that work at a high level of generality.
 For another example of a hidden universal quantifier, Mathlib defines a predicate <code class="docutils literal notranslate">Monotone</code>, which says that a function is nondecreasing in its arguments: - <div class="highlight-lean notranslate"><div class="highlight"><pre>example (f : ℝ → ℝ) (h : Monotone f) : ∀ {a b}, a ≤ b → f a ≤ f b := - @h + <div class="highlight-lean notranslate"><div class="highlight"><pre>example (f : ℝ → ℝ) (h : Monotone f) : ∀ {a b}, a ≤ b → f a ≤ f b := + @h </pre></div> </div> The property <code class="docutils literal notranslate">Monotone f</code> is defined to be exactly the expression
- @@ -326,11 +326,11 @@ and then apply the resulting expression to the goal.
 Or you can apply it to the goal and let Lean help you work backwards by displaying the remaining hypotheses as new subgoals. - <div class="highlight-lean notranslate"><div class="highlight"><pre>example (mf : Monotone f) (mg : Monotone g) : Monotone fun x ↦ f x + g x := by - intro a b aleb - apply add_le_add - apply mf aleb - apply mg aleb + <div class="highlight-lean notranslate"><div class="highlight"><pre>example (mf : Monotone f) (mg : Monotone g) : Monotone fun x ↦ f x + g x := by + intro a b aleb + apply add_le_add + apply mf aleb + apply mg aleb </pre></div> </div> When a proof is this short, it is often convenient
- @@ -346,8 +346,8 @@ So the <code class="docutils literal notranslate">intro
 corresponds to the lambda abstraction in the next proof term. The <code class="docutils literal notranslate">apply</code> commands then correspond to building the application of the theorem to its arguments. - <div class="highlight-lean notranslate"><div class="highlight"><pre>example (mf : Monotone f) (mg : Monotone g) : Monotone fun x ↦ f x + g x := - fun a b aleb ↦ add_le_add (mf aleb) (mg aleb) + <div class="highlight-lean notranslate"><div class="highlight"><pre>example (mf : Monotone f) (mg : Monotone g) : Monotone fun x ↦ f x + g x := + fun a b aleb ↦ add_le_add (mf aleb) (mg aleb) </pre></div> </div> Here is a useful trick: if you start writing
- @@ -361,11 +361,11 @@ hover over the squiggly error marker,
 Lean will show you the goal that the remaining expression has to solve. Try proving these, with either tactics or proof terms: - <div class="highlight-lean notranslate"><div class="highlight"><pre>example {c : ℝ} (mf : Monotone f) (nnc : 0 ≤ c) : Monotone fun x ↦ c * f x := - sorry + <div class="highlight-lean notranslate"><div class="highlight"><pre>example {c : ℝ} (mf : Monotone f) (nnc : 0 ≤ c) : Monotone fun x ↦ c * f x := + sorry - example (mf : Monotone f) (mg : Monotone g) : Monotone fun x ↦ f (g x) := - sorry + example (mf : Monotone f) (mg : Monotone g) : Monotone fun x ↦ f (g x) := + sorry </pre></div> </div> Here are some more examples.
- @@ -376,27 +376,27 @@ and odd if $f(-x) = -f(x)$
 The following example defines these two notions formally and establishes one fact about them. You can complete the proofs of the others. - <div class="highlight-lean notranslate"><div class="highlight"><pre>def FnEven (f : ℝ → ℝ) : Prop := - ∀ x, f x = f (-x) + <div class="highlight-lean notranslate"><div class="highlight"><pre>def FnEven (f : ℝ → ℝ) : Prop := + ∀ x, f x = f (-x) - def FnOdd (f : ℝ → ℝ) : Prop := - ∀ x, f x = -f (-x) + def FnOdd (f : ℝ → ℝ) : Prop := + ∀ x, f x = -f (-x) - example (ef : FnEven f) (eg : FnEven g) : FnEven fun x ↦ f x + g x := by - intro x - calc - (fun x ↦ f x + g x) x = f x + g x := rfl - _ = f (-x) + g (-x) := by rw [ef, eg] + example (ef : FnEven f) (eg : FnEven g) : FnEven fun x ↦ f x + g x := by + intro x + calc + (fun x ↦ f x + g x) x = f x + g x := rfl + _ = f (-x) + g (-x) := by rw [ef, eg] - example (of : FnOdd f) (og : FnOdd g) : FnEven fun x ↦ f x * g x := by - sorry + example (of : FnOdd f) (og : FnOdd g) : FnEven fun x ↦ f x * g x := by + sorry - example (ef : FnEven f) (og : FnOdd g) : FnOdd fun x ↦ f x * g x := by - sorry + example (ef : FnEven f) (og : FnOdd g) : FnOdd fun x ↦ f x * g x := by + sorry - example (ef : FnEven f) (og : FnOdd g) : FnEven fun x ↦ f (g x) := by - sorry + example (ef : FnEven f) (og : FnOdd g) : FnEven fun x ↦ f (g x) := by + sorry </pre></div> </div> The first proof can be shortened using <code class="docutils literal notranslate">dsimp</code> or <code class="docutils literal notranslate">change</code>
- @@ -436,16 +436,16 @@ we can write <code class="docutils literal notranslate">h</spa
 The following example provides a tactic proof and a proof term justifying the reflexivity of the subset relation, and asks you to do the same for transitivity. - <div class="highlight-lean notranslate"><div class="highlight"><pre>variable {α : Type*} (r s t : Set α) + <div class="highlight-lean notranslate"><div class="highlight"><pre>variable {α : Type*} (r s t : Set α) - example : s ⊆ s := by - intro x xs - exact xs + example : s ⊆ s := by + intro x xs + exact xs - theorem Subset.refl : s ⊆ s := fun x xs ↦ xs + theorem Subset.refl : s ⊆ s := fun x xs ↦ xs - theorem Subset.trans : r ⊆ s → s ⊆ t → r ⊆ t := by - sorry + theorem Subset.trans : r ⊆ s → s ⊆ t → r ⊆ t := by + sorry </pre></div> </div> Just as we defined <code class="docutils literal notranslate">FnUb</code> for functions,
- @@ -456,14 +456,14 @@ has an order associated with it.
 In the next example, we ask you to prove that if <code class="docutils literal notranslate">a</code> is a bound on <code class="docutils literal notranslate">s</code> and <code class="docutils literal notranslate">a ≤ b</code>, then <code class="docutils literal notranslate">b</code> is a bound on <code class="docutils literal notranslate">s</code> as well. - <div class="highlight-lean notranslate"><div class="highlight"><pre>variable {α : Type*} [PartialOrder α] - variable (s : Set α) (a b : α) + <div class="highlight-lean notranslate"><div class="highlight"><pre>variable {α : Type*} [PartialOrder α] + variable (s : Set α) (a b : α) - def SetUb (s : Set α) (a : α) := - ∀ x, x ∈ s → x ≤ a + def SetUb (s : Set α) (a : α) := + ∀ x, x ∈ s → x ≤ a - example (h : SetUb s a) (h' : a ≤ b) : SetUb s b := - sorry + example (h : SetUb s a) (h' : a ≤ b) : SetUb s b := + sorry </pre></div> </div> We close this section with one last important example.
- @@ -478,22 +478,22 @@ We then ask you to show that multiplication by a nonzero
 constant is also injective, using the lemma name in the example as a source of inspiration. Recall you should use Ctrl-space completion after guessing the beginning of a lemma name. - <div class="highlight-lean notranslate"><div class="highlight"><pre>open Function + <div class="highlight-lean notranslate"><div class="highlight"><pre>open Function - example (c : ℝ) : Injective fun x ↦ x + c := by - intro x₁ x₂ h' - exact (add_left_inj c).mp h' + example (c : ℝ) : Injective fun x ↦ x + c := by + intro x₁ x₂ h' + exact (add_left_inj c).mp h' - example {c : ℝ} (h : c ≠ 0) : Injective fun x ↦ c * x := by - sorry + example {c : ℝ} (h : c ≠ 0) : Injective fun x ↦ c * x := by + sorry </pre></div> </div> Finally, show that the composition of two injective functions is injective: - <div class="highlight-lean notranslate"><div class="highlight"><pre>variable {α : Type*} {β : Type*} {γ : Type*} - variable {g : β → γ} {f : α → β} + <div class="highlight-lean notranslate"><div class="highlight"><pre>variable {α : Type*} {β : Type*} {γ : Type*} + variable {g : β → γ} {f : α → β} - example (injg : Injective g) (injf : Injective f) : Injective fun x ↦ g (f x) := by - sorry + example (injg : Injective g) (injf : Injective f) : Injective fun x ↦ g (f x) := by + sorry </pre></div> </div> </section>
- @@ -514,29 +514,29 @@ and the <code class="docutils literal notranslate">norm_num</s
 Given a goal that begins with an existential quantifier, the <code class="docutils literal notranslate">use</code> tactic is used to provide the object, leaving the goal of proving the property. - <div class="highlight-lean notranslate"><div class="highlight"><pre>example : ∃ x : ℝ, 2 < x ∧ x < 3 := by - use 5 / 2 - norm_num + <div class="highlight-lean notranslate"><div class="highlight"><pre>example : ∃ x : ℝ, 2 < x ∧ x < 3 := by + use 5 / 2 + norm_num </pre></div> </div> You can give the <code class="docutils literal notranslate">use</code> tactic proofs as well as data: - <div class="highlight-lean notranslate"><div class="highlight"><pre>example : ∃ x : ℝ, 2 < x ∧ x < 3 := by - have h1 : 2 < (5 : ℝ) / 2 := by norm_num - have h2 : (5 : ℝ) / 2 < 3 := by norm_num - use 5 / 2, h1, h2 + <div class="highlight-lean notranslate"><div class="highlight"><pre>example : ∃ x : ℝ, 2 < x ∧ x < 3 := by + have h1 : 2 < (5 : ℝ) / 2 := by norm_num + have h2 : (5 : ℝ) / 2 < 3 := by norm_num + use 5 / 2, h1, h2 </pre></div> </div> In fact, the <code class="docutils literal notranslate">use</code> tactic automatically tries to use available assumptions as well. - <div class="highlight-lean notranslate"><div class="highlight"><pre>example : ∃ x : ℝ, 2 < x ∧ x < 3 := by - have h : 2 < (5 : ℝ) / 2 ∧ (5 : ℝ) / 2 < 3 := by norm_num - use 5 / 2 + <div class="highlight-lean notranslate"><div class="highlight"><pre>example : ∃ x : ℝ, 2 < x ∧ x < 3 := by + have h : 2 < (5 : ℝ) / 2 ∧ (5 : ℝ) / 2 < 3 := by norm_num + use 5 / 2 </pre></div> </div> Alternatively, we can use Lean’s anonymous constructor notation to construct a proof of an existential quantifier. - <div class="highlight-lean notranslate"><div class="highlight"><pre>example : ∃ x : ℝ, 2 < x ∧ x < 3 := - have h : 2 < (5 : ℝ) / 2 ∧ (5 : ℝ) / 2 < 3 := by norm_num - ⟨5 / 2, h⟩ + <div class="highlight-lean notranslate"><div class="highlight"><pre>example : ∃ x : ℝ, 2 < x ∧ x < 3 := + have h : 2 < (5 : ℝ) / 2 ∧ (5 : ℝ) / 2 < 3 := by norm_num + ⟨5 / 2, h⟩ </pre></div> </div> Notice that there is no <code class="docutils literal notranslate">by</code>; here we are giving an explicit proof term.
- @@ -546,8 +546,8 @@ tell Lean to put together the given data using
 whatever construction is appropriate for the current goal. We can use the notation without going first into tactic mode: - <div class="highlight-lean notranslate"><div class="highlight"><pre>example : ∃ x : ℝ, 2 < x ∧ x < 3 := - ⟨5 / 2, by norm_num⟩ + <div class="highlight-lean notranslate"><div class="highlight"><pre>example : ∃ x : ℝ, 2 < x ∧ x < 3 := + ⟨5 / 2, by norm_num⟩ </pre></div> </div> So now we know how to prove an exists statement.
- @@ -561,29 +561,29 @@ which say that <code class="docutils literal notranslate">a</s
 respectively. We can use the existential quantifier to say that “<code class="docutils literal notranslate">f</code> is bounded” without specifying the bound: - <div class="highlight-lean notranslate"><div class="highlight"><pre>def FnUb (f : ℝ → ℝ) (a : ℝ) : Prop := - ∀ x, f x ≤ a + <div class="highlight-lean notranslate"><div class="highlight"><pre>def FnUb (f : ℝ → ℝ) (a : ℝ) : Prop := + ∀ x, f x ≤ a - def FnLb (f : ℝ → ℝ) (a : ℝ) : Prop := - ∀ x, a ≤ f x + def FnLb (f : ℝ → ℝ) (a : ℝ) : Prop := + ∀ x, a ≤ f x - def FnHasUb (f : ℝ → ℝ) := - ∃ a, FnUb f a + def FnHasUb (f : ℝ → ℝ) := + ∃ a, FnUb f a - def FnHasLb (f : ℝ → ℝ) := - ∃ a, FnLb f a + def FnHasLb (f : ℝ → ℝ) := + ∃ a, FnLb f a </pre></div> </div> We can use the theorem <code class="docutils literal notranslate">FnUb_add</code> from the last section to prove that if <code class="docutils literal notranslate">f</code> and <code class="docutils literal notranslate">g</code> have upper bounds, then so does <code class="docutils literal notranslate">fun x ↦ f x + g x</code>. - <div class="highlight-lean notranslate"><div class="highlight"><pre>variable {f g : ℝ → ℝ} + <div class="highlight-lean notranslate"><div class="highlight"><pre>variable {f g : ℝ → ℝ} - example (ubf : FnHasUb f) (ubg : FnHasUb g) : FnHasUb fun x ↦ f x + g x := by - rcases ubf with ⟨a, ubfa⟩ - rcases ubg with ⟨b, ubgb⟩ - use a + b - apply fnUb_add ubfa ubgb + example (ubf : FnHasUb f) (ubg : FnHasUb g) : FnHasUb fun x ↦ f x + g x := by + rcases ubf with ⟨a, ubfa⟩ + rcases ubg with ⟨b, ubgb⟩ + use a + b + apply fnUb_add ubfa ubgb </pre></div> </div> The <code class="docutils literal notranslate">rcases</code> tactic unpacks the information
- @@ -611,35 +611,35 @@ from the last section into named theorems,
 as we did with <code class="docutils literal notranslate">fn_ub_add</code>, or you can insert the arguments directly into the proofs. - <div class="highlight-lean notranslate"><div class="highlight"><pre>example (lbf : FnHasLb f) (lbg : FnHasLb g) : FnHasLb fun x ↦ f x + g x := by - sorry + <div class="highlight-lean notranslate"><div class="highlight"><pre>example (lbf : FnHasLb f) (lbg : FnHasLb g) : FnHasLb fun x ↦ f x + g x := by + sorry - example {c : ℝ} (ubf : FnHasUb f) (h : c ≥ 0) : FnHasUb fun x ↦ c * f x := by - sorry + example {c : ℝ} (ubf : FnHasUb f) (h : c ≥ 0) : FnHasUb fun x ↦ c * f x := by + sorry </pre></div> </div> The “r” in <code class="docutils literal notranslate">rcases</code> stands for “recursive,” because it allows us to use arbitrarily complex patterns to unpack nested data. The <code class="docutils literal notranslate">rintro</code> tactic is a combination of <code class="docutils literal notranslate">intro</code> and <code class="docutils literal notranslate">rcases</code>: - <div class="highlight-lean notranslate"><div class="highlight"><pre>example : FnHasUb f → FnHasUb g → FnHasUb fun x ↦ f x + g x := by - rintro ⟨a, ubfa⟩ ⟨b, ubgb⟩ - exact ⟨a + b, fnUb_add ubfa ubgb⟩ + <div class="highlight-lean notranslate"><div class="highlight"><pre>example : FnHasUb f → FnHasUb g → FnHasUb fun x ↦ f x + g x := by + rintro ⟨a, ubfa⟩ ⟨b, ubgb⟩ + exact ⟨a + b, fnUb_add ubfa ubgb⟩ </pre></div> </div> In fact, Lean also supports a pattern-matching fun in expressions and proof terms: - <div class="highlight-lean notranslate"><div class="highlight"><pre>example : FnHasUb f → FnHasUb g → FnHasUb fun x ↦ f x + g x := - fun ⟨a, ubfa⟩ ⟨b, ubgb⟩ ↦ ⟨a + b, fnUb_add ubfa ubgb⟩ + <div class="highlight-lean notranslate"><div class="highlight"><pre>example : FnHasUb f → FnHasUb g → FnHasUb fun x ↦ f x + g x := + fun ⟨a, ubfa⟩ ⟨b, ubgb⟩ ↦ ⟨a + b, fnUb_add ubfa ubgb⟩ </pre></div> </div> The task of unpacking information in a hypothesis is so important that Lean and Mathlib provide a number of ways to do it. For example, the <code class="docutils literal notranslate">obtain</code> tactic provides suggestive syntax: - <div class="highlight-lean notranslate"><div class="highlight"><pre>example (ubf : FnHasUb f) (ubg : FnHasUb g) : FnHasUb fun x ↦ f x + g x := by - obtain ⟨a, ubfa⟩ := ubf - obtain ⟨b, ubgb⟩ := ubg - exact ⟨a + b, fnUb_add ubfa ubgb⟩ + <div class="highlight-lean notranslate"><div class="highlight"><pre>example (ubf : FnHasUb f) (ubg : FnHasUb g) : FnHasUb fun x ↦ f x + g x := by + obtain ⟨a, ubfa⟩ := ubf + obtain ⟨b, ubgb⟩ := ubg + exact ⟨a + b, fnUb_add ubfa ubgb⟩ </pre></div> </div> Think of the first <code class="docutils literal notranslate">obtain</code> instruction as matching the “contents” of <code class="docutils literal notranslate">ubf</code>
- @@ -649,29 +649,29 @@ there is a small difference in that <code class="docutils literal notranslate"><
 when it is done, whereas it is still present after <code class="docutils literal notranslate">obtain</code>. Lean also supports syntax that is similar to that used in other functional programming languages: - <div class="highlight-lean notranslate"><div class="highlight"><pre>example (ubf : FnHasUb f) (ubg : FnHasUb g) : FnHasUb fun x ↦ f x + g x := by - cases ubf - case intro a ubfa => - cases ubg - case intro b ubgb => - exact ⟨a + b, fnUb_add ubfa ubgb⟩ - - example (ubf : FnHasUb f) (ubg : FnHasUb g) : FnHasUb fun x ↦ f x + g x := by - cases ubf - next a ubfa => - cases ubg - next b ubgb => - exact ⟨a + b, fnUb_add ubfa ubgb⟩ - - example (ubf : FnHasUb f) (ubg : FnHasUb g) : FnHasUb fun x ↦ f x + g x := by - match ubf, ubg with - | ⟨a, ubfa⟩, ⟨b, ubgb⟩ => - exact ⟨a + b, fnUb_add ubfa ubgb⟩ - - example (ubf : FnHasUb f) (ubg : FnHasUb g) : FnHasUb fun x ↦ f x + g x := - match ubf, ubg with - | ⟨a, ubfa⟩, ⟨b, ubgb⟩ => - ⟨a + b, fnUb_add ubfa ubgb⟩ + <div class="highlight-lean notranslate"><div class="highlight"><pre>example (ubf : FnHasUb f) (ubg : FnHasUb g) : FnHasUb fun x ↦ f x + g x := by + cases ubf + case intro a ubfa => + cases ubg + case intro b ubgb => + exact ⟨a + b, fnUb_add ubfa ubgb⟩ + + example (ubf : FnHasUb f) (ubg : FnHasUb g) : FnHasUb fun x ↦ f x + g x := by + cases ubf + next a ubfa => + cases ubg + next b ubgb => + exact ⟨a + b, fnUb_add ubfa ubgb⟩ + + example (ubf : FnHasUb f) (ubg : FnHasUb g) : FnHasUb fun x ↦ f x + g x := by + match ubf, ubg with + | ⟨a, ubfa⟩, ⟨b, ubgb⟩ => + exact ⟨a + b, fnUb_add ubfa ubgb⟩ + + example (ubf : FnHasUb f) (ubg : FnHasUb g) : FnHasUb fun x ↦ f x + g x := + match ubf, ubg with + | ⟨a, ubfa⟩, ⟨b, ubgb⟩ => + ⟨a + b, fnUb_add ubfa ubgb⟩ </pre></div> </div> In the first example, if you put your cursor after <code class="docutils literal notranslate">cases ubf</code>,
- @@ -701,18 +701,18 @@ quantifiers at once.
 We then provide the magic values needed to express <code class="docutils literal notranslate">x * y</code> as a sum of squares as a list to the <code class="docutils literal notranslate">use</code> statement, and we use <code class="docutils literal notranslate">ring</code> to verify that they work. - <div class="highlight-lean notranslate"><div class="highlight"><pre>variable {α : Type*} [CommRing α] + <div class="highlight-lean notranslate"><div class="highlight"><pre>variable {α : Type*} [CommRing α] - def SumOfSquares (x : α) := - ∃ a b, x = a ^ 2 + b ^ 2 + def SumOfSquares (x : α) := + ∃ a b, x = a ^ 2 + b ^ 2 - theorem sumOfSquares_mul {x y : α} (sosx : SumOfSquares x) (sosy : SumOfSquares y) : - SumOfSquares (x * y) := by - rcases sosx with ⟨a, b, xeq⟩ - rcases sosy with ⟨c, d, yeq⟩ - rw [xeq, yeq] - use a * c - b * d, a * d + b * c - ring + theorem sumOfSquares_mul {x y : α} (sosx : SumOfSquares x) (sosy : SumOfSquares y) : + SumOfSquares (x * y) := by + rcases sosx with ⟨a, b, xeq⟩ + rcases sosy with ⟨c, d, yeq⟩ + rw [xeq, yeq] + use a * c - b * d, a * d + b * c + ring </pre></div> </div> This proof doesn’t provide much insight,
- @@ -742,23 +742,23 @@ an abbreviation:
 if you use the keyword <code class="docutils literal notranslate">rfl</code> in place of a new identifier, <code class="docutils literal notranslate">rcases</code> does the rewriting automatically (this trick doesn’t work with pattern-matching lambdas). - <div class="highlight-lean notranslate"><div class="highlight"><pre>theorem sumOfSquares_mul' {x y : α} (sosx : SumOfSquares x) (sosy : SumOfSquares y) : - SumOfSquares (x * y) := by - rcases sosx with ⟨a, b, rfl⟩ - rcases sosy with ⟨c, d, rfl⟩ - use a * c - b * d, a * d + b * c - ring + <div class="highlight-lean notranslate"><div class="highlight"><pre>theorem sumOfSquares_mul' {x y : α} (sosx : SumOfSquares x) (sosy : SumOfSquares y) : + SumOfSquares (x * y) := by + rcases sosx with ⟨a, b, rfl⟩ + rcases sosy with ⟨c, d, rfl⟩ + use a * c - b * d, a * d + b * c + ring </pre></div> </div> As with the universal quantifier, you can find existential quantifiers hidden all over if you know how to spot them. For example, divisibility is implicitly an “exists” statement. - <div class="highlight-lean notranslate"><div class="highlight"><pre>example (divab : a ∣ b) (divbc : b ∣ c) : a ∣ c := by - rcases divab with ⟨d, beq⟩ - rcases divbc with ⟨e, ceq⟩ - rw [ceq, beq] - use d * e; ring + <div class="highlight-lean notranslate"><div class="highlight"><pre>example (divab : a ∣ b) (divbc : b ∣ c) : a ∣ c := by + rcases divab with ⟨d, beq⟩ + rcases divbc with ⟨e, ceq⟩ + rw [ceq, beq] + use d * e; ring </pre></div> </div> And once again, this provides a nice setting for using
- @@ -766,8 +766,8 @@ For example, divisibility is implicitly an “exists” statement.
 Try it out in the proof above. It feels pretty good! Then try proving the following: - <div class="highlight-lean notranslate"><div class="highlight"><pre>example (divab : a ∣ b) (divac : a ∣ c) : a ∣ b + c := by - sorry + <div class="highlight-lean notranslate"><div class="highlight"><pre>example (divab : a ∣ b) (divac : a ∣ c) : a ∣ b + c := by + sorry </pre></div> </div> For another important example, a function $f : \alpha \to \beta$
- @@ -778,43 +778,43 @@ such that $f(x) = y$.
 Notice that this statement includes both a universal and an existential quantifier, which explains why the next example makes use of both <code class="docutils literal notranslate">intro</code> and <code class="docutils literal notranslate">use</code>. - <div class="highlight-lean notranslate"><div class="highlight"><pre>example {c : ℝ} : Surjective fun x ↦ x + c := by - intro x - use x - c - dsimp; ring + <div class="highlight-lean notranslate"><div class="highlight"><pre>example {c : ℝ} : Surjective fun x ↦ x + c := by + intro x + use x - c + dsimp; ring </pre></div> </div> Try this example yourself using the theorem <code class="docutils literal notranslate">mul_div_cancel₀</code>.: - <div class="highlight-lean notranslate"><div class="highlight"><pre>example {c : ℝ} (h : c ≠ 0) : Surjective fun x ↦ c * x := by - sorry + <div class="highlight-lean notranslate"><div class="highlight"><pre>example {c : ℝ} (h : c ≠ 0) : Surjective fun x ↦ c * x := by + sorry </pre></div> </div> At this point, it is worth mentioning that there is a tactic, <code class="docutils literal notranslate">field_simp</code>, that will often clear denominators in a useful way. It can be used in conjunction with the <code class="docutils literal notranslate">ring</code> tactic. - <div class="highlight-lean notranslate"><div class="highlight"><pre>example (x y : ℝ) (h : x - y ≠ 0) : (x ^ 2 - y ^ 2) / (x - y) = x + y := by - field_simp [h] - ring + <div class="highlight-lean notranslate"><div class="highlight"><pre>example (x y : ℝ) (h : x - y ≠ 0) : (x ^ 2 - y ^ 2) / (x - y) = x + y := by + field_simp [h] + ring </pre></div> </div> The next example uses a surjectivity hypothesis by applying it to a suitable value. Note that you can use <code class="docutils literal notranslate">rcases</code> with any expression, not just a hypothesis. - <div class="highlight-lean notranslate"><div class="highlight"><pre>example {f : ℝ → ℝ} (h : Surjective f) : ∃ x, f x ^ 2 = 4 := by - rcases h 2 with ⟨x, hx⟩ - use x - rw [hx] - norm_num + <div class="highlight-lean notranslate"><div class="highlight"><pre>example {f : ℝ → ℝ} (h : Surjective f) : ∃ x, f x ^ 2 = 4 := by + rcases h 2 with ⟨x, hx⟩ + use x + rw [hx] + norm_num </pre></div> </div> See if you can use these methods to show that the composition of surjective functions is surjective. - <div class="highlight-lean notranslate"><div class="highlight"><pre>variable {α : Type*} {β : Type*} {γ : Type*} - variable {g : β → γ} {f : α → β} + <div class="highlight-lean notranslate"><div class="highlight"><pre>variable {α : Type*} {β : Type*} {γ : Type*} + variable {g : β → γ} {f : α → β} - example (surjg : Surjective g) (surjf : Surjective f) : Surjective fun x ↦ g (f x) := by - sorry + example (surjg : Surjective g) (surjf : Surjective f) : Surjective fun x ↦ g (f x) := by + sorry </pre></div> </div> </section>
- @@ -840,10 +840,10 @@ which says that we have <code class="docutils literal notranslate">lt_asymm</code> says that we have <code class="docutils literal notranslate">a < b → ¬ b < a</code>. Let’s show that <code class="docutils literal notranslate">lt_asymm</code> follows from <code class="docutils literal notranslate">lt_irrefl</code>. - <div class="highlight-lean notranslate"><div class="highlight"><pre>example (h : a < b) : ¬b < a := by - intro h' - have : a < a := lt_trans h h' - apply lt_irrefl a this + <div class="highlight-lean notranslate"><div class="highlight"><pre>example (h : a < b) : ¬b < a := by + intro h' + have : a < a := lt_trans h h' + apply lt_irrefl a this </pre></div> </div> This example introduces a couple of new tricks.
- @@ -860,41 +860,41 @@ by applying <code class="docutils literal notranslate">lt_irre
 Here is another example, which uses the predicate <code class="docutils literal notranslate">FnHasUb</code> defined in the last section, which says that a function has an upper bound. - <div class="highlight-lean notranslate"><div class="highlight"><pre>example (h : ∀ a, ∃ x, f x > a) : ¬FnHasUb f := by - intro fnub - rcases fnub with ⟨a, fnuba⟩ - rcases h a with ⟨x, hx⟩ - have : f x ≤ a := fnuba x - linarith + <div class="highlight-lean notranslate"><div class="highlight"><pre>example (h : ∀ a, ∃ x, f x > a) : ¬FnHasUb f := by + intro fnub + rcases fnub with ⟨a, fnuba⟩ + rcases h a with ⟨x, hx⟩ + have : f x ≤ a := fnuba x + linarith </pre></div> </div> Remember that it is often convenient to use <code class="docutils literal notranslate">linarith</code> when a goal follows from linear equations and inequalities that are in the context. See if you can prove these in a similar way: - <div class="highlight-lean notranslate"><div class="highlight"><pre>example (h : ∀ a, ∃ x, f x < a) : ¬FnHasLb f := - sorry + <div class="highlight-lean notranslate"><div class="highlight"><pre>example (h : ∀ a, ∃ x, f x < a) : ¬FnHasLb f := + sorry - example : ¬FnHasUb fun x ↦ x := - sorry + example : ¬FnHasUb fun x ↦ x := + sorry </pre></div> </div> Mathlib offers a number of useful theorems for relating orders and negations: - <div class="highlight-lean notranslate"><div class="highlight"><pre>#check (not_le_of_gt : a > b → ¬a ≤ b) - #check (not_lt_of_ge : a ≥ b → ¬a < b) - #check (lt_of_not_ge : ¬a ≥ b → a < b) - #check (le_of_not_gt : ¬a > b → a ≤ b) + <div class="highlight-lean notranslate"><div class="highlight"><pre>#check (not_le_of_gt : a > b → ¬a ≤ b) + #check (not_lt_of_ge : a ≥ b → ¬a < b) + #check (lt_of_not_ge : ¬a ≥ b → a < b) + #check (le_of_not_gt : ¬a > b → a ≤ b) </pre></div> </div> Recall the predicate <code class="docutils literal notranslate">Monotone f</code>, which says that <code class="docutils literal notranslate">f</code> is nondecreasing. Use some of the theorems just enumerated to prove the following: - <div class="highlight-lean notranslate"><div class="highlight"><pre>example (h : Monotone f) (h' : f a < f b) : a < b := by - sorry + <div class="highlight-lean notranslate"><div class="highlight"><pre>example (h : Monotone f) (h' : f a < f b) : a < b := by + sorry - example (h : a ≤ b) (h' : f b < f a) : ¬Monotone f := by - sorry + example (h : a ≤ b) (h' : f b < f a) : ¬Monotone f := by + sorry </pre></div> </div> We can show that the first example in the last snippet
- @@ -902,12 +902,12 @@ cannot be proved if we replace <code class="docutils literal notranslate"> - <div class="highlight-lean notranslate"><div class="highlight"><pre>example : ¬∀ {f : ℝ → ℝ}, Monotone f → ∀ {a b}, f a ≤ f b → a ≤ b := by - intro h - let f := fun x : ℝ ↦ (0 : ℝ) - have monof : Monotone f := by sorry - have h' : f 1 ≤ f 0 := le_refl _ - sorry + <div class="highlight-lean notranslate"><div class="highlight"><pre>example : ¬∀ {f : ℝ → ℝ}, Monotone f → ∀ {a b}, f a ≤ f b → a ≤ b := by + intro h + let f := fun x : ℝ ↦ (0 : ℝ) + have monof : Monotone f := by sorry + have h' : f 1 ≤ f 0 := le_refl _ + sorry </pre></div> </div> This example introduces the <code class="docutils literal notranslate">let</code> tactic,
- @@ -919,8 +919,8 @@ Lean will unfold the definition of <code class="docutils literal notranslate"><s
 In particular, when we prove <code class="docutils literal notranslate">f 1 ≤ f 0</code> with <code class="docutils literal notranslate">le_refl</code>, Lean reduces <code class="docutils literal notranslate">f 1</code> and <code class="docutils literal notranslate">f 0</code> to <code class="docutils literal notranslate">0</code>. Use <code class="docutils literal notranslate">le_of_not_gt</code> to prove the following: - <div class="highlight-lean notranslate"><div class="highlight"><pre>example (x : ℝ) (h : ∀ ε > 0, x < ε) : x ≤ 0 := by - sorry + <div class="highlight-lean notranslate"><div class="highlight"><pre>example (x : ℝ) (h : ∀ ε > 0, x < ε) : x ≤ 0 := by + sorry </pre></div> </div> Implicit in many of the proofs we have just done
- @@ -933,19 +933,19 @@ is equivalent to saying that something fails to have property <code class="docut
 In other words, all four of the following implications are valid (but one of them cannot be proved with what we explained so far): - <div class="highlight-lean notranslate"><div class="highlight"><pre>variable {α : Type*} (P : α → Prop) (Q : Prop) + <div class="highlight-lean notranslate"><div class="highlight"><pre>variable {α : Type*} (P : α → Prop) (Q : Prop) - example (h : ¬∃ x, P x) : ∀ x, ¬P x := by - sorry + example (h : ¬∃ x, P x) : ∀ x, ¬P x := by + sorry - example (h : ∀ x, ¬P x) : ¬∃ x, P x := by - sorry + example (h : ∀ x, ¬P x) : ¬∃ x, P x := by + sorry - example (h : ¬∀ x, P x) : ∃ x, ¬P x := by - sorry + example (h : ¬∀ x, P x) : ∃ x, ¬P x := by + sorry - example (h : ∃ x, ¬P x) : ¬∀ x, P x := by - sorry + example (h : ∃ x, ¬P x) : ¬∀ x, P x := by + sorry </pre></div> </div> The first, second, and fourth are straightforward to
- @@ -957,13 +957,13 @@ from the fact that its nonexistence is contradictory.
 This is an instance of classical mathematical reasoning. We can use proof by contradiction to prove the third implication as follows. - <div class="highlight-lean notranslate"><div class="highlight"><pre>example (h : ¬∀ x, P x) : ∃ x, ¬P x := by - by_contra h' - apply h - intro x - show P x - by_contra h'' - exact h' ⟨x, h''⟩ + <div class="highlight-lean notranslate"><div class="highlight"><pre>example (h : ¬∀ x, P x) : ∃ x, ¬P x := by + by_contra h' + apply h + intro x + show P x + by_contra h'' + exact h' ⟨x, h''⟩ </pre></div> </div> Make sure you understand how this works.
- @@ -976,18 +976,18 @@ Confirm that you can prove the forward direction
 of this equivalence using <code class="docutils literal notranslate">by_contra</code>, while the reverse direction follows from the ordinary rules for negation. - <div class="highlight-lean notranslate"><div class="highlight"><pre>example (h : ¬¬Q) : Q := by - sorry + <div class="highlight-lean notranslate"><div class="highlight"><pre>example (h : ¬¬Q) : Q := by + sorry - example (h : Q) : ¬¬Q := by - sorry + example (h : Q) : ¬¬Q := by + sorry </pre></div> </div> Use proof by contradiction to establish the following, which is the converse of one of the implications we proved above. (Hint: use <code class="docutils literal notranslate">intro</code> first.) - <div class="highlight-lean notranslate"><div class="highlight"><pre>example (h : ¬FnHasUb f) : ∀ a, ∃ x, f x > a := by - sorry + <div class="highlight-lean notranslate"><div class="highlight"><pre>example (h : ¬FnHasUb f) : ∀ a, ∃ x, f x > a := by + sorry </pre></div> </div> It is often tedious to work with compound statements with
- @@ -998,14 +998,14 @@ has been pushed inward.
 To facilitate this, Mathlib offers a <code class="docutils literal notranslate">push_neg</code> tactic, which restates the goal in this way. The command <code class="docutils literal notranslate">push_neg at h</code> restates the hypothesis <code class="docutils literal notranslate">h</code>. - <div class="highlight-lean notranslate"><div class="highlight"><pre>example (h : ¬∀ a, ∃ x, f x > a) : FnHasUb f := by - push_neg at h - exact h + <div class="highlight-lean notranslate"><div class="highlight"><pre>example (h : ¬∀ a, ∃ x, f x > a) : FnHasUb f := by + push_neg at h + exact h - example (h : ¬FnHasUb f) : ∀ a, ∃ x, f x > a := by - dsimp only [FnHasUb, FnUb] at h - push_neg at h - exact h + example (h : ¬FnHasUb f) : ∀ a, ∃ x, f x > a := by + dsimp only [FnHasUb, FnUb] at h + push_neg at h + exact h </pre></div> </div> In the second example, we use dsimp to
- @@ -1020,8 +1020,8 @@ Without even knowing how to use the conjunction
 symbol, you should be able to use <code class="docutils literal notranslate">push_neg</code> to prove the following: - <div class="highlight-lean notranslate"><div class="highlight"><pre>example (h : ¬Monotone f) : ∃ x y, x ≤ y ∧ f y < f x := by - sorry + <div class="highlight-lean notranslate"><div class="highlight"><pre>example (h : ¬Monotone f) : ∃ x y, x ≤ y ∧ f y < f x := by + sorry </pre></div> </div> Mathlib also has a tactic, <code class="docutils literal notranslate">contrapose</code>,
- @@ -1033,14 +1033,14 @@ hypothesis <code class="docutils literal notranslate">h
 Using <code class="docutils literal notranslate">contrapose!</code> instead of <code class="docutils literal notranslate">contrapose</code> applies <code class="docutils literal notranslate">push_neg</code> to the goal and the relevant hypothesis as well. - <div class="highlight-lean notranslate"><div class="highlight"><pre>example (h : ¬FnHasUb f) : ∀ a, ∃ x, f x > a := by - contrapose! h - exact h + <div class="highlight-lean notranslate"><div class="highlight"><pre>example (h : ¬FnHasUb f) : ∀ a, ∃ x, f x > a := by + contrapose! h + exact h - example (x : ℝ) (h : ∀ ε > 0, x ≤ ε) : x ≤ 0 := by - contrapose! h - use x / 2 - constructor <;> linarith + example (x : ℝ) (h : ∀ ε > 0, x ≤ ε) : x ≤ 0 := by + contrapose! h + use x / 2 + constructor <;> linarith </pre></div> </div> We have not yet explained the <code class="docutils literal notranslate">constructor</code> command
- @@ -1062,16 +1062,16 @@ establishes the goal so we can move on to the next one.
 <a class="reference internal" href="#disjunction">Section 3.5</a>.) Lean provides a number of ways of closing a goal once a contradiction has been reached. - <div class="highlight-lean notranslate"><div class="highlight"><pre>example (h : 0 < 0) : a > 37 := by - exfalso - apply lt_irrefl 0 h + <div class="highlight-lean notranslate"><div class="highlight"><pre>example (h : 0 < 0) : a > 37 := by + exfalso + apply lt_irrefl 0 h - example (h : 0 < 0) : a > 37 := - absurd h (lt_irrefl 0) + example (h : 0 < 0) : a > 37 := + absurd h (lt_irrefl 0) - example (h : 0 < 0) : a > 37 := by - have h' : ¬0 < 0 := lt_irrefl 0 - contradiction + example (h : 0 < 0) : a > 37 := by + have h' : ¬0 < 0 := lt_irrefl 0 + contradiction </pre></div> </div> The <code class="docutils literal notranslate">exfalso</code> tactic replaces the current goal with
- @@ -1090,12 +1090,12 @@ is used to express “and.”
 The <code class="docutils literal notranslate">constructor</code> tactic allows you to prove a statement of the form <code class="docutils literal notranslate">A ∧ B</code> by proving <code class="docutils literal notranslate">A</code> and then proving <code class="docutils literal notranslate">B</code>. - <div class="highlight-lean notranslate"><div class="highlight"><pre>example {x y : ℝ} (h₀ : x ≤ y) (h₁ : ¬y ≤ x) : x ≤ y ∧ x ≠ y := by - constructor - · assumption - intro h - apply h₁ - rw [h] + <div class="highlight-lean notranslate"><div class="highlight"><pre>example {x y : ℝ} (h₀ : x ≤ y) (h₁ : ¬y ≤ x) : x ≤ y ∧ x ≠ y := by + constructor + · assumption + intro h + apply h₁ + rw [h] </pre></div> </div> In this example, the <code class="docutils literal notranslate">assumption</code> tactic
- @@ -1108,14 +1108,14 @@ angle brackets.
 The first is a slick proof-term version of the previous proof, which drops into tactic mode at the keyword <code class="docutils literal notranslate">by</code>. - <div class="highlight-lean notranslate"><div class="highlight"><pre>example {x y : ℝ} (h₀ : x ≤ y) (h₁ : ¬y ≤ x) : x ≤ y ∧ x ≠ y := - ⟨h₀, fun h ↦ h₁ (by rw [h])⟩ + <div class="highlight-lean notranslate"><div class="highlight"><pre>example {x y : ℝ} (h₀ : x ≤ y) (h₁ : ¬y ≤ x) : x ≤ y ∧ x ≠ y := + ⟨h₀, fun h ↦ h₁ (by rw [h])⟩ - example {x y : ℝ} (h₀ : x ≤ y) (h₁ : ¬y ≤ x) : x ≤ y ∧ x ≠ y := - have h : x ≠ y := by - contrapose! h₁ - rw [h₁] - ⟨h₀, h⟩ + example {x y : ℝ} (h₀ : x ≤ y) (h₁ : ¬y ≤ x) : x ≤ y ∧ x ≠ y := + have h : x ≠ y := by + contrapose! h₁ + rw [h₁] + ⟨h₀, h⟩ </pre></div> </div> Using a conjunction instead of proving one involves unpacking the proofs of the
- @@ -1124,46 +1124,46 @@ You can use the <code class="docutils literal notranslate">rca
 as well as <code class="docutils literal notranslate">rintro</code> or a pattern-matching <code class="docutils literal notranslate">fun</code>, all in a manner similar to the way they are used with the existential quantifier. - <div class="highlight-lean notranslate"><div class="highlight"><pre>example {x y : ℝ} (h : x ≤ y ∧ x ≠ y) : ¬y ≤ x := by - rcases h with ⟨h₀, h₁⟩ - contrapose! h₁ - exact le_antisymm h₀ h₁ + <div class="highlight-lean notranslate"><div class="highlight"><pre>example {x y : ℝ} (h : x ≤ y ∧ x ≠ y) : ¬y ≤ x := by + rcases h with ⟨h₀, h₁⟩ + contrapose! h₁ + exact le_antisymm h₀ h₁ - example {x y : ℝ} : x ≤ y ∧ x ≠ y → ¬y ≤ x := by - rintro ⟨h₀, h₁⟩ h' - exact h₁ (le_antisymm h₀ h') + example {x y : ℝ} : x ≤ y ∧ x ≠ y → ¬y ≤ x := by + rintro ⟨h₀, h₁⟩ h' + exact h₁ (le_antisymm h₀ h') - example {x y : ℝ} : x ≤ y ∧ x ≠ y → ¬y ≤ x := - fun ⟨h₀, h₁⟩ h' ↦ h₁ (le_antisymm h₀ h') + example {x y : ℝ} : x ≤ y ∧ x ≠ y → ¬y ≤ x := + fun ⟨h₀, h₁⟩ h' ↦ h₁ (le_antisymm h₀ h') </pre></div> </div> In analogy to the <code class="docutils literal notranslate">obtain</code> tactic, there is also a pattern-matching <code class="docutils literal notranslate">have</code>: - <div class="highlight-lean notranslate"><div class="highlight"><pre>example {x y : ℝ} (h : x ≤ y ∧ x ≠ y) : ¬y ≤ x := by - have ⟨h₀, h₁⟩ := h - contrapose! h₁ - exact le_antisymm h₀ h₁ + <div class="highlight-lean notranslate"><div class="highlight"><pre>example {x y : ℝ} (h : x ≤ y ∧ x ≠ y) : ¬y ≤ x := by + have ⟨h₀, h₁⟩ := h + contrapose! h₁ + exact le_antisymm h₀ h₁ </pre></div> </div> In contrast to <code class="docutils literal notranslate">rcases</code>, here the <code class="docutils literal notranslate">have</code> tactic leaves <code class="docutils literal notranslate">h</code> in the context. And even though we won’t use them, once again we have the computer scientists’ pattern-matching syntax: - <div class="highlight-lean notranslate"><div class="highlight"><pre>example {x y : ℝ} (h : x ≤ y ∧ x ≠ y) : ¬y ≤ x := by - cases h - case intro h₀ h₁ => - contrapose! h₁ - exact le_antisymm h₀ h₁ + <div class="highlight-lean notranslate"><div class="highlight"><pre>example {x y : ℝ} (h : x ≤ y ∧ x ≠ y) : ¬y ≤ x := by + cases h + case intro h₀ h₁ => + contrapose! h₁ + exact le_antisymm h₀ h₁ - example {x y : ℝ} (h : x ≤ y ∧ x ≠ y) : ¬y ≤ x := by - cases h - next h₀ h₁ => - contrapose! h₁ - exact le_antisymm h₀ h₁ + example {x y : ℝ} (h : x ≤ y ∧ x ≠ y) : ¬y ≤ x := by + cases h + next h₀ h₁ => + contrapose! h₁ + exact le_antisymm h₀ h₁ - example {x y : ℝ} (h : x ≤ y ∧ x ≠ y) : ¬y ≤ x := by - match h with - | ⟨h₀, h₁⟩ => - contrapose! h₁ - exact le_antisymm h₀ h₁ + example {x y : ℝ} (h : x ≤ y ∧ x ≠ y) : ¬y ≤ x := by + match h with + | ⟨h₀, h₁⟩ => + contrapose! h₁ + exact le_antisymm h₀ h₁ </pre></div> </div> In contrast to using an existential quantifier,
- @@ -1171,47 +1171,47 @@ you can also extract proofs of the two components
 of a hypothesis <code class="docutils literal notranslate">h : A ∧ B</code> by writing <code class="docutils literal notranslate">h.left</code> and <code class="docutils literal notranslate">h.right</code>, or, equivalently, <code class="docutils literal notranslate">h.1</code> and <code class="docutils literal notranslate">h.2</code>. - <div class="highlight-lean notranslate"><div class="highlight"><pre>example {x y : ℝ} (h : x ≤ y ∧ x ≠ y) : ¬y ≤ x := by - intro h' - apply h.right - exact le_antisymm h.left h' + <div class="highlight-lean notranslate"><div class="highlight"><pre>example {x y : ℝ} (h : x ≤ y ∧ x ≠ y) : ¬y ≤ x := by + intro h' + apply h.right + exact le_antisymm h.left h' - example {x y : ℝ} (h : x ≤ y ∧ x ≠ y) : ¬y ≤ x := - fun h' ↦ h.right (le_antisymm h.left h') + example {x y : ℝ} (h : x ≤ y ∧ x ≠ y) : ¬y ≤ x := + fun h' ↦ h.right (le_antisymm h.left h') </pre></div> </div> Try using these techniques to come up with various ways of proving of the following: - <div class="highlight-lean notranslate"><div class="highlight"><pre>example {m n : ℕ} (h : m ∣ n ∧ m ≠ n) : m ∣ n ∧ ¬n ∣ m := - sorry + <div class="highlight-lean notranslate"><div class="highlight"><pre>example {m n : ℕ} (h : m ∣ n ∧ m ≠ n) : m ∣ n ∧ ¬n ∣ m := + sorry </pre></div> </div> You can nest uses of <code class="docutils literal notranslate">∃</code> and <code class="docutils literal notranslate">∧</code> with anonymous constructors, <code class="docutils literal notranslate">rintro</code>, and <code class="docutils literal notranslate">rcases</code>. - <div class="highlight-lean notranslate"><div class="highlight"><pre>example : ∃ x : ℝ, 2 < x ∧ x < 4 := - ⟨5 / 2, by norm_num, by norm_num⟩ + <div class="highlight-lean notranslate"><div class="highlight"><pre>example : ∃ x : ℝ, 2 < x ∧ x < 4 := + ⟨5 / 2, by norm_num, by norm_num⟩ - example (x y : ℝ) : (∃ z : ℝ, x < z ∧ z < y) → x < y := by - rintro ⟨z, xltz, zlty⟩ - exact lt_trans xltz zlty + example (x y : ℝ) : (∃ z : ℝ, x < z ∧ z < y) → x < y := by + rintro ⟨z, xltz, zlty⟩ + exact lt_trans xltz zlty - example (x y : ℝ) : (∃ z : ℝ, x < z ∧ z < y) → x < y := - fun ⟨z, xltz, zlty⟩ ↦ lt_trans xltz zlty + example (x y : ℝ) : (∃ z : ℝ, x < z ∧ z < y) → x < y := + fun ⟨z, xltz, zlty⟩ ↦ lt_trans xltz zlty </pre></div> </div> You can also use the <code class="docutils literal notranslate">use</code> tactic: - <div class="highlight-lean notranslate"><div class="highlight"><pre>example : ∃ x : ℝ, 2 < x ∧ x < 4 := by - use 5 / 2 - constructor <;> norm_num + <div class="highlight-lean notranslate"><div class="highlight"><pre>example : ∃ x : ℝ, 2 < x ∧ x < 4 := by + use 5 / 2 + constructor <;> norm_num - example : ∃ m n : ℕ, 4 < m ∧ m < n ∧ n < 10 ∧ Nat.Prime m ∧ Nat.Prime n := by - use 5 - use 7 - norm_num + example : ∃ m n : ℕ, 4 < m ∧ m < n ∧ n < 10 ∧ Nat.Prime m ∧ Nat.Prime n := by + use 5 + use 7 + norm_num - example {x y : ℝ} : x ≤ y ∧ x ≠ y → x ≤ y ∧ ¬y ≤ x := by - rintro ⟨h₀, h₁⟩ - use h₀ - exact fun h' ↦ h₁ (le_antisymm h₀ h') + example {x y : ℝ} : x ≤ y ∧ x ≠ y → x ≤ y ∧ ¬y ≤ x := by + rintro ⟨h₀, h₁⟩ + use h₀ + exact fun h' ↦ h₁ (le_antisymm h₀ h') </pre></div> </div> In the first example, the semicolon after the <code class="docutils literal notranslate">constructor</code> command tells Lean to use the
- @@ -1225,16 +1225,16 @@ You can also use <code class="docutils literal notranslate">ca
 To prove an if-and-only-if statement, you can use <code class="docutils literal notranslate">constructor</code> or angle brackets, just as you would if you were proving a conjunction. - <div class="highlight-lean notranslate"><div class="highlight"><pre>example {x y : ℝ} (h : x ≤ y) : ¬y ≤ x ↔ x ≠ y := by - constructor - · contrapose! - rintro rfl - rfl - contrapose! - exact le_antisymm h + <div class="highlight-lean notranslate"><div class="highlight"><pre>example {x y : ℝ} (h : x ≤ y) : ¬y ≤ x ↔ x ≠ y := by + constructor + · contrapose! + rintro rfl + rfl + contrapose! + exact le_antisymm h - example {x y : ℝ} (h : x ≤ y) : ¬y ≤ x ↔ x ≠ y := - ⟨fun h₀ h₁ ↦ h₀ (by rw [h₁]), fun h₀ h₁ ↦ h₀ (le_antisymm h h₁)⟩ + example {x y : ℝ} (h : x ≤ y) : ¬y ≤ x ↔ x ≠ y := + ⟨fun h₀ h₁ ↦ h₀ (by rw [h₁]), fun h₀ h₁ ↦ h₀ (le_antisymm h h₁)⟩ </pre></div> </div> The last proof term is inscrutable. Remember that you can
- @@ -1242,8 +1242,8 @@ use underscores while writing an expression like that to
 see what Lean expects. Try out the various techniques and gadgets you have just seen in order to prove the following: - <div class="highlight-lean notranslate"><div class="highlight"><pre>example {x y : ℝ} : x ≤ y ∧ ¬y ≤ x ↔ x ≤ y ∧ x ≠ y := - sorry + <div class="highlight-lean notranslate"><div class="highlight"><pre>example {x y : ℝ} : x ≤ y ∧ ¬y ≤ x ↔ x ≤ y ∧ x ≠ y := + sorry </pre></div> </div> For a more interesting exercise, show that for any
- @@ -1251,12 +1251,12 @@ two real numbers <code class="docutils literal notranslate">x<
 <code class="docutils literal notranslate">x^2 + y^2 = 0</code> if and only if <code class="docutils literal notranslate">x = 0</code> and <code class="docutils literal notranslate">y = 0</code>. We suggest proving an auxiliary lemma using <code class="docutils literal notranslate">linarith</code>, <code class="docutils literal notranslate">pow_two_nonneg</code>, and <code class="docutils literal notranslate">pow_eq_zero</code>. - <div class="highlight-lean notranslate"><div class="highlight"><pre>theorem aux {x y : ℝ} (h : x ^ 2 + y ^ 2 = 0) : x = 0 := - have h' : x ^ 2 = 0 := by sorry - pow_eq_zero h' + <div class="highlight-lean notranslate"><div class="highlight"><pre>theorem aux {x y : ℝ} (h : x ^ 2 + y ^ 2 = 0) : x = 0 := + have h' : x ^ 2 = 0 := by sorry + pow_eq_zero h' - example (x y : ℝ) : x ^ 2 + y ^ 2 = 0 ↔ x = 0 ∧ y = 0 := - sorry + example (x y : ℝ) : x ^ 2 + y ^ 2 = 0 ↔ x = 0 ∧ y = 0 := + sorry </pre></div> </div> In Lean, bi-implication leads a double-life.
- @@ -1272,14 +1272,14 @@ replace an expression of the form <code class="docutils literal notranslate"><sp
 by the equivalent expression <code class="docutils literal notranslate">- y < x ∧ x < y</code>, and in the one after that we use <code class="docutils literal notranslate">Nat.dvd_gcd_iff</code> to replace an expression of the form <code class="docutils literal notranslate">m ∣ Nat.gcd n k</code> by the equivalent expression <code class="docutils literal notranslate">m ∣ n ∧ m ∣ k</code>. - <div class="highlight-lean notranslate"><div class="highlight"><pre>example (x : ℝ) : |x + 3| < 5 → -8 < x ∧ x < 2 := by - rw [abs_lt] - intro h - constructor <;> linarith + <div class="highlight-lean notranslate"><div class="highlight"><pre>example (x : ℝ) : |x + 3| < 5 → -8 < x ∧ x < 2 := by + rw [abs_lt] + intro h + constructor <;> linarith - example : 3 ∣ Nat.gcd 6 15 := by - rw [Nat.dvd_gcd_iff] - constructor <;> norm_num + example : 3 ∣ Nat.gcd 6 15 := by + rw [Nat.dvd_gcd_iff] + constructor <;> norm_num </pre></div> </div> See if you can use <code class="docutils literal notranslate">rw</code> with the theorem below
- @@ -1287,13 +1287,13 @@ to provide a short proof that negation is not a
 nondecreasing function. (Note that <code class="docutils literal notranslate">push_neg</code> won’t unfold definitions for you, so the <code class="docutils literal notranslate">rw [Monotone]</code> in the proof of the theorem is needed.) - <div class="highlight-lean notranslate"><div class="highlight"><pre>theorem not_monotone_iff {f : ℝ → ℝ} : ¬Monotone f ↔ ∃ x y, x ≤ y ∧ f x > f y := by - rw [Monotone] - push_neg - rfl + <div class="highlight-lean notranslate"><div class="highlight"><pre>theorem not_monotone_iff {f : ℝ → ℝ} : ¬Monotone f ↔ ∃ x y, x ≤ y ∧ f x > f y := by + rw [Monotone] + push_neg + rfl - example : ¬Monotone fun x : ℝ ↦ -x := by - sorry + example : ¬Monotone fun x : ℝ ↦ -x := by + sorry </pre></div> </div> The remaining exercises in this section are designed
- @@ -1308,12 +1308,12 @@ Lean axiomatizes the associated strict pre-order by
 <code class="docutils literal notranslate">a < b ↔ a ≤ b ∧ ¬ b ≤ a</code>. Show that if <code class="docutils literal notranslate">≤</code> is a partial order, then <code class="docutils literal notranslate">a < b</code> is equivalent to <code class="docutils literal notranslate">a ≤ b ∧ a ≠ b</code>: - <div class="highlight-lean notranslate"><div class="highlight"><pre>variable {α : Type*} [PartialOrder α] - variable (a b : α) + <div class="highlight-lean notranslate"><div class="highlight"><pre>variable {α : Type*} [PartialOrder α] + variable (a b : α) - example : a < b ↔ a ≤ b ∧ a ≠ b := by - rw [lt_iff_le_not_le] - sorry + example : a < b ↔ a ≤ b ∧ a ≠ b := by + rw [lt_iff_le_not_le] + sorry </pre></div> </div> Beyond logical operations, you do not need
- @@ -1329,16 +1329,16 @@ We will come back to the simplifier later,
 but here we are only relying on the fact that it will use the indicated lemma repeatedly, even if it needs to be instantiated to different values. - <div class="highlight-lean notranslate"><div class="highlight"><pre>variable {α : Type*} [Preorder α] - variable (a b c : α) + <div class="highlight-lean notranslate"><div class="highlight"><pre>variable {α : Type*} [Preorder α] + variable (a b c : α) - example : ¬a < a := by - rw [lt_iff_le_not_le] - sorry + example : ¬a < a := by + rw [lt_iff_le_not_le] + sorry - example : a < b → b < c → a < c := by - simp only [lt_iff_le_not_le] - sorry + example : a < b → b < c → a < c := by + simp only [lt_iff_le_not_le] + sorry </pre></div> </div> </section>
- @@ -1348,15 +1348,15 @@ to be instantiated to different values.
 <code class="docutils literal notranslate">A</code> or to prove <code class="docutils literal notranslate">B</code>. The <code class="docutils literal notranslate">left</code> tactic chooses <code class="docutils literal notranslate">A</code>, and the <code class="docutils literal notranslate">right</code> tactic chooses <code class="docutils literal notranslate">B</code>. - <div class="highlight-lean notranslate"><div class="highlight"><pre>variable {x y : ℝ} + <div class="highlight-lean notranslate"><div class="highlight"><pre>variable {x y : ℝ} - example (h : y > x ^ 2) : y > 0 ∨ y < -1 := by - left - linarith [pow_two_nonneg x] + example (h : y > x ^ 2) : y > 0 ∨ y < -1 := by + left + linarith [pow_two_nonneg x] - example (h : -y > x ^ 2 + 1) : y > 0 ∨ y < -1 := by - right - linarith [pow_two_nonneg x] + example (h : -y > x ^ 2 + 1) : y > 0 ∨ y < -1 := by + right + linarith [pow_two_nonneg x] </pre></div> </div> We cannot use an anonymous constructor to construct a proof
- @@ -1367,11 +1367,11 @@ When we write proof terms we can use
 to make the choice explicitly. Here, <code class="docutils literal notranslate">inl</code> is short for “introduction left” and <code class="docutils literal notranslate">inr</code> is short for “introduction right.” - <div class="highlight-lean notranslate"><div class="highlight"><pre>example (h : y > 0) : y > 0 ∨ y < -1 := - Or.inl h + <div class="highlight-lean notranslate"><div class="highlight"><pre>example (h : y > 0) : y > 0 ∨ y < -1 := + Or.inl h - example (h : y < -1) : y > 0 ∨ y < -1 := - Or.inr h + example (h : y < -1) : y > 0 ∨ y < -1 := + Or.inr h </pre></div> </div> It may seem strange to prove a disjunction by proving one side
- @@ -1392,12 +1392,12 @@ the <code class="docutils literal notranslate">rcases</
 As usual, we can tell Lean what names to use for the hypotheses. In the next example, we tell Lean to use the name <code class="docutils literal notranslate">h</code> on each branch. - <div class="highlight-lean notranslate"><div class="highlight"><pre>example : x < |y| → x < y ∨ x < -y := by - rcases le_or_gt 0 y with h | h - · rw [abs_of_nonneg h] - intro h; left; exact h - . rw [abs_of_neg h] - intro h; right; exact h + <div class="highlight-lean notranslate"><div class="highlight"><pre>example : x < |y| → x < y ∨ x < -y := by + rcases le_or_gt 0 y with h | h + · rw [abs_of_nonneg h] + intro h; left; exact h + · rw [abs_of_neg h] + intro h; right; exact h </pre></div> </div> Notice that the pattern changes from <code class="docutils literal notranslate">⟨h₀, h₁⟩</code> in the case of
- @@ -1418,14 +1418,14 @@ allowing us to split on those two cases.
 syntax for disjunction. Now the <code class="docutils literal notranslate">cases</code> tactic is more attractive, because it allows us to name each <code class="docutils literal notranslate">case</code>, and name the hypothesis that is introduced closer to where it is used. - <div class="highlight-lean notranslate"><div class="highlight"><pre>example : x < |y| → x < y ∨ x < -y := by - cases le_or_gt 0 y - case inl h => - rw [abs_of_nonneg h] - intro h; left; exact h - case inr h => - rw [abs_of_neg h] - intro h; right; exact h + <div class="highlight-lean notranslate"><div class="highlight"><pre>example : x < |y| → x < y ∨ x < -y := by + cases le_or_gt 0 y + case inl h => + rw [abs_of_nonneg h] + intro h; left; exact h + case inr h => + rw [abs_of_neg h] + intro h; right; exact h </pre></div> </div> The names <code class="docutils literal notranslate">inl</code> and <code class="docutils literal notranslate">inr</code> are short for “intro left” and “intro right,”
- @@ -1433,23 +1433,23 @@ respectively. Using <code class="docutils literal notranslate">next</code>, or <code class="docutils literal notranslate">match</code>, or even a pattern-matching <code class="docutils literal notranslate">have</code>. - <div class="highlight-lean notranslate"><div class="highlight"><pre>example : x < |y| → x < y ∨ x < -y := by - cases le_or_gt 0 y - next h => - rw [abs_of_nonneg h] - intro h; left; exact h - next h => - rw [abs_of_neg h] - intro h; right; exact h - - example : x < |y| → x < y ∨ x < -y := by - match le_or_gt 0 y with - | Or.inl h => - rw [abs_of_nonneg h] - intro h; left; exact h - | Or.inr h => - rw [abs_of_neg h] - intro h; right; exact h + <div class="highlight-lean notranslate"><div class="highlight"><pre>example : x < |y| → x < y ∨ x < -y := by + cases le_or_gt 0 y + next h => + rw [abs_of_nonneg h] + intro h; left; exact h + next h => + rw [abs_of_neg h] + intro h; right; exact h + + example : x < |y| → x < y ∨ x < -y := by + match le_or_gt 0 y with + | Or.inl h => + rw [abs_of_nonneg h] + intro h; left; exact h + | Or.inr h => + rw [abs_of_neg h] + intro h; right; exact h </pre></div> </div> In the case of <code class="docutils literal notranslate">match</code>, we need to use the full names
- @@ -1459,54 +1459,54 @@ cases of a disjunction.
 Try proving the triangle inequality using the first two theorems in the next snippet. They are given the same names they have in Mathlib. - <div class="highlight-lean notranslate"><div class="highlight"><pre>namespace MyAbs + <div class="highlight-lean notranslate"><div class="highlight"><pre>namespace MyAbs - theorem le_abs_self (x : ℝ) : x ≤ |x| := by - sorry + theorem le_abs_self (x : ℝ) : x ≤ |x| := by + sorry - theorem neg_le_abs_self (x : ℝ) : -x ≤ |x| := by - sorry + theorem neg_le_abs_self (x : ℝ) : -x ≤ |x| := by + sorry - theorem abs_add (x y : ℝ) : |x + y| ≤ |x| + |y| := by - sorry + theorem abs_add (x y : ℝ) : |x + y| ≤ |x| + |y| := by + sorry </pre></div> </div> In case you enjoyed these (pun intended) and you want more practice with disjunction, try these. - <div class="highlight-lean notranslate"><div class="highlight"><pre>theorem lt_abs : x < |y| ↔ x < y ∨ x < -y := by - sorry + <div class="highlight-lean notranslate"><div class="highlight"><pre>theorem lt_abs : x < |y| ↔ x < y ∨ x < -y := by + sorry - theorem abs_lt : |x| < y ↔ -y < x ∧ x < y := by - sorry + theorem abs_lt : |x| < y ↔ -y < x ∧ x < y := by + sorry </pre></div> </div> You can also use <code class="docutils literal notranslate">rcases</code> and <code class="docutils literal notranslate">rintro</code> with nested disjunctions. When these result in a genuine case split with multiple goals, the patterns for each new goal are separated by a vertical bar. - <div class="highlight-lean notranslate"><div class="highlight"><pre>example {x : ℝ} (h : x ≠ 0) : x < 0 ∨ x > 0 := by - rcases lt_trichotomy x 0 with xlt | xeq | xgt - · left - exact xlt - · contradiction - . right; exact xgt + <div class="highlight-lean notranslate"><div class="highlight"><pre>example {x : ℝ} (h : x ≠ 0) : x < 0 ∨ x > 0 := by + rcases lt_trichotomy x 0 with xlt | xeq | xgt + · left + exact xlt + · contradiction + · right; exact xgt </pre></div> </div> You can still nest patterns and use the <code class="docutils literal notranslate">rfl</code> keyword to substitute equations: - <div class="highlight-lean notranslate"><div class="highlight"><pre>example {m n k : ℕ} (h : m ∣ n ∨ m ∣ k) : m ∣ n * k := by - rcases h with ⟨a, rfl⟩ | ⟨b, rfl⟩ - · rw [mul_assoc] - apply dvd_mul_right - . rw [mul_comm, mul_assoc] - apply dvd_mul_right + <div class="highlight-lean notranslate"><div class="highlight"><pre>example {m n k : ℕ} (h : m ∣ n ∨ m ∣ k) : m ∣ n * k := by + rcases h with ⟨a, rfl⟩ | ⟨b, rfl⟩ + · rw [mul_assoc] + apply dvd_mul_right + · rw [mul_comm, mul_assoc] + apply dvd_mul_right </pre></div> </div> See if you can prove the following with a single (long) line. Use <code class="docutils literal notranslate">rcases</code> to unpack the hypotheses and split on cases, and use a semicolon and <code class="docutils literal notranslate">linarith</code> to solve each branch. - <div class="highlight-lean notranslate"><div class="highlight"><pre>example {z : ℝ} (h : ∃ x y, z = x ^ 2 + y ^ 2 ∨ z = x ^ 2 + y ^ 2 + 1) : z ≥ 0 := by - sorry + <div class="highlight-lean notranslate"><div class="highlight"><pre>example {z : ℝ} (h : ∃ x y, z = x ^ 2 + y ^ 2 ∨ z = x ^ 2 + y ^ 2 + 1) : z ≥ 0 := by + sorry </pre></div> </div> On the real numbers, an equation <code class="docutils literal notranslate">x * y = 0</code>
- @@ -1514,11 +1514,11 @@ tells us that <code class="docutils literal notranslate">x</sp
 In Mathlib, this fact is known as <code class="docutils literal notranslate">eq_zero_or_eq_zero_of_mul_eq_zero</code>, and it is another nice example of how a disjunction can arise. See if you can use it to prove the following: - <div class="highlight-lean notranslate"><div class="highlight"><pre>example {x : ℝ} (h : x ^ 2 = 1) : x = 1 ∨ x = -1 := by - sorry + <div class="highlight-lean notranslate"><div class="highlight"><pre>example {x : ℝ} (h : x ^ 2 = 1) : x = 1 ∨ x = -1 := by + sorry - example {x y : ℝ} (h : x ^ 2 = y ^ 2) : x = y ∨ x = -y := by - sorry + example {x y : ℝ} (h : x ^ 2 = y ^ 2) : x = y ∨ x = -y := by + sorry </pre></div> </div> Remember that you can use the <code class="docutils literal notranslate">ring</code> tactic to help
- @@ -1536,14 +1536,14 @@ says that the real numbers have no nontrivial zero divisors.
 A commutative ring with this property is called an integral domain. Your proofs of the two theorems above should work equally well in any integral domain: - <div class="highlight-lean notranslate"><div class="highlight"><pre>variable {R : Type*} [CommRing R] [IsDomain R] - variable (x y : R) + <div class="highlight-lean notranslate"><div class="highlight"><pre>variable {R : Type*} [CommRing R] [IsDomain R] + variable (x y : R) - example (h : x ^ 2 = 1) : x = 1 ∨ x = -1 := by - sorry + example (h : x ^ 2 = 1) : x = 1 ∨ x = -1 := by + sorry - example (h : x ^ 2 = y ^ 2) : x = y ∨ x = -y := by - sorry + example (h : x ^ 2 = y ^ 2) : x = y ∨ x = -y := by + sorry </pre></div> </div> In fact, if you are careful, you can prove the first
- @@ -1555,19 +1555,19 @@ depending on whether some statement is true or not.
 For any proposition <code class="docutils literal notranslate">P</code>, we can use <code class="docutils literal notranslate">em P : P ∨ ¬ P</code>. The name <code class="docutils literal notranslate">em</code> is short for “excluded middle.” - <div class="highlight-lean notranslate"><div class="highlight"><pre>example (P : Prop) : ¬¬P → P := by - intro h - cases em P - · assumption - . contradiction + <div class="highlight-lean notranslate"><div class="highlight"><pre>example (P : Prop) : ¬¬P → P := by + intro h + cases em P + · assumption + · contradiction </pre></div> </div> Alternatively, you can use the <code class="docutils literal notranslate">by_cases</code> tactic. - <div class="highlight-lean notranslate"><div class="highlight"><pre>example (P : Prop) : ¬¬P → P := by - intro h - by_cases h' : P - · assumption - contradiction + <div class="highlight-lean notranslate"><div class="highlight"><pre>example (P : Prop) : ¬¬P → P := by + intro h + by_cases h' : P + · assumption + contradiction </pre></div> </div> Notice that the <code class="docutils literal notranslate">by_cases</code> tactic lets you
- @@ -1579,8 +1579,8 @@ If you leave out the label,
 Lean uses <code class="docutils literal notranslate">h</code> by default. Try proving the following equivalence, using <code class="docutils literal notranslate">by_cases</code> to establish one direction. - <div class="highlight-lean notranslate"><div class="highlight"><pre>example (P Q : Prop) : P → Q ↔ ¬P ∨ Q := by - sorry + <div class="highlight-lean notranslate"><div class="highlight"><pre>example (P Q : Prop) : P → Q ↔ ¬P ∨ Q := by + sorry </pre></div> </div> </section>
- @@ -1595,8 +1595,8 @@ remains within $\varepsilon$
 that is, there is a number $N$ such that for every $n \ge N$, $| s_n - a | < \varepsilon$. In Lean, we can render this as follows: - <div class="highlight-lean notranslate"><div class="highlight"><pre>def ConvergesTo (s : ℕ → ℝ) (a : ℝ) := - ∀ ε > 0, ∃ N, ∀ n ≥ N, |s n - a| < ε + <div class="highlight-lean notranslate"><div class="highlight"><pre>def ConvergesTo (s : ℕ → ℝ) (a : ℝ) := + ∀ ε > 0, ∃ N, ∀ n ≥ N, |s n - a| < ε </pre></div> </div> The notation <code class="docutils literal notranslate">∀ ε > 0, ...</code> is a convenient abbreviation
- @@ -1616,9 +1616,9 @@ value for every $x$.
 The <code class="docutils literal notranslate">ext</code> tactic enables us to prove an equation between functions by proving that their values are the same at all the values of their arguments. - <div class="highlight-lean notranslate"><div class="highlight"><pre>example : (fun x y : ℝ ↦ (x + y) ^ 2) = fun x y : ℝ ↦ x ^ 2 + 2 * x * y + y ^ 2 := by - ext - ring + <div class="highlight-lean notranslate"><div class="highlight"><pre>example : (fun x y : ℝ ↦ (x + y) ^ 2) = fun x y : ℝ ↦ x ^ 2 + 2 * x * y + y ^ 2 := by + ext + ring </pre></div> </div> We’ll see later that <code class="docutils literal notranslate">ext</code> is actually more general, and also one can
- @@ -1628,9 +1628,9 @@ above proof.
 The second tactic, the <code class="docutils literal notranslate">congr</code> tactic, allows us to prove an equation between two expressions by reconciling the parts that are different: - <div class="highlight-lean notranslate"><div class="highlight"><pre>example (a b : ℝ) : |a| = |a - b + b| := by - congr - ring + <div class="highlight-lean notranslate"><div class="highlight"><pre>example (a b : ℝ) : |a| = |a - b + b| := by + congr + ring </pre></div> </div> Here the <code class="docutils literal notranslate">congr</code> tactic peels off the <code class="docutils literal notranslate">abs</code> on each side,
- @@ -1646,10 +1646,10 @@ Instead, the <code class="docutils literal notranslate">conver
 as it is, and leaves us with the task of proving the equations that are needed to make the goal match. - <div class="highlight-lean notranslate"><div class="highlight"><pre>example {a : ℝ} (h : 1 < a) : a < a * a := by - convert (mul_lt_mul_right _).2 h - · rw [one_mul] - exact lt_trans zero_lt_one h + <div class="highlight-lean notranslate"><div class="highlight"><pre>example {a : ℝ} (h : 1 < a) : a < a * a := by + convert (mul_lt_mul_right _).2 h + · rw [one_mul] + exact lt_trans zero_lt_one h </pre></div> </div> This example illustrates another useful trick: when we apply an
- @@ -1658,12 +1658,12 @@ and Lean can’t fill it in for us automatically,
 it simply leaves it for us as another goal. The following shows that any constant sequence $a, a, a, \ldots$ converges. - <div class="highlight-lean notranslate"><div class="highlight"><pre>theorem convergesTo_const (a : ℝ) : ConvergesTo (fun x : ℕ ↦ a) a := by - intro ε εpos - use 0 - intro n nge - rw [sub_self, abs_zero] - apply εpos + <div class="highlight-lean notranslate"><div class="highlight"><pre>theorem convergesTo_const (a : ℝ) : ConvergesTo (fun x : ℕ ↦ a) a := by + intro ε εpos + use 0 + intro n nge + rw [sub_self, abs_zero] + apply εpos </pre></div> </div> Lean has a tactic, <code class="docutils literal notranslate">simp</code>, which can often save you the
- @@ -1687,16 +1687,16 @@ the sequence <code class="docutils literal notranslate">fun</s
 of <code class="docutils literal notranslate">a + b</code>. The following example begins to implement this strategy. See if you can finish it off. - <div class="highlight-lean notranslate"><div class="highlight"><pre>theorem convergesTo_add {s t : ℕ → ℝ} {a b : ℝ} - (cs : ConvergesTo s a) (ct : ConvergesTo t b) : - ConvergesTo (fun n ↦ s n + t n) (a + b) := by - intro ε εpos - dsimp -- this line is not needed but cleans up the goal a bit. - have ε2pos : 0 < ε / 2 := by linarith - rcases cs (ε / 2) ε2pos with ⟨Ns, hs⟩ - rcases ct (ε / 2) ε2pos with ⟨Nt, ht⟩ - use max Ns Nt - sorry + <div class="highlight-lean notranslate"><div class="highlight"><pre>theorem convergesTo_add {s t : ℕ → ℝ} {a b : ℝ} + (cs : ConvergesTo s a) (ct : ConvergesTo t b) : + ConvergesTo (fun n ↦ s n + t n) (a + b) := by + intro ε εpos + dsimp -- this line is not needed but cleans up the goal a bit. + have ε2pos : 0 < ε / 2 := by linarith + rcases cs (ε / 2) ε2pos with ⟨Ns, hs⟩ + rcases ct (ε / 2) ε2pos with ⟨Nt, ht⟩ + use max Ns Nt + sorry </pre></div> </div> As hints, you can use <code class="docutils literal notranslate">le_of_max_le_left</code> and <code class="docutils literal notranslate">le_of_max_le_right</code>,
- @@ -1718,27 +1718,27 @@ is equal to zero or not.
 We have taken care of the zero case, and we have left you to prove the result with the extra assumption that <code class="docutils literal notranslate">c</code> is nonzero. - <div class="highlight-lean notranslate"><div class="highlight"><pre>theorem convergesTo_mul_const {s : ℕ → ℝ} {a : ℝ} (c : ℝ) (cs : ConvergesTo s a) : - ConvergesTo (fun n ↦ c * s n) (c * a) := by - by_cases h : c = 0 - · convert convergesTo_const 0 - · rw [h] - ring - rw [h] - ring - have acpos : 0 < |c| := abs_pos.mpr h - sorry + <div class="highlight-lean notranslate"><div class="highlight"><pre>theorem convergesTo_mul_const {s : ℕ → ℝ} {a : ℝ} (c : ℝ) (cs : ConvergesTo s a) : + ConvergesTo (fun n ↦ c * s n) (c * a) := by + by_cases h : c = 0 + · convert convergesTo_const 0 + · rw [h] + ring + rw [h] + ring + have acpos : 0 < |c| := abs_pos.mpr h + sorry </pre></div> </div> The next theorem is also independently interesting: it shows that a convergent sequence is eventually bounded in absolute value. We have started you off; see if you can finish it. - <div class="highlight-lean notranslate"><div class="highlight"><pre>theorem exists_abs_le_of_convergesTo {s : ℕ → ℝ} {a : ℝ} (cs : ConvergesTo s a) : - ∃ N b, ∀ n, N ≤ n → |s n| < b := by - rcases cs 1 zero_lt_one with ⟨N, h⟩ - use N, |a| + 1 - sorry + <div class="highlight-lean notranslate"><div class="highlight"><pre>theorem exists_abs_le_of_convergesTo {s : ℕ → ℝ} {a : ℝ} (cs : ConvergesTo s a) : + ∃ N b, ∀ n, N ≤ n → |s n| < b := by + rcases cs 1 zero_lt_one with ⟨N, h⟩ + use N, |a| + 1 + sorry </pre></div> </div> In fact, the theorem could be strengthened to assert
- @@ -1753,31 +1753,31 @@ To do so, we use the previous theorem to find a <code class="docutils literal no
 that bounds <code class="docutils literal notranslate">s</code> beyond some point <code class="docutils literal notranslate">N₀</code>. See if you can understand the strategy we have outlined and finish the proof. - <div class="highlight-lean notranslate"><div class="highlight"><pre>theorem aux {s t : ℕ → ℝ} {a : ℝ} (cs : ConvergesTo s a) (ct : ConvergesTo t 0) : - ConvergesTo (fun n ↦ s n * t n) 0 := by - intro ε εpos - dsimp - rcases exists_abs_le_of_convergesTo cs with ⟨N₀, B, h₀⟩ - have Bpos : 0 < B := lt_of_le_of_lt (abs_nonneg _) (h₀ N₀ (le_refl _)) - have pos₀ : ε / B > 0 := div_pos εpos Bpos - rcases ct _ pos₀ with ⟨N₁, h₁⟩ - sorry + <div class="highlight-lean notranslate"><div class="highlight"><pre>theorem aux {s t : ℕ → ℝ} {a : ℝ} (cs : ConvergesTo s a) (ct : ConvergesTo t 0) : + ConvergesTo (fun n ↦ s n * t n) 0 := by + intro ε εpos + dsimp + rcases exists_abs_le_of_convergesTo cs with ⟨N₀, B, h₀⟩ + have Bpos : 0 < B := lt_of_le_of_lt (abs_nonneg _) (h₀ N₀ (le_refl _)) + have pos₀ : ε / B > 0 := div_pos εpos Bpos + rcases ct _ pos₀ with ⟨N₁, h₁⟩ + sorry </pre></div> </div> If you have made it this far, congratulations! We are now within striking distance of our theorem. The following proof finishes it off. - <div class="highlight-lean notranslate"><div class="highlight"><pre>theorem convergesTo_mul {s t : ℕ → ℝ} {a b : ℝ} - (cs : ConvergesTo s a) (ct : ConvergesTo t b) : - ConvergesTo (fun n ↦ s n * t n) (a * b) := by - have h₁ : ConvergesTo (fun n ↦ s n * (t n + -b)) 0 := by - apply aux cs - convert convergesTo_add ct (convergesTo_const (-b)) - ring - have := convergesTo_add h₁ (convergesTo_mul_const b cs) - convert convergesTo_add h₁ (convergesTo_mul_const b cs) using 1 - · ext; ring - ring + <div class="highlight-lean notranslate"><div class="highlight"><pre>theorem convergesTo_mul {s t : ℕ → ℝ} {a b : ℝ} + (cs : ConvergesTo s a) (ct : ConvergesTo t b) : + ConvergesTo (fun n ↦ s n * t n) (a * b) := by + have h₁ : ConvergesTo (fun n ↦ s n * (t n + -b)) 0 := by + apply aux cs + convert convergesTo_add ct (convergesTo_const (-b)) + ring + have := convergesTo_add h₁ (convergesTo_mul_const b cs) + convert convergesTo_add h₁ (convergesTo_mul_const b cs) using 1 + · ext; ring + ring </pre></div> </div> For another challenging exercise,
- @@ -1785,22 +1785,22 @@ try filling out the following sketch of a proof that limits
 are unique. (If you are feeling bold, you can delete the proof sketch and try proving it from scratch.) - <div class="highlight-lean notranslate"><div class="highlight"><pre>theorem convergesTo_unique {s : ℕ → ℝ} {a b : ℝ} - (sa : ConvergesTo s a) (sb : ConvergesTo s b) : - a = b := by - by_contra abne - have : |a - b| > 0 := by sorry - let ε := |a - b| / 2 - have εpos : ε > 0 := by - change |a - b| / 2 > 0 - linarith - rcases sa ε εpos with ⟨Na, hNa⟩ - rcases sb ε εpos with ⟨Nb, hNb⟩ - let N := max Na Nb - have absa : |s N - a| < ε := by sorry - have absb : |s N - b| < ε := by sorry - have : |a - b| < |a - b| := by sorry - exact lt_irrefl _ this + <div class="highlight-lean notranslate"><div class="highlight"><pre>theorem convergesTo_unique {s : ℕ → ℝ} {a b : ℝ} + (sa : ConvergesTo s a) (sb : ConvergesTo s b) : + a = b := by + by_contra abne + have : |a - b| > 0 := by sorry + let ε := |a - b| / 2 + have εpos : ε > 0 := by + change |a - b| / 2 > 0 + linarith + rcases sa ε εpos with ⟨Na, hNa⟩ + rcases sb ε εpos with ⟨Nb, hNb⟩ + let N := max Na Nb + have absa : |s N - a| < ε := by sorry + have absb : |s N - b| < ε := by sorry + have : |a - b| < |a - b| := by sorry + exact lt_irrefl _ this </pre></div> </div> We close the section with the observation that our proofs can be generalized.
- @@ -1809,10 +1809,10 @@ natural numbers is that their structure carries a partial order
 with <code class="docutils literal notranslate">min</code> and <code class="docutils literal notranslate">max</code>. You can check that everything still works if you replace <code class="docutils literal notranslate">ℕ</code> everywhere by any linear order <code class="docutils literal notranslate">α</code>: - <div class="highlight-lean notranslate"><div class="highlight"><pre>variable {α : Type*} [LinearOrder α] + <div class="highlight-lean notranslate"><div class="highlight"><pre>variable {α : Type*} [LinearOrder α] - def ConvergesTo' (s : α → ℝ) (a : ℝ) := - ∀ ε > 0, ∃ N, ∀ n ≥ N, |s n - a| < ε + def ConvergesTo' (s : α → ℝ) (a : ℝ) := + ∀ ε > 0, ∃ N, ∀ n ≥ N, |s n - a| < ε </pre></div> </div> In <a class="reference internal" href="C09_Topology.html#filters">Section 9.1</a>, we will see that Mathlib has mechanisms
html/C04_Sets_and_Functions.html
- @@ -18,7 +18,7 @@
 <script src="_static/jquery.js?v=5d32c60e"></script> <script src="_static/_sphinx_javascript_frameworks_compat.js?v=2cd50e6c"></script> <script src="_static/documentation_options.js?v=2709fde1"></script> - <script src="_static/doctools.js?v=888ff710"></script> + <script src="_static/doctools.js?v=9a2dae69"></script> <script src="_static/sphinx_highlight.js?v=dc90522c"></script> <script async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-mml-chtml.js"></script> <script src="_static/js/theme.js"></script>
- @@ -156,69 +156,69 @@ Unlike <code class="docutils literal notranslate">rw</c
 inside a universal or existential quantifier. If you step through the proof, you can see the effects of these commands. - <div class="highlight-lean notranslate"><div class="highlight"><pre>variable {α : Type*} - variable (s t u : Set α) - open Set - - example (h : s ⊆ t) : s ∩ u ⊆ t ∩ u := by - rw [subset_def, inter_def, inter_def] - rw [subset_def] at h - simp only [mem_setOf] - rintro x ⟨xs, xu⟩ - exact ⟨h _ xs, xu⟩ - - example (h : s ⊆ t) : s ∩ u ⊆ t ∩ u := by - simp only [subset_def, mem_inter_iff] at * - rintro x ⟨xs, xu⟩ - exact ⟨h _ xs, xu⟩ + <div class="highlight-lean notranslate"><div class="highlight"><pre>variable {α : Type*} + variable (s t u : Set α) + open Set + + example (h : s ⊆ t) : s ∩ u ⊆ t ∩ u := by + rw [subset_def, inter_def, inter_def] + rw [subset_def] at h + simp only [mem_setOf] + rintro x ⟨xs, xu⟩ + exact ⟨h _ xs, xu⟩ + + example (h : s ⊆ t) : s ∩ u ⊆ t ∩ u := by + simp only [subset_def, mem_inter_iff] at * + rintro x ⟨xs, xu⟩ + exact ⟨h _ xs, xu⟩ </pre></div> </div> In this example, we open the <code class="docutils literal notranslate">set</code> namespace to have access to the shorter names for the theorems. But, in fact, we can delete the calls to <code class="docutils literal notranslate">rw</code> and <code class="docutils literal notranslate">simp</code> entirely: - <div class="highlight-lean notranslate"><div class="highlight"><pre>example (h : s ⊆ t) : s ∩ u ⊆ t ∩ u := by - intro x xsu - exact ⟨h xsu.1, xsu.2⟩ + <div class="highlight-lean notranslate"><div class="highlight"><pre>example (h : s ⊆ t) : s ∩ u ⊆ t ∩ u := by + intro x xsu + exact ⟨h xsu.1, xsu.2⟩ </pre></div> </div> What is going on here is known as definitional reduction: to make sense of the <code class="docutils literal notranslate">intro</code> command and the anonymous constructors Lean is forced to expand the definitions. The following example also illustrate the phenomenon: - <div class="highlight-lean notranslate"><div class="highlight"><pre>example (h : s ⊆ t) : s ∩ u ⊆ t ∩ u := - fun x ⟨xs, xu⟩ ↦ ⟨h xs, xu⟩ + <div class="highlight-lean notranslate"><div class="highlight"><pre>example (h : s ⊆ t) : s ∩ u ⊆ t ∩ u := + fun x ⟨xs, xu⟩ ↦ ⟨h xs, xu⟩ </pre></div> </div> To deal with unions, we can use <code class="docutils literal notranslate">Set.union_def</code> and <code class="docutils literal notranslate">Set.mem_union</code>. Since <code class="docutils literal notranslate">x ∈ s ∪ t</code> unfolds to <code class="docutils literal notranslate">x ∈ s ∨ x ∈ t</code>, we can also use the <code class="docutils literal notranslate">cases</code> tactic to force a definitional reduction. - <div class="highlight-lean notranslate"><div class="highlight"><pre>example : s ∩ (t ∪ u) ⊆ s ∩ t ∪ s ∩ u := by - intro x hx - have xs : x ∈ s := hx.1 - have xtu : x ∈ t ∪ u := hx.2 - rcases xtu with xt | xu - · left - show x ∈ s ∩ t - exact ⟨xs, xt⟩ - . right - show x ∈ s ∩ u - exact ⟨xs, xu⟩ + <div class="highlight-lean notranslate"><div class="highlight"><pre>example : s ∩ (t ∪ u) ⊆ s ∩ t ∪ s ∩ u := by + intro x hx + have xs : x ∈ s := hx.1 + have xtu : x ∈ t ∪ u := hx.2 + rcases xtu with xt | xu + · left + show x ∈ s ∩ t + exact ⟨xs, xt⟩ + · right + show x ∈ s ∩ u + exact ⟨xs, xu⟩ </pre></div> </div> Since intersection binds tighter than union, the use of parentheses in the expression <code class="docutils literal notranslate">(s ∩ t) ∪ (s ∩ u)</code> is unnecessary, but they make the meaning of the expression clearer. The following is a shorter proof of the same fact: - <div class="highlight-lean notranslate"><div class="highlight"><pre>example : s ∩ (t ∪ u) ⊆ s ∩ t ∪ s ∩ u := by - rintro x ⟨xs, xt | xu⟩ - · left; exact ⟨xs, xt⟩ - . right; exact ⟨xs, xu⟩ + <div class="highlight-lean notranslate"><div class="highlight"><pre>example : s ∩ (t ∪ u) ⊆ s ∩ t ∪ s ∩ u := by + rintro x ⟨xs, xt | xu⟩ + · left; exact ⟨xs, xt⟩ + · right; exact ⟨xs, xu⟩ </pre></div> </div> As an exercise, try proving the other inclusion: - <div class="highlight-lean notranslate"><div class="highlight"><pre>example : s ∩ t ∪ s ∩ u ⊆ s ∩ (t ∪ u) := by - sorry + <div class="highlight-lean notranslate"><div class="highlight"><pre>example : s ∩ t ∪ s ∩ u ⊆ s ∩ (t ∪ u) := by + sorry </pre></div> </div> It might help to know that when using <code class="docutils literal notranslate">rintro</code>,
- @@ -233,28 +233,28 @@ It can be rewritten manually using <code class="docutils literal notranslate"><s
 or <code class="docutils literal notranslate">Set.mem_diff</code>, but the following two proofs of the same inclusion show how to avoid using them. - <div class="highlight-lean notranslate"><div class="highlight"><pre>example : (s \ t) \ u ⊆ s \ (t ∪ u) := by - intro x xstu - have xs : x ∈ s := xstu.1.1 - have xnt : x ∉ t := xstu.1.2 - have xnu : x ∉ u := xstu.2 - constructor - · exact xs - intro xtu - -- x ∈ t ∨ x ∈ u - rcases xtu with xt | xu - · show False; exact xnt xt - . show False; exact xnu xu - - example : (s \ t) \ u ⊆ s \ (t ∪ u) := by - rintro x ⟨⟨xs, xnt⟩, xnu⟩ - use xs - rintro (xt | xu) <;> contradiction + <div class="highlight-lean notranslate"><div class="highlight"><pre>example : (s \ t) \ u ⊆ s \ (t ∪ u) := by + intro x xstu + have xs : x ∈ s := xstu.1.1 + have xnt : x ∉ t := xstu.1.2 + have xnu : x ∉ u := xstu.2 + constructor + · exact xs + intro xtu + -- x ∈ t ∨ x ∈ u + rcases xtu with xt | xu + · show False; exact xnt xt + · show False; exact xnu xu + + example : (s \ t) \ u ⊆ s \ (t ∪ u) := by + rintro x ⟨⟨xs, xnt⟩, xnu⟩ + use xs + rintro (xt | xu) <;> contradiction </pre></div> </div> As an exercise, prove the reverse inclusion: - <div class="highlight-lean notranslate"><div class="highlight"><pre>example : s \ (t ∪ u) ⊆ (s \ t) \ u := by - sorry + <div class="highlight-lean notranslate"><div class="highlight"><pre>example : s \ (t ∪ u) ⊆ (s \ t) \ u := by + sorry </pre></div> </div> To prove that two sets are equal,
- @@ -263,57 +263,57 @@ of the other.
 This principle is known as “extensionality,” and, unsurprisingly, the <code class="docutils literal notranslate">ext</code> tactic is equipped to handle it. - <div class="highlight-lean notranslate"><div class="highlight"><pre>example : s ∩ t = t ∩ s := by - ext x - simp only [mem_inter_iff] - constructor - · rintro ⟨xs, xt⟩; exact ⟨xt, xs⟩ - . rintro ⟨xt, xs⟩; exact ⟨xs, xt⟩ + <div class="highlight-lean notranslate"><div class="highlight"><pre>example : s ∩ t = t ∩ s := by + ext x + simp only [mem_inter_iff] + constructor + · rintro ⟨xs, xt⟩; exact ⟨xt, xs⟩ + · rintro ⟨xt, xs⟩; exact ⟨xs, xt⟩ </pre></div> </div> Once again, deleting the line <code class="docutils literal notranslate">simp only [mem_inter_iff]</code> does not harm the proof. In fact, if you like inscrutable proof terms, the following one-line proof is for you: - <div class="highlight-lean notranslate"><div class="highlight"><pre>example : s ∩ t = t ∩ s := - Set.ext fun x ↦ ⟨fun ⟨xs, xt⟩ ↦ ⟨xt, xs⟩, fun ⟨xt, xs⟩ ↦ ⟨xs, xt⟩⟩ + <div class="highlight-lean notranslate"><div class="highlight"><pre>example : s ∩ t = t ∩ s := + Set.ext fun x ↦ ⟨fun ⟨xs, xt⟩ ↦ ⟨xt, xs⟩, fun ⟨xt, xs⟩ ↦ ⟨xs, xt⟩⟩ </pre></div> </div> Here is an even shorter proof, using the simplifier: - <div class="highlight-lean notranslate"><div class="highlight"><pre>example : s ∩ t = t ∩ s := by ext x; simp [and_comm] + <div class="highlight-lean notranslate"><div class="highlight"><pre>example : s ∩ t = t ∩ s := by ext x; simp [and_comm] </pre></div> </div> An alternative to using <code class="docutils literal notranslate">ext</code> is to use the theorem <code class="docutils literal notranslate">Subset.antisymm</code> which allows us to prove an equation <code class="docutils literal notranslate">s = t</code> between sets by proving <code class="docutils literal notranslate">s ⊆ t</code> and <code class="docutils literal notranslate">t ⊆ s</code>. - <div class="highlight-lean notranslate"><div class="highlight"><pre>example : s ∩ t = t ∩ s := by - apply Subset.antisymm - · rintro x ⟨xs, xt⟩; exact ⟨xt, xs⟩ - . rintro x ⟨xt, xs⟩; exact ⟨xs, xt⟩ + <div class="highlight-lean notranslate"><div class="highlight"><pre>example : s ∩ t = t ∩ s := by + apply Subset.antisymm + · rintro x ⟨xs, xt⟩; exact ⟨xt, xs⟩ + · rintro x ⟨xt, xs⟩; exact ⟨xs, xt⟩ </pre></div> </div> Try finishing this proof term: - <div class="highlight-lean notranslate"><div class="highlight"><pre>example : s ∩ t = t ∩ s := - Subset.antisymm sorry sorry + <div class="highlight-lean notranslate"><div class="highlight"><pre>example : s ∩ t = t ∩ s := + Subset.antisymm sorry sorry </pre></div> </div> Remember that you can replace <cite>sorry</cite> by an underscore, and when you hover over it, Lean will show you what it expects at that point. Here are some set-theoretic identities you might enjoy proving: - <div class="highlight-lean notranslate"><div class="highlight"><pre>example : s ∩ (s ∪ t) = s := by - sorry + <div class="highlight-lean notranslate"><div class="highlight"><pre>example : s ∩ (s ∪ t) = s := by + sorry - example : s ∪ s ∩ t = s := by - sorry + example : s ∪ s ∩ t = s := by + sorry - example : s \ t ∪ t = s ∪ t := by - sorry + example : s \ t ∪ t = s ∪ t := by + sorry - example : s \ t ∪ t \ s = (s ∪ t) \ (s ∩ t) := by - sorry + example : s \ t ∪ t \ s = (s ∪ t) \ (s ∩ t) := by + sorry </pre></div> </div> When it comes to representing sets,
- @@ -329,17 +329,17 @@ In other words, sets are really properties, treated as objects.
 The expression <code class="docutils literal notranslate">{ y | P y }</code> unfolds to <code class="docutils literal notranslate">(fun y ↦ P y)</code>, so <code class="docutils literal notranslate">x ∈ { y | P y }</code> reduces to <code class="docutils literal notranslate">P x</code>. So we can turn the property of being even into the set of even numbers: - <div class="highlight-lean notranslate"><div class="highlight"><pre>def evens : Set ℕ := - { n | Even n } + <div class="highlight-lean notranslate"><div class="highlight"><pre>def evens : Set ℕ := + { n | Even n } - def odds : Set ℕ := - { n | ¬Even n } + def odds : Set ℕ := + { n | ¬Even n } - example : evens ∪ odds = univ := by - rw [evens, odds] - ext n - simp - apply Classical.em + example : evens ∪ odds = univ := by + rw [evens, odds] + ext n + simp + apply Classical.em </pre></div> </div> You should step through this proof and make sure
- @@ -359,11 +359,11 @@ because Lean has trouble guessing which ones we mean.
 The following examples show how Lean unfolds the last two definitions when needed. In the second one, <code class="docutils literal notranslate">trivial</code> is the canonical proof of <code class="docutils literal notranslate">True</code> in the library. - <div class="highlight-lean notranslate"><div class="highlight"><pre>example (x : ℕ) (h : x ∈ (∅ : Set ℕ)) : False := - h + <div class="highlight-lean notranslate"><div class="highlight"><pre>example (x : ℕ) (h : x ∈ (∅ : Set ℕ)) : False := + h - example (x : ℕ) : x ∈ (univ : Set ℕ) := - trivial + example (x : ℕ) : x ∈ (univ : Set ℕ) := + trivial </pre></div> </div> As an exercise, prove the following inclusion.
- @@ -372,8 +372,8 @@ and use the simplifier to reduce the
 set-theoretic constructions to logic. We also recommend using the theorems <code class="docutils literal notranslate">Nat.Prime.eq_two_or_odd</code> and <code class="docutils literal notranslate">Nat.even_iff</code>. - <div class="highlight-lean notranslate"><div class="highlight"><pre>example : { n | Nat.Prime n } ∩ { n | n > 2 } ⊆ { n | ¬Even n } := by - sorry + <div class="highlight-lean notranslate"><div class="highlight"><pre>example : { n | Nat.Prime n } ∩ { n | n > 2 } ⊆ { n | ¬Even n } := by + sorry </pre></div> </div> Be careful: it is somewhat confusing that the library has multiple versions
- @@ -382,21 +382,21 @@ The most general one makes sense in any commutative monoid with a zero element.
 The predicate <code class="docutils literal notranslate">Nat.Prime</code> is specific to the natural numbers. Fortunately, there is a theorem that says that in the specific case, the two notions agree, so you can always rewrite one to the other. - <div class="highlight-lean notranslate"><div class="highlight"><pre>#print Prime + <div class="highlight-lean notranslate"><div class="highlight"><pre>#print Prime - #print Nat.Prime + #print Nat.Prime - example (n : ℕ) : Prime n ↔ Nat.Prime n := - Nat.prime_iff.symm + example (n : ℕ) : Prime n ↔ Nat.Prime n := + Nat.prime_iff.symm - example (n : ℕ) (h : Prime n) : Nat.Prime n := by - rw [Nat.prime_iff] - exact h + example (n : ℕ) (h : Prime n) : Nat.Prime n := by + rw [Nat.prime_iff] + exact h </pre></div> </div> The <cite>rwa</cite> tactic follows a rewrite with the assumption tactic. - <div class="highlight-lean notranslate"><div class="highlight"><pre>example (n : ℕ) (h : Prime n) : Nat.Prime n := by - rwa [Nat.prime_iff] + <div class="highlight-lean notranslate"><div class="highlight"><pre>example (n : ℕ) (h : Prime n) : Nat.Prime n := by + rwa [Nat.prime_iff] </pre></div> </div> Lean introduces the notation <code class="docutils literal notranslate">∀ x ∈ s, ...</code>,
- @@ -417,28 +417,28 @@ these two expressions behave roughly the same.
 As a result, we usually don’t need to use <code class="docutils literal notranslate">bex_def</code> to transform them explicitly. Here is are some examples of how they are used: - <div class="highlight-lean notranslate"><div class="highlight"><pre>variable (s t : Set ℕ) + <div class="highlight-lean notranslate"><div class="highlight"><pre>variable (s t : Set ℕ) - example (h₀ : ∀ x ∈ s, ¬Even x) (h₁ : ∀ x ∈ s, Prime x) : ∀ x ∈ s, ¬Even x ∧ Prime x := by - intro x xs - constructor - · apply h₀ x xs - apply h₁ x xs + example (h₀ : ∀ x ∈ s, ¬Even x) (h₁ : ∀ x ∈ s, Prime x) : ∀ x ∈ s, ¬Even x ∧ Prime x := by + intro x xs + constructor + · apply h₀ x xs + apply h₁ x xs - example (h : ∃ x ∈ s, ¬Even x ∧ Prime x) : ∃ x ∈ s, Prime x := by - rcases h with ⟨x, xs, _, prime_x⟩ - use x, xs + example (h : ∃ x ∈ s, ¬Even x ∧ Prime x) : ∃ x ∈ s, Prime x := by + rcases h with ⟨x, xs, _, prime_x⟩ + use x, xs </pre></div> </div> See if you can prove these slight variations: <div class="highlight-lean notranslate"><div class="highlight"><pre>section - variable (ssubt : s ⊆ t) + variable (ssubt : s ⊆ t) - example (h₀ : ∀ x ∈ t, ¬Even x) (h₁ : ∀ x ∈ t, Prime x) : ∀ x ∈ s, ¬Even x ∧ Prime x := by - sorry + example (h₀ : ∀ x ∈ t, ¬Even x) (h₁ : ∀ x ∈ t, Prime x) : ∀ x ∈ s, ¬Even x ∧ Prime x := by + sorry - example (h : ∃ x ∈ s, ¬Even x ∧ Prime x) : ∃ x ∈ t, Prime x := by - sorry + example (h : ∃ x ∈ s, ¬Even x ∧ Prime x) : ∃ x ∈ t, Prime x := by + sorry end </pre></div>
- @@ -454,35 +454,35 @@ There is nothing special about the natural numbers here,
 so <code class="docutils literal notranslate">ℕ</code> can be replaced by any type <code class="docutils literal notranslate">I</code> used to index the sets. The following illustrates their use. - <div class="highlight-lean notranslate"><div class="highlight"><pre>variable {α I : Type*} - variable (A B : I → Set α) - variable (s : Set α) - - open Set - - example : (s ∩ ⋃ i, A i) = ⋃ i, A i ∩ s := by - ext x - simp only [mem_inter_iff, mem_iUnion] - constructor - · rintro ⟨xs, ⟨i, xAi⟩⟩ - exact ⟨i, xAi, xs⟩ - rintro ⟨i, xAi, xs⟩ - exact ⟨xs, ⟨i, xAi⟩⟩ - - example : (⋂ i, A i ∩ B i) = (⋂ i, A i) ∩ ⋂ i, B i := by - ext x - simp only [mem_inter_iff, mem_iInter] - constructor - · intro h - constructor - · intro i - exact (h i).1 - intro i - exact (h i).2 - rintro ⟨h1, h2⟩ i - constructor - · exact h1 i - exact h2 i + <div class="highlight-lean notranslate"><div class="highlight"><pre>variable {α I : Type*} + variable (A B : I → Set α) + variable (s : Set α) + + open Set + + example : (s ∩ ⋃ i, A i) = ⋃ i, A i ∩ s := by + ext x + simp only [mem_inter_iff, mem_iUnion] + constructor + · rintro ⟨xs, ⟨i, xAi⟩⟩ + exact ⟨i, xAi, xs⟩ + rintro ⟨i, xAi, xs⟩ + exact ⟨xs, ⟨i, xAi⟩⟩ + + example : (⋂ i, A i ∩ B i) = (⋂ i, A i) ∩ ⋂ i, B i := by + ext x + simp only [mem_inter_iff, mem_iInter] + constructor + · intro h + constructor + · intro i + exact (h i).1 + intro i + exact (h i).2 + rintro ⟨h1, h2⟩ i + constructor + · exact h1 i + exact h2 i </pre></div> </div> Parentheses are often needed with an
- @@ -493,8 +493,8 @@ the scope of the bound variable extends as far as it can.
 One direction requires classical logic! We recommend using <code class="docutils literal notranslate">by_cases xs : x ∈ s</code> at an appropriate point in the proof. - <div class="highlight-lean notranslate"><div class="highlight"><pre>example : (s ∪ ⋂ i, A i) = ⋂ i, A i ∪ s := by - sorry + <div class="highlight-lean notranslate"><div class="highlight"><pre>example : (s ∪ ⋂ i, A i) = ⋂ i, A i ∪ s := by + sorry </pre></div> </div> Mathlib also has bounded unions and intersections,
- @@ -503,23 +503,23 @@ You can unpack their meaning with <code class="docutils literal notranslate"><sp
 and <code class="docutils literal notranslate">mem_iInter₂</code>. As the following examples show, Lean’s simplifier carries out these replacements as well. - <div class="highlight-lean notranslate"><div class="highlight"><pre>def primes : Set ℕ := - { x | Nat.Prime x } - - example : (⋃ p ∈ primes, { x | p ^ 2 ∣ x }) = { x | ∃ p ∈ primes, p ^ 2 ∣ x } :=by - ext - rw [mem_iUnion₂] - simp - - example : (⋃ p ∈ primes, { x | p ^ 2 ∣ x }) = { x | ∃ p ∈ primes, p ^ 2 ∣ x } := by - ext - simp - - example : (⋂ p ∈ primes, { x | ¬p ∣ x }) ⊆ { x | x = 1 } := by - intro x - contrapose! - simp - apply Nat.exists_prime_and_dvd + <div class="highlight-lean notranslate"><div class="highlight"><pre>def primes : Set ℕ := + { x | Nat.Prime x } + + example : (⋃ p ∈ primes, { x | p ^ 2 ∣ x }) = { x | ∃ p ∈ primes, p ^ 2 ∣ x } :=by + ext + rw [mem_iUnion₂] + simp + + example : (⋃ p ∈ primes, { x | p ^ 2 ∣ x }) = { x | ∃ p ∈ primes, p ^ 2 ∣ x } := by + ext + simp + + example : (⋂ p ∈ primes, { x | ¬p ∣ x }) ⊆ { x | x = 1 } := by + intro x + contrapose! + simp + apply Nat.exists_prime_and_dvd </pre></div> </div> Try solving the following example, which is similar.
- @@ -527,8 +527,8 @@ If you start typing <code class="docutils literal notranslate">apply eq_univ_of_forall</code> is a good way to start the proof. We also recommend using the theorem <code class="docutils literal notranslate">Nat.exists_infinite_primes</code>. - <div class="highlight-lean notranslate"><div class="highlight"><pre>example : (⋃ p ∈ primes, { x | x ≤ p }) = univ := by - sorry + <div class="highlight-lean notranslate"><div class="highlight"><pre>example : (⋃ p ∈ primes, { x | x ≤ p }) = univ := by + sorry </pre></div> </div> Give a collection of sets, <code class="docutils literal notranslate">s : Set (Set α)</code>,
- @@ -539,17 +539,17 @@ Similarly, their intersection, <code class="docutils literal notranslate">sUnion</code> and <code class="docutils literal notranslate">sInter</code>, respectively. The following examples show their relationship to bounded union and intersection. - <div class="highlight-lean notranslate"><div class="highlight"><pre>variable {α : Type*} (s : Set (Set α)) + <div class="highlight-lean notranslate"><div class="highlight"><pre>variable {α : Type*} (s : Set (Set α)) - example : ⋃₀ s = ⋃ t ∈ s, t := by - ext x - rw [mem_iUnion₂] - simp + example : ⋃₀ s = ⋃ t ∈ s, t := by + ext x + rw [mem_iUnion₂] + simp - example : ⋂₀ s = ⋂ t ∈ s, t := by - ext x - rw [mem_iInter₂] - rfl + example : ⋂₀ s = ⋂ t ∈ s, t := by + ext x + rw [mem_iInter₂] + rfl </pre></div> </div> In the library, these identities are called
- @@ -563,17 +563,17 @@ the library defines <code class="docutils literal notranslate">{x | f x ∈ p}</code>. The expression <code class="docutils literal notranslate">x ∈ f ⁻¹' p</code> reduces to <code class="docutils literal notranslate">f x ∈ p</code>. This is often convenient, as in the following example: - <div class="highlight-lean notranslate"><div class="highlight"><pre>variable {α β : Type*} - variable (f : α → β) - variable (s t : Set α) - variable (u v : Set β) + <div class="highlight-lean notranslate"><div class="highlight"><pre>variable {α β : Type*} + variable (f : α → β) + variable (s t : Set α) + variable (u v : Set β) - open Function - open Set + open Function + open Set - example : f ⁻¹' (u ∩ v) = f ⁻¹' u ∩ f ⁻¹' v := by - ext - rfl + example : f ⁻¹' (u ∩ v) = f ⁻¹' u ∩ f ⁻¹' v := by + ext + rfl </pre></div> </div> If <code class="docutils literal notranslate">s</code> is a set of elements of type <code class="docutils literal notranslate">α</code>,
- @@ -585,25 +585,25 @@ So a hypothesis <code class="docutils literal notranslate">y<
 and <code class="docutils literal notranslate">xeq : f x = y</code>. The <code class="docutils literal notranslate">rfl</code> tag in the <code class="docutils literal notranslate">rintro</code> tactic (see <a class="reference internal" href="C03_Logic.html#the-existential-quantifier">Section 3.2</a>) was made precisely for this sort of situation. - <div class="highlight-lean notranslate"><div class="highlight"><pre>example : f '' (s ∪ t) = f '' s ∪ f '' t := by - ext y; constructor - · rintro ⟨x, xs | xt, rfl⟩ - · left - use x, xs - right - use x, xt - rintro (⟨x, xs, rfl⟩ | ⟨x, xt, rfl⟩) - · use x, Or.inl xs - use x, Or.inr xt + <div class="highlight-lean notranslate"><div class="highlight"><pre>example : f '' (s ∪ t) = f '' s ∪ f '' t := by + ext y; constructor + · rintro ⟨x, xs | xt, rfl⟩ + · left + use x, xs + right + use x, xt + rintro (⟨x, xs, rfl⟩ | ⟨x, xt, rfl⟩) + · use x, Or.inl xs + use x, Or.inr xt </pre></div> </div> Notice also that the <code class="docutils literal notranslate">use</code> tactic applies <code class="docutils literal notranslate">rfl</code> to close goals when it can. Here is another example: - <div class="highlight-lean notranslate"><div class="highlight"><pre>example : s ⊆ f ⁻¹' (f '' s) := by - intro x xs - show f x ∈ f '' s - use x, xs + <div class="highlight-lean notranslate"><div class="highlight"><pre>example : s ⊆ f ⁻¹' (f '' s) := by + intro x xs + show f x ∈ f '' s + use x, xs </pre></div> </div> We can replace the line <code class="docutils literal notranslate">use x, xs</code> by
- @@ -612,8 +612,8 @@ use a theorem specifically designed for that purpose.
 But knowing that the image is defined in terms of an existential quantifier is often convenient. The following equivalence is a good exercise: - <div class="highlight-lean notranslate"><div class="highlight"><pre>example : f '' s ⊆ v ↔ s ⊆ f ⁻¹' v := by - sorry + <div class="highlight-lean notranslate"><div class="highlight"><pre>example : f '' s ⊆ v ↔ s ⊆ f ⁻¹' v := by + sorry </pre></div> </div> It shows that <code class="docutils literal notranslate">image f</code> and <code class="docutils literal notranslate">preimage f</code> are
- @@ -632,47 +632,47 @@ you to enjoy.
 You don’t have to do all of them at once; do a few of them, and set the rest aside for a rainy day. - <div class="highlight-lean notranslate"><div class="highlight"><pre>example (h : Injective f) : f ⁻¹' (f '' s) ⊆ s := by - sorry + <div class="highlight-lean notranslate"><div class="highlight"><pre>example (h : Injective f) : f ⁻¹' (f '' s) ⊆ s := by + sorry - example : f '' (f ⁻¹' u) ⊆ u := by - sorry + example : f '' (f ⁻¹' u) ⊆ u := by + sorry - example (h : Surjective f) : u ⊆ f '' (f ⁻¹' u) := by - sorry + example (h : Surjective f) : u ⊆ f '' (f ⁻¹' u) := by + sorry - example (h : s ⊆ t) : f '' s ⊆ f '' t := by - sorry + example (h : s ⊆ t) : f '' s ⊆ f '' t := by + sorry - example (h : u ⊆ v) : f ⁻¹' u ⊆ f ⁻¹' v := by - sorry + example (h : u ⊆ v) : f ⁻¹' u ⊆ f ⁻¹' v := by + sorry - example : f ⁻¹' (u ∪ v) = f ⁻¹' u ∪ f ⁻¹' v := by - sorry + example : f ⁻¹' (u ∪ v) = f ⁻¹' u ∪ f ⁻¹' v := by + sorry - example : f '' (s ∩ t) ⊆ f '' s ∩ f '' t := by - sorry + example : f '' (s ∩ t) ⊆ f '' s ∩ f '' t := by + sorry - example (h : Injective f) : f '' s ∩ f '' t ⊆ f '' (s ∩ t) := by - sorry + example (h : Injective f) : f '' s ∩ f '' t ⊆ f '' (s ∩ t) := by + sorry - example : f '' s \ f '' t ⊆ f '' (s \ t) := by - sorry + example : f '' s \ f '' t ⊆ f '' (s \ t) := by + sorry - example : f ⁻¹' u \ f ⁻¹' v ⊆ f ⁻¹' (u \ v) := by - sorry + example : f ⁻¹' u \ f ⁻¹' v ⊆ f ⁻¹' (u \ v) := by + sorry - example : f '' s ∩ v = f '' (s ∩ f ⁻¹' v) := by - sorry + example : f '' s ∩ v = f '' (s ∩ f ⁻¹' v) := by + sorry - example : f '' (s ∩ f ⁻¹' u) ⊆ f '' s ∩ u := by - sorry + example : f '' (s ∩ f ⁻¹' u) ⊆ f '' s ∩ u := by + sorry - example : s ∩ f ⁻¹' u ⊆ f ⁻¹' (f '' s ∩ u) := by - sorry + example : s ∩ f ⁻¹' u ⊆ f ⁻¹' (f '' s ∩ u) := by + sorry - example : s ∪ f ⁻¹' u ⊆ f ⁻¹' (f '' s ∪ u) := by - sorry + example : s ∪ f ⁻¹' u ⊆ f ⁻¹' (f '' s ∪ u) := by + sorry </pre></div> </div> You can also try your hand at the next group of exercises,
- @@ -683,29 +683,29 @@ to guarantee that the index set is nonempty.
 To prove any of these, we recommend using <code class="docutils literal notranslate">ext</code> or <code class="docutils literal notranslate">intro</code> to unfold the meaning of an equation or inclusion between sets, and then calling <code class="docutils literal notranslate">simp</code> to unpack the conditions for membership. - <div class="highlight-lean notranslate"><div class="highlight"><pre>variable {I : Type*} (A : I → Set α) (B : I → Set β) + <div class="highlight-lean notranslate"><div class="highlight"><pre>variable {I : Type*} (A : I → Set α) (B : I → Set β) - example : (f '' ⋃ i, A i) = ⋃ i, f '' A i := by - sorry + example : (f '' ⋃ i, A i) = ⋃ i, f '' A i := by + sorry - example : (f '' ⋂ i, A i) ⊆ ⋂ i, f '' A i := by - sorry + example : (f '' ⋂ i, A i) ⊆ ⋂ i, f '' A i := by + sorry - example (i : I) (injf : Injective f) : (⋂ i, f '' A i) ⊆ f '' ⋂ i, A i := by - sorry + example (i : I) (injf : Injective f) : (⋂ i, f '' A i) ⊆ f '' ⋂ i, A i := by + sorry - example : (f ⁻¹' ⋃ i, B i) = ⋃ i, f ⁻¹' B i := by - sorry + example : (f ⁻¹' ⋃ i, B i) = ⋃ i, f ⁻¹' B i := by + sorry - example : (f ⁻¹' ⋂ i, B i) = ⋂ i, f ⁻¹' B i := by - sorry + example : (f ⁻¹' ⋂ i, B i) = ⋂ i, f ⁻¹' B i := by + sorry </pre></div> </div> The library defines a predicate <code class="docutils literal notranslate">InjOn f s</code> to say that <code class="docutils literal notranslate">f</code> is injective on <code class="docutils literal notranslate">s</code>. It is defined as follows: - <div class="highlight-lean notranslate"><div class="highlight"><pre>example : InjOn f s ↔ ∀ x₁ ∈ s, ∀ x₂ ∈ s, f x₁ = f x₂ → x₁ = x₂ := - Iff.refl _ + <div class="highlight-lean notranslate"><div class="highlight"><pre>example : InjOn f s ↔ ∀ x₁ ∈ s, ∀ x₂ ∈ s, f x₁ = f x₂ → x₁ = x₂ := + Iff.refl _ </pre></div> </div> The statement <code class="docutils literal notranslate">Injective f</code> is provably equivalent
- @@ -719,39 +719,39 @@ to their full domain,
 there are often relativized versions that restrict the statements to a subset of the domain type. Here is are some examples of <code class="docutils literal notranslate">InjOn</code> and <code class="docutils literal notranslate">range</code> in use: - <div class="highlight-lean notranslate"><div class="highlight"><pre>open Set Real - - example : InjOn log { x | x > 0 } := by - intro x xpos y ypos - intro e - -- log x = log y - calc - x = exp (log x) := by rw [exp_log xpos] - _ = exp (log y) := by rw [e] - _ = y := by rw [exp_log ypos] - - - example : range exp = { y | y > 0 } := by - ext y; constructor - · rintro ⟨x, rfl⟩ - apply exp_pos - intro ypos - use log y - rw [exp_log ypos] + <div class="highlight-lean notranslate"><div class="highlight"><pre>open Set Real + + example : InjOn log { x | x > 0 } := by + intro x xpos y ypos + intro e + -- log x = log y + calc + x = exp (log x) := by rw [exp_log xpos] + _ = exp (log y) := by rw [e] + _ = y := by rw [exp_log ypos] + + + example : range exp = { y | y > 0 } := by + ext y; constructor + · rintro ⟨x, rfl⟩ + apply exp_pos + intro ypos + use log y + rw [exp_log ypos] </pre></div> </div> Try proving these: - <div class="highlight-lean notranslate"><div class="highlight"><pre>example : InjOn sqrt { x | x ≥ 0 } := by - sorry + <div class="highlight-lean notranslate"><div class="highlight"><pre>example : InjOn sqrt { x | x ≥ 0 } := by + sorry - example : InjOn (fun x ↦ x ^ 2) { x : ℝ | x ≥ 0 } := by - sorry + example : InjOn (fun x ↦ x ^ 2) { x : ℝ | x ≥ 0 } := by + sorry - example : sqrt '' { x | x ≥ 0 } = { y | y ≥ 0 } := by - sorry + example : sqrt '' { x | x ≥ 0 } = { y | y ≥ 0 } := by + sorry - example : (range fun x ↦ x ^ 2) = { y : ℝ | y ≥ 0 } := by - sorry + example : (range fun x ↦ x ^ 2) = { y : ℝ | y ≥ 0 } := by + sorry </pre></div> </div> To define the inverse of a function <code class="docutils literal notranslate">f : α → β</code>,
- @@ -771,16 +771,16 @@ This requires an appeal to the axiom of choice.
 Lean allows various ways of accessing it; one convenient method is to use the classical <code class="docutils literal notranslate">choose</code> operator, illustrated below. - <div class="highlight-lean notranslate"><div class="highlight"><pre>variable {α β : Type*} [Inhabited α] + <div class="highlight-lean notranslate"><div class="highlight"><pre>variable {α β : Type*} [Inhabited α] - #check (default : α) + #check (default : α) - variable (P : α → Prop) (h : ∃ x, P x) + variable (P : α → Prop) (h : ∃ x, P x) - #check Classical.choose h + #check Classical.choose h - example : P (Classical.choose h) := - Classical.choose_spec h + example : P (Classical.choose h) := + Classical.choose_spec h </pre></div> </div> Given <code class="docutils literal notranslate">h : ∃ x, P x</code>, the value of <code class="docutils literal notranslate">Classical.choose h</code>
- @@ -789,16 +789,16 @@ The theorem <code class="docutils literal notranslate">Classic
 meets this specification. With these in hand, we can define the inverse function as follows: - <div class="highlight-lean notranslate"><div class="highlight"><pre>noncomputable section + <div class="highlight-lean notranslate"><div class="highlight"><pre>noncomputable section - open Classical + open Classical - def inverse (f : α → β) : β → α := fun y : β ↦ - if h : ∃ x, f x = y then Classical.choose h else default + def inverse (f : α → β) : β → α := fun y : β ↦ + if h : ∃ x, f x = y then Classical.choose h else default - theorem inverse_spec {f : α → β} (y : β) (h : ∃ x, f x = y) : f (inverse f y) = y := by - rw [inverse, dif_pos h] - exact Classical.choose_spec h + theorem inverse_spec {f : α → β} (y : β) (h : ∃ x, f x = y) : f (inverse f y) = y := by + rw [inverse, dif_pos h] + exact Classical.choose_spec h </pre></div> </div> The lines <code class="docutils literal notranslate">noncomputable section</code> and <code class="docutils literal notranslate">open Classical</code>
- @@ -831,15 +831,15 @@ You should be able to prove each of them with about a half-dozen
 short lines. If you are looking for an extra challenge, try to condense each proof to a single-line proof term. - <div class="highlight-lean notranslate"><div class="highlight"><pre>variable (f : α → β) + <div class="highlight-lean notranslate"><div class="highlight"><pre>variable (f : α → β) - open Function + open Function - example : Injective f ↔ LeftInverse (inverse f) f := - sorry + example : Injective f ↔ LeftInverse (inverse f) f := + sorry - example : Surjective f ↔ RightInverse (inverse f) f := - sorry + example : Surjective f ↔ RightInverse (inverse f) f := + sorry </pre></div> </div> We close this section with a type-theoretic statement of Cantor’s
- @@ -847,19 +847,19 @@ famous theorem that there is no surjective function from a set
 to its power set. See if you can understand the proof, and then fill in the two lines that are missing. - <div class="highlight-lean notranslate"><div class="highlight"><pre>theorem Cantor : ∀ f : α → Set α, ¬Surjective f := by - intro f surjf - let S := { i | i ∉ f i } - rcases surjf S with ⟨j, h⟩ - have h₁ : j ∉ f j := by - intro h' - have : j ∉ f j := by rwa [h] at h' - contradiction - have h₂ : j ∈ S - sorry - have h₃ : j ∉ S - sorry - contradiction + <div class="highlight-lean notranslate"><div class="highlight"><pre>theorem Cantor : ∀ f : α → Set α, ¬Surjective f := by + intro f surjf + let S := { i | i ∉ f i } + rcases surjf S with ⟨j, h⟩ + have h₁ : j ∉ f j := by + intro h' + have : j ∉ f j := by rwa [h] at h' + contradiction + have h₂ : j ∈ S + sorry + have h₃ : j ∉ S + sorry + contradiction </pre></div> </div> </section>
- @@ -939,9 +939,9 @@ Formalizing the proof will not only improve our confidence in the
 result, but also help us understand it better. Because the proof uses classical logic, we tell Lean that our definitions will generally not be computable. - <div class="highlight-lean notranslate"><div class="highlight"><pre>noncomputable section - open Classical - variable {α β : Type*} [Nonempty β] + <div class="highlight-lean notranslate"><div class="highlight"><pre>noncomputable section + open Classical + variable {α β : Type*} [Nonempty β] </pre></div> </div> The annotation <code class="docutils literal notranslate">[Nonempty β]</code> specifies that <code class="docutils literal notranslate">β</code> is nonempty.
- @@ -957,21 +957,21 @@ in <code class="docutils literal notranslate">β</c
 and returns an arbitrary element of <code class="docutils literal notranslate">β</code> otherwise. The function <code class="docutils literal notranslate">invFun g</code> is always a left inverse if <code class="docutils literal notranslate">g</code> is injective and a right inverse if <code class="docutils literal notranslate">g</code> is surjective. - <div class="highlight-lean notranslate"><div class="highlight"><pre>#check (invFun g : α → β) - #check (leftInverse_invFun : Injective g → LeftInverse (invFun g) g) - #check (leftInverse_invFun : Injective g → ∀ y, invFun g (g y) = y) - #check (invFun_eq : (∃ y, g y = x) → g (invFun g x) = x) + <div class="highlight-lean notranslate"><div class="highlight"><pre>#check (invFun g : α → β) + #check (leftInverse_invFun : Injective g → LeftInverse (invFun g) g) + #check (leftInverse_invFun : Injective g → ∀ y, invFun g (g y) = y) + #check (invFun_eq : (∃ y, g y = x) → g (invFun g x) = x) </pre></div> </div> We define the set corresponding to the union of the shaded regions as follows. - <div class="highlight-lean notranslate"><div class="highlight"><pre>variable (f : α → β) (g : β → α) + <div class="highlight-lean notranslate"><div class="highlight"><pre>variable (f : α → β) (g : β → α) - def sbAux : ℕ → Set α - | 0 => univ \ g '' univ - | n + 1 => g '' (f '' sbAux n) + def sbAux : ℕ → Set α + | 0 => univ \ g '' univ + | n + 1 => g '' (f '' sbAux n) - def sbSet := - ⋃ n, sbAux f g n + def sbSet := + ⋃ n, sbAux f g n </pre></div> </div> The definition <code class="docutils literal notranslate">sbAux</code> is an example of a recursive definition,
- @@ -983,8 +983,8 @@ S_{n+1} &= g(f(S_n)).\end{split}\]</div>
 The definition <code class="docutils literal notranslate">sbSet</code> corresponds to the set $A = \bigcup_{n \in \mathbb{N}} S_n$ in our proof sketch. The function $h$ described above is now defined as follows: - <div class="highlight-lean notranslate"><div class="highlight"><pre>def sbFun (x : α) : β := - if x ∈ sbSet f g then f x else invFun g x + <div class="highlight-lean notranslate"><div class="highlight"><pre>def sbFun (x : α) : β := + if x ∈ sbSet f g then f x else invFun g x </pre></div> </div> We will need the fact that our definition of $g^{-1}$ is a
- @@ -1003,16 +1003,16 @@ and fill in the remaining parts.
 You will need to use <code class="docutils literal notranslate">invFun_eq</code> at the end. Notice that rewriting with <code class="docutils literal notranslate">sbAux</code> here replaces <code class="docutils literal notranslate">sbAux f g 0</code> with the right-hand side of the corresponding defining equation. - <div class="highlight-lean notranslate"><div class="highlight"><pre>theorem sb_right_inv {x : α} (hx : x ∉ sbSet f g) : g (invFun g x) = x := by - have : x ∈ g '' univ := by - contrapose! hx - rw [sbSet, mem_iUnion] - use 0 - rw [sbAux, mem_diff] - sorry - have : ∃ y, g y = x := by - sorry - sorry + <div class="highlight-lean notranslate"><div class="highlight"><pre>theorem sb_right_inv {x : α} (hx : x ∉ sbSet f g) : g (invFun g x) = x := by + have : x ∈ g '' univ := by + contrapose! hx + rw [sbSet, mem_iUnion] + use 0 + rw [sbAux, mem_diff] + sorry + have : ∃ y, g y = x := by + sorry + sorry </pre></div> </div> We now turn to the proof that $h$ is injective.
- @@ -1036,32 +1036,32 @@ Applying $g$ to both sides y
 Once again, we encourage you to step through the following proof to see how the argument plays out in Lean. See if you can finish off the proof using <code class="docutils literal notranslate">sb_right_inv</code>. - <div class="highlight-lean notranslate"><div class="highlight"><pre>theorem sb_injective (hf : Injective f) : Injective (sbFun f g) := by - set A := sbSet f g with A_def - set h := sbFun f g with h_def - intro x₁ x₂ - intro (hxeq : h x₁ = h x₂) - show x₁ = x₂ - simp only [h_def, sbFun, ← A_def] at hxeq - by_cases xA : x₁ ∈ A ∨ x₂ ∈ A - · wlog x₁A : x₁ ∈ A generalizing x₁ x₂ hxeq xA - · symm - apply this hxeq.symm xA.symm (xA.resolve_left x₁A) - have x₂A : x₂ ∈ A := by - apply _root_.not_imp_self.mp - intro (x₂nA : x₂ ∉ A) - rw [if_pos x₁A, if_neg x₂nA] at hxeq - rw [A_def, sbSet, mem_iUnion] at x₁A - have x₂eq : x₂ = g (f x₁) := by - sorry - rcases x₁A with ⟨n, hn⟩ - rw [A_def, sbSet, mem_iUnion] - use n + 1 - simp [sbAux] - exact ⟨x₁, hn, x₂eq.symm⟩ - sorry - push_neg at xA - sorry + <div class="highlight-lean notranslate"><div class="highlight"><pre>theorem sb_injective (hf : Injective f) : Injective (sbFun f g) := by + set A := sbSet f g with A_def + set h := sbFun f g with h_def + intro x₁ x₂ + intro (hxeq : h x₁ = h x₂) + show x₁ = x₂ + simp only [h_def, sbFun, ← A_def] at hxeq + by_cases xA : x₁ ∈ A ∨ x₂ ∈ A + · wlog x₁A : x₁ ∈ A generalizing x₁ x₂ hxeq xA + · symm + apply this hxeq.symm xA.symm (xA.resolve_left x₁A) + have x₂A : x₂ ∈ A := by + apply _root_.not_imp_self.mp + intro (x₂nA : x₂ ∉ A) + rw [if_pos x₁A, if_neg x₂nA] at hxeq + rw [A_def, sbSet, mem_iUnion] at x₁A + have x₂eq : x₂ = g (f x₁) := by + sorry + rcases x₁A with ⟨n, hn⟩ + rw [A_def, sbSet, mem_iUnion] + use n + 1 + simp [sbAux] + exact ⟨x₁, hn, x₂eq.symm⟩ + sorry + push_neg at xA + sorry </pre></div> </div> The proof introduces some new tactics.
- @@ -1095,32 +1095,32 @@ The tactic <code class="docutils literal notranslate">rcases</
 and <code class="docutils literal notranslate">g y ∈ sbAux f g (n + 1)</code>. In both cases, calling the simplifier with <code class="docutils literal notranslate">simp [sbAux]</code> applies the corresponding defining equation of <code class="docutils literal notranslate">sbAux</code>. - <div class="highlight-lean notranslate"><div class="highlight"><pre>theorem sb_surjective (hg : Injective g) : Surjective (sbFun f g) := by - set A := sbSet f g with A_def - set h := sbFun f g with h_def - intro y - by_cases gyA : g y ∈ A - · rw [A_def, sbSet, mem_iUnion] at gyA - rcases gyA with ⟨n, hn⟩ - rcases n with _ | n - · simp [sbAux] at hn - simp [sbAux] at hn - rcases hn with ⟨x, xmem, hx⟩ - use x - have : x ∈ A := by - rw [A_def, sbSet, mem_iUnion] - exact ⟨n, xmem⟩ - simp only [h_def, sbFun, if_pos this] - exact hg hx - sorry + <div class="highlight-lean notranslate"><div class="highlight"><pre>theorem sb_surjective (hg : Injective g) : Surjective (sbFun f g) := by + set A := sbSet f g with A_def + set h := sbFun f g with h_def + intro y + by_cases gyA : g y ∈ A + · rw [A_def, sbSet, mem_iUnion] at gyA + rcases gyA with ⟨n, hn⟩ + rcases n with _ | n + · simp [sbAux] at hn + simp [sbAux] at hn + rcases hn with ⟨x, xmem, hx⟩ + use x + have : x ∈ A := by + rw [A_def, sbSet, mem_iUnion] + exact ⟨n, xmem⟩ + simp only [h_def, sbFun, if_pos this] + exact hg hx + sorry </pre></div> </div> We can now put it all together. The final statement is short and sweet, and the proof uses the fact that <code class="docutils literal notranslate">Bijective h</code> unfolds to <code class="docutils literal notranslate">Injective h ∧ Surjective h</code>. - <div class="highlight-lean notranslate"><div class="highlight"><pre>theorem schroeder_bernstein {f : α → β} {g : β → α} (hf : Injective f) (hg : Injective g) : - ∃ h : α → β, Bijective h := - ⟨sbFun f g, sb_injective f g hf, sb_surjective f g hg⟩ + <div class="highlight-lean notranslate"><div class="highlight"><pre>theorem schroeder_bernstein {f : α → β} {g : β → α} (hf : Injective f) (hg : Injective g) : + ∃ h : α → β, Bijective h := + ⟨sbFun f g, sb_injective f g hf, sb_surjective f g hg⟩ </pre></div> </div> </section>
html/C05_Elementary_Number_Theory.html
- @@ -18,7 +18,7 @@
 <script src="_static/jquery.js?v=5d32c60e"></script> <script src="_static/_sphinx_javascript_frameworks_compat.js?v=2cd50e6c"></script> <script src="_static/documentation_options.js?v=2709fde1"></script> - <script src="_static/doctools.js?v=888ff710"></script> + <script src="_static/doctools.js?v=9a2dae69"></script> <script src="_static/sphinx_highlight.js?v=dc90522c"></script> <script async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-mml-chtml.js"></script> <script src="_static/js/theme.js"></script>
- @@ -125,18 +125,18 @@ when necessary,
 but we can also do it manually by rewriting or simplifying with the identifier <code class="docutils literal notranslate">Nat.Coprime</code>. The <code class="docutils literal notranslate">norm_num</code> tactic is smart enough to compute concrete values. - <div class="highlight-lean notranslate"><div class="highlight"><pre>#print Nat.Coprime + <div class="highlight-lean notranslate"><div class="highlight"><pre>#print Nat.Coprime - example (m n : Nat) (h : m.Coprime n) : m.gcd n = 1 := - h + example (m n : Nat) (h : m.Coprime n) : m.gcd n = 1 := + h - example (m n : Nat) (h : m.Coprime n) : m.gcd n = 1 := by - rw [Nat.Coprime] at h - exact h + example (m n : Nat) (h : m.Coprime n) : m.gcd n = 1 := by + rw [Nat.Coprime] at h + exact h - example : Nat.Coprime 12 7 := by norm_num + example : Nat.Coprime 12 7 := by norm_num - example : Nat.gcd 12 8 = 4 := by norm_num + example : Nat.gcd 12 8 = 4 := by norm_num </pre></div> </div> We have already encountered the <code class="docutils literal notranslate">gcd</code> function in
- @@ -154,24 +154,24 @@ to the natural numbers.
 We also need the notion of a prime number, <code class="docutils literal notranslate">Nat.Prime</code>. The theorem <code class="docutils literal notranslate">Nat.prime_def_lt</code> provides one familiar characterization, and <code class="docutils literal notranslate">Nat.Prime.eq_one_or_self_of_dvd</code> provides another. - <div class="highlight-lean notranslate"><div class="highlight"><pre>#check Nat.prime_def_lt + <div class="highlight-lean notranslate"><div class="highlight"><pre>#check Nat.prime_def_lt - example (p : ℕ) (prime_p : Nat.Prime p) : 2 ≤ p ∧ ∀ m : ℕ, m < p → m ∣ p → m = 1 := by - rwa [Nat.prime_def_lt] at prime_p + example (p : ℕ) (prime_p : Nat.Prime p) : 2 ≤ p ∧ ∀ m : ℕ, m < p → m ∣ p → m = 1 := by + rwa [Nat.prime_def_lt] at prime_p - #check Nat.Prime.eq_one_or_self_of_dvd + #check Nat.Prime.eq_one_or_self_of_dvd - example (p : ℕ) (prime_p : Nat.Prime p) : ∀ m : ℕ, m ∣ p → m = 1 ∨ m = p := - prime_p.eq_one_or_self_of_dvd + example (p : ℕ) (prime_p : Nat.Prime p) : ∀ m : ℕ, m ∣ p → m = 1 ∨ m = p := + prime_p.eq_one_or_self_of_dvd - example : Nat.Prime 17 := by norm_num + example : Nat.Prime 17 := by norm_num -- commonly used - example : Nat.Prime 2 := - Nat.prime_two + example : Nat.Prime 2 := + Nat.prime_two - example : Nat.Prime 3 := - Nat.prime_three + example : Nat.Prime 3 := + Nat.prime_three </pre></div> </div> In the natural numbers, a prime number has the property that it cannot
- @@ -189,16 +189,16 @@ if the square of a number is even, then that number is even as well.
 Mathlib defines the predicate <code class="docutils literal notranslate">Even</code> in <code class="docutils literal notranslate">Algebra.Group.Even</code>, but for reasons that will become clear below, we will simply use <code class="docutils literal notranslate">2 ∣ m</code> to express that <code class="docutils literal notranslate">m</code> is even. - <div class="highlight-lean notranslate"><div class="highlight"><pre>#check Nat.Prime.dvd_mul - #check Nat.Prime.dvd_mul Nat.prime_two - #check Nat.prime_two.dvd_mul + <div class="highlight-lean notranslate"><div class="highlight"><pre>#check Nat.Prime.dvd_mul + #check Nat.Prime.dvd_mul Nat.prime_two + #check Nat.prime_two.dvd_mul - theorem even_of_even_sqr {m : ℕ} (h : 2 ∣ m ^ 2) : 2 ∣ m := by - rw [pow_two, Nat.prime_two.dvd_mul] at h - cases h <;> assumption + theorem even_of_even_sqr {m : ℕ} (h : 2 ∣ m ^ 2) : 2 ∣ m := by + rw [pow_two, Nat.prime_two.dvd_mul] at h + cases h <;> assumption - example {m : ℕ} (h : 2 ∣ m ^ 2) : 2 ∣ m := - Nat.Prime.dvd_of_dvd_pow Nat.prime_two h + example {m : ℕ} (h : 2 ∣ m ^ 2) : 2 ∣ m := + Nat.Prime.dvd_of_dvd_pow Nat.prime_two h </pre></div> </div> As we proceed, you will need to become proficient at finding the facts you
- @@ -215,32 +215,32 @@ You can also use the search engine on the
 and if all else fails, don’t hesitate to ask on <a class="reference external" href="https://leanprover.zulipchat.com/">Zulip</a>. - <div class="highlight-lean notranslate"><div class="highlight"><pre>example (a b c : Nat) (h : a * b = a * c) (h' : a ≠ 0) : b = c := - -- apply? suggests the following: - (mul_right_inj' h').mp h + <div class="highlight-lean notranslate"><div class="highlight"><pre>example (a b c : Nat) (h : a * b = a * c) (h' : a ≠ 0) : b = c := + -- apply? suggests the following: + (mul_right_inj' h').mp h </pre></div> </div> The heart of our proof of the irrationality of the square root of two is contained in the following theorem. See if you can fill out the proof sketch, using <code class="docutils literal notranslate">even_of_even_sqr</code> and the theorem <code class="docutils literal notranslate">Nat.dvd_gcd</code>. - <div class="highlight-lean notranslate"><div class="highlight"><pre>example {m n : ℕ} (coprime_mn : m.Coprime n) : m ^ 2 ≠ 2 * n ^ 2 := by - intro sqr_eq - have : 2 ∣ m := by - sorry - obtain ⟨k, meq⟩ := dvd_iff_exists_eq_mul_left.mp this - have : 2 * (2 * k ^ 2) = 2 * n ^ 2 := by - rw [← sqr_eq, meq] - ring - have : 2 * k ^ 2 = n ^ 2 := - sorry - have : 2 ∣ n := by - sorry - have : 2 ∣ m.gcd n := by - sorry - have : 2 ∣ 1 := by - sorry - norm_num at this + <div class="highlight-lean notranslate"><div class="highlight"><pre>example {m n : ℕ} (coprime_mn : m.Coprime n) : m ^ 2 ≠ 2 * n ^ 2 := by + intro sqr_eq + have : 2 ∣ m := by + sorry + obtain ⟨k, meq⟩ := dvd_iff_exists_eq_mul_left.mp this + have : 2 * (2 * k ^ 2) = 2 * n ^ 2 := by + rw [← sqr_eq, meq] + ring + have : 2 * k ^ 2 = n ^ 2 := + sorry + have : 2 ∣ n := by + sorry + have : 2 ∣ m.gcd n := by + sorry + have : 2 ∣ 1 := by + sorry + norm_num at this </pre></div> </div> In fact, with very few changes, we can replace <code class="docutils literal notranslate">2</code> by an arbitrary prime.
- @@ -250,8 +250,8 @@ At the end of the proof, you’ll need to derive a contradiction from
 You can use <code class="docutils literal notranslate">Nat.Prime.two_le</code>, which says that any prime number is greater than or equal to two, and <code class="docutils literal notranslate">Nat.le_of_dvd</code>. - <div class="highlight-lean notranslate"><div class="highlight"><pre>example {m n p : ℕ} (coprime_mn : m.Coprime n) (prime_p : p.Prime) : m ^ 2 ≠ p * n ^ 2 := by - sorry + <div class="highlight-lean notranslate"><div class="highlight"><pre>example {m n p : ℕ} (coprime_mn : m.Coprime n) (prime_p : p.Prime) : m ^ 2 ≠ p * n ^ 2 := by + sorry </pre></div> </div> Let us consider another approach.
- @@ -273,10 +273,10 @@ are prime, that any <code class="docutils literal notranslate">n</code> is equal to the product of another list of prime numbers, then that list is a permutation of <code class="docutils literal notranslate">Nat.primeFactorsList n</code>. - <div class="highlight-lean notranslate"><div class="highlight"><pre>#check Nat.primeFactorsList - #check Nat.prime_of_mem_primeFactorsList - #check Nat.prod_primeFactorsList - #check Nat.primeFactorsList_unique + <div class="highlight-lean notranslate"><div class="highlight"><pre>#check Nat.primeFactorsList + #check Nat.prime_of_mem_primeFactorsList + #check Nat.prod_primeFactorsList + #check Nat.primeFactorsList_unique </pre></div> </div> You can browse these theorems and others nearby, even though we have not
- @@ -287,20 +287,20 @@ that represents the same data as a function.
 Specifically, <code class="docutils literal notranslate">Nat.factorization n p</code>, which we can also write <code class="docutils literal notranslate">n.factorization p</code>, returns the multiplicity of <code class="docutils literal notranslate">p</code> in the prime factorization of <code class="docutils literal notranslate">n</code>. We will use the following three facts. - <div class="highlight-lean notranslate"><div class="highlight"><pre>theorem factorization_mul' {m n : ℕ} (mnez : m ≠ 0) (nnez : n ≠ 0) (p : ℕ) : - (m * n).factorization p = m.factorization p + n.factorization p := by - rw [Nat.factorization_mul mnez nnez] - rfl + <div class="highlight-lean notranslate"><div class="highlight"><pre>theorem factorization_mul' {m n : ℕ} (mnez : m ≠ 0) (nnez : n ≠ 0) (p : ℕ) : + (m * n).factorization p = m.factorization p + n.factorization p := by + rw [Nat.factorization_mul mnez nnez] + rfl - theorem factorization_pow' (n k p : ℕ) : - (n ^ k).factorization p = k * n.factorization p := by - rw [Nat.factorization_pow] - rfl + theorem factorization_pow' (n k p : ℕ) : + (n ^ k).factorization p = k * n.factorization p := by + rw [Nat.factorization_pow] + rfl - theorem Nat.Prime.factorization' {p : ℕ} (prime_p : p.Prime) : - p.factorization p = 1 := by - rw [prime_p.factorization] - simp + theorem Nat.Prime.factorization' {p : ℕ} (prime_p : p.Prime) : + p.factorization p = 1 := by + rw [prime_p.factorization] + simp </pre></div> </div> In fact, <code class="docutils literal notranslate">n.factorization</code> is defined in Lean as a function of finite support,
- @@ -312,17 +312,17 @@ the three theorems above as a black box.
 followed by <code class="docutils literal notranslate">assumption</code>. See if you can use the identities above to fill in the missing parts of the proof. - <div class="highlight-lean notranslate"><div class="highlight"><pre>example {m n p : ℕ} (nnz : n ≠ 0) (prime_p : p.Prime) : m ^ 2 ≠ p * n ^ 2 := by - intro sqr_eq - have nsqr_nez : n ^ 2 ≠ 0 := by simpa - have eq1 : Nat.factorization (m ^ 2) p = 2 * m.factorization p := by - sorry - have eq2 : (p * n ^ 2).factorization p = 2 * n.factorization p + 1 := by - sorry - have : 2 * m.factorization p % 2 = (2 * n.factorization p + 1) % 2 := by - rw [← eq1, sqr_eq, eq2] - rw [add_comm, Nat.add_mul_mod_self_left, Nat.mul_mod_right] at this - norm_num at this + <div class="highlight-lean notranslate"><div class="highlight"><pre>example {m n p : ℕ} (nnz : n ≠ 0) (prime_p : p.Prime) : m ^ 2 ≠ p * n ^ 2 := by + intro sqr_eq + have nsqr_nez : n ^ 2 ≠ 0 := by simpa + have eq1 : Nat.factorization (m ^ 2) p = 2 * m.factorization p := by + sorry + have eq2 : (p * n ^ 2).factorization p = 2 * n.factorization p + 1 := by + sorry + have : 2 * m.factorization p % 2 = (2 * n.factorization p + 1) % 2 := by + rw [← eq1, sqr_eq, eq2] + rw [add_comm, Nat.add_mul_mod_self_left, Nat.mul_mod_right] at this + norm_num at this </pre></div> </div> A nice thing about this proof is that it also generalizes. There is
- @@ -349,20 +349,20 @@ to finish it off.
 Note that this example does not assume that <code class="docutils literal notranslate">p</code> is prime, but the conclusion is trivial when <code class="docutils literal notranslate">p</code> is not prime since <code class="docutils literal notranslate">r.factorization p</code> is then zero by definition, and the proof works in all cases anyway. - <div class="highlight-lean notranslate"><div class="highlight"><pre>example {m n k r : ℕ} (nnz : n ≠ 0) (pow_eq : m ^ k = r * n ^ k) {p : ℕ} : - k ∣ r.factorization p := by - rcases r with _ | r - · simp - have npow_nz : n ^ k ≠ 0 := fun npowz ↦ nnz (pow_eq_zero npowz) - have eq1 : (m ^ k).factorization p = k * m.factorization p := by - sorry - have eq2 : ((r + 1) * n ^ k).factorization p = - k * n.factorization p + (r + 1).factorization p := by - sorry - have : r.succ.factorization p = k * m.factorization p - k * n.factorization p := by - rw [← eq1, pow_eq, eq2, add_comm, Nat.add_sub_cancel] - rw [this] - sorry + <div class="highlight-lean notranslate"><div class="highlight"><pre>example {m n k r : ℕ} (nnz : n ≠ 0) (pow_eq : m ^ k = r * n ^ k) {p : ℕ} : + k ∣ r.factorization p := by + rcases r with _ | r + · simp + have npow_nz : n ^ k ≠ 0 := fun npowz ↦ nnz (pow_eq_zero npowz) + have eq1 : (m ^ k).factorization p = k * m.factorization p := by + sorry + have eq2 : ((r + 1) * n ^ k).factorization p = + k * n.factorization p + (r + 1).factorization p := by + sorry + have : r.succ.factorization p = k * m.factorization p - k * n.factorization p := by + rw [← eq1, pow_eq, eq2, add_comm, Nat.add_sub_cancel] + rw [this] + sorry </pre></div> </div> There are a number of ways in which we might want to improve on these results.
- @@ -412,9 +412,9 @@ Lean’s foundation allows us to declare inductive types,
 which are types generated inductively by a given list of constructors. In Lean, the natural numbers are declared as follows. - <div class="highlight-lean notranslate"><div class="highlight"><pre>inductive Nat where - | zero : Nat - | succ (n : Nat) : Nat + <div class="highlight-lean notranslate"><div class="highlight"><pre>inductive Nat where + | zero : Nat + | succ (n : Nat) : Nat </pre></div> </div> You can find this in the library by writing <code class="docutils literal notranslate">#check Nat</code> and
- @@ -428,11 +428,11 @@ representations, but we don’t have to worry about the details of that now.
 What “freely” means for the working mathematician is that the type <code class="docutils literal notranslate">Nat</code> has an element <code class="docutils literal notranslate">zero</code> and an injective successor function <code class="docutils literal notranslate">succ</code> whose image does not include <code class="docutils literal notranslate">zero</code>. - <div class="highlight-lean notranslate"><div class="highlight"><pre>example (n : Nat) : n.succ ≠ Nat.zero := - Nat.succ_ne_zero n + <div class="highlight-lean notranslate"><div class="highlight"><pre>example (n : Nat) : n.succ ≠ Nat.zero := + Nat.succ_ne_zero n - example (m n : Nat) (h : m.succ = n.succ) : m = n := - Nat.succ.inj h + example (m n : Nat) (h : m.succ = n.succ) : m = n := + Nat.succ.inj h </pre></div> </div> What the word “inductively” means for the working mathematician is that
- @@ -441,9 +441,9 @@ and a principle of definition by recursion.
 This section will show you how to use these. Here is an example of a recursive definition of the factorial function. - <div class="highlight-lean notranslate"><div class="highlight"><pre>def fac : ℕ → ℕ - | 0 => 1 - | n + 1 => (n + 1) * fac n + <div class="highlight-lean notranslate"><div class="highlight"><pre>def fac : ℕ → ℕ + | 0 => 1 + | n + 1 => (n + 1) * fac n </pre></div> </div> The syntax takes some getting used to.
- @@ -452,23 +452,23 @@ The next two lines provide the base case and inductive step
 for a recursive definition. These equations hold definitionally, but they can also be used manually by giving the name <code class="docutils literal notranslate">fac</code> to <code class="docutils literal notranslate">simp</code> or <code class="docutils literal notranslate">rw</code>. - <div class="highlight-lean notranslate"><div class="highlight"><pre>example : fac 0 = 1 := - rfl + <div class="highlight-lean notranslate"><div class="highlight"><pre>example : fac 0 = 1 := + rfl - example : fac 0 = 1 := by - rw [fac] + example : fac 0 = 1 := by + rw [fac] - example : fac 0 = 1 := by - simp [fac] + example : fac 0 = 1 := by + simp [fac] - example (n : ℕ) : fac (n + 1) = (n + 1) * fac n := - rfl + example (n : ℕ) : fac (n + 1) = (n + 1) * fac n := + rfl - example (n : ℕ) : fac (n + 1) = (n + 1) * fac n := by - rw [fac] + example (n : ℕ) : fac (n + 1) = (n + 1) * fac n := by + rw [fac] - example (n : ℕ) : fac (n + 1) = (n + 1) * fac n := by - simp [fac] + example (n : ℕ) : fac (n + 1) = (n + 1) * fac n := by + simp [fac] </pre></div> </div> The factorial function is actually already defined in Mathlib as
- @@ -491,26 +491,26 @@ and a required to prove <code class="docutils literal notranslate">with n ih</code> serves to name the variable and the assumption for the inductive hypothesis, and you can choose whatever names you want for them. - <div class="highlight-lean notranslate"><div class="highlight"><pre>theorem fac_pos (n : ℕ) : 0 < fac n := by - induction' n with n ih - · rw [fac] - exact zero_lt_one - rw [fac] - exact mul_pos n.succ_pos ih + <div class="highlight-lean notranslate"><div class="highlight"><pre>theorem fac_pos (n : ℕ) : 0 < fac n := by + induction' n with n ih + · rw [fac] + exact zero_lt_one + rw [fac] + exact mul_pos n.succ_pos ih </pre></div> </div> The <code class="docutils literal notranslate">induction</code> tactic is smart enough to include hypotheses that depend on the induction variable as part of the induction hypothesis. Step through the next example to see what is going on. - <div class="highlight-lean notranslate"><div class="highlight"><pre>theorem dvd_fac {i n : ℕ} (ipos : 0 < i) (ile : i ≤ n) : i ∣ fac n := by - induction' n with n ih - · exact absurd ipos (not_lt_of_ge ile) - rw [fac] - rcases Nat.of_le_succ ile with h | h - · apply dvd_mul_of_dvd_right (ih h) - rw [h] - apply dvd_mul_right + <div class="highlight-lean notranslate"><div class="highlight"><pre>theorem dvd_fac {i n : ℕ} (ipos : 0 < i) (ile : i ≤ n) : i ∣ fac n := by + induction' n with n ih + · exact absurd ipos (not_lt_of_ge ile) + rw [fac] + rcases Nat.of_le_succ ile with h | h + · apply dvd_mul_of_dvd_right (ih h) + rw [h] + apply dvd_mul_right </pre></div> </div> The following example provides a crude lower bound for the factorial
- @@ -520,10 +520,10 @@ so that the remainder of the proof starts with the case
 $n = 1$. See if you can complete the argument with a proof by induction using <code class="docutils literal notranslate">pow_succ</code> or <code class="docutils literal notranslate">pow_succ'</code>. - <div class="highlight-lean notranslate"><div class="highlight"><pre>theorem pow_two_le_fac (n : ℕ) : 2 ^ (n - 1) ≤ fac n := by - rcases n with _ | n - · simp [fac] - sorry + <div class="highlight-lean notranslate"><div class="highlight"><pre>theorem pow_two_le_fac (n : ℕ) : 2 ^ (n - 1) ≤ fac n := by + rcases n with _ | n + · simp [fac] + sorry </pre></div> </div> Induction is often used to prove identities involving finite sums and
- @@ -542,50 +542,50 @@ it supports in the next section, and again in a later chapter.
 For now, we will only make use of <code class="docutils literal notranslate">Finset.range n</code>, which is the finite set of natural numbers less than <code class="docutils literal notranslate">n</code>. - <div class="highlight-lean notranslate"><div class="highlight"><pre>variable {α : Type*} (s : Finset ℕ) (f : ℕ → ℕ) (n : ℕ) + <div class="highlight-lean notranslate"><div class="highlight"><pre>variable {α : Type*} (s : Finset ℕ) (f : ℕ → ℕ) (n : ℕ) - #check Finset.sum s f - #check Finset.prod s f + #check Finset.sum s f + #check Finset.prod s f - open BigOperators - open Finset + open BigOperators + open Finset - example : s.sum f = ∑ x in s, f x := - rfl + example : s.sum f = ∑ x in s, f x := + rfl - example : s.prod f = ∏ x in s, f x := - rfl + example : s.prod f = ∏ x in s, f x := + rfl - example : (range n).sum f = ∑ x in range n, f x := - rfl + example : (range n).sum f = ∑ x in range n, f x := + rfl - example : (range n).prod f = ∏ x in range n, f x := - rfl + example : (range n).prod f = ∏ x in range n, f x := + rfl </pre></div> </div> The facts <code class="docutils literal notranslate">Finset.sum_range_zero</code> and <code class="docutils literal notranslate">Finset.sum_range_succ</code> provide a recursive description of summation up to $n$, and similarly for products. - <div class="highlight-lean notranslate"><div class="highlight"><pre>example (f : ℕ → ℕ) : ∑ x in range 0, f x = 0 := - Finset.sum_range_zero f + <div class="highlight-lean notranslate"><div class="highlight"><pre>example (f : ℕ → ℕ) : ∑ x in range 0, f x = 0 := + Finset.sum_range_zero f - example (f : ℕ → ℕ) (n : ℕ) : ∑ x in range n.succ, f x = ∑ x in range n, f x + f n := - Finset.sum_range_succ f n + example (f : ℕ → ℕ) (n : ℕ) : ∑ x in range n.succ, f x = ∑ x in range n, f x + f n := + Finset.sum_range_succ f n - example (f : ℕ → ℕ) : ∏ x in range 0, f x = 1 := - Finset.prod_range_zero f + example (f : ℕ → ℕ) : ∏ x in range 0, f x = 1 := + Finset.prod_range_zero f - example (f : ℕ → ℕ) (n : ℕ) : ∏ x in range n.succ, f x = (∏ x in range n, f x) * f n := - Finset.prod_range_succ f n + example (f : ℕ → ℕ) (n : ℕ) : ∏ x in range n.succ, f x = (∏ x in range n, f x) * f n := + Finset.prod_range_succ f n </pre></div> </div> The first identity in each pair holds definitionally, which is to say, you can replace the proofs by <code class="docutils literal notranslate">rfl</code>. The following expresses the factorial function that we defined as a product. - <div class="highlight-lean notranslate"><div class="highlight"><pre>example (n : ℕ) : fac n = ∏ i in range n, (i + 1) := by - induction' n with n ih - · simp [fac, prod_range_zero] - simp [fac, ih, prod_range_succ, mul_comm] + <div class="highlight-lean notranslate"><div class="highlight"><pre>example (n : ℕ) : fac n = ∏ i in range n, (i + 1) := by + induction' n with n ih + · simp [fac, prod_range_zero] + simp [fac, ih, prod_range_succ, mul_comm] </pre></div> </div> The fact that we include <code class="docutils literal notranslate">mul_comm</code> as a simplification rule deserves
- @@ -599,8 +599,8 @@ The following example shows that simplifying using the three rules
 <code class="docutils literal notranslate">mul_assoc</code>, <code class="docutils literal notranslate">mul_comm</code>, and <code class="docutils literal notranslate">mul_left_comm</code> manages to identify products that are the same up to the placement of parentheses and ordering of variables. - <div class="highlight-lean notranslate"><div class="highlight"><pre>example (a b c d e f : ℕ) : a * (b * c * f * (d * e)) = d * (a * f * e) * (c * b) := by - simp [mul_assoc, mul_comm, mul_left_comm] + <div class="highlight-lean notranslate"><div class="highlight"><pre>example (a b c d e f : ℕ) : a * (b * c * f * (d * e)) = d * (a * f * e) * (c * b) := by + simp [mul_assoc, mul_comm, mul_left_comm] </pre></div> </div> Roughly, the rules work by pushing parentheses to the right
- @@ -614,18 +614,18 @@ The first step of the proof clears the denominator.
 This is generally useful when formalizing identities, because calculations with division generally have side conditions. (It is similarly useful to avoid using subtraction on the natural numbers when possible.) - <div class="highlight-lean notranslate"><div class="highlight"><pre>theorem sum_id (n : ℕ) : ∑ i in range (n + 1), i = n * (n + 1) / 2 := by - symm; apply Nat.div_eq_of_eq_mul_right (by norm_num : 0 < 2) - induction' n with n ih - · simp - rw [Finset.sum_range_succ, mul_add 2, ← ih] - ring + <div class="highlight-lean notranslate"><div class="highlight"><pre>theorem sum_id (n : ℕ) : ∑ i in range (n + 1), i = n * (n + 1) / 2 := by + symm; apply Nat.div_eq_of_eq_mul_right (by norm_num : 0 < 2) + induction' n with n ih + · simp + rw [Finset.sum_range_succ, mul_add 2, ← ih] + ring </pre></div> </div> We encourage you to prove the analogous identity for sums of squares, and other identities you can find on the web. - <div class="highlight-lean notranslate"><div class="highlight"><pre>theorem sum_sqr (n : ℕ) : ∑ i in range (n + 1), i ^ 2 = n * (n + 1) * (2 * n + 1) / 6 := by - sorry + <div class="highlight-lean notranslate"><div class="highlight"><pre>theorem sum_sqr (n : ℕ) : ∑ i in range (n + 1), i ^ 2 = n * (n + 1) * (2 * n + 1) / 6 := by + sorry </pre></div> </div> In Lean’s core library, addition and multiplication are themselves defined
- @@ -664,48 +664,48 @@ Remember that truncated subtraction cuts off at zero.
 To define that, it is useful to define a predecessor function, <code class="docutils literal notranslate">pred</code>, that subtracts one from any nonzero number and fixes zero. The function <code class="docutils literal notranslate">pred</code> can be defined by a simple instance of recursion. - <div class="highlight-lean notranslate"><div class="highlight"><pre>inductive MyNat where - | zero : MyNat - | succ : MyNat → MyNat + <div class="highlight-lean notranslate"><div class="highlight"><pre>inductive MyNat where + | zero : MyNat + | succ : MyNat → MyNat - namespace MyNat + namespace MyNat - def add : MyNat → MyNat → MyNat - | x, zero => x - | x, succ y => succ (add x y) + def add : MyNat → MyNat → MyNat + | x, zero => x + | x, succ y => succ (add x y) - def mul : MyNat → MyNat → MyNat - | x, zero => zero - | x, succ y => add (mul x y) x + def mul : MyNat → MyNat → MyNat + | x, zero => zero + | x, succ y => add (mul x y) x - theorem zero_add (n : MyNat) : add zero n = n := by - induction' n with n ih - · rfl - rw [add, ih] + theorem zero_add (n : MyNat) : add zero n = n := by + induction' n with n ih + · rfl + rw [add, ih] - theorem succ_add (m n : MyNat) : add (succ m) n = succ (add m n) := by - induction' n with n ih - · rfl - rw [add, ih] - rfl + theorem succ_add (m n : MyNat) : add (succ m) n = succ (add m n) := by + induction' n with n ih + · rfl + rw [add, ih] + rfl - theorem add_comm (m n : MyNat) : add m n = add n m := by - induction' n with n ih - · rw [zero_add] - rfl - rw [add, succ_add, ih] + theorem add_comm (m n : MyNat) : add m n = add n m := by + induction' n with n ih + · rw [zero_add] + rfl + rw [add, succ_add, ih] - theorem add_assoc (m n k : MyNat) : add (add m n) k = add m (add n k) := by - sorry - theorem mul_add (m n k : MyNat) : mul m (add n k) = add (mul m n) (mul m k) := by - sorry - theorem zero_mul (n : MyNat) : mul zero n = zero := by - sorry - theorem succ_mul (m n : MyNat) : mul (succ m) n = add (mul m n) n := by - sorry - theorem mul_comm (m n : MyNat) : mul m n = mul n m := by - sorry - end MyNat + theorem add_assoc (m n k : MyNat) : add (add m n) k = add m (add n k) := by + sorry + theorem mul_add (m n k : MyNat) : mul m (add n k) = add (mul m n) (mul m k) := by + sorry + theorem zero_mul (n : MyNat) : mul zero n = zero := by + sorry + theorem succ_mul (m n : MyNat) : mul (succ m) n = add (mul m n) n := by + sorry + theorem mul_comm (m n : MyNat) : mul m n = mul n m := by + sorry + end MyNat </pre></div> </div> </section>
- @@ -730,12 +730,12 @@ annoying to formalize.
 Here we consider a few ways to do it. To start with, we can use the <code class="docutils literal notranslate">cases</code> tactic and the fact that the successor function respects the ordering on the natural numbers. - <div class="highlight-lean notranslate"><div class="highlight"><pre>theorem two_le {m : ℕ} (h0 : m ≠ 0) (h1 : m ≠ 1) : 2 ≤ m := by - cases m; contradiction - case succ m => - cases m; contradiction - repeat apply Nat.succ_le_succ - apply zero_le + <div class="highlight-lean notranslate"><div class="highlight"><pre>theorem two_le {m : ℕ} (h0 : m ≠ 0) (h1 : m ≠ 1) : 2 ≤ m := by + cases m; contradiction + case succ m => + cases m; contradiction + repeat apply Nat.succ_le_succ + apply zero_le </pre></div> </div> Another strategy is to use the tactic <code class="docutils literal notranslate">interval_cases</code>,
- @@ -743,10 +743,10 @@ which automatically splits the goal into cases when
 the variable in question is contained in an interval of natural numbers or integers. Remember that you can hover over it to see its documentation. - <div class="highlight-lean notranslate"><div class="highlight"><pre>example {m : ℕ} (h0 : m ≠ 0) (h1 : m ≠ 1) : 2 ≤ m := by - by_contra h - push_neg at h - interval_cases m <;> contradiction + <div class="highlight-lean notranslate"><div class="highlight"><pre>example {m : ℕ} (h0 : m ≠ 0) (h1 : m ≠ 1) : 2 ≤ m := by + by_contra h + push_neg at h + interval_cases m <;> contradiction </pre></div> </div> Recall that the semicolon after <code class="docutils literal notranslate">interval_cases m</code> means
- @@ -756,12 +756,12 @@ to find a decision procedure to solve the problem.
 Lean knows that you can decide the truth value of a statement that begins with a bounded quantifier <code class="docutils literal notranslate">∀ x, x < n → ...</code> or <code class="docutils literal notranslate">∃ x, x < n ∧ ...</code> by deciding each of the finitely many instances. - <div class="highlight-lean notranslate"><div class="highlight"><pre>example {m : ℕ} (h0 : m ≠ 0) (h1 : m ≠ 1) : 2 ≤ m := by - by_contra h - push_neg at h - revert h0 h1 - revert h m - decide + <div class="highlight-lean notranslate"><div class="highlight"><pre>example {m : ℕ} (h0 : m ≠ 0) (h1 : m ≠ 1) : 2 ≤ m := by + by_contra h + push_neg at h + revert h0 h1 + revert h m + decide </pre></div> </div> With the theorem <code class="docutils literal notranslate">two_le</code> in hand, let’s start by showing that every
- @@ -786,44 +786,44 @@ then by one of the characterizations of what it means to be a prime number,
 it has a nontrivial factor, $m$, and we can apply the inductive hypothesis to that. Step through the next proof to see how that plays out. - <div class="highlight-lean notranslate"><div class="highlight"><pre>theorem exists_prime_factor {n : Nat} (h : 2 ≤ n) : ∃ p : Nat, p.Prime ∧ p ∣ n := by - by_cases np : n.Prime - · use n, np - induction' n using Nat.strong_induction_on with n ih - rw [Nat.prime_def_lt] at np - push_neg at np - rcases np h with ⟨m, mltn, mdvdn, mne1⟩ - have : m ≠ 0 := by - intro mz - rw [mz, zero_dvd_iff] at mdvdn - linarith - have mgt2 : 2 ≤ m := two_le this mne1 - by_cases mp : m.Prime - · use m, mp - . rcases ih m mltn mgt2 mp with ⟨p, pp, pdvd⟩ - use p, pp - apply pdvd.trans mdvdn + <div class="highlight-lean notranslate"><div class="highlight"><pre>theorem exists_prime_factor {n : Nat} (h : 2 ≤ n) : ∃ p : Nat, p.Prime ∧ p ∣ n := by + by_cases np : n.Prime + · use n, np + induction' n using Nat.strong_induction_on with n ih + rw [Nat.prime_def_lt] at np + push_neg at np + rcases np h with ⟨m, mltn, mdvdn, mne1⟩ + have : m ≠ 0 := by + intro mz + rw [mz, zero_dvd_iff] at mdvdn + linarith + have mgt2 : 2 ≤ m := two_le this mne1 + by_cases mp : m.Prime + · use m, mp + . rcases ih m mltn mgt2 mp with ⟨p, pp, pdvd⟩ + use p, pp + apply pdvd.trans mdvdn </pre></div> </div> We can now prove the following formulation of our theorem. See if you can fill out the sketch. You can use <code class="docutils literal notranslate">Nat.factorial_pos</code>, <code class="docutils literal notranslate">Nat.dvd_factorial</code>, and <code class="docutils literal notranslate">Nat.dvd_sub'</code>. - <div class="highlight-lean notranslate"><div class="highlight"><pre>theorem primes_infinite : ∀ n, ∃ p > n, Nat.Prime p := by - intro n - have : 2 ≤ Nat.factorial (n + 1) + 1 := by - sorry - rcases exists_prime_factor this with ⟨p, pp, pdvd⟩ - refine' ⟨p, _, pp⟩ - show p > n - by_contra ple - push_neg at ple - have : p ∣ Nat.factorial (n + 1) := by - sorry - have : p ∣ 1 := by - sorry - show False - sorry + <div class="highlight-lean notranslate"><div class="highlight"><pre>theorem primes_infinite : ∀ n, ∃ p > n, Nat.Prime p := by + intro n + have : 2 ≤ Nat.factorial (n + 1) + 1 := by + sorry + rcases exists_prime_factor this with ⟨p, pp, pdvd⟩ + refine ⟨p, ?_, pp⟩ + show p > n + by_contra ple + push_neg at ple + have : p ∣ Nat.factorial (n + 1) := by + sorry + have : p ∣ 1 := by + sorry + show False + sorry </pre></div> </div> Let’s consider a variation of the proof above, where instead
- @@ -852,31 +852,31 @@ so they need to be expanded manually using equivalences like
 and <code class="docutils literal notranslate">Finset.mem_sdiff</code>. The <code class="docutils literal notranslate">ext</code> tactic can still be used to show that two finite sets are equal by showing that every element of one is an element of the other. - <div class="highlight-lean notranslate"><div class="highlight"><pre>open Finset + <div class="highlight-lean notranslate"><div class="highlight"><pre>open Finset section - variable {α : Type*} [DecidableEq α] (r s t : Finset α) + variable {α : Type*} [DecidableEq α] (r s t : Finset α) - example : r ∩ (s ∪ t) ⊆ r ∩ s ∪ r ∩ t := by - rw [subset_iff] - intro x - rw [mem_inter, mem_union, mem_union, mem_inter, mem_inter] - tauto + example : r ∩ (s ∪ t) ⊆ r ∩ s ∪ r ∩ t := by + rw [subset_iff] + intro x + rw [mem_inter, mem_union, mem_union, mem_inter, mem_inter] + tauto - example : r ∩ (s ∪ t) ⊆ r ∩ s ∪ r ∩ t := by - simp [subset_iff] - intro x - tauto + example : r ∩ (s ∪ t) ⊆ r ∩ s ∪ r ∩ t := by + simp [subset_iff] + intro x + tauto - example : r ∩ s ∪ r ∩ t ⊆ r ∩ (s ∪ t) := by - simp [subset_iff] - intro x - tauto + example : r ∩ s ∪ r ∩ t ⊆ r ∩ (s ∪ t) := by + simp [subset_iff] + intro x + tauto - example : r ∩ s ∪ r ∩ t = r ∩ (s ∪ t) := by - ext x - simp - tauto + example : r ∩ s ∪ r ∩ t = r ∩ (s ∪ t) := by + ext x + simp + tauto end </pre></div>
- @@ -885,27 +885,27 @@ that every element of one is an element of the other.
 version, <code class="docutils literal notranslate">tauto!</code>, which uses classical logic) can be used to dispense with propositional tautologies. See if you can use these methods to prove the two examples below. - <div class="highlight-lean notranslate"><div class="highlight"><pre>example : (r ∪ s) ∩ (r ∪ t) = r ∪ s ∩ t := by - sorry - example : (r \ s) \ t = r \ (s ∪ t) := by - sorry + <div class="highlight-lean notranslate"><div class="highlight"><pre>example : (r ∪ s) ∩ (r ∪ t) = r ∪ s ∩ t := by + sorry + example : (r \ s) \ t = r \ (s ∪ t) := by + sorry </pre></div> </div> The theorem <code class="docutils literal notranslate">Finset.dvd_prod_of_mem</code> tells us that if an <code class="docutils literal notranslate">n</code> is an element of a finite set <code class="docutils literal notranslate">s</code>, then <code class="docutils literal notranslate">n</code> divides <code class="docutils literal notranslate">∏ i in s, i</code>. - <div class="highlight-lean notranslate"><div class="highlight"><pre>example (s : Finset ℕ) (n : ℕ) (h : n ∈ s) : n ∣ ∏ i in s, i := - Finset.dvd_prod_of_mem _ h + <div class="highlight-lean notranslate"><div class="highlight"><pre>example (s : Finset ℕ) (n : ℕ) (h : n ∈ s) : n ∣ ∏ i in s, i := + Finset.dvd_prod_of_mem _ h </pre></div> </div> We also need to know that the converse holds in the case where <code class="docutils literal notranslate">n</code> is prime and <code class="docutils literal notranslate">s</code> is a set of primes. To show that, we need the following lemma, which you should be able to prove using the theorem <code class="docutils literal notranslate">Nat.Prime.eq_one_or_self_of_dvd</code>. - <div class="highlight-lean notranslate"><div class="highlight"><pre>theorem _root_.Nat.Prime.eq_of_dvd_of_prime {p q : ℕ} - (prime_p : Nat.Prime p) (prime_q : Nat.Prime q) (h : p ∣ q) : - p = q := by - sorry + <div class="highlight-lean notranslate"><div class="highlight"><pre>theorem _root_.Nat.Prime.eq_of_dvd_of_prime {p q : ℕ} + (prime_p : Nat.Prime p) (prime_q : Nat.Prime q) (h : p ∣ q) : + p = q := by + sorry </pre></div> </div> We can use this lemma to show that if a prime <code class="docutils literal notranslate">p</code> divides a product of a finite
- @@ -924,15 +924,15 @@ the relevant rewrite rules for the product.
 In the proof below, the first <code class="docutils literal notranslate">simp</code> applies <code class="docutils literal notranslate">Finset.prod_empty</code>. Step through the beginning of the proof to see the induction unfold, and then finish it off. - <div class="highlight-lean notranslate"><div class="highlight"><pre>theorem mem_of_dvd_prod_primes {s : Finset ℕ} {p : ℕ} (prime_p : p.Prime) : - (∀ n ∈ s, Nat.Prime n) → (p ∣ ∏ n in s, n) → p ∈ s := by - intro h₀ h₁ - induction' s using Finset.induction_on with a s ans ih - · simp at h₁ - linarith [prime_p.two_le] - simp [Finset.prod_insert ans, prime_p.dvd_mul] at h₀ h₁ - rw [mem_insert] - sorry + <div class="highlight-lean notranslate"><div class="highlight"><pre>theorem mem_of_dvd_prod_primes {s : Finset ℕ} {p : ℕ} (prime_p : p.Prime) : + (∀ n ∈ s, Nat.Prime n) → (p ∣ ∏ n in s, n) → p ∈ s := by + intro h₀ h₁ + induction' s using Finset.induction_on with a s ans ih + · simp at h₁ + linarith [prime_p.two_le] + simp [Finset.prod_insert ans, prime_p.dvd_mul] at h₀ h₁ + rw [mem_insert] + sorry </pre></div> </div> We need one last property of finite sets.
- @@ -942,8 +942,8 @@ we wrote <code class="docutils literal notranslate">{ <
 elements of <code class="docutils literal notranslate">s</code> that satisfy <code class="docutils literal notranslate">P</code>. Given <code class="docutils literal notranslate">s : Finset α</code>, the analogous notion is written <code class="docutils literal notranslate">s.filter P</code>. - <div class="highlight-lean notranslate"><div class="highlight"><pre>example (s : Finset ℕ) (x : ℕ) : x ∈ s.filter Nat.Prime ↔ x ∈ s ∧ x.Prime := - mem_filter + <div class="highlight-lean notranslate"><div class="highlight"><pre>example (s : Finset ℕ) (x : ℕ) : x ∈ s.filter Nat.Prime ↔ x ∈ s ∧ x.Prime := + mem_filter </pre></div> </div> We now prove an alternative formulation of the statement that there are infinitely many
- @@ -956,25 +956,25 @@ of the result
 leads to the contradiction we are looking for. See if you can complete the sketch below. You can use <code class="docutils literal notranslate">Finset.prod_pos</code> in the proof of the first <code class="docutils literal notranslate">have</code>. - <div class="highlight-lean notranslate"><div class="highlight"><pre>theorem primes_infinite' : ∀ s : Finset Nat, ∃ p, Nat.Prime p ∧ p ∉ s := by - intro s - by_contra h - push_neg at h - set s' := s.filter Nat.Prime with s'_def - have mem_s' : ∀ {n : ℕ}, n ∈ s' ↔ n.Prime := by - intro n - simp [s'_def] - apply h - have : 2 ≤ (∏ i in s', i) + 1 := by - sorry - rcases exists_prime_factor this with ⟨p, pp, pdvd⟩ - have : p ∣ ∏ i in s', i := by - sorry - have : p ∣ 1 := by - convert Nat.dvd_sub' pdvd this - simp - show False - sorry + <div class="highlight-lean notranslate"><div class="highlight"><pre>theorem primes_infinite' : ∀ s : Finset Nat, ∃ p, Nat.Prime p ∧ p ∉ s := by + intro s + by_contra h + push_neg at h + set s' := s.filter Nat.Prime with s'_def + have mem_s' : ∀ {n : ℕ}, n ∈ s' ↔ n.Prime := by + intro n + simp [s'_def] + apply h + have : 2 ≤ (∏ i in s', i) + 1 := by + sorry + rcases exists_prime_factor this with ⟨p, pp, pdvd⟩ + have : p ∣ ∏ i in s', i := by + sorry + have : p ∣ 1 := by + convert Nat.dvd_sub' pdvd this + simp + show False + sorry </pre></div> </div> We have thus seen two ways of saying that there are infinitely many primes:
- @@ -990,22 +990,22 @@ we can dispense with the assumption.
 ranges over <code class="docutils literal notranslate">s</code>, returning <code class="docutils literal notranslate">0</code> in the case where <code class="docutils literal notranslate">s</code> is empty and the codomain of <code class="docutils literal notranslate">f</code> is <code class="docutils literal notranslate">ℕ</code>. In the first proof, we use <code class="docutils literal notranslate">s.sup id</code>, where <code class="docutils literal notranslate">id</code> is the identity function, to refer to the maximum value in <code class="docutils literal notranslate">s</code>. - <div class="highlight-lean notranslate"><div class="highlight"><pre>theorem bounded_of_ex_finset (Q : ℕ → Prop) : - (∃ s : Finset ℕ, ∀ k, Q k → k ∈ s) → ∃ n, ∀ k, Q k → k < n := by - rintro ⟨s, hs⟩ - use s.sup id + 1 - intro k Qk - apply Nat.lt_succ_of_le - show id k ≤ s.sup id - apply le_sup (hs k Qk) + <div class="highlight-lean notranslate"><div class="highlight"><pre>theorem bounded_of_ex_finset (Q : ℕ → Prop) : + (∃ s : Finset ℕ, ∀ k, Q k → k ∈ s) → ∃ n, ∀ k, Q k → k < n := by + rintro ⟨s, hs⟩ + use s.sup id + 1 + intro k Qk + apply Nat.lt_succ_of_le + show id k ≤ s.sup id + apply le_sup (hs k Qk) - theorem ex_finset_of_bounded (Q : ℕ → Prop) [DecidablePred Q] : - (∃ n, ∀ k, Q k → k ≤ n) → ∃ s : Finset ℕ, ∀ k, Q k ↔ k ∈ s := by - rintro ⟨n, hn⟩ - use (range (n + 1)).filter Q - intro k - simp [Nat.lt_succ_iff] - exact hn k + theorem ex_finset_of_bounded (Q : ℕ → Prop) [DecidablePred Q] : + (∃ n, ∀ k, Q k → k ≤ n) → ∃ s : Finset ℕ, ∀ k, Q k ↔ k ∈ s := by + rintro ⟨n, hn⟩ + use (range (n + 1)).filter Q + intro k + simp [Nat.lt_succ_iff] + exact hn k </pre></div> </div> A small variation on our second proof that there are infinitely many primes
- @@ -1035,7 +1035,7 @@ But in that case, $p$ divide
 and hence 3, which contradicts the fact that it is not 3. In Lean, the notation <code class="docutils literal notranslate">n % m</code>, read “<code class="docutils literal notranslate">n</code> modulo <code class="docutils literal notranslate">m</code>,” denotes the remainder of the division of <code class="docutils literal notranslate">n</code> by <code class="docutils literal notranslate">m</code>. - <div class="highlight-lean notranslate"><div class="highlight"><pre>example : 27 % 4 = 3 := by norm_num + <div class="highlight-lean notranslate"><div class="highlight"><pre>example : 27 % 4 = 3 := by norm_num </pre></div> </div> We can then render the statement “<code class="docutils literal notranslate">n</code> is congruent to 3 modulo 4”
- @@ -1046,66 +1046,66 @@ a small number of cases.
 In the second named theorem, remember that the semicolon means that the subsequent tactic block is applied to all the goals created by the preceding tactic. - <div class="highlight-lean notranslate"><div class="highlight"><pre>example (n : ℕ) : (4 * n + 3) % 4 = 3 := by - rw [add_comm, Nat.add_mul_mod_self_left] + <div class="highlight-lean notranslate"><div class="highlight"><pre>example (n : ℕ) : (4 * n + 3) % 4 = 3 := by + rw [add_comm, Nat.add_mul_mod_self_left] - theorem mod_4_eq_3_or_mod_4_eq_3 {m n : ℕ} (h : m * n % 4 = 3) : m % 4 = 3 ∨ n % 4 = 3 := by - revert h - rw [Nat.mul_mod] - have : m % 4 < 4 := Nat.mod_lt m (by norm_num) - interval_cases m % 4 <;> simp [-Nat.mul_mod_mod] - have : n % 4 < 4 := Nat.mod_lt n (by norm_num) - interval_cases n % 4 <;> simp + theorem mod_4_eq_3_or_mod_4_eq_3 {m n : ℕ} (h : m * n % 4 = 3) : m % 4 = 3 ∨ n % 4 = 3 := by + revert h + rw [Nat.mul_mod] + have : m % 4 < 4 := Nat.mod_lt m (by norm_num) + interval_cases m % 4 <;> simp [-Nat.mul_mod_mod] + have : n % 4 < 4 := Nat.mod_lt n (by norm_num) + interval_cases n % 4 <;> simp - theorem two_le_of_mod_4_eq_3 {n : ℕ} (h : n % 4 = 3) : 2 ≤ n := by - apply two_le <;> - · intro neq - rw [neq] at h - norm_num at h + theorem two_le_of_mod_4_eq_3 {n : ℕ} (h : n % 4 = 3) : 2 ≤ n := by + apply two_le <;> + · intro neq + rw [neq] at h + norm_num at h </pre></div> </div> We will also need the following fact, which says that if <code class="docutils literal notranslate">m</code> is a nontrivial divisor of <code class="docutils literal notranslate">n</code>, then so is <code class="docutils literal notranslate">n / m</code>. See if you can complete the proof using <code class="docutils literal notranslate">Nat.div_dvd_of_dvd</code> and <code class="docutils literal notranslate">Nat.div_lt_self</code>. - <div class="highlight-lean notranslate"><div class="highlight"><pre>theorem aux {m n : ℕ} (h₀ : m ∣ n) (h₁ : 2 ≤ m) (h₂ : m < n) : n / m ∣ n ∧ n / m < n := by - sorry + <div class="highlight-lean notranslate"><div class="highlight"><pre>theorem aux {m n : ℕ} (h₀ : m ∣ n) (h₁ : 2 ≤ m) (h₂ : m < n) : n / m ∣ n ∧ n / m < n := by + sorry </pre></div> </div> Now put all the pieces together to prove that any number congruent to 3 modulo 4 has a prime divisor with that same property. - <div class="highlight-lean notranslate"><div class="highlight"><pre>theorem exists_prime_factor_mod_4_eq_3 {n : Nat} (h : n % 4 = 3) : - ∃ p : Nat, p.Prime ∧ p ∣ n ∧ p % 4 = 3 := by - by_cases np : n.Prime - · use n - induction' n using Nat.strong_induction_on with n ih - rw [Nat.prime_def_lt] at np - push_neg at np - rcases np (two_le_of_mod_4_eq_3 h) with ⟨m, mltn, mdvdn, mne1⟩ - have mge2 : 2 ≤ m := by - apply two_le _ mne1 - intro mz - rw [mz, zero_dvd_iff] at mdvdn - linarith - have neq : m * (n / m) = n := Nat.mul_div_cancel' mdvdn - have : m % 4 = 3 ∨ n / m % 4 = 3 := by - apply mod_4_eq_3_or_mod_4_eq_3 - rw [neq, h] - rcases this with h1 | h1 - . sorry - . sorry + <div class="highlight-lean notranslate"><div class="highlight"><pre>theorem exists_prime_factor_mod_4_eq_3 {n : Nat} (h : n % 4 = 3) : + ∃ p : Nat, p.Prime ∧ p ∣ n ∧ p % 4 = 3 := by + by_cases np : n.Prime + · use n + induction' n using Nat.strong_induction_on with n ih + rw [Nat.prime_def_lt] at np + push_neg at np + rcases np (two_le_of_mod_4_eq_3 h) with ⟨m, mltn, mdvdn, mne1⟩ + have mge2 : 2 ≤ m := by + apply two_le _ mne1 + intro mz + rw [mz, zero_dvd_iff] at mdvdn + linarith + have neq : m * (n / m) = n := Nat.mul_div_cancel' mdvdn + have : m % 4 = 3 ∨ n / m % 4 = 3 := by + apply mod_4_eq_3_or_mod_4_eq_3 + rw [neq, h] + rcases this with h1 | h1 + . sorry + . sorry </pre></div> </div> We are in the home stretch. Given a set <code class="docutils literal notranslate">s</code> of prime numbers, we need to talk about the result of removing 3 from that set, if it is present. The function <code class="docutils literal notranslate">Finset.erase</code> handles that. - <div class="highlight-lean notranslate"><div class="highlight"><pre>example (m n : ℕ) (s : Finset ℕ) (h : m ∈ erase s n) : m ≠ n ∧ m ∈ s := by - rwa [mem_erase] at h + <div class="highlight-lean notranslate"><div class="highlight"><pre>example (m n : ℕ) (s : Finset ℕ) (h : m ∈ erase s n) : m ≠ n ∧ m ∈ s := by + rwa [mem_erase] at h - example (m n : ℕ) (s : Finset ℕ) (h : m ∈ erase s n) : m ≠ n ∧ m ∈ s := by - simp at h - assumption + example (m n : ℕ) (s : Finset ℕ) (h : m ∈ erase s n) : m ≠ n ∧ m ∈ s := by + simp at h + assumption </pre></div> </div> We are now ready to prove that there are infinitely many primes
- @@ -1113,31 +1113,31 @@ congruent to 3 modulo 4.
 Fill in the missing parts below. Our solution uses <code class="docutils literal notranslate">Nat.dvd_add_iff_left</code> and <code class="docutils literal notranslate">Nat.dvd_sub'</code> along the way. - <div class="highlight-lean notranslate"><div class="highlight"><pre>theorem primes_mod_4_eq_3_infinite : ∀ n, ∃ p > n, Nat.Prime p ∧ p % 4 = 3 := by - by_contra h - push_neg at h - rcases h with ⟨n, hn⟩ - have : ∃ s : Finset Nat, ∀ p : ℕ, p.Prime ∧ p % 4 = 3 ↔ p ∈ s := by - apply ex_finset_of_bounded - use n - contrapose! hn - rcases hn with ⟨p, ⟨pp, p4⟩, pltn⟩ - exact ⟨p, pltn, pp, p4⟩ - rcases this with ⟨s, hs⟩ - have h₁ : ((4 * ∏ i in erase s 3, i) + 3) % 4 = 3 := by - sorry - rcases exists_prime_factor_mod_4_eq_3 h₁ with ⟨p, pp, pdvd, p4eq⟩ - have ps : p ∈ s := by - sorry - have pne3 : p ≠ 3 := by - sorry - have : p ∣ 4 * ∏ i in erase s 3, i := by - sorry - have : p ∣ 3 := by - sorry - have : p = 3 := by - sorry - contradiction + <div class="highlight-lean notranslate"><div class="highlight"><pre>theorem primes_mod_4_eq_3_infinite : ∀ n, ∃ p > n, Nat.Prime p ∧ p % 4 = 3 := by + by_contra h + push_neg at h + rcases h with ⟨n, hn⟩ + have : ∃ s : Finset Nat, ∀ p : ℕ, p.Prime ∧ p % 4 = 3 ↔ p ∈ s := by + apply ex_finset_of_bounded + use n + contrapose! hn + rcases hn with ⟨p, ⟨pp, p4⟩, pltn⟩ + exact ⟨p, pltn, pp, p4⟩ + rcases this with ⟨s, hs⟩ + have h₁ : ((4 * ∏ i in erase s 3, i) + 3) % 4 = 3 := by + sorry + rcases exists_prime_factor_mod_4_eq_3 h₁ with ⟨p, pp, pdvd, p4eq⟩ + have ps : p ∈ s := by + sorry + have pne3 : p ≠ 3 := by + sorry + have : p ∣ 4 * ∏ i in erase s 3, i := by + sorry + have : p ∣ 3 := by + sorry + have : p = 3 := by + sorry + contradiction </pre></div> </div> If you managed to complete the proof, congratulations! This has been a serious
html/C06_Structures.html
- @@ -18,7 +18,7 @@
 <script src="_static/jquery.js?v=5d32c60e"></script> <script src="_static/_sphinx_javascript_frameworks_compat.js?v=2cd50e6c"></script> <script src="_static/documentation_options.js?v=2709fde1"></script> - <script src="_static/doctools.js?v=888ff710"></script> + <script src="_static/doctools.js?v=9a2dae69"></script> <script src="_static/sphinx_highlight.js?v=dc90522c"></script> <script async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-mml-chtml.js"></script> <script src="_static/js/theme.js"></script>
- @@ -122,34 +122,34 @@ An instance of the structure is a particular bundle of data satisfying
 the constraints. For example, we can specify that a point is a tuple of three real numbers: <div class="highlight-lean notranslate"><div class="highlight"><pre>@[ext] - structure Point where - x : ℝ - y : ℝ - z : ℝ + structure Point where + x : ℝ + y : ℝ + z : ℝ </pre></div> </div> The <code class="docutils literal notranslate">@[ext]</code> annotation tells Lean to automatically generate theorems that can be used to prove that two instances of a structure are equal when their components are equal, a property known as extensionality. - <div class="highlight-lean notranslate"><div class="highlight"><pre>#check Point.ext + <div class="highlight-lean notranslate"><div class="highlight"><pre>#check Point.ext - example (a b : Point) (hx : a.x = b.x) (hy : a.y = b.y) (hz : a.z = b.z) : a = b := by - ext - repeat' assumption + example (a b : Point) (hx : a.x = b.x) (hy : a.y = b.y) (hz : a.z = b.z) : a = b := by + ext + repeat' assumption </pre></div> </div> We can then define particular instances of the <code class="docutils literal notranslate">Point</code> structure. Lean provides multiple ways of doing that. - <div class="highlight-lean notranslate"><div class="highlight"><pre>def myPoint1 : Point where - x := 2 - y := -1 - z := 4 + <div class="highlight-lean notranslate"><div class="highlight"><pre>def myPoint1 : Point where + x := 2 + y := -1 + z := 4 - def myPoint2 : Point := - ⟨2, -1, 4⟩ + def myPoint2 : Point := + ⟨2, -1, 4⟩ - def myPoint3 := - Point.mk 2 (-1) 4 + def myPoint3 := + Point.mk 2 (-1) 4 </pre></div> </div> In the first example, the fields of the structure are named
- @@ -158,12 +158,12 @@ The function <code class="docutils literal notranslate">Point.
 is known as the constructor for the <code class="docutils literal notranslate">Point</code> structure, because it serves to construct elements. You can specify a different name if you want, like <code class="docutils literal notranslate">build</code>. - <div class="highlight-lean notranslate"><div class="highlight"><pre>structure Point' where build :: - x : ℝ - y : ℝ - z : ℝ + <div class="highlight-lean notranslate"><div class="highlight"><pre>structure Point' where build :: + x : ℝ + y : ℝ + z : ℝ - #check Point'.build 2 (-1) 4 + #check Point'.build 2 (-1) 4 </pre></div> </div> The next two examples show how to define functions on structures.
- @@ -181,23 +181,23 @@ But remember that it is often convenient to use
 anonymous projection notation, which allows us to write <code class="docutils literal notranslate">a.add b</code> instead of <code class="docutils literal notranslate">Point.add a b</code>. Lean interprets the former as the latter because <code class="docutils literal notranslate">a</code> has type <code class="docutils literal notranslate">Point</code>. - <div class="highlight-lean notranslate"><div class="highlight"><pre>namespace Point + <div class="highlight-lean notranslate"><div class="highlight"><pre>namespace Point - def add (a b : Point) : Point := - ⟨a.x + b.x, a.y + b.y, a.z + b.z⟩ + def add (a b : Point) : Point := + ⟨a.x + b.x, a.y + b.y, a.z + b.z⟩ - def add' (a b : Point) : Point where - x := a.x + b.x - y := a.y + b.y - z := a.z + b.z + def add' (a b : Point) : Point where + x := a.x + b.x + y := a.y + b.y + z := a.z + b.z - #check add myPoint1 myPoint2 - #check myPoint1.add myPoint2 + #check add myPoint1 myPoint2 + #check myPoint1.add myPoint2 - end Point + end Point - #check Point.add myPoint1 myPoint2 - #check myPoint1.add myPoint2 + #check Point.add myPoint1 myPoint2 + #check myPoint1.add myPoint2 </pre></div> </div> Below we will continue to put definitions in the relevant
- @@ -210,18 +210,18 @@ Below we use the <code class="docutils literal notranslate">pr
 theorem is <code class="docutils literal notranslate">Point.add_comm</code>, even when the namespace is open. This is helpful when we want to avoid ambiguity with a generic theorem like <code class="docutils literal notranslate">add_comm</code>. - <div class="highlight-lean notranslate"><div class="highlight"><pre>protected theorem add_comm (a b : Point) : add a b = add b a := by - rw [add, add] - ext <;> dsimp - repeat' apply add_comm + <div class="highlight-lean notranslate"><div class="highlight"><pre>protected theorem add_comm (a b : Point) : add a b = add b a := by + rw [add, add] + ext <;> dsimp + repeat' apply add_comm - example (a b : Point) : add a b = add b a := by simp [add, add_comm] + example (a b : Point) : add a b = add b a := by simp [add, add_comm] </pre></div> </div> Because Lean can unfold definitions and simplify projections internally, sometimes the equations we want hold definitionally. - <div class="highlight-lean notranslate"><div class="highlight"><pre>theorem add_x (a b : Point) : (a.add b).x = a.x + b.x := - rfl + <div class="highlight-lean notranslate"><div class="highlight"><pre>theorem add_x (a b : Point) : (a.add b).x = a.x + b.x := + rfl </pre></div> </div> It is also possible to define functions on structures using
- @@ -234,20 +234,20 @@ in the second.
 Although it is sometimes convenient to define functions this way, and structural eta-reduction makes this alternative definitionally equivalent, it can make things less convenient in later proofs. In particular, <cite>rw [addAlt]</cite> leaves us with a messier goal view containing a <cite>match</cite> statement. - <div class="highlight-lean notranslate"><div class="highlight"><pre>def addAlt : Point → Point → Point - | Point.mk x₁ y₁ z₁, Point.mk x₂ y₂ z₂ => ⟨x₁ + x₂, y₁ + y₂, z₁ + z₂⟩ + <div class="highlight-lean notranslate"><div class="highlight"><pre>def addAlt : Point → Point → Point + | Point.mk x₁ y₁ z₁, Point.mk x₂ y₂ z₂ => ⟨x₁ + x₂, y₁ + y₂, z₁ + z₂⟩ - def addAlt' : Point → Point → Point - | ⟨x₁, y₁, z₁⟩, ⟨x₂, y₂, z₂⟩ => ⟨x₁ + x₂, y₁ + y₂, z₁ + z₂⟩ + def addAlt' : Point → Point → Point + | ⟨x₁, y₁, z₁⟩, ⟨x₂, y₂, z₂⟩ => ⟨x₁ + x₂, y₁ + y₂, z₁ + z₂⟩ - theorem addAlt_x (a b : Point) : (a.addAlt b).x = a.x + b.x := by - rfl + theorem addAlt_x (a b : Point) : (a.addAlt b).x = a.x + b.x := by + rfl - theorem addAlt_comm (a b : Point) : addAlt a b = addAlt b a := by - rw [addAlt, addAlt] - -- the same proof still works, but the goal view here is harder to read - ext <;> dsimp - repeat' apply add_comm + theorem addAlt_comm (a b : Point) : addAlt a b = addAlt b a := by + rw [addAlt, addAlt] + -- the same proof still works, but the goal view here is harder to read + ext <;> dsimp + repeat' apply add_comm </pre></div> </div> Mathematical constructions often involve taking apart bundled information and
- @@ -257,15 +257,15 @@ of doing this efficiently.
 As an exercise, try proving that <code class="docutils literal notranslate">Point.add</code> is associative. Then define scalar multiplication for a point and show that it distributes over addition. - <div class="highlight-lean notranslate"><div class="highlight"><pre>protected theorem add_assoc (a b c : Point) : (a.add b).add c = a.add (b.add c) := by - sorry + <div class="highlight-lean notranslate"><div class="highlight"><pre>protected theorem add_assoc (a b c : Point) : (a.add b).add c = a.add (b.add c) := by + sorry - def smul (r : ℝ) (a : Point) : Point := - sorry + def smul (r : ℝ) (a : Point) : Point := + sorry - theorem smul_distrib (r : ℝ) (a b : Point) : - (smul r a).add (smul r b) = smul r (a.add b) := by - sorry + theorem smul_distrib (r : ℝ) (a b : Point) : + (smul r a).add (smul r b) = smul r (a.add b) := by + sorry </pre></div> </div> Using structures is only the first step on the road to
- @@ -289,44 +289,44 @@ the equilateral triangle in three-space with vertices
 $(1, 0, 0)$, $(0, 1, 0)$, and $(0, 0, 1)$, together with its interior. We can represent it in Lean as follows: - <div class="highlight-lean notranslate"><div class="highlight"><pre>structure StandardTwoSimplex where - x : ℝ - y : ℝ - z : ℝ - x_nonneg : 0 ≤ x - y_nonneg : 0 ≤ y - z_nonneg : 0 ≤ z - sum_eq : x + y + z = 1 + <div class="highlight-lean notranslate"><div class="highlight"><pre>structure StandardTwoSimplex where + x : ℝ + y : ℝ + z : ℝ + x_nonneg : 0 ≤ x + y_nonneg : 0 ≤ y + z_nonneg : 0 ≤ z + sum_eq : x + y + z = 1 </pre></div> </div> Notice that the last four fields refer to <code class="docutils literal notranslate">x</code>, <code class="docutils literal notranslate">y</code>, and <code class="docutils literal notranslate">z</code>, that is, the first three fields. We can define a map from the two-simplex to itself that swaps <code class="docutils literal notranslate">x</code> and <code class="docutils literal notranslate">y</code>: - <div class="highlight-lean notranslate"><div class="highlight"><pre>def swapXy (a : StandardTwoSimplex) : StandardTwoSimplex - where - x := a.y - y := a.x - z := a.z - x_nonneg := a.y_nonneg - y_nonneg := a.x_nonneg - z_nonneg := a.z_nonneg - sum_eq := by rw [add_comm a.y a.x, a.sum_eq] + <div class="highlight-lean notranslate"><div class="highlight"><pre>def swapXy (a : StandardTwoSimplex) : StandardTwoSimplex + where + x := a.y + y := a.x + z := a.z + x_nonneg := a.y_nonneg + y_nonneg := a.x_nonneg + z_nonneg := a.z_nonneg + sum_eq := by rw [add_comm a.y a.x, a.sum_eq] </pre></div> </div> More interestingly, we can compute the midpoint of two points on the simplex. We have added the phrase <code class="docutils literal notranslate">noncomputable section</code> at the beginning of this file in order to use division on the real numbers. - <div class="highlight-lean notranslate"><div class="highlight"><pre>noncomputable section - - def midpoint (a b : StandardTwoSimplex) : StandardTwoSimplex - where - x := (a.x + b.x) / 2 - y := (a.y + b.y) / 2 - z := (a.z + b.z) / 2 - x_nonneg := div_nonneg (add_nonneg a.x_nonneg b.x_nonneg) (by norm_num) - y_nonneg := div_nonneg (add_nonneg a.y_nonneg b.y_nonneg) (by norm_num) - z_nonneg := div_nonneg (add_nonneg a.z_nonneg b.z_nonneg) (by norm_num) - sum_eq := by field_simp; linarith [a.sum_eq, b.sum_eq] + <div class="highlight-lean notranslate"><div class="highlight"><pre>noncomputable section + + def midpoint (a b : StandardTwoSimplex) : StandardTwoSimplex + where + x := (a.x + b.x) / 2 + y := (a.y + b.y) / 2 + z := (a.z + b.z) / 2 + x_nonneg := div_nonneg (add_nonneg a.x_nonneg b.x_nonneg) (by norm_num) + y_nonneg := div_nonneg (add_nonneg a.y_nonneg b.y_nonneg) (by norm_num) + z_nonneg := div_nonneg (add_nonneg a.z_nonneg b.z_nonneg) (by norm_num) + sum_eq := by field_simp; linarith [a.sum_eq, b.sum_eq] </pre></div> </div> Here we have established <code class="docutils literal notranslate">x_nonneg</code>, <code class="docutils literal notranslate">y_nonneg</code>, and <code class="docutils literal notranslate">z_nonneg</code>
- @@ -337,9 +337,9 @@ we can take the weighted average $\l
 of two points \(a$ and $b$ in the standard 2-simplex. We challenge you to define that function, in analogy to the <code class="docutils literal notranslate">midpoint</code> function above. - <div class="highlight-lean notranslate"><div class="highlight"><pre>def weightedAverage (lambda : Real) (lambda_nonneg : 0 ≤ lambda) (lambda_le : lambda ≤ 1) - (a b : StandardTwoSimplex) : StandardTwoSimplex := - sorry + <div class="highlight-lean notranslate"><div class="highlight"><pre>def weightedAverage (lambda : Real) (lambda_nonneg : 0 ≤ lambda) (lambda_le : lambda ≤ 1) + (a b : StandardTwoSimplex) : StandardTwoSimplex := + sorry </pre></div> </div> Structures can depend on parameters.
- @@ -348,29 +348,29 @@ For example, we can generalize the standard 2-simplex to the standard
 At this stage, you don’t have to know anything about the type <code class="docutils literal notranslate">Fin n</code> except that it has $n$ elements, and that Lean knows how to sum over it. - <div class="highlight-lean notranslate"><div class="highlight"><pre>open BigOperators - - structure StandardSimplex (n : ℕ) where - V : Fin n → ℝ - NonNeg : ∀ i : Fin n, 0 ≤ V i - sum_eq_one : (∑ i, V i) = 1 - - namespace StandardSimplex - - def midpoint (n : ℕ) (a b : StandardSimplex n) : StandardSimplex n - where - V i := (a.V i + b.V i) / 2 - NonNeg := by - intro i - apply div_nonneg - · linarith [a.NonNeg i, b.NonNeg i] - norm_num - sum_eq_one := by - simp [div_eq_mul_inv, ← Finset.sum_mul, Finset.sum_add_distrib, - a.sum_eq_one, b.sum_eq_one] - field_simp - - end StandardSimplex + <div class="highlight-lean notranslate"><div class="highlight"><pre>open BigOperators + + structure StandardSimplex (n : ℕ) where + V : Fin n → ℝ + NonNeg : ∀ i : Fin n, 0 ≤ V i + sum_eq_one : (∑ i, V i) = 1 + + namespace StandardSimplex + + def midpoint (n : ℕ) (a b : StandardSimplex n) : StandardSimplex n + where + V i := (a.V i + b.V i) / 2 + NonNeg := by + intro i + apply div_nonneg + · linarith [a.NonNeg i, b.NonNeg i] + norm_num + sum_eq_one := by + simp [div_eq_mul_inv, ← Finset.sum_mul, Finset.sum_add_distrib, + a.sum_eq_one, b.sum_eq_one] + field_simp + + end StandardSimplex </pre></div> </div> As an exercise, see if you can define the weighted average of
- @@ -383,15 +383,15 @@ Interestingly, they can also be used to bundle together properties
 without the data. For example, the next structure, <code class="docutils literal notranslate">IsLinear</code>, bundles together the two components of linearity. - <div class="highlight-lean notranslate"><div class="highlight"><pre>structure IsLinear (f : ℝ → ℝ) where - is_additive : ∀ x y, f (x + y) = f x + f y - preserves_mul : ∀ x c, f (c * x) = c * f x + <div class="highlight-lean notranslate"><div class="highlight"><pre>structure IsLinear (f : ℝ → ℝ) where + is_additive : ∀ x y, f (x + y) = f x + f y + preserves_mul : ∀ x c, f (c * x) = c * f x section - variable (f : ℝ → ℝ) (linf : IsLinear f) + variable (f : ℝ → ℝ) (linf : IsLinear f) - #check linf.is_additive - #check linf.preserves_mul + #check linf.is_additive + #check linf.preserves_mul end </pre></div>
- @@ -400,11 +400,11 @@ the two components of linearity.
 together data. The <code class="docutils literal notranslate">Point</code> data structure can be defined using the generic type product, and <code class="docutils literal notranslate">IsLinear</code> can be defined with a simple <code class="docutils literal notranslate">and</code>. - <div class="highlight-lean notranslate"><div class="highlight"><pre>def Point'' := - ℝ × ℝ × ℝ + <div class="highlight-lean notranslate"><div class="highlight"><pre>def Point'' := + ℝ × ℝ × ℝ - def IsLinear' (f : ℝ → ℝ) := - (∀ x y, f (x + y) = f x + f y) ∧ ∀ x c, f (c * x) = c * f x + def IsLinear' (f : ℝ → ℝ) := + (∀ x y, f (x + y) = f x + f y) ∧ ∀ x c, f (c * x) = c * f x </pre></div> </div> Generic type constructions can even be used in place of structures
- @@ -417,42 +417,42 @@ Any <code class="docutils literal notranslate">x x.val</code>, which has type <code class="docutils literal notranslate">ℝ</code>, and <code class="docutils literal notranslate">x.property</code>, which represents the fact <code class="docutils literal notranslate">0 < x.val</code>. - <div class="highlight-lean notranslate"><div class="highlight"><pre>def PReal := - { y : ℝ // 0 < y } + <div class="highlight-lean notranslate"><div class="highlight"><pre>def PReal := + { y : ℝ // 0 < y } section - variable (x : PReal) + variable (x : PReal) - #check x.val - #check x.property - #check x.1 - #check x.2 + #check x.val + #check x.property + #check x.1 + #check x.2 end </pre></div> </div> We could have used subtypes to define the standard 2-simplex, as well as the standard $n$-simplex for an arbitrary $n$. - <div class="highlight-lean notranslate"><div class="highlight"><pre>def StandardTwoSimplex' := - { p : ℝ × ℝ × ℝ // 0 ≤ p.1 ∧ 0 ≤ p.2.1 ∧ 0 ≤ p.2.2 ∧ p.1 + p.2.1 + p.2.2 = 1 } + <div class="highlight-lean notranslate"><div class="highlight"><pre>def StandardTwoSimplex' := + { p : ℝ × ℝ × ℝ // 0 ≤ p.1 ∧ 0 ≤ p.2.1 ∧ 0 ≤ p.2.2 ∧ p.1 + p.2.1 + p.2.2 = 1 } - def StandardSimplex' (n : ℕ) := - { v : Fin n → ℝ // (∀ i : Fin n, 0 ≤ v i) ∧ (∑ i, v i) = 1 } + def StandardSimplex' (n : ℕ) := + { v : Fin n → ℝ // (∀ i : Fin n, 0 ≤ v i) ∧ (∑ i, v i) = 1 } </pre></div> </div> Similarly, Sigma types are generalizations of ordered pairs, whereby the type of the second component depends on the type of the first. - <div class="highlight-lean notranslate"><div class="highlight"><pre>def StdSimplex := Σ n : ℕ, StandardSimplex n + <div class="highlight-lean notranslate"><div class="highlight"><pre>def StdSimplex := Σ n : ℕ, StandardSimplex n section - variable (s : StdSimplex) + variable (s : StdSimplex) - #check s.fst - #check s.snd + #check s.fst + #check s.snd - #check s.1 - #check s.2 + #check s.1 + #check s.2 end </pre></div>
- @@ -593,14 +593,14 @@ this is exactly what the <code class="docutils literal notranslate"> Given a data type <code class="docutils literal notranslate">α</code>, we can define the group structure on <code class="docutils literal notranslate">α</code> as follows. - <div class="highlight-lean notranslate"><div class="highlight"><pre>structure Group₁ (α : Type*) where - mul : α → α → α - one : α - inv : α → α - mul_assoc : ∀ x y z : α, mul (mul x y) z = mul x (mul y z) - mul_one : ∀ x : α, mul x one = x - one_mul : ∀ x : α, mul one x = x - mul_left_inv : ∀ x : α, mul (inv x) x = one + <div class="highlight-lean notranslate"><div class="highlight"><pre>structure Group₁ (α : Type*) where + mul : α → α → α + one : α + inv : α → α + mul_assoc : ∀ x y z : α, mul (mul x y) z = mul x (mul y z) + mul_one : ∀ x : α, mul x one = x + one_mul : ∀ x : α, mul one x = x + mul_left_inv : ∀ x : α, mul (inv x) x = one </pre></div> </div> Notice that the type <code class="docutils literal notranslate">α</code> is a parameter in the definition of <code class="docutils literal notranslate">group₁</code>.
- @@ -629,9 +629,9 @@ morally the same as the definition of a group that Mathlib uses.
 the type together with the structure, and Mathlib also contains a definition of a <code class="docutils literal notranslate">GroupCat</code> structure that is equivalent to the following: - <div class="highlight-lean notranslate"><div class="highlight"><pre>structure Group₁Cat where - α : Type* - str : Group₁ α + <div class="highlight-lean notranslate"><div class="highlight"><pre>structure Group₁Cat where + α : Type* + str : Group₁ α </pre></div> </div> The Mathlib version is found in <code class="docutils literal notranslate">Mathlib.Algebra.Category.GroupCat.Basic</code>,
- @@ -654,17 +654,17 @@ a function <code class="docutils literal notranslate">f.toFun<
 the inverse function <code class="docutils literal notranslate">f.invFun</code> from <code class="docutils literal notranslate">β</code> to <code class="docutils literal notranslate">α</code>, and two properties that specify these functions are indeed inverse to one another. - <div class="highlight-lean notranslate"><div class="highlight"><pre>variable (α β γ : Type*) - variable (f : α ≃ β) (g : β ≃ γ) - - #check Equiv α β - #check (f.toFun : α → β) - #check (f.invFun : β → α) - #check (f.right_inv : ∀ x : β, f (f.invFun x) = x) - #check (f.left_inv : ∀ x : α, f.invFun (f x) = x) - #check (Equiv.refl α : α ≃ α) - #check (f.symm : β ≃ α) - #check (f.trans g : α ≃ γ) + <div class="highlight-lean notranslate"><div class="highlight"><pre>variable (α β γ : Type*) + variable (f : α ≃ β) (g : β ≃ γ) + + #check Equiv α β + #check (f.toFun : α → β) + #check (f.invFun : β → α) + #check (f.right_inv : ∀ x : β, f (f.invFun x) = x) + #check (f.left_inv : ∀ x : α, f.invFun (f x) = x) + #check (Equiv.refl α : α ≃ α) + #check (f.symm : β ≃ α) + #check (f.trans g : α ≃ γ) </pre></div> </div> Notice the creative naming of the last three constructions. We think of the
- @@ -675,20 +675,20 @@ that the property of being in bijective correspondence is an equivalence relatio
 in reverse order. Mathlib has declared a coercion from <code class="docutils literal notranslate">Equiv α β</code> to the function type <code class="docutils literal notranslate">α → β</code>, so we can omit writing <code class="docutils literal notranslate">.toFun</code> and have Lean insert it for us. - <div class="highlight-lean notranslate"><div class="highlight"><pre>example (x : α) : (f.trans g).toFun x = g.toFun (f.toFun x) := - rfl + <div class="highlight-lean notranslate"><div class="highlight"><pre>example (x : α) : (f.trans g).toFun x = g.toFun (f.toFun x) := + rfl - example (x : α) : (f.trans g) x = g (f x) := - rfl + example (x : α) : (f.trans g) x = g (f x) := + rfl - example : (f.trans g : α → γ) = g ∘ f := - rfl + example : (f.trans g : α → γ) = g ∘ f := + rfl </pre></div> </div> Mathlib also defines the type <code class="docutils literal notranslate">perm α</code> of equivalences between <code class="docutils literal notranslate">α</code> and itself. - <div class="highlight-lean notranslate"><div class="highlight"><pre>example (α : Type*) : Equiv.Perm α = (α ≃ α) := - rfl + <div class="highlight-lean notranslate"><div class="highlight"><pre>example (α : Type*) : Equiv.Perm α = (α ≃ α) := + rfl </pre></div> </div> It should be clear that <code class="docutils literal notranslate">Equiv.Perm α</code> forms a group under composition
- @@ -696,15 +696,15 @@ of equivalences. We orient things so that <code class="docutils literal notransl
 equal to <code class="docutils literal notranslate">g.trans f</code>, whose forward function is <code class="docutils literal notranslate">f ∘ g</code>. In other words, multiplication is what we ordinarily think of as composition of the bijections. Here we define this group: - <div class="highlight-lean notranslate"><div class="highlight"><pre>def permGroup {α : Type*} : Group₁ (Equiv.Perm α) - where - mul f g := Equiv.trans g f - one := Equiv.refl α - inv := Equiv.symm - mul_assoc f g h := (Equiv.trans_assoc _ _ _).symm - one_mul := Equiv.trans_refl - mul_one := Equiv.refl_trans - mul_left_inv := Equiv.self_trans_symm + <div class="highlight-lean notranslate"><div class="highlight"><pre>def permGroup {α : Type*} : Group₁ (Equiv.Perm α) + where + mul f g := Equiv.trans g f + one := Equiv.refl α + inv := Equiv.symm + mul_assoc f g h := (Equiv.trans_assoc _ _ _).symm + one_mul := Equiv.trans_refl + mul_one := Equiv.refl_trans + mul_left_inv := Equiv.self_trans_symm </pre></div> </div> In fact, Mathlib defines exactly this <code class="docutils literal notranslate">Group</code> structure on <code class="docutils literal notranslate">Equiv.Perm α</code>
- @@ -738,27 +738,27 @@ to the <code class="docutils literal notranslate">Group₁
 additive naming scheme just described. Define negation and a zero on the <code class="docutils literal notranslate">Point</code> data type, and define the <code class="docutils literal notranslate">AddGroup₁</code> structure on <code class="docutils literal notranslate">Point</code>. - <div class="highlight-lean notranslate"><div class="highlight"><pre>structure AddGroup₁ (α : Type*) where - (add : α → α → α) - -- fill in the rest + <div class="highlight-lean notranslate"><div class="highlight"><pre>structure AddGroup₁ (α : Type*) where + (add : α → α → α) + -- fill in the rest @[ext] - structure Point where - x : ℝ - y : ℝ - z : ℝ + structure Point where + x : ℝ + y : ℝ + z : ℝ - namespace Point + namespace Point - def add (a b : Point) : Point := - ⟨a.x + b.x, a.y + b.y, a.z + b.z⟩ + def add (a b : Point) : Point := + ⟨a.x + b.x, a.y + b.y, a.z + b.z⟩ - def neg (a : Point) : Point := sorry + def neg (a : Point) : Point := sorry - def zero : Point := sorry + def zero : Point := sorry - def addGroupPoint : AddGroup₁ Point := sorry + def addGroupPoint : AddGroup₁ Point := sorry - end Point + end Point </pre></div> </div> We are making progress.
- @@ -772,21 +772,21 @@ and we want to arrange it so that we can prove a theorem about
 a structure and use it with any instance. In fact, Mathlib is already set up to use generic group notation, definitions, and theorems for <code class="docutils literal notranslate">Equiv.Perm α</code>. - <div class="highlight-lean notranslate"><div class="highlight"><pre>variable {α : Type*} (f g : Equiv.Perm α) (n : ℕ) + <div class="highlight-lean notranslate"><div class="highlight"><pre>variable {α : Type*} (f g : Equiv.Perm α) (n : ℕ) - #check f * g - #check mul_assoc f g g⁻¹ + #check f * g + #check mul_assoc f g g⁻¹ -- group power, defined for any group - #check g ^ n + #check g ^ n - example : f * g * g⁻¹ = f := by rw [mul_assoc, mul_right_inv, mul_one] + example : f * g * g⁻¹ = f := by rw [mul_assoc, mul_right_inv, mul_one] - example : f * g * g⁻¹ = f := - mul_inv_cancel_right f g + example : f * g * g⁻¹ = f := + mul_inv_cancel_right f g - example {α : Type*} (f g : Equiv.Perm α) : g.symm.trans (g.trans f) = f := - mul_inv_cancel_right f g + example {α : Type*} (f g : Equiv.Perm α) : g.symm.trans (g.trans f) = f := + mul_inv_cancel_right f g </pre></div> </div> You can check that this is not the case for the additive group structure
- @@ -850,41 +850,41 @@ Lean. As with the names of class variables, we are allowed to leave the
 name of an instance definition anonymous, since in general we intend Lean to find it and put it to use without troubling us with the details. - <div class="highlight-lean notranslate"><div class="highlight"><pre>class Group₂ (α : Type*) where - mul : α → α → α - one : α - inv : α → α - mul_assoc : ∀ x y z : α, mul (mul x y) z = mul x (mul y z) - mul_one : ∀ x : α, mul x one = x - one_mul : ∀ x : α, mul one x = x - mul_left_inv : ∀ x : α, mul (inv x) x = one - - instance {α : Type*} : Group₂ (Equiv.Perm α) where - mul f g := Equiv.trans g f - one := Equiv.refl α - inv := Equiv.symm - mul_assoc f g h := (Equiv.trans_assoc _ _ _).symm - one_mul := Equiv.trans_refl - mul_one := Equiv.refl_trans - mul_left_inv := Equiv.self_trans_symm + <div class="highlight-lean notranslate"><div class="highlight"><pre>class Group₂ (α : Type*) where + mul : α → α → α + one : α + inv : α → α + mul_assoc : ∀ x y z : α, mul (mul x y) z = mul x (mul y z) + mul_one : ∀ x : α, mul x one = x + one_mul : ∀ x : α, mul one x = x + mul_left_inv : ∀ x : α, mul (inv x) x = one + + instance {α : Type*} : Group₂ (Equiv.Perm α) where + mul f g := Equiv.trans g f + one := Equiv.refl α + inv := Equiv.symm + mul_assoc f g h := (Equiv.trans_assoc _ _ _).symm + one_mul := Equiv.trans_refl + mul_one := Equiv.refl_trans + mul_left_inv := Equiv.self_trans_symm </pre></div> </div> The following illustrates their use. - <div class="highlight-lean notranslate"><div class="highlight"><pre>#check Group₂.mul + <div class="highlight-lean notranslate"><div class="highlight"><pre>#check Group₂.mul - def mySquare {α : Type*} [Group₂ α] (x : α) := - Group₂.mul x x + def mySquare {α : Type*} [Group₂ α] (x : α) := + Group₂.mul x x - #check mySquare + #check mySquare section - variable {β : Type*} (f g : Equiv.Perm β) + variable {β : Type*} (f g : Equiv.Perm β) - example : Group₂.mul f g = g.trans f := - rfl + example : Group₂.mul f g = g.trans f := + rfl - example : mySquare f = f.trans f := - rfl + example : mySquare f = f.trans f := + rfl end </pre></div>
- @@ -917,12 +917,12 @@ element of a list, can return the default value when the list is empty.
 To make that work, the Lean library defines a class <code class="docutils literal notranslate">Inhabited α</code>, which does nothing more than store a default value. We can show that the <code class="docutils literal notranslate">Point</code> type is an instance: - <div class="highlight-lean notranslate"><div class="highlight"><pre>instance : Inhabited Point where default := ⟨0, 0, 0⟩ + <div class="highlight-lean notranslate"><div class="highlight"><pre>instance : Inhabited Point where default := ⟨0, 0, 0⟩ - #check (default : Point) + #check (default : Point) - example : ([] : List Point).headI = default := - rfl + example : ([] : List Point).headI = default := + rfl </pre></div> </div> The class inference mechanism is also used for generic notation.
- @@ -932,15 +932,15 @@ a binary function on <code class="docutils literal notranslate">x + y</code> tells Lean to find a registered instance of <code class="docutils literal notranslate">[Add.add α]</code> and use the corresponding function. Below, we register the addition function for <code class="docutils literal notranslate">Point</code>. - <div class="highlight-lean notranslate"><div class="highlight"><pre>instance : Add Point where add := Point.add + <div class="highlight-lean notranslate"><div class="highlight"><pre>instance : Add Point where add := Point.add section - variable (x y : Point) + variable (x y : Point) - #check x + y + #check x + y - example : x + y = Point.add x y := - rfl + example : x + y = Point.add x y := + rfl end </pre></div>
- @@ -954,22 +954,22 @@ When we define a new instance of a ring in Lean,
 we don’t have to define <code class="docutils literal notranslate">+</code> and <code class="docutils literal notranslate">*</code> for that instance, because Lean knows that these are defined for every ring. We can use this method to specify notation for our <code class="docutils literal notranslate">Group₂</code> class: - <div class="highlight-lean notranslate"><div class="highlight"><pre>instance hasMulGroup₂ {α : Type*} [Group₂ α] : Mul α := - ⟨Group₂.mul⟩ + <div class="highlight-lean notranslate"><div class="highlight"><pre>instance hasMulGroup₂ {α : Type*} [Group₂ α] : Mul α := + ⟨Group₂.mul⟩ - instance hasOneGroup₂ {α : Type*} [Group₂ α] : One α := - ⟨Group₂.one⟩ + instance hasOneGroup₂ {α : Type*} [Group₂ α] : One α := + ⟨Group₂.one⟩ - instance hasInvGroup₂ {α : Type*} [Group₂ α] : Inv α := - ⟨Group₂.inv⟩ + instance hasInvGroup₂ {α : Type*} [Group₂ α] : Inv α := + ⟨Group₂.inv⟩ section - variable {α : Type*} (f g : Equiv.Perm α) + variable {α : Type*} (f g : Equiv.Perm α) - #check f * 1 * g⁻¹ + #check f * 1 * g⁻¹ - def foo : f * 1 * g⁻¹ = g.symm.trans ((Equiv.refl α).trans f) := - rfl + def foo : f * 1 * g⁻¹ = g.symm.trans ((Equiv.refl α).trans f) := + rfl end </pre></div>
- @@ -1008,9 +1008,9 @@ using the classes <code class="docutils literal notranslate">A
 Then show <code class="docutils literal notranslate">Point</code> is an instance of <code class="docutils literal notranslate">AddGroup₂</code>. Try it out and make sure that the additive group notation works for elements of <code class="docutils literal notranslate">Point</code>. - <div class="highlight-lean notranslate"><div class="highlight"><pre>class AddGroup₂ (α : Type*) where - add : α → α → α - -- fill in the rest + <div class="highlight-lean notranslate"><div class="highlight"><pre>class AddGroup₂ (α : Type*) where + add : α → α → α + -- fill in the rest </pre></div> </div> It is not a big problem that we have already declared instances
- @@ -1037,9 +1037,9 @@ here is to define them as a data type in their own right. We do this by
 representing a Gaussian integer as a pair of integers, which we think of as the real and imaginary parts. <div class="highlight-lean notranslate"><div class="highlight"><pre>@[ext] - structure GaussInt where - re : ℤ - im : ℤ + structure GaussInt where + re : ℤ + im : ℤ </pre></div> </div> We first show that the Gaussian integers have the structure of a ring,
- @@ -1051,20 +1051,20 @@ be a square root of $-1$. Th
 \[\begin{split}(a + bi) (c + di) & = ac + bci + adi + bd i^2 \\ & = (ac - bd) + (bc + ad)i.\end{split}\]</div> This explains the definition of <code class="docutils literal notranslate">Mul</code> below. - <div class="highlight-lean notranslate"><div class="highlight"><pre>instance : Zero GaussInt := - ⟨⟨0, 0⟩⟩ + <div class="highlight-lean notranslate"><div class="highlight"><pre>instance : Zero GaussInt := + ⟨⟨0, 0⟩⟩ - instance : One GaussInt := - ⟨⟨1, 0⟩⟩ + instance : One GaussInt := + ⟨⟨1, 0⟩⟩ - instance : Add GaussInt := - ⟨fun x y ↦ ⟨x.re + y.re, x.im + y.im⟩⟩ + instance : Add GaussInt := + ⟨fun x y ↦ ⟨x.re + y.re, x.im + y.im⟩⟩ - instance : Neg GaussInt := - ⟨fun x ↦ ⟨-x.re, -x.im⟩⟩ + instance : Neg GaussInt := + ⟨fun x ↦ ⟨-x.re, -x.im⟩⟩ - instance : Mul GaussInt := - ⟨fun x y ↦ ⟨x.re * y.re - x.im * y.im, x.re * y.im + x.im * y.re⟩⟩ + instance : Mul GaussInt := + ⟨fun x y ↦ ⟨x.re * y.re - x.im * y.im, x.re * y.im + x.im * y.re⟩⟩ </pre></div> </div> As noted in <a class="reference internal" href="#section-structures">Section 6.1</a>, it is a good idea to put all the definitions
- @@ -1076,64 +1076,64 @@ files associated with this chapter, these definitions are made in the
 <code class="docutils literal notranslate">GaussInt.zero</code> and the like and assigning the notation to those. It is often useful to have an explicit name for the definitions, for example, to use with <code class="docutils literal notranslate">simp</code> and <code class="docutils literal notranslate">rewrite</code>. - <div class="highlight-lean notranslate"><div class="highlight"><pre>theorem zero_def : (0 : GaussInt) = ⟨0, 0⟩ := - rfl + <div class="highlight-lean notranslate"><div class="highlight"><pre>theorem zero_def : (0 : GaussInt) = ⟨0, 0⟩ := + rfl - theorem one_def : (1 : GaussInt) = ⟨1, 0⟩ := - rfl + theorem one_def : (1 : GaussInt) = ⟨1, 0⟩ := + rfl - theorem add_def (x y : GaussInt) : x + y = ⟨x.re + y.re, x.im + y.im⟩ := - rfl + theorem add_def (x y : GaussInt) : x + y = ⟨x.re + y.re, x.im + y.im⟩ := + rfl - theorem neg_def (x : GaussInt) : -x = ⟨-x.re, -x.im⟩ := - rfl + theorem neg_def (x : GaussInt) : -x = ⟨-x.re, -x.im⟩ := + rfl - theorem mul_def (x y : GaussInt) : - x * y = ⟨x.re * y.re - x.im * y.im, x.re * y.im + x.im * y.re⟩ := - rfl + theorem mul_def (x y : GaussInt) : + x * y = ⟨x.re * y.re - x.im * y.im, x.re * y.im + x.im * y.re⟩ := + rfl </pre></div> </div> It is also useful to name the rules that compute the real and imaginary parts, and to declare them to the simplifier. <div class="highlight-lean notranslate"><div class="highlight"><pre>@[simp] - theorem zero_re : (0 : GaussInt).re = 0 := - rfl + theorem zero_re : (0 : GaussInt).re = 0 := + rfl @[simp] - theorem zero_im : (0 : GaussInt).im = 0 := - rfl + theorem zero_im : (0 : GaussInt).im = 0 := + rfl @[simp] - theorem one_re : (1 : GaussInt).re = 1 := - rfl + theorem one_re : (1 : GaussInt).re = 1 := + rfl @[simp] - theorem one_im : (1 : GaussInt).im = 0 := - rfl + theorem one_im : (1 : GaussInt).im = 0 := + rfl @[simp] - theorem add_re (x y : GaussInt) : (x + y).re = x.re + y.re := - rfl + theorem add_re (x y : GaussInt) : (x + y).re = x.re + y.re := + rfl @[simp] - theorem add_im (x y : GaussInt) : (x + y).im = x.im + y.im := - rfl + theorem add_im (x y : GaussInt) : (x + y).im = x.im + y.im := + rfl @[simp] - theorem neg_re (x : GaussInt) : (-x).re = -x.re := - rfl + theorem neg_re (x : GaussInt) : (-x).re = -x.re := + rfl @[simp] - theorem neg_im (x : GaussInt) : (-x).im = -x.im := - rfl + theorem neg_im (x : GaussInt) : (-x).im = -x.im := + rfl @[simp] - theorem mul_re (x y : GaussInt) : (x * y).re = x.re * y.re - x.im * y.im := - rfl + theorem mul_re (x y : GaussInt) : (x * y).re = x.re * y.re - x.im * y.im := + rfl @[simp] - theorem mul_im (x y : GaussInt) : (x * y).im = x.re * y.im + x.im * y.re := - rfl + theorem mul_im (x y : GaussInt) : (x * y).im = x.re * y.im + x.im * y.re := + rfl </pre></div> </div> It is now surprisingly easy to show that the Gaussian integers are an instance
- @@ -1157,63 +1157,63 @@ to reduce the identities to their real and imaginary components,
 simplifying, and, if necessary, carrying out the relevant ring calculation in the integers. Note that we could easily avoid repeating all this code, but this is not the topic of the current discussion. - <div class="highlight-lean notranslate"><div class="highlight"><pre>instance instCommRing : CommRing GaussInt where - zero := 0 - one := 1 - add := (· + ·) - neg x := -x - mul := (· * ·) - nsmul := nsmulRec - zsmul := zsmulRec - add_assoc := by - intros - ext <;> simp <;> ring - zero_add := by - intro - ext <;> simp - add_zero := by - intro - ext <;> simp - add_left_neg := by - intro - ext <;> simp - add_comm := by - intros - ext <;> simp <;> ring - mul_assoc := by - intros - ext <;> simp <;> ring - one_mul := by - intro - ext <;> simp - mul_one := by - intro - ext <;> simp - left_distrib := by - intros - ext <;> simp <;> ring - right_distrib := by - intros - ext <;> simp <;> ring - mul_comm := by - intros - ext <;> simp <;> ring - zero_mul := by - intros - ext <;> simp - mul_zero := by - intros - ext <;> simp + <div class="highlight-lean notranslate"><div class="highlight"><pre>instance instCommRing : CommRing GaussInt where + zero := 0 + one := 1 + add := (· + ·) + neg x := -x + mul := (· * ·) + nsmul := nsmulRec + zsmul := zsmulRec + add_assoc := by + intros + ext <;> simp <;> ring + zero_add := by + intro + ext <;> simp + add_zero := by + intro + ext <;> simp + add_left_neg := by + intro + ext <;> simp + add_comm := by + intros + ext <;> simp <;> ring + mul_assoc := by + intros + ext <;> simp <;> ring + one_mul := by + intro + ext <;> simp + mul_one := by + intro + ext <;> simp + left_distrib := by + intros + ext <;> simp <;> ring + right_distrib := by + intros + ext <;> simp <;> ring + mul_comm := by + intros + ext <;> simp <;> ring + zero_mul := by + intros + ext <;> simp + mul_zero := by + intros + ext <;> simp </pre></div> </div> Lean’s library defines the class of nontrivial types to be types with at least two distinct elements. In the context of a ring, this is equivalent to saying that the zero is not equal to the one. Since some common theorems depend on that fact, we may as well establish it now. - <div class="highlight-lean notranslate"><div class="highlight"><pre>instance : Nontrivial GaussInt := by - use 0, 1 - rw [Ne, GaussInt.ext_iff] - simp + <div class="highlight-lean notranslate"><div class="highlight"><pre>instance : Nontrivial GaussInt := by + use 0, 1 + rw [Ne, GaussInt.ext_iff] + simp </pre></div> </div> We will now show that the Gaussian integers have an important additional
- @@ -1231,14 +1231,14 @@ In that case, we can take $q$$a$ by $b$ and $r$ to be the remainder. These functions are defined in Lean so that the satisfy the following: - <div class="highlight-lean notranslate"><div class="highlight"><pre>example (a b : ℤ) : a = b * (a / b) + a % b := - Eq.symm (Int.ediv_add_emod a b) + <div class="highlight-lean notranslate"><div class="highlight"><pre>example (a b : ℤ) : a = b * (a / b) + a % b := + Eq.symm (Int.ediv_add_emod a b) - example (a b : ℤ) : b ≠ 0 → 0 ≤ a % b := - Int.emod_nonneg a + example (a b : ℤ) : b ≠ 0 → 0 ≤ a % b := + Int.emod_nonneg a - example (a b : ℤ) : b ≠ 0 → a % b < |b| := - Int.emod_lt a + example (a b : ℤ) : b ≠ 0 → a % b < |b| := + Int.emod_lt a </pre></div> </div> In an arbitrary ring, an element $a$ is said to be a unit if it divides
- @@ -1326,38 +1326,38 @@ We are grateful to Heather Macbeth for suggesting the following more
 elegant approach, which avoids definition by cases. We simply add <code class="docutils literal notranslate">b / 2</code> to <code class="docutils literal notranslate">a</code> before dividing and then subtract it from the remainder. - <div class="highlight-lean notranslate"><div class="highlight"><pre>def div' (a b : ℤ) := - (a + b / 2) / b - - def mod' (a b : ℤ) := - (a + b / 2) % b - b / 2 - - theorem div'_add_mod' (a b : ℤ) : b * div' a b + mod' a b = a := by - rw [div', mod'] - linarith [Int.ediv_add_emod (a + b / 2) b] - - theorem abs_mod'_le (a b : ℤ) (h : 0 < b) : |mod' a b| ≤ b / 2 := by - rw [mod', abs_le] - constructor - · linarith [Int.emod_nonneg (a + b / 2) h.ne'] - have := Int.emod_lt_of_pos (a + b / 2) h - have := Int.ediv_add_emod b 2 - have := Int.emod_lt_of_pos b zero_lt_two - revert this; intro this -- FIXME, this should not be needed - linarith + <div class="highlight-lean notranslate"><div class="highlight"><pre>def div' (a b : ℤ) := + (a + b / 2) / b + + def mod' (a b : ℤ) := + (a + b / 2) % b - b / 2 + + theorem div'_add_mod' (a b : ℤ) : b * div' a b + mod' a b = a := by + rw [div', mod'] + linarith [Int.ediv_add_emod (a + b / 2) b] + + theorem abs_mod'_le (a b : ℤ) (h : 0 < b) : |mod' a b| ≤ b / 2 := by + rw [mod', abs_le] + constructor + · linarith [Int.emod_nonneg (a + b / 2) h.ne'] + have := Int.emod_lt_of_pos (a + b / 2) h + have := Int.ediv_add_emod b 2 + have := Int.emod_lt_of_pos b zero_lt_two + revert this; intro this -- FIXME, this should not be needed + linarith </pre></div> </div> Note the use of our old friend, <code class="docutils literal notranslate">linarith</code>. We will also need to express <code class="docutils literal notranslate">mod'</code> in terms of <code class="docutils literal notranslate">div'</code>. - <div class="highlight-lean notranslate"><div class="highlight"><pre>theorem mod'_eq (a b : ℤ) : mod' a b = a - b * div' a b := by linarith [div'_add_mod' a b] + <div class="highlight-lean notranslate"><div class="highlight"><pre>theorem mod'_eq (a b : ℤ) : mod' a b = a - b * div' a b := by linarith [div'_add_mod' a b] </pre></div> </div> We will use the fact that $x^2 + y^2$ is equal to zero if and only if $x$ and $y$ are both zero. As an exercise, we ask you to prove that this holds in any ordered ring. - <div class="highlight-lean notranslate"><div class="highlight"><pre>theorem sq_add_sq_eq_zero {α : Type*} [LinearOrderedRing α] (x y : α) : - x ^ 2 + y ^ 2 = 0 ↔ x = 0 ∧ y = 0 := by - sorry + <div class="highlight-lean notranslate"><div class="highlight"><pre>theorem sq_add_sq_eq_zero {α : Type*} [LinearOrderedRing α] (x y : α) : + x ^ 2 + y ^ 2 = 0 ↔ x = 0 ∧ y = 0 := by + sorry </pre></div> </div> We will put all the remaining definitions and theorems in this section
- @@ -1365,33 +1365,33 @@ in the <code class="docutils literal notranslate">GaussInt</sp
 First, we define the <code class="docutils literal notranslate">norm</code> function and ask you to establish some of its properties. The proofs are all short. - <div class="highlight-lean notranslate"><div class="highlight"><pre>def norm (x : GaussInt) := - x.re ^ 2 + x.im ^ 2 + <div class="highlight-lean notranslate"><div class="highlight"><pre>def norm (x : GaussInt) := + x.re ^ 2 + x.im ^ 2 @[simp] - theorem norm_nonneg (x : GaussInt) : 0 ≤ norm x := by - sorry - theorem norm_eq_zero (x : GaussInt) : norm x = 0 ↔ x = 0 := by - sorry - theorem norm_pos (x : GaussInt) : 0 < norm x ↔ x ≠ 0 := by - sorry - theorem norm_mul (x y : GaussInt) : norm (x * y) = norm x * norm y := by - sorry + theorem norm_nonneg (x : GaussInt) : 0 ≤ norm x := by + sorry + theorem norm_eq_zero (x : GaussInt) : norm x = 0 ↔ x = 0 := by + sorry + theorem norm_pos (x : GaussInt) : 0 < norm x ↔ x ≠ 0 := by + sorry + theorem norm_mul (x y : GaussInt) : norm (x * y) = norm x * norm y := by + sorry </pre></div> </div> Next we define the conjugate function: - <div class="highlight-lean notranslate"><div class="highlight"><pre>def conj (x : GaussInt) : GaussInt := - ⟨x.re, -x.im⟩ + <div class="highlight-lean notranslate"><div class="highlight"><pre>def conj (x : GaussInt) : GaussInt := + ⟨x.re, -x.im⟩ @[simp] - theorem conj_re (x : GaussInt) : (conj x).re = x.re := - rfl + theorem conj_re (x : GaussInt) : (conj x).re = x.re := + rfl @[simp] - theorem conj_im (x : GaussInt) : (conj x).im = -x.im := - rfl + theorem conj_im (x : GaussInt) : (conj x).im = -x.im := + rfl - theorem norm_conj (x : GaussInt) : norm (conj x) = norm x := by simp [norm] + theorem norm_conj (x : GaussInt) : norm (conj x) = norm x := by simp [norm] </pre></div> </div> Finally, we define division for the Gaussian integers
- @@ -1404,23 +1404,23 @@ then the real and imaginary parts of <code class="docutils literal notranslate">
 respectively. Here the numerators are the real and imaginary parts of $(a + bi) (c - di)$, and the denominators are both equal to the norm of $c + di$. - <div class="highlight-lean notranslate"><div class="highlight"><pre>instance : Div GaussInt := - ⟨fun x y ↦ ⟨Int.div' (x * conj y).re (norm y), Int.div' (x * conj y).im (norm y)⟩⟩ + <div class="highlight-lean notranslate"><div class="highlight"><pre>instance : Div GaussInt := + ⟨fun x y ↦ ⟨Int.div' (x * conj y).re (norm y), Int.div' (x * conj y).im (norm y)⟩⟩ </pre></div> </div> Having defined <code class="docutils literal notranslate">x / y</code>, We define <code class="docutils literal notranslate">x % y</code> to be the remainder, <code class="docutils literal notranslate">x - (x / y) * y</code>. As above, we record the definitions in the theorems <code class="docutils literal notranslate">div_def</code> and <code class="docutils literal notranslate">mod_def</code> so that we can use them with <code class="docutils literal notranslate">simp</code> and <code class="docutils literal notranslate">rewrite</code>. - <div class="highlight-lean notranslate"><div class="highlight"><pre>instance : Mod GaussInt := - ⟨fun x y ↦ x - y * (x / y)⟩ + <div class="highlight-lean notranslate"><div class="highlight"><pre>instance : Mod GaussInt := + ⟨fun x y ↦ x - y * (x / y)⟩ - theorem div_def (x y : GaussInt) : - x / y = ⟨Int.div' (x * conj y).re (norm y), Int.div' (x * conj y).im (norm y)⟩ := - rfl + theorem div_def (x y : GaussInt) : + x / y = ⟨Int.div' (x * conj y).re (norm y), Int.div' (x * conj y).im (norm y)⟩ := + rfl - theorem mod_def (x y : GaussInt) : x % y = x - y * (x / y) := - rfl + theorem mod_def (x y : GaussInt) : x % y = x - y * (x / y) := + rfl </pre></div> </div> These definitions immediately yield <code class="docutils literal notranslate">x = y * (x / y) + x % y</code> for every
- @@ -1448,24 +1448,24 @@ So we have
 as required. This messy calculation is carried out in the next proof. We encourage you to step through the details and see if you can find a nicer argument. - <div class="highlight-lean notranslate"><div class="highlight"><pre>theorem norm_mod_lt (x : GaussInt) {y : GaussInt} (hy : y ≠ 0) : - (x % y).norm < y.norm := by - have norm_y_pos : 0 < norm y := by rwa [norm_pos] - have H1 : x % y * conj y = ⟨Int.mod' (x * conj y).re (norm y), Int.mod' (x * conj y).im (norm y)⟩ - · ext <;> simp [Int.mod'_eq, mod_def, div_def, norm] <;> ring - have H2 : norm (x % y) * norm y ≤ norm y / 2 * norm y - · calc - norm (x % y) * norm y = norm (x % y * conj y) := by simp only [norm_mul, norm_conj] - _ = |Int.mod' (x.re * y.re + x.im * y.im) (norm y)| ^ 2 - + |Int.mod' (-(x.re * y.im) + x.im * y.re) (norm y)| ^ 2 := by simp [H1, norm, sq_abs] - _ ≤ (y.norm / 2) ^ 2 + (y.norm / 2) ^ 2 := by gcongr <;> apply Int.abs_mod'_le _ _ norm_y_pos - _ = norm y / 2 * (norm y / 2 * 2) := by ring - _ ≤ norm y / 2 * norm y := by gcongr; apply Int.ediv_mul_le; norm_num - calc norm (x % y) ≤ norm y / 2 := le_of_mul_le_mul_right H2 norm_y_pos - _ < norm y := by - apply Int.ediv_lt_of_lt_mul - · norm_num - · linarith + <div class="highlight-lean notranslate"><div class="highlight"><pre>theorem norm_mod_lt (x : GaussInt) {y : GaussInt} (hy : y ≠ 0) : + (x % y).norm < y.norm := by + have norm_y_pos : 0 < norm y := by rwa [norm_pos] + have H1 : x % y * conj y = ⟨Int.mod' (x * conj y).re (norm y), Int.mod' (x * conj y).im (norm y)⟩ + · ext <;> simp [Int.mod'_eq, mod_def, div_def, norm] <;> ring + have H2 : norm (x % y) * norm y ≤ norm y / 2 * norm y + · calc + norm (x % y) * norm y = norm (x % y * conj y) := by simp only [norm_mul, norm_conj] + _ = |Int.mod' (x.re * y.re + x.im * y.im) (norm y)| ^ 2 + + |Int.mod' (-(x.re * y.im) + x.im * y.re) (norm y)| ^ 2 := by simp [H1, norm, sq_abs] + _ ≤ (y.norm / 2) ^ 2 + (y.norm / 2) ^ 2 := by gcongr <;> apply Int.abs_mod'_le _ _ norm_y_pos + _ = norm y / 2 * (norm y / 2 * 2) := by ring + _ ≤ norm y / 2 * norm y := by gcongr; apply Int.ediv_mul_le; norm_num + calc norm (x % y) ≤ norm y / 2 := le_of_mul_le_mul_right H2 norm_y_pos + _ < norm y := by + apply Int.ediv_lt_of_lt_mul + · norm_num + · linarith </pre></div> </div> We are in the home stretch. Our <code class="docutils literal notranslate">norm</code> function maps Gaussian integers to
- @@ -1475,26 +1475,26 @@ numbers, and we obtain that by composing <code class="docutils literal notransla
 The first of the next two lemmas establishes that mapping the norm to the natural numbers and back to the integers does not change the value. The second one re-expresses the fact that the norm is decreasing. - <div class="highlight-lean notranslate"><div class="highlight"><pre>theorem coe_natAbs_norm (x : GaussInt) : (x.norm.natAbs : ℤ) = x.norm := - Int.natAbs_of_nonneg (norm_nonneg _) - - theorem natAbs_norm_mod_lt (x y : GaussInt) (hy : y ≠ 0) : - (x % y).norm.natAbs < y.norm.natAbs := by - apply Int.ofNat_lt.1 - simp only [Int.coe_natAbs, abs_of_nonneg, norm_nonneg] - apply norm_mod_lt x hy + <div class="highlight-lean notranslate"><div class="highlight"><pre>theorem coe_natAbs_norm (x : GaussInt) : (x.norm.natAbs : ℤ) = x.norm := + Int.natAbs_of_nonneg (norm_nonneg _) + + theorem natAbs_norm_mod_lt (x y : GaussInt) (hy : y ≠ 0) : + (x % y).norm.natAbs < y.norm.natAbs := by + apply Int.ofNat_lt.1 + simp only [Int.coe_natAbs, abs_of_nonneg, norm_nonneg] + apply norm_mod_lt x hy </pre></div> </div> We also need to establish the second key property of the norm function on a Euclidean domain. - <div class="highlight-lean notranslate"><div class="highlight"><pre>theorem not_norm_mul_left_lt_norm (x : GaussInt) {y : GaussInt} (hy : y ≠ 0) : - ¬(norm (x * y)).natAbs < (norm x).natAbs := by - apply not_lt_of_ge - rw [norm_mul, Int.natAbs_mul] - apply le_mul_of_one_le_right (Nat.zero_le _) - apply Int.ofNat_le.1 - rw [coe_natAbs_norm] - exact Int.add_one_le_of_lt ((norm_pos _).mpr hy) + <div class="highlight-lean notranslate"><div class="highlight"><pre>theorem not_norm_mul_left_lt_norm (x : GaussInt) {y : GaussInt} (hy : y ≠ 0) : + ¬(norm (x * y)).natAbs < (norm x).natAbs := by + apply not_lt_of_ge + rw [norm_mul, Int.natAbs_mul] + apply le_mul_of_one_le_right (Nat.zero_le _) + apply Int.ofNat_le.1 + rw [coe_natAbs_norm] + exact Int.add_one_le_of_lt ((norm_pos _).mpr hy) </pre></div> </div> We can now put it together to show that the Gaussian integers are an
- @@ -1507,25 +1507,25 @@ Comparing the values of a norm function that returns natural numbers is
 just one instance of such a measure, and in that case, the required properties are the theorems <code class="docutils literal notranslate">natAbs_norm_mod_lt</code> and <code class="docutils literal notranslate">not_norm_mul_left_lt_norm</code>. - <div class="highlight-lean notranslate"><div class="highlight"><pre>instance : EuclideanDomain GaussInt := - { GaussInt.instCommRing with - quotient := (· / ·) - remainder := (· % ·) - quotient_mul_add_remainder_eq := - fun x y ↦ by simp only; rw [mod_def, add_comm] ; ring - quotient_zero := fun x ↦ by - simp [div_def, norm, Int.div'] - rfl - r := (measure (Int.natAbs ∘ norm)).1 - r_wellFounded := (measure (Int.natAbs ∘ norm)).2 - remainder_lt := natAbs_norm_mod_lt - mul_left_not_lt := not_norm_mul_left_lt_norm } + <div class="highlight-lean notranslate"><div class="highlight"><pre>instance : EuclideanDomain GaussInt := + { GaussInt.instCommRing with + quotient := (· / ·) + remainder := (· % ·) + quotient_mul_add_remainder_eq := + fun x y ↦ by simp only; rw [mod_def, add_comm] ; ring + quotient_zero := fun x ↦ by + simp [div_def, norm, Int.div'] + rfl + r := (measure (Int.natAbs ∘ norm)).1 + r_wellFounded := (measure (Int.natAbs ∘ norm)).2 + remainder_lt := natAbs_norm_mod_lt + mul_left_not_lt := not_norm_mul_left_lt_norm } </pre></div> </div> An immediate payoff is that we now know that, in the Gaussian integers, the notions of being prime and being irreducible coincide. - <div class="highlight-lean notranslate"><div class="highlight"><pre>example (x : GaussInt) : Irreducible x ↔ Prime x := - PrincipalIdealRing.irreducible_iff_prime + <div class="highlight-lean notranslate"><div class="highlight"><pre>example (x : GaussInt) : Irreducible x ↔ Prime x := + PrincipalIdealRing.irreducible_iff_prime </pre></div> </div> </section>
html/C07_Hierarchies.html
- @@ -18,7 +18,7 @@
 <script src="_static/jquery.js?v=5d32c60e"></script> <script src="_static/_sphinx_javascript_frameworks_compat.js?v=2cd50e6c"></script> <script src="_static/documentation_options.js?v=2709fde1"></script> - <script src="_static/doctools.js?v=888ff710"></script> + <script src="_static/doctools.js?v=9a2dae69"></script> <script src="_static/sphinx_highlight.js?v=dc90522c"></script> <script src="_static/js/theme.js"></script> <link rel="index" title="Index" href="genindex.html" />
- @@ -114,9 +114,9 @@ structures, those indices will sometimes grow beyond one.
 At the very bottom of all hierarchies in Lean, we find data-carrying classes. The following class records that the given type <code class="docutils literal notranslate">α</code> is endowed with a distinguished element called <code class="docutils literal notranslate">one</code>. At this stage, it has no property at all. - <div class="highlight-lean notranslate"><div class="highlight"><pre>class One₁ (α : Type) where - /-- The element one -/ - one : α + <div class="highlight-lean notranslate"><div class="highlight"><pre>class One₁ (α : Type) where + /-- The element one -/ + one : α </pre></div> </div> Since we’ll make a much heavier use of classes in this chapter, we need to understand some
- @@ -128,18 +128,18 @@ as long as they are marked as instance-implicit, ie appear between square bracke
 Those two effects could also have been achieved using the <code class="docutils literal notranslate">structure</code> command with <code class="docutils literal notranslate">class</code> attribute, ie writing <code class="docutils literal notranslate">@[class] structure</code> instance of <code class="docutils literal notranslate">class</code>. But the class command also ensures that <code class="docutils literal notranslate">One₁ α</code> appears as an instance-implicit argument in its own fields. Compare: - <div class="highlight-lean notranslate"><div class="highlight"><pre>#check One₁.one -- One₁.one {α : Type} [self : One₁ α] : α + <div class="highlight-lean notranslate"><div class="highlight"><pre>#check One₁.one -- One₁.one {α : Type} [self : One₁ α] : α - @[class] structure One₂ (α : Type) where - /-- The element one -/ - one : α + @[class] structure One₂ (α : Type) where + /-- The element one -/ + one : α - #check One₂.one + #check One₂.one </pre></div> </div> In the second check, we can see that <code class="docutils literal notranslate">self : One₂ α</code> is an explicit argument. Let us make sure the first version is indeed usable without any explicit argument. - <div class="highlight-lean notranslate"><div class="highlight"><pre>example (α : Type) [One₁ α] : α := One₁.one + <div class="highlight-lean notranslate"><div class="highlight"><pre>example (α : Type) [One₁ α] : α := One₁.one </pre></div> </div> Remark: in the above example, the argument <code class="docutils literal notranslate">One₁ α</code> is marked as instance-implicit,
- @@ -153,7 +153,7 @@ example, leaving out the type ascription <code class="docutils literal notransla
 where <code class="docutils literal notranslate">?m.263 α</code> means “some type depending on <code class="docutils literal notranslate">α</code>” (and 263 is simply an auto-generated index that would be useful to distinguish between several unknown things). Another way to avoid this issue would be to use a type annotation, as in: - <div class="highlight-lean notranslate"><div class="highlight"><pre>example (α : Type) [One₁ α] := (One₁.one : α) + <div class="highlight-lean notranslate"><div class="highlight"><pre>example (α : Type) [One₁ α] := (One₁.one : α) </pre></div> </div> You may have already encountered that issue when playing with limits of sequences
- @@ -165,29 +165,29 @@ with the builtin notation for <code class="docutils literal notranslate">One₁.one</code> as documentation for the symbol <code class="docutils literal notranslate">𝟙</code>. <div class="highlight-lean notranslate"><div class="highlight"><pre>@[inherit_doc] - notation "𝟙" => One₁.one + notation "𝟙" => One₁.one - example {α : Type} [One₁ α] : α := 𝟙 + example {α : Type} [One₁ α] : α := 𝟙 - example {α : Type} [One₁ α] : (𝟙 : α) = 𝟙 := rfl + example {α : Type} [One₁ α] : (𝟙 : α) = 𝟙 := rfl </pre></div> </div> We now want a data-carrying class recording a binary operation. We don’t want to choose between addition and multiplication for now so we’ll use diamond. - <div class="highlight-lean notranslate"><div class="highlight"><pre>class Dia₁ (α : Type) where - dia : α → α → α + <div class="highlight-lean notranslate"><div class="highlight"><pre>class Dia₁ (α : Type) where + dia : α → α → α - infixl:70 " ⋄ " => Dia₁.dia + infixl:70 " ⋄ " => Dia₁.dia </pre></div> </div> As in the <code class="docutils literal notranslate">One₁</code> example, the operation has no property at all at this stage. Let us now define the class of semigroup structures where the operation is denoted by <code class="docutils literal notranslate">⋄</code>. For now, we define it by hand as a structure with two fields, a <code class="docutils literal notranslate">Dia₁</code> instance and some <code class="docutils literal notranslate">Prop</code>-valued field <code class="docutils literal notranslate">dia_assoc</code> asserting associativity of <code class="docutils literal notranslate">⋄</code>. - <div class="highlight-lean notranslate"><div class="highlight"><pre>class Semigroup₁ (α : Type) where - toDia₁ : Dia₁ α - /-- Diamond is associative -/ - dia_assoc : ∀ a b c : α, a ⋄ b ⋄ c = a ⋄ (b ⋄ c) + <div class="highlight-lean notranslate"><div class="highlight"><pre>class Semigroup₁ (α : Type) where + toDia₁ : Dia₁ α + /-- Diamond is associative -/ + dia_assoc : ∀ a b c : α, a ⋄ b ⋄ c = a ⋄ (b ⋄ c) </pre></div> </div> Note that while stating <cite>dia_assoc</cite>, the previously defined field <cite>toDia₁</cite> is in the local
- @@ -196,19 +196,19 @@ of <cite>a ⋄ b</cite>. However this <cite>toDia₁</cite> field does n
 Hence doing <code class="docutils literal notranslate">example {α : Type} [Semigroup₁ α] (a b : α) : α := a ⋄ b</code> would fail with error message <code class="docutils literal notranslate">failed to synthesize instance Dia₁ α</code>. We can fix this by adding the <code class="docutils literal notranslate">instance</code> attribute later. - <div class="highlight-lean notranslate"><div class="highlight"><pre>attribute [instance] Semigroup₁.toDia₁ + <div class="highlight-lean notranslate"><div class="highlight"><pre>attribute [instance] Semigroup₁.toDia₁ - example {α : Type} [Semigroup₁ α] (a b : α) : α := a ⋄ b + example {α : Type} [Semigroup₁ α] (a b : α) : α := a ⋄ b </pre></div> </div> Before building up, we need a more convenient way to extend structures than explicitly writing fields like <cite>toDia₁</cite> and adding the instance attribute by hand. The <code class="docutils literal notranslate">class</code> supports this using the <code class="docutils literal notranslate">extends</code> syntax as in: - <div class="highlight-lean notranslate"><div class="highlight"><pre>class Semigroup₂ (α : Type) extends Dia₁ α where - /-- Diamond is associative -/ - dia_assoc : ∀ a b c : α, a ⋄ b ⋄ c = a ⋄ (b ⋄ c) + <div class="highlight-lean notranslate"><div class="highlight"><pre>class Semigroup₂ (α : Type) extends Dia₁ α where + /-- Diamond is associative -/ + dia_assoc : ∀ a b c : α, a ⋄ b ⋄ c = a ⋄ (b ⋄ c) - example {α : Type} [Semigroup₂ α] (a b : α) : α := a ⋄ b + example {α : Type} [Semigroup₂ α] (a b : α) : α := a ⋄ b </pre></div> </div> Note this syntax is also available in the <code class="docutils literal notranslate">structure</code> command, although it that
- @@ -216,11 +216,11 @@ case it fixes only the hurdle of writing fields such as <cite>toDia₁</cite
 is no instance to define in that case. Let us now try to combine a diamond operation and a distinguished one with axioms saying this element is neutral on both sides. - <div class="highlight-lean notranslate"><div class="highlight"><pre>class DiaOneClass₁ (α : Type) extends One₁ α, Dia₁ α where - /-- One is a left neutral element for diamond. -/ - one_dia : ∀ a : α, 𝟙 ⋄ a = a - /-- One is a right neutral element for diamond -/ - dia_one : ∀ a : α, a ⋄ 𝟙 = a + <div class="highlight-lean notranslate"><div class="highlight"><pre>class DiaOneClass₁ (α : Type) extends One₁ α, Dia₁ α where + /-- One is a left neutral element for diamond. -/ + one_dia : ∀ a : α, 𝟙 ⋄ a = a + /-- One is a right neutral element for diamond -/ + dia_one : ∀ a : α, a ⋄ 𝟙 = a </pre></div> </div> In the next example, we tell Lean that <code class="docutils literal notranslate">α</code> has a <code class="docutils literal notranslate">DiaOneClass₁</code> structure and state a
- @@ -230,13 +230,13 @@ is rather terse by default but it can be expanded by clicking on lines ending wi
 It includes failed attempts where Lean tried to find instances before having enough type information to succeed. The successful attempts do involve the instances generated by the <code class="docutils literal notranslate">extends</code> syntax. - <div class="highlight-lean notranslate"><div class="highlight"><pre>set_option trace.Meta.synthInstance true in - example {α : Type} [DiaOneClass₁ α] (a b : α) : Prop := a ⋄ b = 𝟙 + <div class="highlight-lean notranslate"><div class="highlight"><pre>set_option trace.Meta.synthInstance true in + example {α : Type} [DiaOneClass₁ α] (a b : α) : Prop := a ⋄ b = 𝟙 </pre></div> </div> Note that we don’t need to include extra fields where combining existing classes. Hence we can define monoids as: - <div class="highlight-lean notranslate"><div class="highlight"><pre>class Monoid₁ (α : Type) extends Semigroup₁ α, DiaOneClass₁ α + <div class="highlight-lean notranslate"><div class="highlight"><pre>class Monoid₁ (α : Type) extends Semigroup₁ α, DiaOneClass₁ α </pre></div> </div> While the above definition seems straightforward, it hides an important subtlety. Both
- @@ -244,25 +244,25 @@ define monoids as:
 a <code class="docutils literal notranslate">Monoid₁ α</code> instance gives two unrelated diamond operations on <code class="docutils literal notranslate">α</code>, one coming from a field <code class="docutils literal notranslate">Monoid₁.toSemigroup₁</code> and one coming from a field <code class="docutils literal notranslate">Monoid₁.toDiaOneClass₁</code>. Indeed if we try to build a monoid class by hand using: - <div class="highlight-lean notranslate"><div class="highlight"><pre>class Monoid₂ (α : Type) where - toSemigroup₁ : Semigroup₁ α - toDiaOneClass₁ : DiaOneClass₁ α + <div class="highlight-lean notranslate"><div class="highlight"><pre>class Monoid₂ (α : Type) where + toSemigroup₁ : Semigroup₁ α + toDiaOneClass₁ : DiaOneClass₁ α </pre></div> </div> then we get two completely unrelated diamond operations <code class="docutils literal notranslate">Monoid₂.toSemigroup₁.toDia₁.dia</code> and <code class="docutils literal notranslate">Monoid₂.toDiaOneClass₁.toDia₁.dia</code>. The version generated using the <code class="docutils literal notranslate">extends</code> syntax does not have this defect. - <div class="highlight-lean notranslate"><div class="highlight"><pre>example {α : Type} [Monoid₁ α] : - (Monoid₁.toSemigroup₁.toDia₁.dia : α → α → α) = Monoid₁.toDiaOneClass₁.toDia₁.dia := rfl + <div class="highlight-lean notranslate"><div class="highlight"><pre>example {α : Type} [Monoid₁ α] : + (Monoid₁.toSemigroup₁.toDia₁.dia : α → α → α) = Monoid₁.toDiaOneClass₁.toDia₁.dia := rfl </pre></div> </div> So the <code class="docutils literal notranslate">class</code> command did some magic for us (and the <code class="docutils literal notranslate">structure</code> command would have done it too). An easy way to see what are the fields of our classes is to check their constructor. Compare: <div class="highlight-lean notranslate"><div class="highlight"><pre>/- Monoid₂.mk {α : Type} (toSemigroup₁ : Semigroup₁ α) (toDiaOneClass₁ : DiaOneClass₁ α) : Monoid₂ α -/ - #check Monoid₂.mk + #check Monoid₂.mk /- Monoid₁.mk {α : Type} [toSemigroup₁ : Semigroup₁ α] [toOne₁ : One₁ α] (one_dia : ∀ (a : α), 𝟙 ⋄ a = a) (dia_one : ∀ (a : α), a ⋄ 𝟙 = a) : Monoid₁ α -/ - #check Monoid₁.mk + #check Monoid₁.mk </pre></div> </div> So we see that <code class="docutils literal notranslate">Monoid₁</code> takes <code class="docutils literal notranslate">Semigroup₁ α</code> argument as expected but then it won’t
- @@ -270,50 +270,50 @@ take a would-be overlapping <code class="docutils literal notranslate">Monoid₁.toDiaOneClass₁</code> which is not a field but has the expected signature which, from the end-user point of view, restores the symmetry between the two extended classes <code class="docutils literal notranslate">Semigroup₁</code> and <code class="docutils literal notranslate">DiaOneClass₁</code>. - <div class="highlight-lean notranslate"><div class="highlight"><pre>#check Monoid₁.toSemigroup₁ - #check Monoid₁.toDiaOneClass₁ + <div class="highlight-lean notranslate"><div class="highlight"><pre>#check Monoid₁.toSemigroup₁ + #check Monoid₁.toDiaOneClass₁ </pre></div> </div> We are now very close to defining groups. We could add to the monoid structure a field asserting the existence of an inverse for every element. But then we would need to work to access these inverses. In practice it is more convenient to add it as data. To optimize reusability, we define a new data-carrying class, and then give it some notation. - <div class="highlight-lean notranslate"><div class="highlight"><pre>class Inv₁ (α : Type) where - /-- The inversion function -/ - inv : α → α + <div class="highlight-lean notranslate"><div class="highlight"><pre>class Inv₁ (α : Type) where + /-- The inversion function -/ + inv : α → α @[inherit_doc] - postfix:max "⁻¹" => Inv₁.inv + postfix:max "⁻¹" => Inv₁.inv - class Group₁ (G : Type) extends Monoid₁ G, Inv₁ G where - inv_dia : ∀ a : G, a⁻¹ ⋄ a = 𝟙 + class Group₁ (G : Type) extends Monoid₁ G, Inv₁ G where + inv_dia : ∀ a : G, a⁻¹ ⋄ a = 𝟙 </pre></div> </div> The above definition may seem too weak, we only ask that <code class="docutils literal notranslate">a⁻¹</code> is a left-inverse of <code class="docutils literal notranslate">a</code>. But the other side is automatic. In order to prove that, we need a preliminary lemma. - <div class="highlight-lean notranslate"><div class="highlight"><pre>lemma left_inv_eq_right_inv₁ {M : Type} [Monoid₁ M] {a b c : M} (hba : b ⋄ a = 𝟙) (hac : a ⋄ c = 𝟙) : b = c := by - rw [← DiaOneClass₁.one_dia c, ← hba, Semigroup₁.dia_assoc, hac, DiaOneClass₁.dia_one b] + <div class="highlight-lean notranslate"><div class="highlight"><pre>lemma left_inv_eq_right_inv₁ {M : Type} [Monoid₁ M] {a b c : M} (hba : b ⋄ a = 𝟙) (hac : a ⋄ c = 𝟙) : b = c := by + rw [← DiaOneClass₁.one_dia c, ← hba, Semigroup₁.dia_assoc, hac, DiaOneClass₁.dia_one b] </pre></div> </div> In this lemma, it is pretty annoying to give full names, especially since it requires knowing which part of the hierarchy provides those facts. One way to fix this is to use the <code class="docutils literal notranslate">export</code> command to copy those facts as lemmas in the root name space. - <div class="highlight-lean notranslate"><div class="highlight"><pre>export DiaOneClass₁ (one_dia dia_one) - export Semigroup₁ (dia_assoc) - export Group₁ (inv_dia) + <div class="highlight-lean notranslate"><div class="highlight"><pre>export DiaOneClass₁ (one_dia dia_one) + export Semigroup₁ (dia_assoc) + export Group₁ (inv_dia) </pre></div> </div> We can then rewrite the above proof as: - <div class="highlight-lean notranslate"><div class="highlight"><pre>example {M : Type} [Monoid₁ M] {a b c : M} (hba : b ⋄ a = 𝟙) (hac : a ⋄ c = 𝟙) : b = c := by - rw [← one_dia c, ← hba, dia_assoc, hac, dia_one b] + <div class="highlight-lean notranslate"><div class="highlight"><pre>example {M : Type} [Monoid₁ M] {a b c : M} (hba : b ⋄ a = 𝟙) (hac : a ⋄ c = 𝟙) : b = c := by + rw [← one_dia c, ← hba, dia_assoc, hac, dia_one b] </pre></div> </div> It is now your turn to prove things about our algebraic structures. - <div class="highlight-lean notranslate"><div class="highlight"><pre>lemma inv_eq_of_dia [Group₁ G] {a b : G} (h : a ⋄ b = 𝟙) : a⁻¹ = b := - sorry + <div class="highlight-lean notranslate"><div class="highlight"><pre>lemma inv_eq_of_dia [Group₁ G] {a b : G} (h : a ⋄ b = 𝟙) : a⁻¹ = b := + sorry - lemma dia_inv [Group₁ G] (a : G) : a ⋄ a⁻¹ = 𝟙 := - sorry + lemma dia_inv [Group₁ G] (a : G) : a ⋄ a⁻¹ = 𝟙 := + sorry </pre></div> </div> At this stage we would like to move on to define rings, but there is a serious issue.
- @@ -331,84 +331,84 @@ lemmas are then only stated in multiplicative notation and marked with the attri
 to generate the additive version as <code class="docutils literal notranslate">left_inv_eq_right_inv'</code> with its auto-generated additive version <code class="docutils literal notranslate">left_neg_eq_right_neg'</code>. In order to check the name of this additive version we used the <code class="docutils literal notranslate">whatsnew in</code> command on top of <code class="docutils literal notranslate">left_inv_eq_right_inv'</code>. - <div class="highlight-lean notranslate"><div class="highlight"><pre>class AddSemigroup₃ (α : Type) extends Add α where + <div class="highlight-lean notranslate"><div class="highlight"><pre>class AddSemigroup₃ (α : Type) extends Add α where /-- Addition is associative -/ - add_assoc₃ : ∀ a b c : α, a + b + c = a + (b + c) + add_assoc₃ : ∀ a b c : α, a + b + c = a + (b + c) - @[to_additive AddSemigroup₃] - class Semigroup₃ (α : Type) extends Mul α where + @[to_additive AddSemigroup₃] + class Semigroup₃ (α : Type) extends Mul α where /-- Multiplication is associative -/ - mul_assoc₃ : ∀ a b c : α, a * b * c = a * (b * c) + mul_assoc₃ : ∀ a b c : α, a * b * c = a * (b * c) - class AddMonoid₃ (α : Type) extends AddSemigroup₃ α, AddZeroClass α + class AddMonoid₃ (α : Type) extends AddSemigroup₃ α, AddZeroClass α - @[to_additive AddMonoid₃] - class Monoid₃ (α : Type) extends Semigroup₃ α, MulOneClass α + @[to_additive AddMonoid₃] + class Monoid₃ (α : Type) extends Semigroup₃ α, MulOneClass α - attribute [to_additive existing] Monoid₃.toMulOneClass + attribute [to_additive existing] Monoid₃.toMulOneClass - export Semigroup₃ (mul_assoc₃) - export AddSemigroup₃ (add_assoc₃) + export Semigroup₃ (mul_assoc₃) + export AddSemigroup₃ (add_assoc₃) - whatsnew in + whatsnew in @[to_additive] - lemma left_inv_eq_right_inv' {M : Type} [Monoid₃ M] {a b c : M} (hba : b * a = 1) (hac : a * c = 1) : b = c := by - rw [← one_mul c, ← hba, mul_assoc₃, hac, mul_one b] + lemma left_inv_eq_right_inv' {M : Type} [Monoid₃ M] {a b c : M} (hba : b * a = 1) (hac : a * c = 1) : b = c := by + rw [← one_mul c, ← hba, mul_assoc₃, hac, mul_one b] - #check left_neg_eq_right_neg' + #check left_neg_eq_right_neg' </pre></div> </div> Equipped with this technology, we can easily define also commutative semigroups, monoids and groups, and then define rings. - <div class="highlight-lean notranslate"><div class="highlight"><pre>class AddCommSemigroup₃ (α : Type) extends AddSemigroup₃ α where - add_comm : ∀ a b : α, a + b = b + a + <div class="highlight-lean notranslate"><div class="highlight"><pre>class AddCommSemigroup₃ (α : Type) extends AddSemigroup₃ α where + add_comm : ∀ a b : α, a + b = b + a - @[to_additive AddCommSemigroup₃] - class CommSemigroup₃ (α : Type) extends Semigroup₃ α where - mul_comm : ∀ a b : α, a * b = b * a + @[to_additive AddCommSemigroup₃] + class CommSemigroup₃ (α : Type) extends Semigroup₃ α where + mul_comm : ∀ a b : α, a * b = b * a - class AddCommMonoid₃ (α : Type) extends AddMonoid₃ α, AddCommSemigroup₃ α + class AddCommMonoid₃ (α : Type) extends AddMonoid₃ α, AddCommSemigroup₃ α - @[to_additive AddCommMonoid₃] - class CommMonoid₃ (α : Type) extends Monoid₃ α, CommSemigroup₃ α + @[to_additive AddCommMonoid₃] + class CommMonoid₃ (α : Type) extends Monoid₃ α, CommSemigroup₃ α - class AddGroup₃ (G : Type) extends AddMonoid₃ G, Neg G where - neg_add : ∀ a : G, -a + a = 0 + class AddGroup₃ (G : Type) extends AddMonoid₃ G, Neg G where + neg_add : ∀ a : G, -a + a = 0 - @[to_additive AddGroup₃] - class Group₃ (G : Type) extends Monoid₃ G, Inv G where - inv_mul : ∀ a : G, a⁻¹ * a = 1 + @[to_additive AddGroup₃] + class Group₃ (G : Type) extends Monoid₃ G, Inv G where + inv_mul : ∀ a : G, a⁻¹ * a = 1 </pre></div> </div> We should remember to tag lemmas with <code class="docutils literal notranslate">simp</code> when appropriate. - <div class="highlight-lean notranslate"><div class="highlight"><pre>attribute [simp] Group₃.inv_mul AddGroup₃.neg_add + <div class="highlight-lean notranslate"><div class="highlight"><pre>attribute [simp] Group₃.inv_mul AddGroup₃.neg_add </pre></div> </div> Then we need to repeat ourselves a bit since we switch to standard notations, but at least <code class="docutils literal notranslate">to_additive</code> does the work of translating from the multiplicative notation to the additive one. <div class="highlight-lean notranslate"><div class="highlight"><pre>@[to_additive] - lemma inv_eq_of_mul [Group₃ G] {a b : G} (h : a * b = 1) : a⁻¹ = b := - sorry + lemma inv_eq_of_mul [Group₃ G] {a b : G} (h : a * b = 1) : a⁻¹ = b := + sorry </pre></div> </div> Note that <code class="docutils literal notranslate">to_additive</code> can be asked to tag a lemma with <code class="docutils literal notranslate">simp</code> and propagate that attribute to the additive version as follows. - <div class="highlight-lean notranslate"><div class="highlight"><pre>@[to_additive (attr := simp)] - lemma Group₃.mul_inv {G : Type} [Group₃ G] {a : G} : a * a⁻¹ = 1 := by - sorry + <div class="highlight-lean notranslate"><div class="highlight"><pre>@[to_additive (attr := simp)] + lemma Group₃.mul_inv {G : Type} [Group₃ G] {a : G} : a * a⁻¹ = 1 := by + sorry @[to_additive] - lemma mul_left_cancel₃ {G : Type} [Group₃ G] {a b c : G} (h : a * b = a * c) : b = c := by - sorry + lemma mul_left_cancel₃ {G : Type} [Group₃ G] {a b c : G} (h : a * b = a * c) : b = c := by + sorry @[to_additive] - lemma mul_right_cancel₃ {G : Type} [Group₃ G] {a b c : G} (h : b*a = c*a) : b = c := by - sorry + lemma mul_right_cancel₃ {G : Type} [Group₃ G] {a b c : G} (h : b*a = c*a) : b = c := by + sorry - class AddCommGroup₃ (G : Type) extends AddGroup₃ G, AddCommMonoid₃ G + class AddCommGroup₃ (G : Type) extends AddGroup₃ G, AddCommMonoid₃ G - @[to_additive AddCommGroup₃] - class CommGroup₃ (G : Type) extends Group₃ G, CommMonoid₃ G + @[to_additive AddCommGroup₃] + class CommGroup₃ (G : Type) extends Group₃ G, CommMonoid₃ G </pre></div> </div> We are now ready for rings. For demonstration purposes we won’t assume that addition is
- @@ -418,56 +418,56 @@ also because Mathlib’s algebraic hierarchy goes through semirings which ar
 opposites so that the proof below does not work for them. What we gain here, besides a nice exercise if you have never seen it, is an example of building an instance using the syntax that allows to provide a parent structure and some extra fields. - <div class="highlight-lean notranslate"><div class="highlight"><pre>class Ring₃ (R : Type) extends AddGroup₃ R, Monoid₃ R, MulZeroClass R where - /-- Multiplication is left distributive over addition -/ - left_distrib : ∀ a b c : R, a * (b + c) = a * b + a * c - /-- Multiplication is right distributive over addition -/ - right_distrib : ∀ a b c : R, (a + b) * c = a * c + b * c + <div class="highlight-lean notranslate"><div class="highlight"><pre>class Ring₃ (R : Type) extends AddGroup₃ R, Monoid₃ R, MulZeroClass R where + /-- Multiplication is left distributive over addition -/ + left_distrib : ∀ a b c : R, a * (b + c) = a * b + a * c + /-- Multiplication is right distributive over addition -/ + right_distrib : ∀ a b c : R, (a + b) * c = a * c + b * c - instance {R : Type} [Ring₃ R] : AddCommGroup₃ R := - { Ring₃.toAddGroup₃ with - add_comm := by - sorry } + instance {R : Type} [Ring₃ R] : AddCommGroup₃ R := + { Ring₃.toAddGroup₃ with + add_comm := by + sorry } </pre></div> </div> Of course we can also build concrete instances, such as a ring structure on integers (of course the instance below uses that all the work is already done in Mathlib). - <div class="highlight-lean notranslate"><div class="highlight"><pre>instance : Ring₃ ℤ where - add := (· + ·) - add_assoc₃ := add_assoc - zero := 0 - zero_add := by simp - add_zero := by simp - neg := (- ·) - neg_add := by simp - mul := (· * ·) - mul_assoc₃ := mul_assoc - one := 1 - one_mul := by simp - mul_one := by simp - zero_mul := by simp - mul_zero := by simp - left_distrib := Int.mul_add - right_distrib := Int.add_mul + <div class="highlight-lean notranslate"><div class="highlight"><pre>instance : Ring₃ ℤ where + add := (· + ·) + add_assoc₃ := add_assoc + zero := 0 + zero_add := by simp + add_zero := by simp + neg := (- ·) + neg_add := by simp + mul := (· * ·) + mul_assoc₃ := mul_assoc + one := 1 + one_mul := by simp + mul_one := by simp + zero_mul := by simp + mul_zero := by simp + left_distrib := Int.mul_add + right_distrib := Int.add_mul </pre></div> </div> As an exercise you can now set up a simple hierarchy for order relations, including a class for ordered commutative monoids, which have both a partial order and a commutative monoid structure such that <code class="docutils literal notranslate">∀ a b : α, a ≤ b → ∀ c : α, c * a ≤ c * b</code>. Of course you need to add fields and maybe <code class="docutils literal notranslate">extends</code> clauses to the following classes. - <div class="highlight-lean notranslate"><div class="highlight"><pre>class LE₁ (α : Type) where - /-- The Less-or-Equal relation. -/ - le : α → α → Prop + <div class="highlight-lean notranslate"><div class="highlight"><pre>class LE₁ (α : Type) where + /-- The Less-or-Equal relation. -/ + le : α → α → Prop - @[inherit_doc] infix:50 " ≤₁ " => LE₁.le + @[inherit_doc] infix:50 " ≤₁ " => LE₁.le - class Preorder₁ (α : Type) + class Preorder₁ (α : Type) - class PartialOrder₁ (α : Type) + class PartialOrder₁ (α : Type) - class OrderedCommMonoid₁ (α : Type) + class OrderedCommMonoid₁ (α : Type) - instance : OrderedCommMonoid₁ ℕ where + instance : OrderedCommMonoid₁ ℕ where </pre></div> </div> We now want to discuss algebraic structures involving several types. The prime example
- @@ -476,20 +476,20 @@ and think that all our rings are fields. Those structures are commutative additi
 equipped with a scalar multiplication by elements of some ring. We first define the data-carrying type class of scalar multiplication by some type <code class="docutils literal notranslate">α</code> on some type <code class="docutils literal notranslate">β</code>, and give it a right associative notation. - <div class="highlight-lean notranslate"><div class="highlight"><pre>class SMul₃ (α : Type) (β : Type) where - /-- Scalar multiplication -/ - smul : α → β → β + <div class="highlight-lean notranslate"><div class="highlight"><pre>class SMul₃ (α : Type) (β : Type) where + /-- Scalar multiplication -/ + smul : α → β → β - infixr:73 " • " => SMul₃.smul + infixr:73 " • " => SMul₃.smul </pre></div> </div> Then we can define modules (again think about vector spaces if you don’t know what is a module). - <div class="highlight-lean notranslate"><div class="highlight"><pre>class Module₁ (R : Type) [Ring₃ R] (M : Type) [AddCommGroup₃ M] extends SMul₃ R M where - zero_smul : ∀ m : M, (0 : R) • m = 0 - one_smul : ∀ m : M, (1 : R) • m = m - mul_smul : ∀ (a b : R) (m : M), (a * b) • m = a • b • m - add_smul : ∀ (a b : R) (m : M), (a + b) • m = a • m + b • m - smul_add : ∀ (a : R) (m n : M), a • (m + n) = a • m + a • n + <div class="highlight-lean notranslate"><div class="highlight"><pre>class Module₁ (R : Type) [Ring₃ R] (M : Type) [AddCommGroup₃ M] extends SMul₃ R M where + zero_smul : ∀ m : M, (0 : R) • m = 0 + one_smul : ∀ m : M, (1 : R) • m = m + mul_smul : ∀ (a b : R) (m : M), (a * b) • m = a • b • m + add_smul : ∀ (a b : R) (m : M), (a + b) • m = a • m + b • m + smul_add : ∀ (a : R) (m n : M), a • (m + n) = a • m + a • n </pre></div> </div> There is something interesting going on here. While it isn’t too surprising that the
- @@ -516,13 +516,13 @@ safely be used as an instance. The rule is easy to remember: each class appearin
 <code class="docutils literal notranslate">extends</code> clause should mention every type appearing in the parameters. Let us create our first module instance: a ring is a module over itself using its multiplication as a scalar multiplication. - <div class="highlight-lean notranslate"><div class="highlight"><pre>instance selfModule (R : Type) [Ring₃ R] : Module₁ R R where - smul := fun r s ↦ r*s - zero_smul := zero_mul - one_smul := one_mul - mul_smul := mul_assoc₃ - add_smul := Ring₃.right_distrib - smul_add := Ring₃.left_distrib + <div class="highlight-lean notranslate"><div class="highlight"><pre>instance selfModule (R : Type) [Ring₃ R] : Module₁ R R where + smul := fun r s ↦ r*s + zero_smul := zero_mul + one_smul := one_mul + mul_smul := mul_assoc₃ + add_smul := Ring₃.right_distrib + smul_add := Ring₃.left_distrib </pre></div> </div> As a second example, every abelian group is a module over <code class="docutils literal notranslate">ℤ</code> (this is one of the reason to
- @@ -530,26 +530,26 @@ generalize the theory of vector spaces by allowing non-invertible scalars). Firs
 scalar multiplication by a natural number for any type equipped with a zero and an addition: <code class="docutils literal notranslate">n • a</code> is defined as <code class="docutils literal notranslate">a + ⋯ + a</code> where <code class="docutils literal notranslate">a</code> appears <code class="docutils literal notranslate">n</code> times. Then this is extended to scalar multiplication by an integer by ensuring <code class="docutils literal notranslate">(-1) • a = -a</code>. - <div class="highlight-lean notranslate"><div class="highlight"><pre>def nsmul₁ [Zero M] [Add M] : ℕ → M → M - | 0, _ => 0 - | n + 1, a => a + nsmul₁ n a + <div class="highlight-lean notranslate"><div class="highlight"><pre>def nsmul₁ [Zero M] [Add M] : ℕ → M → M + | 0, _ => 0 + | n + 1, a => a + nsmul₁ n a - def zsmul₁ {M : Type*} [Zero M] [Add M] [Neg M] : ℤ → M → M - | Int.ofNat n, a => nsmul₁ n a - | Int.negSucc n, a => -nsmul₁ n.succ a + def zsmul₁ {M : Type*} [Zero M] [Add M] [Neg M] : ℤ → M → M + | Int.ofNat n, a => nsmul₁ n a + | Int.negSucc n, a => -nsmul₁ n.succ a </pre></div> </div> Proving this gives rise to a module structure is a bit tedious and not interesting for the current discussion, so we will sorry all axioms. You are not asked to replace those sorries with proofs. If you insist on doing it then you will probably want to state and prove several intermediate lemmas about <code class="docutils literal notranslate">nsmul₁</code> and <code class="docutils literal notranslate">zsmul₁</code>. - <div class="highlight-lean notranslate"><div class="highlight"><pre>instance abGrpModule (A : Type) [AddCommGroup₃ A] : Module₁ ℤ A where - smul := zsmul₁ - zero_smul := sorry - one_smul := sorry - mul_smul := sorry - add_smul := sorry - smul_add := sorry + <div class="highlight-lean notranslate"><div class="highlight"><pre>instance abGrpModule (A : Type) [AddCommGroup₃ A] : Module₁ ℤ A where + smul := zsmul₁ + zero_smul := sorry + one_smul := sorry + mul_smul := sorry + add_smul := sorry + smul_add := sorry </pre></div> </div> A much more important issue is that we now have two module structures over the ring <code class="docutils literal notranslate">ℤ</code>
- @@ -560,7 +560,7 @@ this isn’t true by definition, it requires a proof. This is very bad news
 instance resolution procedure and will lead to very frustrating failures for users of this hierarchy. When directly asked to find an instance, Lean will pick one, and we can see which one using: - <div class="highlight-lean notranslate"><div class="highlight"><pre>#synth Module₁ ℤ ℤ -- abGrpModule ℤ + <div class="highlight-lean notranslate"><div class="highlight"><pre>#synth Module₁ ℤ ℤ -- abGrpModule ℤ </pre></div> </div> But in a more indirect context it can happen that Lean infers the one and then gets confused.
- @@ -584,46 +584,46 @@ field and some <code class="docutils literal notranslate">Prop
 above. Those fields are given default values using <code class="docutils literal notranslate">:=</code> after their type in the definition below. Thanks to these default values, most instances would be constructed exactly as with our previous definitions. But in the special case of <code class="docutils literal notranslate">ℤ</code> we will be able to provide specific values. - <div class="highlight-lean notranslate"><div class="highlight"><pre>class AddMonoid₄ (M : Type) extends AddSemigroup₃ M, AddZeroClass M where - /-- Multiplication by a natural number. -/ - nsmul : ℕ → M → M := nsmul₁ - /-- Multiplication by `(0 : ℕ)` gives `0`. -/ - nsmul_zero : ∀ x, nsmul 0 x = 0 := by intros; rfl - /-- Multiplication by `(n + 1 : ℕ)` behaves as expected. -/ - nsmul_succ : ∀ (n : ℕ) (x), nsmul (n + 1) x = x + nsmul n x := by intros; rfl + <div class="highlight-lean notranslate"><div class="highlight"><pre>class AddMonoid₄ (M : Type) extends AddSemigroup₃ M, AddZeroClass M where + /-- Multiplication by a natural number. -/ + nsmul : ℕ → M → M := nsmul₁ + /-- Multiplication by `(0 : ℕ)` gives `0`. -/ + nsmul_zero : ∀ x, nsmul 0 x = 0 := by intros; rfl + /-- Multiplication by `(n + 1 : ℕ)` behaves as expected. -/ + nsmul_succ : ∀ (n : ℕ) (x), nsmul (n + 1) x = x + nsmul n x := by intros; rfl - instance mySMul {M : Type} [AddMonoid₄ M] : SMul ℕ M := ⟨AddMonoid₄.nsmul⟩ + instance mySMul {M : Type} [AddMonoid₄ M] : SMul ℕ M := ⟨AddMonoid₄.nsmul⟩ </pre></div> </div> Let us check we can still construct a product monoid instance without providing the <code class="docutils literal notranslate">nsmul</code> related fields. - <div class="highlight-lean notranslate"><div class="highlight"><pre>instance (M N : Type) [AddMonoid₄ M] [AddMonoid₄ N] : AddMonoid₄ (M × N) where - add := fun p q ↦ (p.1 + q.1, p.2 + q.2) - add_assoc₃ := fun a b c ↦ by ext <;> apply add_assoc₃ - zero := (0, 0) - zero_add := fun a ↦ by ext <;> apply zero_add - add_zero := fun a ↦ by ext <;> apply add_zero + <div class="highlight-lean notranslate"><div class="highlight"><pre>instance (M N : Type) [AddMonoid₄ M] [AddMonoid₄ N] : AddMonoid₄ (M × N) where + add := fun p q ↦ (p.1 + q.1, p.2 + q.2) + add_assoc₃ := fun a b c ↦ by ext <;> apply add_assoc₃ + zero := (0, 0) + zero_add := fun a ↦ by ext <;> apply zero_add + add_zero := fun a ↦ by ext <;> apply add_zero </pre></div> </div> And now let us handle the special case of <code class="docutils literal notranslate">ℤ</code> where we want to build <code class="docutils literal notranslate">nsmul</code> using the coercion of <code class="docutils literal notranslate">ℕ</code> to <code class="docutils literal notranslate">ℤ</code> and the multiplication on <code class="docutils literal notranslate">ℤ</code>. Note in particular how the proof fields contain more work than in the default value above. - <div class="highlight-lean notranslate"><div class="highlight"><pre>instance : AddMonoid₄ ℤ where - add := (· + ·) - add_assoc₃ := Int.add_assoc - zero := 0 - zero_add := Int.zero_add - add_zero := Int.add_zero - nsmul := fun n m ↦ (n : ℤ) * m - nsmul_zero := Int.zero_mul - nsmul_succ := fun n m ↦ show (n + 1 : ℤ) * m = m + n * m - by rw [Int.add_mul, Int.add_comm, Int.one_mul] + <div class="highlight-lean notranslate"><div class="highlight"><pre>instance : AddMonoid₄ ℤ where + add := (· + ·) + add_assoc₃ := Int.add_assoc + zero := 0 + zero_add := Int.zero_add + add_zero := Int.add_zero + nsmul := fun n m ↦ (n : ℤ) * m + nsmul_zero := Int.zero_mul + nsmul_succ := fun n m ↦ show (n + 1 : ℤ) * m = m + n * m + by rw [Int.add_mul, Int.add_comm, Int.one_mul] </pre></div> </div> Let us check we solved our issue. Because Lean already has a definition of scalar multiplication of a natural number and an integer, and we want to make sure our instance is used, we won’t use the <code class="docutils literal notranslate">•</code> notation but call <code class="docutils literal notranslate">SMul.mul</code> and explicitly provide our instance defined above. - <div class="highlight-lean notranslate"><div class="highlight"><pre>example (n : ℕ) (m : ℤ) : SMul.smul (self := mySMul) n m = n * m := rfl + <div class="highlight-lean notranslate"><div class="highlight"><pre>example (n : ℕ) (m : ℤ) : SMul.smul (self := mySMul) n m = n * m := rfl </pre></div> </div> This story then continues with incorporating a <code class="docutils literal notranslate">zsmul</code> field into the definition of groups
- @@ -641,16 +641,16 @@ that every preorder comes with a <code class="docutils literal notranslate"><spa
 So far in this chapter, we discussed how to create a hierarchy of mathematical structures. But defining structures is not really completed until we have morphisms. There are two main approaches here. The most obvious one is to define a predicate on functions. - <div class="highlight-lean notranslate"><div class="highlight"><pre>def isMonoidHom₁ [Monoid G] [Monoid H] (f : G → H) : Prop := - f 1 = 1 ∧ ∀ g g', f (g * g') = f g * f g' + <div class="highlight-lean notranslate"><div class="highlight"><pre>def isMonoidHom₁ [Monoid G] [Monoid H] (f : G → H) : Prop := + f 1 = 1 ∧ ∀ g g', f (g * g') = f g * f g' </pre></div> </div> In this definition, it is a bit unpleasant to use a conjunction. In particular users will need to remember the ordering we chose when they want to access the two conditions. So we could use a structure instead. - <div class="highlight-lean notranslate"><div class="highlight"><pre>structure isMonoidHom₂ [Monoid G] [Monoid H] (f : G → H) : Prop where - map_one : f 1 = 1 - map_mul : ∀ g g', f (g * g') = f g * f g' + <div class="highlight-lean notranslate"><div class="highlight"><pre>structure isMonoidHom₂ [Monoid G] [Monoid H] (f : G → H) : Prop where + map_one : f 1 = 1 + map_mul : ∀ g g', f (g * g') = f g * f g' </pre></div> </div> Once we are here, it is even tempting to make it a class and use the type class instance resolution
- @@ -668,17 +668,17 @@ It really feels like “monoid morphism” is not an adjective you can a
 it is a noun. On the other hand one can argue that a continuous function between topological spaces is really a function that happens to be continuous. This is one reason why Mathlib has a <code class="docutils literal notranslate">Continuous</code> predicate. For instance you can write: - <div class="highlight-lean notranslate"><div class="highlight"><pre>example : Continuous (id : ℝ → ℝ) := continuous_id + <div class="highlight-lean notranslate"><div class="highlight"><pre>example : Continuous (id : ℝ → ℝ) := continuous_id </pre></div> </div> We still have bundles continuous functions, which are convenient for instance to put a topology on a space of continuous functions, but they are not the primary tool to work with continuity. By contrast, morphisms between monoids (or other algebraic structures) are bundled as in: <div class="highlight-lean notranslate"><div class="highlight"><pre>@[ext] - structure MonoidHom₁ (G H : Type) [Monoid G] [Monoid H] where - toFun : G → H - map_one : toFun 1 = 1 - map_mul : ∀ g g', toFun (g * g') = toFun g * toFun g' + structure MonoidHom₁ (G H : Type) [Monoid G] [Monoid H] where + toFun : G → H + map_one : toFun 1 = 1 + map_mul : ∀ g g', toFun (g * g') = toFun g * toFun g' </pre></div> </div> Of course we don’t want to type <code class="docutils literal notranslate">toFun</code> everywhere so we register a coercion using
- @@ -686,30 +686,30 @@ the <code class="docutils literal notranslate">CoeFun</
 The second argument describes the target function type. In our case it is always <code class="docutils literal notranslate">G → H</code> for every <code class="docutils literal notranslate">f : MonoidHom₁ G H</code>. We also tag <code class="docutils literal notranslate">MonoidHom₁.toFun</code> with the <code class="docutils literal notranslate">coe</code> attribute to make sure it is displayed almost invisibly in the tactic state, simply by a <code class="docutils literal notranslate">↑</code> prefix. - <div class="highlight-lean notranslate"><div class="highlight"><pre>instance [Monoid G] [Monoid H] : CoeFun (MonoidHom₁ G H) (fun _ ↦ G → H) where - coe := MonoidHom₁.toFun + <div class="highlight-lean notranslate"><div class="highlight"><pre>instance [Monoid G] [Monoid H] : CoeFun (MonoidHom₁ G H) (fun _ ↦ G → H) where + coe := MonoidHom₁.toFun - attribute [coe] MonoidHom₁.toFun + attribute [coe] MonoidHom₁.toFun </pre></div> </div> Let us check we can indeed apply a bundled monoid morphism to an element. - <div class="highlight-lean notranslate"><div class="highlight"><pre>example [Monoid G] [Monoid H] (f : MonoidHom₁ G H) : f 1 = 1 := f.map_one + <div class="highlight-lean notranslate"><div class="highlight"><pre>example [Monoid G] [Monoid H] (f : MonoidHom₁ G H) : f 1 = 1 := f.map_one </pre></div> </div> We can do the same with other kind of morphisms until we reach ring morphisms. <div class="highlight-lean notranslate"><div class="highlight"><pre>@[ext] - structure AddMonoidHom₁ (G H : Type) [AddMonoid G] [AddMonoid H] where - toFun : G → H - map_zero : toFun 0 = 0 - map_add : ∀ g g', toFun (g + g') = toFun g + toFun g' + structure AddMonoidHom₁ (G H : Type) [AddMonoid G] [AddMonoid H] where + toFun : G → H + map_zero : toFun 0 = 0 + map_add : ∀ g g', toFun (g + g') = toFun g + toFun g' - instance [AddMonoid G] [AddMonoid H] : CoeFun (AddMonoidHom₁ G H) (fun _ ↦ G → H) where - coe := AddMonoidHom₁.toFun + instance [AddMonoid G] [AddMonoid H] : CoeFun (AddMonoidHom₁ G H) (fun _ ↦ G → H) where + coe := AddMonoidHom₁.toFun - attribute [coe] AddMonoidHom₁.toFun + attribute [coe] AddMonoidHom₁.toFun @[ext] - structure RingHom₁ (R S : Type) [Ring R] [Ring S] extends MonoidHom₁ R S, AddMonoidHom₁ R S + structure RingHom₁ (R S : Type) [Ring R] [Ring S] extends MonoidHom₁ R S, AddMonoidHom₁ R S </pre></div> </div> There are a couple of issues about this approach. A minor one is we don’t quite know where to put
- @@ -723,16 +723,16 @@ Neither option is appealing so Mathlib uses a new hierarchy trick here. The idea
 a type class for objects that are at least monoid morphisms, instantiate that class with both monoid morphisms and ring morphisms and use it to state every lemma. In the definition below, <code class="docutils literal notranslate">F</code> could be <code class="docutils literal notranslate">MonoidHom₁ M N</code>, or <code class="docutils literal notranslate">RingHom₁ M N</code> if <code class="docutils literal notranslate">M</code> and <code class="docutils literal notranslate">N</code> have a ring structure. - <div class="highlight-lean notranslate"><div class="highlight"><pre>class MonoidHomClass₁ (F : Type) (M N : Type) [Monoid M] [Monoid N] where - toFun : F → M → N - map_one : ∀ f : F, toFun f 1 = 1 - map_mul : ∀ f g g', toFun f (g * g') = toFun f g * toFun f g' + <div class="highlight-lean notranslate"><div class="highlight"><pre>class MonoidHomClass₁ (F : Type) (M N : Type) [Monoid M] [Monoid N] where + toFun : F → M → N + map_one : ∀ f : F, toFun f 1 = 1 + map_mul : ∀ f g g', toFun f (g * g') = toFun f g * toFun f g' </pre></div> </div> However there is a problem with the above implementation. We haven’t registered a coercion to function instance yet. Let us try to do it now. - <div class="highlight-lean notranslate"><div class="highlight"><pre>def badInst [Monoid M] [Monoid N] [MonoidHomClass₁ F M N] : CoeFun F (fun _ ↦ M → N) where - coe := MonoidHomClass₁.toFun + <div class="highlight-lean notranslate"><div class="highlight"><pre>def badInst [Monoid M] [Monoid N] [MonoidHomClass₁ F M N] : CoeFun F (fun _ ↦ M → N) where + coe := MonoidHomClass₁.toFun </pre></div> </div> Making this an instance would be bad. When faced with something like <code class="docutils literal notranslate">f x</code> where the type of <code class="docutils literal notranslate">f</code>
- @@ -750,41 +750,41 @@ replace <code class="docutils literal notranslate">def
 and <code class="docutils literal notranslate">N</code>. This is done using the <code class="docutils literal notranslate">outParam</code> function. This function is defined as the identity function, but is still recognized by the type class machinery and triggers the desired behavior. Hence we can retry defining our class, paying attention to the <code class="docutils literal notranslate">outParam</code> function: - <div class="highlight-lean notranslate"><div class="highlight"><pre>class MonoidHomClass₂ (F : Type) (M N : outParam Type) [Monoid M] [Monoid N] where - toFun : F → M → N - map_one : ∀ f : F, toFun f 1 = 1 - map_mul : ∀ f g g', toFun f (g * g') = toFun f g * toFun f g' + <div class="highlight-lean notranslate"><div class="highlight"><pre>class MonoidHomClass₂ (F : Type) (M N : outParam Type) [Monoid M] [Monoid N] where + toFun : F → M → N + map_one : ∀ f : F, toFun f 1 = 1 + map_mul : ∀ f g g', toFun f (g * g') = toFun f g * toFun f g' - instance [Monoid M] [Monoid N] [MonoidHomClass₂ F M N] : CoeFun F (fun _ ↦ M → N) where - coe := MonoidHomClass₂.toFun + instance [Monoid M] [Monoid N] [MonoidHomClass₂ F M N] : CoeFun F (fun _ ↦ M → N) where + coe := MonoidHomClass₂.toFun - attribute [coe] MonoidHomClass₂.toFun + attribute [coe] MonoidHomClass₂.toFun </pre></div> </div> Now we can proceed with our plan to instantiate this class. - <div class="highlight-lean notranslate"><div class="highlight"><pre>instance (M N : Type) [Monoid M] [Monoid N] : MonoidHomClass₂ (MonoidHom₁ M N) M N where - toFun := MonoidHom₁.toFun - map_one := fun f ↦ f.map_one - map_mul := fun f ↦ f.map_mul + <div class="highlight-lean notranslate"><div class="highlight"><pre>instance (M N : Type) [Monoid M] [Monoid N] : MonoidHomClass₂ (MonoidHom₁ M N) M N where + toFun := MonoidHom₁.toFun + map_one := fun f ↦ f.map_one + map_mul := fun f ↦ f.map_mul - instance (R S : Type) [Ring R] [Ring S] : MonoidHomClass₂ (RingHom₁ R S) R S where - toFun := fun f ↦ f.toMonoidHom₁.toFun - map_one := fun f ↦ f.toMonoidHom₁.map_one - map_mul := fun f ↦ f.toMonoidHom₁.map_mul + instance (R S : Type) [Ring R] [Ring S] : MonoidHomClass₂ (RingHom₁ R S) R S where + toFun := fun f ↦ f.toMonoidHom₁.toFun + map_one := fun f ↦ f.toMonoidHom₁.map_one + map_mul := fun f ↦ f.toMonoidHom₁.map_mul </pre></div> </div> As promised every lemma we prove about <code class="docutils literal notranslate">f : F</code> assuming an instance of <code class="docutils literal notranslate">MonoidHomClass₁ F</code> will apply both to monoid morphisms and ring morphisms. Let us see an example lemma and check it applies to both situations. - <div class="highlight-lean notranslate"><div class="highlight"><pre>lemma map_inv_of_inv [Monoid M] [Monoid N] [MonoidHomClass₂ F M N] (f : F) {m m' : M} (h : m*m' = 1) : - f m * f m' = 1 := by - rw [← MonoidHomClass₂.map_mul, h, MonoidHomClass₂.map_one] + <div class="highlight-lean notranslate"><div class="highlight"><pre>lemma map_inv_of_inv [Monoid M] [Monoid N] [MonoidHomClass₂ F M N] (f : F) {m m' : M} (h : m*m' = 1) : + f m * f m' = 1 := by + rw [← MonoidHomClass₂.map_mul, h, MonoidHomClass₂.map_one] - example [Monoid M] [Monoid N] (f : MonoidHom₁ M N) {m m' : M} (h : m*m' = 1) : f m * f m' = 1 := - map_inv_of_inv f h + example [Monoid M] [Monoid N] (f : MonoidHom₁ M N) {m m' : M} (h : m*m' = 1) : f m * f m' = 1 := + map_inv_of_inv f h - example [Ring R] [Ring S] (f : RingHom₁ R S) {r r' : R} (h : r*r' = 1) : f r * f r' = 1 := - map_inv_of_inv f h + example [Ring R] [Ring S] (f : RingHom₁ R S) {r r' : R} (h : r*r' = 1) : f r * f r' = 1 := + map_inv_of_inv f h </pre></div> </div> At first sight, it may look like we got back to our old bad idea of making <code class="docutils literal notranslate">MonoidHom₁</code> a class.
- @@ -797,16 +797,16 @@ to record that this pattern is used only for functions with extra properties, me
 coercion to functions should be injective. So Mathlib adds one more layer of abstraction with the base class <code class="docutils literal notranslate">DFunLike</code> (where “DFun” stands for dependent function). Let us redefine our <code class="docutils literal notranslate">MonoidHomClass</code> on top of this base layer. - <div class="highlight-lean notranslate"><div class="highlight"><pre>class MonoidHomClass₃ (F : Type) (M N : outParam Type) [Monoid M] [Monoid N] extends - DFunLike F M (fun _ ↦ N) where - map_one : ∀ f : F, f 1 = 1 - map_mul : ∀ (f : F) g g', f (g * g') = f g * f g' + <div class="highlight-lean notranslate"><div class="highlight"><pre>class MonoidHomClass₃ (F : Type) (M N : outParam Type) [Monoid M] [Monoid N] extends + DFunLike F M (fun _ ↦ N) where + map_one : ∀ f : F, f 1 = 1 + map_mul : ∀ (f : F) g g', f (g * g') = f g * f g' - instance (M N : Type) [Monoid M] [Monoid N] : MonoidHomClass₃ (MonoidHom₁ M N) M N where - coe := MonoidHom₁.toFun - coe_injective' := MonoidHom₁.ext - map_one := MonoidHom₁.map_one - map_mul := MonoidHom₁.map_mul + instance (M N : Type) [Monoid M] [Monoid N] : MonoidHomClass₃ (MonoidHom₁ M N) M N where + coe := MonoidHom₁.toFun + coe_injective' := MonoidHom₁.ext + map_one := MonoidHom₁.map_one + map_mul := MonoidHom₁.map_mul </pre></div> </div> Of course the hierarchy of morphisms does not stop here. We could go on and define a class
- @@ -820,24 +820,24 @@ Like continuous functions, order preserving functions are primarily unbundled in
 they are defined by the <code class="docutils literal notranslate">Monotone</code> predicate. Of course you need to complete the class definitions below. <div class="highlight-lean notranslate"><div class="highlight"><pre>@[ext] - structure OrderPresHom (α β : Type) [LE α] [LE β] where - toFun : α → β - le_of_le : ∀ a a', a ≤ a' → toFun a ≤ toFun a' + structure OrderPresHom (α β : Type) [LE α] [LE β] where + toFun : α → β + le_of_le : ∀ a a', a ≤ a' → toFun a ≤ toFun a' @[ext] - structure OrderPresMonoidHom (M N : Type) [Monoid M] [LE M] [Monoid N] [LE N] extends - MonoidHom₁ M N, OrderPresHom M N + structure OrderPresMonoidHom (M N : Type) [Monoid M] [LE M] [Monoid N] [LE N] extends + MonoidHom₁ M N, OrderPresHom M N - class OrderPresHomClass (F : Type) (α β : outParam Type) [LE α] [LE β] + class OrderPresHomClass (F : Type) (α β : outParam Type) [LE α] [LE β] - instance (α β : Type) [LE α] [LE β] : OrderPresHomClass (OrderPresHom α β) α β where + instance (α β : Type) [LE α] [LE β] : OrderPresHomClass (OrderPresHom α β) α β where - instance (α β : Type) [LE α] [Monoid α] [LE β] [Monoid β] : - OrderPresHomClass (OrderPresMonoidHom α β) α β where + instance (α β : Type) [LE α] [Monoid α] [LE β] [Monoid β] : + OrderPresHomClass (OrderPresMonoidHom α β) α β where - instance (α β : Type) [LE α] [Monoid α] [LE β] [Monoid β] : - MonoidHomClass₃ (OrderPresMonoidHom α β) α β - := sorry + instance (α β : Type) [LE α] [Monoid α] [LE β] [Monoid β] : + MonoidHomClass₃ (OrderPresMonoidHom α β) α β + := sorry </pre></div> </div> </section>
- @@ -853,65 +853,65 @@ to <code class="docutils literal notranslate">X Set</code> type and defines the corresponding coercion and <code class="docutils literal notranslate">Membership</code> instance. <div class="highlight-lean notranslate"><div class="highlight"><pre>@[ext] - structure Submonoid₁ (M : Type) [Monoid M] where - /-- The carrier of a submonoid. -/ - carrier : Set M - /-- The product of two elements of a submonoid belongs to the submonoid. -/ - mul_mem {a b} : a ∈ carrier → b ∈ carrier → a * b ∈ carrier - /-- The unit element belongs to the submonoid. -/ - one_mem : 1 ∈ carrier + structure Submonoid₁ (M : Type) [Monoid M] where + /-- The carrier of a submonoid. -/ + carrier : Set M + /-- The product of two elements of a submonoid belongs to the submonoid. -/ + mul_mem {a b} : a ∈ carrier → b ∈ carrier → a * b ∈ carrier + /-- The unit element belongs to the submonoid. -/ + one_mem : 1 ∈ carrier /-- Submonoids in `M` can be seen as sets in `M`. -/ - instance [Monoid M] : SetLike (Submonoid₁ M) M where - coe := Submonoid₁.carrier - coe_injective' := Submonoid₁.ext + instance [Monoid M] : SetLike (Submonoid₁ M) M where + coe := Submonoid₁.carrier + coe_injective' := Submonoid₁.ext </pre></div> </div> Equipped with the above <code class="docutils literal notranslate">SetLike</code> instance, we can already state naturally that a submonoid <code class="docutils literal notranslate">N</code> contains <code class="docutils literal notranslate">1</code> without using <code class="docutils literal notranslate">N.carrier</code>. We can also silently treat <code class="docutils literal notranslate">N</code> as a set in <code class="docutils literal notranslate">M</code> as take its direct image under a map. - <div class="highlight-lean notranslate"><div class="highlight"><pre>example [Monoid M] (N : Submonoid₁ M) : 1 ∈ N := N.one_mem + <div class="highlight-lean notranslate"><div class="highlight"><pre>example [Monoid M] (N : Submonoid₁ M) : 1 ∈ N := N.one_mem - example [Monoid M] (N : Submonoid₁ M) (α : Type) (f : M → α) := f '' N + example [Monoid M] (N : Submonoid₁ M) (α : Type) (f : M → α) := f '' N </pre></div> </div> We also have a coercion to <code class="docutils literal notranslate">Type</code> which uses <code class="docutils literal notranslate">Subtype</code> so, given a submonoid <code class="docutils literal notranslate">N</code> we can write a parameter <code class="docutils literal notranslate">(x : N)</code> which can be coerced to an element of <code class="docutils literal notranslate">M</code> belonging to <code class="docutils literal notranslate">N</code>. - <div class="highlight-lean notranslate"><div class="highlight"><pre>example [Monoid M] (N : Submonoid₁ M) (x : N) : (x : M) ∈ N := x.property + <div class="highlight-lean notranslate"><div class="highlight"><pre>example [Monoid M] (N : Submonoid₁ M) (x : N) : (x : M) ∈ N := x.property </pre></div> </div> Using this coercion to <code class="docutils literal notranslate">Type</code> we can also tackle the task of equipping a submonoid with a monoid structure. We will use the coercion from the type associated to <code class="docutils literal notranslate">N</code> as above, and the lemma <code class="docutils literal notranslate">SetCoe.ext</code> asserting this coercion is injective. Both are provided by the <code class="docutils literal notranslate">SetLike</code> instance. - <div class="highlight-lean notranslate"><div class="highlight"><pre>instance SubMonoid₁Monoid [Monoid M] (N : Submonoid₁ M) : Monoid N where - mul := fun x y ↦ ⟨x*y, N.mul_mem x.property y.property⟩ - mul_assoc := fun x y z ↦ SetCoe.ext (mul_assoc (x : M) y z) - one := ⟨1, N.one_mem⟩ - one_mul := fun x ↦ SetCoe.ext (one_mul (x : M)) - mul_one := fun x ↦ SetCoe.ext (mul_one (x : M)) + <div class="highlight-lean notranslate"><div class="highlight"><pre>instance SubMonoid₁Monoid [Monoid M] (N : Submonoid₁ M) : Monoid N where + mul := fun x y ↦ ⟨x*y, N.mul_mem x.property y.property⟩ + mul_assoc := fun x y z ↦ SetCoe.ext (mul_assoc (x : M) y z) + one := ⟨1, N.one_mem⟩ + one_mul := fun x ↦ SetCoe.ext (one_mul (x : M)) + mul_one := fun x ↦ SetCoe.ext (mul_one (x : M)) </pre></div> </div> Note that, in the above instance, instead of using the coercion to <code class="docutils literal notranslate">M</code> and calling the <code class="docutils literal notranslate">property</code> field, we could have used destructuring binders as follows. - <div class="highlight-lean notranslate"><div class="highlight"><pre>example [Monoid M] (N : Submonoid₁ M) : Monoid N where - mul := fun ⟨x, hx⟩ ⟨y, hy⟩ ↦ ⟨x*y, N.mul_mem hx hy⟩ - mul_assoc := fun ⟨x, _⟩ ⟨y, _⟩ ⟨z, _⟩ ↦ SetCoe.ext (mul_assoc x y z) - one := ⟨1, N.one_mem⟩ - one_mul := fun ⟨x, _⟩ ↦ SetCoe.ext (one_mul x) - mul_one := fun ⟨x, _⟩ ↦ SetCoe.ext (mul_one x) + <div class="highlight-lean notranslate"><div class="highlight"><pre>example [Monoid M] (N : Submonoid₁ M) : Monoid N where + mul := fun ⟨x, hx⟩ ⟨y, hy⟩ ↦ ⟨x*y, N.mul_mem hx hy⟩ + mul_assoc := fun ⟨x, _⟩ ⟨y, _⟩ ⟨z, _⟩ ↦ SetCoe.ext (mul_assoc x y z) + one := ⟨1, N.one_mem⟩ + one_mul := fun ⟨x, _⟩ ↦ SetCoe.ext (one_mul x) + mul_one := fun ⟨x, _⟩ ↦ SetCoe.ext (mul_one x) </pre></div> </div> In order to apply lemmas about submonoids to subgroups or subrings, we need a class, just like for morphisms. Note this class take a <code class="docutils literal notranslate">SetLike</code> instance as a parameter so it does not need a carrier field and can use the membership notation in its fields. - <div class="highlight-lean notranslate"><div class="highlight"><pre>class SubmonoidClass₁ (S : Type) (M : Type) [Monoid M] [SetLike S M] : Prop where - mul_mem : ∀ (s : S) {a b : M}, a ∈ s → b ∈ s → a * b ∈ s - one_mem : ∀ s : S, 1 ∈ s + <div class="highlight-lean notranslate"><div class="highlight"><pre>class SubmonoidClass₁ (S : Type) (M : Type) [Monoid M] [SetLike S M] : Prop where + mul_mem : ∀ (s : S) {a b : M}, a ∈ s → b ∈ s → a * b ∈ s + one_mem : ∀ s : S, 1 ∈ s - instance [Monoid M] : SubmonoidClass₁ (Submonoid₁ M) M where - mul_mem := Submonoid₁.mul_mem - one_mem := Submonoid₁.one_mem + instance [Monoid M] : SubmonoidClass₁ (Submonoid₁ M) M where + mul_mem := Submonoid₁.mul_mem + one_mem := Submonoid₁.one_mem </pre></div> </div> As an exercise you should define a <code class="docutils literal notranslate">Subgroup₁</code> structure, endow it with a <code class="docutils literal notranslate">SetLike</code> instance
- @@ -921,15 +921,15 @@ and a <code class="docutils literal notranslate">SubmonoidClas
 always form a complete lattice, and this structure is used a lot. For instance you may look for the lemma saying that an intersection of submonoids is a submonoid. But this won’t be a lemma, this will be an infimum construction. Let us do the case of two submonoids. - <div class="highlight-lean notranslate"><div class="highlight"><pre>instance [Monoid M] : Inf (Submonoid₁ M) := - ⟨fun S₁ S₂ ↦ - { carrier := S₁ ∩ S₂ - one_mem := ⟨S₁.one_mem, S₂.one_mem⟩ - mul_mem := fun ⟨hx, hx'⟩ ⟨hy, hy'⟩ ↦ ⟨S₁.mul_mem hx hy, S₂.mul_mem hx' hy'⟩ }⟩ + <div class="highlight-lean notranslate"><div class="highlight"><pre>instance [Monoid M] : Inf (Submonoid₁ M) := + ⟨fun S₁ S₂ ↦ + { carrier := S₁ ∩ S₂ + one_mem := ⟨S₁.one_mem, S₂.one_mem⟩ + mul_mem := fun ⟨hx, hx'⟩ ⟨hy, hy'⟩ ↦ ⟨S₁.mul_mem hx hy, S₂.mul_mem hx' hy'⟩ }⟩ </pre></div> </div> This allows to get the intersections of two submonoids as a submonoid. - <div class="highlight-lean notranslate"><div class="highlight"><pre>example [Monoid M] (N P : Submonoid₁ M) : Submonoid₁ M := N ⊓ P + <div class="highlight-lean notranslate"><div class="highlight"><pre>example [Monoid M] (N P : Submonoid₁ M) : Submonoid₁ M := N ⊓ P </pre></div> </div> You may think it’s a shame that we had to use the inf symbol <code class="docutils literal notranslate">⊓</code> in the above example instead
- @@ -951,31 +951,31 @@ is the <code class="docutils literal notranslate">HasQuotient<
 to you. In the last example, you can use <code class="docutils literal notranslate">Setoid.refl</code> but it won’t automatically pick up the relevant <code class="docutils literal notranslate">Setoid</code> structure. You can fix this issue by providing all arguments using the <code class="docutils literal notranslate">@</code> syntax, as in <code class="docutils literal notranslate">@Setoid.refl M N.Setoid</code>. - <div class="highlight-lean notranslate"><div class="highlight"><pre>def Submonoid.Setoid [CommMonoid M] (N : Submonoid M) : Setoid M where - r := fun x y ↦ ∃ w ∈ N, ∃ z ∈ N, x*w = y*z - iseqv := { - refl := fun x ↦ ⟨1, N.one_mem, 1, N.one_mem, rfl⟩ - symm := fun ⟨w, hw, z, hz, h⟩ ↦ ⟨z, hz, w, hw, h.symm⟩ - trans := by - sorry - } - - instance [CommMonoid M] : HasQuotient M (Submonoid M) where - quotient' := fun N ↦ Quotient N.Setoid - - def QuotientMonoid.mk [CommMonoid M] (N : Submonoid M) : M → M ⧸ N := Quotient.mk N.Setoid - - instance [CommMonoid M] (N : Submonoid M) : Monoid (M ⧸ N) where - mul := Quotient.map₂' (· * ·) (by - sorry - ) - mul_assoc := by - sorry - one := QuotientMonoid.mk N 1 - one_mul := by - sorry - mul_one := by - sorry + <div class="highlight-lean notranslate"><div class="highlight"><pre>def Submonoid.Setoid [CommMonoid M] (N : Submonoid M) : Setoid M where + r := fun x y ↦ ∃ w ∈ N, ∃ z ∈ N, x*w = y*z + iseqv := { + refl := fun x ↦ ⟨1, N.one_mem, 1, N.one_mem, rfl⟩ + symm := fun ⟨w, hw, z, hz, h⟩ ↦ ⟨z, hz, w, hw, h.symm⟩ + trans := by + sorry + } + + instance [CommMonoid M] : HasQuotient M (Submonoid M) where + quotient' := fun N ↦ Quotient N.Setoid + + def QuotientMonoid.mk [CommMonoid M] (N : Submonoid M) : M → M ⧸ N := Quotient.mk N.Setoid + + instance [CommMonoid M] (N : Submonoid M) : Monoid (M ⧸ N) where + mul := Quotient.map₂' (· * ·) (by + sorry + ) + mul_assoc := by + sorry + one := QuotientMonoid.mk N 1 + one_mul := by + sorry + mul_one := by + sorry </pre></div> </div> </section>
html/C08_Groups_and_Rings.html
- @@ -18,7 +18,7 @@
 <script src="_static/jquery.js?v=5d32c60e"></script> <script src="_static/_sphinx_javascript_frameworks_compat.js?v=2cd50e6c"></script> <script src="_static/documentation_options.js?v=2709fde1"></script> - <script src="_static/doctools.js?v=888ff710"></script> + <script src="_static/doctools.js?v=9a2dae69"></script> <script src="_static/sphinx_highlight.js?v=dc90522c"></script> <script async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-mml-chtml.js"></script> <script src="_static/js/theme.js"></script>
- @@ -145,9 +145,9 @@ argument (in other words, in square brackets).
 By default, <code class="docutils literal notranslate">Monoid</code> uses multiplicative notation for the operation; for additive notation use <code class="docutils literal notranslate">AddMonoid</code> instead. The commutative versions of these structures add the prefix <code class="docutils literal notranslate">Comm</code> before <code class="docutils literal notranslate">Monoid</code>. - <div class="highlight-lean notranslate"><div class="highlight"><pre>example {M : Type*} [Monoid M] (x : M) : x * 1 = x := mul_one x + <div class="highlight-lean notranslate"><div class="highlight"><pre>example {M : Type*} [Monoid M] (x : M) : x * 1 = x := mul_one x - example {M : Type*} [AddCommMonoid M] (x y : M) : x + y = y + x := add_comm x y + example {M : Type*} [AddCommMonoid M] (x y : M) : x + y = y + x := add_comm x y </pre></div> </div> Note that although <code class="docutils literal notranslate">AddMonoid</code> is found in the library,
- @@ -156,19 +156,19 @@ it is generally confusing to use additive notation with a non-commutative operat
 <code class="docutils literal notranslate">M →* N</code>. Lean will automatically see such a morphism as a function from <code class="docutils literal notranslate">M</code> to <code class="docutils literal notranslate">N</code> when we apply it to elements of <code class="docutils literal notranslate">M</code>. The additive version is called <code class="docutils literal notranslate">AddMonoidHom</code> and written <code class="docutils literal notranslate">M →+ N</code>. - <div class="highlight-lean notranslate"><div class="highlight"><pre>example {M N : Type*} [Monoid M] [Monoid N] (x y : M) (f : M →* N) : f (x * y) = f x * f y := - f.map_mul x y + <div class="highlight-lean notranslate"><div class="highlight"><pre>example {M N : Type*} [Monoid M] [Monoid N] (x y : M) (f : M →* N) : f (x * y) = f x * f y := + f.map_mul x y - example {M N : Type*} [AddMonoid M] [AddMonoid N] (f : M →+ N) : f 0 = 0 := - f.map_zero + example {M N : Type*} [AddMonoid M] [AddMonoid N] (f : M →+ N) : f 0 = 0 := + f.map_zero </pre></div> </div> These morphisms are bundled maps, i.e. they package together a map and some of its properties. Remember that <a class="reference internal" href="C07_Hierarchies.html#section-hierarchies-morphisms">Section 7.2</a> explains bundled maps; here we simply note the slightly unfortunate consequence that we cannot use ordinary function composition to compose maps. Instead, we need to use <code class="docutils literal notranslate">MonoidHom.comp</code> and <code class="docutils literal notranslate">AddMonoidHom.comp</code>. - <div class="highlight-lean notranslate"><div class="highlight"><pre>example {M N P : Type*} [AddMonoid M] [AddMonoid N] [AddMonoid P] - (f : M →+ N) (g : N →+ P) : M →+ P := g.comp f + <div class="highlight-lean notranslate"><div class="highlight"><pre>example {M N P : Type*} [AddMonoid M] [AddMonoid N] [AddMonoid P] + (f : M →+ N) (g : N →+ P) : M →+ P := g.comp f </pre></div> </div> </section>
- @@ -176,31 +176,31 @@ composition to compose maps. Instead, we need to use <code class="docutils liter
 <h3>8.1.2. Groups and their morphisms<a class="headerlink" href="#groups-and-their-morphisms" title="Link to this heading"></a></h3> We will have much more to say about groups, which are monoids with the extra property that every element has an inverse. - <div class="highlight-lean notranslate"><div class="highlight"><pre>example {G : Type*} [Group G] (x : G) : x * x⁻¹ = 1 := mul_inv_self x + <div class="highlight-lean notranslate"><div class="highlight"><pre>example {G : Type*} [Group G] (x : G) : x * x⁻¹ = 1 := mul_inv_self x </pre></div> </div> Similar to the <code class="docutils literal notranslate">ring</code> tactic that we saw earlier, there is a <code class="docutils literal notranslate">group</code> tactic that proves any identity that holds in any group. (Equivalently, it proves the identities that hold in free groups.) - <div class="highlight-lean notranslate"><div class="highlight"><pre>example {G : Type*} [Group G] (x y z : G) : x * (y * z) * (x * z)⁻¹ * (x * y * x⁻¹)⁻¹ = 1 := by - group + <div class="highlight-lean notranslate"><div class="highlight"><pre>example {G : Type*} [Group G] (x y z : G) : x * (y * z) * (x * z)⁻¹ * (x * y * x⁻¹)⁻¹ = 1 := by + group </pre></div> </div> There is also a tactic for identities in commutative additive groups called <code class="docutils literal notranslate">abel</code>. - <div class="highlight-lean notranslate"><div class="highlight"><pre>example {G : Type*} [AddCommGroup G] (x y z : G) : z + x + (y - z - x) = y := by - abel + <div class="highlight-lean notranslate"><div class="highlight"><pre>example {G : Type*} [AddCommGroup G] (x y z : G) : z + x + (y - z - x) = y := by + abel </pre></div> </div> Interestingly, a group morphism is nothing more than a monoid morphism between groups. So we can copy and paste one of our earlier examples, replacing <code class="docutils literal notranslate">Monoid</code> with <code class="docutils literal notranslate">Group</code>. - <div class="highlight-lean notranslate"><div class="highlight"><pre>example {G H : Type*} [Group G] [Group H] (x y : G) (f : G →* H) : f (x * y) = f x * f y := - f.map_mul x y + <div class="highlight-lean notranslate"><div class="highlight"><pre>example {G H : Type*} [Group G] [Group H] (x y : G) (f : G →* H) : f (x * y) = f x * f y := + f.map_mul x y </pre></div> </div> Of course we do get some new properties, such as this one: - <div class="highlight-lean notranslate"><div class="highlight"><pre>example {G H : Type*} [Group G] [Group H] (x : G) (f : G →* H) : f (x⁻¹) = (f x)⁻¹ := - f.map_inv x + <div class="highlight-lean notranslate"><div class="highlight"><pre>example {G H : Type*} [Group G] [Group H] (x : G) (f : G →* H) : f (x⁻¹) = (f x)⁻¹ := + f.map_inv x </pre></div> </div> You may be worried that constructing group morphisms will require us to do unnecessary work since
- @@ -208,9 +208,9 @@ the definition of monoid morphism enforces that neutral elements are sent to neu
 while this is automatic in the case of group morphisms. In practice the extra work is not hard, but, to avoid it, there is a function building a group morphism from a function between groups that is compatible with the composition laws. - <div class="highlight-lean notranslate"><div class="highlight"><pre>example {G H : Type*} [Group G] [Group H] (f : G → H) (h : ∀ x y, f (x * y) = f x * f y) : - G →* H := - MonoidHom.mk' f h + <div class="highlight-lean notranslate"><div class="highlight"><pre>example {G H : Type*} [Group G] [Group H] (f : G → H) (h : ∀ x y, f (x * y) = f x * f y) : + G →* H := + MonoidHom.mk' f h </pre></div> </div> There is also a type <code class="docutils literal notranslate">MulEquiv</code> of group (or monoid) isomorphisms denoted by <code class="docutils literal notranslate">≃*</code> (and
- @@ -221,17 +221,17 @@ the identity isomorphism of <code class="docutils literal notranslate">f.symm</code> and <code class="docutils literal notranslate">f.trans g</code> respectively. Elements of this type are automatically coerced to morphisms and functions when necessary. - <div class="highlight-lean notranslate"><div class="highlight"><pre>example {G H : Type*} [Group G] [Group H] (f : G ≃* H) : - f.trans f.symm = MulEquiv.refl G := - f.self_trans_symm + <div class="highlight-lean notranslate"><div class="highlight"><pre>example {G H : Type*} [Group G] [Group H] (f : G ≃* H) : + f.trans f.symm = MulEquiv.refl G := + f.self_trans_symm </pre></div> </div> One can use <code class="docutils literal notranslate">MulEquiv.ofBijective</code> to build an isomorphism from a bijective morphism. Doing so makes the inverse function noncomputable. - <div class="highlight-lean notranslate"><div class="highlight"><pre>noncomputable example {G H : Type*} [Group G] [Group H] - (f : G →* H) (h : Function.Bijective f) : - G ≃* H := - MulEquiv.ofBijective f h + <div class="highlight-lean notranslate"><div class="highlight"><pre>noncomputable example {G H : Type*} [Group G] [Group H] + (f : G →* H) (h : Function.Bijective f) : + G ≃* H := + MulEquiv.ofBijective f h </pre></div> </div> </section>
- @@ -239,13 +239,13 @@ Doing so makes the inverse function noncomputable.
 <h3>8.1.3. Subgroups<a class="headerlink" href="#subgroups" title="Link to this heading"></a></h3> Just as group morphisms are bundled, a subgroup of <code class="docutils literal notranslate">G</code> is also a bundled structure consisting of a set in <code class="docutils literal notranslate">G</code> with the relevant closure properties. - <div class="highlight-lean notranslate"><div class="highlight"><pre>example {G : Type*} [Group G] (H : Subgroup G) {x y : G} (hx : x ∈ H) (hy : y ∈ H) : - x * y ∈ H := - H.mul_mem hx hy + <div class="highlight-lean notranslate"><div class="highlight"><pre>example {G : Type*} [Group G] (H : Subgroup G) {x y : G} (hx : x ∈ H) (hy : y ∈ H) : + x * y ∈ H := + H.mul_mem hx hy - example {G : Type*} [Group G] (H : Subgroup G) {x : G} (hx : x ∈ H) : - x⁻¹ ∈ H := - H.inv_mem hx + example {G : Type*} [Group G] (H : Subgroup G) {x : G} (hx : x ∈ H) : + x⁻¹ ∈ H := + H.inv_mem hx </pre></div> </div> In the example above, it is important to understand that <code class="docutils literal notranslate">Subgroup G</code> is the type of subgroups
- @@ -258,29 +258,29 @@ equal in the same way it is used to prove that two sets are equal.
 To state and prove, for example, that <code class="docutils literal notranslate">ℤ</code> is an additive subgroup of <code class="docutils literal notranslate">ℚ</code>, what we really want is to construct a term of type <code class="docutils literal notranslate">AddSubgroup ℚ</code> whose projection to <code class="docutils literal notranslate">Set ℚ</code> is <code class="docutils literal notranslate">ℤ</code>, or, more precisely, the image of <code class="docutils literal notranslate">ℤ</code> in <code class="docutils literal notranslate">ℚ</code>. - <div class="highlight-lean notranslate"><div class="highlight"><pre>example : AddSubgroup ℚ where - carrier := Set.range ((↑) : ℤ → ℚ) - add_mem' := by - rintro _ _ ⟨n, rfl⟩ ⟨m, rfl⟩ - use n + m - simp - zero_mem' := by - use 0 - simp - neg_mem' := by - rintro _ ⟨n, rfl⟩ - use -n - simp + <div class="highlight-lean notranslate"><div class="highlight"><pre>example : AddSubgroup ℚ where + carrier := Set.range ((↑) : ℤ → ℚ) + add_mem' := by + rintro _ _ ⟨n, rfl⟩ ⟨m, rfl⟩ + use n + m + simp + zero_mem' := by + use 0 + simp + neg_mem' := by + rintro _ ⟨n, rfl⟩ + use -n + simp </pre></div> </div> Using type classes, Mathlib knows that a subgroup of a group inherits a group structure. - <div class="highlight-lean notranslate"><div class="highlight"><pre>example {G : Type*} [Group G] (H : Subgroup G) : Group H := inferInstance + <div class="highlight-lean notranslate"><div class="highlight"><pre>example {G : Type*} [Group G] (H : Subgroup G) : Group H := inferInstance </pre></div> </div> This example is subtle. The object <code class="docutils literal notranslate">H</code> is not a type, but Lean automatically coerces it to a type by interpreting it as a subtype of <code class="docutils literal notranslate">G</code>. So the above example can be restated more explicitly as: - <div class="highlight-lean notranslate"><div class="highlight"><pre>example {G : Type*} [Group G] (H : Subgroup G) : Group {x : G // x ∈ H} := inferInstance + <div class="highlight-lean notranslate"><div class="highlight"><pre>example {G : Type*} [Group G] (H : Subgroup G) : Group {x : G // x ∈ H} := inferInstance </pre></div> </div> An important benefit of having a type <code class="docutils literal notranslate">Subgroup G</code> instead of a predicate
- @@ -292,8 +292,8 @@ have used the lattice operation <code class="docutils literal notranslate"> Let us check that the set underlying the infimum of two subgroups is indeed, by definition, their intersection. - <div class="highlight-lean notranslate"><div class="highlight"><pre>example {G : Type*} [Group G] (H H' : Subgroup G) : - ((H ⊓ H' : Subgroup G) : Set G) = (H : Set G) ∩ (H' : Set G) := rfl + <div class="highlight-lean notranslate"><div class="highlight"><pre>example {G : Type*} [Group G] (H H' : Subgroup G) : + ((H ⊓ H' : Subgroup G) : Set G) = (H : Set G) ∩ (H' : Set G) := rfl </pre></div> </div> It may look strange to have a different notation for what amounts to the intersection of the
- @@ -301,36 +301,36 @@ underlying sets, but the correspondence does not carry over to the supremum oper
 union, since a union of subgroups is not, in general, a subgroup. Instead one needs to use the subgroup generated by the union, which is done using <code class="docutils literal notranslate">Subgroup.closure</code>. - <div class="highlight-lean notranslate"><div class="highlight"><pre>example {G : Type*} [Group G] (H H' : Subgroup G) : - ((H ⊔ H' : Subgroup G) : Set G) = Subgroup.closure ((H : Set G) ∪ (H' : Set G)) := by - rw [Subgroup.sup_eq_closure] + <div class="highlight-lean notranslate"><div class="highlight"><pre>example {G : Type*} [Group G] (H H' : Subgroup G) : + ((H ⊔ H' : Subgroup G) : Set G) = Subgroup.closure ((H : Set G) ∪ (H' : Set G)) := by + rw [Subgroup.sup_eq_closure] </pre></div> </div> Another subtlety is that <code class="docutils literal notranslate">G</code> itself does not have type <code class="docutils literal notranslate">Subgroup G</code>, so we need a way to talk about <code class="docutils literal notranslate">G</code> seen as a subgroup of <code class="docutils literal notranslate">G</code>. This is also provided by the lattice structure: the full subgroup is the top element of this lattice. - <div class="highlight-lean notranslate"><div class="highlight"><pre>example {G : Type*} [Group G] (x : G) : x ∈ (⊤ : Subgroup G) := trivial + <div class="highlight-lean notranslate"><div class="highlight"><pre>example {G : Type*} [Group G] (x : G) : x ∈ (⊤ : Subgroup G) := trivial </pre></div> </div> Similarly the bottom element of this lattice is the subgroup whose only element is the neutral element. - <div class="highlight-lean notranslate"><div class="highlight"><pre>example {G : Type*} [Group G] (x : G) : x ∈ (⊥ : Subgroup G) ↔ x = 1 := Subgroup.mem_bot + <div class="highlight-lean notranslate"><div class="highlight"><pre>example {G : Type*} [Group G] (x : G) : x ∈ (⊥ : Subgroup G) ↔ x = 1 := Subgroup.mem_bot </pre></div> </div> As an exercise in manipulating groups and subgroups, you can define the conjugate of a subgroup by an element of the ambient group. - <div class="highlight-lean notranslate"><div class="highlight"><pre>def conjugate {G : Type*} [Group G] (x : G) (H : Subgroup G) : Subgroup G where - carrier := {a : G | ∃ h, h ∈ H ∧ a = x * h * x⁻¹} - one_mem' := by - dsimp - sorry - inv_mem' := by - dsimp - sorry - mul_mem' := by - dsimp - sorry + <div class="highlight-lean notranslate"><div class="highlight"><pre>def conjugate {G : Type*} [Group G] (x : G) (H : Subgroup G) : Subgroup G where + carrier := {a : G | ∃ h, h ∈ H ∧ a = x * h * x⁻¹} + one_mem' := by + dsimp + sorry + inv_mem' := by + dsimp + sorry + mul_mem' := by + dsimp + sorry </pre></div> </div> Tying the previous two topics together, one can push forward and pull back subgroups using
- @@ -338,55 +338,55 @@ group morphisms. The naming convention in Mathlib is to call those operations <c
 and <code class="docutils literal notranslate">comap</code>. These are not the common mathematical terms, but they have the advantage of being shorter than “pushforward” and “direct image.” - <div class="highlight-lean notranslate"><div class="highlight"><pre>example {G H : Type*} [Group G] [Group H] (G' : Subgroup G) (f : G →* H) : Subgroup H := - Subgroup.map f G' + <div class="highlight-lean notranslate"><div class="highlight"><pre>example {G H : Type*} [Group G] [Group H] (G' : Subgroup G) (f : G →* H) : Subgroup H := + Subgroup.map f G' - example {G H : Type*} [Group G] [Group H] (H' : Subgroup H) (f : G →* H) : Subgroup G := - Subgroup.comap f H' + example {G H : Type*} [Group G] [Group H] (H' : Subgroup H) (f : G →* H) : Subgroup G := + Subgroup.comap f H' - #check Subgroup.mem_map - #check Subgroup.mem_comap + #check Subgroup.mem_map + #check Subgroup.mem_comap </pre></div> </div> In particular, the preimage of the bottom subgroup under a morphism <code class="docutils literal notranslate">f</code> is a subgroup called the kernel of <code class="docutils literal notranslate">f</code>, and the range of <code class="docutils literal notranslate">f</code> is also a subgroup. - <div class="highlight-lean notranslate"><div class="highlight"><pre>example {G H : Type*} [Group G] [Group H] (f : G →* H) (g : G) : - g ∈ MonoidHom.ker f ↔ f g = 1 := - f.mem_ker + <div class="highlight-lean notranslate"><div class="highlight"><pre>example {G H : Type*} [Group G] [Group H] (f : G →* H) (g : G) : + g ∈ MonoidHom.ker f ↔ f g = 1 := + f.mem_ker - example {G H : Type*} [Group G] [Group H] (f : G →* H) (h : H) : - h ∈ MonoidHom.range f ↔ ∃ g : G, f g = h := - f.mem_range + example {G H : Type*} [Group G] [Group H] (f : G →* H) (h : H) : + h ∈ MonoidHom.range f ↔ ∃ g : G, f g = h := + f.mem_range </pre></div> </div> As exercises in manipulating group morphisms and subgroups, let us prove some elementary properties. They are already proved in Mathlib, so do not use <code class="docutils literal notranslate">exact?</code> too quickly if you want to benefit from these exercises. - <div class="highlight-lean notranslate"><div class="highlight"><pre>section exercises - variable {G H : Type*} [Group G] [Group H] + <div class="highlight-lean notranslate"><div class="highlight"><pre>section exercises + variable {G H : Type*} [Group G] [Group H] - open Subgroup + open Subgroup - example (φ : G →* H) (S T : Subgroup H) (hST : S ≤ T) : comap φ S ≤ comap φ T := by - sorry + example (φ : G →* H) (S T : Subgroup H) (hST : S ≤ T) : comap φ S ≤ comap φ T := by + sorry - example (φ : G →* H) (S T : Subgroup G) (hST : S ≤ T) : map φ S ≤ map φ T := by - sorry + example (φ : G →* H) (S T : Subgroup G) (hST : S ≤ T) : map φ S ≤ map φ T := by + sorry - variable {K : Type*} [Group K] + variable {K : Type*} [Group K] -- Remember you can use the `ext` tactic to prove an equality of subgroups. - example (φ : G →* H) (ψ : H →* K) (U : Subgroup K) : - comap (ψ.comp φ) U = comap φ (comap ψ U) := by - sorry + example (φ : G →* H) (ψ : H →* K) (U : Subgroup K) : + comap (ψ.comp φ) U = comap φ (comap ψ U) := by + sorry -- Pushing a subgroup along one homomorphism and then another is equal to -- pushing it forward along the composite of the homomorphisms. - example (φ : G →* H) (ψ : H →* K) (S : Subgroup G) : - map (ψ.comp φ) S = map ψ (S.map φ) := by - sorry + example (φ : G →* H) (ψ : H →* K) (S : Subgroup G) : + map (ψ.comp φ) S = map ψ (S.map φ) := by + sorry - end exercises + end exercises </pre></div> </div> Let us finish this introduction to subgroups in Mathlib with two very classical results.
- @@ -394,32 +394,32 @@ Lagrange theorem states the cardinality of a subgroup of a finite group divides
 the group. Sylow’s first theorem is a famous partial converse to Lagrange’s theorem. While this corner of Mathlib is partly set up to allow computation, we can tell Lean to use nonconstructive logic anyway using the following <code class="docutils literal notranslate">open scoped</code> command. - <div class="highlight-lean notranslate"><div class="highlight"><pre>open scoped Classical + <div class="highlight-lean notranslate"><div class="highlight"><pre>open scoped Classical - example {G : Type*} [Group G] (G' : Subgroup G) : Nat.card G' ∣ Nat.card G := - ⟨G'.index, mul_comm G'.index _ ▸ G'.index_mul_card.symm⟩ + example {G : Type*} [Group G] (G' : Subgroup G) : Nat.card G' ∣ Nat.card G := + ⟨G'.index, mul_comm G'.index _ ▸ G'.index_mul_card.symm⟩ - open Subgroup + open Subgroup - example {G : Type*} [Group G] [Finite G] (p : ℕ) {n : ℕ} [Fact p.Prime] - (hdvd : p ^ n ∣ Nat.card G) : ∃ K : Subgroup G, Nat.card K = p ^ n := - Sylow.exists_subgroup_card_pow_prime p hdvd + example {G : Type*} [Group G] [Finite G] (p : ℕ) {n : ℕ} [Fact p.Prime] + (hdvd : p ^ n ∣ Nat.card G) : ∃ K : Subgroup G, Nat.card K = p ^ n := + Sylow.exists_subgroup_card_pow_prime p hdvd </pre></div> </div> The next two exercises derive a corollary of Lagrange’s lemma. (This is also already in Mathlib, so do not use <code class="docutils literal notranslate">exact?</code> too quickly.) - <div class="highlight-lean notranslate"><div class="highlight"><pre>lemma eq_bot_iff_card {G : Type*} [Group G] {H : Subgroup G} : - H = ⊥ ↔ Nat.card H = 1 := by - suffices (∀ x ∈ H, x = 1) ↔ ∃ x ∈ H, ∀ a ∈ H, a = x by - simpa [eq_bot_iff_forall, Nat.card_eq_one_iff_exists] - sorry + <div class="highlight-lean notranslate"><div class="highlight"><pre>lemma eq_bot_iff_card {G : Type*} [Group G] {H : Subgroup G} : + H = ⊥ ↔ Nat.card H = 1 := by + suffices (∀ x ∈ H, x = 1) ↔ ∃ x ∈ H, ∀ a ∈ H, a = x by + simpa [eq_bot_iff_forall, Nat.card_eq_one_iff_exists] + sorry - #check card_dvd_of_le + #check card_dvd_of_le - lemma inf_bot_of_coprime {G : Type*} [Group G] (H K : Subgroup G) - (h : (Nat.card H).Coprime (Nat.card K)) : H ⊓ K = ⊥ := by - sorry + lemma inf_bot_of_coprime {G : Type*} [Group G] (H K : Subgroup G) + (h : (Nat.card H).Coprime (Nat.card K)) : H ⊓ K = ⊥ := by + sorry </pre></div> </div> </section>
- @@ -431,10 +431,10 @@ For instance, given any type <code class="docutils literal notranslate">$\mathfrak{S}_n$ is <code class="docutils literal notranslate">Equiv.Perm (Fin n)</code>. One can state abstract results about this group, for instance saying that <code class="docutils literal notranslate">Equiv.Perm X</code> is generated by cycles if <code class="docutils literal notranslate">X</code> is finite. - <div class="highlight-lean notranslate"><div class="highlight"><pre>open Equiv + <div class="highlight-lean notranslate"><div class="highlight"><pre>open Equiv - example {X : Type*} [Finite X] : Subgroup.closure {σ : Perm X | Perm.IsCycle σ} = ⊤ := - Perm.closure_isCycle + example {X : Type*} [Finite X] : Subgroup.closure {σ : Perm X | Perm.IsCycle σ} = ⊤ := + Perm.closure_isCycle </pre></div> </div> One can be fully concrete and compute actual products of cycles. Below we use the <code class="docutils literal notranslate">#simp</code> command,
- @@ -442,20 +442,20 @@ which calls the <code class="docutils literal notranslate">sim
 cyclic permutation. In the example, the result is a permutation of <code class="docutils literal notranslate">ℕ</code>. One could use a type ascription such as <code class="docutils literal notranslate">(1 : Fin 5)</code> on the first number appearing to make it a computation in <code class="docutils literal notranslate">Perm (Fin 5)</code>. - <div class="highlight-lean notranslate"><div class="highlight"><pre>#simp [mul_assoc] c[1, 2, 3] * c[2, 3, 4] + <div class="highlight-lean notranslate"><div class="highlight"><pre>#simp [mul_assoc] c[1, 2, 3] * c[2, 3, 4] </pre></div> </div> Another way to work with concrete groups is to use free groups and group presentations. The free group on a type <code class="docutils literal notranslate">α</code> is <code class="docutils literal notranslate">FreeGroup α</code> and the inclusion map is <code class="docutils literal notranslate">FreeGroup.of : α → FreeGroup α</code>. For instance let us define a type <code class="docutils literal notranslate">S</code> with three elements denoted by <code class="docutils literal notranslate">a</code>, <code class="docutils literal notranslate">b</code> and <code class="docutils literal notranslate">c</code>, and the element <code class="docutils literal notranslate">ab⁻¹</code> of the corresponding free group. - <div class="highlight-lean notranslate"><div class="highlight"><pre>section FreeGroup + <div class="highlight-lean notranslate"><div class="highlight"><pre>section FreeGroup - inductive S | a | b | c + inductive S | a | b | c - open S + open S - def myElement : FreeGroup S := (.of a) * (.of b)⁻¹ + def myElement : FreeGroup S := (.of a) * (.of b)⁻¹ </pre></div> </div> Note that we gave the expected type of the definition so that Lean knows that <code class="docutils literal notranslate">.of</code> means
- @@ -463,10 +463,10 @@ by <code class="docutils literal notranslate">a</code>,
 The universal property of free groups is embodied as the equivalence <code class="docutils literal notranslate">FreeGroup.lift</code>. For example, let us define the group morphism from <code class="docutils literal notranslate">FreeGroup S</code> to <code class="docutils literal notranslate">Perm (Fin 5)</code> that sends <code class="docutils literal notranslate">a</code> to <code class="docutils literal notranslate">c[1, 2, 3]</code>, <code class="docutils literal notranslate">b</code> to <code class="docutils literal notranslate">c[2, 3, 1]</code>, and <code class="docutils literal notranslate">c</code> to <code class="docutils literal notranslate">c[2, 3]</code>, - <div class="highlight-lean notranslate"><div class="highlight"><pre>def myMorphism : FreeGroup S →* Perm (Fin 5) := - FreeGroup.lift fun | .a => c[1, 2, 3] - | .b => c[2, 3, 1] - | .c => c[2, 3] + <div class="highlight-lean notranslate"><div class="highlight"><pre>def myMorphism : FreeGroup S →* Perm (Fin 5) := + FreeGroup.lift fun | .a => c[1, 2, 3] + | .b => c[2, 3, 1] + | .c => c[2, 3] </pre></div> </div> As a last concrete example, let us see how to define a group generated by a single element whose
- @@ -478,25 +478,25 @@ i.e. a set of elements of some free group, and returns a group that is this free
 by a normal subgroup generated by relations. (We will see how to handle more general quotients in <a class="reference internal" href="#quotient-groups">Section 8.1.6</a>.) Since we somehow hide this behind a definition, we use <code class="docutils literal notranslate">deriving Group</code> to force creation of a group instance on <code class="docutils literal notranslate">myGroup</code>. - <div class="highlight-lean notranslate"><div class="highlight"><pre>def myGroup := PresentedGroup {.of () ^ 3} deriving Group + <div class="highlight-lean notranslate"><div class="highlight"><pre>def myGroup := PresentedGroup {.of () ^ 3} deriving Group </pre></div> </div> The universal property of presented groups ensures that morphisms out of this group can be built from functions that send the relations to the neutral element of the target group. So we need such a function and a proof that the condition holds. Then we can feed this proof to <code class="docutils literal notranslate">PresentedGroup.toGroup</code> to get the desired group morphism. - <div class="highlight-lean notranslate"><div class="highlight"><pre>def myMap : Unit → Perm (Fin 5) - | () => c[1, 2, 3] + <div class="highlight-lean notranslate"><div class="highlight"><pre>def myMap : Unit → Perm (Fin 5) + | () => c[1, 2, 3] - lemma compat_myMap : - ∀ r ∈ ({.of () ^ 3} : Set (FreeGroup Unit)), FreeGroup.lift myMap r = 1 := by - rintro _ rfl - simp - decide + lemma compat_myMap : + ∀ r ∈ ({.of () ^ 3} : Set (FreeGroup Unit)), FreeGroup.lift myMap r = 1 := by + rintro _ rfl + simp + decide - def myNewMorphism : myGroup →* Perm (Fin 5) := PresentedGroup.toGroup compat_myMap + def myNewMorphism : myGroup →* Perm (Fin 5) := PresentedGroup.toGroup compat_myMap - end FreeGroup + end FreeGroup </pre></div> </div> </section>
- @@ -513,31 +513,31 @@ requires some contortions, such as defining type synonyms, each of which carries
 type class instances. This allows us in particular to use <code class="docutils literal notranslate">g • x</code> to denote the action of a group element <code class="docutils literal notranslate">g</code> on a point <code class="docutils literal notranslate">x</code>. - <div class="highlight-lean notranslate"><div class="highlight"><pre>noncomputable section GroupActions + <div class="highlight-lean notranslate"><div class="highlight"><pre>noncomputable section GroupActions - example {G X : Type*} [Group G] [MulAction G X] (g g': G) (x : X) : - g • (g' • x) = (g * g') • x := - (mul_smul g g' x).symm + example {G X : Type*} [Group G] [MulAction G X] (g g': G) (x : X) : + g • (g' • x) = (g * g') • x := + (mul_smul g g' x).symm </pre></div> </div> There is also a version for additive group called <code class="docutils literal notranslate">AddAction</code>, where the action is denoted by <code class="docutils literal notranslate">+ᵥ</code>. This is used for instance in the definition of affine spaces. - <div class="highlight-lean notranslate"><div class="highlight"><pre>example {G X : Type*} [AddGroup G] [AddAction G X] (g g' : G) (x : X) : - g +ᵥ (g' +ᵥ x) = (g + g') +ᵥ x := - (add_vadd g g' x).symm + <div class="highlight-lean notranslate"><div class="highlight"><pre>example {G X : Type*} [AddGroup G] [AddAction G X] (g g' : G) (x : X) : + g +ᵥ (g' +ᵥ x) = (g + g') +ᵥ x := + (add_vadd g g' x).symm </pre></div> </div> The underlying group morphism is called <code class="docutils literal notranslate">MulAction.toPermHom</code>. - <div class="highlight-lean notranslate"><div class="highlight"><pre>open MulAction + <div class="highlight-lean notranslate"><div class="highlight"><pre>open MulAction - example {G X : Type*} [Group G] [MulAction G X] : G →* Equiv.Perm X := - toPermHom G X + example {G X : Type*} [Group G] [MulAction G X] : G →* Equiv.Perm X := + toPermHom G X </pre></div> </div> As an illustration let us see how to define the Cayley isomorphism embedding of any group <code class="docutils literal notranslate">G</code> into a permutation group, namely <code class="docutils literal notranslate">Perm G</code>. - <div class="highlight-lean notranslate"><div class="highlight"><pre>def CayleyIsoMorphism (G : Type*) [Group G] : G ≃* (toPermHom G G).range := - Equiv.Perm.subgroupOfMulAction G G + <div class="highlight-lean notranslate"><div class="highlight"><pre>def CayleyIsoMorphism (G : Type*) [Group G] : G ≃* (toPermHom G G).range := + Equiv.Perm.subgroupOfMulAction G G </pre></div> </div> Note that nothing before the above definition required having a group rather than a monoid (or any
- @@ -545,7 +545,7 @@ type endowed with a multiplication operation really).
 The group condition really enters the picture when we will want to partition <code class="docutils literal notranslate">X</code> into orbits. The corresponding equivalence relation on <code class="docutils literal notranslate">X</code> is called <code class="docutils literal notranslate">MulAction.orbitRel</code>. It is not declared as a global instance. - <div class="highlight-lean notranslate"><div class="highlight"><pre>example {G X : Type*} [Group G] [MulAction G X] : Setoid X := orbitRel G X + <div class="highlight-lean notranslate"><div class="highlight"><pre>example {G X : Type*} [Group G] [MulAction G X] : Setoid X := orbitRel G X </pre></div> </div> Using this we can state that <code class="docutils literal notranslate">X</code> is partitioned into orbits under the action of <code class="docutils literal notranslate">G</code>.
- @@ -554,9 +554,9 @@ More precisely, we get a bijection between <code class="docutils literal notrans
 where <code class="docutils literal notranslate">Quotient.out' ω</code> simply chooses an element that projects to <code class="docutils literal notranslate">ω</code>. Recall that elements of this dependent product are pairs <code class="docutils literal notranslate">⟨ω, x⟩</code> where the type <code class="docutils literal notranslate">orbit G (Quotient.out' ω)</code> of <code class="docutils literal notranslate">x</code> depends on <code class="docutils literal notranslate">ω</code>. - <div class="highlight-lean notranslate"><div class="highlight"><pre>example {G X : Type*} [Group G] [MulAction G X] : - X ≃ (ω : orbitRel.Quotient G X) × (orbit G (Quotient.out' ω)) := - MulAction.selfEquivSigmaOrbits G X + <div class="highlight-lean notranslate"><div class="highlight"><pre>example {G X : Type*} [Group G] [MulAction G X] : + X ≃ (ω : orbitRel.Quotient G X) × (orbit G (Quotient.out' ω)) := + MulAction.selfEquivSigmaOrbits G X </pre></div> </div> In particular, when X is finite, this can be combined with <code class="docutils literal notranslate">Fintype.card_congr</code> and
- @@ -566,35 +566,35 @@ Furthermore, the orbits are in bijection with the quotient of <code class="docut
 stabilizers by left translation. This action of a subgroup by left-translation is used to define quotients of a group by a subgroup with notation <cite>/</cite> so we can use the following concise statement. - <div class="highlight-lean notranslate"><div class="highlight"><pre>example {G X : Type*} [Group G] [MulAction G X] (x : X) : - orbit G x ≃ G ⧸ stabilizer G x := - MulAction.orbitEquivQuotientStabilizer G x + <div class="highlight-lean notranslate"><div class="highlight"><pre>example {G X : Type*} [Group G] [MulAction G X] (x : X) : + orbit G x ≃ G ⧸ stabilizer G x := + MulAction.orbitEquivQuotientStabilizer G x </pre></div> </div> An important special case of combining the above two results is when <code class="docutils literal notranslate">X</code> is a group <code class="docutils literal notranslate">G</code> equipped with the action of a subgroup <code class="docutils literal notranslate">H</code> by translation. In this case all stabilizers are trivial so every orbit is in bijection with <code class="docutils literal notranslate">H</code> and we get: - <div class="highlight-lean notranslate"><div class="highlight"><pre>example {G : Type*} [Group G] (H : Subgroup G) : G ≃ (G ⧸ H) × H := - groupEquivQuotientProdSubgroup + <div class="highlight-lean notranslate"><div class="highlight"><pre>example {G : Type*} [Group G] (H : Subgroup G) : G ≃ (G ⧸ H) × H := + groupEquivQuotientProdSubgroup </pre></div> </div> This is the conceptual variant of the version of Lagrange theorem that we saw above. Note this version makes no finiteness assumption. As an exercise for this section, let us build the action of a group on its subgroup by conjugation, using our definition of <code class="docutils literal notranslate">conjugate</code> from a previous exercise. - <div class="highlight-lean notranslate"><div class="highlight"><pre>variable {G : Type*} [Group G] + <div class="highlight-lean notranslate"><div class="highlight"><pre>variable {G : Type*} [Group G] - lemma conjugate_one (H : Subgroup G) : conjugate 1 H = H := by - sorry + lemma conjugate_one (H : Subgroup G) : conjugate 1 H = H := by + sorry - instance : MulAction G (Subgroup G) where - smul := conjugate - one_smul := by - sorry - mul_smul := by - sorry + instance : MulAction G (Subgroup G) where + smul := conjugate + one_smul := by + sorry + mul_smul := by + sorry - end GroupActions + end GroupActions </pre></div> </div> </section>
- @@ -606,19 +606,19 @@ map is a group morphism if and only if <code class="docutils literal notranslate
 then unique). The normality assumption is a type class <code class="docutils literal notranslate">Subgroup.Normal</code> so that type class inference can use it to derive the group structure on the quotient. - <div class="highlight-lean notranslate"><div class="highlight"><pre>noncomputable section QuotientGroup + <div class="highlight-lean notranslate"><div class="highlight"><pre>noncomputable section QuotientGroup - example {G : Type*} [Group G] (H : Subgroup G) [H.Normal] : Group (G ⧸ H) := inferInstance + example {G : Type*} [Group G] (H : Subgroup G) [H.Normal] : Group (G ⧸ H) := inferInstance - example {G : Type*} [Group G] (H : Subgroup G) [H.Normal] : G →* G ⧸ H := - QuotientGroup.mk' H + example {G : Type*} [Group G] (H : Subgroup G) [H.Normal] : G →* G ⧸ H := + QuotientGroup.mk' H </pre></div> </div> The universal property of quotient groups is accessed through <code class="docutils literal notranslate">QuotientGroup.lift</code>: a group morphism <code class="docutils literal notranslate">φ</code> descends to <code class="docutils literal notranslate">G ⧸ N</code> as soon as its kernel contains <code class="docutils literal notranslate">N</code>. - <div class="highlight-lean notranslate"><div class="highlight"><pre>example {G : Type*} [Group G] (N : Subgroup G) [N.Normal] {M : Type*} - [Group M] (φ : G →* M) (h : N ≤ MonoidHom.ker φ) : G ⧸ N →* M := - QuotientGroup.lift N φ h + <div class="highlight-lean notranslate"><div class="highlight"><pre>example {G : Type*} [Group G] (N : Subgroup G) [N.Normal] {M : Type*} + [Group M] (φ : G →* M) (h : N ≤ MonoidHom.ker φ) : G ⧸ N →* M := + QuotientGroup.lift N φ h </pre></div> </div> The fact that the target group is called <code class="docutils literal notranslate">M</code> is the above snippet is a clue that having a
- @@ -626,9 +626,9 @@ monoid structure on <code class="docutils literal notranslate">An important special case is when <code class="docutils literal notranslate">N = ker φ</code>. In that case the descended morphism is injective and we get a group isomorphism onto its image. This result is often called the first isomorphism theorem. - <div class="highlight-lean notranslate"><div class="highlight"><pre>example {G : Type*} [Group G] {M : Type*} [Group M] (φ : G →* M) : - G ⧸ MonoidHom.ker φ →* MonoidHom.range φ := - QuotientGroup.quotientKerEquivRange φ + <div class="highlight-lean notranslate"><div class="highlight"><pre>example {G : Type*} [Group G] {M : Type*} [Group M] (φ : G →* M) : + G ⧸ MonoidHom.ker φ →* MonoidHom.range φ := + QuotientGroup.quotientKerEquivRange φ </pre></div> </div> Applying the universal property to a composition of a morphism <code class="docutils literal notranslate">φ : G →* G'</code>
- @@ -638,18 +638,18 @@ The condition required on <code class="docutils literal notranslate">N'</code>.” But this is equivalent to asking that <code class="docutils literal notranslate">φ</code> should pull <code class="docutils literal notranslate">N'</code> back inside <code class="docutils literal notranslate">N</code>, and the latter condition is nicer to work with since the definition of pullback does not involve an existential quantifier. - <div class="highlight-lean notranslate"><div class="highlight"><pre>example {G G': Type*} [Group G] [Group G'] - {N : Subgroup G} [N.Normal] {N' : Subgroup G'} [N'.Normal] - {φ : G →* G'} (h : N ≤ Subgroup.comap φ N') : G ⧸ N →* G' ⧸ N':= - QuotientGroup.map N N' φ h + <div class="highlight-lean notranslate"><div class="highlight"><pre>example {G G': Type*} [Group G] [Group G'] + {N : Subgroup G} [N.Normal] {N' : Subgroup G'} [N'.Normal] + {φ : G →* G'} (h : N ≤ Subgroup.comap φ N') : G ⧸ N →* G' ⧸ N':= + QuotientGroup.map N N' φ h </pre></div> </div> One subtle point to keep in mind is that the type <code class="docutils literal notranslate">G ⧸ N</code> really depends on <code class="docutils literal notranslate">N</code> (up to definitional equality), so having a proof that two normal subgroups <code class="docutils literal notranslate">N</code> and <code class="docutils literal notranslate">M</code> are equal is not enough to make the corresponding quotients equal. However the universal properties does give an isomorphism in this case. - <div class="highlight-lean notranslate"><div class="highlight"><pre>example {G : Type*} [Group G] {M N : Subgroup G} [M.Normal] - [N.Normal] (h : M = N) : G ⧸ M ≃* G ⧸ N := QuotientGroup.quotientMulEquivOfEq h + <div class="highlight-lean notranslate"><div class="highlight"><pre>example {G : Type*} [Group G] {M N : Subgroup G} [M.Normal] + [N.Normal] (h : M = N) : G ⧸ M ≃* G ⧸ N := QuotientGroup.quotientMulEquivOfEq h </pre></div> </div> As a final series of exercises for this section, we will prove that if <code class="docutils literal notranslate">H</code> and <code class="docutils literal notranslate">K</code> are disjoint
- @@ -659,46 +659,46 @@ then <code class="docutils literal notranslate">G</code
 We start with playing a bit with Lagrange’s lemma, without assuming the subgroups are normal or disjoint. <div class="highlight-lean notranslate"><div class="highlight"><pre>section - variable {G : Type*} [Group G] {H K : Subgroup G} + variable {G : Type*} [Group G] {H K : Subgroup G} - open MonoidHom + open MonoidHom - #check Nat.card_pos -- The nonempty argument will be automatically inferred for subgroups - #check Subgroup.index_eq_card - #check Subgroup.index_mul_card - #check Nat.eq_of_mul_eq_mul_right + #check Nat.card_pos -- The nonempty argument will be automatically inferred for subgroups + #check Subgroup.index_eq_card + #check Subgroup.index_mul_card + #check Nat.eq_of_mul_eq_mul_right - lemma aux_card_eq [Finite G] (h' : Nat.card G = Nat.card H * Nat.card K) : - Nat.card (G ⧸ H) = Nat.card K := by - sorry + lemma aux_card_eq [Finite G] (h' : Nat.card G = Nat.card H * Nat.card K) : + Nat.card (G ⧸ H) = Nat.card K := by + sorry </pre></div> </div> From now on, we assume that our subgroups are normal and disjoint, and we assume the cardinality condition. Now we construct the first building block of the desired isomorphism. - <div class="highlight-lean notranslate"><div class="highlight"><pre>variable [H.Normal] [K.Normal] [Fintype G] (h : Disjoint H K) - (h' : Nat.card G = Nat.card H * Nat.card K) + <div class="highlight-lean notranslate"><div class="highlight"><pre>variable [H.Normal] [K.Normal] [Fintype G] (h : Disjoint H K) + (h' : Nat.card G = Nat.card H * Nat.card K) - #check Nat.bijective_iff_injective_and_card - #check ker_eq_bot_iff - #check restrict - #check ker_restrict + #check Nat.bijective_iff_injective_and_card + #check ker_eq_bot_iff + #check restrict + #check ker_restrict - def iso₁ [Fintype G] (h : Disjoint H K) (h' : Nat.card G = Nat.card H * Nat.card K) : K ≃* G ⧸ H := by - sorry + def iso₁ [Fintype G] (h : Disjoint H K) (h' : Nat.card G = Nat.card H * Nat.card K) : K ≃* G ⧸ H := by + sorry </pre></div> </div> Now we can define our second building block. We will need <code class="docutils literal notranslate">MonoidHom.prod</code>, which builds a morphism from <code class="docutils literal notranslate">G₀</code> to <code class="docutils literal notranslate">G₁ × G₂</code> out of morphisms from <code class="docutils literal notranslate">G₀</code> to <code class="docutils literal notranslate">G₁</code> and <code class="docutils literal notranslate">G₂</code>. - <div class="highlight-lean notranslate"><div class="highlight"><pre>def iso₂ : G ≃* (G ⧸ K) × (G ⧸ H) := by - sorry + <div class="highlight-lean notranslate"><div class="highlight"><pre>def iso₂ : G ≃* (G ⧸ K) × (G ⧸ H) := by + sorry </pre></div> </div> We are ready to put all pieces together. - <div class="highlight-lean notranslate"><div class="highlight"><pre>#check MulEquiv.prodCongr + <div class="highlight-lean notranslate"><div class="highlight"><pre>#check MulEquiv.prodCongr - def finalIso : G ≃* H × K := - sorry + def finalIso : G ≃* H × K := + sorry </pre></div> </div> </section>
- @@ -710,7 +710,7 @@ morphisms from <code class="docutils literal notranslate">G&#8
 The type of ring structures on a type <code class="docutils literal notranslate">R</code> is <code class="docutils literal notranslate">Ring R</code>. The variant where multiplication is assumed to be commutative is <code class="docutils literal notranslate">CommRing R</code>. We have already seen that the <code class="docutils literal notranslate">ring</code> tactic will prove any equality that follows from the axioms of a commutative ring. - <div class="highlight-lean notranslate"><div class="highlight"><pre>example {R : Type*} [CommRing R] (x y : R) : (x + y) ^ 2 = x ^ 2 + y ^ 2 + 2 * x * y := by ring + <div class="highlight-lean notranslate"><div class="highlight"><pre>example {R : Type*} [CommRing R] (x y : R) : (x + y) ^ 2 = x ^ 2 + y ^ 2 + 2 * x * y := by ring </pre></div> </div> More exotic variants do not require that the addition on <code class="docutils literal notranslate">R</code> forms a group but only an additive
- @@ -720,7 +720,7 @@ of functions taking values in the natural numbers.
 Another important example is the type of ideals in a ring, which will be discussed below. The name of the <code class="docutils literal notranslate">ring</code> tactic is doubly misleading, since it assumes commutativity but works in semirings as well. In other words, it applies to any <code class="docutils literal notranslate">CommSemiring</code>. - <div class="highlight-lean notranslate"><div class="highlight"><pre>example (x y : ℕ) : (x + y) ^ 2 = x ^ 2 + y ^ 2 + 2 * x * y := by ring + <div class="highlight-lean notranslate"><div class="highlight"><pre>example (x y : ℕ) : (x + y) ^ 2 = x ^ 2 + y ^ 2 + 2 * x * y := by ring </pre></div> </div> There are also versions of the ring and semiring classes that do not assume the existence of a
- @@ -737,27 +737,27 @@ This implementation detail is relevant mainly when defining computable functions
 situations one can use <code class="docutils literal notranslate">IsUnit.unit {x : M} : IsUnit x → Mˣ</code> to build a unit. In the commutative case, one also has <code class="docutils literal notranslate">Units.mkOfMulEqOne (x y : M) : x * y = 1 → Mˣ</code> which builds <code class="docutils literal notranslate">x</code> seen as unit. - <div class="highlight-lean notranslate"><div class="highlight"><pre>example (x : ℤˣ) : x = 1 ∨ x = -1 := Int.units_eq_one_or x + <div class="highlight-lean notranslate"><div class="highlight"><pre>example (x : ℤˣ) : x = 1 ∨ x = -1 := Int.units_eq_one_or x - example {M : Type*} [Monoid M] (x : Mˣ) : (x : M) * x⁻¹ = 1 := Units.mul_inv x + example {M : Type*} [Monoid M] (x : Mˣ) : (x : M) * x⁻¹ = 1 := Units.mul_inv x - example {M : Type*} [Monoid M] : Group Mˣ := inferInstance + example {M : Type*} [Monoid M] : Group Mˣ := inferInstance </pre></div> </div> The type of ring morphisms between two (semi)-rings <code class="docutils literal notranslate">R</code> and <code class="docutils literal notranslate">S</code> is <code class="docutils literal notranslate">RingHom R S</code>, with notation <code class="docutils literal notranslate">R →+* S</code>. - <div class="highlight-lean notranslate"><div class="highlight"><pre>example {R S : Type*} [Ring R] [Ring S] (f : R →+* S) (x y : R) : - f (x + y) = f x + f y := f.map_add x y + <div class="highlight-lean notranslate"><div class="highlight"><pre>example {R S : Type*} [Ring R] [Ring S] (f : R →+* S) (x y : R) : + f (x + y) = f x + f y := f.map_add x y - example {R S : Type*} [Ring R] [Ring S] (f : R →+* S) : Rˣ →* Sˣ := - Units.map f + example {R S : Type*} [Ring R] [Ring S] (f : R →+* S) : Rˣ →* Sˣ := + Units.map f </pre></div> </div> The isomorphism variant is <code class="docutils literal notranslate">RingEquiv</code>, with notation <code class="docutils literal notranslate">≃+*</code>. As with submonoids and subgroups, there is a <code class="docutils literal notranslate">Subring R</code> type for subrings of a ring <code class="docutils literal notranslate">R</code>, but this type is a lot less useful than the type of subgroups since one cannot quotient a ring by a subring. - <div class="highlight-lean notranslate"><div class="highlight"><pre>example {R : Type*} [Ring R] (S : Subring R) : Ring S := inferInstance + <div class="highlight-lean notranslate"><div class="highlight"><pre>example {R : Type*} [Ring R] (S : Subring R) : Ring S := inferInstance </pre></div> </div> Also notice that <code class="docutils literal notranslate">RingHom.range</code> produces a subring.
- @@ -774,40 +774,40 @@ ideals. But anonymous projection notation won’t always work as expected. F
 one cannot replace <code class="docutils literal notranslate">Ideal.Quotient.mk I</code> by <code class="docutils literal notranslate">I.Quotient.mk</code> in the snippet below because there are two <code class="docutils literal notranslate">.``s and so it will parse as ``(Ideal.Quotient I).mk</code>; but <code class="docutils literal notranslate">Ideal.Quotient</code> by itself doesn’t exist. - <div class="highlight-lean notranslate"><div class="highlight"><pre>example {R : Type*} [CommRing R] (I : Ideal R) : R →+* R ⧸ I := - Ideal.Quotient.mk I + <div class="highlight-lean notranslate"><div class="highlight"><pre>example {R : Type*} [CommRing R] (I : Ideal R) : R →+* R ⧸ I := + Ideal.Quotient.mk I - example {R : Type*} [CommRing R] {a : R} {I : Ideal R} : - Ideal.Quotient.mk I a = 0 ↔ a ∈ I := - Ideal.Quotient.eq_zero_iff_mem + example {R : Type*} [CommRing R] {a : R} {I : Ideal R} : + Ideal.Quotient.mk I a = 0 ↔ a ∈ I := + Ideal.Quotient.eq_zero_iff_mem </pre></div> </div> The universal property of quotient rings is <code class="docutils literal notranslate">Ideal.Quotient.lift</code>. - <div class="highlight-lean notranslate"><div class="highlight"><pre>example {R S : Type*} [CommRing R] [CommRing S] (I : Ideal R) (f : R →+* S) - (H : I ≤ RingHom.ker f) : R ⧸ I →+* S := - Ideal.Quotient.lift I f H + <div class="highlight-lean notranslate"><div class="highlight"><pre>example {R S : Type*} [CommRing R] [CommRing S] (I : Ideal R) (f : R →+* S) + (H : I ≤ RingHom.ker f) : R ⧸ I →+* S := + Ideal.Quotient.lift I f H </pre></div> </div> In particular it leads to the first isomorphism theorem for rings. - <div class="highlight-lean notranslate"><div class="highlight"><pre>example {R S : Type*} [CommRing R] [CommRing S](f : R →+* S) : - R ⧸ RingHom.ker f ≃+* f.range := - RingHom.quotientKerEquivRange f + <div class="highlight-lean notranslate"><div class="highlight"><pre>example {R S : Type*} [CommRing R] [CommRing S](f : R →+* S) : + R ⧸ RingHom.ker f ≃+* f.range := + RingHom.quotientKerEquivRange f </pre></div> </div> Ideals form a complete lattice structure with the inclusion relation, as well as a semiring structure. These two structures interact nicely. - <div class="highlight-lean notranslate"><div class="highlight"><pre>variable {R : Type*} [CommRing R] {I J : Ideal R} + <div class="highlight-lean notranslate"><div class="highlight"><pre>variable {R : Type*} [CommRing R] {I J : Ideal R} - example : I + J = I ⊔ J := rfl + example : I + J = I ⊔ J := rfl - example {x : R} : x ∈ I + J ↔ ∃ a ∈ I, ∃ b ∈ J, a + b = x := by - simp [Submodule.mem_sup] + example {x : R} : x ∈ I + J ↔ ∃ a ∈ I, ∃ b ∈ J, a + b = x := by + simp [Submodule.mem_sup] - example : I * J ≤ J := Ideal.mul_le_left + example : I * J ≤ J := Ideal.mul_le_left - example : I * J ≤ I := Ideal.mul_le_right + example : I * J ≤ I := Ideal.mul_le_right - example : I * J ≤ I ⊓ J := Ideal.mul_le_inf + example : I * J ≤ I ⊓ J := Ideal.mul_le_inf </pre></div> </div> One can use ring morphisms to push ideals forward and pull them back using <code class="docutils literal notranslate">Ideal.map</code> and
- @@ -815,123 +815,123 @@ structure. These two structures interact nicely.
 the latter is more convenient to use since it does not involve an existential quantifier. This explains why it is used to state the condition that allows us to build morphisms between quotient rings. - <div class="highlight-lean notranslate"><div class="highlight"><pre>example {R S : Type*} [CommRing R] [CommRing S] (I : Ideal R) (J : Ideal S) (f : R →+* S) - (H : I ≤ Ideal.comap f J) : R ⧸ I →+* S ⧸ J := - Ideal.quotientMap J f H + <div class="highlight-lean notranslate"><div class="highlight"><pre>example {R S : Type*} [CommRing R] [CommRing S] (I : Ideal R) (J : Ideal S) (f : R →+* S) + (H : I ≤ Ideal.comap f J) : R ⧸ I →+* S ⧸ J := + Ideal.quotientMap J f H </pre></div> </div> One subtle point is that the type <code class="docutils literal notranslate">R ⧸ I</code> really depends on <code class="docutils literal notranslate">I</code> (up to definitional equality), so having a proof that two ideals <code class="docutils literal notranslate">I</code> and <code class="docutils literal notranslate">J</code> are equal is not enough to make the corresponding quotients equal. However, the universal properties do provide an isomorphism in this case. - <div class="highlight-lean notranslate"><div class="highlight"><pre>example {R : Type*} [CommRing R] {I J : Ideal R} (h : I = J) : R ⧸ I ≃+* R ⧸ J := - Ideal.quotEquivOfEq h + <div class="highlight-lean notranslate"><div class="highlight"><pre>example {R : Type*} [CommRing R] {I J : Ideal R} (h : I = J) : R ⧸ I ≃+* R ⧸ J := + Ideal.quotEquivOfEq h </pre></div> </div> We can now present the Chinese remainder isomorphism as an example. Pay attention to the difference between the indexed infimum symbol <code class="docutils literal notranslate">⨅</code> and the big product of types symbol <code class="docutils literal notranslate">Π</code>. Depending on your font, those can be pretty hard to distinguish. - <div class="highlight-lean notranslate"><div class="highlight"><pre>example {R : Type*} [CommRing R] {ι : Type*} [Fintype ι] (f : ι → Ideal R) - (hf : ∀ i j, i ≠ j → IsCoprime (f i) (f j)) : (R ⧸ ⨅ i, f i) ≃+* Π i, R ⧸ f i := - Ideal.quotientInfRingEquivPiQuotient f hf + <div class="highlight-lean notranslate"><div class="highlight"><pre>example {R : Type*} [CommRing R] {ι : Type*} [Fintype ι] (f : ι → Ideal R) + (hf : ∀ i j, i ≠ j → IsCoprime (f i) (f j)) : (R ⧸ ⨅ i, f i) ≃+* Π i, R ⧸ f i := + Ideal.quotientInfRingEquivPiQuotient f hf </pre></div> </div> The elementary version of the Chinese remainder theorem, a statement about <code class="docutils literal notranslate">ZMod</code>, can be easily deduced from the previous one: - <div class="highlight-lean notranslate"><div class="highlight"><pre>open BigOperators PiNotation + <div class="highlight-lean notranslate"><div class="highlight"><pre>open BigOperators PiNotation - example {ι : Type*} [Fintype ι] (a : ι → ℕ) (coprime : ∀ i j, i ≠ j → (a i).Coprime (a j)) : - ZMod (∏ i, a i) ≃+* Π i, ZMod (a i) := - ZMod.prodEquivPi a coprime + example {ι : Type*} [Fintype ι] (a : ι → ℕ) (coprime : ∀ i j, i ≠ j → (a i).Coprime (a j)) : + ZMod (∏ i, a i) ≃+* Π i, ZMod (a i) := + ZMod.prodEquivPi a coprime </pre></div> </div> As a series of exercises, we will reprove the Chinese remainder theorem in the general case. We first need to define the map appearing in the theorem, as a ring morphism, using the universal property of quotient rings. - <div class="highlight-lean notranslate"><div class="highlight"><pre>variable {ι R : Type*} [CommRing R] - open Ideal Quotient Function + <div class="highlight-lean notranslate"><div class="highlight"><pre>variable {ι R : Type*} [CommRing R] + open Ideal Quotient Function - #check Pi.ringHom - #check ker_Pi_Quotient_mk + #check Pi.ringHom + #check ker_Pi_Quotient_mk /-- The homomorphism from ``R ⧸ ⨅ i, I i`` to ``Π i, R ⧸ I i`` featured in the Chinese Remainder Theorem. -/ - def chineseMap (I : ι → Ideal R) : (R ⧸ ⨅ i, I i) →+* Π i, R ⧸ I i := - sorry + def chineseMap (I : ι → Ideal R) : (R ⧸ ⨅ i, I i) →+* Π i, R ⧸ I i := + sorry </pre></div> </div> Make sure the following next two lemmas can be proven by <code class="docutils literal notranslate">rfl</code>. - <div class="highlight-lean notranslate"><div class="highlight"><pre>lemma chineseMap_mk (I : ι → Ideal R) (x : R) : - chineseMap I (Quotient.mk _ x) = fun i : ι ↦ Ideal.Quotient.mk (I i) x := - sorry + <div class="highlight-lean notranslate"><div class="highlight"><pre>lemma chineseMap_mk (I : ι → Ideal R) (x : R) : + chineseMap I (Quotient.mk _ x) = fun i : ι ↦ Ideal.Quotient.mk (I i) x := + sorry - lemma chineseMap_mk' (I : ι → Ideal R) (x : R) (i : ι) : - chineseMap I (mk _ x) i = mk (I i) x := - sorry + lemma chineseMap_mk' (I : ι → Ideal R) (x : R) (i : ι) : + chineseMap I (mk _ x) i = mk (I i) x := + sorry </pre></div> </div> The next lemma proves the easy half of the Chinese remainder theorem, without any assumption on the family of ideals. The proof is less than one line long. - <div class="highlight-lean notranslate"><div class="highlight"><pre>#check injective_lift_iff + <div class="highlight-lean notranslate"><div class="highlight"><pre>#check injective_lift_iff - lemma chineseMap_inj (I : ι → Ideal R) : Injective (chineseMap I) := by - sorry + lemma chineseMap_inj (I : ι → Ideal R) : Injective (chineseMap I) := by + sorry </pre></div> </div> We are now ready for the heart of the theorem, which will show the surjectivity of our <code class="docutils literal notranslate">chineseMap</code>. First we need to know the different ways one can express the coprimality (also called co-maximality assumption). Only the first two will be needed below. - <div class="highlight-lean notranslate"><div class="highlight"><pre>#check IsCoprime - #check isCoprime_iff_add - #check isCoprime_iff_exists - #check isCoprime_iff_sup_eq - #check isCoprime_iff_codisjoint + <div class="highlight-lean notranslate"><div class="highlight"><pre>#check IsCoprime + #check isCoprime_iff_add + #check isCoprime_iff_exists + #check isCoprime_iff_sup_eq + #check isCoprime_iff_codisjoint </pre></div> </div> We take the opportunity to use induction on <code class="docutils literal notranslate">Finset</code>. Relevant lemmas on <code class="docutils literal notranslate">Finset</code> are given below. Remember that the <code class="docutils literal notranslate">ring</code> tactic works for semirings and that the ideals of a ring form a semiring. - <div class="highlight-lean notranslate"><div class="highlight"><pre>#check Finset.mem_insert_of_mem - #check Finset.mem_insert_self - - theorem isCoprime_Inf {I : Ideal R} {J : ι → Ideal R} {s : Finset ι} - (hf : ∀ j ∈ s, IsCoprime I (J j)) : IsCoprime I (⨅ j ∈ s, J j) := by - classical - simp_rw [isCoprime_iff_add] at * - induction s using Finset.induction with - | empty => - simp - | @insert i s _ hs => - rw [Finset.iInf_insert, inf_comm, one_eq_top, eq_top_iff, ← one_eq_top] - set K := ⨅ j ∈ s, J j - calc - 1 = I + K := sorry - _ = I + K * (I + J i) := sorry - _ = (1 + K) * I + K * J i := sorry - _ ≤ I + K ⊓ J i := sorry + <div class="highlight-lean notranslate"><div class="highlight"><pre>#check Finset.mem_insert_of_mem + #check Finset.mem_insert_self + + theorem isCoprime_Inf {I : Ideal R} {J : ι → Ideal R} {s : Finset ι} + (hf : ∀ j ∈ s, IsCoprime I (J j)) : IsCoprime I (⨅ j ∈ s, J j) := by + classical + simp_rw [isCoprime_iff_add] at * + induction s using Finset.induction with + | empty => + simp + | @insert i s _ hs => + rw [Finset.iInf_insert, inf_comm, one_eq_top, eq_top_iff, ← one_eq_top] + set K := ⨅ j ∈ s, J j + calc + 1 = I + K := sorry + _ = I + K * (I + J i) := sorry + _ = (1 + K) * I + K * J i := sorry + _ ≤ I + K ⊓ J i := sorry </pre></div> </div> We can now prove surjectivity of the map appearing in the Chinese remainder theorem. - <div class="highlight-lean notranslate"><div class="highlight"><pre>lemma chineseMap_surj [Fintype ι] {I : ι → Ideal R} - (hI : ∀ i j, i ≠ j → IsCoprime (I i) (I j)) : Surjective (chineseMap I) := by - classical - intro g - choose f hf using fun i ↦ Ideal.Quotient.mk_surjective (g i) - have key : ∀ i, ∃ e : R, mk (I i) e = 1 ∧ ∀ j, j ≠ i → mk (I j) e = 0 := by - intro i - have hI' : ∀ j ∈ ({i} : Finset ι)ᶜ, IsCoprime (I i) (I j) := by - sorry - sorry - choose e he using key - use mk _ (∑ i, f i * e i) - sorry + <div class="highlight-lean notranslate"><div class="highlight"><pre>lemma chineseMap_surj [Fintype ι] {I : ι → Ideal R} + (hI : ∀ i j, i ≠ j → IsCoprime (I i) (I j)) : Surjective (chineseMap I) := by + classical + intro g + choose f hf using fun i ↦ Ideal.Quotient.mk_surjective (g i) + have key : ∀ i, ∃ e : R, mk (I i) e = 1 ∧ ∀ j, j ≠ i → mk (I j) e = 0 := by + intro i + have hI' : ∀ j ∈ ({i} : Finset ι)ᶜ, IsCoprime (I i) (I j) := by + sorry + sorry + choose e he using key + use mk _ (∑ i, f i * e i) + sorry </pre></div> </div> Now all the pieces come together in the following: - <div class="highlight-lean notranslate"><div class="highlight"><pre>noncomputable def chineseIso [Fintype ι] (f : ι → Ideal R) - (hf : ∀ i j, i ≠ j → IsCoprime (f i) (f j)) : (R ⧸ ⨅ i, f i) ≃+* Π i, R ⧸ f i := - { Equiv.ofBijective _ ⟨chineseMap_inj f, chineseMap_surj hf⟩, - chineseMap f with } + <div class="highlight-lean notranslate"><div class="highlight"><pre>noncomputable def chineseIso [Fintype ι] (f : ι → Ideal R) + (hf : ∀ i j, i ≠ j → IsCoprime (f i) (f j)) : (R ⧸ ⨅ i, f i) ≃+* Π i, R ⧸ f i := + { Equiv.ofBijective _ ⟨chineseMap_inj f, chineseMap_surj hf⟩, + chineseMap f with } </pre></div> </div> </section>
- @@ -948,13 +948,13 @@ Note that this notion of algebra is sometimes called an associative unital a
 existence of more general notions of algebra. The fact that <code class="docutils literal notranslate">algebraMap R A</code> is ring morphism packages together a lot of properties of scalar multiplication, such as the following: - <div class="highlight-lean notranslate"><div class="highlight"><pre>example {R A : Type*} [CommRing R] [Ring A] [Algebra R A] (r r' : R) (a : A) : - (r + r') • a = r • a + r' • a := - add_smul r r' a + <div class="highlight-lean notranslate"><div class="highlight"><pre>example {R A : Type*} [CommRing R] [Ring A] [Algebra R A] (r r' : R) (a : A) : + (r + r') • a = r • a + r' • a := + add_smul r r' a - example {R A : Type*} [CommRing R] [Ring A] [Algebra R A] (r r' : R) (a : A) : - (r * r') • a = r • r' • a := - mul_smul r r' a + example {R A : Type*} [CommRing R] [Ring A] [Algebra R A] (r r' : R) (a : A) : + (r * r') • a = r • r' • a := + mul_smul r r' a </pre></div> </div> The morphisms between two <code class="docutils literal notranslate">R</code>-algebras <code class="docutils literal notranslate">A</code> and <code class="docutils literal notranslate">B</code> are ring morphisms
- @@ -969,11 +969,11 @@ which can be written as <code class="docutils literal notranslate">R</code> to <code class="docutils literal notranslate">R[X]</code> is denoted by <code class="docutils literal notranslate">C</code>, which stands for “constant” since the corresponding polynomial functions are always constant. The indeterminate is denoted by <code class="docutils literal notranslate">X</code>. - <div class="highlight-lean notranslate"><div class="highlight"><pre>open Polynomial + <div class="highlight-lean notranslate"><div class="highlight"><pre>open Polynomial - example {R : Type*} [CommRing R] : R[X] := X + example {R : Type*} [CommRing R] : R[X] := X - example {R : Type*} [CommRing R] (r : R) := X - C r + example {R : Type*} [CommRing R] (r : R) := X - C r </pre></div> </div> In the first example above, it is crucial that we give Lean the expected type since it cannot be
- @@ -982,15 +982,15 @@ algebra can be inferred from our use of <code class="docutils literal notranslat
 Because <code class="docutils literal notranslate">C</code> is a ring morphism from <code class="docutils literal notranslate">R</code> to <code class="docutils literal notranslate">R[X]</code>, we can use all ring morphisms lemmas such as <code class="docutils literal notranslate">map_zero</code>, <code class="docutils literal notranslate">map_one</code>, <code class="docutils literal notranslate">map_mul</code>, and <code class="docutils literal notranslate">map_pow</code> before computing in the ring <code class="docutils literal notranslate">R[X]</code>. For example: - <div class="highlight-lean notranslate"><div class="highlight"><pre>example {R : Type*} [CommRing R] (r : R) : (X + C r) * (X - C r) = X ^ 2 - C (r ^ 2) := by - rw [C.map_pow] - ring + <div class="highlight-lean notranslate"><div class="highlight"><pre>example {R : Type*} [CommRing R] (r : R) : (X + C r) * (X - C r) = X ^ 2 - C (r ^ 2) := by + rw [C.map_pow] + ring </pre></div> </div> You can access coefficients using <code class="docutils literal notranslate">Polynomial.coeff</code> - <div class="highlight-lean notranslate"><div class="highlight"><pre>example {R : Type*} [CommRing R] (r:R) : (C r).coeff 0 = r := by simp + <div class="highlight-lean notranslate"><div class="highlight"><pre>example {R : Type*} [CommRing R] (r:R) : (C r).coeff 0 = r := by simp - example {R : Type*} [CommRing R] : (X ^ 2 + 2 * X + C 3 : R[X]).coeff 1 = 2 := by simp + example {R : Type*} [CommRing R] : (X ^ 2 + 2 * X + C 3 : R[X]).coeff 1 = 2 := by simp </pre></div> </div> Defining the degree of a polynomial is always tricky because of the special case of the zero
- @@ -1002,36 +1002,36 @@ degree of the zero polynomial, and it is absorbent for addition. (It is almost a
 multiplication, except that <code class="docutils literal notranslate">⊥ * 0 = 0</code>.) Morally speaking, the <code class="docutils literal notranslate">degree</code> version is the correct one. For instance, it allows us to state the expected formula for the degree of a product (assuming the base ring has no zero divisor). - <div class="highlight-lean notranslate"><div class="highlight"><pre>example {R : Type*} [Semiring R] [NoZeroDivisors R] {p q : R[X]} : - degree (p * q) = degree p + degree q := - Polynomial.degree_mul + <div class="highlight-lean notranslate"><div class="highlight"><pre>example {R : Type*} [Semiring R] [NoZeroDivisors R] {p q : R[X]} : + degree (p * q) = degree p + degree q := + Polynomial.degree_mul </pre></div> </div> Whereas the version for <code class="docutils literal notranslate">natDegree</code> needs to assume non-zero polynomials. - <div class="highlight-lean notranslate"><div class="highlight"><pre>example {R : Type*} [Semiring R] [NoZeroDivisors R] {p q : R[X]} (hp : p ≠ 0) (hq : q ≠ 0) : - natDegree (p * q) = natDegree p + natDegree q := - Polynomial.natDegree_mul hp hq + <div class="highlight-lean notranslate"><div class="highlight"><pre>example {R : Type*} [Semiring R] [NoZeroDivisors R] {p q : R[X]} (hp : p ≠ 0) (hq : q ≠ 0) : + natDegree (p * q) = natDegree p + natDegree q := + Polynomial.natDegree_mul hp hq </pre></div> </div> However, <code class="docutils literal notranslate">ℕ</code> is much nicer to use than <code class="docutils literal notranslate">WithBot ℕ</code>, so Mathlib makes both versions available and provides lemmas to convert between them. Also, <code class="docutils literal notranslate">natDegree</code> is the more convenient definition to use when computing the degree of a composition. Composition of polynomial is <code class="docutils literal notranslate">Polynomial.comp</code> and we have: - <div class="highlight-lean notranslate"><div class="highlight"><pre>example {R : Type*} [Semiring R] [NoZeroDivisors R] {p q : R[X]} : - natDegree (comp p q) = natDegree p * natDegree q := - Polynomial.natDegree_comp + <div class="highlight-lean notranslate"><div class="highlight"><pre>example {R : Type*} [Semiring R] [NoZeroDivisors R] {p q : R[X]} : + natDegree (comp p q) = natDegree p * natDegree q := + Polynomial.natDegree_comp </pre></div> </div> Polynomials give rise to polynomial functions: any polynomial can be evaluated on <code class="docutils literal notranslate">R</code> using <code class="docutils literal notranslate">Polynomial.eval</code>. - <div class="highlight-lean notranslate"><div class="highlight"><pre>example {R : Type*} [CommRing R] (P: R[X]) (x : R) := P.eval x + <div class="highlight-lean notranslate"><div class="highlight"><pre>example {R : Type*} [CommRing R] (P: R[X]) (x : R) := P.eval x - example {R : Type*} [CommRing R] (r : R) : (X - C r).eval r = 0 := by simp + example {R : Type*} [CommRing R] (r : R) : (X - C r).eval r = 0 := by simp </pre></div> </div> In particular, there is a predicate, <code class="docutils literal notranslate">IsRoot</code>, that holds for elements <code class="docutils literal notranslate">r</code> in <code class="docutils literal notranslate">R</code> where a polynomial vanishes. - <div class="highlight-lean notranslate"><div class="highlight"><pre>example {R : Type*} [CommRing R] (P : R[X]) (r : R) : IsRoot P r ↔ P.eval r = 0 := Iff.rfl + <div class="highlight-lean notranslate"><div class="highlight"><pre>example {R : Type*} [CommRing R] (P : R[X]) (r : R) : IsRoot P r ↔ P.eval r = 0 := Iff.rfl </pre></div> </div> We would like to say that, assuming <code class="docutils literal notranslate">R</code> has no zero divisor, a polynomial has at most as many
- @@ -1041,12 +1041,12 @@ So Mathlib defines <code class="docutils literal notranslate">
 i.e. the finite set that is defined to be empty if <code class="docutils literal notranslate">P</code> is zero and the roots of <code class="docutils literal notranslate">P</code>, with multiplicities, otherwise. This is defined only when the underlying ring is a domain since otherwise the definition does not have good properties. - <div class="highlight-lean notranslate"><div class="highlight"><pre>example {R : Type*} [CommRing R] [IsDomain R] (r : R) : (X - C r).roots = {r} := - roots_X_sub_C r + <div class="highlight-lean notranslate"><div class="highlight"><pre>example {R : Type*} [CommRing R] [IsDomain R] (r : R) : (X - C r).roots = {r} := + roots_X_sub_C r - example {R : Type*} [CommRing R] [IsDomain R] (r : R) (n : ℕ): - ((X - C r) ^ n).roots = n • {r} := - by simp + example {R : Type*} [CommRing R] [IsDomain R] (r : R) (n : ℕ): + ((X - C r) ^ n).roots = n • {r} := + by simp </pre></div> </div> Both <code class="docutils literal notranslate">Polynomial.eval</code> and <code class="docutils literal notranslate">Polynomial.roots</code> consider only the coefficients ring. They do not
- @@ -1057,37 +1057,37 @@ every element of <code class="docutils literal notranslate">a<
 has a coercion to functions, one can apply it to a polynomial. But <code class="docutils literal notranslate">aeval</code> does not have a polynomial as an argument, so one cannot use dot notation like in <code class="docutils literal notranslate">P.eval</code> above. - <div class="highlight-lean notranslate"><div class="highlight"><pre>example : aeval Complex.I (X ^ 2 + 1 : ℝ[X]) = 0 := by simp + <div class="highlight-lean notranslate"><div class="highlight"><pre>example : aeval Complex.I (X ^ 2 + 1 : ℝ[X]) = 0 := by simp </pre></div> </div> The function corresponding to <code class="docutils literal notranslate">roots</code> in this context is <code class="docutils literal notranslate">aroots</code> which takes a polynomial and then an algebra and outputs a multiset (with the same caveat about the zero polynomial as for <code class="docutils literal notranslate">roots</code>). - <div class="highlight-lean notranslate"><div class="highlight"><pre>open Complex Polynomial - - example : aroots (X ^ 2 + 1 : ℝ[X]) ℂ = {Complex.I, -I} := by - suffices roots (X ^ 2 + 1 : ℂ[X]) = {I, -I} by simpa [aroots_def] - have factored : (X ^ 2 + 1 : ℂ[X]) = (X - C I) * (X - C (-I)) := by - rw [C_neg] - linear_combination show (C I * C I : ℂ[X]) = -1 by simp [← C_mul] - have p_ne_zero : (X - C I) * (X - C (-I)) ≠ 0 := by - intro H - apply_fun eval 0 at H - simp [eval] at H - simp only [factored, roots_mul p_ne_zero, roots_X_sub_C] - rfl + <div class="highlight-lean notranslate"><div class="highlight"><pre>open Complex Polynomial + + example : aroots (X ^ 2 + 1 : ℝ[X]) ℂ = {Complex.I, -I} := by + suffices roots (X ^ 2 + 1 : ℂ[X]) = {I, -I} by simpa [aroots_def] + have factored : (X ^ 2 + 1 : ℂ[X]) = (X - C I) * (X - C (-I)) := by + rw [C_neg] + linear_combination show (C I * C I : ℂ[X]) = -1 by simp [← C_mul] + have p_ne_zero : (X - C I) * (X - C (-I)) ≠ 0 := by + intro H + apply_fun eval 0 at H + simp [eval] at H + simp only [factored, roots_mul p_ne_zero, roots_X_sub_C] + rfl -- Mathlib knows about D'Alembert-Gauss theorem: ``ℂ`` is algebraically closed. - example : IsAlgClosed ℂ := inferInstance + example : IsAlgClosed ℂ := inferInstance </pre></div> </div> More generally, given an ring morphism <code class="docutils literal notranslate">f : R →+* S</code> one can evaluate <code class="docutils literal notranslate">P : R[X]</code> at a point in <code class="docutils literal notranslate">S</code> using <code class="docutils literal notranslate">Polynomial.eval₂</code>. This one produces an actual function from <code class="docutils literal notranslate">R[X]</code> to <code class="docutils literal notranslate">S</code> since it does not assume the existence of a <code class="docutils literal notranslate">Algebra R S</code> instance, so dot notation works as you would expect. - <div class="highlight-lean notranslate"><div class="highlight"><pre>#check (Complex.ofReal : ℝ →+* ℂ) + <div class="highlight-lean notranslate"><div class="highlight"><pre>#check (Complex.ofReal : ℝ →+* ℂ) - example : (X ^ 2 + 1 : ℝ[X]).eval₂ Complex.ofReal Complex.I = 0 := by simp + example : (X ^ 2 + 1 : ℝ[X]).eval₂ Complex.ofReal Complex.I = 0 := by simp </pre></div> </div> Let us end by mentioning multivariate polynomials briefly. Given a commutative semiring <code class="docutils literal notranslate">R</code>,
- @@ -1097,9 +1097,9 @@ a type <code class="docutils literal notranslate">σX i</code>.) For instance, if we want two indeterminates we can use <code class="docutils literal notranslate">Fin 2</code> as <code class="docutils literal notranslate">σ</code> and write the polynomial defining the unit circle in $\mathbb{R}^2`$ as: - <div class="highlight-lean notranslate"><div class="highlight"><pre>open MvPolynomial + <div class="highlight-lean notranslate"><div class="highlight"><pre>open MvPolynomial - def circleEquation : MvPolynomial (Fin 2) ℝ := X 0 ^ 2 + X 1 ^ 2 - 1 + def circleEquation : MvPolynomial (Fin 2) ℝ := X 0 ^ 2 + X 1 ^ 2 - 1 </pre></div> </div> Recall that function application has a very high precedence so the expression above is read as
- @@ -1107,7 +1107,7 @@ For instance, if we want two indeterminates we can use
 We can evaluate it to make sure the point with coordinates $(1, 0)$ is on the circle. Recall the <code class="docutils literal notranslate">![...]</code> notation denotes elements of <code class="docutils literal notranslate">Fin n → X</code> for some natural number <code class="docutils literal notranslate">n</code> determined by the number of arguments and some type <code class="docutils literal notranslate">X</code> determined by the type of arguments. - <div class="highlight-lean notranslate"><div class="highlight"><pre>example : MvPolynomial.eval ![0, 1] circleEquation = 0 := by simp [circleEquation] + <div class="highlight-lean notranslate"><div class="highlight"><pre>example : MvPolynomial.eval ![0, 1] circleEquation = 0 := by simp [circleEquation] </pre></div> </div> </section>
html/C09_Topology.html
- @@ -18,7 +18,7 @@
 <script src="_static/jquery.js?v=5d32c60e"></script> <script src="_static/_sphinx_javascript_frameworks_compat.js?v=2cd50e6c"></script> <script src="_static/documentation_options.js?v=2709fde1"></script> - <script src="_static/doctools.js?v=888ff710"></script> + <script src="_static/doctools.js?v=9a2dae69"></script> <script src="_static/sphinx_highlight.js?v=dc90522c"></script> <script async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-mml-chtml.js"></script> <script src="_static/js/theme.js"></script>
- @@ -217,21 +217,21 @@ One manifestation of this view is that we can associate to any <code class="docu
 consisting of all sets that contain <code class="docutils literal notranslate">s</code>. This definition is already in Mathlib and has a notation <code class="docutils literal notranslate">𝓟</code> (localized in the <code class="docutils literal notranslate">Filter</code> namespace). For the purpose of demonstration, we ask you to take this opportunity to work out the definition here. - <div class="highlight-lean notranslate"><div class="highlight"><pre>def principal {α : Type*} (s : Set α) : Filter α - where - sets := { t | s ⊆ t } - univ_sets := sorry - sets_of_superset := sorry - inter_sets := sorry + <div class="highlight-lean notranslate"><div class="highlight"><pre>def principal {α : Type*} (s : Set α) : Filter α + where + sets := { t | s ⊆ t } + univ_sets := sorry + sets_of_superset := sorry + inter_sets := sorry </pre></div> </div> For our second example, we ask you to define the filter <code class="docutils literal notranslate">atTop : Filter ℕ</code>. (We could use any type with a preorder instead of <code class="docutils literal notranslate">ℕ</code>.) - <div class="highlight-lean notranslate"><div class="highlight"><pre>example : Filter ℕ := - { sets := { s | ∃ a, ∀ b, a ≤ b → b ∈ s } - univ_sets := sorry - sets_of_superset := sorry - inter_sets := sorry } + <div class="highlight-lean notranslate"><div class="highlight"><pre>example : Filter ℕ := + { sets := { s | ∃ a, ∀ b, a ≤ b → b ∈ s } + univ_sets := sorry + sets_of_superset := sorry + inter_sets := sorry } </pre></div> </div> We can also directly define the filter <code class="docutils literal notranslate">𝓝 x</code> of neighborhoods of any <code class="docutils literal notranslate">x : ℝ</code>.
- @@ -242,8 +242,8 @@ defined in Mathlib as <code class="docutils literal notranslate">With these examples, we can already define what is means for a function <code class="docutils literal notranslate">f : X → Y</code> to converge to some <code class="docutils literal notranslate">G : Filter Y</code> along some <code class="docutils literal notranslate">F : Filter X</code>, as follows: - <div class="highlight-lean notranslate"><div class="highlight"><pre>def Tendsto₁ {X Y : Type*} (f : X → Y) (F : Filter X) (G : Filter Y) := - ∀ V ∈ G, f ⁻¹' V ∈ F + <div class="highlight-lean notranslate"><div class="highlight"><pre>def Tendsto₁ {X Y : Type*} (f : X → Y) (F : Filter X) (G : Filter Y) := + ∀ V ∈ G, f ⁻¹' V ∈ F </pre></div> </div> When <code class="docutils literal notranslate">X</code> is <code class="docutils literal notranslate">ℕ</code> and <code class="docutils literal notranslate">Y</code> is <code class="docutils literal notranslate">ℝ</code>, <code class="docutils literal notranslate">Tendsto₁ u atTop (𝓝 x)</code> is equivalent to saying that the sequence <code class="docutils literal notranslate">u : ℕ → ℝ</code>
- @@ -263,12 +263,12 @@ In this examples file we’ve opened the <code class="docutils literal notra
 <code class="docutils literal notranslate">Filter.map</code> can be written as <code class="docutils literal notranslate">map</code>. This means that we can rewrite the definition of <code class="docutils literal notranslate">Tendsto</code> using the order relation on <code class="docutils literal notranslate">Filter Y</code>, which is reversed inclusion of the set of members. In other words, given <code class="docutils literal notranslate">G H : Filter Y</code>, we have <code class="docutils literal notranslate">G ≤ H ↔ ∀ V : Set Y, V ∈ H → V ∈ G</code>. - <div class="highlight-lean notranslate"><div class="highlight"><pre>def Tendsto₂ {X Y : Type*} (f : X → Y) (F : Filter X) (G : Filter Y) := - map f F ≤ G + <div class="highlight-lean notranslate"><div class="highlight"><pre>def Tendsto₂ {X Y : Type*} (f : X → Y) (F : Filter X) (G : Filter Y) := + map f F ≤ G - example {X Y : Type*} (f : X → Y) (F : Filter X) (G : Filter Y) : - Tendsto₂ f F G ↔ Tendsto₁ f F G := - Iff.rfl + example {X Y : Type*} (f : X → Y) (F : Filter X) (G : Filter Y) : + Tendsto₂ f F G ↔ Tendsto₁ f F G := + Iff.rfl </pre></div> </div> It may seem that the order relation on filters is backward. But recall that we can view filters on <code class="docutils literal notranslate">X</code> as
- @@ -284,11 +284,11 @@ The inequality means the “direct image under <code class="docutils literal
 It also leverages the algebraic properties of the pushforward operation. First, each <code class="docutils literal notranslate">Filter.map f</code> is monotone. And, second, <code class="docutils literal notranslate">Filter.map</code> is compatible with composition. - <div class="highlight-lean notranslate"><div class="highlight"><pre>#check (@Filter.map_mono : ∀ {α β} {m : α → β}, Monotone (map m)) + <div class="highlight-lean notranslate"><div class="highlight"><pre>#check (@Filter.map_mono : ∀ {α β} {m : α → β}, Monotone (map m)) #check - (@Filter.map_map : - ∀ {α β γ} {f : Filter α} {m : α → β} {m' : β → γ}, map m' (map m f) = map (m' ∘ m) f) + (@Filter.map_map : + ∀ {α β γ} {f : Filter α} {m : α → β} {m' : β → γ}, map m' (map m f) = map (m' ∘ m) f) </pre></div> </div> Together these two properties allow us to prove that limits compose, yielding in one shot all 256 variants
- @@ -297,9 +297,9 @@ You can practice proving the following statement using either the definition
 of <code class="docutils literal notranslate">Tendsto₁</code> in terms of the universal quantifier or the algebraic definition, together with the two lemmas above. - <div class="highlight-lean notranslate"><div class="highlight"><pre>example {X Y Z : Type*} {F : Filter X} {G : Filter Y} {H : Filter Z} {f : X → Y} {g : Y → Z} - (hf : Tendsto₁ f F G) (hg : Tendsto₁ g G H) : Tendsto₁ (g ∘ f) F H := - sorry + <div class="highlight-lean notranslate"><div class="highlight"><pre>example {X Y Z : Type*} {F : Filter X} {G : Filter Y} {H : Filter Z} {f : X → Y} {g : Y → Z} + (hf : Tendsto₁ f F G) (hg : Tendsto₁ g G H) : Tendsto₁ (g ∘ f) F H := + sorry </pre></div> </div> The pushforward construction uses a map to push filters from the map source to the map target.
- @@ -318,19 +318,19 @@ This operation could be used to provided another formulation of <code class="doc
 <code class="docutils literal notranslate">x₀ : ℝ</code> and <code class="docutils literal notranslate">y₀ : ℝ</code>, and suppose we want to state that <code class="docutils literal notranslate">f x</code> approaches <code class="docutils literal notranslate">y₀</code> when <code class="docutils literal notranslate">x</code> approaches <code class="docutils literal notranslate">x₀</code> within the rational numbers. We can pull the filter <code class="docutils literal notranslate">𝓝 x₀</code> back to <code class="docutils literal notranslate">ℚ</code> using the coercion map <code class="docutils literal notranslate">(↑) : ℚ → ℝ</code> and state <code class="docutils literal notranslate">Tendsto (f ∘ (↑) : ℚ → ℝ) (comap (↑) (𝓝 x₀)) (𝓝 y₀)</code>. - <div class="highlight-lean notranslate"><div class="highlight"><pre>variable (f : ℝ → ℝ) (x₀ y₀ : ℝ) + <div class="highlight-lean notranslate"><div class="highlight"><pre>variable (f : ℝ → ℝ) (x₀ y₀ : ℝ) - #check comap ((↑) : ℚ → ℝ) (𝓝 x₀) + #check comap ((↑) : ℚ → ℝ) (𝓝 x₀) - #check Tendsto (f ∘ (↑)) (comap ((↑) : ℚ → ℝ) (𝓝 x₀)) (𝓝 y₀) + #check Tendsto (f ∘ (↑)) (comap ((↑) : ℚ → ℝ) (𝓝 x₀)) (𝓝 y₀) </pre></div> </div> The pullback operation is also compatible with composition, but it is contravariant, which is to say, it reverses the order of the arguments. <div class="highlight-lean notranslate"><div class="highlight"><pre>section - variable {α β γ : Type*} (F : Filter α) {m : γ → β} {n : β → α} + variable {α β γ : Type*} (F : Filter α) {m : γ → β} {n : β → α} - #check (comap_comap : comap m (comap n F) = comap (n ∘ m) F) + #check (comap_comap : comap m (comap n F) = comap (n ∘ m) F) end </pre></div>
- @@ -338,8 +338,8 @@ which is to say, it reverses the order of the arguments.
 Let’s now shift attention to the plane <code class="docutils literal notranslate">ℝ × ℝ</code> and try to understand how the neighborhoods of a point <code class="docutils literal notranslate">(x₀, y₀)</code> are related to <code class="docutils literal notranslate">𝓝 x₀</code> and <code class="docutils literal notranslate">𝓝 y₀</code>. There is a product operation <code class="docutils literal notranslate">Filter.prod : Filter X → Filter Y → Filter (X × Y)</code>, denoted by <code class="docutils literal notranslate">×ˢ</code>, which answers this question: - <div class="highlight-lean notranslate"><div class="highlight"><pre>example : 𝓝 (x₀, y₀) = 𝓝 x₀ ×ˢ 𝓝 y₀ := - nhds_prod_eq + <div class="highlight-lean notranslate"><div class="highlight"><pre>example : 𝓝 (x₀, y₀) = 𝓝 x₀ ×ˢ 𝓝 y₀ := + nhds_prod_eq </pre></div> </div> The product operation is defined in terms of the pullback operation and the <code class="docutils literal notranslate">inf</code> operation:
- @@ -353,12 +353,12 @@ Thus the <code class="docutils literal notranslate">inf
 to give algebraic proofs about convergence without ever referring to members of filters. You can practice doing this in a proof of the following lemma, unfolding the definition of <code class="docutils literal notranslate">Tendsto</code> and <code class="docutils literal notranslate">Filter.prod</code> if needed. - <div class="highlight-lean notranslate"><div class="highlight"><pre>#check le_inf_iff + <div class="highlight-lean notranslate"><div class="highlight"><pre>#check le_inf_iff - example (f : ℕ → ℝ × ℝ) (x₀ y₀ : ℝ) : - Tendsto f atTop (𝓝 (x₀, y₀)) ↔ - Tendsto (Prod.fst ∘ f) atTop (𝓝 x₀) ∧ Tendsto (Prod.snd ∘ f) atTop (𝓝 y₀) := - sorry + example (f : ℕ → ℝ × ℝ) (x₀ y₀ : ℝ) : + Tendsto f atTop (𝓝 (x₀, y₀)) ↔ + Tendsto (Prod.fst ∘ f) atTop (𝓝 x₀) ∧ Tendsto (Prod.snd ∘ f) atTop (𝓝 y₀) := + sorry </pre></div> </div> The ordered type <code class="docutils literal notranslate">Filter X</code> is actually a complete lattice,
- @@ -411,8 +411,8 @@ a predicate on <code class="docutils literal notranslate">&#95
 In the case of <code class="docutils literal notranslate">𝓝 x₀</code>, we want <code class="docutils literal notranslate">ι</code> to be <code class="docutils literal notranslate">ℝ</code>, we write <code class="docutils literal notranslate">ε</code> for <code class="docutils literal notranslate">i</code>, and the predicate should select the positive values of <code class="docutils literal notranslate">ε</code>. So the fact that the sets <code class="docutils literal notranslate">Ioo  (x₀ - ε) (x₀ + ε)</code> form a basis for the neighborhood topology on <code class="docutils literal notranslate">ℝ</code> is stated as follows: - <div class="highlight-lean notranslate"><div class="highlight"><pre>example (x₀ : ℝ) : HasBasis (𝓝 x₀) (fun ε : ℝ ↦ 0 < ε) fun ε ↦ Ioo (x₀ - ε) (x₀ + ε) := - nhds_basis_Ioo_pos x₀ + <div class="highlight-lean notranslate"><div class="highlight"><pre>example (x₀ : ℝ) : HasBasis (𝓝 x₀) (fun ε : ℝ ↦ 0 < ε) fun ε ↦ Ioo (x₀ - ε) (x₀ + ε) := + nhds_basis_Ioo_pos x₀ </pre></div> </div> There is also a nice basis for the filter <code class="docutils literal notranslate">atTop</code>. The lemma
- @@ -421,11 +421,11 @@ us to reformulate a statement of the form <code class="docutils literal notransl
 given bases for <code class="docutils literal notranslate">F</code> and <code class="docutils literal notranslate">G</code>. Putting these pieces together gives us essentially the notion of convergence that we used in <a class="reference internal" href="C03_Logic.html#sequences-and-convergence">Section 3.6</a>. - <div class="highlight-lean notranslate"><div class="highlight"><pre>example (u : ℕ → ℝ) (x₀ : ℝ) : - Tendsto u atTop (𝓝 x₀) ↔ ∀ ε > 0, ∃ N, ∀ n ≥ N, u n ∈ Ioo (x₀ - ε) (x₀ + ε) := by - have : atTop.HasBasis (fun _ : ℕ ↦ True) Ici := atTop_basis - rw [this.tendsto_iff (nhds_basis_Ioo_pos x₀)] - simp + <div class="highlight-lean notranslate"><div class="highlight"><pre>example (u : ℕ → ℝ) (x₀ : ℝ) : + Tendsto u atTop (𝓝 x₀) ↔ ∀ ε > 0, ∃ N, ∀ n ≥ N, u n ∈ Ioo (x₀ - ε) (x₀ + ε) := by + have : atTop.HasBasis (fun _ : ℕ ↦ True) Ici := atTop_basis + rw [this.tendsto_iff (nhds_basis_Ioo_pos x₀)] + simp </pre></div> </div> We now show how filters facilitate working with properties that hold for sufficiently large numbers
- @@ -445,9 +445,9 @@ but we can use the more suggestive notation <code class="docutils literal notran
 Here the superscripted <code class="docutils literal notranslate">f</code> stands for “Filter.” You can think of the notation as saying that for all <code class="docutils literal notranslate">n</code> in the “set of very large numbers,” <code class="docutils literal notranslate">P n</code> holds. The <code class="docutils literal notranslate">∀ᶠ</code> notation stands for <code class="docutils literal notranslate">Filter.Eventually</code>, and the lemma <code class="docutils literal notranslate">Filter.Eventually.and</code> uses the intersection property of filters to do what we just described: - <div class="highlight-lean notranslate"><div class="highlight"><pre>example (P Q : ℕ → Prop) (hP : ∀ᶠ n in atTop, P n) (hQ : ∀ᶠ n in atTop, Q n) : - ∀ᶠ n in atTop, P n ∧ Q n := - hP.and hQ + <div class="highlight-lean notranslate"><div class="highlight"><pre>example (P Q : ℕ → Prop) (hP : ∀ᶠ n in atTop, P n) (hQ : ∀ᶠ n in atTop, Q n) : + ∀ᶠ n in atTop, P n ∧ Q n := + hP.and hQ </pre></div> </div> This notation is so convenient and intuitive that we also have specializations
- @@ -458,13 +458,13 @@ two sequences of real numbers, and let us show that if
 First we’ll use the generic <code class="docutils literal notranslate">Eventually</code> and then the one specialized for the equality predicate, <code class="docutils literal notranslate">EventuallyEq</code>. The two statements are definitionally equivalent so the same proof work in both cases. - <div class="highlight-lean notranslate"><div class="highlight"><pre>example (u v : ℕ → ℝ) (h : ∀ᶠ n in atTop, u n = v n) (x₀ : ℝ) : - Tendsto u atTop (𝓝 x₀) ↔ Tendsto v atTop (𝓝 x₀) := - tendsto_congr' h + <div class="highlight-lean notranslate"><div class="highlight"><pre>example (u v : ℕ → ℝ) (h : ∀ᶠ n in atTop, u n = v n) (x₀ : ℝ) : + Tendsto u atTop (𝓝 x₀) ↔ Tendsto v atTop (𝓝 x₀) := + tendsto_congr' h - example (u v : ℕ → ℝ) (h : u =ᶠ[atTop] v) (x₀ : ℝ) : - Tendsto u atTop (𝓝 x₀) ↔ Tendsto v atTop (𝓝 x₀) := - tendsto_congr' h + example (u v : ℕ → ℝ) (h : u =ᶠ[atTop] v) (x₀ : ℝ) : + Tendsto u atTop (𝓝 x₀) ↔ Tendsto v atTop (𝓝 x₀) := + tendsto_congr' h </pre></div> </div> It is instructive to review the definition of filters in terms of <code class="docutils literal notranslate">Eventually</code>.
- @@ -474,25 +474,25 @@ Given <code class="docutils literal notranslate">F <spa
 <li>the condition <code class="docutils literal notranslate">U ∈ F → U ⊆ V → V ∈ F</code> ensures <code class="docutils literal notranslate">(∀ᶠ x in F, P x) → (∀ x, P x → Q x) → ∀ᶠ x in F, Q x</code>, and</li> <li>the condition <code class="docutils literal notranslate">U ∈ F → V ∈ F → U ∩ V ∈ F</code> ensures <code class="docutils literal notranslate">(∀ᶠ x in F, P x) → (∀ᶠ x in F, Q x) → ∀ᶠ x in F, P x ∧ Q x</code>.</li> </ul> - <div class="highlight-lean notranslate"><div class="highlight"><pre>#check eventually_of_forall - #check Eventually.mono - #check Eventually.and + <div class="highlight-lean notranslate"><div class="highlight"><pre>#check eventually_of_forall + #check Eventually.mono + #check Eventually.and </pre></div> </div> The second item, corresponding to <code class="docutils literal notranslate">Eventually.mono</code>, supports nice ways of using filters, especially when combined with <code class="docutils literal notranslate">Eventually.and</code>. The <code class="docutils literal notranslate">filter_upwards</code> tactic allows us to combine them. Compare: - <div class="highlight-lean notranslate"><div class="highlight"><pre>example (P Q R : ℕ → Prop) (hP : ∀ᶠ n in atTop, P n) (hQ : ∀ᶠ n in atTop, Q n) - (hR : ∀ᶠ n in atTop, P n ∧ Q n → R n) : ∀ᶠ n in atTop, R n := by - apply (hP.and (hQ.and hR)).mono - rintro n ⟨h, h', h''⟩ - exact h'' ⟨h, h'⟩ + <div class="highlight-lean notranslate"><div class="highlight"><pre>example (P Q R : ℕ → Prop) (hP : ∀ᶠ n in atTop, P n) (hQ : ∀ᶠ n in atTop, Q n) + (hR : ∀ᶠ n in atTop, P n ∧ Q n → R n) : ∀ᶠ n in atTop, R n := by + apply (hP.and (hQ.and hR)).mono + rintro n ⟨h, h', h''⟩ + exact h'' ⟨h, h'⟩ - example (P Q R : ℕ → Prop) (hP : ∀ᶠ n in atTop, P n) (hQ : ∀ᶠ n in atTop, Q n) - (hR : ∀ᶠ n in atTop, P n ∧ Q n → R n) : ∀ᶠ n in atTop, R n := by - filter_upwards [hP, hQ, hR] with n h h' h'' - exact h'' ⟨h, h'⟩ + example (P Q R : ℕ → Prop) (hP : ∀ᶠ n in atTop, P n) (hQ : ∀ᶠ n in atTop, Q n) + (hR : ∀ᶠ n in atTop, P n ∧ Q n → R n) : ∀ᶠ n in atTop, R n := by + filter_upwards [hP, hQ, hR] with n h h' h'' + exact h'' ⟨h, h'⟩ </pre></div> </div> Readers who know about measure theory will note that the filter <code class="docutils literal notranslate">μ.ae</code> of sets whose complement has measure zero
- @@ -517,13 +517,13 @@ topology library.
 See if you can prove it using the quoted lemmas, using the fact that <code class="docutils literal notranslate">ClusterPt x F</code> means <code class="docutils literal notranslate">(𝓝 x ⊓ F).NeBot</code> and that, by definition, the assumption <code class="docutils literal notranslate">∀ᶠ n in atTop, u n ∈ M</code> means <code class="docutils literal notranslate">M ∈ map u atTop</code>. - <div class="highlight-lean notranslate"><div class="highlight"><pre>#check mem_closure_iff_clusterPt - #check le_principal_iff - #check neBot_of_le + <div class="highlight-lean notranslate"><div class="highlight"><pre>#check mem_closure_iff_clusterPt + #check le_principal_iff + #check neBot_of_le - example (u : ℕ → ℝ) (M : Set ℝ) (x : ℝ) (hux : Tendsto u atTop (𝓝 x)) - (huM : ∀ᶠ n in atTop, u n ∈ M) : x ∈ closure M := - sorry + example (u : ℕ → ℝ) (M : Set ℝ) (x : ℝ) (hux : Tendsto u atTop (𝓝 x)) + (huM : ∀ᶠ n in atTop, u n ∈ M) : x ∈ closure M := + sorry </pre></div> </div> </section>
- @@ -533,13 +533,13 @@ by definition, the assumption <code class="docutils literal notranslate">X</code> equipped with a distance function <code class="docutils literal notranslate">dist : X → X → ℝ</code> which is a generalization of the function <code class="docutils literal notranslate">fun x y ↦ |x - y|</code> from the case where <code class="docutils literal notranslate">X = ℝ</code>. Introducing such a space is easy and we will check all properties required from the distance function. - <div class="highlight-lean notranslate"><div class="highlight"><pre>variable {X : Type*} [MetricSpace X] (a b c : X) + <div class="highlight-lean notranslate"><div class="highlight"><pre>variable {X : Type*} [MetricSpace X] (a b c : X) - #check (dist a b : ℝ) - #check (dist_nonneg : 0 ≤ dist a b) - #check (dist_eq_zero : dist a b = 0 ↔ a = b) - #check (dist_comm a b : dist a b = dist b a) - #check (dist_triangle a b c : dist a c ≤ dist a b + dist b c) + #check (dist a b : ℝ) + #check (dist_nonneg : 0 ≤ dist a b) + #check (dist_eq_zero : dist a b = 0 ↔ a = b) + #check (dist_comm a b : dist a b = dist b a) + #check (dist_triangle a b c : dist a c ≤ dist a b + dist b c) </pre></div> </div> Note we also have variants where the distance can be infinite or where <code class="docutils literal notranslate">dist a b</code> can be zero without having <code class="docutils literal notranslate">a = b</code> or both.
- @@ -551,14 +551,14 @@ will be explained as part of the calculus chapter.
 Using distance functions, we can already define convergent sequences and continuous functions between metric spaces. They are actually defined in a more general setting covered in the next section, but we have lemmas recasting the definition in terms of distances. - <div class="highlight-lean notranslate"><div class="highlight"><pre>example {u : ℕ → X} {a : X} : - Tendsto u atTop (𝓝 a) ↔ ∀ ε > 0, ∃ N, ∀ n ≥ N, dist (u n) a < ε := - Metric.tendsto_atTop + <div class="highlight-lean notranslate"><div class="highlight"><pre>example {u : ℕ → X} {a : X} : + Tendsto u atTop (𝓝 a) ↔ ∀ ε > 0, ∃ N, ∀ n ≥ N, dist (u n) a < ε := + Metric.tendsto_atTop - example {X Y : Type*} [MetricSpace X] [MetricSpace Y] {f : X → Y} : - Continuous f ↔ - ∀ x : X, ∀ ε > 0, ∃ δ > 0, ∀ x', dist x' x < δ → dist (f x') (f x) < ε := - Metric.continuous_iff + example {X Y : Type*} [MetricSpace X] [MetricSpace Y] {f : X → Y} : + Continuous f ↔ + ∀ x : X, ∀ ε > 0, ∃ δ > 0, ∀ x', dist x' x < δ → dist (f x') (f x) < ε := + Metric.continuous_iff </pre></div> </div> A lot of lemmas have some continuity assumptions, so we end up proving a lot of continuity results and there
- @@ -566,8 +566,8 @@ is a <code class="docutils literal notranslate">continuity</sp
 in an exercise below. Notice that Lean knows how to treat a product of two metric spaces as a metric space, so it makes sense to consider continuous functions from <code class="docutils literal notranslate">X × X</code> to <code class="docutils literal notranslate">ℝ</code>. In particular the (uncurried version of the) distance function is such a function. - <div class="highlight-lean notranslate"><div class="highlight"><pre>example {X Y : Type*} [MetricSpace X] [MetricSpace Y] {f : X → Y} (hf : Continuous f) : - Continuous fun p : X × X ↦ dist (f p.1) (f p.2) := by continuity + <div class="highlight-lean notranslate"><div class="highlight"><pre>example {X Y : Type*} [MetricSpace X] [MetricSpace Y] {f : X → Y} (hf : Continuous f) : + Continuous fun p : X × X ↦ dist (f p.1) (f p.2) := by continuity </pre></div> </div> This tactic is a bit slow, so it is also useful to know
- @@ -581,9 +581,9 @@ We can do the same for the second component to get continuity of <code class="do
 those two continuities using <code class="docutils literal notranslate">Continuous.prod_mk</code> to get <code class="docutils literal notranslate">(hf.comp continuous_fst).prod_mk (hf.comp continuous_snd) : Continuous (fun p : X × X ↦ (f p.1, f p.2))</code> and compose once more to get our full proof. - <div class="highlight-lean notranslate"><div class="highlight"><pre>example {X Y : Type*} [MetricSpace X] [MetricSpace Y] {f : X → Y} (hf : Continuous f) : - Continuous fun p : X × X ↦ dist (f p.1) (f p.2) := - continuous_dist.comp ((hf.comp continuous_fst).prod_mk (hf.comp continuous_snd)) + <div class="highlight-lean notranslate"><div class="highlight"><pre>example {X Y : Type*} [MetricSpace X] [MetricSpace Y] {f : X → Y} (hf : Continuous f) : + Continuous fun p : X × X ↦ dist (f p.1) (f p.2) := + continuous_dist.comp ((hf.comp continuous_fst).prod_mk (hf.comp continuous_snd)) </pre></div> </div> The combination of <code class="docutils literal notranslate">Continuous.prod_mk</code> and <code class="docutils literal notranslate">continuous_dist</code> via <code class="docutils literal notranslate">Continuous.comp</code> feels clunky,
- @@ -599,15 +599,15 @@ composition and refuse to apply this lemma. It is especially bad at this when pr
 <code class="docutils literal notranslate">Continuous.dist {f g : X → Y} : Continuous f → Continuous g → Continuous (fun x ↦ dist (f x) (g x))</code> which is nicer to Lean’s elaborator and also provides a shorter proof when directly providing a full proof term, as can be seen from the following two new proofs of the above statement: - <div class="highlight-lean notranslate"><div class="highlight"><pre>example {X Y : Type*} [MetricSpace X] [MetricSpace Y] {f : X → Y} (hf : Continuous f) : - Continuous fun p : X × X ↦ dist (f p.1) (f p.2) := by - apply Continuous.dist - exact hf.comp continuous_fst - exact hf.comp continuous_snd + <div class="highlight-lean notranslate"><div class="highlight"><pre>example {X Y : Type*} [MetricSpace X] [MetricSpace Y] {f : X → Y} (hf : Continuous f) : + Continuous fun p : X × X ↦ dist (f p.1) (f p.2) := by + apply Continuous.dist + exact hf.comp continuous_fst + exact hf.comp continuous_snd - example {X Y : Type*} [MetricSpace X] [MetricSpace Y] {f : X → Y} (hf : Continuous f) : - Continuous fun p : X × X ↦ dist (f p.1) (f p.2) := - (hf.comp continuous_fst).dist (hf.comp continuous_snd) + example {X Y : Type*} [MetricSpace X] [MetricSpace Y] {f : X → Y} (hf : Continuous f) : + Continuous fun p : X × X ↦ dist (f p.1) (f p.2) := + (hf.comp continuous_fst).dist (hf.comp continuous_snd) </pre></div> </div> Note that, without the elaboration issue coming from composition, another way to compress
- @@ -617,66 +617,66 @@ as an alternate proof term <code class="docutils literal notranslate">Continuous.fst'</code> which allows to compress <code class="docutils literal notranslate">hf.comp continuous_fst</code> to <code class="docutils literal notranslate">hf.fst'</code> (and the same with <code class="docutils literal notranslate">snd</code>) and get our final proof, now bordering obfuscation. - <div class="highlight-lean notranslate"><div class="highlight"><pre>example {X Y : Type*} [MetricSpace X] [MetricSpace Y] {f : X → Y} (hf : Continuous f) : - Continuous fun p : X × X ↦ dist (f p.1) (f p.2) := - hf.fst'.dist hf.snd' + <div class="highlight-lean notranslate"><div class="highlight"><pre>example {X Y : Type*} [MetricSpace X] [MetricSpace Y] {f : X → Y} (hf : Continuous f) : + Continuous fun p : X × X ↦ dist (f p.1) (f p.2) := + hf.fst'.dist hf.snd' </pre></div> </div> It’s your turn now to prove some continuity lemma. After trying the continuity tactic, you will need <code class="docutils literal notranslate">Continuous.add</code>, <code class="docutils literal notranslate">continuous_pow</code> and <code class="docutils literal notranslate">continuous_id</code> to do it by hand. - <div class="highlight-lean notranslate"><div class="highlight"><pre>example {f : ℝ → X} (hf : Continuous f) : Continuous fun x : ℝ ↦ f (x ^ 2 + x) := - sorry + <div class="highlight-lean notranslate"><div class="highlight"><pre>example {f : ℝ → X} (hf : Continuous f) : Continuous fun x : ℝ ↦ f (x ^ 2 + x) := + sorry </pre></div> </div> So far we saw continuity as a global notion, but one can also define continuity at a point. - <div class="highlight-lean notranslate"><div class="highlight"><pre>example {X Y : Type*} [MetricSpace X] [MetricSpace Y] (f : X → Y) (a : X) : - ContinuousAt f a ↔ ∀ ε > 0, ∃ δ > 0, ∀ {x}, dist x a < δ → dist (f x) (f a) < ε := - Metric.continuousAt_iff + <div class="highlight-lean notranslate"><div class="highlight"><pre>example {X Y : Type*} [MetricSpace X] [MetricSpace Y] (f : X → Y) (a : X) : + ContinuousAt f a ↔ ∀ ε > 0, ∃ δ > 0, ∀ {x}, dist x a < δ → dist (f x) (f a) < ε := + Metric.continuousAt_iff </pre></div> </div> </section> <section id="balls-open-sets-and-closed-sets"> <h3>9.2.2. Balls, open sets and closed sets<a class="headerlink" href="#balls-open-sets-and-closed-sets" title="Link to this heading"></a></h3> Once we have a distance function, the most important geometric definitions are (open) balls and closed balls. - <div class="highlight-lean notranslate"><div class="highlight"><pre>variable (r : ℝ) + <div class="highlight-lean notranslate"><div class="highlight"><pre>variable (r : ℝ) - example : Metric.ball a r = { b | dist b a < r } := - rfl + example : Metric.ball a r = { b | dist b a < r } := + rfl - example : Metric.closedBall a r = { b | dist b a ≤ r } := - rfl + example : Metric.closedBall a r = { b | dist b a ≤ r } := + rfl </pre></div> </div> Note that <cite>r</cite> is any real number here, there is no sign restriction. Of course some statements do require a radius condition. - <div class="highlight-lean notranslate"><div class="highlight"><pre>example (hr : 0 < r) : a ∈ Metric.ball a r := - Metric.mem_ball_self hr + <div class="highlight-lean notranslate"><div class="highlight"><pre>example (hr : 0 < r) : a ∈ Metric.ball a r := + Metric.mem_ball_self hr - example (hr : 0 ≤ r) : a ∈ Metric.closedBall a r := - Metric.mem_closedBall_self hr + example (hr : 0 ≤ r) : a ∈ Metric.closedBall a r := + Metric.mem_closedBall_self hr </pre></div> </div> Once we have balls, we can define open sets. They are actually defined in a more general setting covered in the next section, but we have lemmas recasting the definition in terms of balls. - <div class="highlight-lean notranslate"><div class="highlight"><pre>example (s : Set X) : IsOpen s ↔ ∀ x ∈ s, ∃ ε > 0, Metric.ball x ε ⊆ s := - Metric.isOpen_iff + <div class="highlight-lean notranslate"><div class="highlight"><pre>example (s : Set X) : IsOpen s ↔ ∀ x ∈ s, ∃ ε > 0, Metric.ball x ε ⊆ s := + Metric.isOpen_iff </pre></div> </div> Then closed sets are sets whose complement is open. Their important property is they are closed under limits. The closure of a set is the smallest closed set containing it. - <div class="highlight-lean notranslate"><div class="highlight"><pre>example {s : Set X} : IsClosed s ↔ IsOpen (sᶜ) := - isOpen_compl_iff.symm + <div class="highlight-lean notranslate"><div class="highlight"><pre>example {s : Set X} : IsClosed s ↔ IsOpen (sᶜ) := + isOpen_compl_iff.symm - example {s : Set X} (hs : IsClosed s) {u : ℕ → X} (hu : Tendsto u atTop (𝓝 a)) - (hus : ∀ n, u n ∈ s) : a ∈ s := - hs.mem_of_tendsto hu (eventually_of_forall hus) + example {s : Set X} (hs : IsClosed s) {u : ℕ → X} (hu : Tendsto u atTop (𝓝 a)) + (hus : ∀ n, u n ∈ s) : a ∈ s := + hs.mem_of_tendsto hu (eventually_of_forall hus) - example {s : Set X} : a ∈ closure s ↔ ∀ ε > 0, ∃ b ∈ s, a ∈ Metric.ball b ε := - Metric.mem_closure_iff + example {s : Set X} : a ∈ closure s ↔ ∀ ε > 0, ∃ b ∈ s, a ∈ Metric.ball b ε := + Metric.mem_closure_iff </pre></div> </div> Do the next exercise without using <cite>mem_closure_iff_seq_limit</cite> - <div class="highlight-lean notranslate"><div class="highlight"><pre>example {u : ℕ → X} (hu : Tendsto u atTop (𝓝 a)) {s : Set X} (hs : ∀ n, u n ∈ s) : - a ∈ closure s := - sorry + <div class="highlight-lean notranslate"><div class="highlight"><pre>example {u : ℕ → X} (hu : Tendsto u atTop (𝓝 a)) {s : Set X} (hs : ∀ n, u n ∈ s) : + a ∈ closure s := + sorry </pre></div> </div> Remember from the filters sections that neighborhood filters play a big role in Mathlib.
- @@ -684,11 +684,11 @@ In the metric space context, the crucial point is that balls provide bases for t
 The main lemmas here are <code class="docutils literal notranslate">Metric.nhds_basis_ball</code> and <code class="docutils literal notranslate">Metric.nhds_basis_closedBall</code> that claim this for open and closed balls with positive radius. The center point is an implicit argument so we can invoke <code class="docutils literal notranslate">Filter.HasBasis.mem_iff</code> as in the following example. - <div class="highlight-lean notranslate"><div class="highlight"><pre>example {x : X} {s : Set X} : s ∈ 𝓝 x ↔ ∃ ε > 0, Metric.ball x ε ⊆ s := - Metric.nhds_basis_ball.mem_iff + <div class="highlight-lean notranslate"><div class="highlight"><pre>example {x : X} {s : Set X} : s ∈ 𝓝 x ↔ ∃ ε > 0, Metric.ball x ε ⊆ s := + Metric.nhds_basis_ball.mem_iff - example {x : X} {s : Set X} : s ∈ 𝓝 x ↔ ∃ ε > 0, Metric.closedBall x ε ⊆ s := - Metric.nhds_basis_closedBall.mem_iff + example {x : X} {s : Set X} : s ∈ 𝓝 x ↔ ∃ ε > 0, Metric.closedBall x ε ⊆ s := + Metric.nhds_basis_closedBall.mem_iff </pre></div> </div> </section>
- @@ -707,30 +707,30 @@ claims for compact sets in general metric spaces. In the second statement we onl
 need continuity on the given set so we will use <code class="docutils literal notranslate">ContinuousOn</code> instead of <code class="docutils literal notranslate">Continuous</code>, and we will give separate statements for the minimum and the maximum. Of course all these results are deduced from more general versions, some of which will be discussed in later sections. - <div class="highlight-lean notranslate"><div class="highlight"><pre>example : IsCompact (Set.Icc 0 1 : Set ℝ) := - isCompact_Icc + <div class="highlight-lean notranslate"><div class="highlight"><pre>example : IsCompact (Set.Icc 0 1 : Set ℝ) := + isCompact_Icc - example {s : Set X} (hs : IsCompact s) {u : ℕ → X} (hu : ∀ n, u n ∈ s) : - ∃ a ∈ s, ∃ φ : ℕ → ℕ, StrictMono φ ∧ Tendsto (u ∘ φ) atTop (𝓝 a) := - hs.tendsto_subseq hu + example {s : Set X} (hs : IsCompact s) {u : ℕ → X} (hu : ∀ n, u n ∈ s) : + ∃ a ∈ s, ∃ φ : ℕ → ℕ, StrictMono φ ∧ Tendsto (u ∘ φ) atTop (𝓝 a) := + hs.tendsto_subseq hu - example {s : Set X} (hs : IsCompact s) (hs' : s.Nonempty) {f : X → ℝ} - (hfs : ContinuousOn f s) : - ∃ x ∈ s, ∀ y ∈ s, f x ≤ f y := - hs.exists_forall_le hs' hfs + example {s : Set X} (hs : IsCompact s) (hs' : s.Nonempty) {f : X → ℝ} + (hfs : ContinuousOn f s) : + ∃ x ∈ s, ∀ y ∈ s, f x ≤ f y := + hs.exists_forall_le hs' hfs - example {s : Set X} (hs : IsCompact s) (hs' : s.Nonempty) {f : X → ℝ} - (hfs : ContinuousOn f s) : - ∃ x ∈ s, ∀ y ∈ s, f y ≤ f x := - hs.exists_forall_ge hs' hfs + example {s : Set X} (hs : IsCompact s) (hs' : s.Nonempty) {f : X → ℝ} + (hfs : ContinuousOn f s) : + ∃ x ∈ s, ∀ y ∈ s, f y ≤ f x := + hs.exists_forall_ge hs' hfs - example {s : Set X} (hs : IsCompact s) : IsClosed s := - hs.isClosed + example {s : Set X} (hs : IsCompact s) : IsClosed s := + hs.isClosed </pre></div> </div> We can also specify that a metric spaces is globally compact, using an extra <code class="docutils literal notranslate">Prop</code>-valued type class: - <div class="highlight-lean notranslate"><div class="highlight"><pre>example {X : Type*} [MetricSpace X] [CompactSpace X] : IsCompact (univ : Set X) := - isCompact_univ + <div class="highlight-lean notranslate"><div class="highlight"><pre>example {X : Type*} [MetricSpace X] [CompactSpace X] : IsCompact (univ : Set X) := + isCompact_univ </pre></div> </div> In a compact metric space any closed set is compact, this is <code class="docutils literal notranslate">IsClosed.isCompact</code>.
- @@ -740,10 +740,10 @@ are deduced from more general versions, some of which will be discussed in later
 We now turn to uniformity notions on metric spaces : uniformly continuous functions, Cauchy sequences and completeness. Again those are defined in a more general context but we have lemmas in the metric name space to access their elementary definitions. We start with uniform continuity. - <div class="highlight-lean notranslate"><div class="highlight"><pre>example {X : Type*} [MetricSpace X] {Y : Type*} [MetricSpace Y] {f : X → Y} : - UniformContinuous f ↔ - ∀ ε > 0, ∃ δ > 0, ∀ {a b : X}, dist a b < δ → dist (f a) (f b) < ε := - Metric.uniformContinuous_iff + <div class="highlight-lean notranslate"><div class="highlight"><pre>example {X : Type*} [MetricSpace X] {Y : Type*} [MetricSpace Y] {f : X → Y} : + UniformContinuous f ↔ + ∀ ε > 0, ∃ δ > 0, ∀ {a b : X}, dist a b < δ → dist (f a) (f b) < ε := + Metric.uniformContinuous_iff </pre></div> </div> In order to practice manipulating all those definitions, we will prove that continuous
- @@ -759,10 +759,10 @@ And <code class="docutils literal notranslate">K</code>
 If <code class="docutils literal notranslate">K</code> is empty then we are clearly done (we can set <code class="docutils literal notranslate">δ = 1</code> for instance). So let’s assume <code class="docutils literal notranslate">K</code> is not empty, and use the extreme value theorem to choose <code class="docutils literal notranslate">(x₀, x₁)</code> attaining the infimum of the distance function on <code class="docutils literal notranslate">K</code>. We can then set <code class="docutils literal notranslate">δ = dist x₀ x₁</code> and check everything works. - <div class="highlight-lean notranslate"><div class="highlight"><pre>example {X : Type*} [MetricSpace X] [CompactSpace X] - {Y : Type*} [MetricSpace Y] {f : X → Y} - (hf : Continuous f) : UniformContinuous f := - sorry + <div class="highlight-lean notranslate"><div class="highlight"><pre>example {X : Type*} [MetricSpace X] [CompactSpace X] + {Y : Type*} [MetricSpace Y] {f : X → Y} + (hf : Continuous f) : UniformContinuous f := + sorry </pre></div> </div> </section>
- @@ -772,88 +772,88 @@ of the distance function on <code class="docutils literal notranslate">complete spaces. - <div class="highlight-lean notranslate"><div class="highlight"><pre>example (u : ℕ → X) : - CauchySeq u ↔ ∀ ε > 0, ∃ N : ℕ, ∀ m ≥ N, ∀ n ≥ N, dist (u m) (u n) < ε := - Metric.cauchySeq_iff + <div class="highlight-lean notranslate"><div class="highlight"><pre>example (u : ℕ → X) : + CauchySeq u ↔ ∀ ε > 0, ∃ N : ℕ, ∀ m ≥ N, ∀ n ≥ N, dist (u m) (u n) < ε := + Metric.cauchySeq_iff - example (u : ℕ → X) : - CauchySeq u ↔ ∀ ε > 0, ∃ N : ℕ, ∀ n ≥ N, dist (u n) (u N) < ε := - Metric.cauchySeq_iff' + example (u : ℕ → X) : + CauchySeq u ↔ ∀ ε > 0, ∃ N : ℕ, ∀ n ≥ N, dist (u n) (u N) < ε := + Metric.cauchySeq_iff' - example [CompleteSpace X] (u : ℕ → X) (hu : CauchySeq u) : - ∃ x, Tendsto u atTop (𝓝 x) := - cauchySeq_tendsto_of_complete hu + example [CompleteSpace X] (u : ℕ → X) (hu : CauchySeq u) : + ∃ x, Tendsto u atTop (𝓝 x) := + cauchySeq_tendsto_of_complete hu </pre></div> </div> We’ll practice using this definition by proving a convenient criterion which is a special case of a criterion appearing in Mathlib. This is also a good opportunity to practice using big sums in a geometric context. In addition to the explanations from the filters section, you will probably need <code class="docutils literal notranslate">tendsto_pow_atTop_nhds_0_of_lt_1</code>, <code class="docutils literal notranslate">Tendsto.mul</code> and <code class="docutils literal notranslate">dist_le_range_sum_dist</code>. - <div class="highlight-lean notranslate"><div class="highlight"><pre>theorem cauchySeq_of_le_geometric_two' {u : ℕ → X} - (hu : ∀ n : ℕ, dist (u n) (u (n + 1)) ≤ (1 / 2) ^ n) : CauchySeq u := by - rw [Metric.cauchySeq_iff'] - intro ε ε_pos - obtain ⟨N, hN⟩ : ∃ N : ℕ, 1 / 2 ^ N * 2 < ε := by sorry - use N - intro n hn - obtain ⟨k, rfl : n = N + k⟩ := le_iff_exists_add.mp hn - calc - dist (u (N + k)) (u N) = dist (u (N + 0)) (u (N + k)) := sorry - _ ≤ ∑ i in range k, dist (u (N + i)) (u (N + (i + 1))) := sorry - _ ≤ ∑ i in range k, (1 / 2 : ℝ) ^ (N + i) := sorry - _ = 1 / 2 ^ N * ∑ i in range k, (1 / 2 : ℝ) ^ i := sorry - _ ≤ 1 / 2 ^ N * 2 := sorry - _ < ε := sorry + <div class="highlight-lean notranslate"><div class="highlight"><pre>theorem cauchySeq_of_le_geometric_two' {u : ℕ → X} + (hu : ∀ n : ℕ, dist (u n) (u (n + 1)) ≤ (1 / 2) ^ n) : CauchySeq u := by + rw [Metric.cauchySeq_iff'] + intro ε ε_pos + obtain ⟨N, hN⟩ : ∃ N : ℕ, 1 / 2 ^ N * 2 < ε := by sorry + use N + intro n hn + obtain ⟨k, rfl : n = N + k⟩ := le_iff_exists_add.mp hn + calc + dist (u (N + k)) (u N) = dist (u (N + 0)) (u (N + k)) := sorry + _ ≤ ∑ i in range k, dist (u (N + i)) (u (N + (i + 1))) := sorry + _ ≤ ∑ i in range k, (1 / 2 : ℝ) ^ (N + i) := sorry + _ = 1 / 2 ^ N * ∑ i in range k, (1 / 2 : ℝ) ^ i := sorry + _ ≤ 1 / 2 ^ N * 2 := sorry + _ < ε := sorry </pre></div> </div> We are ready for the final boss of this section: Baire’s theorem for complete metric spaces! The proof skeleton below shows interesting techniques. It uses the <code class="docutils literal notranslate">choose</code> tactic in its exclamation mark variant (you should experiment with removing this exclamation mark) and it shows how to define something inductively in the middle of a proof using <code class="docutils literal notranslate">Nat.rec_on</code>. - <div class="highlight-lean notranslate"><div class="highlight"><pre>open Metric + <div class="highlight-lean notranslate"><div class="highlight"><pre>open Metric - example [CompleteSpace X] (f : ℕ → Set X) (ho : ∀ n, IsOpen (f n)) (hd : ∀ n, Dense (f n)) : - Dense (⋂ n, f n) := by - let B : ℕ → ℝ := fun n ↦ (1 / 2) ^ n - have Bpos : ∀ n, 0 < B n - sorry - /- Translate the density assumption into two functions `center` and `radius` associating + example [CompleteSpace X] (f : ℕ → Set X) (ho : ∀ n, IsOpen (f n)) (hd : ∀ n, Dense (f n)) : + Dense (⋂ n, f n) := by + let B : ℕ → ℝ := fun n ↦ (1 / 2) ^ n + have Bpos : ∀ n, 0 < B n + sorry + /- Translate the density assumption into two functions `center` and `radius` associating to any n, x, δ, δpos a center and a positive radius such that `closedBall center radius` is included both in `f n` and in `closedBall x δ`. We can also require `radius ≤ (1/2)^(n+1)`, to ensure we get a Cauchy sequence later. -/ - have : - ∀ (n : ℕ) (x : X), - ∀ δ > 0, ∃ y : X, ∃ r > 0, r ≤ B (n + 1) ∧ closedBall y r ⊆ closedBall x δ ∩ f n := - by sorry - choose! center radius Hpos HB Hball using this - intro x - rw [mem_closure_iff_nhds_basis nhds_basis_closedBall] - intro ε εpos - /- `ε` is positive. We have to find a point in the ball of radius `ε` around `x` + have : + ∀ (n : ℕ) (x : X), + ∀ δ > 0, ∃ y : X, ∃ r > 0, r ≤ B (n + 1) ∧ closedBall y r ⊆ closedBall x δ ∩ f n := + by sorry + choose! center radius Hpos HB Hball using this + intro x + rw [mem_closure_iff_nhds_basis nhds_basis_closedBall] + intro ε εpos + /- `ε` is positive. We have to find a point in the ball of radius `ε` around `x` belonging to all `f n`. For this, we construct inductively a sequence `F n = (c n, r n)` such that the closed ball `closedBall (c n) (r n)` is included in the previous ball and in `f n`, and such that `r n` is small enough to ensure that `c n` is a Cauchy sequence. Then `c n` converges to a limit which belongs to all the `f n`. -/ - let F : ℕ → X × ℝ := fun n ↦ - Nat.recOn n (Prod.mk x (min ε (B 0))) - fun n p ↦ Prod.mk (center n p.1 p.2) (radius n p.1 p.2) - let c : ℕ → X := fun n ↦ (F n).1 - let r : ℕ → ℝ := fun n ↦ (F n).2 - have rpos : ∀ n, 0 < r n := by sorry - have rB : ∀ n, r n ≤ B n := by sorry - have incl : ∀ n, closedBall (c (n + 1)) (r (n + 1)) ⊆ closedBall (c n) (r n) ∩ f n := by - sorry - have cdist : ∀ n, dist (c n) (c (n + 1)) ≤ B n := by sorry - have : CauchySeq c := cauchySeq_of_le_geometric_two' cdist - -- as the sequence `c n` is Cauchy in a complete space, it converges to a limit `y`. - rcases cauchySeq_tendsto_of_complete this with ⟨y, ylim⟩ - -- this point `y` will be the desired point. We will check that it belongs to all - -- `f n` and to `ball x ε`. - use y - have I : ∀ n, ∀ m ≥ n, closedBall (c m) (r m) ⊆ closedBall (c n) (r n) := by sorry - have yball : ∀ n, y ∈ closedBall (c n) (r n) := by sorry - sorry + let F : ℕ → X × ℝ := fun n ↦ + Nat.recOn n (Prod.mk x (min ε (B 0))) + fun n p ↦ Prod.mk (center n p.1 p.2) (radius n p.1 p.2) + let c : ℕ → X := fun n ↦ (F n).1 + let r : ℕ → ℝ := fun n ↦ (F n).2 + have rpos : ∀ n, 0 < r n := by sorry + have rB : ∀ n, r n ≤ B n := by sorry + have incl : ∀ n, closedBall (c (n + 1)) (r (n + 1)) ⊆ closedBall (c n) (r n) ∩ f n := by + sorry + have cdist : ∀ n, dist (c n) (c (n + 1)) ≤ B n := by sorry + have : CauchySeq c := cauchySeq_of_le_geometric_two' cdist + -- as the sequence `c n` is Cauchy in a complete space, it converges to a limit `y`. + rcases cauchySeq_tendsto_of_complete this with ⟨y, ylim⟩ + -- this point `y` will be the desired point. We will check that it belongs to all + -- `f n` and to `ball x ε`. + use y + have I : ∀ n, ∀ m ≥ n, closedBall (c m) (r m) ⊆ closedBall (c n) (r n) := by sorry + have yball : ∀ n, y ∈ closedBall (c n) (r n) := by sorry + sorry </pre></div> </div> </section>
- @@ -871,28 +871,28 @@ remember the notion of open sets (or equivalently the notion of closed sets). Fr
 a topological space is a type equipped with a collection of sets that are called open sets. This collection has to satisfy a number of axioms presented below (this collection is slightly redundant but we will ignore that). <div class="highlight-lean notranslate"><div class="highlight"><pre>section - variable {X : Type*} [TopologicalSpace X] + variable {X : Type*} [TopologicalSpace X] - example : IsOpen (univ : Set X) := - isOpen_univ + example : IsOpen (univ : Set X) := + isOpen_univ - example : IsOpen (∅ : Set X) := - isOpen_empty + example : IsOpen (∅ : Set X) := + isOpen_empty - example {ι : Type*} {s : ι → Set X} (hs : ∀ i, IsOpen (s i)) : IsOpen (⋃ i, s i) := - isOpen_iUnion hs + example {ι : Type*} {s : ι → Set X} (hs : ∀ i, IsOpen (s i)) : IsOpen (⋃ i, s i) := + isOpen_iUnion hs - example {ι : Type*} [Fintype ι] {s : ι → Set X} (hs : ∀ i, IsOpen (s i)) : - IsOpen (⋂ i, s i) := - isOpen_iInter_of_finite hs + example {ι : Type*} [Fintype ι] {s : ι → Set X} (hs : ∀ i, IsOpen (s i)) : + IsOpen (⋂ i, s i) := + isOpen_iInter_of_finite hs </pre></div> </div> Closed sets are then defined as sets whose complement is open. A function between topological spaces is (globally) continuous if all preimages of open sets are open. - <div class="highlight-lean notranslate"><div class="highlight"><pre>variable {Y : Type*} [TopologicalSpace Y] + <div class="highlight-lean notranslate"><div class="highlight"><pre>variable {Y : Type*} [TopologicalSpace Y] - example {f : X → Y} : Continuous f ↔ ∀ s, IsOpen s → IsOpen (f ⁻¹' s) := - continuous_def + example {f : X → Y} : Continuous f ↔ ∀ s, IsOpen s → IsOpen (f ⁻¹' s) := + continuous_def </pre></div> </div> With this definition we already see that, compared to metric spaces, topological spaces only remember
- @@ -910,22 +910,22 @@ that <code class="docutils literal notranslate">f f</code> of the generalized set of points that are close to <code class="docutils literal notranslate">x</code> is contained in the generalized set of points that are close to <code class="docutils literal notranslate">f x</code>. Recall this is spelled either <code class="docutils literal notranslate">map f (𝓝 x) ≤ 𝓝 (f x)</code> or <code class="docutils literal notranslate">Tendsto f (𝓝 x) (𝓝 (f x))</code>. - <div class="highlight-lean notranslate"><div class="highlight"><pre>example {f : X → Y} {x : X} : ContinuousAt f x ↔ map f (𝓝 x) ≤ 𝓝 (f x) := - Iff.rfl + <div class="highlight-lean notranslate"><div class="highlight"><pre>example {f : X → Y} {x : X} : ContinuousAt f x ↔ map f (𝓝 x) ≤ 𝓝 (f x) := + Iff.rfl </pre></div> </div> One can also spell it using both neighborhoods seen as ordinary sets and a neighborhood filter seen as a generalized set: “for any neighborhood <code class="docutils literal notranslate">U</code> of <code class="docutils literal notranslate">f x</code>, all points close to <code class="docutils literal notranslate">x</code> are sent to <code class="docutils literal notranslate">U</code>”. Note that the proof is again <code class="docutils literal notranslate">iff.rfl</code>, this point of view is definitionally equivalent to the previous one. - <div class="highlight-lean notranslate"><div class="highlight"><pre>example {f : X → Y} {x : X} : ContinuousAt f x ↔ ∀ U ∈ 𝓝 (f x), ∀ᶠ x in 𝓝 x, f x ∈ U := - Iff.rfl + <div class="highlight-lean notranslate"><div class="highlight"><pre>example {f : X → Y} {x : X} : ContinuousAt f x ↔ ∀ U ∈ 𝓝 (f x), ∀ᶠ x in 𝓝 x, f x ∈ U := + Iff.rfl </pre></div> </div> We now explain how to go from one point of view to the other. In terms of open sets, we can simply define members of <code class="docutils literal notranslate">𝓝 x</code> as sets that contain an open set containing <code class="docutils literal notranslate">x</code>. - <div class="highlight-lean notranslate"><div class="highlight"><pre>example {x : X} {s : Set X} : s ∈ 𝓝 x ↔ ∃ t, t ⊆ s ∧ IsOpen t ∧ x ∈ t := - mem_nhds_iff + <div class="highlight-lean notranslate"><div class="highlight"><pre>example {x : X} {s : Set X} : s ∈ 𝓝 x ↔ ∃ t, t ⊆ s ∧ IsOpen t ∧ x ∈ t := + mem_nhds_iff </pre></div> </div> To go in the other direction we need to discuss the condition that <code class="docutils literal notranslate">𝓝 : X → Filter X</code> must satisfy
- @@ -933,17 +933,17 @@ in order to be the neighborhood function of a topology.
 The first constraint is that <code class="docutils literal notranslate">𝓝 x</code>, seen as a generalized set, contains the set <code class="docutils literal notranslate">{x}</code> seen as the generalized set <code class="docutils literal notranslate">pure x</code> (explaining this weird name would be too much of a digression, so we simply accept it for now). Another way to say it is that if a predicate holds for points close to <code class="docutils literal notranslate">x</code> then it holds at <code class="docutils literal notranslate">x</code>. - <div class="highlight-lean notranslate"><div class="highlight"><pre>example (x : X) : pure x ≤ 𝓝 x := - pure_le_nhds x + <div class="highlight-lean notranslate"><div class="highlight"><pre>example (x : X) : pure x ≤ 𝓝 x := + pure_le_nhds x - example (x : X) (P : X → Prop) (h : ∀ᶠ y in 𝓝 x, P y) : P x := - h.self_of_nhds + example (x : X) (P : X → Prop) (h : ∀ᶠ y in 𝓝 x, P y) : P x := + h.self_of_nhds </pre></div> </div> Then a more subtle requirement is that, for any predicate <code class="docutils literal notranslate">P : X → Prop</code> and any <code class="docutils literal notranslate">x</code>, if <code class="docutils literal notranslate">P y</code> holds for <code class="docutils literal notranslate">y</code> close to <code class="docutils literal notranslate">x</code> then for <code class="docutils literal notranslate">y</code> close to <code class="docutils literal notranslate">x</code> and <code class="docutils literal notranslate">z</code> close to <code class="docutils literal notranslate">y</code>, <code class="docutils literal notranslate">P z</code> holds. More precisely we have: - <div class="highlight-lean notranslate"><div class="highlight"><pre>example {P : X → Prop} {x : X} (h : ∀ᶠ y in 𝓝 x, P y) : ∀ᶠ y in 𝓝 x, ∀ᶠ z in 𝓝 y, P z := - eventually_eventually_nhds.mpr h + <div class="highlight-lean notranslate"><div class="highlight"><pre>example {P : X → Prop} {x : X} (h : ∀ᶠ y in 𝓝 x, P y) : ∀ᶠ y in 𝓝 x, ∀ᶠ z in 𝓝 y, P z := + eventually_eventually_nhds.mpr h </pre></div> </div> Those two results characterize the functions <code class="docutils literal notranslate">X → Filter X</code> that are neighborhood functions for a topological space
- @@ -951,10 +951,10 @@ structure on <code class="docutils literal notranslate">X</spa
 but it will give back its input as a neighborhood function only if it satisfies the above two constraints. More precisely we have a lemma <code class="docutils literal notranslate">TopologicalSpace.nhds_mkOfNhds</code> saying that in a different way and our next exercise deduces this different way from how we stated it above. - <div class="highlight-lean notranslate"><div class="highlight"><pre>example {α : Type*} (n : α → Filter α) (H₀ : ∀ a, pure a ≤ n a) - (H : ∀ a : α, ∀ p : α → Prop, (∀ᶠ x in n a, p x) → ∀ᶠ y in n a, ∀ᶠ x in n y, p x) : - ∀ a, ∀ s ∈ n a, ∃ t ∈ n a, t ⊆ s ∧ ∀ a' ∈ t, s ∈ n a' := - sorry + <div class="highlight-lean notranslate"><div class="highlight"><pre>example {α : Type*} (n : α → Filter α) (H₀ : ∀ a, pure a ≤ n a) + (H : ∀ a : α, ∀ p : α → Prop, (∀ᶠ x in n a, p x) → ∀ᶠ y in n a, ∀ᶠ x in n y, p x) : + ∀ a, ∀ s ∈ n a, ∃ t ∈ n a, t ⊆ s ∧ ∀ a' ∈ t, s ∈ n a' := + sorry </pre></div> </div> Note that <code class="docutils literal notranslate">TopologicalSpace.mkOfNhds</code> is not so frequently used, but it still good to know in what
- @@ -976,17 +976,17 @@ sequences of functions is a respectable notion of convergence. But there is no d
 a map <code class="docutils literal notranslate">f : X → (ℝ → ℝ)</code> is continuous if and only if <code class="docutils literal notranslate">fun x ↦ f x t</code> is continuous for every <code class="docutils literal notranslate">t : ℝ</code>. We now review the data used to solve all those issues. First we can use any map <code class="docutils literal notranslate">f : X → Y</code> to push or pull topologies from one side to the other. Those two operations form a Galois connection. - <div class="highlight-lean notranslate"><div class="highlight"><pre>variable {X Y : Type*} + <div class="highlight-lean notranslate"><div class="highlight"><pre>variable {X Y : Type*} - example (f : X → Y) : TopologicalSpace X → TopologicalSpace Y := - TopologicalSpace.coinduced f + example (f : X → Y) : TopologicalSpace X → TopologicalSpace Y := + TopologicalSpace.coinduced f - example (f : X → Y) : TopologicalSpace Y → TopologicalSpace X := - TopologicalSpace.induced f + example (f : X → Y) : TopologicalSpace Y → TopologicalSpace X := + TopologicalSpace.induced f - example (f : X → Y) (T_X : TopologicalSpace X) (T_Y : TopologicalSpace Y) : - TopologicalSpace.coinduced f T_X ≤ T_Y ↔ T_X ≤ TopologicalSpace.induced f T_Y := - coinduced_le_iff_le_induced + example (f : X → Y) (T_X : TopologicalSpace X) (T_Y : TopologicalSpace Y) : + TopologicalSpace.coinduced f T_X ≤ T_Y ↔ T_X ≤ TopologicalSpace.induced f T_Y := + coinduced_le_iff_le_induced </pre></div> </div> Those operations are compactible with composition of functions.
- @@ -1002,14 +1002,14 @@ on neighborhoods more than open sets so, for any <code class="docutils literal n
 And we know the order relation on <code class="docutils literal notranslate">Filter X</code> is designed to ensure an order preserving <code class="docutils literal notranslate">principal : Set X → Filter X</code>, allowing to see filters as generalized sets. So the order relation we do use on <code class="docutils literal notranslate">TopologicalSpace X</code> is opposite to the one coming from <code class="docutils literal notranslate">Set (Set X)</code>. - <div class="highlight-lean notranslate"><div class="highlight"><pre>example {T T' : TopologicalSpace X} : T ≤ T' ↔ ∀ s, T'.IsOpen s → T.IsOpen s := - Iff.rfl + <div class="highlight-lean notranslate"><div class="highlight"><pre>example {T T' : TopologicalSpace X} : T ≤ T' ↔ ∀ s, T'.IsOpen s → T.IsOpen s := + Iff.rfl </pre></div> </div> Now we can recover continuity by combining the push-forward (or pull-back) operation with the order relation. - <div class="highlight-lean notranslate"><div class="highlight"><pre>example (T_X : TopologicalSpace X) (T_Y : TopologicalSpace Y) (f : X → Y) : - Continuous f ↔ TopologicalSpace.coinduced f T_X ≤ T_Y := - continuous_iff_coinduced_le + <div class="highlight-lean notranslate"><div class="highlight"><pre>example (T_X : TopologicalSpace X) (T_Y : TopologicalSpace Y) (f : X → Y) : + Continuous f ↔ TopologicalSpace.coinduced f T_X ≤ T_Y := + continuous_iff_coinduced_le </pre></div> </div> With this definition and the compatibility of push-forward and composition, we
- @@ -1020,11 +1020,11 @@ a function $g : Y → Z$
 \[\begin{split}g \text{ continuous } &⇔ g_*(f_*T_X) ≤ T_Z \\ &⇔ (g ∘ f)_* T_X ≤ T_Z \\ &⇔ g ∘ f \text{ continuous}\end{split}\]</div> - <div class="highlight-lean notranslate"><div class="highlight"><pre>example {Z : Type*} (f : X → Y) (T_X : TopologicalSpace X) (T_Z : TopologicalSpace Z) - (g : Y → Z) : - @Continuous Y Z (TopologicalSpace.coinduced f T_X) T_Z g ↔ - @Continuous X Z T_X T_Z (g ∘ f) := by - rw [continuous_iff_coinduced_le, coinduced_compose, continuous_iff_coinduced_le] + <div class="highlight-lean notranslate"><div class="highlight"><pre>example {Z : Type*} (f : X → Y) (T_X : TopologicalSpace X) (T_Z : TopologicalSpace Z) + (g : Y → Z) : + @Continuous Y Z (TopologicalSpace.coinduced f T_X) T_Z g ↔ + @Continuous X Z T_X T_Z (g ∘ f) := by + rw [continuous_iff_coinduced_le, coinduced_compose, continuous_iff_coinduced_le] </pre></div> </div> So we already get quotient topologies (using the projection map as <code class="docutils literal notranslate">f</code>). This wasn’t using that
- @@ -1041,10 +1041,10 @@ Let us explore that constraint “on paper” using notation So we see that what is the topology we want on <code class="docutils literal notranslate">Π i, X i</code>: - <div class="highlight-lean notranslate"><div class="highlight"><pre>example (ι : Type*) (X : ι → Type*) (T_X : ∀ i, TopologicalSpace (X i)) : - (Pi.topologicalSpace : TopologicalSpace (∀ i, X i)) = - ⨅ i, TopologicalSpace.induced (fun x ↦ x i) (T_X i) := - rfl + <div class="highlight-lean notranslate"><div class="highlight"><pre>example (ι : Type*) (X : ι → Type*) (T_X : ∀ i, TopologicalSpace (X i)) : + (Pi.topologicalSpace : TopologicalSpace (∀ i, X i)) = + ⨅ i, TopologicalSpace.induced (fun x ↦ x i) (T_X i) := + rfl </pre></div> </div> This ends our tour of how Mathlib thinks that topological spaces fix defects of the theory of metric spaces
- @@ -1059,19 +1059,19 @@ is closer to what metric spaces do. The most important is <code class="docutils
 that will ensure that limits are unique. A stronger separation property is <code class="docutils literal notranslate">T3Space</code> that ensures in addition the <cite>RegularSpace</cite> property: each point has a basis of closed neighborhoods. - <div class="highlight-lean notranslate"><div class="highlight"><pre>example [TopologicalSpace X] [T2Space X] {u : ℕ → X} {a b : X} (ha : Tendsto u atTop (𝓝 a)) - (hb : Tendsto u atTop (𝓝 b)) : a = b := - tendsto_nhds_unique ha hb + <div class="highlight-lean notranslate"><div class="highlight"><pre>example [TopologicalSpace X] [T2Space X] {u : ℕ → X} {a b : X} (ha : Tendsto u atTop (𝓝 a)) + (hb : Tendsto u atTop (𝓝 b)) : a = b := + tendsto_nhds_unique ha hb - example [TopologicalSpace X] [RegularSpace X] (a : X) : - (𝓝 a).HasBasis (fun s : Set X ↦ s ∈ 𝓝 a ∧ IsClosed s) id := - closed_nhds_basis a + example [TopologicalSpace X] [RegularSpace X] (a : X) : + (𝓝 a).HasBasis (fun s : Set X ↦ s ∈ 𝓝 a ∧ IsClosed s) id := + closed_nhds_basis a </pre></div> </div> Note that, in every topological space, each point has a basis of open neighborhood, by definition. - <div class="highlight-lean notranslate"><div class="highlight"><pre>example [TopologicalSpace X] {x : X} : - (𝓝 x).HasBasis (fun t : Set X ↦ t ∈ 𝓝 x ∧ IsOpen t) id := - nhds_basis_opens' x + <div class="highlight-lean notranslate"><div class="highlight"><pre>example [TopologicalSpace X] {x : X} : + (𝓝 x).HasBasis (fun t : Set X ↦ t ∈ 𝓝 x ∧ IsOpen t) id := + nhds_basis_opens' x </pre></div> </div> Our main goal is now to prove the basic theorem which allows extension by continuity.
- @@ -1089,11 +1089,11 @@ The assumption “tends to $x$<
 <code class="docutils literal notranslate">comap (↑) (𝓝 x)</code>. Let’s first prove an auxiliary lemma, extracted to simplify the context (in particular we don’t need Y to be a topological space here). - <div class="highlight-lean notranslate"><div class="highlight"><pre>theorem aux {X Y A : Type*} [TopologicalSpace X] {c : A → X} - {f : A → Y} {x : X} {F : Filter Y} - (h : Tendsto f (comap c (𝓝 x)) F) {V' : Set Y} (V'_in : V' ∈ F) : - ∃ V ∈ 𝓝 x, IsOpen V ∧ c ⁻¹' V ⊆ f ⁻¹' V' := by - sorry + <div class="highlight-lean notranslate"><div class="highlight"><pre>theorem aux {X Y A : Type*} [TopologicalSpace X] {c : A → X} + {f : A → Y} {x : X} {F : Filter Y} + (h : Tendsto f (comap c (𝓝 x)) F) {V' : Set Y} (V'_in : V' ∈ F) : + ∃ V ∈ 𝓝 x, IsOpen V ∧ c ⁻¹' V ⊆ f ⁻¹' V' := by + sorry </pre></div> </div> Let’s now turn to the main proof of the extension by continuity theorem.
- @@ -1119,23 +1119,23 @@ Because we know <code class="docutils literal notranslate">Ten
 <code class="docutils literal notranslate">φ y ∈ closure V'</code> and, since <code class="docutils literal notranslate">V'</code> is closed, we have proved <code class="docutils literal notranslate">φ y ∈ V'</code>. It remains to prove that <code class="docutils literal notranslate">φ</code> extends <code class="docutils literal notranslate">f</code>. This is where the continuity of <code class="docutils literal notranslate">f</code> enters the discussion, together with the fact that <code class="docutils literal notranslate">Y</code> is Hausdorff. - <div class="highlight-lean notranslate"><div class="highlight"><pre>example [TopologicalSpace X] [TopologicalSpace Y] [T3Space Y] {A : Set X} - (hA : ∀ x, x ∈ closure A) {f : A → Y} (f_cont : Continuous f) - (hf : ∀ x : X, ∃ c : Y, Tendsto f (comap (↑) (𝓝 x)) (𝓝 c)) : - ∃ φ : X → Y, Continuous φ ∧ ∀ a : A, φ a = f a := by - sorry + <div class="highlight-lean notranslate"><div class="highlight"><pre>example [TopologicalSpace X] [TopologicalSpace Y] [T3Space Y] {A : Set X} + (hA : ∀ x, x ∈ closure A) {f : A → Y} (f_cont : Continuous f) + (hf : ∀ x : X, ∃ c : Y, Tendsto f (comap (↑) (𝓝 x)) (𝓝 c)) : + ∃ φ : X → Y, Continuous φ ∧ ∀ a : A, φ a = f a := by + sorry - #check HasBasis.tendsto_right_iff + #check HasBasis.tendsto_right_iff </pre></div> </div> In addition to separation property, the main kind of assumption you can make on a topological space to bring it closer to metric spaces is countability assumption. The main one is first countability asking that every point has a countable neighborhood basis. In particular this ensures that closure of sets can be understood using sequences. - <div class="highlight-lean notranslate"><div class="highlight"><pre>example [TopologicalSpace X] [FirstCountableTopology X] - {s : Set X} {a : X} : - a ∈ closure s ↔ ∃ u : ℕ → X, (∀ n, u n ∈ s) ∧ Tendsto u atTop (𝓝 a) := - mem_closure_iff_seq_limit + <div class="highlight-lean notranslate"><div class="highlight"><pre>example [TopologicalSpace X] [FirstCountableTopology X] + {s : Set X} {a : X} : + a ∈ closure s ↔ ∃ u : ℕ → X, (∀ n, u n ∈ s) ∧ Tendsto u atTop (𝓝 a) := + mem_closure_iff_seq_limit </pre></div> </div> </section>
- @@ -1148,14 +1148,14 @@ a point <code class="docutils literal notranslate">x <s
 with the generalized set of points that are close to <code class="docutils literal notranslate">x</code>. Then we can say that a set <code class="docutils literal notranslate">s</code> is compact if every nonempty generalized set <code class="docutils literal notranslate">F</code> contained in <code class="docutils literal notranslate">s</code>, ie such that <code class="docutils literal notranslate">F ≤ 𝓟 s</code>, has a cluster point in <code class="docutils literal notranslate">s</code>. - <div class="highlight-lean notranslate"><div class="highlight"><pre>variable [TopologicalSpace X] + <div class="highlight-lean notranslate"><div class="highlight"><pre>variable [TopologicalSpace X] - example {F : Filter X} {x : X} : ClusterPt x F ↔ NeBot (𝓝 x ⊓ F) := - Iff.rfl + example {F : Filter X} {x : X} : ClusterPt x F ↔ NeBot (𝓝 x ⊓ F) := + Iff.rfl - example {s : Set X} : - IsCompact s ↔ ∀ (F : Filter X) [NeBot F], F ≤ 𝓟 s → ∃ a ∈ s, ClusterPt a F := - Iff.rfl + example {s : Set X} : + IsCompact s ↔ ∀ (F : Filter X) [NeBot F], F ≤ 𝓟 s → ∃ a ∈ s, ClusterPt a F := + Iff.rfl </pre></div> </div> For instance if <code class="docutils literal notranslate">F</code> is <code class="docutils literal notranslate">map u atTop</code>, the image under <code class="docutils literal notranslate">u : ℕ → X</code> of <code class="docutils literal notranslate">atTop</code>, the generalized set
- @@ -1164,36 +1164,36 @@ large enough. Saying that <code class="docutils literal notranslate">x</code>. In case <code class="docutils literal notranslate">𝓝 x</code> has a countable basis, we can interpret this as saying that <code class="docutils literal notranslate">u</code> has a subsequence converging to <code class="docutils literal notranslate">x</code>, and we get back what compactness looks like in metric spaces. - <div class="highlight-lean notranslate"><div class="highlight"><pre>example [FirstCountableTopology X] {s : Set X} {u : ℕ → X} (hs : IsCompact s) - (hu : ∀ n, u n ∈ s) : ∃ a ∈ s, ∃ φ : ℕ → ℕ, StrictMono φ ∧ Tendsto (u ∘ φ) atTop (𝓝 a) := - hs.tendsto_subseq hu + <div class="highlight-lean notranslate"><div class="highlight"><pre>example [FirstCountableTopology X] {s : Set X} {u : ℕ → X} (hs : IsCompact s) + (hu : ∀ n, u n ∈ s) : ∃ a ∈ s, ∃ φ : ℕ → ℕ, StrictMono φ ∧ Tendsto (u ∘ φ) atTop (𝓝 a) := + hs.tendsto_subseq hu </pre></div> </div> Cluster points behave nicely with continuous functions. - <div class="highlight-lean notranslate"><div class="highlight"><pre>variable [TopologicalSpace Y] + <div class="highlight-lean notranslate"><div class="highlight"><pre>variable [TopologicalSpace Y] - example {x : X} {F : Filter X} {G : Filter Y} (H : ClusterPt x F) {f : X → Y} - (hfx : ContinuousAt f x) (hf : Tendsto f F G) : ClusterPt (f x) G := - ClusterPt.map H hfx hf + example {x : X} {F : Filter X} {G : Filter Y} (H : ClusterPt x F) {f : X → Y} + (hfx : ContinuousAt f x) (hf : Tendsto f F G) : ClusterPt (f x) G := + ClusterPt.map H hfx hf </pre></div> </div> As an exercise, we will prove that the image of a compact set under a continuous map is compact. In addition to what we saw already, you should use <code class="docutils literal notranslate">Filter.push_pull</code> and <code class="docutils literal notranslate">NeBot.of_map</code>. - <div class="highlight-lean notranslate"><div class="highlight"><pre>example [TopologicalSpace Y] {f : X → Y} (hf : Continuous f) {s : Set X} (hs : IsCompact s) : - IsCompact (f '' s) := by - intro F F_ne F_le - have map_eq : map f (𝓟 s ⊓ comap f F) = 𝓟 (f '' s) ⊓ F := by sorry - have Hne : (𝓟 s ⊓ comap f F).NeBot := by sorry - have Hle : 𝓟 s ⊓ comap f F ≤ 𝓟 s := inf_le_left - sorry + <div class="highlight-lean notranslate"><div class="highlight"><pre>example [TopologicalSpace Y] {f : X → Y} (hf : Continuous f) {s : Set X} (hs : IsCompact s) : + IsCompact (f '' s) := by + intro F F_ne F_le + have map_eq : map f (𝓟 s ⊓ comap f F) = 𝓟 (f '' s) ⊓ F := by sorry + have Hne : (𝓟 s ⊓ comap f F).NeBot := by sorry + have Hle : 𝓟 s ⊓ comap f F ≤ 𝓟 s := inf_le_left + sorry </pre></div> </div> One can also express compactness in terms of open covers: <code class="docutils literal notranslate">s</code> is compact if every family of open sets that cover <code class="docutils literal notranslate">s</code> has a finite covering sub-family. - <div class="highlight-lean notranslate"><div class="highlight"><pre>example {ι : Type*} {s : Set X} (hs : IsCompact s) (U : ι → Set X) (hUo : ∀ i, IsOpen (U i)) - (hsU : s ⊆ ⋃ i, U i) : ∃ t : Finset ι, s ⊆ ⋃ i ∈ t, U i := - hs.elim_finite_subcover U hUo hsU + <div class="highlight-lean notranslate"><div class="highlight"><pre>example {ι : Type*} {s : Set X} (hs : IsCompact s) (U : ι → Set X) (hUo : ∀ i, IsOpen (U i)) + (hsU : s ⊆ ⋃ i, U i) : ∃ t : Finset ι, s ⊆ ⋃ i ∈ t, U i := + hs.elim_finite_subcover U hUo hsU </pre></div> </div> </section>
html/C10_Differential_Calculus.html
- @@ -18,7 +18,7 @@
 <script src="_static/jquery.js?v=5d32c60e"></script> <script src="_static/_sphinx_javascript_frameworks_compat.js?v=2cd50e6c"></script> <script src="_static/documentation_options.js?v=2709fde1"></script> - <script src="_static/doctools.js?v=888ff710"></script> + <script src="_static/doctools.js?v=9a2dae69"></script> <script src="_static/sphinx_highlight.js?v=dc90522c"></script> <script async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-mml-chtml.js"></script> <script src="_static/js/theme.js"></script>
- @@ -114,10 +114,10 @@ a much broader setting.
 between talking about the derivative of <code class="docutils literal notranslate">f</code> at a single point and talking about the derivative function. In Mathlib, the first notion is represented as follows. - <div class="highlight-lean notranslate"><div class="highlight"><pre>open Real + <div class="highlight-lean notranslate"><div class="highlight"><pre>open Real /-- The sin function has derivative 1 at 0. -/ - example : HasDerivAt sin 1 0 := by simpa using hasDerivAt_sin 0 + example : HasDerivAt sin 1 0 := by simpa using hasDerivAt_sin 0 </pre></div> </div> We can also express that <code class="docutils literal notranslate">f</code> is differentiable at a point without
- @@ -127,8 +127,8 @@ We specify <code class="docutils literal notranslate">ℝ<
 when talking about functions from <code class="docutils literal notranslate">ℂ</code> to <code class="docutils literal notranslate">ℂ</code>, we want to be able to distinguish between being differentiable in the real sense and being differentiable in the sense of the complex derivative. - <div class="highlight-lean notranslate"><div class="highlight"><pre>example (x : ℝ) : DifferentiableAt ℝ sin x := - (hasDerivAt_sin x).differentiableAt + <div class="highlight-lean notranslate"><div class="highlight"><pre>example (x : ℝ) : DifferentiableAt ℝ sin x := + (hasDerivAt_sin x).differentiableAt </pre></div> </div> It would be inconvenient to have to provide a proof of differentiability
- @@ -136,19 +136,19 @@ every time we want to refer to a derivative.
 So Mathlib provides a function <code class="docutils literal notranslate">deriv f : ℝ → ℝ</code> that is defined for any function <code class="docutils literal notranslate">f : ℝ → ℝ</code> but is defined to take the value <code class="docutils literal notranslate">0</code> at any point where <code class="docutils literal notranslate">f</code> is not differentiable. - <div class="highlight-lean notranslate"><div class="highlight"><pre>example {f : ℝ → ℝ} {x a : ℝ} (h : HasDerivAt f a x) : deriv f x = a := - h.deriv + <div class="highlight-lean notranslate"><div class="highlight"><pre>example {f : ℝ → ℝ} {x a : ℝ} (h : HasDerivAt f a x) : deriv f x = a := + h.deriv - example {f : ℝ → ℝ} {x : ℝ} (h : ¬DifferentiableAt ℝ f x) : deriv f x = 0 := - deriv_zero_of_not_differentiableAt h + example {f : ℝ → ℝ} {x : ℝ} (h : ¬DifferentiableAt ℝ f x) : deriv f x = 0 := + deriv_zero_of_not_differentiableAt h </pre></div> </div> Of course there are many lemmas about <code class="docutils literal notranslate">deriv</code> that do require differentiability assumptions. For instance, you should think about a counterexample to the next lemma without the differentiability assumptions. - <div class="highlight-lean notranslate"><div class="highlight"><pre>example {f g : ℝ → ℝ} {x : ℝ} (hf : DifferentiableAt ℝ f x) (hg : DifferentiableAt ℝ g x) : - deriv (f + g) x = deriv f x + deriv g x := - deriv_add hf hg + <div class="highlight-lean notranslate"><div class="highlight"><pre>example {f g : ℝ → ℝ} {x : ℝ} (hf : DifferentiableAt ℝ f x) (hg : DifferentiableAt ℝ g x) : + deriv (f + g) x = deriv f x + deriv g x := + deriv_add hf hg </pre></div> </div> Interestingly, however, there are statements that can avoid differentiability
- @@ -157,29 +157,29 @@ of the fact that the value of <code class="docutils literal notranslate">deriv</code>. - <div class="highlight-lean notranslate"><div class="highlight"><pre>example {f : ℝ → ℝ} {a : ℝ} (h : IsLocalMin f a) : deriv f a = 0 := - h.deriv_eq_zero + <div class="highlight-lean notranslate"><div class="highlight"><pre>example {f : ℝ → ℝ} {a : ℝ} (h : IsLocalMin f a) : deriv f a = 0 := + h.deriv_eq_zero </pre></div> </div> We can even state Rolle’s theorem without any differentiability assumptions, which seems even weirder. - <div class="highlight-lean notranslate"><div class="highlight"><pre>open Set + <div class="highlight-lean notranslate"><div class="highlight"><pre>open Set - example {f : ℝ → ℝ} {a b : ℝ} (hab : a < b) (hfc : ContinuousOn f (Icc a b)) (hfI : f a = f b) : - ∃ c ∈ Ioo a b, deriv f c = 0 := - exists_deriv_eq_zero hab hfc hfI + example {f : ℝ → ℝ} {a b : ℝ} (hab : a < b) (hfc : ContinuousOn f (Icc a b)) (hfI : f a = f b) : + ∃ c ∈ Ioo a b, deriv f c = 0 := + exists_deriv_eq_zero hab hfc hfI </pre></div> </div> Of course, this trick does not work for the general mean value theorem. - <div class="highlight-lean notranslate"><div class="highlight"><pre>example (f : ℝ → ℝ) {a b : ℝ} (hab : a < b) (hf : ContinuousOn f (Icc a b)) - (hf' : DifferentiableOn ℝ f (Ioo a b)) : ∃ c ∈ Ioo a b, deriv f c = (f b - f a) / (b - a) := - exists_deriv_eq_slope f hab hf hf' + <div class="highlight-lean notranslate"><div class="highlight"><pre>example (f : ℝ → ℝ) {a b : ℝ} (hab : a < b) (hf : ContinuousOn f (Icc a b)) + (hf' : DifferentiableOn ℝ f (Ioo a b)) : ∃ c ∈ Ioo a b, deriv f c = (f b - f a) / (b - a) := + exists_deriv_eq_slope f hab hf hf' </pre></div> </div> Lean can automatically compute some simple derivatives using the <code class="docutils literal notranslate">simp</code> tactic. - <div class="highlight-lean notranslate"><div class="highlight"><pre>example : deriv (fun x : ℝ ↦ x ^ 5) 6 = 5 * 6 ^ 4 := by simp + <div class="highlight-lean notranslate"><div class="highlight"><pre>example : deriv (fun x : ℝ ↦ x ^ 5) 6 = 5 * 6 ^ 4 := by simp - example : deriv sin π = -1 := by simp + example : deriv sin π = -1 := by simp </pre></div> </div> </section>
- @@ -192,41 +192,41 @@ seems even weirder.
 We start with the notion of a normed group, which is an additive commutative group equipped with a real-valued norm function satisfying the following conditions. - <div class="highlight-lean notranslate"><div class="highlight"><pre>variable {E : Type*} [NormedAddCommGroup E] + <div class="highlight-lean notranslate"><div class="highlight"><pre>variable {E : Type*} [NormedAddCommGroup E] - example (x : E) : 0 ≤ ‖x‖ := - norm_nonneg x + example (x : E) : 0 ≤ ‖x‖ := + norm_nonneg x - example {x : E} : ‖x‖ = 0 ↔ x = 0 := - norm_eq_zero + example {x : E} : ‖x‖ = 0 ↔ x = 0 := + norm_eq_zero - example (x y : E) : ‖x + y‖ ≤ ‖x‖ + ‖y‖ := - norm_add_le x y + example (x y : E) : ‖x + y‖ ≤ ‖x‖ + ‖y‖ := + norm_add_le x y </pre></div> </div> Every normed space is a metric space with distance function $d(x, y) = \| x - y \|$, and hence it is also a topological space. Lean and Mathlib know this. - <div class="highlight-lean notranslate"><div class="highlight"><pre>example : MetricSpace E := by infer_instance + <div class="highlight-lean notranslate"><div class="highlight"><pre>example : MetricSpace E := by infer_instance - example {X : Type*} [TopologicalSpace X] {f : X → E} (hf : Continuous f) : - Continuous fun x ↦ ‖f x‖ := - hf.norm + example {X : Type*} [TopologicalSpace X] {f : X → E} (hf : Continuous f) : + Continuous fun x ↦ ‖f x‖ := + hf.norm </pre></div> </div> In order to use the notion of a norm with concepts from linear algebra, we add the assumption <code class="docutils literal notranslate">NormedSpace ℝ E</code> on top of <code class="docutils literal notranslate">NormedAddGroup E</code>. This stipulates that <code class="docutils literal notranslate">E</code> is a vector space over <code class="docutils literal notranslate">ℝ</code> and that scalar multiplication satisfies the following condition. - <div class="highlight-lean notranslate"><div class="highlight"><pre>variable [NormedSpace ℝ E] + <div class="highlight-lean notranslate"><div class="highlight"><pre>variable [NormedSpace ℝ E] - example (a : ℝ) (x : E) : ‖a • x‖ = |a| * ‖x‖ := - norm_smul a x + example (a : ℝ) (x : E) : ‖a • x‖ = |a| * ‖x‖ := + norm_smul a x </pre></div> </div> A complete normed space is known as a Banach space. Every finite-dimensional vector space is complete. - <div class="highlight-lean notranslate"><div class="highlight"><pre>example [FiniteDimensional ℝ E] : CompleteSpace E := by infer_instance + <div class="highlight-lean notranslate"><div class="highlight"><pre>example [FiniteDimensional ℝ E] : CompleteSpace E := by infer_instance </pre></div> </div> In all the previous examples, we used the real numbers as the base field.
- @@ -235,18 +235,18 @@ More generally, we can make sense of calculus with a vector space over any
 real-valued norm that is multiplicative and has the property that not every element has norm zero or one (equivalently, there is an element whose norm is bigger than one). - <div class="highlight-lean notranslate"><div class="highlight"><pre>example (𝕜 : Type*) [NontriviallyNormedField 𝕜] (x y : 𝕜) : ‖x * y‖ = ‖x‖ * ‖y‖ := - norm_mul x y + <div class="highlight-lean notranslate"><div class="highlight"><pre>example (𝕜 : Type*) [NontriviallyNormedField 𝕜] (x y : 𝕜) : ‖x * y‖ = ‖x‖ * ‖y‖ := + norm_mul x y - example (𝕜 : Type*) [NontriviallyNormedField 𝕜] : ∃ x : 𝕜, 1 < ‖x‖ := - NormedField.exists_one_lt_norm 𝕜 + example (𝕜 : Type*) [NontriviallyNormedField 𝕜] : ∃ x : 𝕜, 1 < ‖x‖ := + NormedField.exists_one_lt_norm 𝕜 </pre></div> </div> A finite-dimensional vector space over a nontrivially normed field is complete as long as the field itself is complete. - <div class="highlight-lean notranslate"><div class="highlight"><pre>example (𝕜 : Type*) [NontriviallyNormedField 𝕜] (E : Type*) [NormedAddCommGroup E] - [NormedSpace 𝕜 E] [CompleteSpace 𝕜] [FiniteDimensional 𝕜 E] : CompleteSpace E := - FiniteDimensional.complete 𝕜 E + <div class="highlight-lean notranslate"><div class="highlight"><pre>example (𝕜 : Type*) [NontriviallyNormedField 𝕜] (E : Type*) [NormedAddCommGroup E] + [NormedSpace 𝕜 E] [CompleteSpace 𝕜] [FiniteDimensional 𝕜 E] : CompleteSpace E := + FiniteDimensional.complete 𝕜 E </pre></div> </div> </section>
- @@ -261,34 +261,34 @@ a structure that that includes the function itself and the properties
 of being linear and continuous. Lean will insert a coercion so that a continuous linear map can be treated as a function. - <div class="highlight-lean notranslate"><div class="highlight"><pre>variable {𝕜 : Type*} [NontriviallyNormedField 𝕜] {E : Type*} [NormedAddCommGroup E] - [NormedSpace 𝕜 E] {F : Type*} [NormedAddCommGroup F] [NormedSpace 𝕜 F] + <div class="highlight-lean notranslate"><div class="highlight"><pre>variable {𝕜 : Type*} [NontriviallyNormedField 𝕜] {E : Type*} [NormedAddCommGroup E] + [NormedSpace 𝕜 E] {F : Type*} [NormedAddCommGroup F] [NormedSpace 𝕜 F] - example : E →L[𝕜] E := - ContinuousLinearMap.id 𝕜 E + example : E →L[𝕜] E := + ContinuousLinearMap.id 𝕜 E - example (f : E →L[𝕜] F) : E → F := - f + example (f : E →L[𝕜] F) : E → F := + f - example (f : E →L[𝕜] F) : Continuous f := - f.cont + example (f : E →L[𝕜] F) : Continuous f := + f.cont - example (f : E →L[𝕜] F) (x y : E) : f (x + y) = f x + f y := - f.map_add x y + example (f : E →L[𝕜] F) (x y : E) : f (x + y) = f x + f y := + f.map_add x y - example (f : E →L[𝕜] F) (a : 𝕜) (x : E) : f (a • x) = a • f x := - f.map_smul a x + example (f : E →L[𝕜] F) (a : 𝕜) (x : E) : f (a • x) = a • f x := + f.map_smul a x </pre></div> </div> Continuous linear maps have an operator norm that is characterized by the following properties. - <div class="highlight-lean notranslate"><div class="highlight"><pre>variable (f : E →L[𝕜] F) + <div class="highlight-lean notranslate"><div class="highlight"><pre>variable (f : E →L[𝕜] F) - example (x : E) : ‖f x‖ ≤ ‖f‖ * ‖x‖ := - f.le_op_norm x + example (x : E) : ‖f x‖ ≤ ‖f‖ * ‖x‖ := + f.le_op_norm x - example {M : ℝ} (hMp : 0 ≤ M) (hM : ∀ x, ‖f x‖ ≤ M * ‖x‖) : ‖f‖ ≤ M := - f.op_norm_le_bound hMp hM + example {M : ℝ} (hMp : 0 ≤ M) (hM : ∀ x, ‖f x‖ ≤ M * ‖x‖) : ‖f‖ ≤ M := + f.op_norm_le_bound hMp hM </pre></div> </div> There is also a notion of bundled continuous linear isomorphism.
- @@ -302,33 +302,33 @@ The main ingredient is Baire’s theorem
 <code class="docutils literal notranslate">nonempty_interior_of_iUnion_of_closed</code>. (You proved a version of this in the topology chapter.) Minor ingredients include <code class="docutils literal notranslate">continuous_linear_map.opNorm_le_of_shell</code>, <code class="docutils literal notranslate">interior_subset</code> and <code class="docutils literal notranslate">interior_iInter_subset</code> and <code class="docutils literal notranslate">isClosed_le</code>. - <div class="highlight-lean notranslate"><div class="highlight"><pre>variable {𝕜 : Type*} [NontriviallyNormedField 𝕜] {E : Type*} [NormedAddCommGroup E] - [NormedSpace 𝕜 E] {F : Type*} [NormedAddCommGroup F] [NormedSpace 𝕜 F] - - open Metric - - example {ι : Type*} [CompleteSpace E] {g : ι → E →L[𝕜] F} (h : ∀ x, ∃ C, ∀ i, ‖g i x‖ ≤ C) : - ∃ C', ∀ i, ‖g i‖ ≤ C' := by - -- sequence of subsets consisting of those `x : E` with norms `‖g i x‖` bounded by `n` - let e : ℕ → Set E := fun n ↦ ⋂ i : ι, { x : E | ‖g i x‖ ≤ n } - -- each of these sets is closed - have hc : ∀ n : ℕ, IsClosed (e n) - sorry - -- the union is the entire space; this is where we use `h` - have hU : (⋃ n : ℕ, e n) = univ - sorry - /- apply the Baire category theorem to conclude that for some `m : ℕ`, + <div class="highlight-lean notranslate"><div class="highlight"><pre>variable {𝕜 : Type*} [NontriviallyNormedField 𝕜] {E : Type*} [NormedAddCommGroup E] + [NormedSpace 𝕜 E] {F : Type*} [NormedAddCommGroup F] [NormedSpace 𝕜 F] + + open Metric + + example {ι : Type*} [CompleteSpace E] {g : ι → E →L[𝕜] F} (h : ∀ x, ∃ C, ∀ i, ‖g i x‖ ≤ C) : + ∃ C', ∀ i, ‖g i‖ ≤ C' := by + -- sequence of subsets consisting of those `x : E` with norms `‖g i x‖` bounded by `n` + let e : ℕ → Set E := fun n ↦ ⋂ i : ι, { x : E | ‖g i x‖ ≤ n } + -- each of these sets is closed + have hc : ∀ n : ℕ, IsClosed (e n) + sorry + -- the union is the entire space; this is where we use `h` + have hU : (⋃ n : ℕ, e n) = univ + sorry + /- apply the Baire category theorem to conclude that for some `m : ℕ`, `e m` contains some `x` -/ - obtain ⟨m, x, hx⟩ : ∃ m, ∃ x, x ∈ interior (e m) := sorry - obtain ⟨ε, ε_pos, hε⟩ : ∃ ε > 0, ball x ε ⊆ interior (e m) := sorry - obtain ⟨k, hk⟩ : ∃ k : 𝕜, 1 < ‖k‖ := sorry - -- show all elements in the ball have norm bounded by `m` after applying any `g i` - have real_norm_le : ∀ z ∈ ball x ε, ∀ (i : ι), ‖g i z‖ ≤ m - sorry - have εk_pos : 0 < ε / ‖k‖ := sorry - refine' ⟨(m + m : ℕ) / (ε / ‖k‖), fun i ↦ ContinuousLinearMap.opNorm_le_of_shell ε_pos _ hk _⟩ - sorry - sorry + obtain ⟨m, x, hx⟩ : ∃ m, ∃ x, x ∈ interior (e m) := sorry + obtain ⟨ε, ε_pos, hε⟩ : ∃ ε > 0, ball x ε ⊆ interior (e m) := sorry + obtain ⟨k, hk⟩ : ∃ k : 𝕜, 1 < ‖k‖ := sorry + -- show all elements in the ball have norm bounded by `m` after applying any `g i` + have real_norm_le : ∀ z ∈ ball x ε, ∀ (i : ι), ‖g i z‖ ≤ m + sorry + have εk_pos : 0 < ε / ‖k‖ := sorry + refine ⟨(m + m : ℕ) / (ε / ‖k‖), fun i ↦ ContinuousLinearMap.opNorm_le_of_shell ε_pos ?_ hk ?_⟩ + sorry + sorry </pre></div> </div> </section>
- @@ -340,23 +340,23 @@ whose definitions are shown below.
 Opening the <code class="docutils literal notranslate">asymptotics</code> locale allows us to use the corresponding notation. Here we will only use little o to define differentiability. - <div class="highlight-lean notranslate"><div class="highlight"><pre>open Asymptotics + <div class="highlight-lean notranslate"><div class="highlight"><pre>open Asymptotics - example {α : Type*} {E : Type*} [NormedGroup E] {F : Type*} [NormedGroup F] (c : ℝ) - (l : Filter α) (f : α → E) (g : α → F) : IsBigOWith c l f g ↔ ∀ᶠ x in l, ‖f x‖ ≤ c * ‖g x‖ := - isBigOWith_iff + example {α : Type*} {E : Type*} [NormedGroup E] {F : Type*} [NormedGroup F] (c : ℝ) + (l : Filter α) (f : α → E) (g : α → F) : IsBigOWith c l f g ↔ ∀ᶠ x in l, ‖f x‖ ≤ c * ‖g x‖ := + isBigOWith_iff - example {α : Type*} {E : Type*} [NormedGroup E] {F : Type*} [NormedGroup F] - (l : Filter α) (f : α → E) (g : α → F) : f =O[l] g ↔ ∃ C, IsBigOWith C l f g := - isBigO_iff_isBigOWith + example {α : Type*} {E : Type*} [NormedGroup E] {F : Type*} [NormedGroup F] + (l : Filter α) (f : α → E) (g : α → F) : f =O[l] g ↔ ∃ C, IsBigOWith C l f g := + isBigO_iff_isBigOWith - example {α : Type*} {E : Type*} [NormedGroup E] {F : Type*} [NormedGroup F] - (l : Filter α) (f : α → E) (g : α → F) : f =o[l] g ↔ ∀ C > 0, IsBigOWith C l f g := - isLittleO_iff_forall_isBigOWith + example {α : Type*} {E : Type*} [NormedGroup E] {F : Type*} [NormedGroup F] + (l : Filter α) (f : α → E) (g : α → F) : f =o[l] g ↔ ∀ C > 0, IsBigOWith C l f g := + isLittleO_iff_forall_isBigOWith - example {α : Type*} {E : Type*} [NormedAddCommGroup E] (l : Filter α) (f g : α → E) : - f ~[l] g ↔ (f - g) =o[l] g := - Iff.rfl + example {α : Type*} {E : Type*} [NormedAddCommGroup E] (l : Filter α) (f g : α → E) : + f ~[l] g ↔ (f - g) =o[l] g := + Iff.rfl </pre></div> </div> </section>
- @@ -367,17 +367,17 @@ In analogy the elementary one-dimensional,
 Mathlib defines a predicate <code class="docutils literal notranslate">HasFDerivAt</code> and a function <code class="docutils literal notranslate">fderiv</code>. Here the letter “f” stands for Fréchet. - <div class="highlight-lean notranslate"><div class="highlight"><pre>open Topology + <div class="highlight-lean notranslate"><div class="highlight"><pre>open Topology - variable {𝕜 : Type*} [NontriviallyNormedField 𝕜] {E : Type*} [NormedAddCommGroup E] - [NormedSpace 𝕜 E] {F : Type*} [NormedAddCommGroup F] [NormedSpace 𝕜 F] + variable {𝕜 : Type*} [NontriviallyNormedField 𝕜] {E : Type*} [NormedAddCommGroup E] + [NormedSpace 𝕜 E] {F : Type*} [NormedAddCommGroup F] [NormedSpace 𝕜 F] - example (f : E → F) (f' : E →L[𝕜] F) (x₀ : E) : - HasFDerivAt f f' x₀ ↔ (fun x ↦ f x - f x₀ - f' (x - x₀)) =o[𝓝 x₀] fun x ↦ x - x₀ := - hasFDerivAtFilter_iff_isLittleO .. + example (f : E → F) (f' : E →L[𝕜] F) (x₀ : E) : + HasFDerivAt f f' x₀ ↔ (fun x ↦ f x - f x₀ - f' (x - x₀)) =o[𝓝 x₀] fun x ↦ x - x₀ := + hasFDerivAtFilter_iff_isLittleO .. - example (f : E → F) (f' : E →L[𝕜] F) (x₀ : E) (hff' : HasFDerivAt f f' x₀) : fderiv 𝕜 f x₀ = f' := - hff'.fderiv + example (f : E → F) (f' : E →L[𝕜] F) (x₀ : E) (hff' : HasFDerivAt f f' x₀) : fderiv 𝕜 f x₀ = f' := + hff'.fderiv </pre></div> </div> We also have iterated derivatives that take values in the type of multilinear maps
- @@ -387,14 +387,14 @@ The type <code class="docutils literal notranslate">WithTop</s
 is bigger than every natural number. So $\mathcal{C}^\infty$ functions are functions <code class="docutils literal notranslate">f</code> that satisfy <code class="docutils literal notranslate">ContDiff 𝕜 ⊤ f</code>. - <div class="highlight-lean notranslate"><div class="highlight"><pre>example (n : ℕ) (f : E → F) : E → E[×n]→L[𝕜] F := - iteratedFDeriv 𝕜 n f - - example (n : WithTop ℕ) {f : E → F} : - ContDiff 𝕜 n f ↔ - (∀ m : ℕ, (m : WithTop ℕ) ≤ n → Continuous fun x ↦ iteratedFDeriv 𝕜 m f x) ∧ - ∀ m : ℕ, (m : WithTop ℕ) < n → Differentiable 𝕜 fun x ↦ iteratedFDeriv 𝕜 m f x := - contDiff_iff_continuous_differentiable + <div class="highlight-lean notranslate"><div class="highlight"><pre>example (n : ℕ) (f : E → F) : E → E[×n]→L[𝕜] F := + iteratedFDeriv 𝕜 n f + + example (n : WithTop ℕ) {f : E → F} : + ContDiff 𝕜 n f ↔ + (∀ m : ℕ, (m : WithTop ℕ) ≤ n → Continuous fun x ↦ iteratedFDeriv 𝕜 m f x) ∧ + ∀ m : ℕ, (m : WithTop ℕ) < n → Differentiable 𝕜 fun x ↦ iteratedFDeriv 𝕜 m f x := + contDiff_iff_continuous_differentiable </pre></div> </div> There is a stricter notion of differentiability called
- @@ -403,10 +403,10 @@ of the inverse function theorem and the statement of the implicit function
 theorem, both of which are in Mathlib. Over <code class="docutils literal notranslate">ℝ</code> or <code class="docutils literal notranslate">ℂ</code>, continuously differentiable functions are strictly differentiable. - <div class="highlight-lean notranslate"><div class="highlight"><pre>example {𝕂 : Type*} [RCLike 𝕂] {E : Type*} [NormedAddCommGroup E] [NormedSpace 𝕂 E] {F : Type*} - [NormedAddCommGroup F] [NormedSpace 𝕂 F] {f : E → F} {x : E} {n : WithTop ℕ} - (hf : ContDiffAt 𝕂 n f x) (hn : 1 ≤ n) : HasStrictFDerivAt f (fderiv 𝕂 f x) x := - hf.hasStrictFDerivAt hn + <div class="highlight-lean notranslate"><div class="highlight"><pre>example {𝕂 : Type*} [RCLike 𝕂] {E : Type*} [NormedAddCommGroup E] [NormedSpace 𝕂 E] {F : Type*} + [NormedAddCommGroup F] [NormedSpace 𝕂 F] {f : E → F} {x : E} {n : WithTop ℕ} + (hf : ContDiffAt 𝕂 n f x) (hn : 1 ≤ n) : HasStrictFDerivAt f (fderiv 𝕂 f x) x := + hf.hasStrictFDerivAt hn </pre></div> </div> The local inverse theorem is stated using an operation that produces an
- @@ -416,26 +416,26 @@ point <code class="docutils literal notranslate">a</cod
 The first example below gets this local inverse. The next one states that it is indeed a local inverse from the left and from the right, and that it is strictly differentiable. - <div class="highlight-lean notranslate"><div class="highlight"><pre>section LocalInverse - variable [CompleteSpace E] {f : E → F} {f' : E ≃L[𝕜] F} {a : E} + <div class="highlight-lean notranslate"><div class="highlight"><pre>section LocalInverse + variable [CompleteSpace E] {f : E → F} {f' : E ≃L[𝕜] F} {a : E} - example (hf : HasStrictFDerivAt f (f' : E →L[𝕜] F) a) : F → E := - HasStrictFDerivAt.localInverse f f' a hf + example (hf : HasStrictFDerivAt f (f' : E →L[𝕜] F) a) : F → E := + HasStrictFDerivAt.localInverse f f' a hf - example (hf : HasStrictFDerivAt f (f' : E →L[𝕜] F) a) : - ∀ᶠ x in 𝓝 a, hf.localInverse f f' a (f x) = x := - hf.eventually_left_inverse + example (hf : HasStrictFDerivAt f (f' : E →L[𝕜] F) a) : + ∀ᶠ x in 𝓝 a, hf.localInverse f f' a (f x) = x := + hf.eventually_left_inverse - example (hf : HasStrictFDerivAt f (f' : E →L[𝕜] F) a) : - ∀ᶠ x in 𝓝 (f a), f (hf.localInverse f f' a x) = x := - hf.eventually_right_inverse + example (hf : HasStrictFDerivAt f (f' : E →L[𝕜] F) a) : + ∀ᶠ x in 𝓝 (f a), f (hf.localInverse f f' a x) = x := + hf.eventually_right_inverse - example {f : E → F} {f' : E ≃L[𝕜] F} {a : E} - (hf : HasStrictFDerivAt f (f' : E →L[𝕜] F) a) : - HasStrictFDerivAt (HasStrictFDerivAt.localInverse f f' a hf) (f'.symm : F →L[𝕜] E) (f a) := - HasStrictFDerivAt.to_localInverse hf + example {f : E → F} {f' : E ≃L[𝕜] F} {a : E} + (hf : HasStrictFDerivAt f (f' : E →L[𝕜] F) a) : + HasStrictFDerivAt (HasStrictFDerivAt.localInverse f f' a hf) (f'.symm : F →L[𝕜] E) (f a) := + HasStrictFDerivAt.to_localInverse hf - end LocalInverse + end LocalInverse </pre></div> </div> This has been only a quick tour of the differential calculus in Mathlib.
html/C11_Integration_and_Measure_Theory.html
- @@ -18,7 +18,7 @@
 <script src="_static/jquery.js?v=5d32c60e"></script> <script src="_static/_sphinx_javascript_frameworks_compat.js?v=2cd50e6c"></script> <script src="_static/documentation_options.js?v=2709fde1"></script> - <script src="_static/doctools.js?v=888ff710"></script> + <script src="_static/doctools.js?v=9a2dae69"></script> <script src="_static/sphinx_highlight.js?v=dc90522c"></script> <script async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-mml-chtml.js"></script> <script src="_static/js/theme.js"></script>
- @@ -99,16 +99,16 @@
 <h2>11.1. Elementary Integration<a class="headerlink" href="#elementary-integration" title="Link to this heading"></a></h2> We first focus on integration of functions on finite intervals in <code class="docutils literal notranslate">ℝ</code>. We can integrate elementary functions. - <div class="highlight-lean notranslate"><div class="highlight"><pre>open MeasureTheory intervalIntegral + <div class="highlight-lean notranslate"><div class="highlight"><pre>open MeasureTheory intervalIntegral - open Interval + open Interval -- this introduces the notation `[[a, b]]` for the segment from `min a b` to `max a b` - example (a b : ℝ) : (∫ x in a..b, x) = (b ^ 2 - a ^ 2) / 2 := - integral_id + example (a b : ℝ) : (∫ x in a..b, x) = (b ^ 2 - a ^ 2) / 2 := + integral_id - example {a b : ℝ} (h : (0 : ℝ) ∉ [[a, b]]) : (∫ x in a..b, 1 / x) = Real.log (b / a) := - integral_one_div h + example {a b : ℝ} (h : (0 : ℝ) ∉ [[a, b]]) : (∫ x in a..b, 1 / x) = Real.log (b / a) := + integral_one_div h </pre></div> </div> The fundamental theorem of calculus relates integration and differentiation.
- @@ -117,20 +117,20 @@ says that integration provides an inverse to differentiation and the second one
 specifies how to compute integrals of derivatives. (These two parts are very closely related, but their optimal versions, which are not shown here, are not equivalent.) - <div class="highlight-lean notranslate"><div class="highlight"><pre>example (f : ℝ → ℝ) (hf : Continuous f) (a b : ℝ) : deriv (fun u ↦ ∫ x : ℝ in a..u, f x) b = f b := - (integral_hasStrictDerivAt_right (hf.intervalIntegrable _ _) (hf.stronglyMeasurableAtFilter _ _) - hf.continuousAt).hasDerivAt.deriv + <div class="highlight-lean notranslate"><div class="highlight"><pre>example (f : ℝ → ℝ) (hf : Continuous f) (a b : ℝ) : deriv (fun u ↦ ∫ x : ℝ in a..u, f x) b = f b := + (integral_hasStrictDerivAt_right (hf.intervalIntegrable _ _) (hf.stronglyMeasurableAtFilter _ _) + hf.continuousAt).hasDerivAt.deriv - example {f : ℝ → ℝ} {a b : ℝ} {f' : ℝ → ℝ} (h : ∀ x ∈ [[a, b]], HasDerivAt f (f' x) x) - (h' : IntervalIntegrable f' volume a b) : (∫ y in a..b, f' y) = f b - f a := - integral_eq_sub_of_hasDerivAt h h' + example {f : ℝ → ℝ} {a b : ℝ} {f' : ℝ → ℝ} (h : ∀ x ∈ [[a, b]], HasDerivAt f (f' x) x) + (h' : IntervalIntegrable f' volume a b) : (∫ y in a..b, f' y) = f b - f a := + integral_eq_sub_of_hasDerivAt h h' </pre></div> </div> Convolution is also defined in Mathlib and its basic properties are proved. - <div class="highlight-lean notranslate"><div class="highlight"><pre>open Convolution + <div class="highlight-lean notranslate"><div class="highlight"><pre>open Convolution - example (f : ℝ → ℝ) (g : ℝ → ℝ) : f ⋆ g = fun x ↦ ∫ t, f t * g (x - t) := - rfl + example (f : ℝ → ℝ) (g : ℝ → ℝ) : f ⋆ g = fun x ↦ ∫ t, f t * g (x - t) := + rfl </pre></div> </div> </section>
- @@ -151,28 +151,28 @@ Note that these axioms are redundant; if you <code class="docutils literal notra
 you will see the ones that Mathlib uses. As the examples below show, countability assumptions can be expressed using the <code class="docutils literal notranslate">Encodable</code> type class. - <div class="highlight-lean notranslate"><div class="highlight"><pre>variable {α : Type*} [MeasurableSpace α] + <div class="highlight-lean notranslate"><div class="highlight"><pre>variable {α : Type*} [MeasurableSpace α] - example : MeasurableSet (∅ : Set α) := - MeasurableSet.empty + example : MeasurableSet (∅ : Set α) := + MeasurableSet.empty - example : MeasurableSet (univ : Set α) := - MeasurableSet.univ + example : MeasurableSet (univ : Set α) := + MeasurableSet.univ - example {s : Set α} (hs : MeasurableSet s) : MeasurableSet (sᶜ) := - hs.compl + example {s : Set α} (hs : MeasurableSet s) : MeasurableSet (sᶜ) := + hs.compl - example : Encodable ℕ := by infer_instance + example : Encodable ℕ := by infer_instance - example (n : ℕ) : Encodable (Fin n) := by infer_instance + example (n : ℕ) : Encodable (Fin n) := by infer_instance - variable {ι : Type*} [Encodable ι] + variable {ι : Type*} [Encodable ι] - example {f : ι → Set α} (h : ∀ b, MeasurableSet (f b)) : MeasurableSet (⋃ b, f b) := - MeasurableSet.iUnion h + example {f : ι → Set α} (h : ∀ b, MeasurableSet (f b)) : MeasurableSet (⋃ b, f b) := + MeasurableSet.iUnion h - example {f : ι → Set α} (h : ∀ b, MeasurableSet (f b)) : MeasurableSet (⋂ b, f b) := - MeasurableSet.iInter h + example {f : ι → Set α} (h : ∀ b, MeasurableSet (f b)) : MeasurableSet (⋂ b, f b) := + MeasurableSet.iInter h </pre></div> </div> Once a type is measurable, we can measure it. On paper, a measure on a set
- @@ -186,18 +186,18 @@ So we extend the measure to any set <code class="docutils literal notranslate"><
 as the infimum of measures of measurable sets containing <code class="docutils literal notranslate">s</code>. Of course, many lemmas still require measurability assumptions, but not all. - <div class="highlight-lean notranslate"><div class="highlight"><pre>open MeasureTheory - variable {μ : Measure α} + <div class="highlight-lean notranslate"><div class="highlight"><pre>open MeasureTheory + variable {μ : Measure α} - example (s : Set α) : μ s = ⨅ (t : Set α) (_ : s ⊆ t) (_ : MeasurableSet t), μ t := - measure_eq_iInf s + example (s : Set α) : μ s = ⨅ (t : Set α) (_ : s ⊆ t) (_ : MeasurableSet t), μ t := + measure_eq_iInf s - example (s : ι → Set α) : μ (⋃ i, s i) ≤ ∑' i, μ (s i) := - measure_iUnion_le s + example (s : ι → Set α) : μ (⋃ i, s i) ≤ ∑' i, μ (s i) := + measure_iUnion_le s - example {f : ℕ → Set α} (hmeas : ∀ i, MeasurableSet (f i)) (hdis : Pairwise (Disjoint on f)) : - μ (⋃ i, f i) = ∑' i, μ (f i) := - μ.m_iUnion hmeas hdis + example {f : ℕ → Set α} (hmeas : ∀ i, MeasurableSet (f i)) (hdis : Pairwise (Disjoint on f)) : + μ (⋃ i, f i) = ∑' i, μ (f i) := + μ.m_iUnion hmeas hdis </pre></div> </div> Once a type has a measure associated with it, we say that a property <code class="docutils literal notranslate">P</code>
- @@ -206,8 +206,8 @@ has measure 0.
 The collection of properties that hold almost everywhere form a filter, but Mathlib introduces special notation for saying that a property holds almost everywhere. - <div class="highlight-lean notranslate"><div class="highlight"><pre>example {P : α → Prop} : (∀ᵐ x ∂μ, P x) ↔ ∀ᶠ x in ae μ, P x := - Iff.rfl + <div class="highlight-lean notranslate"><div class="highlight"><pre>example {P : α → Prop} : (∀ᵐ x ∂μ, P x) ↔ ∀ᶠ x in ae μ, P x := + Iff.rfl </pre></div> </div> </section>
- @@ -222,11 +222,11 @@ that an integral is equal to zero if the function in question is
 not integrable. Most lemmas having to do with integrals have integrability assumptions. <div class="highlight-lean notranslate"><div class="highlight"><pre>section - variable {E : Type*} [NormedAddCommGroup E] [NormedSpace ℝ E] [CompleteSpace E] {f : α → E} + variable {E : Type*} [NormedAddCommGroup E] [NormedSpace ℝ E] [CompleteSpace E] {f : α → E} - example {f g : α → E} (hf : Integrable f μ) (hg : Integrable g μ) : - ∫ a, f a + g a ∂μ = ∫ a, f a ∂μ + ∫ a, g a ∂μ := - integral_add hf hg + example {f g : α → E} (hf : Integrable f μ) (hg : Integrable g μ) : + ∫ a, f a + g a ∂μ = ∫ a, f a ∂μ + ∫ a, g a ∂μ := + integral_add hf hg </pre></div> </div> As an example of the complex interactions between our various conventions, let us see how to integrate constant functions.
- @@ -236,41 +236,41 @@ the point at infinity, to zero.
 For any <code class="docutils literal notranslate">s : Set α</code>, if <code class="docutils literal notranslate">μ s = ⊤</code>, then nonzero constant functions are not integrable on <code class="docutils literal notranslate">s</code>. In that case, their integrals are equal to zero by definition, as is <code class="docutils literal notranslate">(μ s).toReal</code>. So in all cases we have the following lemma. - <div class="highlight-lean notranslate"><div class="highlight"><pre>example {s : Set α} (c : E) : ∫ x in s, c ∂μ = (μ s).toReal • c := - setIntegral_const c + <div class="highlight-lean notranslate"><div class="highlight"><pre>example {s : Set α} (c : E) : ∫ x in s, c ∂μ = (μ s).toReal • c := + setIntegral_const c </pre></div> </div> We now quickly explain how to access the most important theorems in integration theory, starting with the dominated convergence theorem. There are several versions in Mathlib, and here we only show the most basic one. - <div class="highlight-lean notranslate"><div class="highlight"><pre>open Filter + <div class="highlight-lean notranslate"><div class="highlight"><pre>open Filter - example {F : ℕ → α → E} {f : α → E} (bound : α → ℝ) (hmeas : ∀ n, AEStronglyMeasurable (F n) μ) - (hint : Integrable bound μ) (hbound : ∀ n, ∀ᵐ a ∂μ, ‖F n a‖ ≤ bound a) - (hlim : ∀ᵐ a ∂μ, Tendsto (fun n : ℕ ↦ F n a) atTop (𝓝 (f a))) : - Tendsto (fun n ↦ ∫ a, F n a ∂μ) atTop (𝓝 (∫ a, f a ∂μ)) := - tendsto_integral_of_dominated_convergence bound hmeas hint hbound hlim + example {F : ℕ → α → E} {f : α → E} (bound : α → ℝ) (hmeas : ∀ n, AEStronglyMeasurable (F n) μ) + (hint : Integrable bound μ) (hbound : ∀ n, ∀ᵐ a ∂μ, ‖F n a‖ ≤ bound a) + (hlim : ∀ᵐ a ∂μ, Tendsto (fun n : ℕ ↦ F n a) atTop (𝓝 (f a))) : + Tendsto (fun n ↦ ∫ a, F n a ∂μ) atTop (𝓝 (∫ a, f a ∂μ)) := + tendsto_integral_of_dominated_convergence bound hmeas hint hbound hlim </pre></div> </div> Then we have Fubini’s theorem for integrals on product type. - <div class="highlight-lean notranslate"><div class="highlight"><pre>example {α : Type*} [MeasurableSpace α] {μ : Measure α} [SigmaFinite μ] {β : Type*} - [MeasurableSpace β] {ν : Measure β} [SigmaFinite ν] (f : α × β → E) - (hf : Integrable f (μ.prod ν)) : ∫ z, f z ∂ μ.prod ν = ∫ x, ∫ y, f (x, y) ∂ν ∂μ := - integral_prod f hf + <div class="highlight-lean notranslate"><div class="highlight"><pre>example {α : Type*} [MeasurableSpace α] {μ : Measure α} [SigmaFinite μ] {β : Type*} + [MeasurableSpace β] {ν : Measure β} [SigmaFinite ν] (f : α × β → E) + (hf : Integrable f (μ.prod ν)) : ∫ z, f z ∂ μ.prod ν = ∫ x, ∫ y, f (x, y) ∂ν ∂μ := + integral_prod f hf </pre></div> </div> There is a very general version of convolution that applies to any continuous bilinear form. - <div class="highlight-lean notranslate"><div class="highlight"><pre>open Convolution + <div class="highlight-lean notranslate"><div class="highlight"><pre>open Convolution - variable {𝕜 : Type*} {G : Type*} {E : Type*} {E' : Type*} {F : Type*} [NormedAddCommGroup E] - [NormedAddCommGroup E'] [NormedAddCommGroup F] [NontriviallyNormedField 𝕜] [NormedSpace 𝕜 E] - [NormedSpace 𝕜 E'] [NormedSpace 𝕜 F] [MeasurableSpace G] [NormedSpace ℝ F] [CompleteSpace F] - [Sub G] + variable {𝕜 : Type*} {G : Type*} {E : Type*} {E' : Type*} {F : Type*} [NormedAddCommGroup E] + [NormedAddCommGroup E'] [NormedAddCommGroup F] [NontriviallyNormedField 𝕜] [NormedSpace 𝕜 E] + [NormedSpace 𝕜 E'] [NormedSpace 𝕜 F] [MeasurableSpace G] [NormedSpace ℝ F] [CompleteSpace F] + [Sub G] - example (f : G → E) (g : G → E') (L : E →L[𝕜] E' →L[𝕜] F) (μ : Measure G) : - f ⋆[L, μ] g = fun x ↦ ∫ t, L (f t) (g (x - t)) ∂μ := - rfl + example (f : G → E) (g : G → E') (L : E →L[𝕜] E' →L[𝕜] F) (μ : Measure G) : + f ⋆[L, μ] g = fun x ↦ ∫ t, L (f t) (g (x - t)) ∂μ := + rfl </pre></div> </div> Finally, Mathlib has a very general version of the change-of-variables formula.
- @@ -278,13 +278,13 @@ In the statement below, <code class="docutils literal notranslate">$\sigma$-algebra on <code class="docutils literal notranslate">E</code> is generated by the open sets of <code class="docutils literal notranslate">E</code>, and <code class="docutils literal notranslate">IsAddHaarMeasure μ</code> means that the measure <code class="docutils literal notranslate">μ</code> is left-invariant, gives finite mass to compact sets, and give positive mass to open sets. - <div class="highlight-lean notranslate"><div class="highlight"><pre>example {E : Type*} [NormedAddCommGroup E] [NormedSpace ℝ E] [FiniteDimensional ℝ E] - [MeasurableSpace E] [BorelSpace E] (μ : Measure E) [μ.IsAddHaarMeasure] {F : Type*} - [NormedAddCommGroup F] [NormedSpace ℝ F] [CompleteSpace F] {s : Set E} {f : E → E} - {f' : E → E →L[ℝ] E} (hs : MeasurableSet s) - (hf : ∀ x : E, x ∈ s → HasFDerivWithinAt f (f' x) s x) (h_inj : InjOn f s) (g : E → F) : - ∫ x in f '' s, g x ∂μ = ∫ x in s, |(f' x).det| • g (f x) ∂μ := - integral_image_eq_integral_abs_det_fderiv_smul μ hs hf h_inj g + <div class="highlight-lean notranslate"><div class="highlight"><pre>example {E : Type*} [NormedAddCommGroup E] [NormedSpace ℝ E] [FiniteDimensional ℝ E] + [MeasurableSpace E] [BorelSpace E] (μ : Measure E) [μ.IsAddHaarMeasure] {F : Type*} + [NormedAddCommGroup F] [NormedSpace ℝ F] [CompleteSpace F] {s : Set E} {f : E → E} + {f' : E → E →L[ℝ] E} (hs : MeasurableSet s) + (hf : ∀ x : E, x ∈ s → HasFDerivWithinAt f (f' x) s x) (h_inj : InjOn f s) (g : E → F) : + ∫ x in f '' s, g x ∂μ = ∫ x in s, |(f' x).det| • g (f x) ∂μ := + integral_image_eq_integral_abs_det_fderiv_smul μ hs hf h_inj g </pre></div> </div> </section>
html/_static/basic.css
- @@ -4,7 +4,7 @@
  * * Sphinx stylesheet -- basic theme. * - * :copyright: Copyright 2007-2023 by the Sphinx team, see AUTHORS. + * :copyright: Copyright 2007-2024 by the Sphinx team, see AUTHORS. * :license: BSD, see LICENSE for details. * */
html/_static/doctools.js
- @@ -4,7 +4,7 @@
  * * Base JavaScript utilities for all Sphinx HTML documentation. * - * :copyright: Copyright 2007-2023 by the Sphinx team, see AUTHORS. + * :copyright: Copyright 2007-2024 by the Sphinx team, see AUTHORS. * :license: BSD, see LICENSE for details. * */
html/_static/language_data.js
- @@ -5,7 +5,7 @@
  * This script contains the language-specific data used by searchtools.js, * namely the list of stopwords, stemmer, scorer and splitter. * - * :copyright: Copyright 2007-2023 by the Sphinx team, see AUTHORS. + * :copyright: Copyright 2007-2024 by the Sphinx team, see AUTHORS. * :license: BSD, see LICENSE for details. * */
- @@ -13,7 +13,7 @@
  var stopwords = ["a", "and", "are", "as", "at", "be", "but", "by", "for", "if", "in", "into", "is", "it", "near", "no", "not", "of", "on", "or", "such", "that", "the", "their", "then", "there", "these", "they", "this", "to", "was", "will", "with"]; - /* Non-minified version is copied as a separate JS file, is available */ + /* Non-minified version is copied as a separate JS file, if available */ /** * Porter Stemmer
html/_static/searchtools.js
- @@ -4,7 +4,7 @@
  * * Sphinx JavaScript utilities for the full-text search. * - * :copyright: Copyright 2007-2023 by the Sphinx team, see AUTHORS. + * :copyright: Copyright 2007-2024 by the Sphinx team, see AUTHORS. * :license: BSD, see LICENSE for details. * */
- @@ -99,7 +99,7 @@ const _displayItem = (item, searchTerms, highlightTerms) => {
  .then((data) => { if (data) listItem.appendChild( - Search.makeSearchSummary(data, searchTerms) + Search.makeSearchSummary(data, searchTerms, anchor) ); // highlight search terms in the summary if (SPHINX_HIGHLIGHT_ENABLED) // set in sphinx_highlight.js
- @@ -116,8 +116,8 @@ const _finishSearch = (resultCount) => {
  ); else Search.status.innerText = _( - `Search finished, found ${resultCount} page(s) matching the search query.` - ); + "Search finished, found ${resultCount} page(s) matching the search query." + ).replace('${resultCount}', resultCount); }; const _displayNextItem = ( results,
- @@ -137,6 +137,22 @@ const _displayNextItem = (
  // search finished, update title and status message else _finishSearch(resultCount); }; + // Helper function used by query() to order search results. + // Each input is an array of [docname, title, anchor, descr, score, filename]. + // Order the results by score (in opposite order of appearance, since the + // `_displayNextItem` function uses pop() to retrieve items) and then alphabetically. + const _orderResultsByScoreThenName = (a, b) => { + const leftScore = a[4]; + const rightScore = b[4]; + if (leftScore === rightScore) { + // same score: sort alphabetically + const leftTitle = a[1].toLowerCase(); + const rightTitle = b[1].toLowerCase(); + if (leftTitle === rightTitle) return 0; + return leftTitle > rightTitle ? -1 : 1; // inverted is intentional + } + return leftScore > rightScore ? 1 : -1; + }; /** * Default splitQuery function. Can be overridden in ``sphinx.search`` with a
- @@ -160,13 +176,26 @@ const Search = {
  _queued_query: null, _pulse_status: -1, - htmlToText: (htmlString) => { + htmlToText: (htmlString, anchor) => { const htmlElement = new DOMParser().parseFromString(htmlString, 'text/html'); - htmlElement.querySelectorAll(".headerlink").forEach((el) => { el.remove() }); + for (const removalQuery of [".headerlink", "script", "style"]) { + htmlElement.querySelectorAll(removalQuery).forEach((el) => { el.remove() }); + } + if (anchor) { + const anchorContent = htmlElement.querySelector(`[role="main"] ${anchor}`); + if (anchorContent) return anchorContent.textContent; + + console.warn( + `Anchored content block not found. Sphinx search tries to obtain it via DOM query '[role=main] ${anchor}'. Check your theme or template.` + ); + } + + // if anchor not specified or not found, fall back to main content const docContent = htmlElement.querySelector('[role="main"]'); - if (docContent !== undefined) return docContent.textContent; + if (docContent) return docContent.textContent; + console.warn( - "Content block not found. Sphinx search tries to obtain it via '[role=main]'. Could you check your theme or template." + "Content block not found. Sphinx search tries to obtain it via DOM query '[role=main]'. Check your theme or template." ); return ""; },
- @@ -239,16 +268,7 @@ const Search = {
  else Search.deferQuery(query); }, - /** - * execute search (requires search index to be loaded) - */ - query: (query) => { - const filenames = Search._index.filenames; - const docNames = Search._index.docnames; - const titles = Search._index.titles; - const allTitles = Search._index.alltitles; - const indexEntries = Search._index.indexentries; - + _parseQuery: (query) => { // stem the search terms and add them to the correct list const stemmer = new Stemmer(); const searchTerms = new Set();
- @@ -284,21 +304,38 @@ const Search = {
  // console.info("required: ", [...searchTerms]); // console.info("excluded: ", [...excludedTerms]); - // array of [docname, title, anchor, descr, score, filename] - let results = []; + return [query, searchTerms, excludedTerms, highlightTerms, objectTerms]; + }, + + /** + * execute search (requires search index to be loaded) + */ + _performSearch: (query, searchTerms, excludedTerms, highlightTerms, objectTerms) => { + const filenames = Search._index.filenames; + const docNames = Search._index.docnames; + const titles = Search._index.titles; + const allTitles = Search._index.alltitles; + const indexEntries = Search._index.indexentries; + + // Collect multiple result groups to be sorted separately and then ordered. + // Each is an array of [docname, title, anchor, descr, score, filename]. + const normalResults = []; + const nonMainIndexResults = []; + _removeChildren(document.getElementById("search-progress")); - const queryLower = query.toLowerCase(); + const queryLower = query.toLowerCase().trim(); for (const [title, foundTitles] of Object.entries(allTitles)) { - if (title.toLowerCase().includes(queryLower) && (queryLower.length >= title.length/2)) { + if (title.toLowerCase().trim().includes(queryLower) && (queryLower.length >= title.length/2)) { for (const [file, id] of foundTitles) { - let score = Math.round(100 * queryLower.length / title.length) - results.push([ + const score = Math.round(Scorer.title * queryLower.length / title.length); + const boost = titles[file] === title ? 1 : 0; // add a boost for document titles + normalResults.push([ docNames[file], titles[file] !== title ? `${titles[file]} > ${title}` : title, id !== null ? "#" + id : "", null, - score, + score + boost, filenames[file], ]); }
- @@ -308,46 +345,47 @@ const Search = {
  // search for explicit entries in index directives for (const [entry, foundEntries] of Object.entries(indexEntries)) { if (entry.includes(queryLower) && (queryLower.length >= entry.length/2)) { - for (const [file, id] of foundEntries) { - let score = Math.round(100 * queryLower.length / entry.length) - results.push([ + for (const [file, id, isMain] of foundEntries) { + const score = Math.round(100 * queryLower.length / entry.length); + const result = [ docNames[file], titles[file], id ? "#" + id : "", null, score, filenames[file], - ]); + ]; + if (isMain) { + normalResults.push(result); + } else { + nonMainIndexResults.push(result); + } } } } // lookup as object objectTerms.forEach((term) => - results.push(...Search.performObjectSearch(term, objectTerms)) + normalResults.push(...Search.performObjectSearch(term, objectTerms)) ); // lookup as search terms in fulltext - results.push(...Search.performTermsSearch(searchTerms, excludedTerms)); + normalResults.push(...Search.performTermsSearch(searchTerms, excludedTerms)); // let the scorer override scores with a custom scoring function - if (Scorer.score) results.forEach((item) => (item[4] = Scorer.score(item))); - - // now sort the results by score (in opposite order of appearance, since the - // display function below uses pop() to retrieve items) and then - // alphabetically - results.sort((a, b) => { - const leftScore = a[4]; - const rightScore = b[4]; - if (leftScore === rightScore) { - // same score: sort alphabetically - const leftTitle = a[1].toLowerCase(); - const rightTitle = b[1].toLowerCase(); - if (leftTitle === rightTitle) return 0; - return leftTitle > rightTitle ? -1 : 1; // inverted is intentional - } - return leftScore > rightScore ? 1 : -1; - }); + if (Scorer.score) { + normalResults.forEach((item) => (item[4] = Scorer.score(item))); + nonMainIndexResults.forEach((item) => (item[4] = Scorer.score(item))); + } + + // Sort each group of results by score and then alphabetically by name. + normalResults.sort(_orderResultsByScoreThenName); + nonMainIndexResults.sort(_orderResultsByScoreThenName); + + // Combine the result groups in (reverse) order. + // Non-main index entries are typically arbitrary cross-references, + // so display them after other results. + let results = [...nonMainIndexResults, ...normalResults]; // remove duplicate search results // note the reversing of results, so that in the case of duplicates, the highest-scoring entry is kept
- @@ -361,7 +399,12 @@ const Search = {
  return acc; }, []); - results = results.reverse(); + return results.reverse(); + }, + + query: (query) => { + const [searchQuery, searchTerms, excludedTerms, highlightTerms, objectTerms] = Search._parseQuery(query); + const results = Search._performSearch(searchQuery, searchTerms, excludedTerms, highlightTerms, objectTerms); // for debugging //Search.lastresults = results.slice(); // a copy
- @@ -466,14 +509,18 @@ const Search = {
  // add support for partial matches if (word.length > 2) { const escapedWord = _escapeRegExp(word); - Object.keys(terms).forEach((term) => { - if (term.match(escapedWord) && !terms[word]) - arr.push({ files: terms[term], score: Scorer.partialTerm }); - }); - Object.keys(titleTerms).forEach((term) => { - if (term.match(escapedWord) && !titleTerms[word]) - arr.push({ files: titleTerms[word], score: Scorer.partialTitle }); - }); + if (!terms.hasOwnProperty(word)) { + Object.keys(terms).forEach((term) => { + if (term.match(escapedWord)) + arr.push({ files: terms[term], score: Scorer.partialTerm }); + }); + } + if (!titleTerms.hasOwnProperty(word)) { + Object.keys(titleTerms).forEach((term) => { + if (term.match(escapedWord)) + arr.push({ files: titleTerms[term], score: Scorer.partialTitle }); + }); + } } // no match but word was a required one
- @@ -496,9 +543,8 @@ const Search = {
  // create the mapping files.forEach((file) => { - if (fileMap.has(file) && fileMap.get(file).indexOf(word) === -1) - fileMap.get(file).push(word); - else fileMap.set(file, [word]); + if (!fileMap.has(file)) fileMap.set(file, [word]); + else if (fileMap.get(file).indexOf(word) === -1) fileMap.get(file).push(word); }); });
- @@ -549,8 +595,8 @@ const Search = {
  * search summary for a given text. keywords is a list * of stemmed words. */ - makeSearchSummary: (htmlText, keywords) => { - const text = Search.htmlToText(htmlText); + makeSearchSummary: (htmlText, keywords, anchor) => { + const text = Search.htmlToText(htmlText, anchor); if (text === "") return null; const textLower = text.toLowerCase();
html/genindex.html
- @@ -17,7 +17,7 @@
 <script src="_static/jquery.js?v=5d32c60e"></script> <script src="_static/_sphinx_javascript_frameworks_compat.js?v=2cd50e6c"></script> <script src="_static/documentation_options.js?v=2709fde1"></script> - <script src="_static/doctools.js?v=888ff710"></script> + <script src="_static/doctools.js?v=9a2dae69"></script> <script src="_static/sphinx_highlight.js?v=dc90522c"></script> <script src="_static/js/theme.js"></script> <link rel="index" title="Index" href="#" />
html/index.html
- @@ -18,8 +18,9 @@
 <script src="_static/jquery.js?v=5d32c60e"></script> <script src="_static/_sphinx_javascript_frameworks_compat.js?v=2cd50e6c"></script> <script src="_static/documentation_options.js?v=2709fde1"></script> - <script src="_static/doctools.js?v=888ff710"></script> + <script src="_static/doctools.js?v=9a2dae69"></script> <script src="_static/sphinx_highlight.js?v=dc90522c"></script> + <script async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-mml-chtml.js"></script> <script src="_static/js/theme.js"></script> <link rel="index" title="Index" href="genindex.html" /> <link rel="search" title="Search" href="search.html" />
html/search.html
- @@ -18,7 +18,7 @@
 <script src="_static/jquery.js?v=5d32c60e"></script> <script src="_static/_sphinx_javascript_frameworks_compat.js?v=2cd50e6c"></script> <script src="_static/documentation_options.js?v=2709fde1"></script> - <script src="_static/doctools.js?v=888ff710"></script> + <script src="_static/doctools.js?v=9a2dae69"></script> <script src="_static/sphinx_highlight.js?v=dc90522c"></script> <script src="_static/js/theme.js"></script> <script src="_static/searchtools.js"></script>
html/searchindex.js
- @@ -1,1 +1,1 @@
 - Search.setIndex({"docnames": ["C01_Introduction", "C02_Basics", "C03_Logic", "C04_Sets_and_Functions", "C05_Elementary_Number_Theory", "C06_Structures", "C07_Hierarchies", "C08_Groups_and_Rings", "C09_Topology", "C10_Differential_Calculus", "C11_Integration_and_Measure_Theory", "genindex", "index"], "filenames": ["C01_Introduction.rst", "C02_Basics.rst", "C03_Logic.rst", "C04_Sets_and_Functions.rst", "C05_Elementary_Number_Theory.rst", "C06_Structures.rst", "C07_Hierarchies.rst", "C08_Groups_and_Rings.rst", "C09_Topology.rst", "C10_Differential_Calculus.rst", "C11_Integration_and_Measure_Theory.rst", "genindex.rst", "index.rst"], "titles": ["1. Introduction", "2. Basics", "3. Logic", "4. Sets and Functions", "5. Elementary Number Theory", "6. Structures", "7. Hierarchies", "8. Groups and Rings", "9. Topology", "10. Differential Calculus", "11. Integration and Measure Theory", "Index", "Mathematics in Lean"], "terms": {"The": [0, 1, 4, 5, 6, 7, 8, 9, 10, 12], "goal": [0, 1, 2, 3, 4, 5, 8], "thi": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10], "book": [0, 2, 8], "i": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10], "teach": 0, "you": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10], "formal": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9], "mathemat": [0, 1, 2, 3, 4, 5, 6, 7, 8], "us": [0, 2, 3, 4, 5, 6, 7, 8, 9, 10, 12], "lean": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9], "4": [0, 1, 2, 4, 5, 7, 8, 9], "interact": [0, 5, 6, 7, 10], "proof": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9], "assist": [0, 2, 5], "It": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9], "assum": [0, 1, 2, 3, 4, 6, 7, 8], "know": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9], "some": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9], "doe": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9], "requir": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10], "much": [0, 2, 4, 6, 7, 8, 9], "although": [0, 3, 4, 5, 6, 7, 8], "we": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10], "cover": [0, 1, 3, 6, 7, 8, 9], "exampl": [0, 2, 3, 4, 5, 6, 7, 8, 9, 10, 12], "rang": [0, 2, 3, 4, 7, 8], "from": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10], "number": [0, 1, 2, 3, 5, 6, 7, 8, 9, 12], "theori": [0, 1, 2, 3, 6, 7, 8, 9, 12], "measur": [0, 5, 8, 9, 12], "analysi": [0, 5, 9], "focu": [0, 1, 7, 8, 10], "elementari": [0, 3, 5, 7, 8, 12], "aspect": [0, 5, 7], "those": [0, 1, 2, 3, 5, 6, 7, 8, 9], "field": [0, 1, 5, 6, 7, 9], "hope": [0, 1], "thei": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9], "ar": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10], "familiar": [0, 1, 4, 5, 8, 9], "can": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10], "pick": [0, 6], "them": [0, 1, 2, 3, 4, 5, 6, 7, 8], "up": [0, 2, 3, 4, 5, 6, 7, 8], "go": [0, 1, 2, 3, 4, 6, 8], "also": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10], "don": [0, 1, 2, 3, 4, 5, 6, 7, 8, 10], "t": [0, 1, 2, 3, 4, 5, 6, 7, 8, 10], "presuppos": 0, "ani": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10], "background": [0, 7], "method": [0, 2, 3, 4, 5], "seen": [0, 1, 2, 4, 5, 6, 7, 8], "kind": [0, 1, 6, 8], "comput": [0, 2, 3, 4, 5, 7, 9, 10], "program": [0, 1, 2], "write": [0, 1, 2, 4, 5, 6, 7, 8, 9, 10], "definit": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10], "theorem": [0, 2, 4, 5, 7, 8, 9, 10, 12], "regiment": 0, "languag": [0, 1, 2, 3], "like": [0, 1, 2, 3, 4, 5, 6, 7, 8], "understand": [0, 2, 3, 4, 5, 6, 7, 8], "In": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10], "return": [0, 2, 3, 4, 5, 7, 8], "provid": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10], "feedback": 0, "inform": [0, 1, 2, 3, 5, 6, 8], "interpret": [0, 1, 4, 5, 7, 8], "express": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10], "guarante": [0, 3, 5], "well": [0, 1, 2, 3, 4, 5, 6, 7, 8], "form": [0, 1, 2, 3, 4, 5, 6, 7, 8, 10], "ultim": 0, "certifi": 0, "correct": [0, 1, 7], "our": [0, 1, 2, 3, 4, 5, 6, 7, 8, 10], "learn": [0, 1, 4, 5], "more": [0, 2, 3, 4, 5, 6, 7, 8, 9, 12], "about": [0, 2, 3, 4, 5, 6, 7, 8, 9, 12], "project": [0, 4, 5, 7, 8], "page": [0, 1, 4], "commun": [0, 4], "web": [0, 1, 4], "tutori": 0, "base": [0, 2, 3, 4, 6, 7, 8, 9], "": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10], "larg": [0, 6, 8], "ever": [0, 8], "grow": [0, 6, 7], "librari": [0, 1, 2, 3, 4, 5, 7, 8, 9], "mathlib": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10], "strongli": 0, "recommend": [0, 1, 3], "join": [0, 1, 5], "zulip": [0, 4], "onlin": 0, "chat": 0, "group": [0, 1, 2, 3, 4, 5, 6, 8, 9, 12], "haven": [0, 2, 6, 8], "alreadi": [0, 1, 2, 3, 4, 5, 6, 7, 8], "ll": [0, 2, 4, 6, 8], "find": [0, 1, 2, 4, 5, 6, 8], "live": [0, 5], "welcom": [0, 1], "enthusiast": 0, "happi": 0, "answer": [0, 5, 8], "question": [0, 4, 6, 8, 10], "offer": [0, 2, 5, 8], "moral": [0, 5, 7], "support": [0, 1, 2, 3, 4, 5, 6, 8], "read": [0, 1, 4, 5, 6, 7, 8], "pdf": 0, "html": 0, "version": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10], "design": [0, 1, 2, 3, 5, 7, 8], "run": 0, "insid": [0, 1, 2, 3, 7], "v": [0, 1, 2, 3, 5, 8], "code": [0, 1, 2, 3, 5, 6], "editor": [0, 1], "To": [0, 1, 2, 3, 4, 5, 6, 7, 8], "instal": [0, 6], "follow": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10], "instruct": [0, 1, 2, 8], "make": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9], "sure": [0, 1, 2, 3, 5, 6, 7], "have": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10], "git": 0, "fetch": 0, "mathematics_in_lean": 0, "repositori": [0, 1], "open": [0, 1, 2, 3, 4, 5, 7, 9, 10], "each": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9], "section": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10], "ha": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10], "an": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10], "associ": [0, 1, 2, 4, 5, 6, 7, 8, 10], "file": [0, 1, 4, 5, 6, 7, 8], "exercis": [0, 1, 2, 3, 5, 6, 7, 8, 9], "folder": 0, "mil": 0, "organ": 0, "chapter": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9], "copi": [0, 3, 4, 6, 7, 8], "experi": [0, 1, 8], "do": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10], "leav": [0, 1, 2, 3, 5, 6, 7], "origin": [0, 1, 5, 7], "intact": 0, "easier": [0, 1, 3, 4, 6, 8], "updat": 0, "chang": [0, 1, 2, 4, 5, 8, 10], "see": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10], "below": [0, 2, 3, 4, 5, 6, 7, 8, 9, 10], "call": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10], "my_fil": 0, "whatev": [0, 2, 4], "want": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10], "creat": [0, 1, 4, 6], "your": [0, 1, 2, 3, 5, 6, 7, 8], "own": [0, 1, 4, 5, 6], "At": [0, 1, 2, 4, 5, 6], "point": [0, 1, 2, 3, 5, 6, 7, 8, 9, 10], "textbook": [0, 1, 2], "side": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9], "panel": 0, "type": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10], "ctrl": [0, 1, 2, 4, 5], "shift": [0, 1, 6, 8], "p": [0, 1, 2, 3, 4, 5, 6, 7, 8, 10], "command": [0, 1, 2, 3, 4, 5, 6, 7], "maco": 0, "doc": 0, "show": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10], "document": [0, 1, 3, 4, 6], "resourc": 0, "bar": [0, 1, 2], "appear": [0, 1, 2, 5, 6, 7, 8], "press": 0, "select": [0, 8], "soon": [0, 2, 6, 7, 8], "highlight": [0, 2], "menu": [0, 1], "window": [0, 1, 2, 5], "click": [0, 1, 3, 4, 5, 6], "altern": [0, 1, 2, 3, 4, 5, 6, 8], "cloud": 0, "gitpod": 0, "how": [0, 1, 2, 3, 4, 5, 6, 7, 8, 10], "github": [0, 1], "still": [0, 1, 2, 3, 4, 5, 6, 8, 10], "work": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9], "describ": [0, 1, 2, 3, 4, 5, 6, 8], "abov": [0, 1, 2, 3, 4, 5, 6, 7, 8, 10], "progress": [0, 1, 5, 7], "pull": [0, 7, 8], "lake": 0, "ex": [0, 2], "cach": 0, "content": [0, 1, 2, 4, 8], "which": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10], "why": [0, 2, 4, 6, 7, 8], "suggest": [0, 2, 4, 5, 8], "intend": [0, 1, 2, 5], "while": [0, 1, 2, 6, 7, 8], "contain": [0, 2, 3, 4, 5, 6, 7, 8, 9, 10], "explan": [0, 7, 8], "hint": [0, 1, 2, 10], "text": [0, 3, 5, 8], "often": [0, 1, 2, 3, 4, 5, 6, 7, 8], "includ": [0, 1, 2, 3, 4, 6, 7, 8, 9], "one": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10], "eval": [0, 7], "hello": 0, "world": 0, "should": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9], "abl": [0, 1, 2, 3, 4, 5, 6, 7, 9], "correspond": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9], "If": [0, 1, 2, 3, 4, 5, 6, 8], "line": [0, 1, 2, 3, 4, 6, 7], "hover": [0, 1, 2, 3, 4, 5], "cursor": [0, 1, 2], "over": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9], "respons": [0, 1], "pop": 0, "encourag": [0, 1, 2, 3, 4, 5], "edit": 0, "try": [0, 1, 2, 3, 4, 5, 6, 8], "moreov": [0, 1, 4, 5, 8], "lot": [0, 1, 3, 5, 6, 7, 8], "challeng": [0, 1, 2, 3, 5, 9], "rush": 0, "past": [0, 1, 7], "just": [0, 1, 2, 3, 4, 5, 6, 7, 8], "through": [0, 1, 3, 4, 5, 6, 7, 8], "central": [0, 4], "all": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10], "when": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9], "feel": [0, 1, 2, 6, 8], "comfort": 0, "master": [0, 1, 4], "relev": [0, 1, 2, 4, 5, 6, 7, 8], "skill": [0, 1, 2, 3, 4], "free": [0, 1, 7, 8], "move": [0, 1, 2, 6, 8], "alwai": [0, 1, 2, 3, 5, 6, 7], "compar": [0, 5, 6, 8], "solut": [0, 1, 4, 6], "ones": [0, 1, 2, 3, 5, 10], "put": [0, 1, 2, 3, 4, 5, 6, 7, 8], "simpli": [0, 1, 2, 3, 4, 5, 6, 7, 8], "tool": [0, 1, 5, 6], "build": [0, 2, 4, 6, 7, 8, 12], "complex": [0, 1, 2, 4, 5, 7, 9, 10], "known": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9], "depend": [0, 2, 3, 4, 5, 6, 7, 8], "everi": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10], "check": [0, 1, 2, 3, 4, 5, 6, 7, 8], "print": [0, 3, 4, 5, 10], "\u2115": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10], "These": [0, 1, 3, 4, 5, 7, 9, 10], "object": [0, 1, 2, 3, 4, 5, 7, 12], "2": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10], "def": [0, 2, 3, 4, 5, 6, 7, 8], "f": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10], "x": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10], "3": [0, 1, 2, 3, 4, 5, 6, 7, 8], "prop": [0, 2, 3, 4, 5, 6, 7, 8, 10], "statement": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10], "fermatlasttheorem": 0, "y": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10], "z": [0, 1, 2, 5, 6, 7, 8, 9, 10], "n": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10], "0": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10], "where": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10], "itself": [0, 2, 3, 5, 6, 7, 8, 9], "Such": [0, 1, 2, 6], "proposit": [0, 2, 3, 4, 5], "easi": [0, 4, 5, 6, 7, 8], "rfl": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10], "hard": [0, 1, 3, 5, 6, 7], "sorri": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9], "manag": [0, 1, 4, 5, 8], "construct": [0, 2, 3, 4, 5, 6, 7, 8], "accept": [0, 1, 2, 8], "term": [0, 1, 2, 3, 4, 5, 7, 8], "done": [0, 2, 3, 4, 6, 7, 8], "someth": [0, 1, 2, 4, 6, 8], "veri": [0, 2, 4, 6, 7, 8, 10], "impress": 0, "cheat": [0, 1], "so": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10], "now": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10], "game": [0, 6], "left": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10], "rule": [0, 2, 4, 5, 6, 8], "complementari": 0, "companion": [0, 1], "prove": [0, 2, 3, 4, 5, 6, 7, 8, 9, 10, 12], "thorough": 0, "underli": [0, 1, 5, 6, 7], "logic": [0, 1, 3, 4, 5, 7, 12], "framework": 0, "core": [0, 4, 5], "syntax": [0, 1, 2, 4, 6], "peopl": [0, 1], "who": [0, 8], "prefer": [0, 1, 2, 3], "user": [0, 6], "manual": [0, 3, 4], "befor": [0, 1, 2, 3, 4, 5, 6, 7], "new": [0, 1, 2, 3, 4, 5, 6, 7, 8], "dishwash": 0, "person": 0, "hit": [0, 1], "button": 0, "figur": [0, 1, 2, 5], "out": [0, 1, 2, 3, 4, 5, 6, 7, 8], "activ": 0, "potscrubb": 0, "featur": [0, 2, 4, 7], "later": [0, 1, 2, 4, 5, 6, 7, 8], "sens": [0, 2, 3, 4, 5, 6, 7, 8, 9], "here": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10], "refer": [0, 1, 2, 4, 5, 6, 8, 9], "back": [0, 1, 2, 5, 6, 7, 8], "necessari": [0, 2, 4, 5, 7], "anoth": [0, 1, 2, 3, 4, 5, 6, 7, 8], "thing": [0, 1, 2, 3, 4, 5, 6, 8], "distinguish": [0, 5, 6, 7, 8, 9], "place": [0, 1, 2, 5, 8], "greater": [0, 1, 2, 3, 4, 8], "emphasi": [0, 6], "tactic": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9], "given": [0, 1, 2, 3, 4, 5, 6, 7, 8], "two": [0, 1, 2, 3, 4, 5, 6, 7, 8, 10], "wai": [0, 1, 2, 3, 4, 5, 6, 7, 8, 10], "down": [0, 3, 4, 6, 8], "themselv": [0, 4, 5], "suitabl": [0, 1, 2, 5, 8], "descript": [0, 1, 2, 4, 8], "thereof": 0, "For": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10], "repres": [0, 1, 2, 3, 4, 5, 6, 9], "fact": [0, 2, 3, 4, 5, 6, 7, 8, 9, 10, 12], "even": [0, 1, 2, 3, 4, 5, 6, 8, 9, 10], "m": [0, 1, 2, 4, 6, 7, 8, 9], "nat": [0, 1, 2, 3, 4, 5, 7, 8], "fun": [0, 2, 3, 4, 5, 6, 7, 8, 9, 10], "k": [0, 2, 4, 5, 7, 8, 9], "hk": [0, 9], "hmn": 0, "rw": [0, 2, 3, 4, 5, 6, 7, 8, 12], "mul_add": [0, 1, 4, 6], "l": [0, 1, 9, 10], "_": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10], "compress": [0, 1, 8], "singl": [0, 1, 2, 3, 4, 5, 6, 7, 9], "instead": [0, 1, 2, 3, 4, 5, 6, 7, 8], "style": [0, 1], "same": [0, 1, 2, 3, 4, 5, 6, 7, 8], "comment": [0, 4], "henc": [0, 2, 3, 4, 5, 6, 8, 9], "ignor": [0, 5, 7, 8], "sai": [0, 1, 2, 3, 4, 5, 6, 7, 8, 10], "natur": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9], "rintro": [0, 2, 3, 4, 7, 8], "need": [0, 1, 2, 3, 4, 5, 6, 7, 8], "twice": [0, 1, 8], "let": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10], "substitut": [0, 2], "obviou": [0, 4, 5, 6], "ring": [0, 1, 2, 3, 4, 5, 6, 12], "As": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10], "enter": [0, 1, 2, 3, 7, 8], "displai": [0, 1, 2, 6], "state": [0, 1, 2, 3, 4, 6, 7, 8, 9], "separ": [0, 1, 2, 4, 5], "tell": [0, 2, 3, 4, 5, 6, 7], "what": [0, 1, 2, 3, 4, 5, 6, 7, 8], "establish": [0, 1, 2, 3, 4, 5], "task": [0, 2, 4, 5, 6, 8], "remain": [0, 1, 2, 3, 5, 6, 8], "replai": 0, "step": [0, 1, 2, 3, 4, 5, 6], "sinc": [0, 1, 2, 3, 4, 5, 6, 7, 8], "continu": [0, 1, 4, 5, 6, 10], "first": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10], "introduc": [0, 1, 2, 3, 4, 8, 10], "could": [0, 1, 2, 4, 5, 6, 7, 8], "renam": 0, "decompos": [0, 3], "hypothesi": [0, 1, 2, 3, 4], "assumpt": [0, 1, 2, 3, 4, 5, 7, 8, 9, 10], "second": [0, 1, 2, 3, 4, 5, 6, 7, 8, 10], "declar": [0, 1, 4, 5, 6, 7], "next": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9], "rewrit": [0, 1, 2, 3, 4, 5, 6, 8], "replac": [0, 1, 2, 3, 4, 6, 7], "solv": [0, 1, 2, 3, 4, 5, 6, 8], "result": [0, 1, 2, 3, 4, 5, 6, 7, 8], "abil": 0, "small": [0, 2, 4, 5, 8], "increment": [0, 1], "extrem": [0, 6, 8], "power": [0, 1, 3, 4, 5, 6], "reason": [0, 1, 2, 4, 5, 6, 7, 8], "quicker": 0, "than": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9], "There": [0, 1, 2, 3, 4, 6, 7, 8, 9, 10], "isn": [0, 2, 3, 4, 6], "sharp": 0, "distinct": [0, 2, 3, 4, 5, 8], "between": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10], "insert": [0, 2, 4, 5, 7, 8, 9], "did": [0, 2, 6, 8], "phrase": [0, 1, 2, 4, 5], "convers": [0, 2, 4, 7, 8], "short": [0, 1, 2, 3, 4, 5], "middl": [0, 1, 2, 8], "That": [0, 4, 5, 6], "said": [0, 2, 4, 5], "reduc": [0, 2, 3, 4, 5], "liner": 0, "carri": [0, 1, 2, 3, 4, 5, 6, 7, 8, 10], "But": [0, 1, 2, 3, 4, 5, 6, 7, 8], "substanti": 0, "autom": [0, 1, 5], "justifi": [0, 1, 2, 8], "longer": [0, 4, 5], "calcul": [0, 2, 4, 5, 12], "bigger": [0, 3, 9], "inferenti": 0, "invok": [0, 1, 8], "simplifi": [0, 2, 3, 4, 5, 8, 10], "specif": [0, 1, 3, 4, 5, 6], "pariti": 0, "automat": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9], "intro": [0, 1, 2, 3, 4, 5, 6, 7, 8], "simp": [0, 2, 3, 4, 5, 6, 7, 8, 9], "parity_simp": 0, "big": [0, 5, 7, 8, 9], "differ": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9], "onli": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10], "its": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10], "built": [0, 2, 6, 7], "wherea": [0, 1, 2, 3, 5, 7, 8], "top": [0, 6, 7, 8, 9], "meant": [0, 2, 6], "complet": [0, 1, 2, 3, 4, 6, 7, 9], "extens": [0, 1, 6, 8, 9], "rather": [0, 1, 2, 4, 5, 6, 7, 8], "think": [0, 1, 2, 3, 4, 5, 6, 8, 9], "basic": [0, 2, 4, 5, 8, 10, 12], "entri": [0, 5, 7], "brows": [0, 1, 4, 7], "frustrat": [0, 6], "curv": 0, "steep": 0, "newcom": 0, "avail": [0, 1, 2, 4, 5, 6, 7], "round": [0, 1, 5], "clock": 0, "doubt": 0, "enough": [0, 1, 2, 3, 4, 6, 7, 8], "too": [0, 1, 3, 5, 6, 7, 8], "contribut": [0, 3], "develop": [0, 1, 4, 7, 10], "mission": 0, "choos": [0, 2, 3, 4, 5, 6, 7, 8], "dive": 0, "come": [0, 1, 2, 3, 4, 5, 6, 7, 8], "forewarn": 0, "fundament": [0, 4, 5, 6, 10], "life": [0, 2], "mai": [0, 1, 2, 3, 5, 6, 7, 8, 9], "never": [0, 6], "acknowledg": 0, "grate": [0, 5], "gabriel": 0, "ebner": 0, "set": [0, 1, 2, 4, 5, 6, 7, 9, 10, 12], "infrastructur": 0, "scott": 0, "morrison": 0, "mario": 0, "carneiro": 0, "help": [0, 1, 2, 3, 4, 5, 6, 8], "port": 0, "takeshi": 0, "ab": [0, 2, 5, 7], "julian": 0, "berman": 0, "alex": 0, "best": 0, "thoma": 0, "brown": 0, "bulwi": 0, "cha": 0, "hanson": 0, "char": 0, "bryan": 0, "gin": 0, "ge": [0, 2, 5], "chen": 0, "steven": 0, "clontz": 0, "mauricio": 0, "collari": 0, "johan": 0, "commelin": 0, "mark": [0, 1, 2, 6, 8], "czubin": 0, "alexandru": 0, "duca": 0, "pierpaolo": 0, "frasa": 0, "deni": 0, "gorbachev": 0, "winston": 0, "de": 0, "greef": 0, "marc": 0, "huisinga": 0, "mathieu": 0, "guai": 0, "paquet": 0, "k\u00fclshammer": 0, "victor": 0, "liu": 0, "jimmi": 0, "lu": 0, "martin": 0, "c": [0, 1, 2, 4, 5, 6, 7, 8, 9, 10], "giovanni": 0, "mascellani": 0, "john": 0, "mcdowel": 0, "isaiah": 0, "mindich": 0, "hunter": 0, "monro": 0, "pietro": 0, "monticon": 0, "oliv": 0, "nash": 0, "emanuel": 0, "natal": 0, "pim": 0, "ott": 0, "bartosz": 0, "piotrowski": 0, "nicola": 0, "rolland": 0, "keith": 0, "yannick": 0, "seurin": 0, "guilherm": 0, "silva": 0, "pedro": 0, "s\u00e1nchez": 0, "terraf": 0, "matthew": 0, "toohei": 0, "flori": 0, "van": 0, "doorn": 0, "eric": 0, "wieser": 0, "other": [0, 1, 2, 3, 4, 5, 6, 7, 8], "been": [0, 1, 2, 4, 5, 6, 9], "partial": [0, 1, 2, 3, 5, 6, 7], "hoskinson": 0, "center": [0, 8], "nut": 1, "bolt": 1, "gener": [1, 2, 3, 4, 5, 6, 7, 8, 9, 10], "without": [1, 2, 4, 5, 6, 7, 8, 9], "u": [1, 2, 3, 4, 5, 6, 7, 8, 9, 10], "net": 1, "hand": [1, 2, 3, 4, 5, 6, 8], "equal": [1, 2, 3, 4, 5, 6, 7, 8, 10], "right": [1, 2, 3, 4, 5, 6, 8, 9], "tantamount": [1, 3], "name": [1, 2, 3, 4, 5, 6, 7, 8, 9], "b": [1, 2, 3, 4, 5, 6, 7, 8, 9, 10], "real": [1, 2, 3, 4, 5, 6, 8, 9, 10], "mul_assoc": [1, 2, 4, 5, 6, 7], "mul_comm": [1, 2, 4, 5, 6, 7], "elimin": 1, "explicitli": [1, 2, 3, 5, 6, 7, 8, 9], "purpos": [1, 2, 3, 4, 5, 6, 8], "illustr": [1, 2, 3, 4, 5, 7], "multipl": [1, 2, 3, 4, 5, 6, 7, 9], "written": [1, 2, 3, 4, 5, 6, 7, 8, 9], "howev": [1, 2, 5, 6, 7, 8, 9], "good": [1, 2, 3, 4, 5, 6, 7, 8], "mind": [1, 2, 5, 6, 7], "notat": [1, 2, 3, 4, 5, 6, 7, 8, 9, 10], "convent": [1, 5, 7, 10], "parenthes": [1, 2, 3, 4], "\u211d": [1, 2, 3, 5, 6, 7, 8, 9, 10], "import": [1, 2, 3, 4, 5, 6, 7, 8, 10], "begin": [1, 2, 3, 4, 5, 6], "sake": [1, 4], "breviti": [1, 5], "suppress": 1, "happen": [1, 6, 8], "charact": [1, 3, 6], "r": [1, 2, 4, 5, 6, 7, 8], "symbol": [1, 2, 5, 6, 7], "doesn": [1, 2, 7, 8], "until": [1, 4, 6, 8], "space": [1, 2, 3, 5, 6, 7, 10, 12], "tab": [1, 3, 4], "kei": [1, 4, 5, 7, 8], "curiou": [1, 6], "abbrevi": [1, 2, 3, 5], "get": [1, 2, 3, 4, 6, 7, 8, 9, 12], "access": [1, 3, 5, 6, 7, 8, 10], "keyboard": 1, "easili": [1, 4, 5, 6, 7], "backslash": [1, 3], "lead": [1, 2, 4, 5, 6, 7, 8], "lean4": 1, "input": [1, 3, 8], "leader": 1, "report": 1, "current": [1, 2, 5, 6], "infoview": [1, 6], "A": [1, 2, 3, 4, 5, 6, 7, 8, 9], "typic": [1, 7], "might": [1, 2, 3, 4, 5, 7], "look": [1, 2, 3, 4, 6, 7, 8], "1": [1, 2, 3, 4, 5, 6, 7, 8, 9, 10], "h\u2081": [1, 2, 3, 4], "prime": [1, 2, 3, 5, 6, 7, 12], "h\u2082": [1, 3, 4], "h\u2083": [1, 3], "denot": [1, 3, 4, 6, 7, 8], "context": [1, 2, 4, 5, 6, 7, 8, 9, 10], "plai": [1, 3, 4, 6, 7, 8], "three": [1, 2, 4, 5, 7, 8], "label": [1, 2], "everyth": [1, 2, 6, 8], "identifi": [1, 2, 4], "subscript": 1, "h": [1, 2, 3, 4, 5, 6, 7, 8, 9, 10], "legal": 1, "would": [1, 2, 3, 4, 5, 6, 7, 8, 9], "h1": [1, 2, 3, 4, 5], "h2": [1, 2, 3, 5], "h3": 1, "foo": [1, 5], "baz": 1, "last": [1, 2, 3, 4, 5, 6, 7, 8], "sometim": [1, 2, 3, 4, 5, 6, 7, 8], "target": [1, 6, 7, 8, 10], "combin": [1, 2, 5, 6, 7, 8], "practic": [1, 2, 3, 6, 7, 8], "mean": [1, 2, 3, 4, 5, 6, 7, 8, 9, 10], "usual": [1, 2, 3, 4, 5, 7, 8, 10], "clear": [1, 2, 4, 5, 6], "case": [1, 2, 3, 4, 5, 6, 7, 8, 10], "With": [1, 3, 4, 6, 8], "arrow": [1, 2, 6, 8], "revers": [1, 2, 3, 5, 8], "note": [1, 2, 4, 5, 6, 7, 8, 10], "noth": [1, 2, 3, 4, 5, 6, 7], "argument": [1, 2, 3, 4, 5, 6, 7, 8], "tri": [1, 2, 4, 6], "match": [1, 2, 5], "pattern": [1, 2, 3, 5, 6], "local": [1, 2, 6, 8, 9], "d": [1, 2, 4, 5, 7, 9], "e": [1, 2, 3, 4, 5, 6, 7, 8, 9, 10], "sub_self": [1, 2], "hyp": 1, "list": [1, 2, 3, 4, 5], "comma": 1, "squar": [1, 2, 4, 5, 6, 7], "bracket": [1, 2, 5, 6, 7], "after": [1, 2, 4, 6, 8, 9], "trick": [1, 2, 4, 6, 9], "variabl": [1, 2, 3, 4, 5, 6, 7, 8, 9, 10], "onc": [1, 2, 3, 4, 5, 6, 7, 8, 10], "outsid": [1, 4], "inspect": 1, "reveal": 1, "inde": [1, 5, 6, 7, 8, 9], "delimit": 1, "scope": [1, 2, 3, 5, 7], "end": [1, 2, 3, 4, 5, 6, 7, 8, 9], "block": [1, 4, 7], "final": [1, 2, 3, 5, 7, 8, 10], "recal": [1, 2, 4, 5, 7, 8, 10], "introduct": [1, 2, 7, 8, 12], "determin": [1, 5, 7, 8], "both": [1, 2, 3, 4, 5, 6, 7, 8, 9], "expect": [1, 2, 3, 4, 5, 6, 7, 8], "rais": [1, 4], "error": [1, 2, 3, 6], "explain": [1, 2, 3, 4, 5, 6, 7, 8, 10], "output": [1, 7], "meanwhil": [1, 4], "take": [1, 2, 3, 4, 5, 6, 7, 8, 9, 10], "two_mul": 1, "add_mul": [1, 6], "distribut": [1, 4, 5, 6], "addit": [1, 2, 4, 5, 6, 7, 8, 9, 10], "add_assoc": [1, 4, 5, 6], "precis": [1, 3, 7, 8, 9], "possibl": [1, 2, 3, 4, 5, 7, 8], "calc": [1, 2, 3, 5, 7, 8], "keyword": [1, 2, 4, 5], "notic": [1, 2, 3, 4, 5, 7, 8], "finicki": 1, "underscor": [1, 2, 3], "justif": [1, 2], "format": 1, "indic": [1, 2, 3, 5, 6], "indent": 1, "One": [1, 2, 3, 4, 5, 6, 7, 8], "outlin": [1, 2, 4, 8], "modulo": [1, 4, 5], "individu": 1, "pure": [1, 8], "littl": [1, 2, 8, 9], "underneath": [1, 3], "pow_two": [1, 4], "mul_sub": 1, "add_sub": 1, "sub_sub": 1, "add_zero": [1, 5, 6], "perform": [1, 2, 3], "exact": [1, 2, 3, 4, 5, 7, 8], "becaus": [1, 2, 3, 4, 5, 6, 7, 8, 9], "exactli": [1, 2, 3, 5, 6, 7, 8], "close": [1, 2, 3, 6, 7, 9, 10], "bit": [1, 2, 4, 6, 7, 8], "commut": [1, 2, 3, 4, 5, 6, 7, 9], "long": [1, 2, 3, 5, 6, 7, 9], "axiom": [1, 2, 3, 5, 6, 7, 8, 10], "indirectli": 1, "data": [1, 2, 4, 5, 6, 8], "similar": [1, 2, 3, 5, 6, 7, 8], "common": [1, 2, 3, 4, 5, 7, 8], "variat": [1, 3, 4, 5, 8, 9], "nth_rw": 1, "allow": [1, 2, 3, 4, 5, 6, 7, 8, 9, 10], "particular": [1, 2, 5, 6, 7, 8], "instanc": [1, 2, 3, 4, 5, 6, 7, 8, 9], "enumer": [1, 2], "start": [1, 2, 3, 4, 6, 7, 8, 9, 10, 12], "occurr": 1, "consist": [1, 3, 5, 6, 7, 8, 9], "collect": [1, 2, 3, 5, 8, 10], "oper": [1, 2, 3, 4, 5, 6, 7, 8, 9], "time": [1, 4, 5, 6, 8, 9, 10], "constant": [1, 2, 7, 10], "mapsto": [1, 5], "abelian": [1, 5, 6], "negat": [1, 5, 12], "invers": [1, 3, 5, 6, 7, 9, 10], "add_comm": [1, 4, 5, 6, 7], "zero_add": [1, 4, 5, 6], "add_left_neg": [1, 5], "mul_on": [1, 5, 6, 7], "one_mul": [1, 2, 5, 6], "being": [1, 3, 5, 7, 8, 9], "suffic": [1, 2, 3, 7, 8], "give": [1, 2, 3, 4, 6, 7, 8, 10], "element": [1, 2, 3, 4, 5, 6, 7, 8, 9, 10], "concret": [1, 2, 4, 5, 6, 8], "integ": [1, 2, 4, 6, 7, 12], "abstract": [1, 2, 5, 6, 7, 8], "character": [1, 3, 4, 8, 9], "axiomat": [1, 2, 3, 5], "train": [1, 6], "recogn": [1, 2, 4, 5, 6, 8], "appropri": [1, 2, 3, 5, 6], "\u2124": [1, 4, 5, 6, 7], "ration": [1, 2, 4, 8], "\u211a": [1, 4, 7, 8], "\u2102": [1, 5, 7, 9], "extend": [1, 3, 4, 5, 6, 8, 10], "order": [1, 2, 3, 4, 5, 6, 8, 9], "Not": [1, 5, 8], "properti": [1, 2, 3, 4, 5, 6, 7, 8, 9, 10], "hold": [1, 2, 3, 4, 5, 7, 8, 10], "arbitrari": [1, 2, 3, 4, 5, 7], "taken": [1, 2], "cours": [1, 2, 4, 6, 7, 8, 9, 10], "linear": [1, 2, 5, 7, 8], "matric": [1, 5, 7], "fail": [1, 2, 4, 5, 6, 8, 10], "commr": [1, 2, 5, 7], "unchang": [1, 2], "linarith": [1, 2, 4, 5], "permiss": 1, "strike": [1, 2], "balanc": 1, "concis": [1, 5, 7], "readabl": [1, 2, 3, 8], "strengthen": [1, 2, 4], "deriv": [1, 2, 4, 7, 9, 10], "most": [1, 2, 3, 4, 5, 6, 7, 8, 10], "organiz": 1, "mechan": [1, 2, 5], "namespac": [1, 2, 3, 4, 5, 7, 8], "full": [1, 2, 3, 4, 5, 6, 7, 8], "shorter": [1, 3, 4, 7, 8], "avoid": [1, 2, 3, 4, 5, 6, 7, 9], "due": [1, 6], "clash": 1, "myre": 1, "add_right_neg": 1, "effect": [1, 3, 6, 8], "temporarili": [1, 2], "reprov": [1, 7], "care": [1, 2, 3, 5], "earlier": [1, 7], "pai": [1, 2, 6, 7, 8], "attent": [1, 2, 4, 6, 7, 8], "curli": [1, 2], "implicit": [1, 2, 5, 6, 7, 8, 9], "moment": [1, 2, 5], "worri": [1, 3, 4, 5, 7], "neg_add_cancel_left": 1, "add_neg_cancel_right": 1, "add_left_cancel": 1, "add_right_cancel": 1, "plan": [1, 6, 8], "brace": 1, "imagin": 1, "situat": [1, 3, 6, 7, 8], "draw": [1, 5, 6], "conclus": [1, 2, 4], "hypothes": [1, 2, 3, 4, 5], "redund": [1, 5, 8, 10], "few": [1, 2, 3, 4, 8], "extra": [1, 2, 3, 5, 6, 7, 8], "oner": 1, "complic": [1, 2, 6, 7], "tediou": [1, 2, 6], "suppos": [1, 2, 3, 4, 5, 8], "infer": [1, 2, 3, 5, 6, 7], "mul_zero": [1, 5, 6], "serv": [1, 3, 4, 5, 10], "therefor": [1, 4, 5, 8], "promot": 1, "modular": 1, "subproof": 1, "wa": [1, 3, 7], "except": [1, 2, 5, 7], "ad": [1, 2, 3, 4, 5, 6, 8], "variant": [1, 2, 7, 8], "whose": [1, 2, 4, 5, 6, 7, 8, 9], "necessarili": [1, 10], "miss": [1, 3, 4], "piec": [1, 4, 5, 6, 7, 8], "either": [1, 2, 3, 5, 6, 8], "becom": [1, 4, 5, 6, 8], "technic": [1, 5, 6], "strictli": [1, 2, 9], "less": [1, 2, 3, 4, 5, 6, 7, 8], "script": 1, "slightli": [1, 6, 7, 8, 9], "clearer": [1, 3, 5], "human": 1, "reader": [1, 8], "maintain": 1, "evolv": 1, "rememb": [1, 2, 3, 4, 5, 6, 7, 8], "zero_mul": [1, 4, 5, 6], "By": [1, 3, 5, 6, 7], "neg_eq_of_add_eq_zero": 1, "eq_neg_of_add_eq_zero": 1, "neg_zero": 1, "neg_neg": 1, "had": [1, 6], "annot": [1, 2, 3, 4, 5, 6], "third": [1, 2, 3, 5, 8], "specifi": [1, 2, 3, 4, 5, 8, 9, 10], "imposs": 1, "default": [1, 2, 3, 4, 5, 6, 7, 9], "subtract": [1, 4, 5], "provabl": [1, 3, 6, 8], "sub_eq_add_neg": 1, "On": [1, 2, 3, 5, 6, 8, 10], "defin": [1, 2, 3, 4, 6, 7, 8, 9, 10, 12], "reflex": [1, 2, 5], "present": [1, 2, 4, 7, 8], "forc": [1, 2, 3, 7], "unfold": [1, 2, 3, 4, 5, 8], "deal": [1, 2, 3, 4, 5, 8], "equat": [1, 2, 3, 4, 5], "interchang": 1, "self_sub": 1, "effort": [1, 4], "one_add_one_eq_two": 1, "norm_num": [1, 2, 4, 5], "strength": 1, "weaker": [1, 2], "notion": [1, 2, 3, 4, 5, 7, 8, 9, 10], "addgroup": [1, 5, 7], "otherwis": [1, 2, 3, 4, 5, 7], "addcommgroup": [1, 7], "commgroup": 1, "g": [1, 2, 3, 5, 6, 7, 8, 9, 10], "mul_left_inv": [1, 5], "\u00b9": [1, 3, 5, 6, 7, 8], "cocki": 1, "helper": 1, "along": [1, 4, 7, 8], "mul_right_inv": [1, 5], "mul_inv_rev": 1, "non": [1, 3, 6, 7, 8, 10], "abel": [1, 7], "noncomm_r": 1, "seem": [1, 2, 4, 6, 8, 9], "odd": [1, 2, 3, 4], "partli": [1, 6, 7], "histor": [1, 7], "conveni": [1, 2, 3, 5, 6, 7, 8], "great": [1, 5], "sort": [1, 3, 4], "inequ": [1, 2, 6, 8], "le": [1, 5, 6], "whenev": [1, 2, 4, 5], "consid": [1, 2, 3, 4, 5, 6, 7, 8, 9, 10], "le_refl": [1, 2], "le_tran": [1, 2], "detail": [1, 2, 3, 4, 5, 6, 7], "unless": [1, 2, 5], "realli": [1, 2, 3, 4, 6, 7, 8], "insist": [1, 6], "discuss": [1, 2, 4, 5, 6, 7, 8, 9], "implic": [1, 8, 12], "h\u2080": [1, 2, 3, 4, 8], "dot": [1, 7, 8], "option": [1, 2, 4, 5, 6, 8], "within": [1, 2, 8], "visibl": 1, "must": [1, 5, 6, 8], "decreas": [1, 5], "fourth": [1, 2], "mode": [1, 2, 5], "entir": [1, 3, 5, 8, 9], "lt_of_le_of_lt": [1, 2], "lt_of_lt_of_l": 1, "lt_tran": [1, 2], "togeth": [1, 2, 3, 4, 5, 7, 8], "handl": [1, 3, 4, 6, 7], "arithmet": 1, "5": [1, 2, 5, 7, 8, 9], "pass": [1, 5], "exp_le_exp": 1, "mpr": [1, 2, 5, 8], "exp": [1, 3], "applic": [1, 2, 5, 7, 10], "function": [1, 2, 4, 5, 6, 7, 9, 10, 12], "compound": [1, 2, 8], "pars": [1, 3, 7], "exp_lt_exp": 1, "log_le_log": 1, "log": [1, 3, 10], "log_lt_log": 1, "add_le_add": [1, 2], "add_le_add_left": 1, "add_le_add_right": 1, "add_lt_add_of_le_of_lt": 1, "add_lt_add_of_lt_of_l": 1, "add_lt_add_left": 1, "add_lt_add_right": 1, "add_nonneg": [1, 5], "add_po": 1, "add_pos_of_pos_of_nonneg": 1, "exp_po": [1, 3], "bi": [1, 2, 5], "lr": 1, "iff": [1, 3, 7, 8, 9, 10, 12], "connect": [1, 3, 5, 8], "equival": [1, 2, 3, 4, 5, 7, 8, 9, 10], "mp": [1, 2, 3, 4, 8], "forward": [1, 2, 5, 7, 8], "direct": [1, 2, 3, 6, 7, 8, 9], "stand": [1, 2, 4, 5, 6, 7, 8, 9], "modu": 1, "ponen": 1, "respect": [1, 2, 3, 4, 5, 7, 8], "thu": [1, 3, 4, 5, 8], "again": [1, 2, 3, 4, 5, 6, 7, 8], "numer": [1, 4, 5], "constitut": 1, "part": [1, 2, 3, 4, 5, 6, 8, 10], "strategi": [1, 2, 4], "api": 1, "reli": [1, 2, 5, 8], "guess": [1, 2, 3, 4, 5], "cmd": [1, 2], "mac": [1, 2], "a_of_b_of_c": 1, "approxim": 1, "loud": 1, "probabl": [1, 5, 6, 8], "add_l": 1, "choic": [1, 2, 3, 5, 8], "exist": [1, 2, 3, 6, 7, 8], "jump": [1, 4, 5, 8], "nearbi": [1, 4], "sq_nonneg": 1, "delet": [1, 2, 3], "uncom": 1, "previou": [1, 2, 3, 5, 6, 7, 8, 9, 10], "confirm": [1, 2, 3, 4], "finish": [1, 2, 3, 4, 7], "job": 1, "pow_two_nonneg": [1, 2], "tend": [1, 8], "around": [1, 3, 6, 7, 8, 10], "binari": [1, 2, 4, 5, 6], "increas": 1, "worth": [1, 2, 5], "definition": [1, 4, 5, 6, 8], "principl": [1, 2, 3, 4, 6, 9], "favor": [1, 5], "timesav": 1, "clever": 1, "involv": [1, 2, 4, 5, 6, 7, 8], "nice": [1, 2, 4, 6, 7, 8], "idea": [1, 2, 3, 5, 6, 8], "abs_l": [1, 5], "constructor": [1, 2, 3, 4, 5, 6], "split": [1, 2, 3, 4], "conjunct": [1, 6, 12], "congratul": [1, 2, 4], "min": [1, 2, 8, 10], "uniqu": [1, 2, 3, 4, 5, 7, 8], "min_le_left": 1, "min_le_right": 1, "le_min": 1, "max": [1, 2, 6, 8, 10], "pair": [1, 2, 4, 5, 7, 8], "act": [1, 7], "curri": 1, "logician": 1, "haskel": 1, "bind": [1, 3], "tighter": [1, 3], "infix": [1, 6], "le_antisymm": [1, 2], "usag": 1, "inconsist": 1, "outer": 1, "level": [1, 2, 6], "nest": [1, 2], "bother": [1, 3], "repetit": [1, 6], "foreshadow": 1, "univers": [1, 3, 5, 7, 8, 12], "quantifi": [1, 3, 4, 5, 7, 8, 12], "desir": [1, 3, 6, 7, 8], "implicitli": [1, 2], "repeat": [1, 4, 5, 6], "mani": [1, 2, 3, 5, 6, 7, 8, 9, 10, 12], "shorten": [1, 2, 7], "Of": [1, 2, 4, 6, 7, 8, 9, 10], "interest": [1, 2, 3, 5, 6, 8], "vice": [1, 3], "versa": [1, 3], "word": [1, 2, 3, 4, 5, 7, 8], "switch": [1, 6], "transit": [1, 2, 5, 8], "total": 1, "satisfi": [1, 3, 4, 5, 6, 8, 9], "disjunct": [1, 3, 12], "stick": [1, 2, 8, 9], "aux": [1, 2, 4, 8], "valu": [1, 2, 3, 4, 5, 6, 7, 8, 9, 10], "yield": [1, 2, 3, 4, 5, 8], "made": [1, 2, 3, 5, 8], "manifest": [1, 8], "triangl": [1, 2, 5], "abs_add": [1, 2], "add_sub_cancel_right": 1, "sub_add_cancel": 1, "relat": [1, 2, 3, 5, 6, 7, 8, 9, 10], "divis": [1, 2, 4, 5, 6], "Be": [1, 3], "ordinari": [1, 2, 4, 5, 7, 8], "unicod": [1, 3, 6], "obtain": [1, 2, 4, 5, 8, 9], "dvd": 1, "dvd_tran": 1, "dvd_mul_of_dvd_left": 1, "dvd_mul_left": 1, "expon": 1, "expand": [1, 2, 3, 4, 5, 6], "w": [1, 6], "greatest": [1, 5, 8], "divisor": [1, 2, 4, 5, 7], "gcd": [1, 2, 4], "least": [1, 5, 6, 8], "lcm": 1, "analog": [1, 2, 3, 4, 8], "divid": [1, 2, 4, 5, 7], "gcd_zero_right": 1, "gcd_zero_left": 1, "lcm_zero_right": 1, "lcm_zero_left": 1, "dvd_antisymm": 1, "complain": 1, "ambigu": [1, 5], "_root_": [1, 3, 4], "saw": [1, 5, 6, 7, 8], "govern": [1, 5], "class": [1, 4, 5, 6, 7, 8, 9, 10], "antisymmetr": [1, 2], "\u03b1": [1, 2, 3, 4, 5, 6, 7, 8, 9, 10], "partialord": [1, 2], "adopt": 1, "letter": [1, 5, 9], "\u03b2": [1, 2, 3, 5, 6, 8, 10], "\u03b3": [1, 2, 5, 8], "carrier": [1, 5, 6, 7], "greek": [1, 4], "especi": [1, 2, 5, 6, 7, 8], "strict": [1, 2], "somewhat": [1, 3, 8], "lt_irrefl": [1, 2], "lt_iff_le_and_n": 1, "lattic": [1, 5, 6, 7, 8], "inf_le_left": [1, 8], "inf_le_right": 1, "le_inf": 1, "le_sup_left": 1, "le_sup_right": 1, "sup_l": 1, "lower": [1, 2, 4], "bound": [1, 2, 3, 4, 5, 8, 9, 10], "upper": [1, 2], "glb": 1, "lub": 1, "infimum": [1, 6, 7, 8, 10], "supremum": [1, 4, 6, 7], "inf": [1, 6, 8], "sup": [1, 4, 8], "further": [1, 8], "matter": [1, 2], "meet": [1, 2, 3, 5], "keep": [1, 5, 6, 7], "dictionari": 1, "subset": [1, 2, 3, 5, 8, 9], "domain": [1, 2, 3, 4, 5, 7, 8], "boolean": 1, "truth": [1, 4], "fals": [1, 2, 3, 4, 6], "true": [1, 2, 3, 6, 8], "posit": [1, 3, 4, 5, 8, 10], "subspac": [1, 6], "vector": [1, 3, 6, 7, 9], "intersect": [1, 3, 5, 6, 7, 8, 10], "sum": [1, 2, 4, 5, 6, 7, 8], "inclus": [1, 3, 7, 8], "topologi": [1, 5, 6, 9, 12], "union": [1, 3, 4, 5, 6, 7, 9, 10], "intermedi": [1, 6, 8], "produc": [1, 2, 7, 9], "auto": [1, 6], "mysteri": [1, 5, 6], "unapp": 1, "tran": [1, 2, 4, 5, 6, 7], "issu": [1, 4, 5, 6, 8], "directli": [1, 2, 4, 5, 6, 8], "inf_comm": [1, 7], "inf_assoc": 1, "sup_comm": 1, "sup_assoc": 1, "absorpt": 1, "law": [1, 7], "absorb1": 1, "absorb2": 1, "found": [1, 5, 7, 9], "inf_sup_self": 1, "sup_inf_self": 1, "distriblattic": 1, "inf_sup_left": 1, "inf_sup_right": 1, "sup_inf_left": 1, "sup_inf_right": 1, "shown": [1, 5, 9, 10], "explicit": [1, 2, 5, 6, 8], "nondistribut": 1, "finit": [1, 3, 4, 5, 7, 8, 9, 10], "impli": [1, 2, 3, 4, 5, 8], "larger": [1, 8], "compat": [1, 7, 8], "strictorderedr": 1, "mul_po": [1, 4], "mul_nonneg": 1, "coupl": [1, 2, 6, 8], "metric": [1, 5, 9, 12], "equip": [1, 3, 5, 6, 7, 8, 9, 10], "distanc": [1, 2, 8, 9], "dist": [1, 8], "map": [1, 2, 3, 5, 6, 7, 8], "metricspac": [1, 8, 9], "dist_self": 1, "dist_comm": [1, 8], "dist_triangl": [1, 8], "nonneg": [1, 5], "nonneg_of_mul_nonneg_left": 1, "dist_nonneg": [1, 8], "dealt": 2, "simpl": [2, 4, 5, 6, 9], "absolut": 2, "\u03b5": [2, 8, 9], "though": [2, 3, 4, 5], "treat": [2, 3, 5, 6, 7, 8, 9], "appli": [2, 3, 4, 5, 6, 7, 8, 9, 10, 12], "my_lemma": 2, "\u03b4": [2, 8], "hb": [2, 8], "subsequ": [2, 4, 8], "lemma": [2, 4, 5, 6, 7, 8, 9, 10, 12], "mention": [2, 3, 5, 6, 7, 8], "my_lemma2": 2, "stage": [2, 5, 6], "my_lemma3": 2, "epo": 2, "ele1": 2, "xlt": 2, "ylt": 2, "essenti": [2, 3, 5, 7, 8], "colon": 2, "off": [2, 3, 4], "my_lemma4": 2, "abs_mul": 2, "mul_le_mul": 2, "abs_nonneg": 2, "mul_lt_mul_right": 2, "extract": [2, 8], "hidden": 2, "expos": [2, 8], "predic": [2, 3, 4, 6, 7, 8, 9], "fnub": 2, "fnlb": 2, "lambda": [2, 5], "hfa": 2, "hgb": 2, "dsimp": [2, 3, 5, 7], "simplif": [2, 3, 4], "contract": 2, "anyhow": 2, "control": 2, "transform": [2, 3], "rest": [2, 3, 5, 7, 8], "routin": 2, "nnf": 2, "nng": 2, "nna": 2, "codomain": [2, 4, 8], "structur": [2, 4, 6, 7, 8, 9, 10, 12], "monoid": [2, 3, 4, 6, 12], "fnub_add": 2, "orderedcanceladdcommmonoid": 2, "high": [2, 7], "monoton": [2, 6, 8], "nondecreas": [2, 4], "placehold": 2, "Or": [2, 3], "backward": [2, 8], "subgoal": 2, "mf": 2, "mg": 2, "aleb": 2, "flag": [2, 3], "squiggli": 2, "marker": 2, "nnc": 2, "bbb": [2, 5], "fneven": 2, "fnodd": 2, "ef": 2, "eg": 2, "og": 2, "rid": 2, "won": [2, 4, 6, 7, 8], "cannot": [2, 3, 4, 5, 6, 7, 8], "contrari": 2, "syntact": 2, "reduct": [2, 3, 5], "erw": 2, "harder": [2, 5], "spot": 2, "manipul": [2, 5, 7, 8], "foundat": [2, 3, 4, 5, 7], "mundan": 2, "assert": [2, 3, 6, 7], "contrast": [2, 3, 5, 6, 8], "zermelo": 2, "fraenkel": 2, "sin": [2, 9], "co": [2, 7], "zf": 2, "defect": [2, 6, 8], "theoret": [2, 3, 8], "motiv": 2, "detect": 2, "meaningless": 2, "independ": [2, 3, 5], "continuum": 2, "meta": [2, 6], "beyond": [2, 6, 9], "ask": [2, 4, 5, 6, 7, 8], "refl": [2, 3, 5, 6, 7], "setub": 2, "inject": [2, 3, 4, 6, 7, 8], "x_1": [2, 3], "x_2": [2, 3], "x\u2081": [2, 3, 5, 8], "x\u2082": [2, 3, 5], "add": [2, 4, 5, 6, 7, 8, 9], "nonzero": [2, 4, 5, 10], "sourc": [2, 8], "inspir": 2, "add_left_inj": 2, "composit": [2, 3, 5, 6, 7, 8], "injg": 2, "injf": [2, 3], "canon": [2, 3, 4, 5], "exhibit": [2, 8], "anonym": [2, 3, 4, 5, 7], "angl": 2, "certain": [2, 6, 8], "fnhasub": 2, "fnhaslb": 2, "ubf": 2, "ubg": 2, "rcase": [2, 3, 4, 8], "ubfa": 2, "ubgb": 2, "unpack": [2, 3], "main": [2, 6, 8, 9], "els": [2, 3, 4], "turn": [2, 3, 4, 5, 6, 8, 9], "fn_ub_add": 2, "lbf": 2, "lbg": 2, "recurs": [2, 3, 5, 12], "arbitrarili": [2, 8], "assign": [2, 3, 5, 6, 7], "compon": [2, 3, 5, 8, 10], "destruct": 2, "tag": [2, 3, 6], "chosen": [2, 5], "intern": [2, 5, 7], "primit": [2, 3], "scientist": 2, "sight": [2, 6], "hurt": 2, "chanc": 2, "yourself": [2, 5], "compani": 2, "old": [2, 5, 6], "chestnut": 2, "product": [2, 4, 5, 6, 7, 8, 10], "magic": [2, 5, 6], "verifi": 2, "sumofsquar": 2, "sumofsquares_mul": 2, "sosx": 2, "sosi": 2, "xeq": [2, 3], "yeq": 2, "insight": 2, "gaussian": [2, 7, 12], "sqrt": [2, 3, 4, 5], "norm": [2, 5, 8, 12], "reflect": 2, "di": [2, 5], "xy": [2, 5], "cryptic": 2, "easiest": [2, 4], "perspicu": 2, "6": [2, 4, 5, 6, 7, 8, 9], "divab": 2, "divbc": 2, "beq": 2, "ceq": 2, "And": [2, 4, 6, 8], "pretti": [2, 6, 7, 8], "Then": [2, 3, 5, 6, 7, 8, 10], "divac": 2, "alpha": [2, 3], "beta": [2, 3], "surject": [2, 3, 7, 8], "mul_div_cancel\u2080": 2, "field_simp": [2, 5], "denomin": [2, 4, 5], "hx": [2, 3, 5, 6, 7, 9], "surjg": 2, "surjf": [2, 3], "contradict": [2, 3, 4], "speak": [2, 5, 7, 8], "irreflex": 2, "asymmetri": 2, "lt_asymm": 2, "eventu": [2, 3, 8], "fnuba": 2, "not_le_of_gt": 2, "not_lt_of_g": [2, 4, 5], "lt_of_not_g": 2, "le_of_not_gt": 2, "snippet": [2, 4, 5, 7], "counterexampl": [2, 9], "monof": 2, "four": [2, 5], "valid": 2, "far": [2, 3, 6, 8], "q": [2, 4, 5, 6, 7, 8], "straightforward": [2, 6], "difficult": [2, 6], "conclud": [2, 9], "nonexist": 2, "contradictori": 2, "classic": [2, 3, 4, 7], "by_contra": [2, 4], "not_not": 2, "front": 2, "push": [2, 4, 7, 8], "inward": 2, "facilit": [2, 8], "push_neg": [2, 3, 4], "restat": [2, 6, 7], "contrapos": [2, 3, 4], "similarli": [2, 3, 4, 5, 7], "yet": [2, 3, 4, 5, 6, 8], "semicolon": [2, 4], "falso": 2, "anyth": [2, 5, 8], "elim": 2, "strang": [2, 4, 7], "fairli": 2, "reach": [2, 6], "37": 2, "exfalso": 2, "absurd": [2, 4], "slick": 2, "drop": 2, "manner": [2, 5], "analogi": [2, 5, 8, 9], "techniqu": [2, 8], "variou": [2, 3, 5, 6, 10], "xltz": 2, "zlty": 2, "10": [2, 9], "7": [2, 4, 5, 7], "behav": [2, 3, 6, 8], "roughli": [2, 3, 4], "friend": [2, 5], "were": [2, 4, 5, 8], "inscrut": [2, 3], "gadget": [2, 8], "auxiliari": [2, 8], "pow_eq_zero": [2, 4], "doubl": [2, 3], "symmetr": [2, 3, 7], "abs_lt": 2, "dvd_gcd_iff": 2, "8": [2, 4, 7, 8], "15": 2, "not_monotone_iff": 2, "aris": 2, "preorder": [2, 6, 8], "pre": 2, "lt_iff_le_not_l": 2, "repeatedli": [2, 8], "instanti": [2, 5, 6, 8], "inl": [2, 3], "inr": [2, 3], "branch": [2, 3, 6], "le_or_gt": 2, "abs_of_nonneg": [2, 5], "abs_of_neg": 2, "against": 2, "immedi": [2, 3, 5, 6], "attract": 2, "closer": [2, 8], "advantag": [2, 3, 4, 5, 7, 9], "myab": 2, "le_abs_self": 2, "neg_le_abs_self": 2, "enjoi": [2, 3, 4, 8], "pun": 2, "lt_ab": 2, "genuin": 2, "vertic": [2, 5], "lt_trichotomi": 2, "xgt": 2, "dvd_mul_right": [2, 4], "eq_zero_or_eq_zero_of_mul_eq_zero": 2, "zero": [2, 3, 4, 5, 6, 7, 8, 9, 10], "nontrivi": [2, 3, 4, 5, 8, 9], "integr": [2, 9, 12], "isdomain": [2, 7], "whether": [2, 3, 4, 6, 8], "em": [2, 3], "exclud": [2, 4], "by_cas": [2, 3, 4], "dispos": 2, "s_0": [2, 3], "s_1": 2, "s_2": 2, "ldot": [2, 3, 4], "varepsilon": [2, 8], "s_n": [2, 3], "render": [2, 4], "convergesto": 2, "ext": [2, 3, 4, 5, 6, 7], "enabl": [2, 3, 4, 5], "actual": [2, 3, 4, 6, 7, 8], "congr": 2, "reconcil": 2, "peel": 2, "convert": [2, 4, 7], "quit": [2, 6, 8], "zero_lt_on": [2, 4], "fill": [2, 3, 4, 5], "convergesto_const": 2, "\u03b5po": [2, 8], "nge": 2, "abs_zero": 2, "save": 2, "troubl": [2, 3, 5], "pen": [2, 7], "paper": [2, 3, 5, 7, 8, 10], "nt": 2, "maximum": [2, 4, 8], "implement": [2, 5, 6, 7, 9], "convergesto_add": 2, "ct": 2, "clean": [2, 8], "\u03b52po": 2, "ht": 2, "le_of_max_le_left": 2, "le_of_max_le_right": 2, "tricki": [2, 3, 4, 6, 7], "convergesto_mul_const": 2, "acpo": 2, "abs_po": 2, "exists_abs_le_of_convergesto": 2, "strong": [2, 4], "n\u2080": 2, "bpo": [2, 8], "pos\u2080": 2, "div_po": 2, "n\u2081": 2, "convergesto_mul": 2, "sketch": [2, 3, 4, 8], "limit": [2, 6, 8], "bold": 2, "scratch": 2, "convergesto_uniqu": 2, "sa": 2, "sb": 2, "abn": 2, "na": 2, "hna": 2, "nb": 2, "hnb": 2, "absa": 2, "absb": 2, "observ": [2, 4, 8], "everywher": [2, 3, 6, 8, 10], "linearord": 2, "9": [2, 8], "vastli": 2, "awai": [2, 5], "vocabulari": 3, "uniform": [3, 8, 9], "conceptu": [3, 7], "overload": 3, "verbos": 3, "system": [3, 4, 5, 6], "wrong": 3, "ss": 3, "sub": [3, 8, 10, 12], "cap": 3, "un": 3, "cup": 3, "univ": [3, 8, 9, 10], "empti": [3, 4, 5, 7, 8, 10], "member": [3, 8], "membership": [3, 4, 6, 7], "mem": 3, "notin": 3, "ident": [3, 4, 5, 6, 7, 8, 12], "databas": [3, 4, 6, 8], "unlik": [3, 4], "existenti": [3, 7, 12], "subset_def": 3, "inter_def": 3, "mem_setof": 3, "xu": 3, "mem_inter_iff": 3, "xsu": 3, "phenomenon": 3, "union_def": 3, "mem_union": [3, 4], "xtu": 3, "xt": 3, "unnecessari": [3, 7], "correctli": 3, "special": [3, 4, 5, 6, 7, 8, 10], "rewritten": 3, "diff_eq": 3, "mem_diff": 3, "xstu": 3, "xnt": 3, "xnu": 3, "extension": [3, 5], "unsurprisingli": 3, "harm": 3, "and_comm": 3, "antisymm": 3, "hood": [3, 5], "builder": 3, "trivial": [3, 4, 7, 8], "eq_two_or_odd": 3, "even_iff": 3, "confus": [3, 4, 6, 7, 8], "fortun": 3, "agre": 3, "prime_iff": 3, "symm": [3, 4, 5, 6, 7, 8, 9], "rwa": [3, 4, 5], "restrict": [3, 4, 7, 8], "signific": 3, "ball": [3, 9], "bex": 3, "bex_def": 3, "prime_x": 3, "slight": 3, "ssubt": 3, "index": [3, 6, 7, 8], "model": [3, 8], "sequenc": [3, 6, 8, 9, 12], "a_0": 3, "a_1": 3, "a_2": 3, "mem_iunion": 3, "xai": 3, "mem_iint": 3, "mem_iunion\u2082": 3, "mem_iinter\u2082": 3, "exists_prime_and_dvd": 3, "eq_univ": 3, "eq_univ_of_foral": 3, "exists_infinite_prim": 3, "\u2080": 3, "sunion": 3, "sinter": 3, "relationship": [3, 4], "sunion_eq_biunion": 3, "sinter_eq_biint": 3, "preimag": [3, 7, 8], "imag": [3, 4, 6, 7, 8], "tripl": 3, "mem_image_of_mem": 3, "galoi": [3, 5, 8], "image_subset_iff": 3, "represent": [3, 4, 5], "asid": 3, "raini": 3, "dai": 3, "behavior": [3, 6, 8], "nonempti": [3, 7, 8], "condit": [3, 4, 6, 7, 8, 9], "injon": [3, 10], "theme": 3, "rel": [3, 5], "relativ": 3, "xpo": 3, "ypo": 3, "exp_log": 3, "ingredi": [3, 5, 8, 9], "inhabit": [3, 5, 8], "appeal": [3, 6], "choose_spec": 3, "noncomput": [3, 5, 7], "inverse_spec": 3, "dif_po": 3, "dif_neg": 3, "if_po": 3, "if_neg": 3, "fulli": [3, 7, 8], "alon": 3, "leftinvers": 3, "rightinvers": 3, "hack": 3, "half": [3, 7], "dozen": 3, "condens": 3, "cantor": 3, "famou": [3, 7], "j": [3, 7], "intuit": [3, 8], "cardin": [3, 7], "biject": [3, 5, 7], "nineteenth": 3, "centuri": 3, "infinit": [3, 8, 12], "dedekind": 3, "quickli": [3, 7, 10], "behind": [3, 7], "problem": [3, 4, 5, 6, 8], "shade": 3, "region": 3, "diagram": 3, "circ": [3, 5], "scale": 3, "inner": 3, "smaller": [3, 4, 8], "concentr": 3, "unshad": 3, "compos": [3, 5, 7, 8], "disjoint": [3, 7, 10], "sound": [3, 5, 6], "plausibl": 3, "delic": 3, "improv": [3, 4], "confid": 3, "better": [3, 4, 5, 6, 8], "invfun": [3, 5], "leftinverse_invfun": 3, "invfun_eq": 3, "sbaux": 3, "sbset": 3, "s_": 3, "bigcup_": 3, "mathbb": [3, 4, 5, 7], "sbfun": 3, "complement": [3, 8, 10], "outermost": 3, "setminu": 3, "sb_right_inv": 3, "goe": [3, 4, 5, 6, 8], "neither": [3, 5, 6], "nor": [3, 5], "sb_inject": 3, "hf": [3, 7, 8, 9, 10], "a_def": 3, "h_def": 3, "hxeq": 3, "xa": 3, "wlog": 3, "x\u2081a": 3, "resolve_left": 3, "x\u2082a": 3, "not_imp_self": 3, "x\u2082na": 3, "x\u2082eq": 3, "hn": [3, 4, 8, 9], "sb_fun": 3, "bring": [3, 4, 8], "tradeoff": 3, "encapsul": [3, 5, 9], "symmetri": [3, 6], "dwell": 3, "sb_surject": 3, "hg": [3, 8, 9, 10], "gya": 3, "xmem": 3, "sweet": 3, "schroeder_bernstein": 3, "substant": 4, "ancient": 4, "fraction": 4, "lowest": 4, "2c": 4, "4c": 4, "factor": [4, 5, 7], "coprim": [4, 7], "smart": 4, "12": 4, "encount": [4, 6], "algebra": [4, 6, 8, 9, 10, 12], "prime_def_lt": 4, "eq_one_or_self_of_dvd": 4, "prime_p": 4, "17": 4, "commonli": [4, 5], "prime_two": 4, "prime_thre": 4, "broader": [4, 9], "irreduc": [4, 5], "coincid": [4, 5, 8], "rise": [4, 6, 7], "dvd_mul": 4, "even_of_even_sqr": 4, "dvd_of_dvd_pow": 4, "proce": [4, 6], "profici": 4, "prefix": [4, 6, 7], "search": [4, 5, 6], "engin": 4, "hesit": 4, "mul_right_inj": 4, "heart": [4, 7], "irration": 4, "dvd_gcd": 4, "coprime_mn": 4, "sqr_eq": 4, "meq": 4, "dvd_iff_exists_eq_mul_left": 4, "two_l": 4, "le_of_dvd": 4, "approach": [4, 5, 6, 8], "quick": [4, 7, 9], "ne": [4, 5], "occur": 4, "suffici": [4, 8], "primefactorslist": 4, "permut": [4, 7], "prime_of_mem_primefactorslist": 4, "prod_primefactorslist": 4, "primefactorslist_uniqu": 4, "talk": [4, 7, 8, 9], "factorization_mul": 4, "mnez": 4, "nnez": 4, "factorization_pow": 4, "black": [4, 6], "box": 4, "simpa": [4, 7, 9], "nnz": 4, "nsqr_nez": 4, "eq1": 4, "eq2": 4, "add_mul_mod_self_left": 4, "mul_mod_right": 4, "count_factors_mul_of_po": 4, "succ_ne_zero": 4, "succ": [4, 6], "successor": 4, "npow_nz": 4, "dvd_sub": 4, "anywai": [4, 7], "pow_eq": 4, "npowz": 4, "add_sub_cancel": 4, "understood": [4, 8], "quotient": [4, 5, 6, 8], "pictur": [4, 5, 7], "mediat": 4, "headach": 4, "contend": 4, "th": 4, "topic": [4, 5, 6, 7], "enat": 4, "infin": [4, 8, 10], "appreci": 4, "role": [4, 5, 8], "datatyp": 4, "freeli": 4, "translat": [4, 6, 7, 8], "mathematician": [4, 8], "inj": 4, "factori": 4, "fac": 4, "ih": 4, "fac_po": 4, "succ_po": 4, "dvd_fac": 4, "ipo": 4, "il": 4, "of_le_succ": 4, "dvd_mul_of_dvd_right": 4, "crude": 4, "remaind": [4, 5, 7], "pow_succ": 4, "pow_two_le_fac": 4, "finset": [4, 5, 7, 8], "bigoper": [4, 5, 7], "prod": [4, 7, 8, 10], "sum_range_zero": 4, "sum_range_succ": 4, "summat": 4, "prod_range_zero": 4, "prod_range_succ": 4, "deserv": 4, "danger": [4, 5], "ordinarili": [4, 5], "loop": 4, "indefinit": 4, "fix": [4, 6, 7, 8], "mul_left_comm": 4, "placement": 4, "re": [4, 5], "handi": 4, "sum_id": 4, "div_eq_of_eq_mul_right": 4, "sum_sqr": 4, "mynat": 4, "thumb": 4, "decid": [4, 7, 8], "preced": [4, 7], "truncat": 4, "exponenti": 4, "cut": 4, "predecessor": 4, "pred": 4, "mul": [4, 5, 6, 8], "succ_add": 4, "succ_mul": 4, "explor": [4, 8], "standard": [4, 5, 6, 8], "formul": [4, 7, 8], "quirki": 4, "among": 4, "annoi": [4, 6], "h0": 4, "succ_le_succ": 4, "zero_l": [4, 5], "interval_cas": 4, "interv": [4, 8, 10], "decis": [4, 7], "procedur": [4, 6], "revert": [4, 5], "minfac": 4, "smallest": [4, 6, 8], "strong_induction_on": 4, "subsum": 4, "exists_prime_factor": 4, "np": 4, "mltn": 4, "mdvdn": 4, "mne1": 4, "mz": 4, "zero_dvd_iff": 4, "mgt2": 4, "pp": 4, "pdvd": 4, "factorial_po": 4, "dvd_factori": 4, "primes_infinit": 4, "refin": [4, 9], "ple": 4, "p_1": 4, "p_n": 4, "prod_": 4, "p_i": [4, 8], "computation": 4, "test": 4, "decidableeq": 4, "abandon": 4, "ourselv": [4, 6], "subset_iff": 4, "mem_int": 4, "mem_sdiff": 4, "tauto": 4, "dispens": 4, "tautologi": 4, "dvd_prod_of_mem": 4, "eq_of_dvd_of_prim": 4, "prime_q": 4, "preserv": [4, 6, 8], "induction_on": 4, "singleton": 4, "prod_empti": 4, "prod_insert": 4, "mem_of_dvd_prod_prim": 4, "mem_insert": 4, "wrote": 4, "filter": [4, 9, 10, 12], "mem_filt": 4, "aim": [4, 7], "prod_po": 4, "_def": 4, "mem_": 4, "id": [4, 6, 8, 9], "bounded_of_ex_finset": 4, "qk": 4, "lt_succ_of_l": 4, "le_sup": 4, "ex_finset_of_bound": 4, "decidablepr": 4, "lt_succ_iff": 4, "congruent": 4, "p_k": 4, "loss": 4, "27": 4, "mod_4_eq_3_or_mod_4_eq_3": 4, "mul_mod": 4, "mod_lt": 4, "mul_mod_mod": 4, "two_le_of_mod_4_eq_3": 4, "neq": 4, "div_dvd_of_dvd": 4, "div_lt_self": 4, "exists_prime_factor_mod_4_eq_3": 4, "mge2": 4, "mul_div_cancel": 4, "home": [4, 5], "stretch": [4, 5], "remov": [4, 8], "eras": 4, "mem_eras": 4, "readi": [4, 6, 7, 8, 9], "dvd_add_iff_left": 4, "primes_mod_4_eq_3_infinit": 4, "p4": 4, "pltn": 4, "p4eq": 4, "pne3": 4, "seriou": [4, 6, 8], "feat": 4, "modern": [5, 7], "subject": 5, "consult": 5, "ann": 5, "baanen": 5, "abus": 5, "paramet": [5, 6], "broadest": 5, "possibli": 5, "constraint": [5, 8], "bundl": [5, 6, 7, 8, 9], "tupl": 5, "hy": [5, 6, 7], "hz": [5, 6], "mypoint1": 5, "mypoint2": 5, "mypoint3": 5, "mk": [5, 6, 7, 8], "former": 5, "latter": [5, 7, 8], "quot": [5, 8], "protect": 5, "add_x": 5, "addalt": 5, "eta": 5, "messier": 5, "view": [5, 6, 7, 8], "y\u2081": 5, "z\u2081": 5, "y\u2082": 5, "z\u2082": 5, "addalt_x": 5, "addalt_comm": 5, "apart": [5, 6], "effici": [5, 7, 8], "scalar": [5, 6, 7, 9], "smul": [5, 6, 7], "smul_distrib": 5, "road": 5, "link": [5, 6], "belong": [5, 6, 8], "simplex": 5, "convinc": 5, "equilater": 5, "interior": [5, 9], "standardtwosimplex": 5, "x_nonneg": 5, "y_nonneg": 5, "z_nonneg": 5, "sum_eq": 5, "swap": 5, "swapxi": 5, "interestingli": [5, 7, 9], "midpoint": 5, "div_nonneg": 5, "weight": 5, "averag": 5, "weightedaverag": 5, "lambda_nonneg": 5, "lambda_l": 5, "fin": [5, 7, 10], "standardsimplex": 5, "sum_eq_on": 5, "div_eq_mul_inv": 5, "sum_mul": 5, "sum_add_distrib": 5, "mul_sum": 5, "islinear": 5, "is_addit": 5, "preserves_mul": 5, "linf": 5, "subtyp": [5, 6, 7, 8], "preal": 5, "val": 5, "sigma": [5, 10], "wherebi": [5, 8], "stdsimplex": 5, "\u03c3": [5, 7], "fst": [5, 8], "snd": [5, 8], "custom": 5, "robust": [5, 6], "interfac": 5, "redefin": [5, 6], "accessor": 5, "weav": 5, "rich": [5, 6], "interconnect": 5, "hierarchi": [5, 7, 12], "clarifi": 5, "cdot": 5, "topolog": [5, 6, 9, 12], "mathcal": [5, 9], "proxi": 5, "bipartit": 5, "graph": 5, "categori": [5, 8, 9], "morphism": [5, 9, 12], "basi": [5, 8], "discret": 5, "inherit": [5, 6, 7], "polynomi": 5, "coeffici": [5, 7], "dual": [5, 8], "accommod": [5, 7], "almost": [5, 6, 7, 8, 10], "marriag": 5, "heaven": 5, "group\u2081": [5, 6], "inv": [5, 6], "struc": 5, "counterpart": 5, "assur": 5, "groupcat": 5, "group\u2081cat": 5, "str": 5, "capit": 5, "roman": 5, "equiv": [5, 7], "tofun": [5, 6], "right_inv": 5, "left_inv": 5, "creativ": 5, "evid": 5, "coercion": [5, 6, 7, 8, 9], "omit": 5, "perm": [5, 7], "under": [5, 6, 7, 8], "orient": 5, "permgroup": 5, "trans_assoc": 5, "trans_refl": 5, "refl_tran": 5, "self_trans_symm": [5, 7], "grouptheori": 5, "g_1": 5, "g_2": 5, "g_3": 5, "tightli": 5, "isomorph": [5, 7, 9], "Its": [5, 6], "neg": [5, 6, 8, 10], "reproduc": 5, "accompani": 5, "addgroup\u2081": 5, "scheme": 5, "addgrouppoint": 5, "arrang": 5, "mul_inv_cancel_right": 5, "achiev": [5, 6, 8], "silent": [5, 6], "regist": [5, 6, 7], "grp": 5, "contextu": 5, "cue": 5, "synthes": [5, 6], "whole": 5, "_inst_1": 5, "candid": 5, "group\u2082": 5, "mysquar": 5, "my_squar": 5, "remark": [5, 6], "headi": 5, "store": 5, "hasmulgroup\u2082": 5, "hasonegroup\u2082": 5, "hasinvgroup\u2082": 5, "suppli": 5, "accord": 5, "capabl": 5, "chain": 5, "recent": 5, "prioriti": 5, "bad": [5, 6, 8], "artifici": 5, "addgroup\u2082": 5, "subtl": [5, 7, 8], "configur": 5, "invisibli": [5, 6], "wise": 5, "euclidean": 5, "terminologi": 5, "mid": 5, "imaginari": 5, "gaussint": 5, "im": 5, "pointwis": [5, 8, 9], "root": [5, 6, 7, 12], "ac": 5, "bci": 5, "adi": 5, "bd": 5, "bc": 5, "zero_def": 5, "one_def": 5, "add_def": 5, "neg_def": 5, "mul_def": 5, "zero_r": 5, "zero_im": 5, "one_r": 5, "one_im": 5, "add_r": 5, "add_im": 5, "neg_r": 5, "neg_im": 5, "mul_r": 5, "mul_im": 5, "surprisingli": [5, 6], "concept": [5, 7, 8, 9], "light": 5, "bulb": 5, "skeleton": [5, 8], "scari": 5, "nsmul": [5, 6], "zsmul": [5, 6], "instcommr": 5, "nsmulrec": 5, "zsmulrec": 5, "left_distrib": [5, 6], "right_distrib": [5, 6], "ext_iff": 5, "bq": 5, "archetyp": 5, "eq": 5, "int": [5, 6, 7], "ediv_add_emod": 5, "emod_nonneg": 5, "emod_lt": 5, "unit": [5, 6, 8], "algorithm": 5, "conjug": [5, 7], "frac": 5, "nearest": 5, "vi": 5, "multipli": 5, "emb": 5, "forth": 5, "quadrat": 5, "gaussianint": 5, "stai": 5, "face": [5, 6, 8], "machineri": [5, 6, 8], "adapt": 5, "invest": 5, "pragmat": 5, "seek": 5, "heather": 5, "macbeth": 5, "eleg": 5, "div": 5, "mod": 5, "_add_mod": 5, "abs_mod": 5, "_le": 5, "emod_lt_of_po": 5, "zero_lt_two": 5, "fixm": 5, "_eq": 5, "sq_add_sq_eq_zero": 5, "linearorderedr": 5, "norm_nonneg": [5, 9], "norm_eq_zero": [5, 9], "norm_po": 5, "norm_mul": [5, 9], "conj": 5, "conj_r": 5, "conj_im": 5, "norm_conj": 5, "bespok": 5, "quad": 5, "record": [5, 6], "div_def": 5, "mod_def": 5, "messi": 5, "nicer": [5, 7, 8], "norm_mod_lt": 5, "norm_y_po": 5, "sq_ab": 5, "gcongr": 5, "ediv_mul_l": 5, "le_of_mul_le_mul_right": 5, "ediv_lt_of_lt_mul": 5, "natab": 5, "coe_natabs_norm": 5, "natabs_of_nonneg": 5, "natabs_norm_mod_lt": 5, "ofnat_lt": 5, "coe_natab": 5, "not_norm_mul_left_lt_norm": 5, "natabs_mul": 5, "le_mul_of_one_le_right": 5, "ofnat_l": 5, "add_one_le_of_lt": 5, "euclideandomain": 5, "quotient_mul_add_remainder_eq": 5, "quotient_zero": 5, "r_wellfound": 5, "remainder_lt": 5, "mul_left_not_lt": 5, "payoff": 5, "principalidealr": 5, "irreducible_iff_prim": 5, "studi": [6, 8], "prematur": 6, "technologi": 6, "simpler": 6, "ring\u2081": 6, "gradual": [6, 8], "bottom": [6, 7, 8], "endow": [6, 7], "one\u2081": 6, "heavier": 6, "inferr": 6, "resolut": 6, "ie": [6, 8], "attribut": 6, "ensur": [6, 7, 8], "self": 6, "one\u2082": 6, "usabl": 6, "silli": 6, "affect": 6, "importantli": [6, 7], "habit": 6, "ascript": [6, 7], "messag": 6, "typeclass": 6, "stuck": 6, "metavari": 6, "263": 6, "sever": [6, 8, 10], "unknown": 6, "collis": 6, "builtin": 6, "\ud835\udfd9": 6, "inherit_doc": 6, "diamond": 6, "dia\u2081": 6, "dia": 6, "infixl": 6, "70": 6, "semigroup": 6, "dia_assoc": 6, "semigroup\u2081": 6, "todia\u2081": 6, "previous": 6, "semigroup\u2082": 6, "hurdl": 6, "neutral": [6, 7], "diaoneclass\u2081": 6, "one_dia": 6, "dia_on": 6, "trace": 6, "ters": 6, "attempt": 6, "succe": 6, "success": 6, "set_opt": 6, "synthinst": 6, "monoid\u2081": 6, "hide": [6, 7, 8], "subtleti": [6, 7], "fear": 6, "unrel": 6, "tosemigroup\u2081": 6, "todiaoneclass\u2081": 6, "monoid\u2082": 6, "toone\u2081": 6, "overlap": [6, 7], "tear": 6, "signatur": 6, "restor": 6, "optim": [6, 10], "reusabl": 6, "inv\u2081": 6, "postfix": 6, "inv_dia": 6, "weak": 6, "preliminari": 6, "left_inv_eq_right_inv\u2081": 6, "hba": 6, "hac": 6, "export": 6, "inv_eq_of_dia": 6, "dia_inv": 6, "naiv": [6, 8], "duplic": 6, "to_addit": 6, "semi": [6, 7], "left_inv_eq_right_inv": 6, "left_neg_eq_right_neg": 6, "whatsnew": 6, "addsemigroup\u2083": 6, "add_assoc\u2083": 6, "semigroup\u2083": 6, "mul_assoc\u2083": 6, "addmonoid\u2083": 6, "addzeroclass": 6, "monoid\u2083": 6, "muloneclass": 6, "tomuloneclass": 6, "addcommsemigroup\u2083": 6, "commsemigroup\u2083": 6, "addcommmonoid\u2083": 6, "commmonoid\u2083": 6, "addgroup\u2083": 6, "neg_add": 6, "group\u2083": 6, "inv_mul": 6, "inv_eq_of_mul": 6, "propag": 6, "attr": 6, "mul_inv": [6, 7], "mul_left_cancel\u2083": 6, "mul_right_cancel\u2083": 6, "addcommgroup\u2083": 6, "commgroup\u2083": 6, "demonstr": [6, 8], "semir": [6, 7], "opposit": [6, 8], "gain": 6, "besid": 6, "parent": 6, "ring\u2083": 6, "mulzeroclass": 6, "toaddgroup\u2083": 6, "mayb": 6, "claus": 6, "le\u2081": 6, "50": 6, "\u2081": 6, "preorder\u2081": 6, "partialorder\u2081": 6, "orderedcommmonoid\u2081": 6, "modul": [6, 7], "pretend": 6, "smul\u2083": 6, "infixr": 6, "73": 6, "module\u2081": 6, "zero_smul": 6, "one_smul": [6, 7], "mul_smul": [6, 7], "add_smul": [6, 7], "smul_add": 6, "surpris": 6, "toaddcommgroup\u2083": 6, "inst": 6, "module\u2083": 6, "hunt": 6, "unspecifi": 6, "embark": 6, "quest": 6, "huge": 6, "trap": 6, "refus": [6, 8], "tosmul\u2083": 6, "inst_1": 6, "safe": [6, 7], "selfmodul": 6, "invert": [6, 7], "nsmul\u2081": 6, "zsmul\u2081": 6, "ofnat": 6, "negsucc": 6, "abgrpmodul": 6, "failur": 6, "synth": 6, "indirect": 6, "path": 6, "thank": 6, "offend": 6, "poor": 6, "forget": 6, "http": 6, "inria": 6, "hal": 6, "scienc": 6, "02463336": 6, "modifi": 6, "addmonoid\u2084": 6, "nsmul_zero": 6, "nsmul_succ": 6, "mysmul": 6, "stori": 6, "incorpor": 6, "lt\u2081": 6, "comparison": 6, "ismonoidhom\u2081": 6, "unpleas": [6, 8], "chose": 6, "ismonoidhom\u2082": 6, "map_on": [6, 7], "map_mul": [6, 7], "tempt": 6, "higher": 6, "unif": 6, "psycholog": 6, "rare": 6, "adject": 6, "bare": 6, "noun": 6, "argu": 6, "continuous_id": [6, 8], "primari": 6, "monoidhom\u2081": 6, "coefun": 6, "coerc": [6, 7], "coe": 6, "addmonoidhom\u2081": 6, "addmonoid": [6, 7], "map_zero": [6, 7], "map_add": [6, 7, 9], "ringhom\u2081": 6, "minor": [6, 9], "tomonoidhom\u2081": 6, "juggl": 6, "monoidhomclass\u2081": 6, "badinst": 6, "wouldn": 6, "priori": 6, "boil": 6, "hopelessli": 6, "checksynthord": 6, "random": 6, "deduc": [6, 7, 8], "outparam": 6, "trigger": 6, "retri": 6, "monoidhomclass\u2082": 6, "promis": [6, 8], "map_inv_of_inv": 6, "got": 6, "presenc": 6, "layer": [6, 8], "dfunlik": 6, "dfun": 6, "monoidhomclass": 6, "monoidhomclass\u2083": 6, "coe_inject": 6, "stop": 6, "ringhomclass\u2083": 6, "ringhom": [6, 7], "algebrahom": 6, "ve": [6, 8], "primarili": [6, 7, 8], "unbundl": 6, "orderpreshom": 6, "le_of_l": 6, "orderpresmonoidhom": 6, "orderpreshomclass": 6, "subgroup": 6, "subr": 6, "reus": 6, "led": 6, "descend": [6, 7], "break": 6, "barrier": 6, "setlik": 6, "wrap": [6, 8], "submonoid\u2081": 6, "submonoid": [6, 7], "mul_mem": [6, 7], "one_mem": [6, 7], "tackl": 6, "setco": 6, "submonoid\u2081monoid": 6, "destructur": 6, "binder": 6, "submonoidclass\u2081": 6, "subgroup\u2081": 6, "subgroupclass\u2081": 6, "subobject": 6, "s\u2081": 6, "s\u2082": 6, "shame": 6, "across": 6, "weird": [6, 8], "distract": 6, "emphas": [6, 7], "anecdot": 6, "devic": 6, "hasquoti": 6, "bewar": 6, "regular": [6, 8], "ascii": 6, "setoid": [6, 7], "commmonoid": 6, "iseqv": 6, "hw": 6, "quotientmonoid": 6, "map\u2082": 6, "treatment": 7, "constantli": 7, "review": [7, 8], "contort": 7, "verbatim": 7, "safer": 7, "friendli": 7, "proceed": 7, "mostli": 7, "comm": 7, "addcommmonoid": 7, "monoidhom": 7, "addmonoidhom": 7, "packag": 7, "unfortun": 7, "consequ": 7, "comp": [7, 8], "mul_inv_self": 7, "map_inv": 7, "enforc": 7, "sent": [7, 8], "mulequiv": 7, "addequiv": 7, "ulequiv": 7, "projector": 7, "ofbiject": 7, "closur": [7, 8], "inv_mem": 7, "issubgroup": 7, "addsubgroup": 7, "add_mem": 7, "zero_mem": 7, "neg_mem": 7, "inferinst": 7, "benefit": 7, "amount": 7, "sup_eq_closur": 7, "mem_bot": 7, "ambient": 7, "ty": 7, "comap": [7, 8], "pushforward": [7, 8], "mem_map": 7, "mem_comap": 7, "kernel": 7, "ker": 7, "mem_ker": 7, "mem_rang": 7, "\u03c6": [7, 8], "hst": 7, "\u03c8": 7, "homomorph": 7, "lagrang": 7, "sylow": 7, "corner": 7, "nonconstruct": 7, "card": 7, "index_mul_card": 7, "hdvd": 7, "exists_subgroup_card_pow_prim": 7, "corollari": 7, "eq_bot_iff_card": 7, "eq_bot_iff_foral": 7, "card_eq_one_iff_exist": 7, "card_dvd_of_l": 7, "inf_bot_of_coprim": 7, "mathfrak": 7, "_n": 7, "cycl": 7, "iscycl": 7, "closure_iscycl": 7, "cyclic": 7, "freegroup": 7, "induct": [7, 8, 12], "myelement": 7, "gave": [7, 8], "embodi": 7, "lift": 7, "send": [7, 10], "mymorph": 7, "cube": 7, "presentedgroup": 7, "normal": 7, "somehow": 7, "creation": 7, "mygroup": 7, "feed": 7, "togroup": 7, "mymap": 7, "compat_mymap": 7, "mynewmorph": 7, "mulact": 7, "downsid": 7, "setup": 7, "synonym": 7, "groupact": 7, "addact": 7, "\u1d65": 7, "affin": 7, "add_vadd": 7, "topermhom": 7, "caylei": 7, "embed": 7, "cayleyisomorph": 7, "subgroupofmulact": 7, "partit": 7, "orbit": 7, "orbitrel": 7, "global": [7, 8], "\u03c9": 7, "selfequivsigmaorbit": 7, "fintyp": [7, 8], "card_congr": 7, "card_sigma": 7, "furthermor": 7, "stabil": 7, "orbitequivquotientstabil": 7, "groupequivquotientprodsubgroup": 7, "conjugate_on": 7, "quotientgroup": 7, "clue": 7, "onto": 7, "quotientkerequivrang": 7, "pullback": [7, 8], "quotientmulequivofeq": 7, "seri": 7, "card_po": 7, "index_eq_card": 7, "eq_of_mul_eq_mul_right": 7, "aux_card_eq": 7, "bijective_iff_injective_and_card": 7, "ker_eq_bot_iff": 7, "ker_restrict": 7, "iso\u2081": 7, "g\u2080": 7, "g\u2081": 7, "g\u2082": 7, "iso\u2082": 7, "prodcongr": 7, "finaliso": 7, "exot": [7, 8], "commsemir": 7, "doubli": 7, "mislead": 7, "tradition": 7, "taught": 7, "promin": 7, "isunit": 7, "m\u02e3": 7, "mainli": 7, "mkofmuleqon": 7, "\u2124\u02e3": 7, "units_eq_one_or": 7, "r\u02e3": 7, "s\u02e3": 7, "ringequiv": 7, "toward": 7, "geometri": 7, "submodul": 7, "eq_zero_iff_mem": 7, "mem_sup": 7, "mul_le_left": 7, "mul_le_right": 7, "mul_le_inf": 7, "quotientmap": 7, "quotequivofeq": 7, "chines": 7, "\u03c0": [7, 8, 9], "font": 7, "\u03b9": [7, 8, 9, 10], "iscoprim": 7, "quotientinfringequivpiquoti": 7, "zmod": 7, "pinot": 7, "prodequivpi": 7, "pi": [7, 8], "ker_pi_quotient_mk": 7, "chinesemap": 7, "proven": 7, "chinesemap_mk": 7, "famili": [7, 8, 9], "injective_lift_iff": 7, "chinesemap_inj": 7, "maxim": 7, "iscoprime_iff_add": 7, "iscoprime_iff_exist": 7, "iscoprime_iff_sup_eq": 7, "iscoprime_iff_codisjoint": 7, "opportun": [7, 8], "mem_insert_of_mem": 7, "mem_insert_self": 7, "iscoprime_inf": 7, "simp_rw": 7, "iinf_insert": 7, "one_eq_top": 7, "eq_top_iff": 7, "chinesemap_surj": 7, "hi": 7, "mk_surject": 7, "\u1d9c": 7, "he": 7, "chineseiso": 7, "encod": [7, 10], "algebramap": 7, "alghom": 7, "\u2090": 7, "endomorph": 7, "univari": 7, "indetermin": 7, "crucial": [7, 8], "bodi": 7, "map_pow": 7, "coeff": 7, "degre": 7, "natdegre": 7, "withbot": 7, "absorb": 7, "formula": [7, 10], "nozerodivisor": 7, "degree_mul": 7, "hp": [7, 8], "hq": [7, 8], "natdegree_mul": 7, "natdegree_comp": 7, "evalu": 7, "isroot": 7, "vanish": 7, "count": 7, "pain": 7, "multiset": 7, "roots_x_sub_c": 7, "aeval": 7, "aroot": 7, "caveat": 7, "aroots_def": 7, "c_neg": 7, "linear_combin": 7, "c_mul": 7, "p_ne_zero": 7, "apply_fun": 7, "roots_mul": 7, "alembert": 7, "gauss": 7, "isalgclos": 7, "eval\u2082": 7, "ofreal": 7, "multivari": 7, "briefli": 7, "mvpolynomi": 7, "circl": 7, "circleequ": 7, "coordin": 7, "calculu": [8, 10, 12], "quantiti": 8, "begun": 8, "paradox": 8, "x\u2080": [8, 9], "convention": 8, "eight": 8, "varieti": 8, "wish": 8, "64": 8, "y\u2080": 8, "z\u2080": 8, "paragraph": 8, "512": 8, "bourbaki": 8, "spell": 8, "dualli": 8, "neighborhood": 8, "etc": 8, "attop": [8, 10], "\ud835\udcdd": [8, 9, 10], "\ud835\udce4": 8, "entourag": 8, "\u03bc": [8, 10], "ae": [8, 10], "univ_set": 8, "sets_of_superset": 8, "inter_set": 8, "blur": 8, "princip": 8, "\ud835\udcdf": 8, "x_0": 8, "ioo": [8, 9], "tendsto\u2081": 8, "tendsto": [8, 10], "lim_": 8, "abstractli": 8, "salient": 8, "f_": 8, "tendsto\u2082": 8, "via": 8, "leverag": 8, "map_mono": 8, "map_map": 8, "shot": 8, "256": 8, "map_le_iff_le_comap": 8, "contravari": 8, "comap_comap": 8, "plane": 8, "\u02e2": 8, "nhds_prod_eq": 8, "aforement": 8, "le_inf_iff": 8, "shouldn": 8, "prohibit": 8, "precondit": 8, "nebot": 8, "tour": [8, 9], "claim": 8, "recaptur": 8, "superfici": 8, "stronger": 8, "flexibl": 8, "hasbasi": 8, "nhds_basis_ioo_po": 8, "tendsto_iff": 8, "reformul": 8, "ici": 8, "attop_basi": 8, "knew": 8, "n_p": 8, "n_q": 8, "tiresom": 8, "\u1da0": [8, 9, 10], "superscript": 8, "eventuallyeq": 8, "tendsto_congr": 8, "eventually_of_foral": 8, "mono": 8, "item": 8, "filter_upward": 8, "hr": 8, "aka": 8, "occasion": 8, "frequent": 8, "sophist": 8, "mem_closure_of_tendsto": 8, "clusterpt": 8, "mem_closure_iff_clusterpt": 8, "le_principal_iff": 8, "nebot_of_l": 8, "hux": 8, "hum": 8, "dist_eq_zero": 8, "emetricspac": 8, "pseudometricspac": 8, "pseudoemetricspac": 8, "journei": 8, "recast": 8, "tendsto_attop": 8, "continuous_iff": 8, "devot": 8, "uncurri": 8, "slow": 8, "continuous_fst": 8, "assembl": 8, "prod_mk": 8, "continuous_snd": 8, "continuous_dist": 8, "clunki": 8, "heavili": 8, "elabor": 8, "prod_map": 8, "sad": 8, "border": 8, "obfusc": 8, "continuous_pow": 8, "continuousat": [8, 10], "continuousat_iff": 8, "geometr": 8, "closedbal": 8, "sign": 8, "radiu": 8, "mem_ball_self": 8, "mem_closedball_self": 8, "isopen": 8, "isopen_iff": 8, "Their": [8, 9], "isclos": [8, 9], "s\u1d9c": [8, 10], "isopen_compl_iff": 8, "hu": [8, 9], "mem_of_tendsto": 8, "mem_closure_iff": 8, "mem_closure_iff_seq_limit": 8, "nhds_basis_bal": 8, "nhds_basis_closedbal": 8, "mem_iff": 8, "segment": [8, 10], "somewher": 8, "continuouson": [8, 9], "minimum": 8, "iscompact": 8, "icc": [8, 9], "iscompact_icc": 8, "strictmono": 8, "tendsto_subseq": 8, "exists_forall_l": 8, "exists_forall_g": 8, "compactspac": 8, "iscompact_univ": 8, "cauchi": 8, "uniformcontinu": 8, "uniformcontinuous_iff": 8, "clearli": 8, "isclosed_l": [8, 9], "eq_empty_or_nonempti": 8, "attain": 8, "cauchyseq": 8, "cauchyseq_iff": 8, "completespac": [8, 9, 10], "cauchyseq_tendsto_of_complet": 8, "criterion": 8, "tendsto_pow_attop_nhds_0_of_lt_1": 8, "dist_le_range_sum_dist": 8, "cauchyseq_of_le_geometric_two": 8, "\u03b5_po": [8, 9], "le_iff_exists_add": 8, "boss": 8, "bair": [8, 9], "exclam": 8, "rec_on": 8, "ho": 8, "hd": 8, "dens": 8, "densiti": 8, "\u03b4po": 8, "hpo": 8, "hball": 8, "mem_closure_iff_nhds_basi": 8, "recon": 8, "rpo": 8, "rb": 8, "incl": 8, "cdist": 8, "ylim": 8, "yball": 8, "categor": 8, "topologicalspac": [8, 9], "isopen_univ": 8, "isopen_empti": 8, "isopen_iunion": 8, "isopen_iinter_of_finit": 8, "continuous_def": 8, "attach": 8, "filteri": 8, "mem_nhds_iff": 8, "digress": 8, "pure_le_nhd": 8, "self_of_nhd": 8, "eventually_eventually_nhd": 8, "mkofnhd": 8, "nhds_mkofnhd": 8, "functori": 8, "induc": 8, "sensibl": 8, "uncount": 8, "relatedli": 8, "coinduc": 8, "t_x": 8, "t_y": 8, "coinduced_le_iff_le_induc": 8, "covari": 8, "coinduced_compos": 8, "induced_compos": 8, "focus": 8, "nhd": 8, "recov": 8, "continuous_iff_coinduced_l": 8, "g_": 8, "t_z": 8, "wasn": 8, "t_": 8, "x_i": 8, "price": 8, "patholog": 8, "t2space": 8, "hausdorff": 8, "t3space": 8, "regularspac": 8, "tendsto_nhds_uniqu": 8, "closed_nhds_basi": 8, "nhds_basis_open": 8, "t_3": 8, "denseinduc": 8, "continuousat_extend": 8, "funni": 8, "_in": 8, "nhds_induc": 8, "fortiori": 8, "f_cont": 8, "tendsto_right_iff": 8, "firstcountabletopologi": 8, "cluster": 8, "hfx": 8, "push_pul": 8, "of_map": 8, "f_ne": 8, "f_le": 8, "map_eq": 8, "hne": 8, "hle": 8, "huo": 8, "hsu": 8, "elim_finite_subcov": 8, "introductori": 9, "hasderivat": [9, 10], "hasderivat_sin": 9, "differentiableat": 9, "inconveni": 9, "deriv_zero_of_not_differentiableat": 9, "deriv_add": 9, "islocalmin": 9, "deriv_eq_zero": 9, "roll": 9, "weirder": 9, "hab": 9, "hfc": 9, "hfi": 9, "exists_deriv_eq_zero": 9, "differentiableon": 9, "exists_deriv_eq_slop": 9, "normedaddcommgroup": [9, 10], "norm_add_l": 9, "infer_inst": [9, 10], "normedspac": [9, 10], "normedaddgroup": 9, "stipul": 9, "norm_smul": 9, "banach": [9, 10], "dimension": [9, 10], "finitedimension": [9, 10], "\ud835\udd5c": [9, 10], "nontriviallynormedfield": [9, 10], "normedfield": 9, "exists_one_lt_norm": 9, "continuouslinearmap": 9, "cont": 9, "map_smul": 9, "le_op_norm": 9, "hmp": 9, "hm": 9, "op_norm_le_bound": 9, "steinhau": 9, "bounded": 9, "uniformli": 9, "nonempty_interior_of_iunion_of_clos": 9, "continuous_linear_map": 9, "opnorm_le_of_shel": 9, "interior_subset": 9, "interior_iinter_subset": 9, "hc": 9, "h\u03b5": 9, "real_norm_l": 9, "\u03b5k_po": 9, "o": 9, "normedgroup": 9, "isbigowith": 9, "isbigowith_iff": 9, "isbigo_iff_isbigowith": 9, "islittleo_iff_forall_isbigowith": 9, "hasfderivat": 9, "fderiv": 9, "fr\u00e9chet": 9, "hasfderivatfilter_iff_islittleo": 9, "hff": 9, "iter": 9, "multilinear": 9, "withtop": 9, "infti": 9, "contdiff": 9, "iteratedfderiv": 9, "contdiff_iff_continuous_differenti": 9, "stricter": 9, "hasstrictfderivat": 9, "\ud835\udd42": 9, "rclike": 9, "contdiffat": 9, "localinvers": 9, "eventually_left_invers": 9, "eventually_right_invers": 9, "to_localinvers": 9, "hasfderivwithinat": [9, 10], "hasfderivatfilt": 9, "measuretheori": 10, "intervalintegr": 10, "integral_id": 10, "integral_one_div": 10, "differenti": [10, 12], "integral_hasstrictderivat_right": 10, "stronglymeasurableatfilt": 10, "volum": 10, "integral_eq_sub_of_hasderivat": 10, "convolut": 10, "bochner": 10, "lebesgu": 10, "measurablespac": 10, "countabl": 10, "measurableset": 10, "compl": 10, "iunion": 10, "iinter": 10, "measure_eq_iinf": 10, "measure_iunion_l": 10, "hmea": 10, "hdi": 10, "pairwis": 10, "m_iunion": 10, "\u1d50": 10, "integral_add": 10, "ennreal": 10, "toreal": 10, "setintegral_const": 10, "domin": 10, "converg": [10, 12], "aestronglymeasur": 10, "hbound": 10, "hlim": 10, "tendsto_integral_of_dominated_converg": 10, "fubini": 10, "sigmafinit": 10, "\u03bd": 10, "integral_prod": 10, "bilinear": 10, "borelspac": 10, "isaddhaarmeasur": 10, "invari": 10, "mass": 10, "compact": 10, "h_inj": 10, "det": 10, "integral_image_eq_integral_abs_det_fderiv_smul": 10, "overview": 12, "schr\u00f6der": 12, "bernstein": 12, "irrat": 12}, "objects": {}, "objtypes": {}, "objnames": {}, "titleterms": {"introduct": 0, "get": 0, "start": 0, "overview": 0, "basic": [1, 6], "calcul": 1, "prove": 1, "ident": 1, "algebra": [1, 5, 7], "structur": [1, 5], "us": 1, "theorem": [1, 3], "lemma": 1, "more": 1, "exampl": 1, "appli": 1, "rw": 1, "fact": 1, "about": 1, "logic": 2, "implic": 2, "univers": 2, "quantifi": 2, "The": [2, 3], "existenti": 2, "negat": 2, "conjunct": 2, "iff": 2, "disjunct": 2, "sequenc": 2, "converg": [2, 8], "set": [3, 8], "function": [3, 8], "schr\u00f6der": 3, "bernstein": 3, "elementari": [4, 9, 10], "number": 4, "theori": [4, 10], "irrat": 4, "root": 4, "induct": 4, "recurs": 4, "infinit": 4, "mani": 4, "prime": 4, "defin": 5, "build": 5, "gaussian": 5, "integ": 5, "hierarchi": 6, "morphism": [6, 7], "sub": 6, "object": 6, "group": 7, "ring": 7, "monoid": 7, "subgroup": 7, "concret": 7, "action": 7, "quotient": 7, "unit": 7, "subr": 7, "ideal": 7, "polynomi": 7, "topologi": 8, "filter": 8, "metric": 8, "space": [8, 9], "continu": [8, 9], "ball": 8, "open": 8, "close": 8, "compact": 8, "uniformli": 8, "complet": 8, "topolog": 8, "fundament": 8, "separ": 8, "countabl": 8, "differenti": 9, "calculu": 9, "norm": 9, "linear": 9, "map": 9, "asymptot": 9, "comparison": 9, "integr": 10, "measur": 10, "index": 11, "mathemat": 12, "lean": 12}, "envversion": {"sphinx.domains.c": 3, "sphinx.domains.changeset": 1, "sphinx.domains.citation": 1, "sphinx.domains.cpp": 9, "sphinx.domains.index": 1, "sphinx.domains.javascript": 3, "sphinx.domains.math": 2, "sphinx.domains.python": 4, "sphinx.domains.rst": 2, "sphinx.domains.std": 2, "sphinx": 60}, "alltitles": {"Introduction": [[0, "introduction"]], "Getting Started": [[0, "getting-started"]], "Overview": [[0, "overview"]], "Basics": [[1, "basics"], [6, "basics"]], "Calculating": [[1, "calculating"]], "Proving Identities in Algebraic Structures": [[1, "proving-identities-in-algebraic-structures"]], "Using Theorems and Lemmas": [[1, "using-theorems-and-lemmas"]], "More examples using apply and rw": [[1, "more-examples-using-apply-and-rw"]], "Proving Facts about Algebraic Structures": [[1, "proving-facts-about-algebraic-structures"]], "Logic": [[2, "logic"]], "Implication and the Universal Quantifier": [[2, "implication-and-the-universal-quantifier"]], "The Existential Quantifier": [[2, "the-existential-quantifier"]], "Negation": [[2, "negation"]], "Conjunction and Iff": [[2, "conjunction-and-iff"]], "Disjunction": [[2, "disjunction"]], "Sequences and Convergence": [[2, "sequences-and-convergence"]], "Sets and Functions": [[3, "sets-and-functions"]], "Sets": [[3, "sets"]], "Functions": [[3, "functions"]], "The Schr\u00f6der-Bernstein Theorem": [[3, "the-schroder-bernstein-theorem"]], "Elementary Number Theory": [[4, "elementary-number-theory"]], "Irrational Roots": [[4, "irrational-roots"]], "Induction and Recursion": [[4, "induction-and-recursion"]], "Infinitely Many Primes": [[4, "infinitely-many-primes"]], "Structures": [[5, "structures"]], "Defining structures": [[5, "defining-structures"]], "Algebraic Structures": [[5, "algebraic-structures"]], "Building the Gaussian Integers": [[5, "building-the-gaussian-integers"]], "Hierarchies": [[6, "hierarchies"]], "Morphisms": [[6, "morphisms"]], "Sub-objects": [[6, "sub-objects"]], "Groups and Rings": [[7, "groups-and-rings"]], "Monoids and Groups": [[7, "monoids-and-groups"]], "Monoids and their morphisms": [[7, "monoids-and-their-morphisms"]], "Groups and their morphisms": [[7, "groups-and-their-morphisms"]], "Subgroups": [[7, "subgroups"]], "Concrete groups": [[7, "concrete-groups"]], "Group actions": [[7, "group-actions"]], "Quotient groups": [[7, "quotient-groups"]], "Rings": [[7, "rings"]], "Rings, their units, morphisms and subrings": [[7, "rings-their-units-morphisms-and-subrings"]], "Ideals and quotients": [[7, "ideals-and-quotients"]], "Algebras and polynomials": [[7, "algebras-and-polynomials"]], "Topology": [[8, "index-0"]], "Filters": [[8, "filters"]], "Metric spaces": [[8, "metric-spaces"]], "Convergence and continuity": [[8, "convergence-and-continuity"]], "Balls, open sets and closed sets": [[8, "balls-open-sets-and-closed-sets"]], "Compactness": [[8, "compactness"], [8, "id5"]], "Uniformly continuous functions": [[8, "uniformly-continuous-functions"]], "Completeness": [[8, "completeness"]], "Topological spaces": [[8, "topological-spaces"]], "Fundamentals": [[8, "fundamentals"]], "Separation and countability": [[8, "separation-and-countability"]], "Differential Calculus": [[9, "index-0"]], "Elementary Differential Calculus": [[9, "elementary-differential-calculus"]], "Differential Calculus in Normed Spaces": [[9, "differential-calculus-in-normed-spaces"]], "Normed spaces": [[9, "id3"]], "Continuous linear maps": [[9, "continuous-linear-maps"]], "Asymptotic comparisons": [[9, "asymptotic-comparisons"]], "Differentiability": [[9, "differentiability"]], "Integration and Measure Theory": [[10, "index-0"]], "Elementary Integration": [[10, "elementary-integration"]], "Measure Theory": [[10, "measure-theory"]], "Integration": [[10, "integration"]], "Index": [[11, "index"]], "Mathematics in Lean": [[12, "mathematics-in-lean"]]}, "indexentries": {"check": [[0, "index-0"]], "commands": [[0, "index-0"]], "abel": [[1, "index-15"], [7, "index-3"]], "absolute value": [[1, "index-24"]], "apply": [[1, "index-12"], [1, "index-17"]], "calc": [[1, "index-3"]], "command": [[1, "index-9"]], "commutative ring": [[1, "index-8"]], "definitional equality": [[1, "index-13"]], "divisibility": [[1, "index-25"]], "exact": [[1, "index-12"], [1, "index-17"], [1, "index-5"]], "exponential": [[1, "index-19"]], "gcd": [[1, "index-26"]], "goal": [[1, "index-2"]], "group": [[1, "index-15"], [7, "index-2"]], "group (algebraic structure)": [[1, "index-14"], [7, "index-1"]], "group (tactic)": [[1, "index-15"], [7, "index-2"]], "have": [[1, "index-11"], [2, "index-12"]], "implicit argument": [[1, "index-10"]], "inequalities": [[1, "index-16"]], "lattice": [[1, "index-28"]], "lcm": [[1, "index-26"]], "linarith": [[1, "index-18"]], "local context": [[1, "index-2"]], "logarithm": [[1, "index-19"]], "max": [[1, "index-21"]], "metric space": [[1, "index-30"], [8, "index-2"]], "min": [[1, "index-21"]], "namespace": [[1, "index-9"]], "noncomm_ring": [[1, "index-15"]], "norm_num": [[1, "index-20"]], "open": [[1, "index-9"]], "order relation": [[1, "index-27"]], "partial order": [[1, "index-27"]], "proof state": [[1, "index-2"]], "real numbers": [[1, "index-1"]], "refl and reflexivity": [[1, "index-13"]], "reflexivity": [[1, "index-13"]], "repeat": [[1, "index-23"]], "rewrite": [[1, "index-0"]], "rfl": [[1, "index-13"]], "ring": [[1, "index-6"]], "ring (algebraic structure)": [[1, "index-7"], [7, "index-4"]], "ring (tactic)": [[1, "index-6"]], "rw": [[1, "index-0"], [1, "index-4"]], "rw and rewrite": [[1, "index-0"], [1, "index-4"]], "show": [[1, "index-22"]], "tactics": [[1, "index-0"], [1, "index-11"], [1, "index-12"], [1, "index-13"], [1, "index-15"], [1, "index-17"], [1, "index-18"], [1, "index-20"], [1, "index-22"], [1, "index-23"], [1, "index-29"], [1, "index-3"], [1, "index-4"], [1, "index-5"], [1, "index-6"], [2, "index-0"], [2, "index-11"], [2, "index-12"], [2, "index-13"], [2, "index-14"], [2, "index-15"], [2, "index-16"], [2, "index-17"], [2, "index-18"], [2, "index-19"], [2, "index-2"], [2, "index-20"], [2, "index-21"], [2, "index-23"], [2, "index-24"], [2, "index-25"], [2, "index-26"], [2, "index-4"], [2, "index-6"], [2, "index-8"], [2, "index-9"], [3, "index-1"], [3, "index-2"], [4, "index-0"], [7, "index-2"], [7, "index-3"], [8, "index-3"]], "trans": [[1, "index-29"]], "absurd": [[2, "index-17"]], "anonymous constructor": [[2, "index-7"]], "assumption": [[2, "index-19"]], "by_cases": [[2, "index-23"]], "by_contra": [[2, "index-14"]], "by_contra and by_contradiction": [[2, "index-14"]], "cases": [[2, "index-8"]], "change": [[2, "index-2"]], "congr": [[2, "index-25"]], "constructor": [[2, "index-18"]], "contradiction": [[2, "index-17"]], "contrapose": [[2, "index-16"]], "convert": [[2, "index-26"]], "dsimp": [[2, "index-2"]], "erw": [[2, "index-4"]], "excluded middle": [[2, "index-22"]], "exfalso": [[2, "index-17"]], "ext": [[2, "index-24"]], "extensionality": [[2, "index-24"]], "field_simp": [[2, "index-11"]], "from": [[2, "index-12"]], "injective function": [[2, "index-5"]], "intro": [[2, "index-0"]], "lambda abstraction": [[2, "index-1"]], "left": [[2, "index-21"]], "let": [[2, "index-13"]], "monotone function": [[2, "index-3"]], "push_neg": [[2, "index-15"]], "rcases": [[2, "index-9"]], "right": [[2, "index-21"]], "rintro": [[2, "index-9"]], "simp": [[2, "index-20"], [3, "index-1"]], "surjective function": [[2, "index-10"]], "this": [[2, "index-12"]], "use": [[2, "index-6"]], "bounded quantifiers": [[3, "index-3"]], "rwa": [[3, "index-2"]], "set operations": [[3, "index-0"]], "decide": [[4, "index-0"]], "monoid": [[7, "index-0"]], "filter": [[8, "index-1"]], "continuity": [[8, "index-3"]], "topological space": [[8, "index-4"]], "topology": [[8, "index-0"]], "differential calculus": [[9, "index-0"]], "elementary calculus": [[9, "index-1"]], "normed space": [[9, "index-2"]], "integration": [[10, "index-0"], [10, "index-1"]], "measure theory": [[10, "index-2"]]}}) + Search.setIndex({"alltitles": {"Algebraic Structures": [[5, "algebraic-structures"]], "Algebras and polynomials": [[7, "algebras-and-polynomials"]], "Asymptotic comparisons": [[9, "asymptotic-comparisons"]], "Balls, open sets and closed sets": [[8, "balls-open-sets-and-closed-sets"]], "Basics": [[1, null], [6, "basics"]], "Building the Gaussian Integers": [[5, "building-the-gaussian-integers"]], "Calculating": [[1, "calculating"]], "Compactness": [[8, "compactness"], [8, "id5"]], "Completeness": [[8, "completeness"]], "Concrete groups": [[7, "concrete-groups"]], "Conjunction and Iff": [[2, "conjunction-and-iff"]], "Continuous linear maps": [[9, "continuous-linear-maps"]], "Convergence and continuity": [[8, "convergence-and-continuity"]], "Defining structures": [[5, "defining-structures"]], "Differentiability": [[9, "differentiability"]], "Differential Calculus": [[9, null]], "Differential Calculus in Normed Spaces": [[9, "differential-calculus-in-normed-spaces"]], "Disjunction": [[2, "disjunction"]], "Elementary Differential Calculus": [[9, "elementary-differential-calculus"]], "Elementary Integration": [[10, "elementary-integration"]], "Elementary Number Theory": [[4, null]], "Filters": [[8, "filters"]], "Functions": [[3, "functions"]], "Fundamentals": [[8, "fundamentals"]], "Getting Started": [[0, "getting-started"]], "Group actions": [[7, "group-actions"]], "Groups and Rings": [[7, null]], "Groups and their morphisms": [[7, "groups-and-their-morphisms"]], "Hierarchies": [[6, null]], "Ideals and quotients": [[7, "ideals-and-quotients"]], "Implication and the Universal Quantifier": [[2, "implication-and-the-universal-quantifier"]], "Index": [[11, null]], "Induction and Recursion": [[4, "induction-and-recursion"]], "Infinitely Many Primes": [[4, "infinitely-many-primes"]], "Integration": [[10, "integration"]], "Integration and Measure Theory": [[10, null]], "Introduction": [[0, null]], "Irrational Roots": [[4, "irrational-roots"]], "Logic": [[2, null]], "Mathematics in Lean": [[12, null]], "Measure Theory": [[10, "measure-theory"]], "Metric spaces": [[8, "metric-spaces"]], "Monoids and Groups": [[7, "monoids-and-groups"]], "Monoids and their morphisms": [[7, "monoids-and-their-morphisms"]], "More examples using apply and rw": [[1, "more-examples-using-apply-and-rw"]], "Morphisms": [[6, "morphisms"]], "Negation": [[2, "negation"]], "Normed spaces": [[9, "id3"]], "Overview": [[0, "overview"]], "Proving Facts about Algebraic Structures": [[1, "proving-facts-about-algebraic-structures"]], "Proving Identities in Algebraic Structures": [[1, "proving-identities-in-algebraic-structures"]], "Quotient groups": [[7, "quotient-groups"]], "Rings": [[7, "rings"]], "Rings, their units, morphisms and subrings": [[7, "rings-their-units-morphisms-and-subrings"]], "Separation and countability": [[8, "separation-and-countability"]], "Sequences and Convergence": [[2, "sequences-and-convergence"]], "Sets": [[3, "sets"]], "Sets and Functions": [[3, null]], "Structures": [[5, null]], "Sub-objects": [[6, "sub-objects"]], "Subgroups": [[7, "subgroups"]], "The Existential Quantifier": [[2, "the-existential-quantifier"]], "The Schr\u00f6der-Bernstein Theorem": [[3, "the-schroder-bernstein-theorem"]], "Topological spaces": [[8, "topological-spaces"]], "Topology": [[8, null]], "Uniformly continuous functions": [[8, "uniformly-continuous-functions"]], "Using Theorems and Lemmas": [[1, "using-theorems-and-lemmas"]]}, "docnames": ["C01_Introduction", "C02_Basics", "C03_Logic", "C04_Sets_and_Functions", "C05_Elementary_Number_Theory", "C06_Structures", "C07_Hierarchies", "C08_Groups_and_Rings", "C09_Topology", "C10_Differential_Calculus", "C11_Integration_and_Measure_Theory", "genindex", "index"], "envversion": {"sphinx": 62, "sphinx.domains.c": 3, "sphinx.domains.changeset": 1, "sphinx.domains.citation": 1, "sphinx.domains.cpp": 9, "sphinx.domains.index": 1, "sphinx.domains.javascript": 3, "sphinx.domains.math": 2, "sphinx.domains.python": 4, "sphinx.domains.rst": 2, "sphinx.domains.std": 2}, "filenames": ["C01_Introduction.rst", "C02_Basics.rst", "C03_Logic.rst", "C04_Sets_and_Functions.rst", "C05_Elementary_Number_Theory.rst", "C06_Structures.rst", "C07_Hierarchies.rst", "C08_Groups_and_Rings.rst", "C09_Topology.rst", "C10_Differential_Calculus.rst", "C11_Integration_and_Measure_Theory.rst", "genindex.rst", "index.rst"], "indexentries": {"abel": [[1, "index-15", false], [7, "index-3", false]], "absolute value": [[1, "index-24", false]], "absurd": [[2, "index-17", false]], "anonymous constructor": [[2, "index-7", false]], "apply": [[1, "index-12", false], [1, "index-17", false]], "assumption": [[2, "index-19", false]], "bounded quantifiers": [[3, "index-3", false]], "by_cases": [[2, "index-23", false]], "by_contra": [[2, "index-14", false]], "by_contra and by_contradiction": [[2, "index-14", false]], "calc": [[1, "index-3", false]], "cases": [[2, "index-8", false]], "change": [[2, "index-2", false]], "check": [[0, "index-0", false]], "command": [[1, "index-9", false]], "commands": [[0, "index-0", false]], "commutative ring": [[1, "index-8", false]], "congr": [[2, "index-25", false]], "constructor": [[2, "index-18", false]], "continuity": [[8, "index-3", false]], "contradiction": [[2, "index-17", false]], "contrapose": [[2, "index-16", false]], "convert": [[2, "index-26", false]], "decide": [[4, "index-0", false]], "definitional equality": [[1, "index-13", false]], "differential calculus": [[9, "index-0", false]], "divisibility": [[1, "index-25", false]], "dsimp": [[2, "index-2", false]], "elementary calculus": [[9, "index-1", false]], "erw": [[2, "index-4", false]], "exact": [[1, "index-12", false], [1, "index-17", false], [1, "index-5", false]], "excluded middle": [[2, "index-22", false]], "exfalso": [[2, "index-17", false]], "exponential": [[1, "index-19", false]], "ext": [[2, "index-24", false]], "extensionality": [[2, "index-24", false]], "field_simp": [[2, "index-11", false]], "filter": [[8, "index-1", false]], "from": [[2, "index-12", false]], "gcd": [[1, "index-26", false]], "goal": [[1, "index-2", false]], "group": [[1, "index-15", false], [7, "index-2", false]], "group (algebraic structure)": [[1, "index-14", false], [7, "index-1", false]], "group (tactic)": [[1, "index-15", false], [7, "index-2", false]], "have": [[1, "index-11", false], [2, "index-12", false]], "implicit argument": [[1, "index-10", false]], "inequalities": [[1, "index-16", false]], "injective function": [[2, "index-5", false]], "integration": [[10, "index-0", false], [10, "index-1", false]], "intro": [[2, "index-0", false]], "lambda abstraction": [[2, "index-1", false]], "lattice": [[1, "index-28", false]], "lcm": [[1, "index-26", false]], "left": [[2, "index-21", false]], "let": [[2, "index-13", false]], "linarith": [[1, "index-18", false]], "local context": [[1, "index-2", false]], "logarithm": [[1, "index-19", false]], "max": [[1, "index-21", false]], "measure theory": [[10, "index-2", false]], "metric space": [[1, "index-30", false], [8, "index-2", false]], "min": [[1, "index-21", false]], "monoid": [[7, "index-0", false]], "monotone function": [[2, "index-3", false]], "namespace": [[1, "index-9", false]], "noncomm_ring": [[1, "index-15", false]], "norm_num": [[1, "index-20", false]], "normed space": [[9, "index-2", false]], "open": [[1, "index-9", false]], "order relation": [[1, "index-27", false]], "partial order": [[1, "index-27", false]], "proof state": [[1, "index-2", false]], "push_neg": [[2, "index-15", false]], "rcases": [[2, "index-9", false]], "real numbers": [[1, "index-1", false]], "refl and reflexivity": [[1, "index-13", false]], "reflexivity": [[1, "index-13", false]], "repeat": [[1, "index-23", false]], "rewrite": [[1, "index-0", false]], "rfl": [[1, "index-13", false]], "right": [[2, "index-21", false]], "ring": [[1, "index-6", false]], "ring (algebraic structure)": [[1, "index-7", false], [7, "index-4", false]], "ring (tactic)": [[1, "index-6", false]], "rintro": [[2, "index-9", false]], "rw": [[1, "index-0", false], [1, "index-4", false]], "rw and rewrite": [[1, "index-0", false], [1, "index-4", false]], "rwa": [[3, "index-2", false]], "set operations": [[3, "index-0", false]], "show": [[1, "index-22", false]], "simp": [[2, "index-20", false], [3, "index-1", false]], "surjective function": [[2, "index-10", false]], "tactics": [[1, "index-0", false], [1, "index-11", false], [1, "index-12", false], [1, "index-13", false], [1, "index-15", false], [1, "index-17", false], [1, "index-18", false], [1, "index-20", false], [1, "index-22", false], [1, "index-23", false], [1, "index-29", false], [1, "index-3", false], [1, "index-4", false], [1, "index-5", false], [1, "index-6", false], [2, "index-0", false], [2, "index-11", false], [2, "index-12", false], [2, "index-13", false], [2, "index-14", false], [2, "index-15", false], [2, "index-16", false], [2, "index-17", false], [2, "index-18", false], [2, "index-19", false], [2, "index-2", false], [2, "index-20", false], [2, "index-21", false], [2, "index-23", false], [2, "index-24", false], [2, "index-25", false], [2, "index-26", false], [2, "index-4", false], [2, "index-6", false], [2, "index-8", false], [2, "index-9", false], [3, "index-1", false], [3, "index-2", false], [4, "index-0", false], [7, "index-2", false], [7, "index-3", false], [8, "index-3", false]], "this": [[2, "index-12", false]], "topological space": [[8, "index-4", false]], "topology": [[8, "index-0", false]], "trans": [[1, "index-29", false]], "use": [[2, "index-6", false]]}, "objects": {}, "objnames": {}, "objtypes": {}, "terms": {"": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10], "0": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10], "02463336": 6, "1": [1, 2, 3, 4, 5, 6, 7, 8, 9, 10], "10": [2, 9], "12": 4, "15": 2, "17": 4, "2": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10], "256": 8, "263": 6, "27": 4, "2c": 4, "3": [0, 1, 2, 3, 4, 5, 6, 7, 8], "37": 2, "4": [0, 1, 2, 4, 5, 7, 8, 9], "4c": 4, "5": [1, 2, 5, 7, 8, 9], "50": 6, "512": 8, "6": [2, 4, 5, 6, 7, 8, 9], "64": 8, "7": [2, 4, 5, 7], "70": 6, "73": 6, "8": [2, 4, 7, 8], "9": [2, 8], "A": [1, 2, 3, 4, 5, 6, 7, 8, 9], "And": [2, 4, 6, 8], "As": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10], "At": [0, 1, 2, 4, 5, 6], "Be": [1, 3], "But": [0, 1, 2, 3, 4, 5, 6, 7, 8], "By": [1, 3, 5, 6, 7], "For": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10], "If": [0, 1, 2, 3, 4, 5, 6, 8], "In": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10], "It": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9], "Its": [5, 6], "Not": [1, 5, 8], "Of": [1, 2, 4, 6, 7, 8, 9, 10], "On": [1, 2, 3, 5, 6, 8, 10], "One": [1, 2, 3, 4, 5, 6, 7, 8], "Or": [2, 3], "Such": [0, 1, 2, 6], "That": [0, 4, 5, 6], "The": [0, 1, 4, 5, 6, 7, 8, 9, 10, 12], "Their": [8, 9], "Then": [2, 3, 5, 6, 7, 8, 10], "There": [0, 1, 2, 3, 4, 6, 7, 8, 9, 10], "These": [0, 1, 3, 4, 5, 7, 9, 10], "To": [0, 1, 2, 3, 4, 5, 6, 7, 8], "With": [1, 3, 4, 6, 8], "_": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10], "_add_mod": 5, "_def": 4, "_eq": 5, "_in": 8, "_inst_1": 5, "_le": 5, "_n": 7, "_root_": [1, 3, 4], "a_0": 3, "a_1": 3, "a_2": 3, "a_def": 3, "a_of_b_of_c": 1, "ab": [0, 2, 5, 7], "abandon": 4, "abbrevi": [1, 2, 3, 5], "abel": [1, 7], "abelian": [1, 5, 6], "abgrpmodul": 6, "abil": 0, "abl": [0, 1, 2, 3, 4, 5, 6, 7, 9], "abn": 2, "about": [0, 2, 3, 4, 5, 6, 7, 8, 9, 12], "abov": [0, 1, 2, 3, 4, 5, 6, 7, 8, 10], "abs_add": [1, 2], "abs_l": [1, 5], "abs_lt": 2, "abs_mod": 5, "abs_mul": 2, "abs_nonneg": 2, "abs_of_neg": 2, "abs_of_nonneg": [2, 5], "abs_po": 2, "abs_zero": 2, "absa": 2, "absb": 2, "absolut": 2, "absorb": 7, "absorb1": 1, "absorb2": 1, "absorpt": 1, "abstract": [1, 2, 5, 6, 7, 8], "abstractli": 8, "absurd": [2, 4], "abus": 5, "ac": 5, "accept": [0, 1, 2, 8], "access": [1, 3, 5, 6, 7, 8, 10], "accessor": 5, "accommod": [5, 7], "accompani": 5, "accord": 5, "achiev": [5, 6, 8], "acknowledg": 0, "acpo": 2, "across": 6, "act": [1, 7], "activ": 0, "actual": [2, 3, 4, 6, 7, 8], "ad": [1, 2, 3, 4, 5, 6, 8], "adapt": 5, "add": [2, 4, 5, 6, 7, 8, 9], "add_assoc": [1, 4, 5, 6], "add_assoc\u2083": 6, "add_comm": [1, 4, 5, 6, 7], "add_def": 5, "add_im": 5, "add_l": 1, "add_le_add": [1, 2], "add_le_add_left": 1, "add_le_add_right": 1, "add_left_cancel": 1, "add_left_inj": 2, "add_left_neg": [1, 5], "add_lt_add_left": 1, "add_lt_add_of_le_of_lt": 1, "add_lt_add_of_lt_of_l": 1, "add_lt_add_right": 1, "add_mem": 7, "add_mul": [1, 6], "add_mul_mod_self_left": 4, "add_neg_cancel_right": 1, "add_nonneg": [1, 5], "add_one_le_of_lt": 5, "add_po": 1, "add_pos_of_pos_of_nonneg": 1, "add_r": 5, "add_right_cancel": 1, "add_right_neg": 1, "add_smul": [6, 7], "add_sub": 1, "add_sub_cancel": 4, "add_sub_cancel_right": 1, "add_vadd": 7, "add_x": 5, "add_zero": [1, 5, 6], "addact": 7, "addalt": 5, "addalt_comm": 5, "addalt_x": 5, "addcommgroup": [1, 7], "addcommgroup\u2083": 6, "addcommmonoid": 7, "addcommmonoid\u2083": 6, "addcommsemigroup\u2083": 6, "addequiv": 7, "addgroup": [1, 5, 7], "addgrouppoint": 5, "addgroup\u2081": 5, "addgroup\u2082": 5, "addgroup\u2083": 6, "addit": [1, 2, 4, 5, 6, 7, 8, 9, 10], "addmonoid": [6, 7], "addmonoidhom": 7, "addmonoidhom\u2081": 6, "addmonoid\u2083": 6, "addmonoid\u2084": 6, "addsemigroup\u2083": 6, "addsubgroup": 7, "addzeroclass": 6, "adi": 5, "adject": 6, "adopt": 1, "advantag": [2, 3, 4, 5, 7, 9], "ae": [8, 10], "aestronglymeasur": 10, "aeval": 7, "affect": 6, "affin": 7, "aforement": 8, "after": [1, 2, 4, 6, 8, 9], "again": [1, 2, 3, 4, 5, 6, 7, 8], "against": 2, "agre": 3, "aim": [4, 7], "aka": 8, "aleb": 2, "alembert": 7, "alex": 0, "alexandru": 0, "algebra": [4, 6, 8, 9, 10, 12], "algebrahom": 6, "algebramap": 7, "alghom": 7, "algorithm": 5, "all": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10], "allow": [1, 2, 3, 4, 5, 6, 7, 8, 9, 10], "almost": [5, 6, 7, 8, 10], "alon": 3, "along": [1, 4, 7, 8], "alpha": [2, 3], "alreadi": [0, 1, 2, 3, 4, 5, 6, 7, 8], "also": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10], "altern": [0, 1, 2, 3, 4, 5, 6, 8], "although": [0, 3, 4, 5, 6, 7, 8], "alwai": [0, 1, 2, 3, 5, 6, 7], "ambient": 7, "ambigu": [1, 5], "among": 4, "amount": 7, "an": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10], "analog": [1, 2, 3, 4, 8], "analogi": [2, 5, 8, 9], "analysi": [0, 5, 9], "ancient": 4, "and_comm": 3, "anecdot": 6, "angl": 2, "ani": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10], "ann": 5, "annoi": [4, 6], "annot": [1, 2, 3, 4, 5, 6], "anonym": [2, 3, 4, 5, 7], "anoth": [0, 1, 2, 3, 4, 5, 6, 7, 8], "answer": [0, 5, 8], "antisymm": 3, "antisymmetr": [1, 2], "anyhow": 2, "anyth": [2, 5, 8], "anywai": [4, 7], "apart": [5, 6], "api": 1, "appeal": [3, 6], "appear": [0, 1, 2, 5, 6, 7, 8], "appli": [2, 3, 4, 5, 6, 7, 8, 9, 10, 12], "applic": [1, 2, 5, 7, 10], "apply_fun": 7, "appreci": 4, "approach": [4, 5, 6, 8], "appropri": [1, 2, 3, 5, 6], "approxim": 1, "ar": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10], "arbitrari": [1, 2, 3, 4, 5, 7], "arbitrarili": [2, 8], "archetyp": 5, "argu": 6, "argument": [1, 2, 3, 4, 5, 6, 7, 8], "aris": 2, "arithmet": 1, "aroot": 7, "aroots_def": 7, "around": [1, 3, 6, 7, 8, 10], "arrang": 5, "arrow": [1, 2, 6, 8], "artifici": 5, "ascii": 6, "ascript": [6, 7], "asid": 3, "ask": [2, 4, 5, 6, 7, 8], "aspect": [0, 5, 7], "assembl": 8, "assert": [2, 3, 6, 7], "assign": [2, 3, 5, 6, 7], "assist": [0, 2, 5], "associ": [0, 1, 2, 4, 5, 6, 7, 8, 10], "assum": [0, 1, 2, 3, 4, 6, 7, 8], "assumpt": [0, 1, 2, 3, 4, 5, 7, 8, 9, 10], "assur": 5, "asymmetri": 2, "attach": 8, "attain": 8, "attempt": 6, "attent": [1, 2, 4, 6, 7, 8], "attop": [8, 10], "attop_basi": 8, "attr": 6, "attract": 2, "attribut": 6, "auto": [1, 6], "autom": [0, 1, 5], "automat": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9], "aux": [1, 2, 4, 8], "aux_card_eq": 7, "auxiliari": [2, 8], "avail": [0, 1, 2, 4, 5, 6, 7], "averag": 5, "avoid": [1, 2, 3, 4, 5, 6, 7, 9], "awai": [2, 5], "axiom": [1, 2, 3, 5, 6, 7, 8, 10], "axiomat": [1, 2, 3, 5], "b": [1, 2, 3, 4, 5, 6, 7, 8, 9, 10], "baanen": 5, "back": [0, 1, 2, 5, 6, 7, 8], "background": [0, 7], "backslash": [1, 3], "backward": [2, 8], "bad": [5, 6, 8], "badinst": 6, "bair": [8, 9], "balanc": 1, "ball": [3, 9], "banach": [9, 10], "bar": [0, 1, 2], "bare": 6, "barrier": 6, "bartosz": 0, "base": [0, 2, 3, 4, 6, 7, 8, 9], "basi": [5, 8], "basic": [0, 2, 4, 5, 8, 10, 12], "baz": 1, "bbb": [2, 5], "bc": 5, "bci": 5, "bd": 5, "becaus": [1, 2, 3, 4, 5, 6, 7, 8, 9], "becom": [1, 4, 5, 6, 8], "been": [0, 1, 2, 4, 5, 6, 9], "befor": [0, 1, 2, 3, 4, 5, 6, 7], "begin": [1, 2, 3, 4, 5, 6], "begun": 8, "behav": [2, 3, 6, 8], "behavior": [3, 6, 8], "behind": [3, 7], "being": [1, 3, 5, 7, 8, 9], "belong": [5, 6, 8], "below": [0, 2, 3, 4, 5, 6, 7, 8, 9, 10], "benefit": 7, "beq": 2, "berman": 0, "bernstein": 12, "besid": 6, "bespok": 5, "best": 0, "beta": [2, 3], "better": [3, 4, 5, 6, 8], "between": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10], "bewar": 6, "bex": 3, "bex_def": 3, "beyond": [2, 6, 9], "bi": [1, 2, 5], "big": [0, 5, 7, 8, 9], "bigcup_": 3, "bigger": [0, 3, 9], "bigoper": [4, 5, 7], "biject": [3, 5, 7], "bijective_iff_injective_and_card": 7, "bilinear": 10, "binari": [1, 2, 4, 5, 6], "bind": [1, 3], "binder": 6, "bipartit": 5, "bit": [1, 2, 4, 6, 7, 8], "black": [4, 6], "block": [1, 4, 7], "blur": 8, "bochner": 10, "bodi": 7, "boil": 6, "bold": 2, "bolt": 1, "book": [0, 2, 8], "boolean": 1, "border": 8, "borelspac": 10, "boss": 8, "both": [1, 2, 3, 4, 5, 6, 7, 8, 9], "bother": [1, 3], "bottom": [6, 7, 8], "bound": [1, 2, 3, 4, 5, 8, 9, 10], "bounded": 9, "bounded_of_ex_finset": 4, "bourbaki": 8, "box": 4, "bpo": [2, 8], "bq": 5, "brace": 1, "bracket": [1, 2, 5, 6, 7], "branch": [2, 3, 6], "break": 6, "breviti": [1, 5], "briefli": 7, "bring": [3, 4, 8], "broader": [4, 9], "broadest": 5, "brown": 0, "brows": [0, 1, 4, 7], "bryan": 0, "build": [0, 2, 4, 6, 7, 8, 12], "builder": 3, "built": [0, 2, 6, 7], "builtin": 6, "bulb": 5, "bulwi": 0, "bundl": [5, 6, 7, 8, 9], "button": 0, "by_cas": [2, 3, 4], "by_contra": [2, 4], "c": [0, 1, 2, 4, 5, 6, 7, 8, 9, 10], "c_mul": 7, "c_neg": 7, "cach": 0, "calc": [1, 2, 3, 5, 7, 8], "calcul": [0, 2, 4, 5, 12], "calculu": [8, 10, 12], "call": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10], "can": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10], "candid": 5, "cannot": [2, 3, 4, 5, 6, 7, 8], "canon": [2, 3, 4, 5], "cantor": 3, "cap": 3, "capabl": 5, "capit": 5, "card": 7, "card_congr": 7, "card_dvd_of_l": 7, "card_eq_one_iff_exist": 7, "card_po": 7, "card_sigma": 7, "cardin": [3, 7], "care": [1, 2, 3, 5], "carneiro": 0, "carri": [0, 1, 2, 3, 4, 5, 6, 7, 8, 10], "carrier": [1, 5, 6, 7], "case": [1, 2, 3, 4, 5, 6, 7, 8, 10], "categor": 8, "categori": [5, 8, 9], "cauchi": 8, "cauchyseq": 8, "cauchyseq_iff": 8, "cauchyseq_of_le_geometric_two": 8, "cauchyseq_tendsto_of_complet": 8, "caveat": 7, "caylei": 7, "cayleyisomorph": 7, "cdist": 8, "cdot": 5, "center": [0, 8], "central": [0, 4], "centuri": 3, "ceq": 2, "certain": [2, 6, 8], "certifi": 0, "cha": 0, "chain": 5, "challeng": [0, 1, 2, 3, 5, 9], "chanc": 2, "chang": [0, 1, 2, 4, 5, 8, 10], "chapter": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9], "char": 0, "charact": [1, 3, 6], "character": [1, 3, 4, 8, 9], "chat": 0, "cheat": [0, 1], "check": [0, 1, 2, 3, 4, 5, 6, 7, 8], "checksynthord": 6, "chen": 0, "chestnut": 2, "chines": 7, "chineseiso": 7, "chinesemap": 7, "chinesemap_inj": 7, "chinesemap_mk": 7, "chinesemap_surj": 7, "choic": [1, 2, 3, 5, 8], "choos": [0, 2, 3, 4, 5, 6, 7, 8], "choose_spec": 3, "chose": 6, "chosen": [2, 5], "circ": [3, 5], "circl": 7, "circleequ": 7, "claim": 8, "clarifi": 5, "clash": 1, "class": [1, 4, 5, 6, 7, 8, 9, 10], "classic": [2, 3, 4, 7], "claus": 6, "clean": [2, 8], "clear": [1, 2, 4, 5, 6], "clearer": [1, 3, 5], "clearli": 8, "clever": 1, "click": [0, 1, 3, 4, 5, 6], "clock": 0, "clontz": 0, "close": [1, 2, 3, 6, 7, 9, 10], "closed_nhds_basi": 8, "closedbal": 8, "closer": [2, 8], "closur": [7, 8], "closure_iscycl": 7, "cloud": 0, "clue": 7, "clunki": 8, "cluster": 8, "clusterpt": 8, "cmd": [1, 2], "co": [2, 7], "cocki": 1, "code": [0, 1, 2, 3, 5, 6], "codomain": [2, 4, 8], "coe": 6, "coe_inject": 6, "coe_natab": 5, "coe_natabs_norm": 5, "coeff": 7, "coeffici": [5, 7], "coefun": 6, "coerc": [6, 7], "coercion": [5, 6, 7, 8, 9], "coincid": [4, 5, 8], "coinduc": 8, "coinduced_compos": 8, "coinduced_le_iff_le_induc": 8, "collari": 0, "collect": [1, 2, 3, 5, 8, 10], "collis": 6, "colon": 2, "comap": [7, 8], "comap_comap": 8, "combin": [1, 2, 5, 6, 7, 8], "come": [0, 1, 2, 3, 4, 5, 6, 7, 8], "comfort": 0, "comm": 7, "comma": 1, "command": [0, 1, 2, 3, 4, 5, 6, 7], "commelin": 0, "comment": [0, 4], "commgroup": 1, "commgroup\u2083": 6, "commmonoid": 6, "commmonoid\u2083": 6, "common": [1, 2, 3, 4, 5, 7, 8], "commonli": [4, 5], "commr": [1, 2, 5, 7], "commsemigroup\u2083": 6, "commsemir": 7, "commun": [0, 4], "commut": [1, 2, 3, 4, 5, 6, 7, 9], "comp": [7, 8], "compact": 10, "compactspac": 8, "compani": 2, "companion": [0, 1], "compar": [0, 5, 6, 8], "comparison": 6, "compat": [1, 7, 8], "compat_mymap": 7, "compl": 10, "complain": 1, "complement": [3, 8, 10], "complementari": 0, "complet": [0, 1, 2, 3, 4, 6, 7, 9], "completespac": [8, 9, 10], "complex": [0, 1, 2, 4, 5, 7, 9, 10], "complic": [1, 2, 6, 7], "compon": [2, 3, 5, 8, 10], "compos": [3, 5, 7, 8], "composit": [2, 3, 5, 6, 7, 8], "compound": [1, 2, 8], "compress": [0, 1, 8], "comput": [0, 2, 3, 4, 5, 7, 9, 10], "computation": 4, "concentr": 3, "concept": [5, 7, 8, 9], "conceptu": [3, 7], "concis": [1, 5, 7], "conclud": [2, 9], "conclus": [1, 2, 4], "concret": [1, 2, 4, 5, 6, 8], "condens": 3, "condit": [3, 4, 6, 7, 8, 9], "confid": 3, "configur": 5, "confirm": [1, 2, 3, 4], "confus": [3, 4, 6, 7, 8], "congr": 2, "congratul": [1, 2, 4], "congruent": 4, "conj": 5, "conj_im": 5, "conj_r": 5, "conjug": [5, 7], "conjugate_on": 7, "conjunct": [1, 6, 12], "connect": [1, 3, 5, 8], "consequ": 7, "consid": [1, 2, 3, 4, 5, 6, 7, 8, 9, 10], "consist": [1, 3, 5, 6, 7, 8, 9], "constant": [1, 2, 7, 10], "constantli": 7, "constitut": 1, "constraint": [5, 8], "construct": [0, 2, 3, 4, 5, 6, 7, 8], "constructor": [1, 2, 3, 4, 5, 6], "consult": 5, "cont": 9, "contain": [0, 2, 3, 4, 5, 6, 7, 8, 9, 10], "contdiff": 9, "contdiff_iff_continuous_differenti": 9, "contdiffat": 9, "contend": 4, "content": [0, 1, 2, 4, 8], "context": [1, 2, 4, 5, 6, 7, 8, 9, 10], "contextu": 5, "continu": [0, 1, 4, 5, 6, 10], "continuous_def": 8, "continuous_dist": 8, "continuous_fst": 8, "continuous_id": [6, 8], "continuous_iff": 8, "continuous_iff_coinduced_l": 8, "continuous_linear_map": 9, "continuous_pow": 8, "continuous_snd": 8, "continuousat": [8, 10], "continuousat_extend": 8, "continuousat_iff": 8, "continuouslinearmap": 9, "continuouson": [8, 9], "continuum": 2, "contort": 7, "contract": 2, "contradict": [2, 3, 4], "contradictori": 2, "contrapos": [2, 3, 4], "contrari": 2, "contrast": [2, 3, 5, 6, 8], "contravari": 8, "contribut": [0, 3], "control": 2, "conveni": [1, 2, 3, 5, 6, 7, 8], "convent": [1, 5, 7, 10], "convention": 8, "converg": [10, 12], "convergesto": 2, "convergesto_add": 2, "convergesto_const": 2, "convergesto_mul": 2, "convergesto_mul_const": 2, "convergesto_uniqu": 2, "convers": [0, 2, 4, 7, 8], "convert": [2, 4, 7], "convinc": 5, "convolut": 10, "coordin": 7, "copi": [0, 3, 4, 6, 7, 8], "coprim": [4, 7], "coprime_mn": 4, "core": [0, 4, 5], "corner": 7, "corollari": 7, "correct": [0, 1, 7], "correctli": 3, "correspond": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9], "could": [0, 1, 2, 4, 5, 6, 7, 8], "count": 7, "count_factors_mul_of_po": 4, "countabl": 10, "counterexampl": [2, 9], "counterpart": 5, "coupl": [1, 2, 6, 8], "cours": [1, 2, 4, 6, 7, 8, 9, 10], "covari": 8, "cover": [0, 1, 3, 6, 7, 8, 9], "creat": [0, 1, 4, 6], "creation": 7, "creativ": 5, "criterion": 8, "crucial": [7, 8], "crude": 4, "cryptic": 2, "ct": 2, "ctrl": [0, 1, 2, 4, 5], "cube": 7, "cue": 5, "cup": 3, "curiou": [1, 6], "curli": [1, 2], "current": [1, 2, 5, 6], "curri": 1, "cursor": [0, 1, 2], "curv": 0, "custom": 5, "cut": 4, "cycl": 7, "cyclic": 7, "czubin": 0, "d": [1, 2, 4, 5, 7, 9], "dai": 3, "danger": [4, 5], "data": [1, 2, 4, 5, 6, 8], "databas": [3, 4, 6, 8], "datatyp": 4, "de": 0, "deal": [1, 2, 3, 4, 5, 8], "dealt": 2, "decid": [4, 7, 8], "decidableeq": 4, "decidablepr": 4, "decis": [4, 7], "declar": [0, 1, 4, 5, 6, 7], "decompos": [0, 3], "decreas": [1, 5], "dedekind": 3, "deduc": [6, 7, 8], "def": [0, 2, 3, 4, 5, 6, 7, 8], "default": [1, 2, 3, 4, 5, 6, 7, 9], "defect": [2, 6, 8], "defin": [1, 2, 3, 4, 6, 7, 8, 9, 10, 12], "definit": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10], "definition": [1, 4, 5, 6, 8], "degre": 7, "degree_mul": 7, "delet": [1, 2, 3], "delic": 3, "delimit": 1, "demonstr": [6, 8], "deni": 0, "denomin": [2, 4, 5], "denot": [1, 3, 4, 6, 7, 8], "dens": 8, "denseinduc": 8, "densiti": 8, "depend": [0, 2, 3, 4, 5, 6, 7, 8], "deriv": [1, 2, 4, 7, 9, 10], "deriv_add": 9, "deriv_eq_zero": 9, "deriv_zero_of_not_differentiableat": 9, "descend": [6, 7], "describ": [0, 1, 2, 3, 4, 5, 6, 8], "descript": [0, 1, 2, 4, 8], "deserv": 4, "design": [0, 1, 2, 3, 5, 7, 8], "desir": [1, 3, 6, 7, 8], "destruct": 2, "destructur": 6, "det": 10, "detail": [1, 2, 3, 4, 5, 6, 7], "detect": 2, "determin": [1, 5, 7, 8], "develop": [0, 1, 4, 7, 10], "devic": 6, "devot": 8, "dfun": 6, "dfunlik": 6, "di": [2, 5], "dia": 6, "dia_assoc": 6, "dia_inv": 6, "dia_on": 6, "diagram": 3, "diamond": 6, "diaoneclass\u2081": 6, "dia\u2081": 6, "dictionari": 1, "did": [0, 2, 6, 8], "dif_neg": 3, "dif_po": 3, "diff_eq": 3, "differ": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9], "differenti": [10, 12], "differentiableat": 9, "differentiableon": 9, "difficult": [2, 6], "digress": 8, "dimension": [9, 10], "direct": [1, 2, 3, 6, 7, 8, 9], "directli": [1, 2, 4, 5, 6, 8], "discret": 5, "discuss": [1, 2, 4, 5, 6, 7, 8, 9], "dishwash": 0, "disjoint": [3, 7, 10], "disjunct": [1, 3, 12], "dispens": 4, "displai": [0, 1, 2, 6], "dispos": 2, "dist": [1, 8], "dist_comm": [1, 8], "dist_eq_zero": 8, "dist_le_range_sum_dist": 8, "dist_nonneg": [1, 8], "dist_self": 1, "dist_triangl": [1, 8], "distanc": [1, 2, 8, 9], "distinct": [0, 2, 3, 4, 5, 8], "distinguish": [0, 5, 6, 7, 8, 9], "distract": 6, "distriblattic": 1, "distribut": [1, 4, 5, 6], "div": 5, "div_def": 5, "div_dvd_of_dvd": 4, "div_eq_mul_inv": 5, "div_eq_of_eq_mul_right": 4, "div_lt_self": 4, "div_nonneg": 5, "div_po": 2, "divab": 2, "divac": 2, "divbc": 2, "dive": 0, "divid": [1, 2, 4, 5, 7], "divis": [1, 2, 4, 5, 6], "divisor": [1, 2, 4, 5, 7], "do": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10], "doc": 0, "document": [0, 1, 3, 4, 6], "doe": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9], "doesn": [1, 2, 7, 8], "domain": [1, 2, 3, 4, 5, 7, 8], "domin": 10, "don": [0, 1, 2, 3, 4, 5, 6, 7, 8, 10], "done": [0, 2, 3, 4, 6, 7, 8], "doorn": 0, "dot": [1, 7, 8], "doubl": [2, 3], "doubli": 7, "doubt": 0, "down": [0, 3, 4, 6, 8], "downsid": 7, "dozen": 3, "draw": [1, 5, 6], "drop": 2, "dsimp": [2, 3, 5, 7], "dual": [5, 8], "dualli": 8, "duca": 0, "due": [1, 6], "duplic": 6, "dvd": 1, "dvd_add_iff_left": 4, "dvd_antisymm": 1, "dvd_fac": 4, "dvd_factori": 4, "dvd_gcd": 4, "dvd_gcd_iff": 2, "dvd_iff_exists_eq_mul_left": 4, "dvd_mul": 4, "dvd_mul_left": 1, "dvd_mul_of_dvd_left": 1, "dvd_mul_of_dvd_right": 4, "dvd_mul_right": [2, 4], "dvd_of_dvd_pow": 4, "dvd_prod_of_mem": 4, "dvd_sub": 4, "dvd_tran": 1, "dwell": 3, "e": [1, 2, 3, 4, 5, 6, 7, 8, 9, 10], "each": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9], "earlier": [1, 7], "easi": [0, 4, 5, 6, 7, 8], "easier": [0, 1, 3, 4, 6, 8], "easiest": [2, 4], "easili": [1, 4, 5, 6, 7], "ebner": 0, "edit": 0, "editor": [0, 1], "ediv_add_emod": 5, "ediv_lt_of_lt_mul": 5, "ediv_mul_l": 5, "ef": 2, "effect": [1, 3, 6, 8], "effici": [5, 7, 8], "effort": [1, 4], "eg": 2, "eight": 8, "either": [1, 2, 3, 5, 6, 8], "elabor": 8, "ele1": 2, "eleg": 5, "element": [1, 2, 3, 4, 5, 6, 7, 8, 9, 10], "elementari": [0, 3, 5, 7, 8, 12], "elim": 2, "elim_finite_subcov": 8, "elimin": 1, "els": [2, 3, 4], "em": [2, 3], "emanuel": 0, "emb": 5, "embark": 6, "embed": 7, "embodi": 7, "emetricspac": 8, "emod_lt": 5, "emod_lt_of_po": 5, "emod_nonneg": 5, "emphas": [6, 7], "emphasi": [0, 6], "empti": [3, 4, 5, 7, 8, 10], "enabl": [2, 3, 4, 5], "enat": 4, "encapsul": [3, 5, 9], "encod": [7, 10], "encount": [4, 6], "encourag": [0, 1, 2, 3, 4, 5], "end": [1, 2, 3, 4, 5, 6, 7, 8, 9], "endomorph": 7, "endow": [6, 7], "enforc": 7, "engin": 4, "enjoi": [2, 3, 4, 8], "ennreal": 10, "enough": [0, 1, 2, 3, 4, 6, 7, 8], "ensur": [6, 7, 8], "enter": [0, 1, 2, 3, 7, 8], "enthusiast": 0, "entir": [1, 3, 5, 8, 9], "entourag": 8, "entri": [0, 5, 7], "enumer": [1, 2], "epo": 2, "eq": 5, "eq1": 4, "eq2": 4, "eq_bot_iff_card": 7, "eq_bot_iff_foral": 7, "eq_empty_or_nonempti": 8, "eq_neg_of_add_eq_zero": 1, "eq_of_dvd_of_prim": 4, "eq_of_mul_eq_mul_right": 7, "eq_one_or_self_of_dvd": 4, "eq_top_iff": 7, "eq_two_or_odd": 3, "eq_univ": 3, "eq_univ_of_foral": 3, "eq_zero_iff_mem": 7, "eq_zero_or_eq_zero_of_mul_eq_zero": 2, "equal": [1, 2, 3, 4, 5, 6, 7, 8, 10], "equat": [1, 2, 3, 4, 5], "equilater": 5, "equip": [1, 3, 5, 6, 7, 8, 9, 10], "equiv": [5, 7], "equival": [1, 2, 3, 4, 5, 7, 8, 9, 10], "eras": 4, "eric": 0, "error": [1, 2, 3, 6], "erw": 2, "especi": [1, 2, 5, 6, 7, 8], "essenti": [2, 3, 5, 7, 8], "establish": [0, 1, 2, 3, 4, 5], "eta": 5, "etc": 8, "euclidean": 5, "euclideandomain": 5, "eval": [0, 7], "evalu": 7, "eval\u2082": 7, "even": [0, 1, 2, 3, 4, 5, 6, 8, 9, 10], "even_iff": 3, "even_of_even_sqr": 4, "eventu": [2, 3, 8], "eventually_eventually_nhd": 8, "eventually_left_invers": 9, "eventually_of_foral": 8, "eventually_right_invers": 9, "eventuallyeq": 8, "ever": [0, 8], "everi": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10], "everyth": [1, 2, 6, 8], "everywher": [2, 3, 6, 8, 10], "evid": 5, "evolv": 1, "ex": [0, 2], "ex_finset_of_bound": 4, "exact": [1, 2, 3, 4, 5, 7, 8], "exactli": [1, 2, 3, 5, 6, 7, 8], "exampl": [0, 2, 3, 4, 5, 6, 7, 8, 9, 10, 12], "except": [1, 2, 5, 7], "exclam": 8, "exclud": [2, 4], "exercis": [0, 1, 2, 3, 5, 6, 7, 8, 9], "exfalso": 2, "exhibit": [2, 8], "exist": [1, 2, 3, 6, 7, 8], "existenti": [3, 7, 12], "exists_abs_le_of_convergesto": 2, "exists_deriv_eq_slop": 9, "exists_deriv_eq_zero": 9, "exists_forall_g": 8, "exists_forall_l": 8, "exists_infinite_prim": 3, "exists_one_lt_norm": 9, "exists_prime_and_dvd": 3, "exists_prime_factor": 4, "exists_prime_factor_mod_4_eq_3": 4, "exists_subgroup_card_pow_prim": 7, "exot": [7, 8], "exp": [1, 3], "exp_le_exp": 1, "exp_log": 3, "exp_lt_exp": 1, "exp_po": [1, 3], "expand": [1, 2, 3, 4, 5, 6], "expect": [1, 2, 3, 4, 5, 6, 7, 8], "experi": [0, 1, 8], "explain": [1, 2, 3, 4, 5, 6, 7, 8, 10], "explan": [0, 7, 8], "explicit": [1, 2, 5, 6, 8], "explicitli": [1, 2, 3, 5, 6, 7, 8, 9], "explor": [4, 8], "expon": 1, "exponenti": 4, "export": 6, "expos": [2, 8], "express": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10], "ext": [2, 3, 4, 5, 6, 7], "ext_iff": 5, "extend": [1, 3, 4, 5, 6, 8, 10], "extens": [0, 1, 6, 8, 9], "extension": [3, 5], "extra": [1, 2, 3, 5, 6, 7, 8], "extract": [2, 8], "extrem": [0, 6, 8], "f": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10], "f_": 8, "f_cont": 8, "f_le": 8, "f_ne": 8, "fac": 4, "fac_po": 4, "face": [5, 6, 8], "facilit": [2, 8], "fact": [0, 2, 3, 4, 5, 6, 7, 8, 9, 10, 12], "factor": [4, 5, 7], "factori": 4, "factorial_po": 4, "factorization_mul": 4, "factorization_pow": 4, "fail": [1, 2, 4, 5, 6, 8, 10], "failur": 6, "fairli": 2, "fals": [1, 2, 3, 4, 6], "falso": 2, "famili": [7, 8, 9], "familiar": [0, 1, 4, 5, 8, 9], "famou": [3, 7], "far": [2, 3, 6, 8], "favor": [1, 5], "fderiv": 9, "fear": 6, "feat": 4, "featur": [0, 2, 4, 7], "feed": 7, "feedback": 0, "feel": [0, 1, 2, 6, 8], "fermatlasttheorem": 0, "fetch": 0, "few": [1, 2, 3, 4, 8], "field": [0, 1, 5, 6, 7, 9], "field_simp": [2, 5], "figur": [0, 1, 2, 5], "file": [0, 1, 4, 5, 6, 7, 8], "fill": [2, 3, 4, 5], "filter": [4, 9, 10, 12], "filter_upward": 8, "filteri": 8, "fin": [5, 7, 10], "final": [1, 2, 3, 5, 7, 8, 10], "finaliso": 7, "find": [0, 1, 2, 4, 5, 6, 8], "finicki": 1, "finish": [1, 2, 3, 4, 7], "finit": [1, 3, 4, 5, 7, 8, 9, 10], "finitedimension": [9, 10], "finset": [4, 5, 7, 8], "fintyp": [7, 8], "first": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10], "firstcountabletopologi": 8, "fix": [4, 6, 7, 8], "fixm": 5, "flag": [2, 3], "flexibl": 8, "flori": 0, "fn_ub_add": 2, "fneven": 2, "fnhaslb": 2, "fnhasub": 2, "fnlb": 2, "fnodd": 2, "fnub": 2, "fnub_add": 2, "fnuba": 2, "focu": [0, 1, 7, 8, 10], "focus": 8, "folder": 0, "follow": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10], "font": 7, "foo": [1, 5], "forc": [1, 2, 3, 7], "foreshadow": 1, "forewarn": 0, "forget": 6, "form": [0, 1, 2, 3, 4, 5, 6, 7, 8, 10], "formal": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9], "format": 1, "former": 5, "formul": [4, 7, 8], "formula": [7, 10], "forth": 5, "fortiori": 8, "fortun": 3, "forward": [1, 2, 5, 7, 8], "found": [1, 5, 7, 9], "foundat": [2, 3, 4, 5, 7], "four": [2, 5], "fourth": [1, 2], "frac": 5, "fraction": 4, "fraenkel": 2, "framework": 0, "frasa": 0, "free": [0, 1, 7, 8], "freegroup": 7, "freeli": 4, "frequent": 8, "friend": [2, 5], "friendli": 7, "from": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10], "front": 2, "frustrat": [0, 6], "fr\u00e9chet": 9, "fst": [5, 8], "fubini": 10, "full": [1, 2, 3, 4, 5, 6, 7, 8], "fulli": [3, 7, 8], "fun": [0, 2, 3, 4, 5, 6, 7, 8, 9, 10], "function": [1, 2, 4, 5, 6, 7, 9, 10, 12], "functori": 8, "fundament": [0, 4, 5, 6, 10], "funni": 8, "further": [1, 8], "furthermor": 7, "g": [1, 2, 3, 5, 6, 7, 8, 9, 10], "g_": 8, "g_1": 5, "g_2": 5, "g_3": 5, "gabriel": 0, "gadget": [2, 8], "gain": 6, "galoi": [3, 5, 8], "game": [0, 6], "gauss": 7, "gaussian": [2, 7, 12], "gaussianint": 5, "gaussint": 5, "gave": [7, 8], "gcd": [1, 2, 4], "gcd_zero_left": 1, "gcd_zero_right": 1, "gcongr": 5, "ge": [0, 2, 5], "gener": [1, 2, 3, 4, 5, 6, 7, 8, 9, 10], "genuin": 2, "geometr": 8, "geometri": 7, "get": [1, 2, 3, 4, 6, 7, 8, 9, 12], "gin": 0, "giovanni": 0, "git": 0, "github": [0, 1], "gitpod": 0, "give": [1, 2, 3, 4, 6, 7, 8, 10], "given": [0, 1, 2, 3, 4, 5, 6, 7, 8], "glb": 1, "global": [7, 8], "go": [0, 1, 2, 3, 4, 6, 8], "goal": [0, 1, 2, 3, 4, 5, 8], "goe": [3, 4, 5, 6, 8], "good": [1, 2, 3, 4, 5, 6, 7, 8], "gorbachev": 0, "got": 6, "govern": [1, 5], "gradual": [6, 8], "graph": 5, "grate": [0, 5], "great": [1, 5], "greater": [0, 1, 2, 3, 4, 8], "greatest": [1, 5, 8], "greef": 0, "greek": [1, 4], "group": [0, 1, 2, 3, 4, 5, 6, 8, 9, 12], "groupact": 7, "groupcat": 5, "groupequivquotientprodsubgroup": 7, "grouptheori": 5, "group\u2081": [5, 6], "group\u2081cat": 5, "group\u2082": 5, "group\u2083": 6, "grow": [0, 6, 7], "grp": 5, "guai": 0, "guarante": [0, 3, 5], "guess": [1, 2, 3, 4, 5], "guilherm": 0, "gya": 3, "g\u2080": 7, "g\u2081": 7, "g\u2082": 7, "h": [1, 2, 3, 4, 5, 6, 7, 8, 9, 10], "h0": 4, "h1": [1, 2, 3, 4, 5], "h2": [1, 2, 3, 5], "h3": 1, "h_def": 3, "h_inj": 10, "ha": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10], "hab": 9, "habit": 6, "hac": 6, "hack": 3, "had": [1, 6], "hal": 6, "half": [3, 7], "hand": [1, 2, 3, 4, 5, 6, 8], "handi": 4, "handl": [1, 3, 4, 6, 7], "hanson": 0, "happen": [1, 6, 8], "happi": 0, "hard": [0, 1, 3, 5, 6, 7], "harder": [2, 5], "harm": 3, "hasbasi": 8, "hasderivat": [9, 10], "hasderivat_sin": 9, "hasfderivat": 9, "hasfderivatfilt": 9, "hasfderivatfilter_iff_islittleo": 9, "hasfderivwithinat": [9, 10], "hasinvgroup\u2082": 5, "haskel": 1, "hasmulgroup\u2082": 5, "hasonegroup\u2082": 5, "hasquoti": 6, "hasstrictfderivat": 9, "hausdorff": 8, "have": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10], "haven": [0, 2, 6, 8], "hb": [2, 8], "hba": 6, "hball": 8, "hbound": 10, "hc": 9, "hd": 8, "hdi": 10, "hdvd": 7, "he": 7, "headach": 4, "headi": 5, "heart": [4, 7], "heather": 5, "heaven": 5, "heavier": 6, "heavili": 8, "hello": 0, "help": [0, 1, 2, 3, 4, 5, 6, 8], "helper": 1, "henc": [0, 2, 3, 4, 5, 6, 8, 9], "here": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10], "hesit": 4, "hf": [3, 7, 8, 9, 10], "hfa": 2, "hfc": 9, "hff": 9, "hfi": 9, "hfx": 8, "hg": [3, 8, 9, 10], "hgb": 2, "hi": 7, "hidden": 2, "hide": [6, 7, 8], "hierarchi": [5, 7, 12], "high": [2, 7], "higher": 6, "highlight": [0, 2], "hint": [0, 1, 2, 10], "histor": [1, 7], "hit": [0, 1], "hk": [0, 9], "hle": 8, "hlim": 10, "hm": 9, "hmea": 10, "hmn": 0, "hmp": 9, "hn": [3, 4, 8, 9], "hna": 2, "hnb": 2, "hne": 8, "ho": 8, "hold": [1, 2, 3, 4, 5, 7, 8, 10], "home": [4, 5], "homomorph": 7, "hood": [3, 5], "hope": [0, 1], "hopelessli": 6, "hoskinson": 0, "hover": [0, 1, 2, 3, 4, 5], "how": [0, 1, 2, 3, 4, 5, 6, 7, 8, 10], "howev": [1, 2, 5, 6, 7, 8, 9], "hp": [7, 8], "hpo": 8, "hq": [7, 8], "hr": 8, "hst": 7, "hsu": 8, "ht": 2, "html": 0, "http": 6, "hu": [8, 9], "huge": 6, "huisinga": 0, "hum": 8, "human": 1, "hunt": 6, "hunter": 0, "huo": 8, "hurdl": 6, "hurt": 2, "hux": 8, "hw": 6, "hx": [2, 3, 5, 6, 7, 9], "hxeq": 3, "hy": [5, 6, 7], "hyp": 1, "hypothes": [1, 2, 3, 4, 5], "hypothesi": [0, 1, 2, 3, 4], "hz": [5, 6], "h\u03b5": 9, "h\u2080": [1, 2, 3, 4, 8], "h\u2081": [1, 2, 3, 4], "h\u2082": [1, 3, 4], "h\u2083": [1, 3], "i": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10], "icc": [8, 9], "ici": 8, "id": [4, 6, 8, 9], "idea": [1, 2, 3, 5, 6, 8], "ident": [3, 4, 5, 6, 7, 8, 12], "identifi": [1, 2, 4], "ie": [6, 8], "if_neg": 3, "if_po": 3, "iff": [1, 3, 7, 8, 9, 10, 12], "ignor": [0, 5, 7, 8], "ih": 4, "iinf_insert": 7, "iinter": 10, "il": 4, "illustr": [1, 2, 3, 4, 5, 7], "im": 5, "imag": [3, 4, 6, 7, 8], "image_subset_iff": 3, "imagin": 1, "imaginari": 5, "immedi": [2, 3, 5, 6], "implement": [2, 5, 6, 7, 9], "impli": [1, 2, 3, 4, 5, 8], "implic": [1, 8, 12], "implicit": [1, 2, 5, 6, 7, 8, 9], "implicitli": [1, 2], "import": [1, 2, 3, 4, 5, 6, 7, 8, 10], "importantli": [6, 7], "imposs": 1, "impress": 0, "improv": [3, 4], "incl": 8, "includ": [0, 1, 2, 3, 4, 6, 7, 8, 9], "inclus": [1, 3, 7, 8], "inconsist": 1, "inconveni": 9, "incorpor": 6, "increas": 1, "increment": [0, 1], "inde": [1, 5, 6, 7, 8, 9], "indefinit": 4, "indent": 1, "independ": [2, 3, 5], "indetermin": 7, "index": [3, 6, 7, 8], "index_eq_card": 7, "index_mul_card": 7, "indic": [1, 2, 3, 5, 6], "indirect": 6, "indirectli": 1, "individu": 1, "induc": 8, "induced_compos": 8, "induct": [7, 8, 12], "induction_on": 4, "inequ": [1, 2, 6, 8], "inf": [1, 6, 8], "inf_assoc": 1, "inf_bot_of_coprim": 7, "inf_comm": [1, 7], "inf_le_left": [1, 8], "inf_le_right": 1, "inf_sup_left": 1, "inf_sup_right": 1, "inf_sup_self": 1, "infer": [1, 2, 3, 5, 6, 7], "infer_inst": [9, 10], "inferenti": 0, "inferinst": 7, "inferr": 6, "infimum": [1, 6, 7, 8, 10], "infin": [4, 8, 10], "infinit": [3, 8, 12], "infix": [1, 6], "infixl": 6, "infixr": 6, "inform": [0, 1, 2, 3, 5, 6, 8], "infoview": [1, 6], "infrastructur": 0, "infti": 9, "ingredi": [3, 5, 8, 9], "inhabit": [3, 5, 8], "inherit": [5, 6, 7], "inherit_doc": 6, "inj": 4, "inject": [2, 3, 4, 6, 7, 8], "injective_lift_iff": 7, "injf": [2, 3], "injg": 2, "injon": [3, 10], "inl": [2, 3], "inner": 3, "input": [1, 3, 8], "inr": [2, 3], "inria": 6, "inscrut": [2, 3], "insert": [0, 2, 4, 5, 7, 8, 9], "insid": [0, 1, 2, 3, 7], "insight": 2, "insist": [1, 6], "inspect": 1, "inspir": 2, "inst": 6, "inst_1": 6, "instal": [0, 6], "instanc": [1, 2, 3, 4, 5, 6, 7, 8, 9], "instanti": [2, 5, 6, 8], "instcommr": 5, "instead": [0, 1, 2, 3, 4, 5, 6, 7, 8], "instruct": [0, 1, 2, 8], "int": [5, 6, 7], "intact": 0, "integ": [1, 2, 4, 6, 7, 12], "integr": [2, 9, 12], "integral_add": 10, "integral_eq_sub_of_hasderivat": 10, "integral_hasstrictderivat_right": 10, "integral_id": 10, "integral_image_eq_integral_abs_det_fderiv_smul": 10, "integral_one_div": 10, "integral_prod": 10, "intend": [0, 1, 2, 5], "inter_def": 3, "inter_set": 8, "interact": [0, 5, 6, 7, 10], "interchang": 1, "interconnect": 5, "interest": [1, 2, 3, 5, 6, 8], "interestingli": [5, 7, 9], "interfac": 5, "interior": [5, 9], "interior_iinter_subset": 9, "interior_subset": 9, "intermedi": [1, 6, 8], "intern": [2, 5, 7], "interpret": [0, 1, 4, 5, 7, 8], "intersect": [1, 3, 5, 6, 7, 8, 10], "interv": [4, 8, 10], "interval_cas": 4, "intervalintegr": 10, "intro": [0, 1, 2, 3, 4, 5, 6, 7, 8], "introduc": [0, 1, 2, 3, 4, 8, 10], "introduct": [1, 2, 7, 8, 12], "introductori": 9, "intuit": [3, 8], "inv": [5, 6], "inv_dia": 6, "inv_eq_of_dia": 6, "inv_eq_of_mul": 6, "inv_mem": 7, "inv_mul": 6, "invari": 10, "invers": [1, 3, 5, 6, 7, 9, 10], "inverse_spec": 3, "invert": [6, 7], "invest": 5, "invfun": [3, 5], "invfun_eq": 3, "invisibli": [5, 6], "invok": [0, 1, 8], "involv": [1, 2, 4, 5, 6, 7, 8], "inv\u2081": 6, "inward": 2, "ioo": [8, 9], "ipo": 4, "irrat": 12, "irration": 4, "irreduc": [4, 5], "irreducible_iff_prim": 5, "irreflex": 2, "is_addit": 5, "isaddhaarmeasur": 10, "isaiah": 0, "isalgclos": 7, "isbigo_iff_isbigowith": 9, "isbigowith": 9, "isbigowith_iff": 9, "isclos": [8, 9], "isclosed_l": [8, 9], "iscompact": 8, "iscompact_icc": 8, "iscompact_univ": 8, "iscoprim": 7, "iscoprime_iff_add": 7, "iscoprime_iff_codisjoint": 7, "iscoprime_iff_exist": 7, "iscoprime_iff_sup_eq": 7, "iscoprime_inf": 7, "iscycl": 7, "isdomain": [2, 7], "iseqv": 6, "islinear": 5, "islittleo_iff_forall_isbigowith": 9, "islocalmin": 9, "ismonoidhom\u2081": 6, "ismonoidhom\u2082": 6, "isn": [0, 2, 3, 4, 6], "isomorph": [5, 7, 9], "isopen": 8, "isopen_compl_iff": 8, "isopen_empti": 8, "isopen_iff": 8, "isopen_iinter_of_finit": 8, "isopen_iunion": 8, "isopen_univ": 8, "iso\u2081": 7, "iso\u2082": 7, "isroot": 7, "issu": [1, 4, 5, 6, 8], "issubgroup": 7, "isunit": 7, "item": 8, "iter": 9, "iteratedfderiv": 9, "its": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10], "itself": [0, 2, 3, 5, 6, 7, 8, 9], "iunion": 10, "j": [3, 7], "jimmi": 0, "job": 1, "johan": 0, "john": 0, "join": [0, 1, 5], "journei": 8, "juggl": 6, "julian": 0, "jump": [1, 4, 5, 8], "just": [0, 1, 2, 3, 4, 5, 6, 7, 8], "justif": [1, 2], "justifi": [0, 1, 2, 8], "k": [0, 2, 4, 5, 7, 8, 9], "keep": [1, 5, 6, 7], "kei": [1, 4, 5, 7, 8], "keith": 0, "ker": 7, "ker_eq_bot_iff": 7, "ker_pi_quotient_mk": 7, "ker_restrict": 7, "kernel": 7, "keyboard": 1, "keyword": [1, 2, 4, 5], "kind": [0, 1, 6, 8], "knew": 8, "know": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9], "known": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9], "k\u00fclshammer": 0, "l": [0, 1, 9, 10], "label": [1, 2], "lagrang": 7, "lake": 0, "lambda": [2, 5], "lambda_l": 5, "lambda_nonneg": 5, "languag": [0, 1, 2, 3], "larg": [0, 6, 8], "larger": [1, 8], "last": [1, 2, 3, 4, 5, 6, 7, 8], "later": [0, 1, 2, 4, 5, 6, 7, 8], "latter": [5, 7, 8], "lattic": [1, 5, 6, 7, 8], "law": [1, 7], "layer": [6, 8], "lbf": 2, "lbg": 2, "lcm": 1, "lcm_zero_left": 1, "lcm_zero_right": 1, "ldot": [2, 3, 4], "le": [1, 5, 6], "le_abs_self": 2, "le_antisymm": [1, 2], "le_iff_exists_add": 8, "le_inf": 1, "le_inf_iff": 8, "le_min": 1, "le_mul_of_one_le_right": 5, "le_of_dvd": 4, "le_of_l": 6, "le_of_max_le_left": 2, "le_of_max_le_right": 2, "le_of_mul_le_mul_right": 5, "le_of_not_gt": 2, "le_op_norm": 9, "le_or_gt": 2, "le_principal_iff": 8, "le_refl": [1, 2], "le_sup": 4, "le_sup_left": 1, "le_sup_right": 1, "le_tran": [1, 2], "lead": [1, 2, 4, 5, 6, 7, 8], "leader": 1, "lean": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9], "lean4": 1, "learn": [0, 1, 4, 5], "least": [1, 5, 6, 8], "leav": [0, 1, 2, 3, 5, 6, 7], "lebesgu": 10, "led": 6, "left": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10], "left_distrib": [5, 6], "left_inv": 5, "left_inv_eq_right_inv": 6, "left_inv_eq_right_inv\u2081": 6, "left_neg_eq_right_neg": 6, "leftinvers": 3, "leftinverse_invfun": 3, "legal": 1, "lemma": [2, 4, 5, 6, 7, 8, 9, 10, 12], "less": [1, 2, 3, 4, 5, 6, 7, 8], "let": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10], "letter": [1, 5, 9], "level": [1, 2, 6], "leverag": 8, "le\u2081": 6, "librari": [0, 1, 2, 3, 4, 5, 7, 8, 9], "life": [0, 2], "lift": 7, "light": 5, "like": [0, 1, 2, 3, 4, 5, 6, 7, 8], "lim_": 8, "limit": [2, 6, 8], "linarith": [1, 2, 4, 5], "line": [0, 1, 2, 3, 4, 6, 7], "linear": [1, 2, 5, 7, 8], "linear_combin": 7, "linearord": 2, "linearorderedr": 5, "liner": 0, "linf": 5, "link": [5, 6], "list": [1, 2, 3, 4, 5], "littl": [1, 2, 8, 9], "liu": 0, "live": [0, 5], "ll": [0, 2, 4, 6, 8], "local": [1, 2, 6, 8, 9], "localinvers": 9, "log": [1, 3, 10], "log_le_log": 1, "log_lt_log": 1, "logic": [0, 1, 3, 4, 5, 7, 12], "logician": 1, "long": [1, 2, 3, 5, 6, 7, 9], "longer": [0, 4, 5], "look": [1, 2, 3, 4, 6, 7, 8], "loop": 4, "loss": 4, "lot": [0, 1, 3, 5, 6, 7, 8], "loud": 1, "lower": [1, 2, 4], "lowest": 4, "lr": 1, "lt_ab": 2, "lt_asymm": 2, "lt_iff_le_and_n": 1, "lt_iff_le_not_l": 2, "lt_irrefl": [1, 2], "lt_of_le_of_lt": [1, 2], "lt_of_lt_of_l": 1, "lt_of_not_g": 2, "lt_succ_iff": 4, "lt_succ_of_l": 4, "lt_tran": [1, 2], "lt_trichotomi": 2, "lt\u2081": 6, "lu": 0, "lub": 1, "m": [0, 1, 2, 4, 6, 7, 8, 9], "m_iunion": 10, "mac": [1, 2], "macbeth": 5, "machineri": [5, 6, 8], "maco": 0, "made": [1, 2, 3, 5, 8], "magic": [2, 5, 6], "mai": [0, 1, 2, 3, 5, 6, 7, 8, 9], "main": [2, 6, 8, 9], "mainli": 7, "maintain": 1, "make": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9], "manag": [0, 1, 4, 5, 8], "mani": [1, 2, 3, 5, 6, 7, 8, 9, 10, 12], "manifest": [1, 8], "manipul": [2, 5, 7, 8], "manner": [2, 5], "manual": [0, 3, 4], "map": [1, 2, 3, 5, 6, 7, 8], "map_add": [6, 7, 9], "map_eq": 8, "map_inv": 7, "map_inv_of_inv": 6, "map_le_iff_le_comap": 8, "map_map": 8, "map_mono": 8, "map_mul": [6, 7], "map_on": [6, 7], "map_pow": 7, "map_smul": 9, "map_zero": [6, 7], "mapsto": [1, 5], "map\u2082": 6, "marc": 0, "mario": 0, "mark": [0, 1, 2, 6, 8], "marker": 2, "marriag": 5, "martin": 0, "mascellani": 0, "mass": 10, "master": [0, 1, 4], "match": [1, 2, 5], "mathbb": [3, 4, 5, 7], "mathcal": [5, 9], "mathemat": [0, 1, 2, 3, 4, 5, 6, 7, 8], "mathematician": [4, 8], "mathematics_in_lean": 0, "mathfrak": 7, "mathieu": 0, "mathlib": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10], "matric": [1, 5, 7], "matter": [1, 2], "matthew": 0, "mauricio": 0, "max": [1, 2, 6, 8, 10], "maxim": 7, "maximum": [2, 4, 8], "mayb": 6, "mcdowel": 0, "mdvdn": 4, "mean": [1, 2, 3, 4, 5, 6, 7, 8, 9, 10], "meaningless": 2, "meant": [0, 2, 6], "meanwhil": [1, 4], "measur": [0, 5, 8, 9, 12], "measurableset": 10, "measurablespac": 10, "measure_eq_iinf": 10, "measure_iunion_l": 10, "measuretheori": 10, "mechan": [1, 2, 5], "mediat": 4, "meet": [1, 2, 3, 5], "mem": 3, "mem_": 4, "mem_ball_self": 8, "mem_bot": 7, "mem_closedball_self": 8, "mem_closure_iff": 8, "mem_closure_iff_clusterpt": 8, "mem_closure_iff_nhds_basi": 8, "mem_closure_iff_seq_limit": 8, "mem_closure_of_tendsto": 8, "mem_comap": 7, "mem_diff": 3, "mem_eras": 4, "mem_filt": 4, "mem_iff": 8, "mem_iint": 3, "mem_iinter\u2082": 3, "mem_image_of_mem": 3, "mem_insert": 4, "mem_insert_of_mem": 7, "mem_insert_self": 7, "mem_int": 4, "mem_inter_iff": 3, "mem_iunion": 3, "mem_iunion\u2082": 3, "mem_ker": 7, "mem_map": 7, "mem_nhds_iff": 8, "mem_of_dvd_prod_prim": 4, "mem_of_tendsto": 8, "mem_rang": 7, "mem_sdiff": 4, "mem_setof": 3, "mem_sup": 7, "mem_union": [3, 4], "member": [3, 8], "membership": [3, 4, 6, 7], "mention": [2, 3, 5, 6, 7, 8], "menu": [0, 1], "meq": 4, "messag": 6, "messi": 5, "messier": 5, "meta": [2, 6], "metavari": 6, "method": [0, 2, 3, 4, 5], "metric": [1, 5, 9, 12], "metricspac": [1, 8, 9], "mf": 2, "mg": 2, "mge2": 4, "mgt2": 4, "mid": 5, "middl": [0, 1, 2, 8], "midpoint": 5, "might": [1, 2, 3, 4, 5, 7], "mil": 0, "min": [1, 2, 8, 10], "min_le_left": 1, "min_le_right": 1, "mind": [1, 2, 5, 6, 7], "mindich": 0, "minfac": 4, "minimum": 8, "minor": [6, 9], "mislead": 7, "miss": [1, 3, 4], "mission": 0, "mk": [5, 6, 7, 8], "mk_surject": 7, "mkofmuleqon": 7, "mkofnhd": 8, "mltn": 4, "mne1": 4, "mnez": 4, "mod": 5, "mod_4_eq_3_or_mod_4_eq_3": 4, "mod_def": 5, "mod_lt": 4, "mode": [1, 2, 5], "model": [3, 8], "modern": [5, 7], "modifi": 6, "modu": 1, "modul": [6, 7], "modular": 1, "module\u2081": 6, "module\u2083": 6, "modulo": [1, 4, 5], "moment": [1, 2, 5], "mono": 8, "monof": 2, "monoid": [2, 3, 4, 6, 12], "monoidhom": 7, "monoidhomclass": 6, "monoidhomclass\u2081": 6, "monoidhomclass\u2082": 6, "monoidhomclass\u2083": 6, "monoidhom\u2081": 6, "monoid\u2081": 6, "monoid\u2082": 6, "monoid\u2083": 6, "monoton": [2, 6, 8], "monro": 0, "monticon": 0, "moral": [0, 5, 7], "more": [0, 2, 3, 4, 5, 6, 7, 8, 9, 12], "moreov": [0, 1, 4, 5, 8], "morphism": [5, 9, 12], "morrison": 0, "most": [1, 2, 3, 4, 5, 6, 7, 8, 10], "mostli": 7, "motiv": 2, "move": [0, 1, 2, 6, 8], "mp": [1, 2, 3, 4, 8], "mpr": [1, 2, 5, 8], "much": [0, 2, 4, 6, 7, 8, 9], "mul": [4, 5, 6, 8], "mul_add": [0, 1, 4, 6], "mul_assoc": [1, 2, 4, 5, 6, 7], "mul_assoc\u2083": 6, "mul_comm": [1, 2, 4, 5, 6, 7], "mul_def": 5, "mul_div_cancel": 4, "mul_div_cancel\u2080": 2, "mul_im": 5, "mul_inv": [6, 7], "mul_inv_cancel_right": 5, "mul_inv_rev": 1, "mul_inv_self": 7, "mul_le_inf": 7, "mul_le_left": 7, "mul_le_mul": 2, "mul_le_right": 7, "mul_left_cancel\u2083": 6, "mul_left_comm": 4, "mul_left_inv": [1, 5], "mul_left_not_lt": 5, "mul_lt_mul_right": 2, "mul_mem": [6, 7], "mul_mod": 4, "mul_mod_mod": 4, "mul_mod_right": 4, "mul_nonneg": 1, "mul_on": [1, 5, 6, 7], "mul_po": [1, 4], "mul_r": 5, "mul_right_cancel\u2083": 6, "mul_right_inj": 4, "mul_right_inv": [1, 5], "mul_smul": [6, 7], "mul_sub": 1, "mul_sum": 5, "mul_zero": [1, 5, 6], "mulact": 7, "mulequiv": 7, "muloneclass": 6, "multilinear": 9, "multipl": [1, 2, 3, 4, 5, 6, 7, 9], "multipli": 5, "multiset": 7, "multivari": 7, "mulzeroclass": 6, "mundan": 2, "must": [1, 5, 6, 8], "mvpolynomi": 7, "my_fil": 0, "my_lemma": 2, "my_lemma2": 2, "my_lemma3": 2, "my_lemma4": 2, "my_squar": 5, "myab": 2, "myelement": 7, "mygroup": 7, "mymap": 7, "mymorph": 7, "mynat": 4, "mynewmorph": 7, "mypoint1": 5, "mypoint2": 5, "mypoint3": 5, "myre": 1, "mysmul": 6, "mysquar": 5, "mysteri": [1, 5, 6], "mz": 4, "m\u02e3": 7, "n": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10], "n_p": 8, "n_q": 8, "na": 2, "naiv": [6, 8], "name": [1, 2, 3, 4, 5, 6, 7, 8, 9], "namespac": [1, 2, 3, 4, 5, 7, 8], "nash": 0, "nat": [0, 1, 2, 3, 4, 5, 7, 8], "natab": 5, "natabs_mul": 5, "natabs_norm_mod_lt": 5, "natabs_of_nonneg": 5, "natal": 0, "natdegre": 7, "natdegree_comp": 7, "natdegree_mul": 7, "natur": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9], "nb": 2, "ne": [4, 5], "nearbi": [1, 4], "nearest": 5, "nebot": 8, "nebot_of_l": 8, "necessari": [0, 2, 4, 5, 7], "necessarili": [1, 10], "need": [0, 1, 2, 3, 4, 5, 6, 7, 8], "neg": [5, 6, 8, 10], "neg_add": 6, "neg_add_cancel_left": 1, "neg_def": 5, "neg_eq_of_add_eq_zero": 1, "neg_im": 5, "neg_le_abs_self": 2, "neg_mem": 7, "neg_neg": 1, "neg_r": 5, "neg_zero": 1, "negat": [1, 5, 12], "negsucc": 6, "neighborhood": 8, "neither": [3, 5, 6], "neq": 4, "nest": [1, 2], "net": 1, "neutral": [6, 7], "never": [0, 6], "new": [0, 1, 2, 3, 4, 5, 6, 7, 8], "newcom": 0, "next": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9], "nge": 2, "nhd": 8, "nhds_basis_bal": 8, "nhds_basis_closedbal": 8, "nhds_basis_ioo_po": 8, "nhds_basis_open": 8, "nhds_induc": 8, "nhds_mkofnhd": 8, "nhds_prod_eq": 8, "nice": [1, 2, 4, 6, 7, 8], "nicer": [5, 7, 8], "nicola": 0, "nineteenth": 3, "nna": 2, "nnc": 2, "nnez": 4, "nnf": 2, "nng": 2, "nnz": 4, "non": [1, 3, 6, 7, 8, 10], "noncomm_r": 1, "noncomput": [3, 5, 7], "nonconstruct": 7, "nondecreas": [2, 4], "nondistribut": 1, "nonempti": [3, 7, 8], "nonempty_interior_of_iunion_of_clos": 9, "nonexist": 2, "nonneg": [1, 5], "nonneg_of_mul_nonneg_left": 1, "nontrivi": [2, 3, 4, 5, 8, 9], "nontriviallynormedfield": [9, 10], "nonzero": [2, 4, 5, 10], "nor": [3, 5], "norm": [2, 5, 8, 12], "norm_add_l": 9, "norm_conj": 5, "norm_eq_zero": [5, 9], "norm_mod_lt": 5, "norm_mul": [5, 9], "norm_nonneg": [5, 9], "norm_num": [1, 2, 4, 5], "norm_po": 5, "norm_smul": 9, "norm_y_po": 5, "normal": 7, "normedaddcommgroup": [9, 10], "normedaddgroup": 9, "normedfield": 9, "normedgroup": 9, "normedspac": [9, 10], "not_imp_self": 3, "not_le_of_gt": 2, "not_lt_of_g": [2, 4, 5], "not_monotone_iff": 2, "not_norm_mul_left_lt_norm": 5, "not_not": 2, "notat": [1, 2, 3, 4, 5, 6, 7, 8, 9, 10], "note": [1, 2, 4, 5, 6, 7, 8, 10], "noth": [1, 2, 3, 4, 5, 6, 7], "notic": [1, 2, 3, 4, 5, 7, 8], "notin": 3, "notion": [1, 2, 3, 4, 5, 7, 8, 9, 10], "noun": 6, "now": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10], "nozerodivisor": 7, "np": 4, "npow_nz": 4, "npowz": 4, "nsmul": [5, 6], "nsmul_succ": 6, "nsmul_zero": 6, "nsmulrec": 5, "nsmul\u2081": 6, "nsqr_nez": 4, "nt": 2, "nth_rw": 1, "number": [0, 1, 2, 3, 5, 6, 7, 8, 9, 12], "numer": [1, 4, 5], "nut": 1, "n\u2080": 2, "n\u2081": 2, "o": 9, "obfusc": 8, "object": [0, 1, 2, 3, 4, 5, 7, 12], "observ": [2, 4, 8], "obtain": [1, 2, 4, 5, 8, 9], "obviou": [0, 4, 5, 6], "occasion": 8, "occur": 4, "occurr": 1, "odd": [1, 2, 3, 4], "of_le_succ": 4, "of_map": 8, "ofbiject": 7, "off": [2, 3, 4], "offend": 6, "offer": [0, 2, 5, 8], "ofnat": 6, "ofnat_l": 5, "ofnat_lt": 5, "ofreal": 7, "often": [0, 1, 2, 3, 4, 5, 6, 7, 8], "og": 2, "old": [2, 5, 6], "oliv": 0, "omit": 5, "onc": [1, 2, 3, 4, 5, 6, 7, 8, 10], "one": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10], "one_add_one_eq_two": 1, "one_def": 5, "one_dia": 6, "one_eq_top": 7, "one_im": 5, "one_mem": [6, 7], "one_mul": [1, 2, 5, 6], "one_r": 5, "one_smul": [6, 7], "oner": 1, "ones": [0, 1, 2, 3, 5, 10], "one\u2081": 6, "one\u2082": 6, "onli": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10], "onlin": 0, "onto": 7, "op_norm_le_bound": 9, "open": [0, 1, 2, 3, 4, 5, 7, 9, 10], "oper": [1, 2, 3, 4, 5, 6, 7, 8, 9], "opnorm_le_of_shel": 9, "opportun": [7, 8], "opposit": [6, 8], "optim": [6, 10], "option": [1, 2, 4, 5, 6, 8], "orbit": 7, "orbitequivquotientstabil": 7, "orbitrel": 7, "order": [1, 2, 3, 4, 5, 6, 8, 9], "orderedcanceladdcommmonoid": 2, "orderedcommmonoid\u2081": 6, "orderpreshom": 6, "orderpreshomclass": 6, "orderpresmonoidhom": 6, "ordinari": [1, 2, 4, 5, 7, 8], "ordinarili": [4, 5], "organ": 0, "organiz": 1, "orient": 5, "origin": [0, 1, 5, 7], "other": [0, 1, 2, 3, 4, 5, 6, 7, 8], "otherwis": [1, 2, 3, 4, 5, 7], "ott": 0, "our": [0, 1, 2, 3, 4, 5, 6, 7, 8, 10], "ourselv": [4, 6], "out": [0, 1, 2, 3, 4, 5, 6, 7, 8], "outer": 1, "outermost": 3, "outlin": [1, 2, 4, 8], "outparam": 6, "output": [1, 7], "outsid": [1, 4], "over": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9], "overlap": [6, 7], "overload": 3, "overview": 12, "own": [0, 1, 4, 5, 6], "p": [0, 1, 2, 3, 4, 5, 6, 7, 8, 10], "p4": 4, "p4eq": 4, "p_1": 4, "p_i": [4, 8], "p_k": 4, "p_n": 4, "p_ne_zero": 7, "packag": 7, "page": [0, 1, 4], "pai": [1, 2, 6, 7, 8], "pain": 7, "pair": [1, 2, 4, 5, 7, 8], "pairwis": 10, "panel": 0, "paper": [2, 3, 5, 7, 8, 10], "paquet": 0, "paradox": 8, "paragraph": 8, "paramet": [5, 6], "parent": 6, "parenthes": [1, 2, 3, 4], "pariti": 0, "parity_simp": 0, "pars": [1, 3, 7], "part": [1, 2, 3, 4, 5, 6, 8, 10], "partial": [0, 1, 2, 3, 5, 6, 7], "partialord": [1, 2], "partialorder\u2081": 6, "particular": [1, 2, 5, 6, 7, 8], "partit": 7, "partli": [1, 6, 7], "pass": [1, 5], "past": [0, 1, 7], "path": 6, "patholog": 8, "pattern": [1, 2, 3, 5, 6], "payoff": 5, "pdf": 0, "pdvd": 4, "pedro": 0, "peel": 2, "pen": [2, 7], "peopl": [0, 1], "perform": [1, 2, 3], "perm": [5, 7], "permgroup": 5, "permiss": 1, "permut": [4, 7], "person": 0, "perspicu": 2, "phenomenon": 3, "phrase": [0, 1, 2, 4, 5], "pi": [7, 8], "pick": [0, 6], "pictur": [4, 5, 7], "piec": [1, 4, 5, 6, 7, 8], "pierpaolo": 0, "pietro": 0, "pim": 0, "pinot": 7, "piotrowski": 0, "place": [0, 1, 2, 5, 8], "placehold": 2, "placement": 4, "plai": [1, 3, 4, 6, 7, 8], "plan": [1, 6, 8], "plane": 8, "plausibl": 3, "ple": 4, "pltn": 4, "pne3": 4, "point": [0, 1, 2, 3, 5, 6, 7, 8, 9, 10], "pointwis": [5, 8, 9], "polynomi": 5, "ponen": 1, "poor": 6, "pop": 0, "port": 0, "posit": [1, 3, 4, 5, 8, 10], "possibl": [1, 2, 3, 4, 5, 7, 8], "possibli": 5, "postfix": 6, "pos\u2080": 2, "potscrubb": 0, "pow_eq": 4, "pow_eq_zero": [2, 4], "pow_succ": 4, "pow_two": [1, 4], "pow_two_le_fac": 4, "pow_two_nonneg": [1, 2], "power": [0, 1, 3, 4, 5, 6], "pp": 4, "practic": [1, 2, 3, 6, 7, 8], "pragmat": 5, "pre": 2, "preal": 5, "preced": [4, 7], "precis": [1, 3, 7, 8, 9], "precondit": 8, "pred": 4, "predecessor": 4, "predic": [2, 3, 4, 6, 7, 8, 9], "prefer": [0, 1, 2, 3], "prefix": [4, 6, 7], "preimag": [3, 7, 8], "preliminari": 6, "prematur": 6, "preorder": [2, 6, 8], "preorder\u2081": 6, "presenc": 6, "present": [1, 2, 4, 7, 8], "presentedgroup": 7, "preserv": [4, 6, 8], "preserves_mul": 5, "press": 0, "presuppos": 0, "pretend": 6, "pretti": [2, 6, 7, 8], "previou": [1, 2, 3, 5, 6, 7, 8, 9, 10], "previous": 6, "price": 8, "primari": 6, "primarili": [6, 7, 8], "prime": [1, 2, 3, 5, 6, 7, 12], "prime_def_lt": 4, "prime_iff": 3, "prime_of_mem_primefactorslist": 4, "prime_p": 4, "prime_q": 4, "prime_thre": 4, "prime_two": 4, "prime_x": 3, "primefactorslist": 4, "primefactorslist_uniqu": 4, "primes_infinit": 4, "primes_mod_4_eq_3_infinit": 4, "primit": [2, 3], "princip": 8, "principalidealr": 5, "principl": [1, 2, 3, 4, 6, 9], "print": [0, 3, 4, 5, 10], "priori": 6, "prioriti": 5, "probabl": [1, 5, 6, 8], "problem": [3, 4, 5, 6, 8], "proce": [4, 6], "procedur": [4, 6], "proceed": 7, "prod": [4, 7, 8, 10], "prod_": 4, "prod_empti": 4, "prod_insert": 4, "prod_map": 8, "prod_mk": 8, "prod_po": 4, "prod_primefactorslist": 4, "prod_range_succ": 4, "prod_range_zero": 4, "prodcongr": 7, "prodequivpi": 7, "produc": [1, 2, 7, 9], "product": [2, 4, 5, 6, 7, 8, 10], "profici": 4, "program": [0, 1, 2], "progress": [0, 1, 5, 7], "prohibit": 8, "project": [0, 4, 5, 7, 8], "projector": 7, "promin": 7, "promis": [6, 8], "promot": 1, "proof": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9], "prop": [0, 2, 3, 4, 5, 6, 7, 8, 10], "propag": 6, "properti": [1, 2, 3, 4, 5, 6, 7, 8, 9, 10], "proposit": [0, 2, 3, 4, 5], "protect": 5, "provabl": [1, 3, 6, 8], "prove": [0, 2, 3, 4, 5, 6, 7, 8, 9, 10, 12], "proven": 7, "provid": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10], "proxi": 5, "pseudoemetricspac": 8, "pseudometricspac": 8, "psycholog": 6, "pull": [0, 7, 8], "pullback": [7, 8], "pun": 2, "pure": [1, 8], "pure_le_nhd": 8, "purpos": [1, 2, 3, 4, 5, 6, 8], "push": [2, 4, 7, 8], "push_neg": [2, 3, 4], "push_pul": 8, "pushforward": [7, 8], "put": [0, 1, 2, 3, 4, 5, 6, 7, 8], "q": [2, 4, 5, 6, 7, 8], "qk": 4, "quad": 5, "quadrat": 5, "quantifi": [1, 3, 4, 5, 7, 8, 12], "quantiti": 8, "quest": 6, "question": [0, 4, 6, 8, 10], "quick": [4, 7, 9], "quicker": 0, "quickli": [3, 7, 10], "quirki": 4, "quit": [2, 6, 8], "quot": [5, 8], "quotequivofeq": 7, "quotient": [4, 5, 6, 8], "quotient_mul_add_remainder_eq": 5, "quotient_zero": 5, "quotientgroup": 7, "quotientinfringequivpiquoti": 7, "quotientkerequivrang": 7, "quotientmap": 7, "quotientmonoid": 6, "quotientmulequivofeq": 7, "r": [1, 2, 4, 5, 6, 7, 8], "r_wellfound": 5, "radiu": 8, "raini": 3, "rais": [1, 4], "random": 6, "rang": [0, 2, 3, 4, 7, 8], "rare": 6, "rather": [0, 1, 2, 4, 5, 6, 7, 8], "ration": [1, 2, 4, 8], "rb": 8, "rcase": [2, 3, 4, 8], "rclike": 9, "re": [4, 5], "reach": [2, 6], "read": [0, 1, 4, 5, 6, 7, 8], "readabl": [1, 2, 3, 8], "reader": [1, 8], "readi": [4, 6, 7, 8, 9], "real": [1, 2, 3, 4, 5, 6, 8, 9, 10], "real_norm_l": 9, "realli": [1, 2, 3, 4, 6, 7, 8], "reason": [0, 1, 2, 4, 5, 6, 7, 8], "rec_on": 8, "recal": [1, 2, 4, 5, 7, 8, 10], "recaptur": 8, "recast": 8, "recent": 5, "recogn": [1, 2, 4, 5, 6, 8], "recommend": [0, 1, 3], "recon": 8, "reconcil": 2, "record": [5, 6], "recov": 8, "recurs": [2, 3, 5, 12], "redefin": [5, 6], "reduc": [0, 2, 3, 4, 5], "reduct": [2, 3, 5], "redund": [1, 5, 8, 10], "refer": [0, 1, 2, 4, 5, 6, 8, 9], "refin": [4, 9], "refl": [2, 3, 5, 6, 7], "refl_tran": 5, "reflect": 2, "reflex": [1, 2, 5], "reformul": 8, "refus": [6, 8], "regiment": 0, "region": 3, "regist": [5, 6, 7], "regular": [6, 8], "regularspac": 8, "rel": [3, 5], "relat": [1, 2, 3, 5, 6, 7, 8, 9, 10], "relatedli": 8, "relationship": [3, 4], "relativ": 3, "relev": [0, 1, 2, 4, 5, 6, 7, 8], "reli": [1, 2, 5, 8], "remain": [0, 1, 2, 3, 5, 6, 8], "remaind": [4, 5, 7], "remainder_lt": 5, "remark": [5, 6], "rememb": [1, 2, 3, 4, 5, 6, 7, 8], "remov": [4, 8], "renam": 0, "render": [2, 4], "repeat": [1, 4, 5, 6], "repeatedli": [2, 8], "repetit": [1, 6], "replac": [0, 1, 2, 3, 4, 6, 7], "replai": 0, "report": 1, "repositori": [0, 1], "repres": [0, 1, 2, 3, 4, 5, 6, 9], "represent": [3, 4, 5], "reproduc": 5, "reprov": [1, 7], "requir": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10], "resolut": 6, "resolve_left": 3, "resourc": 0, "respect": [1, 2, 3, 4, 5, 7, 8], "respons": [0, 1], "rest": [2, 3, 5, 7, 8], "restat": [2, 6, 7], "restor": 6, "restrict": [3, 4, 7, 8], "result": [0, 1, 2, 3, 4, 5, 6, 7, 8], "retri": 6, "return": [0, 2, 3, 4, 5, 7, 8], "reus": 6, "reusabl": 6, "reveal": 1, "revers": [1, 2, 3, 5, 8], "revert": [4, 5], "review": [7, 8], "rewrit": [0, 1, 2, 3, 4, 5, 6, 8], "rewritten": 3, "rfl": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10], "rich": [5, 6], "rid": 2, "right": [1, 2, 3, 4, 5, 6, 8, 9], "right_distrib": [5, 6], "right_inv": 5, "rightinvers": 3, "ring": [0, 1, 2, 3, 4, 5, 6, 12], "ringequiv": 7, "ringhom": [6, 7], "ringhomclass\u2083": 6, "ringhom\u2081": 6, "ring\u2081": 6, "ring\u2083": 6, "rintro": [0, 2, 3, 4, 7, 8], "rise": [4, 6, 7], "road": 5, "robust": [5, 6], "role": [4, 5, 8], "roll": 9, "rolland": 0, "roman": 5, "root": [5, 6, 7, 12], "roots_mul": 7, "roots_x_sub_c": 7, "roughli": [2, 3, 4], "round": [0, 1, 5], "routin": 2, "rpo": 8, "rule": [0, 2, 4, 5, 6, 8], "run": 0, "rush": 0, "rw": [0, 2, 3, 4, 5, 6, 7, 8, 12], "rwa": [3, 4, 5], "r\u02e3": 7, "s_": 3, "s_0": [2, 3], "s_1": 2, "s_2": 2, "s_n": [2, 3], "sa": 2, "sad": 8, "safe": [6, 7], "safer": 7, "sai": [0, 1, 2, 3, 4, 5, 6, 7, 8, 10], "said": [0, 2, 4, 5], "sake": [1, 4], "salient": 8, "same": [0, 1, 2, 3, 4, 5, 6, 7, 8], "satisfi": [1, 3, 4, 5, 6, 8, 9], "save": 2, "saw": [1, 5, 6, 7, 8], "sb": 2, "sb_fun": 3, "sb_inject": 3, "sb_right_inv": 3, "sb_surject": 3, "sbaux": 3, "sbfun": 3, "sbset": 3, "scalar": [5, 6, 7, 9], "scale": 3, "scari": 5, "scheme": 5, "schroeder_bernstein": 3, "schr\u00f6der": 12, "scienc": 6, "scientist": 2, "scope": [1, 2, 3, 5, 7], "scott": 0, "scratch": 2, "script": 1, "search": [4, 5, 6], "second": [0, 1, 2, 3, 4, 5, 6, 7, 8, 10], "section": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10], "see": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10], "seek": 5, "seem": [1, 2, 4, 6, 8, 9], "seen": [0, 1, 2, 4, 5, 6, 7, 8], "segment": [8, 10], "select": [0, 8], "self": 6, "self_of_nhd": 8, "self_sub": 1, "self_trans_symm": [5, 7], "selfequivsigmaorbit": 7, "selfmodul": 6, "semi": [6, 7], "semicolon": [2, 4], "semigroup": 6, "semigroup\u2081": 6, "semigroup\u2082": 6, "semigroup\u2083": 6, "semir": [6, 7], "send": [7, 10], "sens": [0, 2, 3, 4, 5, 6, 7, 8, 9], "sensibl": 8, "sent": [7, 8], "separ": [0, 1, 2, 4, 5], "sequenc": [3, 6, 8, 9, 12], "seri": 7, "seriou": [4, 6, 8], "serv": [1, 3, 4, 5, 10], "set": [0, 1, 2, 4, 5, 6, 7, 9, 10, 12], "set_opt": 6, "setco": 6, "setintegral_const": 10, "setlik": 6, "setminu": 3, "setoid": [6, 7], "sets_of_superset": 8, "setub": 2, "setup": 7, "seurin": 0, "sever": [6, 8, 10], "shade": 3, "shame": 6, "sharp": 0, "shift": [0, 1, 6, 8], "short": [0, 1, 2, 3, 4, 5], "shorten": [1, 2, 7], "shorter": [1, 3, 4, 7, 8], "shot": 8, "should": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9], "shouldn": 8, "show": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10], "shown": [1, 5, 9, 10], "side": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9], "sight": [2, 6], "sigma": [5, 10], "sigmafinit": 10, "sign": 8, "signatur": 6, "signific": 3, "silent": [5, 6], "silli": 6, "silva": 0, "similar": [1, 2, 3, 5, 6, 7, 8], "similarli": [2, 3, 4, 5, 7], "simp": [0, 2, 3, 4, 5, 6, 7, 8, 9], "simp_rw": 7, "simpa": [4, 7, 9], "simpl": [2, 4, 5, 6, 9], "simpler": 6, "simplex": 5, "simpli": [0, 1, 2, 3, 4, 5, 6, 7, 8], "simplif": [2, 3, 4], "simplifi": [0, 2, 3, 4, 5, 8, 10], "sin": [2, 9], "sinc": [0, 1, 2, 3, 4, 5, 6, 7, 8], "singl": [0, 1, 2, 3, 4, 5, 6, 7, 9], "singleton": 4, "sinter": 3, "sinter_eq_biint": 3, "situat": [1, 3, 6, 7, 8], "skeleton": [5, 8], "sketch": [2, 3, 4, 8], "skill": [0, 1, 2, 3, 4], "slick": 2, "slight": 3, "slightli": [1, 6, 7, 8, 9], "slow": 8, "small": [0, 2, 4, 5, 8], "smaller": [3, 4, 8], "smallest": [4, 6, 8], "smart": 4, "smul": [5, 6, 7], "smul_add": 6, "smul_distrib": 5, "smul\u2083": 6, "snd": [5, 8], "snippet": [2, 4, 5, 7], "so": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10], "solut": [0, 1, 4, 6], "solv": [0, 1, 2, 3, 4, 5, 6, 8], "some": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9], "somehow": 7, "someth": [0, 1, 2, 4, 6, 8], "sometim": [1, 2, 3, 4, 5, 6, 7, 8], "somewhat": [1, 3, 8], "somewher": 8, "soon": [0, 2, 6, 7, 8], "sophist": 8, "sorri": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9], "sort": [1, 3, 4], "sosi": 2, "sosx": 2, "sound": [3, 5, 6], "sourc": [2, 8], "space": [1, 2, 3, 5, 6, 7, 10, 12], "speak": [2, 5, 7, 8], "special": [3, 4, 5, 6, 7, 8, 10], "specif": [0, 1, 3, 4, 5, 6], "specifi": [1, 2, 3, 4, 5, 8, 9, 10], "spell": 8, "split": [1, 2, 3, 4], "spot": 2, "sq_ab": 5, "sq_add_sq_eq_zero": 5, "sq_nonneg": 1, "sqr_eq": 4, "sqrt": [2, 3, 4, 5], "squar": [1, 2, 4, 5, 6, 7], "squiggli": 2, "ss": 3, "ssubt": 3, "stabil": 7, "stage": [2, 5, 6], "stai": 5, "stand": [1, 2, 4, 5, 6, 7, 8, 9], "standard": [4, 5, 6, 8], "standardsimplex": 5, "standardtwosimplex": 5, "start": [1, 2, 3, 4, 6, 7, 8, 9, 10, 12], "state": [0, 1, 2, 3, 4, 6, 7, 8, 9], "statement": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10], "stdsimplex": 5, "steep": 0, "steinhau": 9, "step": [0, 1, 2, 3, 4, 5, 6], "steven": 0, "stick": [1, 2, 8, 9], "still": [0, 1, 2, 3, 4, 5, 6, 8, 10], "stipul": 9, "stop": 6, "store": 5, "stori": 6, "str": 5, "straightforward": [2, 6], "strang": [2, 4, 7], "strategi": [1, 2, 4], "strength": 1, "strengthen": [1, 2, 4], "stretch": [4, 5], "strict": [1, 2], "stricter": 9, "strictli": [1, 2, 9], "strictmono": 8, "strictorderedr": 1, "strike": [1, 2], "strong": [2, 4], "strong_induction_on": 4, "stronger": 8, "strongli": 0, "stronglymeasurableatfilt": 10, "struc": 5, "structur": [2, 4, 6, 7, 8, 9, 10, 12], "stuck": 6, "studi": [6, 8], "style": [0, 1], "sub": [3, 8, 10, 12], "sub_add_cancel": 1, "sub_eq_add_neg": 1, "sub_self": [1, 2], "sub_sub": 1, "subgoal": 2, "subgroup": 6, "subgroupclass\u2081": 6, "subgroupofmulact": 7, "subgroup\u2081": 6, "subject": 5, "submodul": 7, "submonoid": [6, 7], "submonoidclass\u2081": 6, "submonoid\u2081": 6, "submonoid\u2081monoid": 6, "subobject": 6, "subproof": 1, "subr": 6, "subscript": 1, "subsequ": [2, 4, 8], "subset": [1, 2, 3, 5, 8, 9], "subset_def": 3, "subset_iff": 4, "subspac": [1, 6], "substant": 4, "substanti": 0, "substitut": [0, 2], "subsum": 4, "subtl": [5, 7, 8], "subtleti": [6, 7], "subtract": [1, 4, 5], "subtyp": [5, 6, 7, 8], "succ": [4, 6], "succ_add": 4, "succ_le_succ": 4, "succ_mul": 4, "succ_ne_zero": 4, "succ_po": 4, "succe": 6, "success": 6, "successor": 4, "suffic": [1, 2, 3, 7, 8], "suffici": [4, 8], "suggest": [0, 2, 4, 5, 8], "suitabl": [0, 1, 2, 5, 8], "sum": [1, 2, 4, 5, 6, 7, 8], "sum_add_distrib": 5, "sum_eq": 5, "sum_eq_on": 5, "sum_id": 4, "sum_mul": 5, "sum_range_succ": 4, "sum_range_zero": 4, "sum_sqr": 4, "summat": 4, "sumofsquar": 2, "sumofsquares_mul": 2, "sunion": 3, "sunion_eq_biunion": 3, "sup": [1, 4, 8], "sup_assoc": 1, "sup_comm": 1, "sup_eq_closur": 7, "sup_inf_left": 1, "sup_inf_right": 1, "sup_inf_self": 1, "sup_l": 1, "superfici": 8, "superscript": 8, "suppli": 5, "support": [0, 1, 2, 3, 4, 5, 6, 8], "suppos": [1, 2, 3, 4, 5, 8], "suppress": 1, "supremum": [1, 4, 6, 7], "sure": [0, 1, 2, 3, 5, 6, 7], "surject": [2, 3, 7, 8], "surjf": [2, 3], "surjg": 2, "surpris": 6, "surprisingli": [5, 6], "swap": 5, "swapxi": 5, "sweet": 3, "switch": [1, 6], "sylow": 7, "symbol": [1, 2, 5, 6, 7], "symm": [3, 4, 5, 6, 7, 8, 9], "symmetr": [2, 3, 7], "symmetri": [3, 6], "synonym": 7, "syntact": 2, "syntax": [0, 1, 2, 4, 6], "synth": 6, "synthes": [5, 6], "synthinst": 6, "system": [3, 4, 5, 6], "s\u00e1nchez": 0, "s\u02e3": 7, "s\u1d9c": [8, 10], "s\u2081": 6, "s\u2082": 6, "t": [0, 1, 2, 3, 4, 5, 6, 7, 8, 10], "t2space": 8, "t3space": 8, "t_": 8, "t_3": 8, "t_x": 8, "t_y": 8, "t_z": 8, "tab": [1, 3, 4], "tackl": 6, "tactic": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9], "tag": [2, 3, 6], "take": [1, 2, 3, 4, 5, 6, 7, 8, 9, 10], "taken": [1, 2], "takeshi": 0, "talk": [4, 7, 8, 9], "tantamount": [1, 3], "target": [1, 6, 7, 8, 10], "task": [0, 2, 4, 5, 6, 8], "taught": 7, "tauto": 4, "tautologi": 4, "teach": 0, "tear": 6, "technic": [1, 5, 6], "techniqu": [2, 8], "technologi": 6, "tediou": [1, 2, 6], "tell": [0, 2, 3, 4, 5, 6, 7], "temporarili": [1, 2], "tempt": 6, "tend": [1, 8], "tendsto": [8, 10], "tendsto_attop": 8, "tendsto_congr": 8, "tendsto_iff": 8, "tendsto_integral_of_dominated_converg": 10, "tendsto_nhds_uniqu": 8, "tendsto_pow_attop_nhds_0_of_lt_1": 8, "tendsto_right_iff": 8, "tendsto_subseq": 8, "tendsto\u2081": 8, "tendsto\u2082": 8, "term": [0, 1, 2, 3, 4, 5, 7, 8], "terminologi": 5, "terraf": 0, "ters": 6, "test": 4, "text": [0, 3, 5, 8], "textbook": [0, 1, 2], "th": 4, "than": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9], "thank": 6, "thei": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9], "them": [0, 1, 2, 3, 4, 5, 6, 7, 8], "theme": 3, "themselv": [0, 4, 5], "theorem": [0, 2, 4, 5, 7, 8, 9, 10, 12], "theoret": [2, 3, 8], "theori": [0, 1, 2, 3, 6, 7, 8, 9, 12], "therefor": [1, 4, 5, 8], "thereof": 0, "thi": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10], "thing": [0, 1, 2, 3, 4, 5, 6, 8], "think": [0, 1, 2, 3, 4, 5, 6, 8, 9], "third": [1, 2, 3, 5, 8], "thoma": 0, "thorough": 0, "those": [0, 1, 2, 3, 5, 6, 7, 8, 9], "though": [2, 3, 4, 5], "three": [1, 2, 4, 5, 7, 8], "through": [0, 1, 3, 4, 5, 6, 7, 8], "thu": [1, 3, 4, 5, 8], "thumb": 4, "tighter": [1, 3], "tightli": 5, "time": [1, 4, 5, 6, 8, 9, 10], "timesav": 1, "tiresom": 8, "to_addit": 6, "to_localinvers": 9, "toaddcommgroup\u2083": 6, "toaddgroup\u2083": 6, "todiaoneclass\u2081": 6, "todia\u2081": 6, "tofun": [5, 6], "togeth": [1, 2, 3, 4, 5, 7, 8], "togroup": 7, "tomonoidhom\u2081": 6, "tomuloneclass": 6, "too": [0, 1, 3, 5, 6, 7, 8], "toohei": 0, "tool": [0, 1, 5, 6], "toone\u2081": 6, "top": [0, 6, 7, 8, 9], "topermhom": 7, "topic": [4, 5, 6, 7], "topolog": [5, 6, 9, 12], "topologi": [1, 5, 6, 9, 12], "topologicalspac": [8, 9], "toreal": 10, "tosemigroup\u2081": 6, "tosmul\u2083": 6, "total": 1, "tour": [8, 9], "toward": 7, "trace": 6, "tradeoff": 3, "tradition": 7, "train": [1, 6], "tran": [1, 2, 4, 5, 6, 7], "trans_assoc": 5, "trans_refl": 5, "transform": [2, 3], "transit": [1, 2, 5, 8], "translat": [4, 6, 7, 8], "trap": 6, "treat": [2, 3, 5, 6, 7, 8, 9], "treatment": 7, "tri": [1, 2, 4, 6], "triangl": [1, 2, 5], "trick": [1, 2, 4, 6, 9], "tricki": [2, 3, 4, 6, 7], "trigger": 6, "tripl": 3, "trivial": [3, 4, 7, 8], "troubl": [2, 3, 5], "true": [1, 2, 3, 6, 8], "truncat": 4, "truth": [1, 4], "try": [0, 1, 2, 3, 4, 5, 6, 8], "tupl": 5, "turn": [2, 3, 4, 5, 6, 8, 9], "tutori": 0, "twice": [0, 1, 8], "two": [0, 1, 2, 3, 4, 5, 6, 7, 8, 10], "two_l": 4, "two_le_of_mod_4_eq_3": 4, "two_mul": 1, "ty": 7, "type": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10], "typeclass": 6, "typic": [1, 7], "u": [1, 2, 3, 4, 5, 6, 7, 8, 9, 10], "ubf": 2, "ubfa": 2, "ubg": 2, "ubgb": 2, "ulequiv": 7, "ultim": 0, "un": 3, "unapp": 1, "unbundl": 6, "unchang": [1, 2], "uncom": 1, "uncount": 8, "uncurri": 8, "under": [5, 6, 7, 8], "underli": [0, 1, 5, 6, 7], "underneath": [1, 3], "underscor": [1, 2, 3], "understand": [0, 2, 3, 4, 5, 6, 7, 8], "understood": [4, 8], "unfold": [1, 2, 3, 4, 5, 8], "unfortun": 7, "unicod": [1, 3, 6], "unif": 6, "uniform": [3, 8, 9], "uniformcontinu": 8, "uniformcontinuous_iff": 8, "uniformli": 9, "union": [1, 3, 4, 5, 6, 7, 9, 10], "union_def": 3, "uniqu": [1, 2, 3, 4, 5, 7, 8], "unit": [5, 6, 8], "units_eq_one_or": 7, "univ": [3, 8, 9, 10], "univ_set": 8, "univari": 7, "univers": [1, 3, 5, 7, 8, 12], "unknown": 6, "unless": [1, 2, 5], "unlik": [3, 4], "unnecessari": [3, 7], "unpack": [2, 3], "unpleas": [6, 8], "unrel": 6, "unshad": 3, "unspecifi": 6, "unsurprisingli": 3, "until": [1, 4, 6, 8], "up": [0, 2, 3, 4, 5, 6, 7, 8], "updat": 0, "upper": [1, 2], "us": [0, 2, 3, 4, 5, 6, 7, 8, 9, 10, 12], "usabl": 6, "usag": 1, "user": [0, 6], "usual": [1, 2, 3, 4, 5, 7, 8, 10], "v": [0, 1, 2, 3, 5, 8], "val": 5, "valid": 2, "valu": [1, 2, 3, 4, 5, 6, 7, 8, 9, 10], "van": 0, "vanish": 7, "varepsilon": [2, 8], "variabl": [1, 2, 3, 4, 5, 6, 7, 8, 9, 10], "variant": [1, 2, 7, 8], "variat": [1, 3, 4, 5, 8, 9], "varieti": 8, "variou": [2, 3, 5, 6, 10], "vastli": 2, "ve": [6, 8], "vector": [1, 3, 6, 7, 9], "verbatim": 7, "verbos": 3, "veri": [0, 2, 4, 6, 7, 8, 10], "verifi": 2, "versa": [1, 3], "version": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10], "vertic": [2, 5], "vi": 5, "via": 8, "vice": [1, 3], "victor": 0, "view": [5, 6, 7, 8], "visibl": 1, "vocabulari": 3, "volum": 10, "w": [1, 6], "wa": [1, 3, 7], "wai": [0, 1, 2, 3, 4, 5, 6, 7, 8, 10], "want": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10], "wasn": 8, "we": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10], "weak": 6, "weaker": [1, 2], "weav": 5, "web": [0, 1, 4], "weight": 5, "weightedaverag": 5, "weird": [6, 8], "weirder": 9, "welcom": [0, 1], "well": [0, 1, 2, 3, 4, 5, 6, 7, 8], "were": [2, 4, 5, 8], "what": [0, 1, 2, 3, 4, 5, 6, 7, 8], "whatev": [0, 2, 4], "whatsnew": 6, "when": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9], "whenev": [1, 2, 4, 5], "where": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10], "wherea": [0, 1, 2, 3, 5, 7, 8], "wherebi": [5, 8], "whether": [2, 3, 4, 6, 8], "which": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10], "while": [0, 1, 2, 6, 7, 8], "who": [0, 8], "whole": 5, "whose": [1, 2, 4, 5, 6, 7, 8, 9], "why": [0, 2, 4, 6, 7, 8], "wieser": 0, "window": [0, 1, 2, 5], "winston": 0, "wise": 5, "wish": 8, "withbot": 7, "within": [1, 2, 8], "without": [1, 2, 4, 5, 6, 7, 8, 9], "withtop": 9, "wlog": 3, "won": [2, 4, 6, 7, 8], "word": [1, 2, 3, 4, 5, 7, 8], "work": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9], "world": 0, "worri": [1, 3, 4, 5, 7], "worth": [1, 2, 5], "would": [1, 2, 3, 4, 5, 6, 7, 8, 9], "wouldn": 6, "wrap": [6, 8], "write": [0, 1, 2, 4, 5, 6, 7, 8, 9, 10], "written": [1, 2, 3, 4, 5, 6, 7, 8, 9], "wrong": 3, "wrote": 4, "x": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10], "x_0": 8, "x_1": [2, 3], "x_2": [2, 3], "x_i": 8, "x_nonneg": 5, "xa": 3, "xai": 3, "xeq": [2, 3], "xgt": 2, "xlt": 2, "xltz": 2, "xmem": 3, "xnt": 3, "xnu": 3, "xpo": 3, "xstu": 3, "xsu": 3, "xt": 3, "xtu": 3, "xu": 3, "xy": [2, 5], "x\u2080": [8, 9], "x\u2081": [2, 3, 5, 8], "x\u2081a": 3, "x\u2082": [2, 3, 5], "x\u2082a": 3, "x\u2082eq": 3, "x\u2082na": 3, "y": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10], "y_nonneg": 5, "yannick": 0, "yball": 8, "yeq": 2, "yet": [2, 3, 4, 5, 6, 8], "yield": [1, 2, 3, 4, 5, 8], "ylim": 8, "ylt": 2, "you": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10], "your": [0, 1, 2, 3, 5, 6, 7, 8], "yourself": [2, 5], "ypo": 3, "y\u2080": 8, "y\u2081": 5, "y\u2082": 5, "z": [0, 1, 2, 5, 6, 7, 8, 9, 10], "z_nonneg": 5, "zermelo": 2, "zero": [2, 3, 4, 5, 6, 7, 8, 9, 10], "zero_add": [1, 4, 5, 6], "zero_def": 5, "zero_dvd_iff": 4, "zero_im": 5, "zero_l": [4, 5], "zero_lt_on": [2, 4], "zero_lt_two": 5, "zero_mem": 7, "zero_mul": [1, 4, 5, 6], "zero_r": 5, "zero_smul": 6, "zf": 2, "zlty": 2, "zmod": 7, "zsmul": [5, 6], "zsmulrec": 5, "zsmul\u2081": 6, "zulip": [0, 4], "z\u2080": 8, "z\u2081": 5, "z\u2082": 5, "\u00b9": [1, 3, 5, 6, 7, 8], "\u02e2": 8, "\u03b1": [1, 2, 3, 4, 5, 6, 7, 8, 9, 10], "\u03b2": [1, 2, 3, 5, 6, 8, 10], "\u03b3": [1, 2, 5, 8], "\u03b4": [2, 8], "\u03b4po": 8, "\u03b5": [2, 8, 9], "\u03b52po": 2, "\u03b5_po": [8, 9], "\u03b5k_po": 9, "\u03b5po": [2, 8], "\u03b9": [7, 8, 9, 10], "\u03bc": [8, 10], "\u03bd": 10, "\u03c0": [7, 8, 9], "\u03c3": [5, 7], "\u03c6": [7, 8], "\u03c8": 7, "\u03c9": 7, "\u1d50": 10, "\u1d65": 7, "\u1d9c": 7, "\u1da0": [8, 9, 10], "\u2080": 3, "\u2081": 6, "\u2090": 7, "\u2102": [1, 5, 7, 9], "\u2115": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10], "\u211a": [1, 4, 7, 8], "\u211d": [1, 2, 3, 5, 6, 7, 8, 9, 10], "\u2124": [1, 4, 5, 6, 7], "\u2124\u02e3": 7, "\ud835\udcdd": [8, 9, 10], "\ud835\udcdf": 8, "\ud835\udce4": 8, "\ud835\udd42": 9, "\ud835\udd5c": [9, 10], "\ud835\udfd9": 6}, "titles": ["1. Introduction", "2. Basics", "3. Logic", "4. Sets and Functions", "5. Elementary Number Theory", "6. Structures", "7. Hierarchies", "8. Groups and Rings", "9. Topology", "10. Differential Calculus", "11. Integration and Measure Theory", "Index", "Mathematics in Lean"], "titleterms": {"The": [2, 3], "about": 1, "action": 7, "algebra": [1, 5, 7], "appli": 1, "asymptot": 9, "ball": 8, "basic": [1, 6], "bernstein": 3, "build": 5, "calcul": 1, "calculu": 9, "close": 8, "compact": 8, "comparison": 9, "complet": 8, "concret": 7, "conjunct": 2, "continu": [8, 9], "converg": [2, 8], "countabl": 8, "defin": 5, "differenti": 9, "disjunct": 2, "elementari": [4, 9, 10], "exampl": 1, "existenti": 2, "fact": 1, "filter": 8, "function": [3, 8], "fundament": 8, "gaussian": 5, "get": 0, "group": 7, "hierarchi": 6, "ideal": 7, "ident": 1, "iff": 2, "implic": 2, "index": 11, "induct": 4, "infinit": 4, "integ": 5, "integr": 10, "introduct": 0, "irrat": 4, "lean": 12, "lemma": 1, "linear": 9, "logic": 2, "mani": 4, "map": 9, "mathemat": 12, "measur": 10, "metric": 8, "monoid": 7, "more": 1, "morphism": [6, 7], "negat": 2, "norm": 9, "number": 4, "object": 6, "open": 8, "overview": 0, "polynomi": 7, "prime": 4, "prove": 1, "quantifi": 2, "quotient": 7, "recurs": 4, "ring": 7, "root": 4, "rw": 1, "schr\u00f6der": 3, "separ": 8, "sequenc": 2, "set": [3, 8], "space": [8, 9], "start": 0, "structur": [1, 5], "sub": 6, "subgroup": 7, "subr": 7, "theorem": [1, 3], "theori": [4, 10], "topolog": 8, "topologi": 8, "uniformli": 8, "unit": 7, "univers": 2, "us": 1}})
mathematics_in_lean.pdf