Loogle!
Result
Found 204 declarations mentioning AddCommute. Of these, only the first 200 are shown.
- AddCommute π Mathlib.Algebra.Group.Commute.Defs
{S : Type u_3} [Add S] (a b : S) : Prop - AddCommute.instRefl π Mathlib.Algebra.Group.Commute.Defs
{S : Type u_3} [Add S] : Std.Refl AddCommute - AddCommute.instSymm π Mathlib.Algebra.Group.Commute.Defs
{S : Type u_3} [Add S] : Std.Symm AddCommute - AddCommute.refl π Mathlib.Algebra.Group.Commute.Defs
{S : Type u_3} [Add S] (a : S) : AddCommute a a - AddCommute.all π Mathlib.Algebra.Group.Commute.Defs
{S : Type u_3} [AddCommMagma S] (a b : S) : AddCommute a b - AddCommute.symm π Mathlib.Algebra.Group.Commute.Defs
{S : Type u_3} [Add S] {a b : S} (h : AddCommute a b) : AddCommute b a - AddCommute.addSemiconjBy π Mathlib.Algebra.Group.Commute.Defs
{S : Type u_3} [Add S] {a b : S} (h : AddCommute a b) : AddSemiconjBy a b b - AddCommute.symm_iff π Mathlib.Algebra.Group.Commute.Defs
{S : Type u_3} [Add S] {a b : S} : AddCommute a b β AddCommute b a - AddCommute.on_refl π Mathlib.Algebra.Group.Commute.Defs
{G : Type u_1} {S : Type u_3} [Add S] {f : G β S} : Std.Refl fun a b => AddCommute (f a) (f b) - AddCommute.zero_left π Mathlib.Algebra.Group.Commute.Defs
{M : Type u_2} [AddZeroClass M] (a : M) : AddCommute 0 a - AddCommute.zero_right π Mathlib.Algebra.Group.Commute.Defs
{M : Type u_2} [AddZeroClass M] (a : M) : AddCommute a 0 - AddCommute.nsmul_self π Mathlib.Algebra.Group.Commute.Defs
{M : Type u_2} [AddMonoid M] (a : M) (n : β) : AddCommute (n β’ a) a - AddCommute.self_nsmul π Mathlib.Algebra.Group.Commute.Defs
{M : Type u_2} [AddMonoid M] (a : M) (n : β) : AddCommute a (n β’ a) - AddCommute.eq π Mathlib.Algebra.Group.Commute.Defs
{S : Type u_3} [Add S] {a b : S} (h : AddCommute a b) : a + b = b + a - addCommute_iff_eq π Mathlib.Algebra.Group.Commute.Defs
{S : Type u_3} [Add S] (a b : S) : AddCommute a b β a + b = b + a - IsAddLeftRegular.addCommute_add_left_iff π Mathlib.Algebra.Group.Commute.Defs
{S : Type u_3} [AddSemigroup S] {a b : S} (reg : IsAddLeftRegular a) : AddCommute (a + b) a β AddCommute a b - IsAddRightRegular.addCommute_add_right_iff π Mathlib.Algebra.Group.Commute.Defs
{S : Type u_3} [AddSemigroup S] {a b : S} (reg : IsAddRightRegular a) : AddCommute (b + a) a β AddCommute a b - AddCommute.add_left π Mathlib.Algebra.Group.Commute.Defs
{S : Type u_3} [AddSemigroup S] {a b c : S} (hac : AddCommute a c) (hbc : AddCommute b c) : AddCommute (a + b) c - AddCommute.add_right π Mathlib.Algebra.Group.Commute.Defs
{S : Type u_3} [AddSemigroup S] {a b c : S} (hab : AddCommute a b) (hac : AddCommute a c) : AddCommute a (b + c) - AddCommute.nsmul_left π Mathlib.Algebra.Group.Commute.Defs
{M : Type u_2} [AddMonoid M] {a b : M} (h : AddCommute a b) (n : β) : AddCommute (n β’ a) b - AddCommute.nsmul_right π Mathlib.Algebra.Group.Commute.Defs
{M : Type u_2} [AddMonoid M] {a b : M} (h : AddCommute a b) (n : β) : AddCommute a (n β’ b) - AddCommute.nsmul_nsmul_self π Mathlib.Algebra.Group.Commute.Defs
{M : Type u_2} [AddMonoid M] (a : M) (m n : β) : AddCommute (m β’ a) (n β’ a) - AddCommute.nsmul_nsmul π Mathlib.Algebra.Group.Commute.Defs
{M : Type u_2} [AddMonoid M] {a b : M} (h : AddCommute a b) (m n : β) : AddCommute (m β’ a) (n β’ b) - AddCommute.left_comm π Mathlib.Algebra.Group.Commute.Defs
{S : Type u_3} [AddSemigroup S] {a b : S} (h : AddCommute a b) (c : S) : a + (b + c) = b + (a + c) - AddCommute.right_comm π Mathlib.Algebra.Group.Commute.Defs
{S : Type u_3} [AddSemigroup S] {b c : S} (h : AddCommute b c) (a : S) : a + b + c = a + c + b - AddCommute.add_neg_cancel π Mathlib.Algebra.Group.Commute.Defs
{G : Type u_1} [AddGroup G] {a b : G} (h : AddCommute a b) : a + b + -a = b - AddCommute.add_neg_cancel_assoc π Mathlib.Algebra.Group.Commute.Defs
{G : Type u_1} [AddGroup G] {a b : G} (h : AddCommute a b) : a + (b + -a) = b - AddCommute.add_add_add_comm π Mathlib.Algebra.Group.Commute.Defs
{S : Type u_3} [AddSemigroup S] {b c : S} (hbc : AddCommute b c) (a d : S) : a + b + (c + d) = a + c + (b + d) - AddCommute.add_neg π Mathlib.Algebra.Group.Commute.Defs
{G : Type u_1} [SubtractionMonoid G] {a b : G} (hab : AddCommute a b) : -(a + b) = -a + -b - AddCommute.neg π Mathlib.Algebra.Group.Commute.Defs
{G : Type u_1} [SubtractionMonoid G] {a b : G} (hab : AddCommute a b) : -(a + b) = -a + -b - AddCommute.add_nsmul π Mathlib.Algebra.Group.Commute.Defs
{M : Type u_2} [AddMonoid M] {a b : M} (h : AddCommute a b) (n : β) : n β’ (a + b) = n β’ a + n β’ b - AddCommute.zsmul_add π Mathlib.Algebra.Group.Commute.Defs
{G : Type u_1} [SubtractionMonoid G] {a b : G} (h : AddCommute a b) (n : β€) : n β’ (a + b) = n β’ a + n β’ b - AddCommute.vadd_left π Mathlib.Algebra.Group.Action.Defs
{M : Type u_1} {Ξ± : Type u_5} [VAdd M Ξ±] [Add Ξ±] [VAddCommClass M Ξ± Ξ±] [VAddAssocClass M Ξ± Ξ±] {a b : Ξ±} (h : AddCommute a b) (r : M) : AddCommute (r +α΅₯ a) b - AddCommute.vadd_right π Mathlib.Algebra.Group.Action.Defs
{M : Type u_1} {Ξ± : Type u_5} [VAdd M Ξ±] [Add Ξ±] [VAddCommClass M Ξ± Ξ±] [VAddAssocClass M Ξ± Ξ±] {a b : Ξ±} (h : AddCommute a b) (r : M) : AddCommute a (r +α΅₯ b) - AddCommute.vadd_left_iff π Mathlib.Algebra.Group.Action.Defs
{G : Type u_3} {H : Type u_4} [AddGroup G] {g : G} [Add H] [AddAction G H] [VAddCommClass G H H] [VAddAssocClass G H H] {a b : H} : AddCommute (g +α΅₯ a) b β AddCommute a b - AddCommute.vadd_right_iff π Mathlib.Algebra.Group.Action.Defs
{G : Type u_3} {H : Type u_4} [AddGroup G] {g : G} [Add H] [AddAction G H] [VAddCommClass G H H] [VAddAssocClass G H H] {a b : H} : AddCommute a (g +α΅₯ b) β AddCommute a b - AddCommute.op π Mathlib.Algebra.Group.Opposite
{Ξ± : Type u_1} [Add Ξ±] {x y : Ξ±} (h : AddCommute x y) : AddCommute (AddOpposite.op x) (AddOpposite.op y) - AddOpposite.addCommute_op π Mathlib.Algebra.Group.Opposite
{Ξ± : Type u_1} [Add Ξ±] {x y : Ξ±} : AddCommute (AddOpposite.op x) (AddOpposite.op y) β AddCommute x y - AddCommute.unop π Mathlib.Algebra.Group.Opposite
{Ξ± : Type u_1} [Add Ξ±] {x y : Ξ±α΅α΅α΅} (h : AddCommute x y) : AddCommute (AddOpposite.unop x) (AddOpposite.unop y) - AddOpposite.addCommute_unop π Mathlib.Algebra.Group.Opposite
{Ξ± : Type u_1} [Add Ξ±] {x y : Ξ±α΅α΅α΅} : AddCommute (AddOpposite.unop x) (AddOpposite.unop y) β AddCommute x y - AddUnits.addCommute_coe_neg π Mathlib.Algebra.Group.Units.Defs
{Ξ± : Type u} [AddMonoid Ξ±] (a : AddUnits Ξ±) : AddCommute βa β(-a) - AddUnits.addCommute_neg_coe π Mathlib.Algebra.Group.Units.Defs
{Ξ± : Type u} [AddMonoid Ξ±] (a : AddUnits Ξ±) : AddCommute β(-a) βa - AddCommute.prod π Mathlib.Algebra.Group.Prod
{M : Type u_3} {N : Type u_4} [Add M] [Add N] {x y : M Γ N} (hm : AddCommute x.1 y.1) (hn : AddCommute x.2 y.2) : AddCommute x y - Prod.addCommute_iff π Mathlib.Algebra.Group.Prod
{M : Type u_3} {N : Type u_4} [Add M] [Add N] {x y : M Γ N} : AddCommute x y β AddCommute x.1 y.1 β§ AddCommute x.2 y.2 - AddMonoidHom.addCommute_inl_inr π Mathlib.Algebra.Group.Prod
{M : Type u_3} {N : Type u_4} [AddZeroClass M] [AddZeroClass N] (m : M) (n : N) : AddCommute ((AddMonoidHom.inl M N) m) ((AddMonoidHom.inr M N) n) - AddHom.fromOpposite π Mathlib.Algebra.Group.Equiv.Opposite
{M : Type u_3} {N : Type u_4} [Add M] [Add N] (f : M ββ+ N) (hf : β (x y : M), AddCommute (f x) (f y)) : Mα΅α΅α΅ ββ+ N - AddHom.toOpposite π Mathlib.Algebra.Group.Equiv.Opposite
{M : Type u_3} {N : Type u_4} [Add M] [Add N] (f : M ββ+ N) (hf : β (x y : M), AddCommute (f x) (f y)) : M ββ+ Nα΅α΅α΅ - AddMonoidHom.fromOpposite π Mathlib.Algebra.Group.Equiv.Opposite
{M : Type u_3} {N : Type u_4} [AddZeroClass M] [AddZeroClass N] (f : M β+ N) (hf : β (x y : M), AddCommute (f x) (f y)) : Mα΅α΅α΅ β+ N - AddMonoidHom.toOpposite π Mathlib.Algebra.Group.Equiv.Opposite
{M : Type u_3} {N : Type u_4} [AddZeroClass M] [AddZeroClass N] (f : M β+ N) (hf : β (x y : M), AddCommute (f x) (f y)) : M β+ Nα΅α΅α΅ - AddHom.toOpposite_apply π Mathlib.Algebra.Group.Equiv.Opposite
{M : Type u_3} {N : Type u_4} [Add M] [Add N] (f : M ββ+ N) (hf : β (x y : M), AddCommute (f x) (f y)) : β(f.toOpposite hf) = AddOpposite.op β βf - AddHom.fromOpposite_apply π Mathlib.Algebra.Group.Equiv.Opposite
{M : Type u_3} {N : Type u_4} [Add M] [Add N] (f : M ββ+ N) (hf : β (x y : M), AddCommute (f x) (f y)) : β(f.fromOpposite hf) = βf β AddOpposite.unop - AddMonoidHom.toOpposite_apply π Mathlib.Algebra.Group.Equiv.Opposite
{M : Type u_3} {N : Type u_4} [AddZeroClass M] [AddZeroClass N] (f : M β+ N) (hf : β (x y : M), AddCommute (f x) (f y)) : β(f.toOpposite hf) = AddOpposite.op β βf - AddMonoidHom.fromOpposite_apply π Mathlib.Algebra.Group.Equiv.Opposite
{M : Type u_3} {N : Type u_4} [AddZeroClass M] [AddZeroClass N] (f : M β+ N) (hf : β (x y : M), AddCommute (f x) (f y)) : β(f.fromOpposite hf) = βf β AddOpposite.unop - AddCommute.addUnits_of_val π Mathlib.Algebra.Group.Commute.Units
{M : Type u_1} [AddMonoid M] {uβ uβ : AddUnits M} : AddCommute βuβ βuβ β AddCommute uβ uβ - AddCommute.addUnits_val π Mathlib.Algebra.Group.Commute.Units
{M : Type u_1} [AddMonoid M] {uβ uβ : AddUnits M} : AddCommute uβ uβ β AddCommute βuβ βuβ - AddCommute.addUnits_val_iff π Mathlib.Algebra.Group.Commute.Units
{M : Type u_1} [AddMonoid M] {uβ uβ : AddUnits M} : AddCommute βuβ βuβ β AddCommute uβ uβ - AddCommute.addUnits_neg_left π Mathlib.Algebra.Group.Commute.Units
{M : Type u_1} [AddMonoid M] {a : M} {u : AddUnits M} : AddCommute (βu) a β AddCommute (β(-u)) a - AddCommute.addUnits_neg_right π Mathlib.Algebra.Group.Commute.Units
{M : Type u_1} [AddMonoid M] {a : M} {u : AddUnits M} : AddCommute a βu β AddCommute a β(-u) - AddCommute.addUnits_neg_left_iff π Mathlib.Algebra.Group.Commute.Units
{M : Type u_1} [AddMonoid M] {a : M} {u : AddUnits M} : AddCommute (β(-u)) a β AddCommute (βu) a - AddCommute.addUnits_neg_right_iff π Mathlib.Algebra.Group.Commute.Units
{M : Type u_1} [AddMonoid M] {a : M} {u : AddUnits M} : AddCommute a β(-u) β AddCommute a βu - AddUnits.leftOfAdd π Mathlib.Algebra.Group.Commute.Units
{M : Type u_1} [AddMonoid M] (u : AddUnits M) (a b : M) (hu : a + b = βu) (hc : AddCommute a b) : AddUnits M - AddUnits.rightOfAdd π Mathlib.Algebra.Group.Commute.Units
{M : Type u_1} [AddMonoid M] (u : AddUnits M) (a b : M) (hu : a + b = βu) (hc : AddCommute a b) : AddUnits M - AddCommute.isAddUnit_add_iff π Mathlib.Algebra.Group.Commute.Units
{M : Type u_1} [AddMonoid M] {a b : M} (h : AddCommute a b) : IsAddUnit (a + b) β IsAddUnit a β§ IsAddUnit b - AddCommute.addUnits_zsmul_left π Mathlib.Algebra.Group.Commute.Units
{M : Type u_1} [AddMonoid M] {a : M} {u : AddUnits M} (h : AddCommute (βu) a) (m : β€) : AddCommute (β(m β’ u)) a - AddCommute.addUnits_zsmul_right π Mathlib.Algebra.Group.Commute.Units
{M : Type u_1} [AddMonoid M] {a : M} {u : AddUnits M} (h : AddCommute a βu) (m : β€) : AddCommute a β(m β’ u) - AddUnits.addCommute_iff_add_neg_cancel π Mathlib.Algebra.Group.Commute.Units
{M : Type u_1} [AddMonoid M] {u : AddUnits M} {a : M} : AddCommute (βu) a β βu + a + β(-u) = a - AddUnits.addCommute_iff_add_neg_cancel_assoc π Mathlib.Algebra.Group.Commute.Units
{M : Type u_1} [AddMonoid M] {u : AddUnits M} {a : M} : AddCommute (βu) a β βu + (a + β(-u)) = a - AddUnits.addCommute_iff_neg_add_cancel π Mathlib.Algebra.Group.Commute.Units
{M : Type u_1} [AddMonoid M] {u : AddUnits M} {a : M} : AddCommute (βu) a β β(-u) + a + βu = a - AddUnits.addCommute_iff_neg_add_cancel_assoc π Mathlib.Algebra.Group.Commute.Units
{M : Type u_1} [AddMonoid M] {u : AddUnits M} {a : M} : AddCommute (βu) a β β(-u) + (a + βu) = a - AddCommute.sub_eq_sub_iff_of_isAddUnit π Mathlib.Algebra.Group.Commute.Units
{M : Type u_1} [SubtractionMonoid M] {a b c d : M} (hbd : AddCommute b d) (hb : IsAddUnit b) (hd : IsAddUnit d) : a - b = c - d β a + d = c + b - AddCommute.add_neg_eq_add_neg_iff_of_isAddUnit π Mathlib.Algebra.Group.Commute.Units
{M : Type u_1} [SubtractionMonoid M] {a b c d : M} (hbd : AddCommute b d) (hb : IsAddUnit b) (hd : IsAddUnit d) : a + -b = c + -d β a + d = c + b - AddCommute.neg_add_eq_neg_add_iff_of_isAddUnit π Mathlib.Algebra.Group.Commute.Units
{M : Type u_1} [SubtractionMonoid M] {a b c d : M} (hbd : AddCommute b d) (hb : IsAddUnit b) (hd : IsAddUnit d) : -b + a = -d + c β d + a = b + c - Nat.addCommute_cast π Mathlib.Data.Nat.Cast.Commute
{Ξ± : Type u_1} [AddMonoidWithOne Ξ±] (m n : β) : AddCommute βm βn - Nat.addCommute_cast_one π Mathlib.Data.Nat.Cast.Commute
{Ξ± : Type u_1} [AddMonoidWithOne Ξ±] (n : β) : AddCommute (βn) 1 - IsAddLeftRegular.right_of_addCommute π Mathlib.Algebra.Regular.Basic
{R : Type u_1} [Add R] {a : R} (ca : β (b : R), AddCommute a b) (h : IsAddLeftRegular a) : IsAddRightRegular a - IsAddRightRegular.left_of_addCommute π Mathlib.Algebra.Regular.Basic
{R : Type u_1} [Add R] {a : R} (ca : β (b : R), AddCommute a b) (h : IsAddRightRegular a) : IsAddLeftRegular a - AddCommute.isAddRegular_iff π Mathlib.Algebra.Regular.Basic
{R : Type u_1} [Add R] {a : R} (ca : β (b : R), AddCommute a b) : IsAddRegular a β IsAddLeftRegular a - AddCommute.isAddRightRegular_iff π Mathlib.Algebra.Regular.Basic
{R : Type u_1} [Add R] {a : R} (ca : β (b : R), AddCommute a b) : IsAddRightRegular a β IsAddLeftRegular a - AddCommute.list_sum_left π Mathlib.Algebra.BigOperators.Group.List.Basic
{M : Type u_4} [AddMonoid M] (l : List M) (y : M) (h : β x β l, AddCommute x y) : AddCommute l.sum y - AddCommute.list_sum_right π Mathlib.Algebra.BigOperators.Group.List.Basic
{M : Type u_4} [AddMonoid M] (l : List M) (y : M) (h : β x β l, AddCommute y x) : AddCommute y l.sum - List.sum_insertIdx π Mathlib.Algebra.BigOperators.Group.List.Basic
{M : Type u_4} [AddMonoid M] {l : List M} {a : M} {i : β} (hlen : i β€ l.length) (hcomm : β a' β List.take i l, AddCommute a a') : (l.insertIdx i a).sum = a + l.sum - List.add_sum_eraseIdx π Mathlib.Algebra.BigOperators.Group.List.Basic
{M : Type u_4} [AddMonoid M] {l : List M} {i : β} (hlen : i < l.length) (hcomm : β a' β List.take i l, AddCommute l[i] a') : l[i] + (l.eraseIdx i).sum = l.sum - AddCommute.self_zsmul π Mathlib.Algebra.Group.Commute.Basic
{G : Type u_1} [AddGroup G] (a : G) (n : β€) : AddCommute a (n β’ a) - AddCommute.zsmul_self π Mathlib.Algebra.Group.Commute.Basic
{G : Type u_1} [AddGroup G] (a : G) (n : β€) : AddCommute (n β’ a) a - AddCommute.function_commute_add_left π Mathlib.Algebra.Group.Commute.Basic
{G : Type u_1} [AddSemigroup G] {a b : G} (h : AddCommute a b) : Function.Commute (fun x => a + x) fun x => b + x - AddCommute.function_commute_add_right π Mathlib.Algebra.Group.Commute.Basic
{G : Type u_1} [AddSemigroup G] {a b : G} (h : AddCommute a b) : Function.Commute (fun x => x + a) fun x => x + b - AddCommute.neg_left π Mathlib.Algebra.Group.Commute.Basic
{G : Type u_1} [AddGroup G] {a b : G} : AddCommute a b β AddCommute (-a) b - AddCommute.neg_right π Mathlib.Algebra.Group.Commute.Basic
{G : Type u_1} [AddGroup G] {a b : G} : AddCommute a b β AddCommute a (-b) - AddCommute.neg_left_iff π Mathlib.Algebra.Group.Commute.Basic
{G : Type u_1} [AddGroup G] {a b : G} : AddCommute (-a) b β AddCommute a b - AddCommute.neg_right_iff π Mathlib.Algebra.Group.Commute.Basic
{G : Type u_1} [AddGroup G] {a b : G} : AddCommute a (-b) β AddCommute a b - AddCommute.zsmul_left π Mathlib.Algebra.Group.Commute.Basic
{G : Type u_1} [AddGroup G] {a b : G} (h : AddCommute a b) (m : β€) : AddCommute (m β’ a) b - AddCommute.zsmul_right π Mathlib.Algebra.Group.Commute.Basic
{G : Type u_1} [AddGroup G] {a b : G} (h : AddCommute a b) (m : β€) : AddCommute a (m β’ b) - AddCommute.zsmul_zsmul_self π Mathlib.Algebra.Group.Commute.Basic
{G : Type u_1} [AddGroup G] (a : G) (m n : β€) : AddCommute (m β’ a) (n β’ a) - AddCommute.neg_neg π Mathlib.Algebra.Group.Commute.Basic
{G : Type u_1} [SubtractionMonoid G] {a b : G} : AddCommute a b β AddCommute (-a) (-b) - AddCommute.neg_neg_iff π Mathlib.Algebra.Group.Commute.Basic
{G : Type u_1} [SubtractionMonoid G] {a b : G} : AddCommute (-a) (-b) β AddCommute a b - AddCommute.zsmul_zsmul π Mathlib.Algebra.Group.Commute.Basic
{G : Type u_1} [AddGroup G] {a b : G} (h : AddCommute a b) (m n : β€) : AddCommute (m β’ a) (n β’ b) - AddCommute.neg_add_cancel π Mathlib.Algebra.Group.Commute.Basic
{G : Type u_1} [AddGroup G] {a b : G} (h : AddCommute a b) : -a + b + a = b - AddCommute.neg_add_cancel_assoc π Mathlib.Algebra.Group.Commute.Basic
{G : Type u_1} [AddGroup G] {a b : G} (h : AddCommute a b) : -a + (b + a) = b - AddCommute.addConj π Mathlib.Algebra.Group.Commute.Basic
{G : Type u_1} [AddGroup G] {a b : G} (comm : AddCommute a b) (h : G) : AddCommute (h + a + -h) (h + b + -h) - AddCommute.addConj_iff π Mathlib.Algebra.Group.Commute.Basic
{G : Type u_1} [AddGroup G] {a b : G} (h : G) : AddCommute (h + a + -h) (h + b + -h) β AddCommute a b - AddCommute.add_sub_add_comm π Mathlib.Algebra.Group.Commute.Basic
{G : Type u_1} [SubtractionMonoid G] {a b c d : G} (hcd : AddCommute c d) (hbc : AddCommute b (-c)) : a + b - (c + d) = a - c + (b - d) - AddCommute.sub_add_sub_comm π Mathlib.Algebra.Group.Commute.Basic
{G : Type u_1} [SubtractionMonoid G] {a b c d : G} (hbd : AddCommute b d) (hbc : AddCommute (-b) c) : a - b + (c - d) = a + c - (b + d) - AddCommute.sub_sub_sub_comm π Mathlib.Algebra.Group.Commute.Basic
{G : Type u_1} [SubtractionMonoid G] {a b c d : G} (hbc : AddCommute b c) (hbd : AddCommute (-b) d) (hcd : AddCommute (-c) d) : a - b - (c - d) = a - c - (b - d) - List.Perm.sum_eq' π Mathlib.Algebra.BigOperators.Group.List.Lemmas
{M : Type u_3} [AddMonoid M] {lβ lβ : List M} (h : lβ.Perm lβ) (hc : List.Pairwise AddCommute lβ) : lβ.sum = lβ.sum - AddCommute.pi π Mathlib.Algebra.Group.Pi.Lemmas
{I : Type u} {f : I β Type v} [(i : I) β Add (f i)] {x y : (i : I) β f i} (h : β (i : I), AddCommute (x i) (y i)) : AddCommute x y - Pi.addCommute_iff π Mathlib.Algebra.Group.Pi.Lemmas
{I : Type u} {f : I β Type v} [(i : I) β Add (f i)] {x y : (i : I) β f i} : AddCommute x y β β (i : I), AddCommute (x i) (y i) - Pi.single_apply_addCommute π Mathlib.Algebra.Group.Pi.Lemmas
{I : Type u} {f : I β Type v} [DecidableEq I] [(i : I) β AddZeroClass (f i)] (x : (i : I) β f i) (i j : I) : AddCommute (Pi.single i (x i)) (Pi.single j (x j)) - Pi.single_addCommute π Mathlib.Algebra.Group.Pi.Lemmas
{I : Type u} {f : I β Type v} [DecidableEq I] [(i : I) β AddZeroClass (f i)] : Pairwise fun i j => β (x : f i) (y : f j), AddCommute (Pi.single i x) (Pi.single j y) - AddSubgroup.addCommute_of_normal_of_disjoint π Mathlib.Algebra.Group.Subgroup.Basic
{G : Type u_1} [AddGroup G] (Hβ Hβ : AddSubgroup G) (hHβ : Hβ.Normal) (hHβ : Hβ.Normal) (hdis : Disjoint Hβ Hβ) (x y : G) (hx : x β Hβ) (hy : y β Hβ) : AddCommute x y - IsAddCentral.comm π Mathlib.Algebra.Group.Center
{M : Type u_1} [Add M] {z : M} (self : IsAddCentral z) (a : M) : AddCommute z a - IsAddCentral.mk π Mathlib.Algebra.Group.Center
{M : Type u_1} [Add M] {z : M} (comm : β (a : M), AddCommute z a) (left_assoc : β (b c : M), z + (b + c) = z + b + c) (right_assoc : β (a b : M), a + b + z = a + (b + z)) : IsAddCentral z - isAddCentral_iff π Mathlib.Algebra.Group.Center
{M : Type u_1} [Add M] (z : M) : IsAddCentral z β (β (a : M), AddCommute z a) β§ (β (b c : M), z + (b + c) = z + b + c) β§ β (a b : M), a + b + z = a + (b + z) - AddCommute.map π Mathlib.Algebra.Group.Commute.Hom
{F : Type u_1} {M : Type u_2} {N : Type u_3} [Add M] [Add N] {x y : M} [FunLike F M N] [AddHomClass F M N] (h : AddCommute x y) (f : F) : AddCommute (f x) (f y) - AddCommute.of_map π Mathlib.Algebra.Group.Commute.Hom
{F : Type u_1} {M : Type u_2} {N : Type u_3} [Add M] [Add N] {x y : M} [FunLike F M N] [AddHomClass F M N] {f : F} (hf : Function.Injective βf) (h : AddCommute (f x) (f y)) : AddCommute x y - addCommute_map_iff π Mathlib.Algebra.Group.Commute.Hom
{F : Type u_1} {M : Type u_2} {N : Type u_3} [Add M] [Add N] [FunLike F M N] [AddHomClass F M N] {f : F} (hf : Function.Injective βf) {x y : M} : AddCommute (f x) (f y) β AddCommute x y - Multiset.noncommSum π Mathlib.Data.Finset.NoncommProd
{Ξ± : Type u_3} [AddMonoid Ξ±] (s : Multiset Ξ±) (comm : {x | x β s}.Pairwise AddCommute) : Ξ± - Finset.noncommSum π Mathlib.Data.Finset.NoncommProd
{Ξ± : Type u_3} {Ξ² : Type u_4} [AddMonoid Ξ²] (s : Finset Ξ±) (f : Ξ± β Ξ²) (comm : (βs).Pairwise (Function.onFun AddCommute f)) : Ξ² - Multiset.noncommSum_coe π Mathlib.Data.Finset.NoncommProd
{Ξ± : Type u_3} [AddMonoid Ξ±] (l : List Ξ±) (comm : {x | x β βl}.Pairwise AddCommute) : (βl).noncommSum comm = l.sum - Finset.noncommSum_empty π Mathlib.Data.Finset.NoncommProd
{Ξ± : Type u_3} {Ξ² : Type u_4} [AddMonoid Ξ²] (f : Ξ± β Ξ²) (h : (ββ ).Pairwise (Function.onFun AddCommute f)) : β .noncommSum f h = 0 - Finset.noncommSum_lemma π Mathlib.Data.Finset.NoncommProd
{Ξ± : Type u_3} {Ξ² : Type u_4} [AddMonoid Ξ²] (s : Finset Ξ±) (f : Ξ± β Ξ²) (comm : (βs).Pairwise (Function.onFun AddCommute f)) : {x | x β Multiset.map f s.val}.Pairwise AddCommute - Multiset.noncommSum_empty π Mathlib.Data.Finset.NoncommProd
{Ξ± : Type u_3} [AddMonoid Ξ±] (h : {x | x β 0}.Pairwise AddCommute) : Multiset.noncommSum 0 h = 0 - Multiset.noncommSum_addCommute π Mathlib.Data.Finset.NoncommProd
{Ξ± : Type u_3} [AddMonoid Ξ±] (s : Multiset Ξ±) (comm : {x | x β s}.Pairwise AddCommute) (y : Ξ±) (h : β x β s, AddCommute y x) : AddCommute y (s.noncommSum comm) - Multiset.noncommSum_eq_card_nsmul π Mathlib.Data.Finset.NoncommProd
{Ξ± : Type u_3} [AddMonoid Ξ±] (s : Multiset Ξ±) (comm : {x | x β s}.Pairwise AddCommute) (m : Ξ±) (h : β x β s, x = m) : s.noncommSum comm = s.card β’ m - Finset.noncommSum_toFinset π Mathlib.Data.Finset.NoncommProd
{Ξ± : Type u_3} {Ξ² : Type u_4} [AddMonoid Ξ²] [DecidableEq Ξ±] (l : List Ξ±) (f : Ξ± β Ξ²) (comm : (βl.toFinset).Pairwise (Function.onFun AddCommute f)) (hl : l.Nodup) : l.toFinset.noncommSum f comm = (List.map f l).sum - Finset.noncommSum_addCommute π Mathlib.Data.Finset.NoncommProd
{Ξ± : Type u_3} {Ξ² : Type u_4} [AddMonoid Ξ²] (s : Finset Ξ±) (f : Ξ± β Ξ²) (comm : (βs).Pairwise (Function.onFun AddCommute f)) (y : Ξ²) (h : β x β s, AddCommute y (f x)) : AddCommute y (s.noncommSum f comm) - Finset.noncommSum_eq_card_nsmul π Mathlib.Data.Finset.NoncommProd
{Ξ± : Type u_3} {Ξ² : Type u_4} [AddMonoid Ξ²] (s : Finset Ξ±) (f : Ξ± β Ξ²) (comm : (βs).Pairwise (Function.onFun AddCommute f)) (m : Ξ²) (h : β x β s, f x = m) : s.noncommSum f comm = s.card β’ m - Multiset.noncommSum_induction π Mathlib.Data.Finset.NoncommProd
{Ξ± : Type u_3} [AddMonoid Ξ±] (s : Multiset Ξ±) (comm : {x | x β s}.Pairwise AddCommute) (p : Ξ± β Prop) (hom : β (a b : Ξ±), p a β p b β p (a + b)) (addUnit : p 0) (base : β x β s, p x) : p (s.noncommSum comm) - Multiset.map_noncommSum_aux π Mathlib.Data.Finset.NoncommProd
{F : Type u_1} {Ξ± : Type u_3} {Ξ² : Type u_4} [AddMonoid Ξ±] [AddMonoid Ξ²] [FunLike F Ξ± Ξ²] [AddHomClass F Ξ± Ξ²] (s : Multiset Ξ±) (comm : {x | x β s}.Pairwise AddCommute) (f : F) : {x | x β Multiset.map (βf) s}.Pairwise AddCommute - Finset.noncommSum_induction π Mathlib.Data.Finset.NoncommProd
{Ξ± : Type u_3} {Ξ² : Type u_4} [AddMonoid Ξ²] (s : Finset Ξ±) (f : Ξ± β Ξ²) (comm : (βs).Pairwise (Function.onFun AddCommute f)) (p : Ξ² β Prop) (hom : β (a b : Ξ²), p a β p b β p (a + b)) (addUnit : p 0) (base : β x β s, p (f x)) : p (s.noncommSum f comm) - Multiset.map_noncommSum π Mathlib.Data.Finset.NoncommProd
{F : Type u_1} {Ξ± : Type u_3} {Ξ² : Type u_4} [AddMonoid Ξ±] [AddMonoid Ξ²] [FunLike F Ξ± Ξ²] [AddMonoidHomClass F Ξ± Ξ²] (s : Multiset Ξ±) (comm : {x | x β s}.Pairwise AddCommute) (f : F) : f (s.noncommSum comm) = (Multiset.map (βf) s).noncommSum β― - Multiset.noncommSum_cons π Mathlib.Data.Finset.NoncommProd
{Ξ± : Type u_3} [AddMonoid Ξ±] (s : Multiset Ξ±) (a : Ξ±) (comm : {x | x β a ::β s}.Pairwise AddCommute) : (a ::β s).noncommSum comm = a + s.noncommSum β― - Multiset.noncommSum_cons' π Mathlib.Data.Finset.NoncommProd
{Ξ± : Type u_3} [AddMonoid Ξ±] (s : Multiset Ξ±) (a : Ξ±) (comm : {x | x β a ::β s}.Pairwise AddCommute) : (a ::β s).noncommSum comm = s.noncommSum β― + a - Finset.noncommSum_congr π Mathlib.Data.Finset.NoncommProd
{Ξ± : Type u_3} {Ξ² : Type u_4} [AddMonoid Ξ²] {sβ sβ : Finset Ξ±} {f g : Ξ± β Ξ²} (hβ : sβ = sβ) (hβ : β x β sβ, f x = g x) (comm : (βsβ).Pairwise (Function.onFun AddCommute f)) : sβ.noncommSum f comm = sβ.noncommSum g β― - Finset.noncommSum_insert_of_notMem π Mathlib.Data.Finset.NoncommProd
{Ξ± : Type u_3} {Ξ² : Type u_4} [AddMonoid Ξ²] [DecidableEq Ξ±] (s : Finset Ξ±) (a : Ξ±) (f : Ξ± β Ξ²) (comm : (β(insert a s)).Pairwise (Function.onFun AddCommute f)) (ha : a β s) : (insert a s).noncommSum f comm = f a + s.noncommSum f β― - Finset.noncommSum_insert_of_notMem' π Mathlib.Data.Finset.NoncommProd
{Ξ± : Type u_3} {Ξ² : Type u_4} [AddMonoid Ξ²] [DecidableEq Ξ±] (s : Finset Ξ±) (a : Ξ±) (f : Ξ± β Ξ²) (comm : (β(insert a s)).Pairwise (Function.onFun AddCommute f)) (ha : a β s) : (insert a s).noncommSum f comm = s.noncommSum f β― + f a - Finset.noncommSum_add_distrib π Mathlib.Data.Finset.NoncommProd
{Ξ± : Type u_3} {Ξ² : Type u_4} [AddMonoid Ξ²] {s : Finset Ξ±} (f g : Ξ± β Ξ²) (comm_ff : (βs).Pairwise (Function.onFun AddCommute f)) (comm_gg : (βs).Pairwise (Function.onFun AddCommute g)) (comm_gf : (βs).Pairwise fun x y => AddCommute (g x) (f y)) : s.noncommSum (f + g) β― = s.noncommSum f comm_ff + s.noncommSum g comm_gg - Finset.noncommSum_add_distrib_aux π Mathlib.Data.Finset.NoncommProd
{Ξ± : Type u_3} {Ξ² : Type u_4} [AddMonoid Ξ²] {s : Finset Ξ±} {f g : Ξ± β Ξ²} (comm_ff : (βs).Pairwise (Function.onFun AddCommute f)) (comm_gg : (βs).Pairwise (Function.onFun AddCommute g)) (comm_gf : (βs).Pairwise fun x y => AddCommute (g x) (f y)) : (βs).Pairwise fun x y => AddCommute ((f + g) x) ((f + g) y) - Finset.map_noncommSum π Mathlib.Data.Finset.NoncommProd
{F : Type u_1} {Ξ± : Type u_3} {Ξ² : Type u_4} {Ξ³ : Type u_5} [AddMonoid Ξ²] [AddMonoid Ξ³] [FunLike F Ξ² Ξ³] [AddMonoidHomClass F Ξ² Ξ³] (s : Finset Ξ±) (f : Ξ± β Ξ²) (comm : (βs).Pairwise (Function.onFun AddCommute f)) (g : F) : g (s.noncommSum f comm) = s.noncommSum (fun i => g (f i)) β― - Finset.noncommSum_cons π Mathlib.Data.Finset.NoncommProd
{Ξ± : Type u_3} {Ξ² : Type u_4} [AddMonoid Ξ²] (s : Finset Ξ±) (a : Ξ±) (f : Ξ± β Ξ²) (ha : a β s) (comm : (β(Finset.cons a s ha)).Pairwise (Function.onFun AddCommute f)) : (Finset.cons a s ha).noncommSum f comm = f a + s.noncommSum f β― - Finset.noncommSum_cons' π Mathlib.Data.Finset.NoncommProd
{Ξ± : Type u_3} {Ξ² : Type u_4} [AddMonoid Ξ²] (s : Finset Ξ±) (a : Ξ±) (f : Ξ± β Ξ²) (ha : a β s) (comm : (β(Finset.cons a s ha)).Pairwise (Function.onFun AddCommute f)) : (Finset.cons a s ha).noncommSum f comm = s.noncommSum f β― + f a - Multiset.noncommSum_add π Mathlib.Data.Finset.NoncommProd
{Ξ± : Type u_3} [AddMonoid Ξ±] (s t : Multiset Ξ±) (comm : {x | x β s + t}.Pairwise AddCommute) : (s + t).noncommSum comm = s.noncommSum β― + t.noncommSum β― - Finset.noncommSum_union_of_disjoint π Mathlib.Data.Finset.NoncommProd
{Ξ± : Type u_3} {Ξ² : Type u_4} [AddMonoid Ξ²] [DecidableEq Ξ±] {s t : Finset Ξ±} (h : Disjoint s t) (f : Ξ± β Ξ²) (comm : (β(s βͺ t)).Pairwise (Function.onFun AddCommute f)) : (s βͺ t).noncommSum f comm = s.noncommSum f β― + t.noncommSum f β― - AddSubmonoid.multiset_noncommSum_mem π Mathlib.Algebra.Group.Submonoid.BigOperators
{M : Type u_1} [AddMonoid M] (S : AddSubmonoid M) (m : Multiset M) (comm : {x | x β m}.Pairwise AddCommute) (h : β x β m, x β S) : m.noncommSum comm β S - AddSubmonoid.noncommSum_mem π Mathlib.Algebra.Group.Submonoid.BigOperators
{M : Type u_1} [AddMonoid M] (S : AddSubmonoid M) {ΞΉ : Type u_3} (t : Finset ΞΉ) (f : ΞΉ β M) (comm : (βt).Pairwise (Function.onFun AddCommute f)) (h : β c β t, f c β S) : t.noncommSum f comm β S - AddCommute.addCommutator_eq π Mathlib.GroupTheory.Commutator.Basic
{G : Type u_1} [AddGroup G] {gβ gβ : G} (h : AddCommute gβ gβ) : β gβ, gββ = 0 - addCommutatorElement_eq_zero_iff_addCommute π Mathlib.GroupTheory.Commutator.Basic
{G : Type u_1} [AddGroup G] {gβ gβ : G} : β gβ, gββ = 0 β AddCommute gβ gβ - AddCommute.addCommutatorElement_nsmul_left π Mathlib.GroupTheory.Commutator.Basic
{G : Type u_1} [AddGroup G] {a b : G} (h : AddCommute a β a, bβ) (n : β) : n β’ β a, bβ = β n β’ a, bβ - AddCommute.addCommutatorElement_nsmul_right π Mathlib.GroupTheory.Commutator.Basic
{G : Type u_1} [AddGroup G] {a b : G} (h : AddCommute b β a, bβ) (n : β) : n β’ β a, bβ = β a, n β’ bβ - AddOreLocalization.oreSub_nsmul π Mathlib.GroupTheory.OreLocalization.Basic
{R : Type u_1} [AddMonoid R] {S : AddSubmonoid R} [AddOreLocalization.AddOreSet S] (r : R) (s : β₯S) (n : β) (h : AddCommute r βs) : n β’ (r -β s) = n β’ r -β n β’ s - Finsupp.addCommute_of_disjoint π Mathlib.Algebra.Group.Finsupp
{ΞΉ : Type u_1} {M : Type u_3} [AddZeroClass M] {f g : ΞΉ ββ M} (h : Disjoint f.support g.support) : AddCommute f g - Finsupp.addCommute_iff_inter π Mathlib.Algebra.Group.Finsupp
{ΞΉ : Type u_1} {M : Type u_3} [AddZeroClass M] [DecidableEq ΞΉ] {f g : ΞΉ ββ M} : AddCommute f g β β x β f.support β© g.support, AddCommute (f x) (g x) - AddSubgroup.multiset_noncommSum_mem π Mathlib.Algebra.Group.Subgroup.Finite
{G : Type u_1} [AddGroup G] (K : AddSubgroup G) (g : Multiset G) (comm : {x | x β g}.Pairwise AddCommute) : (β a β g, a β K) β g.noncommSum comm β K - AddSubgroup.noncommSum_mem π Mathlib.Algebra.Group.Subgroup.Finite
{G : Type u_1} [AddGroup G] (K : AddSubgroup G) {ΞΉ : Type u_2} {t : Finset ΞΉ} {f : ΞΉ β G} (comm : (βt).Pairwise (Function.onFun AddCommute f)) : (β c β t, f c β K) β t.noncommSum f comm β K - AddMonoidAlgebra.of'_commute π Mathlib.Algebra.MonoidAlgebra.Defs
{R : Type u_1} {M : Type u_4} [Semiring R] [AddZeroClass M] {a : M} (h : β (a' : M), AddCommute a a') (f : AddMonoidAlgebra R M) : Commute (AddMonoidAlgebra.of' R M a) f - AddMonoidAlgebra.single_commute π Mathlib.Algebra.MonoidAlgebra.Defs
{R : Type u_1} {M : Type u_4} [Semiring R] {r : R} {m : M} [Add M] (hm : β (m' : M), AddCommute m m') (hr : β (r' : R), Commute r r') (x : AddMonoidAlgebra R M) : Commute (AddMonoidAlgebra.single m r) x - AddMonoidAlgebra.single_commute_single π Mathlib.Algebra.MonoidAlgebra.Defs
{R : Type u_1} {M : Type u_4} [Semiring R] {rβ rβ : R} {mβ mβ : M} [Add M] (hm : AddCommute mβ mβ) (hr : Commute rβ rβ) : Commute (AddMonoidAlgebra.single mβ rβ) (AddMonoidAlgebra.single mβ rβ) - AddAction.fixedBy_mem_fixedBy_of_addCommute π Mathlib.GroupTheory.GroupAction.FixedPoints
{Ξ± : Type u_1} {G : Type u_2} [AddGroup G] [AddAction G Ξ±] {g h : G} (comm : AddCommute g h) : AddAction.fixedBy Ξ± g β AddAction.fixedBy (Set Ξ±) h - AddAction.movedBy_mem_fixedBy_of_addCommute π Mathlib.GroupTheory.GroupAction.FixedPoints
{Ξ± : Type u_1} {G : Type u_2} [AddGroup G] [AddAction G Ξ±] {g h : G} (comm : AddCommute g h) : (AddAction.fixedBy Ξ± g)αΆ β AddAction.fixedBy (Set Ξ±) h - AddAction.vadd_zsmul_fixedBy_eq_of_addCommute π Mathlib.GroupTheory.GroupAction.FixedPoints
{Ξ± : Type u_1} {G : Type u_2} [AddGroup G] [AddAction G Ξ±] {g h : G} (comm : AddCommute g h) (j : β€) : j β’ h +α΅₯ AddAction.fixedBy Ξ± g = AddAction.fixedBy Ξ± g - AddAction.vadd_zsmul_movedBy_eq_of_addCommute π Mathlib.GroupTheory.GroupAction.FixedPoints
{Ξ± : Type u_1} {G : Type u_2} [AddGroup G] [AddAction G Ξ±] {g h : G} (comm : AddCommute g h) (j : β€) : j β’ h +α΅₯ (AddAction.fixedBy Ξ± g)αΆ = (AddAction.fixedBy Ξ± g)αΆ - AddAction.not_addCommute_of_disjoint_movedBy_preimage π Mathlib.GroupTheory.GroupAction.FixedPoints
{Ξ± : Type u_1} {G : Type u_2} [AddGroup G] [AddAction G Ξ±] [FaithfulVAdd G Ξ±] {g h : G} (ne_zero : g β 0) (disjoint : Disjoint (AddAction.fixedBy Ξ± g)αΆ (h +α΅₯ (AddAction.fixedBy Ξ± g)αΆ)) : Β¬AddCommute g h - AddCommute.isOfFinAddOrder_add π Mathlib.GroupTheory.OrderOfElement
{G : Type u_1} [AddMonoid G] {x y : G} (h : AddCommute x y) (hx : IsOfFinAddOrder x) (hy : IsOfFinAddOrder y) : IsOfFinAddOrder (x + y) - AddCommute.addOrderOf_add_dvd_lcm π Mathlib.GroupTheory.OrderOfElement
{G : Type u_1} [AddMonoid G] {x y : G} (h : AddCommute x y) : addOrderOf (x + y) β£ (addOrderOf x).lcm (addOrderOf y) - AddCommute.addOrderOf_dvd_lcm_add π Mathlib.GroupTheory.OrderOfElement
{G : Type u_1} [AddMonoid G] {x y : G} (h : AddCommute x y) : addOrderOf y β£ (addOrderOf x).lcm (addOrderOf (x + y)) - AddCommute.addOrderOf_add_dvd_mul_addOrderOf π Mathlib.GroupTheory.OrderOfElement
{G : Type u_1} [AddMonoid G] {x y : G} (h : AddCommute x y) : addOrderOf (x + y) β£ addOrderOf x * addOrderOf y - AddCommute.addOrderOf_add_eq_mul_addOrderOf_of_coprime π Mathlib.GroupTheory.OrderOfElement
{G : Type u_1} [AddMonoid G] {x y : G} (h : AddCommute x y) (hco : (addOrderOf x).Coprime (addOrderOf y)) : addOrderOf (x + y) = addOrderOf x * addOrderOf y - AddCommute.addOrderOf_add_eq_left_of_forall_prime_mul_dvd π Mathlib.GroupTheory.OrderOfElement
{G : Type u_1} [AddMonoid G] {x y : G} (h : AddCommute x y) (hx : IsOfFinAddOrder x) (hdvd : β (p : β), Nat.Prime p β p β£ addOrderOf y β p * addOrderOf y β£ addOrderOf x) : addOrderOf (x + y) = addOrderOf x - AddCommute.addOrderOf_add_eq_right_of_forall_prime_mul_dvd π Mathlib.GroupTheory.OrderOfElement
{G : Type u_1} [AddMonoid G] {x y : G} (h : AddCommute x y) (hy : IsOfFinAddOrder y) (hdvd : β (p : β), Nat.Prime p β p β£ addOrderOf x β p * addOrderOf x β£ addOrderOf y) : addOrderOf (x + y) = addOrderOf y - AddSubgroup.eq_zero_of_noncommSum_eq_zero_of_iSupIndep π Mathlib.GroupTheory.NoncommPiCoprod
{G : Type u_1} [AddGroup G] {ΞΉ : Type u_2} (s : Finset ΞΉ) (f : ΞΉ β G) (comm : (βs).Pairwise (Function.onFun AddCommute f)) (K : ΞΉ β AddSubgroup G) (hind : iSupIndep K) (hmem : β x β s, f x β K x) (heq1 : s.noncommSum f comm = 0) (i : ΞΉ) : i β s β f i = 0 - AddSubgroup.independent_of_coprime_order π Mathlib.GroupTheory.NoncommPiCoprod
{G : Type u_1} [AddGroup G] {ΞΉ : Type u_2} {H : ΞΉ β AddSubgroup G} (hcomm : Pairwise fun i j => β (x y : G), x β H i β y β H j β AddCommute x y) [Finite ΞΉ] [(i : ΞΉ) β Fintype β₯(H i)] (hcoprime : Pairwise fun i j => (Fintype.card β₯(H i)).Coprime (Fintype.card β₯(H j))) : iSupIndep H - AddSubgroup.noncommPiCoprod_range π Mathlib.GroupTheory.NoncommPiCoprod
{G : Type u_1} [AddGroup G] {ΞΉ : Type u_2} {H : ΞΉ β AddSubgroup G} [Fintype ΞΉ] {hcomm : Pairwise fun i j => β (x y : G), x β H i β y β H j β AddCommute x y} : (AddSubgroup.noncommPiCoprod hcomm).range = β¨ i, H i - AddMonoidHom.noncommPiCoprod π Mathlib.GroupTheory.NoncommPiCoprod
{M : Type u_1} [AddMonoid M] {ΞΉ : Type u_2} [Fintype ΞΉ] {N : ΞΉ β Type u_3} [(i : ΞΉ) β AddMonoid (N i)] (Ο : (i : ΞΉ) β N i β+ M) (hcomm : Pairwise fun i j => β (x : N i) (y : N j), AddCommute ((Ο i) x) ((Ο j) y)) : ((i : ΞΉ) β N i) β+ M - AddSubgroup.noncommPiCoprod π Mathlib.GroupTheory.NoncommPiCoprod
{G : Type u_1} [AddGroup G] {ΞΉ : Type u_2} {H : ΞΉ β AddSubgroup G} [Fintype ΞΉ] (hcomm : Pairwise fun i j => β (x y : G), x β H i β y β H j β AddCommute x y) : ((i : ΞΉ) β β₯(H i)) β+ G - AddMonoidHom.noncommPiCoprodEquiv π Mathlib.GroupTheory.NoncommPiCoprod
{M : Type u_1} [AddMonoid M] {ΞΉ : Type u_2} [Fintype ΞΉ] {N : ΞΉ β Type u_3} [(i : ΞΉ) β AddMonoid (N i)] [DecidableEq ΞΉ] : { Ο // Pairwise fun i j => β (x : N i) (y : N j), AddCommute ((Ο i) x) ((Ο j) y) } β (((i : ΞΉ) β N i) β+ M) - AddMonoidHom.independent_range_of_coprime_order π Mathlib.GroupTheory.NoncommPiCoprod
{G : Type u_1} [AddGroup G] {ΞΉ : Type u_2} {H : ΞΉ β Type u_3} [(i : ΞΉ) β AddGroup (H i)] (Ο : (i : ΞΉ) β H i β+ G) (hcomm : Pairwise fun i j => β (x : H i) (y : H j), AddCommute ((Ο i) x) ((Ο j) y)) [Finite ΞΉ] [(i : ΞΉ) β Fintype (H i)] (hcoprime : Pairwise fun i j => (Fintype.card (H i)).Coprime (Fintype.card (H j))) : iSupIndep fun i => (Ο i).range - AddMonoidHom.noncommPiCoprod_range π Mathlib.GroupTheory.NoncommPiCoprod
{G : Type u_1} [AddGroup G] {ΞΉ : Type u_2} {H : ΞΉ β Type u_3} [(i : ΞΉ) β AddGroup (H i)] (Ο : (i : ΞΉ) β H i β+ G) [Fintype ΞΉ] {hcomm : Pairwise fun i j => β (x : H i) (y : H j), AddCommute ((Ο i) x) ((Ο j) y)} : (AddMonoidHom.noncommPiCoprod Ο hcomm).range = β¨ i, (Ο i).range - AddMonoidHom.noncommPiCoprod_single π Mathlib.GroupTheory.NoncommPiCoprod
{M : Type u_1} [AddMonoid M] {ΞΉ : Type u_2} [Fintype ΞΉ] {N : ΞΉ β Type u_3} [(i : ΞΉ) β AddMonoid (N i)] (Ο : (i : ΞΉ) β N i β+ M) {hcomm : Pairwise fun i j => β (x : N i) (y : N j), AddCommute ((Ο i) x) ((Ο j) y)} [DecidableEq ΞΉ] (i : ΞΉ) (y : N i) : (AddMonoidHom.noncommPiCoprod Ο hcomm) (Pi.single i y) = (Ο i) y - AddMonoidHom.addCommute_noncommPiCoprod π Mathlib.GroupTheory.NoncommPiCoprod
{M : Type u_1} [AddMonoid M] {ΞΉ : Type u_2} [Fintype ΞΉ] {N : ΞΉ β Type u_3} [(i : ΞΉ) β AddMonoid (N i)] (Ο : (i : ΞΉ) β N i β+ M) {hcomm : Pairwise fun i j => β (x : N i) (y : N j), AddCommute ((Ο i) x) ((Ο j) y)} {m : M} (comm : β (i : ΞΉ) (x : N i), AddCommute m ((Ο i) x)) (h : (i : ΞΉ) β N i) : AddCommute m ((AddMonoidHom.noncommPiCoprod Ο hcomm) h) - AddMonoidHom.noncommPiCoprod_mrange π Mathlib.GroupTheory.NoncommPiCoprod
{M : Type u_1} [AddMonoid M] {ΞΉ : Type u_2} [Fintype ΞΉ] {N : ΞΉ β Type u_3} [(i : ΞΉ) β AddMonoid (N i)] (Ο : (i : ΞΉ) β N i β+ M) {hcomm : Pairwise fun i j => β (x : N i) (y : N j), AddCommute ((Ο i) x) ((Ο j) y)} : AddMonoidHom.mrange (AddMonoidHom.noncommPiCoprod Ο hcomm) = β¨ i, AddMonoidHom.mrange (Ο i) - AddSubgroup.injective_noncommPiCoprod_of_iSupIndep π Mathlib.GroupTheory.NoncommPiCoprod
{G : Type u_1} [AddGroup G] {ΞΉ : Type u_2} {H : ΞΉ β AddSubgroup G} [Fintype ΞΉ] {hcomm : Pairwise fun i j => β (x y : G), x β H i β y β H j β AddCommute x y} (hind : iSupIndep H) : Function.Injective β(AddSubgroup.noncommPiCoprod hcomm) - AddMonoidHom.injective_noncommPiCoprod_of_iSupIndep π Mathlib.GroupTheory.NoncommPiCoprod
{G : Type u_1} [AddGroup G] {ΞΉ : Type u_2} {H : ΞΉ β Type u_3} [(i : ΞΉ) β AddGroup (H i)] (Ο : (i : ΞΉ) β H i β+ G) [Fintype ΞΉ] {hcomm : Pairwise fun i j => β (x : H i) (y : H j), AddCommute ((Ο i) x) ((Ο j) y)} (hind : iSupIndep fun i => (Ο i).range) (hinj : β (i : ΞΉ), Function.Injective β(Ο i)) : Function.Injective β(AddMonoidHom.noncommPiCoprod Ο hcomm) - AddMonoidHom.noncommPiCoprod_apply π Mathlib.GroupTheory.NoncommPiCoprod
{M : Type u_1} [AddMonoid M] {ΞΉ : Type u_2} [Fintype ΞΉ] {N : ΞΉ β Type u_3} [(i : ΞΉ) β AddMonoid (N i)] (Ο : (i : ΞΉ) β N i β+ M) {hcomm : Pairwise fun i j => β (x : N i) (y : N j), AddCommute ((Ο i) x) ((Ο j) y)} (h : (i : ΞΉ) β N i) : (AddMonoidHom.noncommPiCoprod Ο hcomm) h = Finset.univ.noncommSum (fun i => (Ο i) (h i)) β― - AddSubgroup.noncommPiCoprod_single π Mathlib.GroupTheory.NoncommPiCoprod
{G : Type u_1} [AddGroup G] {ΞΉ : Type u_2} {H : ΞΉ β AddSubgroup G} [Fintype ΞΉ] [DecidableEq ΞΉ] {hcomm : Pairwise fun i j => β (x y : G), x β H i β y β H j β AddCommute x y} (i : ΞΉ) (y : β₯(H i)) : (AddSubgroup.noncommPiCoprod hcomm) (Pi.single i y) = βy - AddSubgroup.noncommPiCoprod_apply π Mathlib.GroupTheory.NoncommPiCoprod
{G : Type u_1} [AddGroup G] {ΞΉ : Type u_2} {H : ΞΉ β AddSubgroup G} [Fintype ΞΉ] (comm : Pairwise fun i j => β (x y : G), x β H i β y β H j β AddCommute x y) (u : (i : ΞΉ) β β₯(H i)) : (AddSubgroup.noncommPiCoprod comm) u = Finset.univ.noncommSum (fun i => β(u i)) β― - AddSubgroup.addCommute_subtype_of_addCommute π Mathlib.GroupTheory.NoncommPiCoprod
{G : Type u_1} [AddGroup G] {ΞΉ : Type u_2} {H : ΞΉ β AddSubgroup G} (hcomm : Pairwise fun i j => β (x y : G), x β H i β y β H j β AddCommute x y) (i j : ΞΉ) (hne : i β j) (x : β₯(H i)) (y : β₯(H j)) : AddCommute ((H i).subtype x) ((H j).subtype y) - AddMonoidHom.comp_noncommPiCoprod π Mathlib.GroupTheory.NoncommPiCoprod
{M : Type u_1} [AddMonoid M] {ΞΉ : Type u_2} [Fintype ΞΉ] {N : ΞΉ β Type u_3} [(i : ΞΉ) β AddMonoid (N i)] (Ο : (i : ΞΉ) β N i β+ M) {hcomm : Pairwise fun i j => β (x : N i) (y : N j), AddCommute ((Ο i) x) ((Ο j) y)} {P : Type u_4} [AddMonoid P] {f : M β+ P} (hcomm' : Pairwise fun i j => β (x : N i) (y : N j), AddCommute ((f.comp (Ο i)) x) ((f.comp (Ο j)) y) := β―) : f.comp (AddMonoidHom.noncommPiCoprod Ο hcomm) = AddMonoidHom.noncommPiCoprod (fun i => f.comp (Ο i)) hcomm' - AddCommute.of_addOrderOf_dvd_two π Mathlib.GroupTheory.Exponent
{G : Type u} [AddMonoid G] [IsCancelAdd G] (h : β (g : G), addOrderOf g β£ 2) (a b : G) : AddCommute a b - AddCommute.exists_addOrderOf_eq_lcm π Mathlib.GroupTheory.Exponent
(G : Type u) [AddMonoid G] {x y : G} (h : AddCommute x y) : β z β AddSubmonoid.closure {x, y}, addOrderOf z = (addOrderOf x).lcm (addOrderOf y) - AddCommute.addOrderOf_add_nsmul_eq_lcm π Mathlib.GroupTheory.Exponent
{G : Type u} [AddMonoid G] {x y : G} (h : AddCommute x y) (hx : addOrderOf x β 0) (hy : addOrderOf y β 0) : addOrderOf ((addOrderOf x / (addOrderOf x).factorizationLCMLeft (addOrderOf y)) β’ x + (addOrderOf y / (addOrderOf x).factorizationLCMRight (addOrderOf y)) β’ y) = (addOrderOf x).lcm (addOrderOf y) - OrderAddMonoidHom.addCommute_inl_inr π Mathlib.Algebra.Order.Monoid.Lex
{Ξ± : Type u_1} {Ξ² : Type u_2} [AddMonoid Ξ±] [PartialOrder Ξ±] [AddMonoid Ξ²] [Preorder Ξ²] (m : Ξ±) (n : Ξ²) : AddCommute ((OrderAddMonoidHom.inl Ξ± Ξ²) m) ((OrderAddMonoidHom.inr Ξ± Ξ²) n) - OrderAddMonoidHom.addCommute_inlβ_inrβ π Mathlib.Algebra.Order.Monoid.Lex
{Ξ± : Type u_1} {Ξ² : Type u_2} [AddMonoid Ξ±] [PartialOrder Ξ±] [AddMonoid Ξ²] [Preorder Ξ²] (m : Ξ±) (n : Ξ²) : AddCommute ((OrderAddMonoidHom.inlβ Ξ± Ξ²) m) ((OrderAddMonoidHom.inrβ Ξ± Ξ²) n) - AddOreLocalization.cardinalMk_le_lift_cardinalMk_of_addCommute π Mathlib.GroupTheory.OreLocalization.Cardinality
{R : Type u} [AddMonoid R] (S : AddSubmonoid R) [AddOreLocalization.AddOreSet S] (X : Type v) [AddAction R X] (hc : β (s s' : β₯S), AddCommute s s') : Cardinal.mk (AddOreLocalization S X) β€ Cardinal.lift.{u, v} (Cardinal.mk X) - AddGroup.IsNilpotent.addCommute_of_addOrderOf_coprime π Mathlib.GroupTheory.Nilpotent
{G : Type u_1} [AddGroup G] [AddGroup.IsNilpotent G] {x y : G} (h : (addOrderOf x).Coprime (addOrderOf y)) : AddCommute x y - AddHom.noncommCoprod π Mathlib.GroupTheory.NoncommCoprod
{M : Type u_1} {N : Type u_2} {P : Type u_3} [Add M] [Add N] [AddSemigroup P] (f : M ββ+ P) (g : N ββ+ P) (comm : β (m : M) (n : N), AddCommute (f m) (g n)) : M Γ N ββ+ P - AddMonoidHom.noncommCoprod π Mathlib.GroupTheory.NoncommCoprod
{M : Type u_1} {N : Type u_2} {P : Type u_3} [AddZeroClass M] [AddZeroClass N] [AddMonoid P] (f : M β+ P) (g : N β+ P) (comm : β (m : M) (n : N), AddCommute (f m) (g n)) : M Γ N β+ P - AddMonoidHom.noncommCoprod_comp_inl π Mathlib.GroupTheory.NoncommCoprod
{M : Type u_1} {N : Type u_2} {P : Type u_3} [AddZeroClass M] [AddZeroClass N] [AddMonoid P] (f : M β+ P) (g : N β+ P) (comm : β (m : M) (n : N), AddCommute (f m) (g n)) : (f.noncommCoprod g comm).comp (AddMonoidHom.inl M N) = f - AddMonoidHom.noncommCoprod_comp_inr π Mathlib.GroupTheory.NoncommCoprod
{M : Type u_1} {N : Type u_2} {P : Type u_3} [AddZeroClass M] [AddZeroClass N] [AddMonoid P] (f : M β+ P) (g : N β+ P) (comm : β (m : M) (n : N), AddCommute (f m) (g n)) : (f.noncommCoprod g comm).comp (AddMonoidHom.inr M N) = g - AddHom.noncommCoprod_apply π Mathlib.GroupTheory.NoncommCoprod
{M : Type u_1} {N : Type u_2} {P : Type u_3} [Add M] [Add N] [AddSemigroup P] (f : M ββ+ P) (g : N ββ+ P) (comm : β (m : M) (n : N), AddCommute (f m) (g n)) (mn : M Γ N) : (f.noncommCoprod g comm) mn = f mn.1 + g mn.2 - AddHom.noncommCoprod_apply' π Mathlib.GroupTheory.NoncommCoprod
{M : Type u_1} {N : Type u_2} {P : Type u_3} [Add M] [Add N] [AddSemigroup P] (f : M ββ+ P) (g : N ββ+ P) (comm : β (m : M) (n : N), AddCommute (f m) (g n)) (mn : M Γ N) : (f.noncommCoprod g comm) mn = g mn.2 + f mn.1 - AddMonoidHom.noncommCoprod_apply π Mathlib.GroupTheory.NoncommCoprod
{M : Type u_1} {N : Type u_2} {P : Type u_3} [AddZeroClass M] [AddZeroClass N] [AddMonoid P] (f : M β+ P) (g : N β+ P) (comm : β (m : M) (n : N), AddCommute (f m) (g n)) (mn : M Γ N) : (f.noncommCoprod g comm) mn = f mn.1 + g mn.2
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