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
  86. 86
  87. 87
  88. 88
  89. 89
  90. 90
  91. 91
  92. 92
  93. 93
  94. 94
  95. 95
  96. 96
  97. 97
import Mathlib.Data.Real.Basic
import Mathlib.Data.Nat.Prime
import Mathlib.Tactic.NormNum

example {m n : } (h : m  n  m  n) : m  n  ¬n  m := by
  cases' h with h0 h1
  constructor
  · exact h0
  intro h2
  apply h1
  apply Nat.dvd_antisymm h0 h2

example {x y : } : x  y  ¬y  x  x  y  x  y := by
  constructor
  · rintro h0, h1
    constructor
    · exact h0
    intro h2
    apply h1
    rw [h2]
  rintro h0, h1
  constructor
  · exact h0
  intro h2
  apply h1
  apply le_antisymm h0 h2

theorem aux {x y : } (h : x ^ 2 + y ^ 2 = 0) : x = 0 :=
  have h' : x ^ 2 = 0 := by linarith [pow_two_nonneg x, pow_two_nonneg y]
  pow_eq_zero h'

example (x y : ) : x ^ 2 + y ^ 2 = 0  x = 0  y = 0 := by
  constructor
  · intro h
    constructor
    · exact aux h
    rw [add_comm] at h
    exact aux h
  rintro rfl, rfl
  norm_num

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
  rw [not_monotone_iff]
  use 0, 1
  norm_num

section

variable {α : Type _} [PartialOrder α]

variable (a b : α)

example : a < b  a  b  a  b := by
  rw [lt_iff_le_not_le]
  constructor
  · rintro h0, h1
    constructor
    · exact h0
    intro h2
    apply h1
    rw [h2]
  rintro h0, h1
  constructor
  · exact h0
  intro h2
  apply h1
  apply le_antisymm h0 h2

end

section

variable {α : Type _} [Preorder α]

variable (a b c : α)

example : ¬a < a := by
  rw [lt_iff_le_not_le]
  rintro h0, h1
  exact h1 h0

example : a < b  b < c  a < c := by
  simp only [lt_iff_le_not_le]
  rintro h0, h1 h2, h3
  constructor
  · apply le_trans h0 h2
  intro h4
  apply h1
  apply le_trans h2 h4

end