Midpoint of a segment #

Main definitions #

midpoint R x y: midpoint of the segment [x, y]. We define it for x and y in a module over a ring R with invertible 2.
AddMonoidHom.ofMapMidpoint: construct an AddMonoidHom given a map f such that f sends zero to zero and midpoints to midpoints.

Main theorems #

midpoint_eq_iff: z is the midpoint of [x, y] if and only if x + y = z + z,
midpoint_unique: midpoint R x y does not depend on R;
midpoint x y is linear both in x and y;
pointReflection_midpoint_left, pointReflection_midpoint_right: Equiv.pointReflection (midpoint R x y) swaps x and y.

We do not mark most lemmas as @[simp] because it is hard to tell which side is simpler.

Tags #

midpoint, AddMonoidHom

source

🔸 coverage

def midpoint (R : Type u_1) {V : Type u_2} {P : Type u_4} [Ring R] [Invertible 2] [AddCommGroup V] [Module R V] [AddTorsor V P] (x y : P) :

midpoint x y is the midpoint of the segment [x, y].

Equations

Instances For

source

📐 coverage

@[simp]

theorem AffineMap.map_midpoint {R : Type u_1} {V : Type u_2} {V' : Type u_3} {P : Type u_4} {P' : Type u_5} [Ring R] [Invertible 2] [AddCommGroup V] [Module R V] [AddTorsor V P] [AddCommGroup V'] [Module R V'] [AddTorsor V' P'] (f : P →ᵃ[R] P') (a b : P) :

f (midpoint R a b) = midpoint R (f a) (f b)

source

📐 coverage

@[simp]

theorem AffineEquiv.map_midpoint {R : Type u_1} {V : Type u_2} {V' : Type u_3} {P : Type u_4} {P' : Type u_5} [Ring R] [Invertible 2] [AddCommGroup V] [Module R V] [AddTorsor V P] [AddCommGroup V'] [Module R V'] [AddTorsor V' P'] (f : P ≃ᵃ[R] P') (a b : P) :

f (midpoint R a b) = midpoint R (f a) (f b)

source

📐 coverage

theorem AffineEquiv.pointReflection_midpoint_left {R : Type u_1} {V : Type u_2} {P : Type u_4} [Ring R] [Invertible 2] [AddCommGroup V] [Module R V] [AddTorsor V P] (x y : P) :

(pointReflection R (midpoint R x y)) x = y

source

📐 coverage

@[simp]

theorem Equiv.pointReflection_midpoint_left {R : Type u_1} {V : Type u_2} {P : Type u_4} [Ring R] [Invertible 2] [AddCommGroup V] [Module R V] [AddTorsor V P] (x y : P) :

(pointReflection (midpoint R x y)) x = y

source

📐 coverage

theorem midpoint_comm {R : Type u_1} {V : Type u_2} {P : Type u_4} [Ring R] [Invertible 2] [AddCommGroup V] [Module R V] [AddTorsor V P] (x y : P) :

midpoint R x y = midpoint R y x

source

📐 coverage

theorem AffineEquiv.pointReflection_midpoint_right {R : Type u_1} {V : Type u_2} {P : Type u_4} [Ring R] [Invertible 2] [AddCommGroup V] [Module R V] [AddTorsor V P] (x y : P) :

(pointReflection R (midpoint R x y)) y = x

source

📐 coverage

@[simp]

theorem Equiv.pointReflection_midpoint_right {R : Type u_1} {V : Type u_2} {P : Type u_4} [Ring R] [Invertible 2] [AddCommGroup V] [Module R V] [AddTorsor V P] (x y : P) :

(pointReflection (midpoint R x y)) y = x

source

📐 coverage

theorem midpoint_vsub_midpoint {R : Type u_1} {V : Type u_2} {P : Type u_4} [Ring R] [Invertible 2] [AddCommGroup V] [Module R V] [AddTorsor V P] (p₁ p₂ p₃ p₄ : P) :

midpoint R p₁ p₂ -ᵥ midpoint R p₃ p₄ = midpoint R (p₁ -ᵥ p₃) (p₂ -ᵥ p₄)

source

📐 coverage

theorem midpoint_vadd_midpoint {R : Type u_1} {V : Type u_2} {P : Type u_4} [Ring R] [Invertible 2] [AddCommGroup V] [Module R V] [AddTorsor V P] (v v' : V) (p p' : P) :

midpoint R v v' +ᵥ midpoint R p p' = midpoint R (v +ᵥ p) (v' +ᵥ p')

source

📐 coverage

theorem midpoint_eq_iff {R : Type u_1} {V : Type u_2} {P : Type u_4} [Ring R] [Invertible 2] [AddCommGroup V] [Module R V] [AddTorsor V P] {x y z : P} :

midpoint R x y = z ↔ (AffineEquiv.pointReflection R z) x = y

source

📐 coverage

@[simp]

theorem midpoint_pointReflection_left {R : Type u_1} {V : Type u_2} {P : Type u_4} [Ring R] [Invertible 2] [AddCommGroup V] [Module R V] [AddTorsor V P] (x y : P) :

midpoint R ((Equiv.pointReflection x) y) y = x

source

📐 coverage

@[simp]

theorem midpoint_pointReflection_right {R : Type u_1} {V : Type u_2} {P : Type u_4} [Ring R] [Invertible 2] [AddCommGroup V] [Module R V] [AddTorsor V P] (x y : P) :

midpoint R y ((Equiv.pointReflection x) y) = x

source

📐 coverage

theorem AffineEquiv.midpoint_pointReflection_left {R : Type u_1} {V : Type u_2} {P : Type u_4} [Ring R] [Invertible 2] [AddCommGroup V] [Module R V] [AddTorsor V P] (x y : P) :

midpoint R ((pointReflection R x) y) y = x

source

📐 coverage

theorem AffineEquiv.midpoint_pointReflection_right {R : Type u_1} {V : Type u_2} {P : Type u_4} [Ring R] [Invertible 2] [AddCommGroup V] [Module R V] [AddTorsor V P] (x y : P) :

midpoint R y ((pointReflection R x) y) = x

source

📐 coverage

@[simp]

theorem midpoint_vsub_left {R : Type u_1} {V : Type u_2} {P : Type u_4} [Ring R] [Invertible 2] [AddCommGroup V] [Module R V] [AddTorsor V P] (p₁ p₂ : P) :

midpoint R p₁ p₂ -ᵥ p₁ = ⅟2 • (p₂ -ᵥ p₁)

source

📐 coverage

@[simp]

theorem midpoint_vsub_right {R : Type u_1} {V : Type u_2} {P : Type u_4} [Ring R] [Invertible 2] [AddCommGroup V] [Module R V] [AddTorsor V P] (p₁ p₂ : P) :

midpoint R p₁ p₂ -ᵥ p₂ = ⅟2 • (p₁ -ᵥ p₂)

source

📐 coverage

@[simp]

theorem left_vsub_midpoint {R : Type u_1} {V : Type u_2} {P : Type u_4} [Ring R] [Invertible 2] [AddCommGroup V] [Module R V] [AddTorsor V P] (p₁ p₂ : P) :

p₁ -ᵥ midpoint R p₁ p₂ = ⅟2 • (p₁ -ᵥ p₂)

source

📐 coverage

@[simp]

theorem right_vsub_midpoint {R : Type u_1} {V : Type u_2} {P : Type u_4} [Ring R] [Invertible 2] [AddCommGroup V] [Module R V] [AddTorsor V P] (p₁ p₂ : P) :

p₂ -ᵥ midpoint R p₁ p₂ = ⅟2 • (p₂ -ᵥ p₁)

source

📐 coverage

theorem midpoint_vsub {R : Type u_1} {V : Type u_2} {P : Type u_4} [Ring R] [Invertible 2] [AddCommGroup V] [Module R V] [AddTorsor V P] (p₁ p₂ p : P) :

midpoint R p₁ p₂ -ᵥ p = ⅟2 • (p₁ -ᵥ p) + ⅟2 • (p₂ -ᵥ p)

source

📐 coverage

theorem vsub_midpoint {R : Type u_1} {V : Type u_2} {P : Type u_4} [Ring R] [Invertible 2] [AddCommGroup V] [Module R V] [AddTorsor V P] (p₁ p₂ p : P) :

p -ᵥ midpoint R p₁ p₂ = ⅟2 • (p -ᵥ p₁) + ⅟2 • (p -ᵥ p₂)

source

📐 coverage

@[simp]

theorem midpoint_sub_left {R : Type u_1} {V : Type u_2} [Ring R] [Invertible 2] [AddCommGroup V] [Module R V] (v₁ v₂ : V) :

midpoint R v₁ v₂ - v₁ = ⅟2 • (v₂ - v₁)

source

📐 coverage

@[simp]

theorem midpoint_sub_right {R : Type u_1} {V : Type u_2} [Ring R] [Invertible 2] [AddCommGroup V] [Module R V] (v₁ v₂ : V) :

midpoint R v₁ v₂ - v₂ = ⅟2 • (v₁ - v₂)

source

📐 coverage

@[simp]

theorem left_sub_midpoint {R : Type u_1} {V : Type u_2} [Ring R] [Invertible 2] [AddCommGroup V] [Module R V] (v₁ v₂ : V) :

v₁ - midpoint R v₁ v₂ = ⅟2 • (v₁ - v₂)

source

📐 coverage

@[simp]

theorem right_sub_midpoint {R : Type u_1} {V : Type u_2} [Ring R] [Invertible 2] [AddCommGroup V] [Module R V] (v₁ v₂ : V) :

v₂ - midpoint R v₁ v₂ = ⅟2 • (v₂ - v₁)

source

📐 coverage

@[simp]

theorem midpoint_eq_left_iff (R : Type u_1) {V : Type u_2} {P : Type u_4} [Ring R] [Invertible 2] [AddCommGroup V] [Module R V] [AddTorsor V P] {x y : P} :

midpoint R x y = x ↔ x = y

source

📐 coverage

@[simp]

theorem left_eq_midpoint_iff (R : Type u_1) {V : Type u_2} {P : Type u_4} [Ring R] [Invertible 2] [AddCommGroup V] [Module R V] [AddTorsor V P] {x y : P} :

x = midpoint R x y ↔ x = y

source

📐 coverage

@[simp]

theorem midpoint_eq_right_iff (R : Type u_1) {V : Type u_2} {P : Type u_4} [Ring R] [Invertible 2] [AddCommGroup V] [Module R V] [AddTorsor V P] {x y : P} :

midpoint R x y = y ↔ x = y

source

📐 coverage

@[simp]

theorem right_eq_midpoint_iff (R : Type u_1) {V : Type u_2} {P : Type u_4} [Ring R] [Invertible 2] [AddCommGroup V] [Module R V] [AddTorsor V P] {x y : P} :

y = midpoint R x y ↔ x = y

source

📐 coverage

theorem midpoint_eq_midpoint_iff_vsub_eq_vsub (R : Type u_1) {V : Type u_2} {P : Type u_4} [Ring R] [Invertible 2] [AddCommGroup V] [Module R V] [AddTorsor V P] {x x' y y' : P} :

midpoint R x y = midpoint R x' y' ↔ x -ᵥ x' = y' -ᵥ y

source

📐 coverage

theorem midpoint_eq_iff' (R : Type u_1) {V : Type u_2} {P : Type u_4} [Ring R] [Invertible 2] [AddCommGroup V] [Module R V] [AddTorsor V P] {x y z : P} :

midpoint R x y = z ↔ (Equiv.pointReflection z) x = y

source

📐 coverage

theorem midpoint_unique (R : Type u_1) {V : Type u_2} {P : Type u_4} [Ring R] [Invertible 2] [AddCommGroup V] [Module R V] [AddTorsor V P] (R' : Type u_6) [Ring R'] [Invertible 2] [Module R' V] (x y : P) :

midpoint R x y = midpoint R' x y

midpoint does not depend on the ring R.

source

📐 coverage

@[simp]

theorem midpoint_self (R : Type u_1) {V : Type u_2} {P : Type u_4} [Ring R] [Invertible 2] [AddCommGroup V] [Module R V] [AddTorsor V P] (x : P) :

midpoint R x x = x

source

📐 coverage

@[simp]

theorem midpoint_add_self (R : Type u_1) {V : Type u_2} [Ring R] [Invertible 2] [AddCommGroup V] [Module R V] (x y : V) :

midpoint R x y + midpoint R x y = x + y

source

📐 coverage

theorem midpoint_zero_add (R : Type u_1) {V : Type u_2} [Ring R] [Invertible 2] [AddCommGroup V] [Module R V] (x y : V) :

midpoint R 0 (x + y) = midpoint R x y

source

📐 coverage

theorem midpoint_eq_smul_add (R : Type u_1) {V : Type u_2} [Ring R] [Invertible 2] [AddCommGroup V] [Module R V] (x y : V) :

midpoint R x y = ⅟2 • (x + y)

source

📐 coverage

@[simp]

theorem midpoint_self_neg (R : Type u_1) {V : Type u_2} [Ring R] [Invertible 2] [AddCommGroup V] [Module R V] (x : V) :

midpoint R x (-x) = 0

source

📐 coverage

@[simp]

theorem midpoint_neg_self (R : Type u_1) {V : Type u_2} [Ring R] [Invertible 2] [AddCommGroup V] [Module R V] (x : V) :

midpoint R (-x) x = 0

source

📐 coverage

@[simp]

theorem midpoint_sub_add (R : Type u_1) {V : Type u_2} [Ring R] [Invertible 2] [AddCommGroup V] [Module R V] (x y : V) :

midpoint R (x - y) (x + y) = x

source

📐 coverage

@[simp]

theorem midpoint_add_sub (R : Type u_1) {V : Type u_2} [Ring R] [Invertible 2] [AddCommGroup V] [Module R V] (x y : V) :

midpoint R (x + y) (x - y) = x

source

📐 coverage

theorem midpoint_vsub_midpoint_same_left (R : Type u_1) {V : Type u_2} {P : Type u_4} [Ring R] [Invertible 2] [AddCommGroup V] [Module R V] [AddTorsor V P] (p₁ p₂ p₃ : P) :

midpoint R p₁ p₂ -ᵥ midpoint R p₁ p₃ = ⅟2 • (p₂ -ᵥ p₃)

source

📐 coverage

theorem midpoint_vsub_midpoint_same_right (R : Type u_1) {V : Type u_2} {P : Type u_4} [Ring R] [Invertible 2] [AddCommGroup V] [Module R V] [AddTorsor V P] (p₁ p₂ p₃ : P) :

midpoint R p₁ p₃ -ᵥ midpoint R p₂ p₃ = ⅟2 • (p₁ -ᵥ p₂)

source

🔸 coverage

def AddMonoidHom.ofMapMidpoint (R : Type u_1) (R' : Type u_2) {E : Type u_3} {F : Type u_4} [Ring R] [Invertible 2] [AddCommGroup E] [Module R E] [Ring R'] [Invertible 2] [AddCommGroup F] [Module R' F] (f : E → F) (h0 : f 0 = 0) (hm : ∀ (x y : E), f (midpoint R x y) = midpoint R' (f x) (f y)) :

E →+ F

A map f : E → F sending zero to zero and midpoints to midpoints is an AddMonoidHom.

Equations

Instances For

source

📐 coverage

@[simp]

theorem AddMonoidHom.coe_ofMapMidpoint (R : Type u_1) (R' : Type u_2) {E : Type u_3} {F : Type u_4} [Ring R] [Invertible 2] [AddCommGroup E] [Module R E] [Ring R'] [Invertible 2] [AddCommGroup F] [Module R' F] (f : E → F) (h0 : f 0 = 0) (hm : ∀ (x y : E), f (midpoint R x y) = midpoint R' (f x) (f y)) :

⇑(ofMapMidpoint R R' f h0 hm) = f

Documentation

Mathlib.LinearAlgebra.AffineSpace.Midpoint

Midpoint of a segment #

Main definitions #

Main theorems #

Tags #