Documentation

Mathlib.Algebra.GroupWithZero.Commute

Lemmas about commuting elements in a MonoidWithZero or a GroupWithZero. #

source
theorem Ring.mul_inverse_rev' {M₀ : Type u_1} [MonoidWithZero M₀] {a : M₀} {b : M₀} (h : Commute a b) :
Ring.inverse (a * b) = Ring.inverse b * Ring.inverse a
source
theorem Ring.mul_inverse_rev {M₀ : Type u_3} [CommMonoidWithZero M₀] (a : M₀) (b : M₀) :
Ring.inverse (a * b) = Ring.inverse b * Ring.inverse a
source
theorem Ring.inverse_pow {M₀ : Type u_1} [MonoidWithZero M₀] (r : M₀) (n : ℕ) :
Ring.inverse r ^ n = Ring.inverse (r ^ n)
source
theorem Commute.ring_inverse_ring_inverse {M₀ : Type u_1} [MonoidWithZero M₀] {a : M₀} {b : M₀} (h : Commute a b) :
Commute (Ring.inverse a) (Ring.inverse b)
source
@[simp]
theorem Commute.zero_right {G₀ : Type u_2} [MulZeroClass G₀] (a : G₀) :
Commute a 0
source
@[simp]
theorem Commute.zero_left {G₀ : Type u_2} [MulZeroClass G₀] (a : G₀) :
Commute 0 a
source
@[simp]
theorem Commute.inv_left_iff₀ {G₀ : Type u_2} [GroupWithZero G₀] {a : G₀} {b : G₀} :
Commute a⁻¹ b ↔ Commute a b
source
theorem Commute.inv_left₀ {G₀ : Type u_2} [GroupWithZero G₀] {a : G₀} {b : G₀} (h : Commute a b) :
Commute a⁻¹ b
source
@[simp]
theorem Commute.inv_right_iff₀ {G₀ : Type u_2} [GroupWithZero G₀] {a : G₀} {b : G₀} :
Commute a b⁻¹ ↔ Commute a b
source
theorem Commute.inv_right₀ {G₀ : Type u_2} [GroupWithZero G₀] {a : G₀} {b : G₀} (h : Commute a b) :
Commute a b⁻¹
source
@[simp]
theorem Commute.div_right {G₀ : Type u_2} [GroupWithZero G₀] {a : G₀} {b : G₀} {c : G₀} (hab : Commute a b) (hac : Commute a c) :
Commute a (b / c)
source
@[simp]
theorem Commute.div_left {G₀ : Type u_2} [GroupWithZero G₀] {a : G₀} {b : G₀} {c : G₀} (hac : Commute a c) (hbc : Commute b c) :
Commute (a / b) c
source
theorem pow_inv_comm₀ {G₀ : Type u_2} [GroupWithZero G₀] (a : G₀) (m : ℕ) (n : ℕ) :
a⁻¹ ^ m * a ^ n = a ^ n * a⁻¹ ^ m