Loogle!
Result
Found 187 declarations mentioning Invertible.invOf.
- 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 - 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 si : α) (hs : s = r) (hsi : si = ⅟r) : Invertible s - invOf_eq_group_inv 📋 Mathlib.Algebra.Group.Invertible.Defs
{α : Type u} [Group α] (a : α) [Invertible a] : ⅟a = a⁻¹ - 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 - val_inv_unitOfInvertible 📋 Mathlib.Algebra.Group.Invertible.Basic
{α : Type u} [Monoid α] (a : α) [Invertible a] : ↑(unitOfInvertible a)⁻¹ = ⅟a - 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 - 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 - Ring.inverse_invertible 📋 Mathlib.Algebra.GroupWithZero.Invertible
{α : Type u} [MonoidWithZero α] (x : α) [Invertible x] : Ring.inverse x = ⅟x - invOf_eq_inv 📋 Mathlib.Algebra.GroupWithZero.Invertible
{α : Type u} [GroupWithZero α] (a : α) [Invertible a] : ⅟a = a⁻¹ - invOf_div 📋 Mathlib.Algebra.GroupWithZero.Invertible
{α : Type u} [GroupWithZero α] (a b : α) [Invertible a] [Invertible b] [Invertible (a / b)] : ⅟(a / b) = b / a - 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.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 - 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 - 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_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) - 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) - IsLocalization.invertible_mk'_one_invOf 📋 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) : ⅟(IsLocalization.mk' S 1 s) = (algebraMap R S) ↑s - 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.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 - 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)) - LaurentPolynomial.invOf_T 📋 Mathlib.Algebra.Polynomial.Laurent
{R : Type u_1} [Semiring R] (n : ℤ) : ⅟(LaurentPolynomial.T n) = LaurentPolynomial.T (-n) - 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.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.invOf_eq_nonsing_inv 📋 Mathlib.LinearAlgebra.Matrix.NonsingularInverse
{n : Type u'} {α : Type v} [Fintype n] [DecidableEq n] [CommRing α] (A : Matrix n n α) [Invertible A] : ⅟A = A⁻¹ - Matrix.inv_smul 📋 Mathlib.LinearAlgebra.Matrix.NonsingularInverse
{n : Type u'} {α : Type v} [Fintype n] [DecidableEq n] [CommRing α] (A : Matrix n n α) (k : α) [Invertible k] (h : IsUnit A.det) : (k • A)⁻¹ = ⅟k • A⁻¹ - Matrix.det_invOf 📋 Mathlib.LinearAlgebra.Matrix.NonsingularInverse
{n : Type u'} {α : Type v} [Fintype n] [DecidableEq n] [CommRing α] (A : Matrix n n α) [Invertible A] [Invertible A.det] : (⅟A).det = ⅟A.det - Matrix.invOf_diagonal_eq 📋 Mathlib.LinearAlgebra.Matrix.NonsingularInverse
{n : Type u'} [Fintype n] [DecidableEq n] {α : Type u_2} [Semiring α] (v : n → α) [Invertible v] [Invertible (Matrix.diagonal v)] : ⅟(Matrix.diagonal v) = Matrix.diagonal ⅟v - Matrix.invOf_eq 📋 Mathlib.LinearAlgebra.Matrix.NonsingularInverse
{n : Type u'} {α : Type v} [Fintype n] [DecidableEq n] [CommRing α] (A : Matrix n n α) [Invertible A.det] [Invertible A] : ⅟A = ⅟A.det • A.adjugate - Matrix.invOf_submatrix_equiv_eq 📋 Mathlib.LinearAlgebra.Matrix.NonsingularInverse
{m : Type u} {n : Type u'} {α : Type v} [Fintype n] [DecidableEq n] [CommRing α] [Fintype m] [DecidableEq m] (A : Matrix m m α) (e₁ e₂ : n ≃ m) [Invertible A] [Invertible (A.submatrix ⇑e₁ ⇑e₂)] : ⅟(A.submatrix ⇑e₁ ⇑e₂) = (⅟A).submatrix ⇑e₂ ⇑e₁ - Matrix.det_fromBlocks₁₁ 📋 Mathlib.LinearAlgebra.Matrix.SchurComplement
{m : Type u_2} {n : Type u_3} {α : Type u_4} [Fintype m] [Fintype n] [DecidableEq m] [DecidableEq n] [CommRing α] (A : Matrix m m α) (B : Matrix m n α) (C : Matrix n m α) (D : Matrix n n α) [Invertible A] : (Matrix.fromBlocks A B C D).det = A.det * (D - C * ⅟A * B).det - Matrix.det_fromBlocks₂₂ 📋 Mathlib.LinearAlgebra.Matrix.SchurComplement
{m : Type u_2} {n : Type u_3} {α : Type u_4} [Fintype m] [Fintype n] [DecidableEq m] [DecidableEq n] [CommRing α] (A : Matrix m m α) (B : Matrix m n α) (C : Matrix n m α) (D : Matrix n n α) [Invertible D] : (Matrix.fromBlocks A B C D).det = D.det * (A - B * ⅟D * C).det - Matrix.isUnit_fromBlocks_iff_of_invertible₁₁ 📋 Mathlib.LinearAlgebra.Matrix.SchurComplement
{m : Type u_2} {n : Type u_3} {α : Type u_4} [Fintype m] [Fintype n] [DecidableEq m] [DecidableEq n] [CommRing α] {A : Matrix m m α} {B : Matrix m n α} {C : Matrix n m α} {D : Matrix n n α} [Invertible A] : IsUnit (Matrix.fromBlocks A B C D) ↔ IsUnit (D - C * ⅟A * B) - Matrix.isUnit_fromBlocks_iff_of_invertible₂₂ 📋 Mathlib.LinearAlgebra.Matrix.SchurComplement
{m : Type u_2} {n : Type u_3} {α : Type u_4} [Fintype m] [Fintype n] [DecidableEq m] [DecidableEq n] [CommRing α] {A : Matrix m m α} {B : Matrix m n α} {C : Matrix n m α} {D : Matrix n n α} [Invertible D] : IsUnit (Matrix.fromBlocks A B C D) ↔ IsUnit (A - B * ⅟D * C) - Matrix.fromBlocks₁₁Invertible 📋 Mathlib.LinearAlgebra.Matrix.SchurComplement
{m : Type u_2} {n : Type u_3} {α : Type u_4} [Fintype m] [Fintype n] [DecidableEq m] [DecidableEq n] [CommRing α] (A : Matrix m m α) (B : Matrix m n α) (C : Matrix n m α) (D : Matrix n n α) [Invertible A] [Invertible (D - C * ⅟A * B)] : Invertible (Matrix.fromBlocks A B C D) - Matrix.fromBlocks₂₂Invertible 📋 Mathlib.LinearAlgebra.Matrix.SchurComplement
{m : Type u_2} {n : Type u_3} {α : Type u_4} [Fintype m] [Fintype n] [DecidableEq m] [DecidableEq n] [CommRing α] (A : Matrix m m α) (B : Matrix m n α) (C : Matrix n m α) (D : Matrix n n α) [Invertible D] [Invertible (A - B * ⅟D * C)] : Invertible (Matrix.fromBlocks A B C D) - Matrix.invertibleOfFromBlocks₁₁Invertible 📋 Mathlib.LinearAlgebra.Matrix.SchurComplement
{m : Type u_2} {n : Type u_3} {α : Type u_4} [Fintype m] [Fintype n] [DecidableEq m] [DecidableEq n] [CommRing α] (A : Matrix m m α) (B : Matrix m n α) (C : Matrix n m α) (D : Matrix n n α) [Invertible A] [Invertible (Matrix.fromBlocks A B C D)] : Invertible (D - C * ⅟A * B) - Matrix.invertibleOfFromBlocks₂₂Invertible 📋 Mathlib.LinearAlgebra.Matrix.SchurComplement
{m : Type u_2} {n : Type u_3} {α : Type u_4} [Fintype m] [Fintype n] [DecidableEq m] [DecidableEq n] [CommRing α] (A : Matrix m m α) (B : Matrix m n α) (C : Matrix n m α) (D : Matrix n n α) [Invertible D] [Invertible (Matrix.fromBlocks A B C D)] : Invertible (A - B * ⅟D * C) - Matrix.invertibleEquivFromBlocks₁₁Invertible 📋 Mathlib.LinearAlgebra.Matrix.SchurComplement
{m : Type u_2} {n : Type u_3} {α : Type u_4} [Fintype m] [Fintype n] [DecidableEq m] [DecidableEq n] [CommRing α] (A : Matrix m m α) (B : Matrix m n α) (C : Matrix n m α) (D : Matrix n n α) [Invertible A] : Invertible (Matrix.fromBlocks A B C D) ≃ Invertible (D - C * ⅟A * B) - Matrix.invertibleEquivFromBlocks₂₂Invertible 📋 Mathlib.LinearAlgebra.Matrix.SchurComplement
{m : Type u_2} {n : Type u_3} {α : Type u_4} [Fintype m] [Fintype n] [DecidableEq m] [DecidableEq n] [CommRing α] (A : Matrix m m α) (B : Matrix m n α) (C : Matrix n m α) (D : Matrix n n α) [Invertible D] : Invertible (Matrix.fromBlocks A B C D) ≃ Invertible (A - B * ⅟D * C) - Matrix.invOf_fromBlocks_zero₁₂_eq 📋 Mathlib.LinearAlgebra.Matrix.SchurComplement
{m : Type u_2} {n : Type u_3} {α : Type u_4} [Fintype m] [Fintype n] [DecidableEq m] [DecidableEq n] [CommRing α] (A : Matrix m m α) (C : Matrix n m α) (D : Matrix n n α) [Invertible A] [Invertible D] [Invertible (Matrix.fromBlocks A 0 C D)] : ⅟(Matrix.fromBlocks A 0 C D) = Matrix.fromBlocks (⅟A) 0 (-(⅟D * C * ⅟A)) ⅟D - Matrix.invOf_fromBlocks_zero₂₁_eq 📋 Mathlib.LinearAlgebra.Matrix.SchurComplement
{m : Type u_2} {n : Type u_3} {α : Type u_4} [Fintype m] [Fintype n] [DecidableEq m] [DecidableEq n] [CommRing α] (A : Matrix m m α) (B : Matrix m n α) (D : Matrix n n α) [Invertible A] [Invertible D] [Invertible (Matrix.fromBlocks A B 0 D)] : ⅟(Matrix.fromBlocks A B 0 D) = Matrix.fromBlocks (⅟A) (-(⅟A * B * ⅟D)) 0 ⅟D - Matrix.fromBlocks_eq_of_invertible₁₁ 📋 Mathlib.LinearAlgebra.Matrix.SchurComplement
{l : Type u_1} {m : Type u_2} {n : Type u_3} {α : Type u_4} [Fintype l] [Fintype m] [Fintype n] [DecidableEq l] [DecidableEq m] [DecidableEq n] [CommRing α] (A : Matrix m m α) (B : Matrix m n α) (C : Matrix l m α) (D : Matrix l n α) [Invertible A] : Matrix.fromBlocks A B C D = Matrix.fromBlocks 1 0 (C * ⅟A) 1 * Matrix.fromBlocks A 0 0 (D - C * ⅟A * B) * Matrix.fromBlocks 1 (⅟A * B) 0 1 - Matrix.fromBlocks_eq_of_invertible₂₂ 📋 Mathlib.LinearAlgebra.Matrix.SchurComplement
{l : Type u_1} {m : Type u_2} {n : Type u_3} {α : Type u_4} [Fintype l] [Fintype m] [Fintype n] [DecidableEq l] [DecidableEq m] [DecidableEq n] [CommRing α] (A : Matrix l m α) (B : Matrix l n α) (C : Matrix n m α) (D : Matrix n n α) [Invertible D] : Matrix.fromBlocks A B C D = Matrix.fromBlocks 1 (B * ⅟D) 0 1 * Matrix.fromBlocks (A - B * ⅟D * C) 0 0 D * Matrix.fromBlocks 1 0 (⅟D * C) 1 - Matrix.invOf_fromBlocks₁₁_eq 📋 Mathlib.LinearAlgebra.Matrix.SchurComplement
{m : Type u_2} {n : Type u_3} {α : Type u_4} [Fintype m] [Fintype n] [DecidableEq m] [DecidableEq n] [CommRing α] (A : Matrix m m α) (B : Matrix m n α) (C : Matrix n m α) (D : Matrix n n α) [Invertible A] [Invertible (D - C * ⅟A * B)] [Invertible (Matrix.fromBlocks A B C D)] : ⅟(Matrix.fromBlocks A B C D) = Matrix.fromBlocks (⅟A + ⅟A * B * ⅟(D - C * ⅟A * B) * C * ⅟A) (-(⅟A * B * ⅟(D - C * ⅟A * B))) (-(⅟(D - C * ⅟A * B) * C * ⅟A)) ⅟(D - C * ⅟A * B) - Matrix.invOf_fromBlocks₂₂_eq 📋 Mathlib.LinearAlgebra.Matrix.SchurComplement
{m : Type u_2} {n : Type u_3} {α : Type u_4} [Fintype m] [Fintype n] [DecidableEq m] [DecidableEq n] [CommRing α] (A : Matrix m m α) (B : Matrix m n α) (C : Matrix n m α) (D : Matrix n n α) [Invertible D] [Invertible (A - B * ⅟D * C)] [Invertible (Matrix.fromBlocks A B C D)] : ⅟(Matrix.fromBlocks A B C D) = Matrix.fromBlocks (⅟(A - B * ⅟D * C)) (-(⅟(A - B * ⅟D * C) * B * ⅟D)) (-(⅟D * C * ⅟(A - B * ⅟D * C))) (⅟D + ⅟D * C * ⅟(A - B * ⅟D * C) * B * ⅟D) - Derivation.leibniz_invOf 📋 Mathlib.RingTheory.Derivation.Basic
{R : Type u_1} [CommRing R] {A : Type u_2} [CommRing A] [Algebra R A] {M : Type u_3} [AddCommGroup M] [Module A M] [Module R M] (D : Derivation R A M) (a : A) [Invertible a] : D ⅟a = -⅟a ^ 2 • D a - Matrix.toLinearEquiv'_symm_apply 📋 Mathlib.LinearAlgebra.Matrix.ToLinearEquiv
{n : Type u_1} [Fintype n] {R : Type u_2} [CommRing R] [DecidableEq n] (P : Matrix n n R) (h : Invertible P) : ↑(P.toLinearEquiv' h).symm = Matrix.toLin' ⅟P - QuadraticMap.half_moduleEnd_apply_eq_half_smul 📋 Mathlib.LinearAlgebra.QuadraticForm.Basic
{R : Type u_3} {M : Type u_4} [Semiring R] [AddCommMonoid M] [Module R M] [Invertible 2] (x : M) : ⅟2 x = ⅟2 • x - QuadraticMap.associated_apply 📋 Mathlib.LinearAlgebra.QuadraticForm.Basic
(S : Type u_1) {R : Type u_3} {M : Type u_4} {N : Type u_5} [CommRing R] [AddCommGroup M] [Module R M] [AddCommGroup N] [Module R N] [CommSemiring S] [Algebra S R] [Module S N] [IsScalarTower S R N] [Invertible 2] (Q : QuadraticMap R M N) (x y : M) : (((QuadraticMap.associatedHom S) Q) x) y = ⅟2 • (Q (x + y) - Q x - Q y) - QuadraticMap.associated_toQuadraticMap 📋 Mathlib.LinearAlgebra.QuadraticForm.Basic
(S : Type u_1) {R : Type u_3} {M : Type u_4} {N : Type u_5} [CommRing R] [AddCommGroup M] [Module R M] [AddCommGroup N] [Module R N] [CommSemiring S] [Algebra S R] [Module S N] [IsScalarTower S R N] [Invertible 2] (B : LinearMap.BilinMap R M N) (x y : M) : (((QuadraticMap.associatedHom S) B.toQuadraticMap) x) y = ⅟2 • ((B x) y + (B y) x) - QuadraticMap.associated_linMulLin 📋 Mathlib.LinearAlgebra.QuadraticForm.Basic
{R : Type u_3} {M : Type u_4} [CommRing R] [AddCommGroup M] [Module R M] [Invertible 2] (f g : M →ₗ[R] R) : QuadraticMap.associated (QuadraticMap.linMulLin f g) = ⅟2 • ((LinearMap.mul R R).compl₁₂ f g + (LinearMap.mul R R).compl₁₂ g f) - ExteriorAlgebra.invertibleAlgebraMapEquiv_symm_apply_invOf 📋 Mathlib.LinearAlgebra.ExteriorAlgebra.Basic
{R : Type u1} [CommRing R] (M : Type u2) [AddCommGroup M] [Module R M] (r : R) (x✝ : Invertible r) : ⅟((algebraMap R (ExteriorAlgebra R M)) r) = (algebraMap R (ExteriorAlgebra R M)) ⅟r - ExteriorAlgebra.invertibleAlgebraMapEquiv_apply_invOf 📋 Mathlib.LinearAlgebra.ExteriorAlgebra.Basic
{R : Type u1} [CommRing R] (M : Type u2) [AddCommGroup M] [Module R M] (r : R) (x✝ : Invertible ((algebraMap R (ExteriorAlgebra R M)) r)) : ⅟r = ⅟(ExteriorAlgebra.algebraMapInv ((algebraMap R (ExteriorAlgebra R M)) r)) - invOf_eq_of_coprime 📋 Mathlib.Algebra.CharP.Invertible
{R : Type u_1} [Ring R] {p : ℕ} [CharP R p] {n : ℕ} [Invertible ↑n] (h : n.Coprime p) : ⅟↑n = ↑(n.gcdA p) - Algebra.exists_aeval_invOf_eq_zero_of_idealMap_adjoin_sup_span_eq_top 📋 Mathlib.RingTheory.Polynomial.Ideal
{R : Type u_1} {S : Type u_2} [CommRing R] [CommRing S] [Algebra R S] (x : S) (I : Ideal R) (hI : I ≠ ⊤) [Invertible x] (h : Ideal.map (algebraMap R ↥R[x]) I ⊔ Ideal.span {⟨x, ⋯⟩} = ⊤) : ∃ p, p.leadingCoeff - 1 ∈ I ∧ (Polynomial.aeval ⅟x) p = 0 - Polynomial.Chebyshev.S_eq_U_comp_half_mul_X 📋 Mathlib.RingTheory.Polynomial.Chebyshev
(R : Type u_1) [CommRing R] [Invertible 2] (n : ℤ) : Polynomial.Chebyshev.S R n = (Polynomial.Chebyshev.U R n).comp (Polynomial.C ⅟2 * Polynomial.X) - Polynomial.Chebyshev.C_eq_two_mul_T_comp_half_mul_X 📋 Mathlib.RingTheory.Polynomial.Chebyshev
(R : Type u_1) [CommRing R] [Invertible 2] (n : ℤ) : Polynomial.Chebyshev.C R n = 2 * (Polynomial.Chebyshev.T R n).comp (Polynomial.C ⅟2 * Polynomial.X) - Polynomial.Chebyshev.T_eq_half_mul_C_comp_two_mul_X 📋 Mathlib.RingTheory.Polynomial.Chebyshev
(R : Type u_1) [CommRing R] [Invertible 2] (n : ℤ) : Polynomial.Chebyshev.T R n = Polynomial.C ⅟2 * (Polynomial.Chebyshev.C R n).comp (2 * Polynomial.X) - Matrix.IsHermitian.of_smul' 📋 Mathlib.LinearAlgebra.Matrix.Hermitian
{α : Type u_1} {n : Type u_4} {R : Type u_5} [Monoid R] [Star R] [Star α] [MulAction R α] [StarModule R α] {A : Matrix n n α} {k : R} [Invertible k] (h : (k • A).IsHermitian) (hk : IsSelfAdjoint ⅟k) : A.IsHermitian - LieAlgebra.Orthogonal.pd_inv 📋 Mathlib.Algebra.Lie.Classical
(l : Type u_4) (R : Type u₂) [DecidableEq l] [CommRing R] [Fintype l] [Invertible 2] : LieAlgebra.Orthogonal.PD l R * ⅟2 • (LieAlgebra.Orthogonal.PD l R).transpose = 1 - LieAlgebra.Orthogonal.pb_inv 📋 Mathlib.Algebra.Lie.Classical
(l : Type u_4) (R : Type u₂) [DecidableEq l] [CommRing R] [Fintype l] [Invertible 2] : LieAlgebra.Orthogonal.PB l R * Matrix.fromBlocks 1 0 0 ⅟(LieAlgebra.Orthogonal.PD l R) = 1 - skewAdjointPartL_apply_coe 📋 Mathlib.Topology.Algebra.Module.Star
(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] [TopologicalSpace A] [ContinuousSub A] [ContinuousStar A] [ContinuousConstSMul R A] (x : A) : ↑((skewAdjointPartL R A) x) = ⅟2 • (x - star x) - selfAdjointPartL_apply_coe 📋 Mathlib.Topology.Algebra.Module.Star
(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] [TopologicalSpace A] [ContinuousAdd A] [ContinuousStar A] [ContinuousConstSMul R A] (x : A) : ↑((selfAdjointPartL R A) x) = ⅟2 • x + ⅟2 • star x - midpoint_eq_smul_add 📋 Mathlib.LinearAlgebra.AffineSpace.Midpoint
(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) - left_vsub_midpoint 📋 Mathlib.LinearAlgebra.AffineSpace.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₂) - midpoint_vsub_left 📋 Mathlib.LinearAlgebra.AffineSpace.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) : midpoint R p₁ p₂ -ᵥ p₁ = ⅟2 • (p₂ -ᵥ p₁) - midpoint_vsub_right 📋 Mathlib.LinearAlgebra.AffineSpace.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) : midpoint R p₁ p₂ -ᵥ p₂ = ⅟2 • (p₁ -ᵥ p₂) - right_vsub_midpoint 📋 Mathlib.LinearAlgebra.AffineSpace.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₁) - left_sub_midpoint 📋 Mathlib.LinearAlgebra.AffineSpace.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₂) - midpoint_sub_left 📋 Mathlib.LinearAlgebra.AffineSpace.Midpoint
{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₁) - midpoint_sub_right 📋 Mathlib.LinearAlgebra.AffineSpace.Midpoint
{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₂) - right_sub_midpoint 📋 Mathlib.LinearAlgebra.AffineSpace.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₁) - midpoint_vsub_midpoint_same_left 📋 Mathlib.LinearAlgebra.AffineSpace.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₂ -ᵥ midpoint R p₁ p₃ = ⅟2 • (p₂ -ᵥ p₃) - midpoint_vsub_midpoint_same_right 📋 Mathlib.LinearAlgebra.AffineSpace.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₃ -ᵥ midpoint R p₂ p₃ = ⅟2 • (p₁ -ᵥ p₂) - midpoint_vsub 📋 Mathlib.LinearAlgebra.AffineSpace.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₂ -ᵥ p = ⅟2 • (p₁ -ᵥ p) + ⅟2 • (p₂ -ᵥ p) - vsub_midpoint 📋 Mathlib.LinearAlgebra.AffineSpace.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₂) - ArithmeticFunction.dirichletInverseFun_apply_one 📋 Mathlib.NumberTheory.ArithmeticFunction.Defs
{R : Type u_1} [Ring R] (f : ℕ → R) (hf : Invertible (f 1)) : ArithmeticFunction.dirichletInverseFun f hf 1 = ⅟(f 1) - ArithmeticFunction.dirichletInverseFun_apply_ne 📋 Mathlib.NumberTheory.ArithmeticFunction.Defs
{R : Type u_1} [Ring R] (f : ℕ → R) (hf : Invertible (f 1)) {n : ℕ} (hn0 : n ≠ 0) (hn1 : n ≠ 1) : ArithmeticFunction.dirichletInverseFun f hf n = -⅟(f 1) * ∑ d ∈ n.properDivisors, f (n / d) * ArithmeticFunction.dirichletInverseFun f hf d - inf_eq_half_smul_add_sub_abs_sub 📋 Mathlib.Algebra.Order.Module.Basic
(R : Type u_2) {M : Type u_3} [Semiring R] [Invertible 2] [Lattice M] [AddCommGroup M] [Module R M] [IsOrderedAddMonoid M] (x y : M) : x ⊓ y = ⅟2 • (x + y - |y - x|) - sup_eq_half_smul_add_add_abs_sub 📋 Mathlib.Algebra.Order.Module.Basic
(R : Type u_2) {M : Type u_3} [Semiring R] [Invertible 2] [Lattice M] [AddCommGroup M] [Module R M] [IsOrderedAddMonoid M] (x y : M) : x ⊔ y = ⅟2 • (x + y + |y - x|) - SymAlg.invOf_sym 📋 Mathlib.Algebra.Symmetrized
{α : Type u_1} [Mul α] [AddMonoidWithOne α] [Invertible 2] (a : α) [Invertible a] : ⅟(SymAlg.sym a) = SymAlg.sym ⅟a - SymAlg.sym_mul_sym 📋 Mathlib.Algebra.Symmetrized
{α : Type u_1} [Mul α] [Add α] [One α] [OfNat α 2] [Invertible 2] (a b : α) : SymAlg.sym a * SymAlg.sym b = SymAlg.sym (⅟2 * (a * b + b * a)) - SymAlg.mul_def 📋 Mathlib.Algebra.Symmetrized
{α : Type u_1} [Add α] [Mul α] [One α] [OfNat α 2] [Invertible 2] (a b : αˢʸᵐ) : a * b = SymAlg.sym (⅟2 * (SymAlg.unsym a * SymAlg.unsym b + SymAlg.unsym b * SymAlg.unsym a)) - SymAlg.unsym_mul 📋 Mathlib.Algebra.Symmetrized
{α : Type u_1} [Mul α] [Add α] [One α] [OfNat α 2] [Invertible 2] (a b : αˢʸᵐ) : SymAlg.unsym (a * b) = ⅟2 * (SymAlg.unsym a * SymAlg.unsym b + SymAlg.unsym b * SymAlg.unsym a) - WeierstrassCurve.toCharNeTwoNF_s 📋 Mathlib.AlgebraicGeometry.EllipticCurve.NormalForms
{R : Type u_1} [CommRing R] (W : WeierstrassCurve R) [Invertible 2] : W.toCharNeTwoNF.s = ⅟2 * -W.a₁ - WeierstrassCurve.toCharNeTwoNF_t 📋 Mathlib.AlgebraicGeometry.EllipticCurve.NormalForms
{R : Type u_1} [CommRing R] (W : WeierstrassCurve R) [Invertible 2] : W.toCharNeTwoNF.t = ⅟2 * -W.a₃ - PowerSeries.coeff_one_substInv 📋 Mathlib.RingTheory.PowerSeries.Substitution
{R : Type u_2} [CommRing R] (P : PowerSeries R) [Invertible ((PowerSeries.coeff 1) P)] : (PowerSeries.coeff 1) P.substInv = ⅟((PowerSeries.coeff 1) P) - NormedSpace.invOf_exp 📋 Mathlib.Analysis.Normed.Algebra.Exponential
{𝔸 : Type u_1} [NormedRing 𝔸] [NormedAlgebra ℚ 𝔸] [CompleteSpace 𝔸] (x : 𝔸) [Invertible (NormedSpace.exp x)] : ⅟(NormedSpace.exp x) = NormedSpace.exp (-x) - NormedSpace.invOf_exp_of_mem_ball 📋 Mathlib.Analysis.Normed.Algebra.Exponential
{𝕂 : Type u_1} {𝔸 : Type u_2} [NontriviallyNormedField 𝕂] [NormedRing 𝔸] [NormedAlgebra 𝕂 𝔸] [CompleteSpace 𝔸] [CharZero 𝕂] {x : 𝔸} (hx : x ∈ Metric.eball 0 (NormedSpace.expSeries 𝕂 𝔸).radius) [Invertible (NormedSpace.exp x)] : ⅟(NormedSpace.exp x) = NormedSpace.exp (-x) - TrivSqZeroExt.eq_smul_exp_of_invertible 📋 Mathlib.Analysis.Normed.Algebra.TrivSqZeroExt
{R : Type u_3} {M : Type u_4} [CommRing R] [AddCommGroup M] [Algebra ℚ R] [Module ℚ M] [Module R M] [Module Rᵐᵒᵖ M] [IsCentralScalar R M] [TopologicalSpace R] [TopologicalSpace M] [IsTopologicalRing R] [IsTopologicalAddGroup M] [ContinuousSMul R M] [ContinuousSMul Rᵐᵒᵖ M] [T2Space R] [T2Space M] (x : TrivSqZeroExt R M) [Invertible x.fst] : x = x.fst • NormedSpace.exp (⅟x.fst • TrivSqZeroExt.inr x.snd) - homothety_invOf_two 📋 Mathlib.LinearAlgebra.AffineSpace.MidpointZero
{R : Type u_1} {V : Type u_2} {P : Type u_3} [CommRing R] [Invertible 2] [AddCommGroup V] [Module R V] [AddTorsor V P] (a b : P) : (AffineMap.homothety a ⅟2) b = midpoint R a b - QuadraticForm.polarBilin_tmul 📋 Mathlib.LinearAlgebra.QuadraticForm.TensorProduct
{R : Type uR} {A : Type uA} {M₁ : Type uM₁} {M₂ : Type uM₂} [CommRing R] [CommRing A] [AddCommGroup M₁] [AddCommGroup M₂] [Algebra R A] [Module R M₁] [Module A M₁] [SMulCommClass R A M₁] [IsScalarTower R A M₁] [Module R M₂] [Invertible 2] [Invertible 2] (Q₁ : QuadraticForm A M₁) (Q₂ : QuadraticForm R M₂) : QuadraticMap.polarBilin (Q₁.tmul Q₂) = ⅟2 • LinearMap.BilinForm.tmul (QuadraticMap.polarBilin Q₁) (QuadraticMap.polarBilin Q₂) - CliffordAlgebra.invOf_ι 📋 Mathlib.LinearAlgebra.CliffordAlgebra.Inversion
{R : Type u_1} {M : Type u_2} [CommRing R] [AddCommGroup M] [Module R M] (Q : QuadraticForm R M) (m : M) [Invertible (Q m)] [Invertible ((CliffordAlgebra.ι Q) m)] : ⅟((CliffordAlgebra.ι Q) m) = (CliffordAlgebra.ι Q) (⅟(Q m) • m) - CliffordAlgebra.invOf_ι_mul_ι_mul_ι 📋 Mathlib.LinearAlgebra.CliffordAlgebra.Inversion
{R : Type u_1} {M : Type u_2} [CommRing R] [AddCommGroup M] [Module R M] (Q : QuadraticForm R M) (a b : M) [Invertible ((CliffordAlgebra.ι Q) a)] [Invertible (Q a)] : ⅟((CliffordAlgebra.ι Q) a) * (CliffordAlgebra.ι Q) b * (CliffordAlgebra.ι Q) a = (CliffordAlgebra.ι Q) ((⅟(Q a) * QuadraticMap.polar (⇑Q) a b) • a - b) - CliffordAlgebra.ι_mul_ι_mul_invOf_ι 📋 Mathlib.LinearAlgebra.CliffordAlgebra.Inversion
{R : Type u_1} {M : Type u_2} [CommRing R] [AddCommGroup M] [Module R M] (Q : QuadraticForm R M) (a b : M) [Invertible ((CliffordAlgebra.ι Q) a)] [Invertible (Q a)] : (CliffordAlgebra.ι Q) a * (CliffordAlgebra.ι Q) b * ⅟((CliffordAlgebra.ι Q) a) = (CliffordAlgebra.ι Q) ((⅟(Q a) * QuadraticMap.polar (⇑Q) a b) • a - b) - MvPowerSeries.pderiv_invOf 📋 Mathlib.RingTheory.MvPowerSeries.Derivative
{σ : Type u_1} {R : Type u_2} {i : σ} [CommRing R] (f : MvPowerSeries σ R) [Invertible f] : (MvPowerSeries.pderiv R i) ⅟f = -⅟f ^ 2 * (MvPowerSeries.pderiv R i) f - PowerSeries.derivative_invOf 📋 Mathlib.RingTheory.PowerSeries.Derivative
{R : Type u_1} [CommRing R] (f : PowerSeries R) [Invertible f] : (PowerSeries.derivative R) ⅟f = -⅟f ^ 2 * (PowerSeries.derivative R) f - xInTermsOfW_eq 📋 Mathlib.RingTheory.WittVector.WittPolynomial
(p : ℕ) (R : Type u_1) [CommRing R] [Invertible ↑p] {n : ℕ} : xInTermsOfW p R n = (MvPolynomial.X n - ∑ i ∈ Finset.range n, MvPolynomial.C (↑p ^ i) * xInTermsOfW p R i ^ p ^ (n - i)) * MvPolynomial.C (⅟↑p ^ n) - Polynomial.dickson_two_one_eq_chebyshev_U 📋 Mathlib.RingTheory.Polynomial.Dickson
(R : Type u_1) [CommRing R] [Invertible 2] (n : ℕ) : Polynomial.dickson 2 1 n = (Polynomial.Chebyshev.U R ↑n).comp (Polynomial.C ⅟2 * Polynomial.X) - Polynomial.chebyshev_T_eq_dickson_one_one 📋 Mathlib.RingTheory.Polynomial.Dickson
(R : Type u_1) [CommRing R] [Invertible 2] (n : ℕ) : Polynomial.Chebyshev.T R ↑n = Polynomial.C ⅟2 * (Polynomial.dickson 1 1 n).comp (2 * Polynomial.X) - Polynomial.dickson_one_one_eq_chebyshev_T 📋 Mathlib.RingTheory.Polynomial.Dickson
(R : Type u_1) [CommRing R] [Invertible 2] (n : ℕ) : Polynomial.dickson 1 1 n = 2 * (Polynomial.Chebyshev.T R ↑n).comp (Polynomial.C ⅟2 * Polynomial.X)
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