mathematics_in_lean

My solutions for this book

  1. 1
  2. 2
  3. 3
  4. 4
  5. 5
  6. 6
  7. 7
  8. 8
  9. 9
  10. 10
  11. 11
  12. 12
  13. 13
  14. 14
  15. 15
  16. 16
  17. 17
  18. 18
  19. 19
  20. 20
  21. 21
  22. 22
  23. 23
  24. 24
  25. 25
  26. 26
  27. 27
  28. 28
  29. 29
  30. 30
  31. 31
  32. 32
  33. 33
  34. 34
  35. 35
  36. 36
  37. 37
  38. 38
  39. 39
  40. 40
  41. 41
  42. 42
  43. 43
  44. 44
  45. 45
  46. 46
  47. 47
  48. 48
  49. 49
  50. 50
  51. 51
  52. 52
  53. 53
  54. 54
  55. 55
  56. 56
  57. 57
  58. 58
  59. 59
  60. 60
  61. 61
  62. 62
  63. 63
  64. 64
  65. 65
  66. 66
  67. 67
  68. 68
  69. 69
  70. 70
  71. 71
  72. 72
  73. 73
  74. 74
  75. 75
  76. 76
  77. 77
  78. 78
  79. 79
  80. 80
  81. 81
  82. 82
  83. 83
  84. 84
  85. 85
import MIL.Common
import Mathlib.Data.Real.Basic

set_option autoImplicit true

namespace C03S02

def FnUb (f :   ) (a : ) : Prop :=
   x, f x  a

def FnLb (f :   ) (a : ) : Prop :=
   x, a  f x

def FnHasUb (f :   ) :=
   a, FnUb f a

def FnHasLb (f :   ) :=
   a, FnLb f a

theorem fnUb_add {f g :   } {a b : } (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)

section

variable {f g :   }

example (lbf : FnHasLb f) (lbg : FnHasLb g) : FnHasLb fun x  f x + g x := by
  rcases lbf with a, lbfa
  rcases lbg with b, lbgb
  use a + b
  intro x
  exact add_le_add (lbfa x) (lbgb x)

example {c : } (ubf : FnHasUb f) (h : c  0) : FnHasUb fun x  c * f x := by
  rcases ubf with a, ubfa
  use c * a
  intro x
  exact mul_le_mul_of_nonneg_left (ubfa x) h

end

section
variable {a b c : }

example (divab : a  b) (divbc : b  c) : a  c := by
  rcases divab with d, rfl
  rcases divbc with e, rfl
  use d * e; ring

example (divab : a  b) (divac : a  c) : a  b + c := by
  rcases divab with d, rfl
  rcases divac with e, rfl
  use d + e; ring

end

section

open Function

example {c : } (h : c  0) : Surjective fun x  c * x := by
  intro x
  use x / c
  dsimp; rw [mul_div_cancel' _ h]

example {c : } (h : c  0) : Surjective fun x  c * x := by
  intro x
  use x / c
  field_simp [h] ; ring

end

section
open Function
variable {α : Type*} {β : Type*} {γ : Type*}
variable {g : β  γ} {f : α  β}

example (surjg : Surjective g) (surjf : Surjective f) : Surjective fun x  g (f x) := by
  intro z
  rcases surjg z with y, rfl
  rcases surjf y with x, rfl
  use x

end