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
import data.real.basic

structure add_group₁ (α : Type*) :=
(add: α  α  α)
(zero: α)
(neg: α  α)
(add_assoc :  x y z : α, add (add x y) z = add x (add y z))
(add_zero:  x : α, add x zero = x)
(zero_add:  x : α, add x zero = x)
(add_left_neg :  x : α, add (neg x) x = zero)

@[ext] structure point := (x : ) (y : ) (z : )

namespace point

def add (a b : point) : point := a.x + b.x, a.y + b.y, a.z + b.z

def neg (a : point) : point := -a.x, -a.y, -a.z

def zero : point := 0, 0, 0

def add_group_point : add_group₁ point :=
{ add          := point.add,
  zero         := point.zero,
  neg          := point.neg,
  add_assoc    := by { simp [point.add, add_assoc] },
  add_zero     := by { simp [point.add, point.zero], intro, ext; refl },
  zero_add     := by { simp [point.add, point.zero], intro, ext; refl },
  add_left_neg := by { simp [point.add, point.neg, point.zero] } }

end point

class add_group₂ (α : Type*) :=
(add: α  α  α)
(zero: α)
(neg: α  α)
(add_assoc :  x y z : α, add (add x y) z = add x (add y z))
(add_zero:  x : α, add x zero = x)
(zero_add:  x : α, add x zero = x)
(add_left_neg :  x : α, add (neg x) x = zero)

instance has_add_add_group₂ {α : Type*} [add_group₂ α] :
has_add α := add_group₂.add

instance has_zero_add_group₂ {α : Type*} [add_group₂ α] :
has_zero α := add_group₂.zero

instance has_neg_add_group₂ {α : Type*} [add_group₂ α] :
has_neg α := add_group₂.neg

instance : add_group₂ point :=
{ add          := point.add,
  zero         := point.zero,
  neg          := point.neg,
  add_assoc    := by { simp [point.add, add_assoc] },
  add_zero     := by { simp [point.add, point.zero], intro, ext; refl },
  zero_add     := by { simp [point.add, point.zero], intro, ext; refl },
  add_left_neg := by { simp [point.add, point.neg, point.zero] } }

section
variables (x y : point)

#check x + -y + 0
end