Loogle!
Result
Found 646 declarations mentioning Invertible. Of these, only the first 200 are shown.
- Invertible 📋 Mathlib.Algebra.Group.Invertible.Defs
{α : Type u} [Mul α] [One α] (a : α) : Type u - Invertible.invOf 📋 Mathlib.Algebra.Group.Invertible.Defs
{α : Type u} {inst✝ : Mul α} {inst✝¹ : One α} (a : α) [self : Invertible a] : α - invertibleInvOf 📋 Mathlib.Algebra.Group.Invertible.Defs
{α : Type u} [One α] [Mul α] {a : α} [Invertible a] : Invertible ⅟a - Invertible.subsingleton 📋 Mathlib.Algebra.Group.Invertible.Defs
{α : Type u} [Monoid α] (a : α) : Subsingleton (Invertible a) - invertibleOfGroup 📋 Mathlib.Algebra.Group.Invertible.Defs
{α : Type u} [Group α] (a : α) : Invertible a - invertibleOne 📋 Mathlib.Algebra.Group.Invertible.Defs
{α : Type u} [Monoid α] : Invertible 1 - invOf_mul_self 📋 Mathlib.Algebra.Group.Invertible.Defs
{α : Type u} [Mul α] [One α] (a : α) [Invertible a] : ⅟a * a = 1 - invOf_mul_self' 📋 Mathlib.Algebra.Group.Invertible.Defs
{α : Type u} [Mul α] [One α] (a : α) {x✝ : Invertible a} : ⅟a * a = 1 - mul_invOf_self 📋 Mathlib.Algebra.Group.Invertible.Defs
{α : Type u} [Mul α] [One α] (a : α) [Invertible a] : a * ⅟a = 1 - mul_invOf_self' 📋 Mathlib.Algebra.Group.Invertible.Defs
{α : Type u} [Mul α] [One α] (a : α) {x✝ : Invertible a} : a * ⅟a = 1 - Invertible.invOf_mul_self 📋 Mathlib.Algebra.Group.Invertible.Defs
{α : Type u} {inst✝ : Mul α} {inst✝¹ : One α} {a : α} [self : Invertible a] : ⅟a * a = 1 - Invertible.mul_invOf_self 📋 Mathlib.Algebra.Group.Invertible.Defs
{α : Type u} {inst✝ : Mul α} {inst✝¹ : One α} {a : α} [self : Invertible a] : a * ⅟a = 1 - Invertible.copy 📋 Mathlib.Algebra.Group.Invertible.Defs
{α : Type u} [MulOneClass α] {r : α} (hr : Invertible r) (s : α) (hs : s = r) : Invertible s - Invertible.mk 📋 Mathlib.Algebra.Group.Invertible.Defs
{α : Type u} [Mul α] [One α] {a : α} (invOf : α) (invOf_mul_self : invOf * a = 1) (mul_invOf_self : a * invOf = 1) : Invertible a - Invertible.copy' 📋 Mathlib.Algebra.Group.Invertible.Defs
{α : Type u} [MulOneClass α] {r : α} (hr : Invertible r) (s si : α) (hs : s = r) (hsi : si = ⅟r) : Invertible s - invertibleOfLeftInverse 📋 Mathlib.Algebra.Group.Invertible.Defs
{α : Type u} [Monoid α] [IsDedekindFiniteMonoid α] (a b : α) (h : b * a = 1) : Invertible a - invertibleOfRightInverse 📋 Mathlib.Algebra.Group.Invertible.Defs
{α : Type u} [Monoid α] [IsDedekindFiniteMonoid α] (a b : α) (h : a * b = 1) : Invertible a - mul_left_inj_of_invertible 📋 Mathlib.Algebra.Group.Invertible.Defs
{α : Type u} [Monoid α] {a b : α} (c : α) [Invertible c] : a * c = b * c ↔ a = b - mul_right_inj_of_invertible 📋 Mathlib.Algebra.Group.Invertible.Defs
{α : Type u} [Monoid α] {a b : α} (c : α) [Invertible c] : c * a = c * b ↔ a = b - invOf_eq_group_inv 📋 Mathlib.Algebra.Group.Invertible.Defs
{α : Type u} [Group α] (a : α) [Invertible a] : ⅟a = a⁻¹ - invertibleMul 📋 Mathlib.Algebra.Group.Invertible.Defs
{α : Type u} [Monoid α] (a b : α) [Invertible a] [Invertible b] : Invertible (a * b) - Invertible.mul 📋 Mathlib.Algebra.Group.Invertible.Defs
{α : Type u} [Monoid α] {a b : α} : Invertible a → Invertible b → Invertible (a * b) - invOf_mul_cancel_left 📋 Mathlib.Algebra.Group.Invertible.Defs
{α : Type u} [Monoid α] (a b : α) [Invertible a] : ⅟a * (a * b) = b - invOf_mul_cancel_left' 📋 Mathlib.Algebra.Group.Invertible.Defs
{α : Type u} [Monoid α] (a b : α) {x✝ : Invertible a} : ⅟a * (a * b) = b - invOf_mul_cancel_right 📋 Mathlib.Algebra.Group.Invertible.Defs
{α : Type u} [Monoid α] (a b : α) [Invertible b] : a * ⅟b * b = a - invOf_mul_cancel_right' 📋 Mathlib.Algebra.Group.Invertible.Defs
{α : Type u} [Monoid α] (a b : α) {x✝ : Invertible b} : a * ⅟b * b = a - mul_invOf_cancel_left 📋 Mathlib.Algebra.Group.Invertible.Defs
{α : Type u} [Monoid α] (a b : α) [Invertible a] : a * (⅟a * b) = b - mul_invOf_cancel_left' 📋 Mathlib.Algebra.Group.Invertible.Defs
{α : Type u} [Monoid α] (a b : α) {x✝ : Invertible a} : a * (⅟a * b) = b - mul_invOf_cancel_right 📋 Mathlib.Algebra.Group.Invertible.Defs
{α : Type u} [Monoid α] (a b : α) [Invertible b] : a * b * ⅟b = a - mul_invOf_cancel_right' 📋 Mathlib.Algebra.Group.Invertible.Defs
{α : Type u} [Monoid α] (a b : α) {x✝ : Invertible b} : a * b * ⅟b = a - invOf_eq_left_inv 📋 Mathlib.Algebra.Group.Invertible.Defs
{α : Type u} [Monoid α] {a b : α} [Invertible a] (hac : b * a = 1) : ⅟a = b - invOf_eq_right_inv 📋 Mathlib.Algebra.Group.Invertible.Defs
{α : Type u} [Monoid α] {a b : α} [Invertible a] (hac : a * b = 1) : ⅟a = b - invOf_eq_iff_left 📋 Mathlib.Algebra.Group.Invertible.Defs
{α : Type u} [Monoid α] {a b : α} [Invertible a] : ⅟a = b ↔ b * a = 1 - invOf_eq_iff_right 📋 Mathlib.Algebra.Group.Invertible.Defs
{α : Type u} [Monoid α] {a b : α} [Invertible a] : ⅟a = b ↔ a * b = 1 - invOf_one 📋 Mathlib.Algebra.Group.Invertible.Defs
{α : Type u} [Monoid α] [Invertible 1] : ⅟1 = 1 - invOf_one' 📋 Mathlib.Algebra.Group.Invertible.Defs
{α : Type u} [Monoid α] {x✝ : Invertible 1} : ⅟1 = 1 - invOf_mul_eq_iff_eq_mul_left 📋 Mathlib.Algebra.Group.Invertible.Defs
{α : Type u} [Monoid α] {a b c : α} [Invertible c] : ⅟c * a = b ↔ a = c * b - mul_invOf_eq_iff_eq_mul_right 📋 Mathlib.Algebra.Group.Invertible.Defs
{α : Type u} [Monoid α] {a b c : α} [Invertible c] : a * ⅟c = b ↔ a = b * c - mul_left_eq_iff_eq_invOf_mul 📋 Mathlib.Algebra.Group.Invertible.Defs
{α : Type u} [Monoid α] {a b c : α} [Invertible c] : c * a = b ↔ a = ⅟c * b - mul_right_eq_iff_eq_mul_invOf 📋 Mathlib.Algebra.Group.Invertible.Defs
{α : Type u} [Monoid α] {a b c : α} [Invertible c] : a * c = b ↔ a = b * ⅟c - invertible_unique 📋 Mathlib.Algebra.Group.Invertible.Defs
{α : Type u} [Monoid α] (a b : α) [Invertible a] [Invertible b] (h : a = b) : ⅟a = ⅟b - Invertible.congr 📋 Mathlib.Algebra.Group.Invertible.Defs
{α : Type u} [Monoid α] (a b : α) [Invertible a] [Invertible b] (h : a = b) : ⅟a = ⅟b - invOf_inj 📋 Mathlib.Algebra.Group.Invertible.Defs
{α : Type u} [Monoid α] {a b : α} [Invertible a] [Invertible b] : ⅟a = ⅟b ↔ a = b - invOf_invOf 📋 Mathlib.Algebra.Group.Invertible.Defs
{α : Type u} [Monoid α] (a : α) [Invertible a] [Invertible ⅟a] : ⅟⅟a = a - invOf_mul 📋 Mathlib.Algebra.Group.Invertible.Defs
{α : Type u} [Monoid α] (a b : α) [Invertible a] [Invertible b] [Invertible (a * b)] : ⅟(a * b) = ⅟b * ⅟a - commute_invOf 📋 Mathlib.Algebra.Group.Invertible.Basic
{M : Type u_1} [One M] [Mul M] (m : M) [Invertible m] : Commute m ⅟m - unitOfInvertible 📋 Mathlib.Algebra.Group.Invertible.Basic
{α : Type u} [Monoid α] (a : α) [Invertible a] : αˣ - isUnit_of_invertible 📋 Mathlib.Algebra.Group.Invertible.Basic
{α : Type u} [Monoid α] (a : α) [Invertible a] : IsUnit a - IsUnit.invertible 📋 Mathlib.Algebra.Group.Invertible.Basic
{α : Type u} [Monoid α] {a : α} (h : IsUnit a) : Invertible a - IsUnit.nonempty_invertible 📋 Mathlib.Algebra.Group.Invertible.Basic
{α : Type u} [Monoid α] {a : α} (h : IsUnit a) : Nonempty (Invertible a) - Units.invertible 📋 Mathlib.Algebra.Group.Invertible.Basic
{α : Type u} [Monoid α] (u : αˣ) : Invertible ↑u - nonempty_invertible_iff_isUnit 📋 Mathlib.Algebra.Group.Invertible.Basic
{α : Type u} [Monoid α] (a : α) : Nonempty (Invertible a) ↔ IsUnit a - val_unitOfInvertible 📋 Mathlib.Algebra.Group.Invertible.Basic
{α : Type u} [Monoid α] (a : α) [Invertible a] : ↑(unitOfInvertible a) = a - invertiblePow 📋 Mathlib.Algebra.Group.Invertible.Basic
{α : Type u} [Monoid α] (m : α) [Invertible m] (n : ℕ) : Invertible (m ^ n) - val_inv_unitOfInvertible 📋 Mathlib.Algebra.Group.Invertible.Basic
{α : Type u} [Monoid α] (a : α) [Invertible a] : ↑(unitOfInvertible a)⁻¹ = ⅟a - Invertible.map 📋 Mathlib.Algebra.Group.Invertible.Basic
{R : Type u_1} {S : Type u_2} {F : Type u_3} [MulOneClass R] [MulOneClass S] [FunLike F R S] [MonoidHomClass F R S] (f : F) (r : R) [Invertible r] : Invertible (f r) - invertibleOfPowEqOne 📋 Mathlib.Algebra.Group.Invertible.Basic
{α : Type u} [Monoid α] (x : α) (n : ℕ) (hx : x ^ n = 1) (hn : n ≠ 0) : Invertible x - invOf_units 📋 Mathlib.Algebra.Group.Invertible.Basic
{α : Type u} [Monoid α] (u : αˣ) [Invertible ↑u] : ⅟↑u = ↑u⁻¹ - Commute.invOf_left 📋 Mathlib.Algebra.Group.Invertible.Basic
{α : Type u} [Monoid α] {a b : α} [Invertible b] (h : Commute b a) : Commute (⅟b) a - Commute.invOf_right 📋 Mathlib.Algebra.Group.Invertible.Basic
{α : Type u} [Monoid α] {a b : α} [Invertible b] (h : Commute a b) : Commute a ⅟b - Invertible.ofLeftInverse 📋 Mathlib.Algebra.Group.Invertible.Basic
{R : Type u_1} {S : Type u_2} {G : Type u_3} [MulOneClass R] [MulOneClass S] [FunLike G S R] [MonoidHomClass G S R] (f : R → S) (g : G) (r : R) (h : Function.LeftInverse (⇑g) f) [Invertible (f r)] : Invertible r - invertibleOfInvertibleMul 📋 Mathlib.Algebra.Group.Invertible.Basic
{α : Type u} [Monoid α] (a b : α) [Invertible a] [Invertible (a * b)] : Invertible b - invertibleOfMulInvertible 📋 Mathlib.Algebra.Group.Invertible.Basic
{α : Type u} [Monoid α] (a b : α) [Invertible (a * b)] [Invertible b] : Invertible a - Invertible.mulLeft 📋 Mathlib.Algebra.Group.Invertible.Basic
{α : Type u} [Monoid α] {a : α} : Invertible a → (b : α) → Invertible b ≃ Invertible (a * b) - Invertible.mulRight 📋 Mathlib.Algebra.Group.Invertible.Basic
{α : Type u} [Monoid α] (a : α) {b : α} : Invertible b → Invertible a ≃ Invertible (a * b) - invertibleEquivOfLeftInverse 📋 Mathlib.Algebra.Group.Invertible.Basic
{R : Type u_1} {S : Type u_2} {F : Type u_3} {G : Type u_4} [Monoid R] [Monoid S] [FunLike F R S] [MonoidHomClass F R S] [FunLike G S R] [MonoidHomClass G S R] (f : F) (g : G) (r : R) (h : Function.LeftInverse ⇑g ⇑f) : Invertible (f r) ≃ Invertible r - map_invOf 📋 Mathlib.Algebra.Group.Invertible.Basic
{R : Type u_1} {S : Type u_2} {F : Type u_3} [MulOneClass R] [Monoid S] [FunLike F R S] [MonoidHomClass F R S] (f : F) (r : R) [Invertible r] [ifr : Invertible (f r)] : f ⅟r = ⅟(f r) - Invertible.ofLeftInverse_invOf 📋 Mathlib.Algebra.Group.Invertible.Basic
{R : Type u_1} {S : Type u_2} {G : Type u_3} [MulOneClass R] [MulOneClass S] [FunLike G S R] [MonoidHomClass G S R] (f : R → S) (g : G) (r : R) (h : Function.LeftInverse (⇑g) f) [Invertible (f r)] : ⅟r = ⅟(g (f r)) - invOf_pow 📋 Mathlib.Algebra.Group.Invertible.Basic
{α : Type u} [Monoid α] (m : α) [Invertible m] (n : ℕ) [Invertible (m ^ n)] : ⅟(m ^ n) = ⅟m ^ n - Invertible.mulLeft_apply 📋 Mathlib.Algebra.Group.Invertible.Basic
{α : Type u} [Monoid α] {a : α} (x✝ : Invertible a) (b : α) (x✝¹ : Invertible b) : (x✝.mulLeft b) x✝¹ = invertibleMul a b - Invertible.mulRight_apply 📋 Mathlib.Algebra.Group.Invertible.Basic
{α : Type u} [Monoid α] (a : α) {b : α} (x✝ : Invertible b) (x✝¹ : Invertible a) : (Invertible.mulRight a x✝) x✝¹ = invertibleMul a b - invertibleEquivOfLeftInverse_apply 📋 Mathlib.Algebra.Group.Invertible.Basic
{R : Type u_1} {S : Type u_2} {F : Type u_3} {G : Type u_4} [Monoid R] [Monoid S] [FunLike F R S] [MonoidHomClass F R S] [FunLike G S R] [MonoidHomClass G S R] (f : F) (g : G) (r : R) (h : Function.LeftInverse ⇑g ⇑f) (x✝ : Invertible (f r)) : (invertibleEquivOfLeftInverse f g r h) x✝ = Invertible.ofLeftInverse (⇑f) g r h - invertibleEquivOfLeftInverse_symm_apply 📋 Mathlib.Algebra.Group.Invertible.Basic
{R : Type u_1} {S : Type u_2} {F : Type u_3} {G : Type u_4} [Monoid R] [Monoid S] [FunLike F R S] [MonoidHomClass F R S] [FunLike G S R] [MonoidHomClass G S R] (f : F) (g : G) (r : R) (h : Function.LeftInverse ⇑g ⇑f) (x✝ : Invertible r) : (invertibleEquivOfLeftInverse f g r h).symm x✝ = Invertible.map f r - Invertible.mulLeft_symm_apply 📋 Mathlib.Algebra.Group.Invertible.Basic
{α : Type u} [Monoid α] {a : α} (x✝ : Invertible a) (b : α) (x✝¹ : Invertible (a * b)) : (x✝.mulLeft b).symm x✝¹ = invertibleOfInvertibleMul a b - Invertible.mulRight_symm_apply 📋 Mathlib.Algebra.Group.Invertible.Basic
{α : Type u} [Monoid α] (a : α) {b : α} (x✝ : Invertible b) (x✝¹ : Invertible (a * b)) : (Invertible.mulRight a x✝).symm x✝¹ = invertibleOfMulInvertible a b - Invertible.toNeZero 📋 Mathlib.Algebra.GroupWithZero.Invertible
{α : Type u} [MulZeroOneClass α] [Nontrivial α] (a : α) [Invertible a] : NeZero a - Invertible.ne_zero 📋 Mathlib.Algebra.GroupWithZero.Invertible
{α : Type u} [MulZeroOneClass α] (a : α) [Nontrivial α] [Invertible a] : a ≠ 0 - invertibleOfNonzero 📋 Mathlib.Algebra.GroupWithZero.Invertible
{α : Type u} [GroupWithZero α] {a : α} (h : a ≠ 0) : Invertible a - Ring.inverse_invertible 📋 Mathlib.Algebra.GroupWithZero.Invertible
{α : Type u} [MonoidWithZero α] (x : α) [Invertible x] : Ring.inverse x = ⅟x - div_self_of_invertible 📋 Mathlib.Algebra.GroupWithZero.Invertible
{α : Type u} [GroupWithZero α] (a : α) [Invertible a] : a / a = 1 - invertibleInv 📋 Mathlib.Algebra.GroupWithZero.Invertible
{α : Type u} [GroupWithZero α] {a : α} [Invertible a] : Invertible a⁻¹ - div_mul_cancel_of_invertible 📋 Mathlib.Algebra.GroupWithZero.Invertible
{α : Type u} [GroupWithZero α] (a b : α) [Invertible b] : a / b * b = a - mul_div_cancel_of_invertible 📋 Mathlib.Algebra.GroupWithZero.Invertible
{α : Type u} [GroupWithZero α] (a b : α) [Invertible b] : a * b / b = a - invOf_eq_inv 📋 Mathlib.Algebra.GroupWithZero.Invertible
{α : Type u} [GroupWithZero α] (a : α) [Invertible a] : ⅟a = a⁻¹ - inv_mul_cancel_of_invertible 📋 Mathlib.Algebra.GroupWithZero.Invertible
{α : Type u} [GroupWithZero α] (a : α) [Invertible a] : a⁻¹ * a = 1 - mul_inv_cancel_of_invertible 📋 Mathlib.Algebra.GroupWithZero.Invertible
{α : Type u} [GroupWithZero α] (a : α) [Invertible a] : a * a⁻¹ = 1 - invertibleDiv 📋 Mathlib.Algebra.GroupWithZero.Invertible
{α : Type u} [GroupWithZero α] (a b : α) [Invertible a] [Invertible b] : Invertible (a / b) - invOf_div 📋 Mathlib.Algebra.GroupWithZero.Invertible
{α : Type u} [GroupWithZero α] (a b : α) [Invertible a] [Invertible b] [Invertible (a / b)] : ⅟(a / b) = b / a - invertibleNeg 📋 Mathlib.Algebra.Ring.Invertible
{R : Type u_1} [Mul R] [One R] [HasDistribNeg R] (a : R) [Invertible a] : Invertible (-a) - pos_of_invertible_cast 📋 Mathlib.Algebra.Ring.Invertible
{R : Type u_1} [NonAssocSemiring R] [Nontrivial R] (n : ℕ) [Invertible ↑n] : 0 < n - invOf_neg 📋 Mathlib.Algebra.Ring.Invertible
{R : Type u_1} [Monoid R] [HasDistribNeg R] (a : R) [Invertible a] [Invertible (-a)] : ⅟(-a) = -⅟a - invOf_two_add_invOf_two 📋 Mathlib.Algebra.Ring.Invertible
{R : Type u_1} [NonAssocSemiring R] [Invertible 2] : ⅟2 + ⅟2 = 1 - one_sub_invOf_two 📋 Mathlib.Algebra.Ring.Invertible
{R : Type u_1} [Ring R] [Invertible 2] : 1 - ⅟2 = ⅟2 - invOf_add_invOf 📋 Mathlib.Algebra.Ring.Invertible
{R : Type u_1} [Semiring R] (a b : R) [Invertible a] [Invertible b] : ⅟a + ⅟b = ⅟a * (a + b) * ⅟b - invOf_sub_invOf 📋 Mathlib.Algebra.Ring.Invertible
{R : Type u_1} [Ring R] (a b : R) [Invertible a] [Invertible b] : ⅟a - ⅟b = ⅟a * (b - a) * ⅟b - neg_add_eq_mul_invOf_mul_same_iff 📋 Mathlib.Algebra.Ring.Invertible
{R : Type u_1} [Ring R] {a b : R} [Invertible a] [Invertible b] : -(b + a) = a * ⅟b * a ↔ -1 = ⅟a * b + ⅟b * a - eq_of_invOf_add_eq_invOf_add_invOf 📋 Mathlib.Algebra.Ring.Invertible
{R : Type u_1} [Ring R] {a b : R} [Invertible a] [Invertible b] [Invertible (a + b)] (h : ⅟(a + b) = ⅟a + ⅟b) : a * ⅟b * a = b * ⅟a * b - neg_one_eq_invOf_mul_add_invOf_mul_iff 📋 Mathlib.Algebra.Ring.Invertible
{R : Type u_1} [Ring R] {a b : R} [Invertible a] [Invertible b] [Invertible (a + b)] : ⅟(a + b) = ⅟a + ⅟b ↔ -1 = ⅟a * b + ⅟b * a - pos_invOf_of_invertible_cast 📋 Mathlib.Algebra.Order.Invertible
{R : Type u_1} [Semiring R] [LinearOrder R] [IsStrictOrderedRing R] (n : ℕ) [Invertible ↑n] : 0 < ⅟↑n - invOf_lt_zero 📋 Mathlib.Algebra.Order.Invertible
{R : Type u_1} [Semiring R] [LinearOrder R] [IsStrictOrderedRing R] {a : R} [Invertible a] : ⅟a < 0 ↔ a < 0 - invOf_nonneg 📋 Mathlib.Algebra.Order.Invertible
{R : Type u_1} [Semiring R] [LinearOrder R] [IsStrictOrderedRing R] {a : R} [Invertible a] : 0 ≤ ⅟a ↔ 0 ≤ a - invOf_nonpos 📋 Mathlib.Algebra.Order.Invertible
{R : Type u_1} [Semiring R] [LinearOrder R] [IsStrictOrderedRing R] {a : R} [Invertible a] : ⅟a ≤ 0 ↔ a ≤ 0 - invOf_pos 📋 Mathlib.Algebra.Order.Invertible
{R : Type u_1} [Semiring R] [LinearOrder R] [IsStrictOrderedRing R] {a : R} [Invertible a] : 0 < ⅟a ↔ 0 < a - invOf_le_one 📋 Mathlib.Algebra.Order.Invertible
{R : Type u_1} [Semiring R] [LinearOrder R] [IsStrictOrderedRing R] {a : R} [Invertible a] (h : 1 ≤ a) : ⅟a ≤ 1 - invOf_lt_one 📋 Mathlib.Algebra.Order.Invertible
{R : Type u_1} [Semiring R] [LinearOrder R] [IsStrictOrderedRing R] {a : R} [Invertible a] (h : 1 < a) : ⅟a < 1 - Mathlib.Meta.NormNum.IsRat.mk 📋 Mathlib.Tactic.NormNum.Result
{α : Type u} [Ring α] {a : α} {num : ℤ} {denom : ℕ} (inv : Invertible ↑denom) (eq : a = ↑num * ⅟↑denom) : Mathlib.Meta.NormNum.IsRat a num denom - Mathlib.Meta.NormNum.IsNNRat.mk 📋 Mathlib.Tactic.NormNum.Result
{α : Type u} [Semiring α] {a : α} {num denom : ℕ} (inv : Invertible ↑denom) (eq : a = ↑num * ⅟↑denom) : Mathlib.Meta.NormNum.IsNNRat a num denom - Mathlib.Meta.NormNum.invertibleOfMul 📋 Mathlib.Tactic.NormNum.Basic
{α : Type u_1} [Semiring α] (k : ℕ) (b a : α) [Invertible a] : a = ↑k * b → Invertible b - Mathlib.Meta.NormNum.invertibleOfMul' 📋 Mathlib.Tactic.NormNum.Basic
{α : Type u_1} [Semiring α] {a k b : ℕ} [Invertible ↑a] (h : a = k * b) : Invertible ↑b - Mathlib.Meta.NormNum.Rat.invOf_denom_swap 📋 Mathlib.Tactic.NormNum.Eq
{α : Type u_1} [Ring α] (n₁ n₂ : ℤ) (a₁ a₂ : α) [Invertible a₁] [Invertible a₂] : ↑n₁ * ⅟a₁ = ↑n₂ * ⅟a₂ ↔ ↑n₁ * a₂ = ↑n₂ * a₁ - Mathlib.Meta.NormNum.NNRat.invOf_denom_swap 📋 Mathlib.Tactic.NormNum.Eq
{α : Type u_1} [Semiring α] (n₁ n₂ : ℕ) (a₁ a₂ : α) [Invertible a₁] [Invertible a₂] : ↑n₁ * ⅟a₁ = ↑n₂ * ⅟a₂ ↔ ↑n₁ * a₂ = ↑n₂ * a₁ - invOf_smul_smul 📋 Mathlib.Algebra.Group.Action.Basic
{α : Type u_5} {β : Type u_6} [Monoid α] [MulAction α β] (c : α) (x : β) [Invertible c] : ⅟c • c • x = x - smul_invOf_smul 📋 Mathlib.Algebra.Group.Action.Basic
{α : Type u_5} {β : Type u_6} [Monoid α] [MulAction α β] (c : α) (x : β) [Invertible c] : c • ⅟c • x = x - invOf_smul_eq_iff 📋 Mathlib.Algebra.Group.Action.Basic
{α : Type u_5} {β : Type u_6} [Monoid α] [MulAction α β] {c : α} {x y : β} [Invertible c] : ⅟c • x = y ↔ x = c • y - smul_eq_iff_eq_invOf_smul 📋 Mathlib.Algebra.Group.Action.Basic
{α : Type u_5} {β : Type u_6} [Monoid α] [MulAction α β] {c : α} {x y : β} [Invertible c] : c • x = y ↔ x = ⅟c • y - Set.mem_invOf_smul_set 📋 Mathlib.Algebra.Group.Action.Pointwise.Set.Basic
{α : Type u_2} {β : Type u_3} [Monoid α] [MulAction α β] {s : Set β} {a : α} {b : β} [Invertible a] : b ∈ ⅟a • s ↔ a • b ∈ s - Set.invOf_mem_center 📋 Mathlib.Algebra.Group.Center
{M : Type u_1} [Monoid M] {a : M} [Invertible a] (ha : a ∈ Set.center M) : ⅟a ∈ Set.center M - Submodule.smul_mem_iff'' 📋 Mathlib.Algebra.Module.Submodule.Defs
{R : Type u} {M : Type v} [Semiring R] [AddCommMonoid M] {module_M : Module R M} (p : Submodule R M) {r : R} {x : M} [Invertible r] : r • x ∈ p ↔ x ∈ p - Invertible.algebraMapOfInvertibleAlgebraMap 📋 Mathlib.Algebra.Algebra.Basic
{R : Type u_1} {A : Type u_2} {B : Type u_3} [CommSemiring R] [Semiring A] [Semiring B] [Algebra R A] [Algebra R B] (f : A →ₗ[R] B) (hf : f 1 = 1) {r : R} (h : Invertible ((algebraMap R A) r)) : Invertible ((algebraMap R B) r) - invOf_two_smul_add_invOf_two_smul 📋 Mathlib.Algebra.Module.Basic
{M : Type u_3} (R : Type u_5) [Semiring R] [AddCommMonoid M] [Module R M] [Invertible 2] (x : M) : ⅟2 • x + ⅟2 • x = x - IsScalarTower.invertibleAlgebraCoeNat 📋 Mathlib.RingTheory.AlgebraTower
(R : Type u_1) (A : Type u_3) [CommSemiring R] [Semiring A] [Algebra R A] (n : ℕ) [inv : Invertible ↑n] : Invertible ↑n - IsScalarTower.Invertible.algebraTower 📋 Mathlib.RingTheory.AlgebraTower
(R : Type u_1) (S : Type u_2) (A : Type u_3) [CommSemiring R] [CommSemiring S] [Semiring A] [Algebra R S] [Algebra S A] [Algebra R A] [IsScalarTower R S A] (r : R) [Invertible ((algebraMap R S) r)] : Invertible ((algebraMap R A) r) - Invertible.star 📋 Mathlib.Algebra.Star.Basic
{R : Type u_1} [MulOneClass R] [StarMul R] (r : R) [Invertible r] : Invertible (star r) - star_invOf 📋 Mathlib.Algebra.Star.Basic
{R : Type u_1} [Monoid R] [StarMul R] (r : R) [Invertible r] [Invertible (star r)] : star ⅟r = ⅟(star r) - IsSelfAdjoint.invOf 📋 Mathlib.Algebra.Star.SelfAdjoint
{R : Type u_1} [Monoid R] [StarMul R] (x : R) [Invertible x] : IsSelfAdjoint x → IsSelfAdjoint ⅟x - IsSelfAdjoint.invOf_iff 📋 Mathlib.Algebra.Star.SelfAdjoint
{R : Type u_1} [Monoid R] [StarMul R] (x : R) [Invertible x] : IsSelfAdjoint ⅟x ↔ IsSelfAdjoint x - skewAdjointPart 📋 Mathlib.Algebra.Star.Module
(R : Type u_1) {A : Type u_2} [Semiring R] [StarMul R] [TrivialStar R] [AddCommGroup A] [Module R A] [StarAddMonoid A] [StarModule R A] [Invertible 2] : A →ₗ[R] ↥(skewAdjoint A) - selfAdjointPart 📋 Mathlib.Algebra.Star.Module
(R : Type u_1) {A : Type u_2} [Semiring R] [StarMul R] [TrivialStar R] [AddCommGroup A] [Module R A] [StarAddMonoid A] [StarModule R A] [Invertible 2] : A →ₗ[R] ↥(selfAdjoint A) - IsSelfAdjoint.coe_selfAdjointPart_apply 📋 Mathlib.Algebra.Star.Module
(R : Type u_1) {A : Type u_2} [Semiring R] [StarMul R] [TrivialStar R] [AddCommGroup A] [Module R A] [StarAddMonoid A] [StarModule R A] [Invertible 2] {x : A} (hx : IsSelfAdjoint x) : ↑((selfAdjointPart R) x) = x - IsSelfAdjoint.selfAdjointPart_apply 📋 Mathlib.Algebra.Star.Module
(R : Type u_1) {A : Type u_2} [Semiring R] [StarMul R] [TrivialStar R] [AddCommGroup A] [Module R A] [StarAddMonoid A] [StarModule R A] [Invertible 2] {x : A} (hx : IsSelfAdjoint x) : (selfAdjointPart R) x = ⟨x, hx⟩ - IsSelfAdjoint.skewAdjointPart_apply 📋 Mathlib.Algebra.Star.Module
(R : Type u_1) {A : Type u_2} [Semiring R] [StarMul R] [TrivialStar R] [AddCommGroup A] [Module R A] [StarAddMonoid A] [StarModule R A] [Invertible 2] {x : A} (hx : IsSelfAdjoint x) : (skewAdjointPart R) x = 0 - skewAdjointPart_apply_coe 📋 Mathlib.Algebra.Star.Module
(R : Type u_1) {A : Type u_2} [Semiring R] [StarMul R] [TrivialStar R] [AddCommGroup A] [Module R A] [StarAddMonoid A] [StarModule R A] [Invertible 2] (x : A) : ↑((skewAdjointPart R) x) = ⅟2 • (x - star x) - StarModule.decomposeProdAdjoint 📋 Mathlib.Algebra.Star.Module
(R : Type u_1) (A : Type u_2) [Semiring R] [StarMul R] [TrivialStar R] [AddCommGroup A] [Module R A] [StarAddMonoid A] [StarModule R A] [Invertible 2] : A ≃ₗ[R] ↥(selfAdjoint A) × ↥(skewAdjoint A) - selfAdjointPart_apply_coe 📋 Mathlib.Algebra.Star.Module
(R : Type u_1) {A : Type u_2} [Semiring R] [StarMul R] [TrivialStar R] [AddCommGroup A] [Module R A] [StarAddMonoid A] [StarModule R A] [Invertible 2] (x : A) : ↑((selfAdjointPart R) x) = ⅟2 • (x + star x) - skewAdjointPart_comp_subtype_skewAdjoint 📋 Mathlib.Algebra.Star.Module
(R : Type u_1) {A : Type u_2} [Semiring R] [StarMul R] [TrivialStar R] [AddCommGroup A] [Module R A] [StarAddMonoid A] [StarModule R A] [Invertible 2] : skewAdjointPart R ∘ₗ (skewAdjoint.submodule R A).subtype = LinearMap.id - selfAdjointPart_comp_subtype_selfAdjoint 📋 Mathlib.Algebra.Star.Module
(R : Type u_1) {A : Type u_2} [Semiring R] [StarMul R] [TrivialStar R] [AddCommGroup A] [Module R A] [StarAddMonoid A] [StarModule R A] [Invertible 2] : selfAdjointPart R ∘ₗ (selfAdjoint.submodule R A).subtype = LinearMap.id - StarModule.selfAdjointPart_add_skewAdjointPart 📋 Mathlib.Algebra.Star.Module
(R : Type u_1) {A : Type u_2} [Semiring R] [StarMul R] [TrivialStar R] [AddCommGroup A] [Module R A] [StarAddMonoid A] [StarModule R A] [Invertible 2] (x : A) : ↑((selfAdjointPart R) x) + ↑((skewAdjointPart R) x) = x - skewAdjointPart_comp_subtype_selfAdjoint 📋 Mathlib.Algebra.Star.Module
(R : Type u_1) {A : Type u_2} [Semiring R] [StarMul R] [TrivialStar R] [AddCommGroup A] [Module R A] [StarAddMonoid A] [StarModule R A] [Invertible 2] : skewAdjointPart R ∘ₗ (selfAdjoint.submodule R A).subtype = 0 - selfAdjointPart_comp_subtype_skewAdjoint 📋 Mathlib.Algebra.Star.Module
(R : Type u_1) {A : Type u_2} [Semiring R] [StarMul R] [TrivialStar R] [AddCommGroup A] [Module R A] [StarAddMonoid A] [StarModule R A] [Invertible 2] : selfAdjointPart R ∘ₗ (skewAdjoint.submodule R A).subtype = 0 - StarModule.decomposeProdAdjoint_apply 📋 Mathlib.Algebra.Star.Module
(R : Type u_1) (A : Type u_2) [Semiring R] [StarMul R] [TrivialStar R] [AddCommGroup A] [Module R A] [StarAddMonoid A] [StarModule R A] [Invertible 2] (i : A) : (StarModule.decomposeProdAdjoint R A) i = ((selfAdjointPart R) i, (skewAdjointPart R) i) - StarModule.decomposeProdAdjoint_symm_apply 📋 Mathlib.Algebra.Star.Module
(R : Type u_1) (A : Type u_2) [Semiring R] [StarMul R] [TrivialStar R] [AddCommGroup A] [Module R A] [StarAddMonoid A] [StarModule R A] [Invertible 2] (a : ↥(selfAdjoint A) × ↥(skewAdjoint A)) : (StarModule.decomposeProdAdjoint R A).symm a = (selfAdjoint.submodule R A).subtype a.1 + (skewAdjoint.submodule R A).subtype a.2 - IsLocalization.invertible_mk'_one 📋 Mathlib.RingTheory.Localization.Defs
{R : Type u_1} [CommSemiring R] {M : Submonoid R} {S : Type u_2} [CommSemiring S] [Algebra R S] [IsLocalization M S] (s : ↥M) : Invertible (IsLocalization.mk' S 1 s) - Polynomial.algEquivCMulXAddC 📋 Mathlib.Algebra.Polynomial.AlgebraMap
{R : Type u_3} [CommRing R] (a b : R) [Invertible a] : Polynomial R ≃ₐ[R] Polynomial R - Polynomial.algEquivCMulXAddC_symm_eq 📋 Mathlib.Algebra.Polynomial.AlgebraMap
{R : Type u_3} [CommRing R] (a b : R) [Invertible a] : (Polynomial.algEquivCMulXAddC a b).symm = Polynomial.algEquivCMulXAddC (⅟a) (-⅟a * b) - Polynomial.algEquivCMulXAddC_apply 📋 Mathlib.Algebra.Polynomial.AlgebraMap
{R : Type u_3} [CommRing R] (a b : R) [Invertible a] (a✝ : Polynomial R) : (Polynomial.algEquivCMulXAddC a b) a✝ = (Polynomial.aeval (Polynomial.C a * Polynomial.X + Polynomial.C b)) a✝ - Polynomial.dvd_comp_C_mul_X_add_C_iff 📋 Mathlib.Algebra.Polynomial.AlgebraMap
{R : Type u} [CommRing R] (p q : Polynomial R) (a b : R) [Invertible a] : p ∣ q.comp (Polynomial.C a * Polynomial.X + Polynomial.C b) ↔ p.comp (Polynomial.C ⅟a * (Polynomial.X - Polynomial.C b)) ∣ q - Polynomial.algEquivCMulXAddC_symm_apply 📋 Mathlib.Algebra.Polynomial.AlgebraMap
{R : Type u_3} [CommRing R] (a b : R) [Invertible a] (a✝ : Polynomial R) : (Polynomial.algEquivCMulXAddC a b).symm a✝ = (Polynomial.aeval (Polynomial.C ⅟a * (Polynomial.X - Polynomial.C b))) a✝ - Polynomial.eval₂_reverse_eq_zero_iff 📋 Mathlib.Algebra.Polynomial.Reverse
{R : Type u_1} [Semiring R] {S : Type u_2} [CommSemiring S] (i : R →+* S) (x : S) [Invertible x] (f : Polynomial R) : Polynomial.eval₂ i (⅟x) f.reverse = 0 ↔ Polynomial.eval₂ i x f = 0 - Polynomial.eval₂_reverse_mul_pow 📋 Mathlib.Algebra.Polynomial.Reverse
{R : Type u_1} [Semiring R] {S : Type u_2} [CommSemiring S] (i : R →+* S) (x : S) [Invertible x] (f : Polynomial R) : Polynomial.eval₂ i (⅟x) f.reverse * x ^ f.natDegree = Polynomial.eval₂ i x f - Polynomial.eval₂_reflect_eq_zero_iff 📋 Mathlib.Algebra.Polynomial.Reverse
{R : Type u_1} [Semiring R] {S : Type u_2} [CommSemiring S] (i : R →+* S) (x : S) [Invertible x] (N : ℕ) (f : Polynomial R) (hf : f.natDegree ≤ N) : Polynomial.eval₂ i (⅟x) (Polynomial.reflect N f) = 0 ↔ Polynomial.eval₂ i x f = 0 - Polynomial.eval₂_reflect_mul_pow 📋 Mathlib.Algebra.Polynomial.Reverse
{R : Type u_1} [Semiring R] {S : Type u_2} [CommSemiring S] (i : R →+* S) (x : S) [Invertible x] (N : ℕ) (f : Polynomial R) (hf : f.natDegree ≤ N) : Polynomial.eval₂ i (⅟x) (Polynomial.reflect N f) * x ^ N = Polynomial.eval₂ i x f - IsAlgebraic.invOf 📋 Mathlib.RingTheory.Algebraic.Basic
{R : Type u} {S : Type u_1} [CommRing R] [CommRing S] [Algebra R S] {x : S} [Invertible x] (h : IsAlgebraic R x) : IsAlgebraic R ⅟x - IsAlgebraic.invOf_iff 📋 Mathlib.RingTheory.Algebraic.Basic
{R : Type u} {S : Type u_1} [CommRing R] [CommRing S] [Algebra R S] {x : S} [Invertible x] : IsAlgebraic R ⅟x ↔ IsAlgebraic R x - CategoryTheory.Linear.instEpiHSMulHomOfInvertible 📋 Mathlib.CategoryTheory.Linear.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Preadditive C] (R : Type w) [Semiring R] [CategoryTheory.Linear R C] {X Y : C} (f : X ⟶ Y) [CategoryTheory.Epi f] (r : R) [Invertible r] : CategoryTheory.Epi (r • f) - CategoryTheory.Linear.instMonoHSMulHomOfInvertible 📋 Mathlib.CategoryTheory.Linear.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Preadditive C] (R : Type w) [Semiring R] [CategoryTheory.Linear R C] {X Y : C} (f : X ⟶ Y) [CategoryTheory.Mono f] (r : R) [Invertible r] : CategoryTheory.Mono (r • f) - TrivSqZeroExt.invertibleFstOfInvertible 📋 Mathlib.Algebra.TrivSqZeroExt.Basic
{R : Type u} {M : Type v} [AddCommGroup M] [Semiring R] [Module Rᵐᵒᵖ M] [Module R M] (x : TrivSqZeroExt R M) [Invertible x] : Invertible x.fst - TrivSqZeroExt.invertibleOfInvertibleFst 📋 Mathlib.Algebra.TrivSqZeroExt.Basic
{R : Type u} {M : Type v} [AddCommGroup M] [Semiring R] [Module Rᵐᵒᵖ M] [Module R M] [SMulCommClass R Rᵐᵒᵖ M] (x : TrivSqZeroExt R M) [Invertible x.fst] : Invertible x - TrivSqZeroExt.invertibleEquivInvertibleFst 📋 Mathlib.Algebra.TrivSqZeroExt.Basic
{R : Type u} {M : Type v} [AddCommGroup M] [Semiring R] [Module Rᵐᵒᵖ M] [Module R M] [SMulCommClass R Rᵐᵒᵖ M] (x : TrivSqZeroExt R M) : Invertible x ≃ Invertible x.fst - TrivSqZeroExt.fst_invOf 📋 Mathlib.Algebra.TrivSqZeroExt.Basic
{R : Type u} {M : Type v} [AddCommGroup M] [Semiring R] [Module Rᵐᵒᵖ M] [Module R M] (x : TrivSqZeroExt R M) [Invertible x] [Invertible x.fst] : (⅟x).fst = ⅟x.fst - TrivSqZeroExt.invOf_eq_inv 📋 Mathlib.Algebra.TrivSqZeroExt.Basic
{R : Type u} {M : Type v} [DivisionSemiring R] [AddCommGroup M] [Module Rᵐᵒᵖ M] [Module R M] [SMulCommClass R Rᵐᵒᵖ M] (x : TrivSqZeroExt R M) [Invertible x] : ⅟x = x⁻¹ - TrivSqZeroExt.snd_invOf 📋 Mathlib.Algebra.TrivSqZeroExt.Basic
{R : Type u} {M : Type v} [AddCommGroup M] [Semiring R] [Module Rᵐᵒᵖ M] [Module R M] [SMulCommClass R Rᵐᵒᵖ M] (x : TrivSqZeroExt R M) [Invertible x] [Invertible x.fst] : (⅟x).snd = -(MulOpposite.op ⅟x.fst • ⅟x.fst • x.snd) - TrivSqZeroExt.invertibleEquivInvertibleFst_apply_invOf 📋 Mathlib.Algebra.TrivSqZeroExt.Basic
{R : Type u} {M : Type v} [AddCommGroup M] [Semiring R] [Module Rᵐᵒᵖ M] [Module R M] [SMulCommClass R Rᵐᵒᵖ M] (x : TrivSqZeroExt R M) (x✝ : Invertible x) : ⅟x.fst = (⅟x).fst - TrivSqZeroExt.invertibleEquivInvertibleFst_symm_apply_invOf 📋 Mathlib.Algebra.TrivSqZeroExt.Basic
{R : Type u} {M : Type v} [AddCommGroup M] [Semiring R] [Module Rᵐᵒᵖ M] [Module R M] [SMulCommClass R Rᵐᵒᵖ M] (x : TrivSqZeroExt R M) (x✝ : Invertible x.fst) : ⅟x = (⅟x.fst, -(MulOpposite.op ⅟x.fst • ⅟x.fst • x.snd)) - CategoryTheory.GrpObj.ofInvertible 📋 Mathlib.CategoryTheory.Monoidal.Grp
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] [CategoryTheory.CartesianMonoidalCategory C] (G : C) [CategoryTheory.MonObj G] (h : (X : C) → (f : X ⟶ G) → Invertible f) : CategoryTheory.GrpObj G - LaurentPolynomial.invertibleT 📋 Mathlib.Algebra.Polynomial.Laurent
{R : Type u_1} [Semiring R] (n : ℤ) : Invertible (LaurentPolynomial.T n) - Matrix.isSymm_smul_iff 📋 Mathlib.LinearAlgebra.Matrix.Symmetric
{α : Type u_1} {n : Type u_3} {R : Type u_5} [Monoid R] [MulAction R α] {A : Matrix n n α} (k : R) [Invertible k] : (k • A).IsSymm ↔ A.IsSymm - Matrix.invertibleOfInvertibleTranspose 📋 Mathlib.LinearAlgebra.Matrix.Invertible
{n : Type u_2} {α : Type u_3} [Fintype n] [DecidableEq n] [CommSemiring α] (A : Matrix n n α) [Invertible A.transpose] : Invertible A - Matrix.invertibleTranspose 📋 Mathlib.LinearAlgebra.Matrix.Invertible
{n : Type u_2} {α : Type u_3} [Fintype n] [DecidableEq n] [CommSemiring α] (A : Matrix n n α) [Invertible A] : Invertible A.transpose - Matrix.transposeInvertibleEquivInvertible 📋 Mathlib.LinearAlgebra.Matrix.Invertible
{n : Type u_2} {α : Type u_3} [Fintype n] [DecidableEq n] [CommSemiring α] (A : Matrix n n α) : Invertible A.transpose ≃ Invertible A - Matrix.invertibleConjTranspose 📋 Mathlib.LinearAlgebra.Matrix.Invertible
{n : Type u_2} {α : Type u_3} [Fintype n] [DecidableEq n] [Semiring α] [StarRing α] (A : Matrix n n α) [Invertible A] : Invertible A.conjTranspose - Matrix.invertibleOfInvertibleConjTranspose 📋 Mathlib.LinearAlgebra.Matrix.Invertible
{n : Type u_2} {α : Type u_3} [Fintype n] [DecidableEq n] [Semiring α] [StarRing α] (A : Matrix n n α) [Invertible A.conjTranspose] : Invertible A - Matrix.invOf_mul_cancel_left 📋 Mathlib.LinearAlgebra.Matrix.Invertible
{m : Type u_1} {n : Type u_2} {α : Type u_3} [Fintype n] [DecidableEq n] [Semiring α] (A : Matrix n n α) (B : Matrix n m α) [Invertible A] : ⅟A * (A * B) = B - Matrix.invOf_mul_cancel_right 📋 Mathlib.LinearAlgebra.Matrix.Invertible
{m : Type u_1} {n : Type u_2} {α : Type u_3} [Fintype n] [DecidableEq n] [Semiring α] (A : Matrix m n α) (B : Matrix n n α) [Invertible B] : A * ⅟B * B = A - Matrix.mul_invOf_cancel_left 📋 Mathlib.LinearAlgebra.Matrix.Invertible
{m : Type u_1} {n : Type u_2} {α : Type u_3} [Fintype n] [DecidableEq n] [Semiring α] (A : Matrix n n α) (B : Matrix n m α) [Invertible A] : A * (⅟A * B) = B - Matrix.mul_invOf_cancel_right 📋 Mathlib.LinearAlgebra.Matrix.Invertible
{m : Type u_1} {n : Type u_2} {α : Type u_3} [Fintype n] [DecidableEq n] [Semiring α] (A : Matrix m n α) (B : Matrix n n α) [Invertible B] : A * B * ⅟B = A - Matrix.invOf_mul_eq_iff_eq_mul_left 📋 Mathlib.LinearAlgebra.Matrix.Invertible
{m : Type u_1} {n : Type u_2} {α : Type u_3} [Fintype n] [DecidableEq n] [Semiring α] {A B : Matrix n m α} {C : Matrix n n α} [Invertible C] : ⅟C * A = B ↔ A = C * B - Matrix.mul_invOf_eq_iff_eq_mul_right 📋 Mathlib.LinearAlgebra.Matrix.Invertible
{m : Type u_1} {n : Type u_2} {α : Type u_3} [Fintype n] [DecidableEq n] [Semiring α] {A B : Matrix m n α} {C : Matrix n n α} [Invertible C] : A * ⅟C = B ↔ A = B * C - Matrix.mul_left_eq_iff_eq_invOf_mul 📋 Mathlib.LinearAlgebra.Matrix.Invertible
{m : Type u_1} {n : Type u_2} {α : Type u_3} [Fintype n] [DecidableEq n] [Semiring α] {A B : Matrix n m α} {C : Matrix n n α} [Invertible C] : C * A = B ↔ A = ⅟C * B - Matrix.mul_right_eq_iff_eq_mul_invOf 📋 Mathlib.LinearAlgebra.Matrix.Invertible
{m : Type u_1} {n : Type u_2} {α : Type u_3} [Fintype n] [DecidableEq n] [Semiring α] {A B : Matrix m n α} {C : Matrix n n α} [Invertible C] : A * C = B ↔ A = B * ⅟C - Matrix.transpose_invOf 📋 Mathlib.LinearAlgebra.Matrix.Invertible
{n : Type u_2} {α : Type u_3} [Fintype n] [DecidableEq n] [CommSemiring α] (A : Matrix n n α) [Invertible A] [Invertible A.transpose] : (⅟A).transpose = ⅟A.transpose - Matrix.conjTranspose_invOf 📋 Mathlib.LinearAlgebra.Matrix.Invertible
{n : Type u_2} {α : Type u_3} [Fintype n] [DecidableEq n] [Semiring α] [StarRing α] (A : Matrix n n α) [Invertible A] [Invertible A.conjTranspose] : (⅟A).conjTranspose = ⅟A.conjTranspose - Matrix.invertibleAddMulMul' 📋 Mathlib.LinearAlgebra.Matrix.Invertible
{m : Type u_1} {n : Type u_2} {α : Type u_3} [Fintype n] [DecidableEq n] [Fintype m] [DecidableEq m] [Ring α] (A : Matrix n n α) (U : Matrix n m α) (C : Matrix m m α) (V : Matrix m n α) [Invertible A] [Invertible (C + C * V * ⅟A * U * C)] : Invertible (A + U * C * V) - Matrix.invertibleAddMulMul 📋 Mathlib.LinearAlgebra.Matrix.Invertible
{m : Type u_1} {n : Type u_2} {α : Type u_3} [Fintype n] [DecidableEq n] [Fintype m] [DecidableEq m] [Ring α] (A : Matrix n n α) (U : Matrix n m α) (C : Matrix m m α) (V : Matrix m n α) [Invertible A] [Invertible C] [Invertible (⅟C + V * ⅟A * U)] : Invertible (A + U * C * V) - Matrix.transposeInvertibleEquivInvertible_apply 📋 Mathlib.LinearAlgebra.Matrix.Invertible
{n : Type u_2} {α : Type u_3} [Fintype n] [DecidableEq n] [CommSemiring α] (A : Matrix n n α) [Invertible A.transpose] : A.transposeInvertibleEquivInvertible inst✝ = A.invertibleOfInvertibleTranspose - Matrix.transposeInvertibleEquivInvertible_symm_apply 📋 Mathlib.LinearAlgebra.Matrix.Invertible
{n : Type u_2} {α : Type u_3} [Fintype n] [DecidableEq n] [CommSemiring α] (A : Matrix n n α) [Invertible A] : A.transposeInvertibleEquivInvertible.symm inst✝ = A.invertibleTranspose - Matrix.add_mul_mul_invOf_mul_eq_one 📋 Mathlib.LinearAlgebra.Matrix.Invertible
{m : Type u_1} {n : Type u_2} {α : Type u_3} [Fintype n] [DecidableEq n] [Fintype m] [DecidableEq m] [Ring α] (A : Matrix n n α) (U : Matrix n m α) (C : Matrix m m α) (V : Matrix m n α) [Invertible A] [Invertible C] [Invertible (⅟C + V * ⅟A * U)] : (A + U * C * V) * (⅟A - ⅟A * U * ⅟(⅟C + V * ⅟A * U) * V * ⅟A) = 1 - Matrix.add_mul_mul_invOf_mul_eq_one' 📋 Mathlib.LinearAlgebra.Matrix.Invertible
{m : Type u_1} {n : Type u_2} {α : Type u_3} [Fintype n] [DecidableEq n] [Fintype m] [DecidableEq m] [Ring α] (A : Matrix n n α) (U : Matrix n m α) (C : Matrix m m α) (V : Matrix m n α) [Invertible A] [Invertible C] [Invertible (⅟C + V * ⅟A * U)] : (⅟A - ⅟A * U * ⅟(⅟C + V * ⅟A * U) * V * ⅟A) * (A + U * C * V) = 1 - Matrix.add_mul_mul_mul_invOf_eq_one 📋 Mathlib.LinearAlgebra.Matrix.Invertible
{m : Type u_1} {n : Type u_2} {α : Type u_3} [Fintype n] [DecidableEq n] [Fintype m] [DecidableEq m] [Ring α] (A : Matrix n n α) (U : Matrix n m α) (C : Matrix m m α) (V : Matrix m n α) [Invertible A] [Invertible (C + C * V * ⅟A * U * C)] : (A + U * C * V) * (⅟A - ⅟A * U * C * ⅟(C + C * V * ⅟A * U * C) * C * V * ⅟A) = 1 - Matrix.add_mul_mul_mul_invOf_eq_one' 📋 Mathlib.LinearAlgebra.Matrix.Invertible
{m : Type u_1} {n : Type u_2} {α : Type u_3} [Fintype n] [DecidableEq n] [Fintype m] [DecidableEq m] [Ring α] (A : Matrix n n α) (U : Matrix n m α) (C : Matrix m m α) (V : Matrix m n α) [Invertible A] [Invertible (C + C * V * ⅟A * U * C)] : (⅟A - ⅟A * U * C * ⅟(C + C * V * ⅟A * U * C) * C * V * ⅟A) * (A + U * C * V) = 1 - Matrix.invOf_add_mul_mul 📋 Mathlib.LinearAlgebra.Matrix.Invertible
{m : Type u_1} {n : Type u_2} {α : Type u_3} [Fintype n] [DecidableEq n] [Fintype m] [DecidableEq m] [Ring α] (A : Matrix n n α) (U : Matrix n m α) (C : Matrix m m α) (V : Matrix m n α) [Invertible A] [Invertible C] [Invertible (⅟C + V * ⅟A * U)] [Invertible (A + U * C * V)] : ⅟(A + U * C * V) = ⅟A - ⅟A * U * ⅟(⅟C + V * ⅟A * U) * V * ⅟A - Matrix.invOf_add_mul_mul' 📋 Mathlib.LinearAlgebra.Matrix.Invertible
{m : Type u_1} {n : Type u_2} {α : Type u_3} [Fintype n] [DecidableEq n] [Fintype m] [DecidableEq m] [Ring α] (A : Matrix n n α) (U : Matrix n m α) (C : Matrix m m α) (V : Matrix m n α) [Invertible A] [Invertible (C + C * V * ⅟A * U * C)] [Invertible (A + U * C * V)] : ⅟(A + U * C * V) = ⅟A - ⅟A * U * C * ⅟(C + C * V * ⅟A * U * C) * C * V * ⅟A - Matrix.unitOfDetInvertible 📋 Mathlib.LinearAlgebra.Matrix.NonsingularInverse
{n : Type u'} {α : Type v} [Fintype n] [DecidableEq n] [CommRing α] (A : Matrix n n α) [Invertible A.det] : (Matrix n n α)ˣ - Matrix.invertibleOfIsUnitDet 📋 Mathlib.LinearAlgebra.Matrix.NonsingularInverse
{n : Type u'} {α : Type v} [Fintype n] [DecidableEq n] [CommRing α] (A : Matrix n n α) (h : IsUnit A.det) : Invertible A - Matrix.isUnit_det_of_invertible 📋 Mathlib.LinearAlgebra.Matrix.NonsingularInverse
{n : Type u'} {α : Type v} [Fintype n] [DecidableEq n] [CommRing α] (A : Matrix n n α) [Invertible A] : IsUnit A.det - Matrix.mulVec_surjective_of_invertible 📋 Mathlib.LinearAlgebra.Matrix.NonsingularInverse
{m : Type u} [DecidableEq m] {R : Type u_2} [CommRing R] [Fintype m] (A : Matrix m m R) [Invertible A] : Function.Surjective A.mulVec - Matrix.vecMul_surjective_of_invertible 📋 Mathlib.LinearAlgebra.Matrix.NonsingularInverse
{m : Type u} [DecidableEq m] {R : Type u_2} [CommRing R] [Fintype m] (A : Matrix m m R) [Invertible A] : Function.Surjective fun v => Matrix.vecMul v A - Matrix.detInvertibleOfInvertible 📋 Mathlib.LinearAlgebra.Matrix.NonsingularInverse
{n : Type u'} {α : Type v} [Fintype n] [DecidableEq n] [CommRing α] (A : Matrix n n α) [Invertible A] : Invertible A.det - Matrix.invertibleOfDetInvertible 📋 Mathlib.LinearAlgebra.Matrix.NonsingularInverse
{n : Type u'} {α : Type v} [Fintype n] [DecidableEq n] [CommRing α] (A : Matrix n n α) [Invertible A.det] : Invertible A - Matrix.invertibleEquivDetInvertible 📋 Mathlib.LinearAlgebra.Matrix.NonsingularInverse
{n : Type u'} {α : Type v} [Fintype n] [DecidableEq n] [CommRing α] (A : Matrix n n α) : Invertible A ≃ Invertible A.det - Matrix.diagonalInvertible 📋 Mathlib.LinearAlgebra.Matrix.NonsingularInverse
{n : Type u'} [Fintype n] [DecidableEq n] {α : Type u_2} [NonAssocSemiring α] (v : n → α) [Invertible v] : Invertible (Matrix.diagonal v)
About
Loogle searches Lean and Mathlib definitions and theorems.
You can use Loogle from within the Lean4 VSCode language extension
using the Loogle command from the command palette. You can also try the
#loogle command from LeanSearchClient,
the CLI version, the Loogle
VS Code extension, the lean.nvim
integration or the Zulip bot.
Usage
Loogle finds definitions and lemmas in various ways:
By constant:
🔍Real.sin
finds all lemmas whose statement somehow mentions the sine function.By lemma name substring:
🔍"differ"
finds all lemmas that have"differ"somewhere in their lemma name.By subexpression:
🔍_ * (_ ^ _)
finds all lemmas whose statements somewhere include a product where the second argument is raised to some power.The pattern can also be non-linear, as in
🔍Real.sqrt ?a * Real.sqrt ?aIf the pattern has parameters, they are matched in any order. Both of these will find
List.map:
🔍(?a -> ?b) -> List ?a -> List ?b
🔍List ?a -> (?a -> ?b) -> List ?bBy main conclusion:
🔍|- tsum _ = _ * tsum _
finds all lemmas where the conclusion (the subexpression to the right of all→and∀) has the given shape.As before, if the pattern has parameters, they are matched against the hypotheses of the lemma in any order; for example,
🔍|- _ < _ → tsum _ < tsum _
will findtsum_lt_tsumeven though the hypothesisf i < g iis not the last.You can filter for definitions vs theorems: Using
⊢ (_ : Type _)finds all definitions which provide data while⊢ (_ : Prop)finds all theorems (and definitions of proofs).
If you pass more than one such search filter, separated by commas
Loogle will return lemmas which match all of them. The
search
🔍 Real.sin, "two", tsum, _ * _, _ ^ _, |- _ < _ → _
would find all lemmas which mention the constants Real.sin
and tsum, have "two" as a substring of the
lemma name, include a product and a power somewhere in the type,
and have a hypothesis of the form _ < _ (if
there were any such lemmas). Metavariables (?a) are
assigned independently in each filter.
The #lucky button will directly send you to the
documentation of the first hit.
Source code
You can find the source code for this service at https://github.com/nomeata/loogle. The https://loogle.lean-lang.org/ service is provided by the Lean FRO. Please review the Lean FRO Terms of Use and Privacy Policy.
This is Loogle revision 9f11169 serving mathlib revision ce5dd8c