Loogle!
Result
Found 135 declarations mentioning AddSubgroup.closure.
- AddSubgroup.closure π Mathlib.Algebra.Group.Subgroup.Lattice
{G : Type u_1} [AddGroup G] (k : Set G) : AddSubgroup G - AddSubgroup.closure_univ π Mathlib.Algebra.Group.Subgroup.Lattice
{G : Type u_1} [AddGroup G] : AddSubgroup.closure Set.univ = β€ - AddSubgroup.closure_empty π Mathlib.Algebra.Group.Subgroup.Lattice
{G : Type u_1} [AddGroup G] : AddSubgroup.closure β = β₯ - AddSubgroup.closure_eq π Mathlib.Algebra.Group.Subgroup.Lattice
{G : Type u_1} [AddGroup G] (K : AddSubgroup G) : AddSubgroup.closure βK = K - AddSubgroup.subset_closure π Mathlib.Algebra.Group.Subgroup.Lattice
{G : Type u_1} [AddGroup G] {k : Set G} : k β β(AddSubgroup.closure k) - AddSubgroup.mem_closure_singleton_self π Mathlib.Algebra.Group.Subgroup.Lattice
{G : Type u_1} [AddGroup G] (x : G) : x β AddSubgroup.closure {x} - AddSubgroup.mem_closure_of_mem π Mathlib.Algebra.Group.Subgroup.Lattice
{G : Type u_1} [AddGroup G] {s : Set G} {x : G} (hx : x β s) : x β AddSubgroup.closure s - AddSubgroup.notMem_of_notMem_closure π Mathlib.Algebra.Group.Subgroup.Lattice
{G : Type u_1} [AddGroup G] {k : Set G} {P : G} (hP : P β AddSubgroup.closure k) : P β k - AddSubgroup.closure_insert_zero π Mathlib.Algebra.Group.Subgroup.Lattice
{G : Type u_1} [AddGroup G] (s : Set G) : AddSubgroup.closure (insert 0 s) = AddSubgroup.closure s - AddSubgroup.closure_mono π Mathlib.Algebra.Group.Subgroup.Lattice
{G : Type u_1} [AddGroup G] β¦h k : Set Gβ¦ (h' : h β k) : AddSubgroup.closure h β€ AddSubgroup.closure k - AddSubgroup.closure_singleton_zero π Mathlib.Algebra.Group.Subgroup.Lattice
{G : Type u_1} [AddGroup G] : AddSubgroup.closure {0} = β₯ - AddSubgroup.closure_iUnion π Mathlib.Algebra.Group.Subgroup.Lattice
{G : Type u_1} [AddGroup G] {ΞΉ : Sort u_2} (s : ΞΉ β Set G) : AddSubgroup.closure (β i, s i) = β¨ i, AddSubgroup.closure (s i) - AddSubgroup.closure_sdiff_zero π Mathlib.Algebra.Group.Subgroup.Lattice
{G : Type u_1} [AddGroup G] (s : Set G) : AddSubgroup.closure (s \ {0}) = AddSubgroup.closure s - AddSubgroup.closure_union_zero π Mathlib.Algebra.Group.Subgroup.Lattice
{G : Type u_1} [AddGroup G] (s : Set G) : AddSubgroup.closure (s βͺ {0}) = AddSubgroup.closure s - AddSubgroup.closure_le π Mathlib.Algebra.Group.Subgroup.Lattice
{G : Type u_1} [AddGroup G] (K : AddSubgroup G) {k : Set G} : AddSubgroup.closure k β€ K β k β βK - AddSubgroup.gi π Mathlib.Algebra.Group.Subgroup.Lattice
(G : Type u_1) [AddGroup G] : GaloisInsertion AddSubgroup.closure SetLike.coe - AddSubgroup.closure_eq_bot_iff π Mathlib.Algebra.Group.Subgroup.Lattice
{G : Type u_1} [AddGroup G] {k : Set G} : AddSubgroup.closure k = β₯ β k β {0} - AddSubgroup.closure_union π Mathlib.Algebra.Group.Subgroup.Lattice
{G : Type u_1} [AddGroup G] (s t : Set G) : AddSubgroup.closure (s βͺ t) = AddSubgroup.closure s β AddSubgroup.closure t - AddSubgroup.iSup_eq_closure π Mathlib.Algebra.Group.Subgroup.Lattice
{G : Type u_1} [AddGroup G] {ΞΉ : Sort u_2} (p : ΞΉ β AddSubgroup G) : β¨ i, p i = AddSubgroup.closure (β i, β(p i)) - AddSubgroup.closure_eq_of_le π Mathlib.Algebra.Group.Subgroup.Lattice
{G : Type u_1} [AddGroup G] (K : AddSubgroup G) {k : Set G} (hβ : k β βK) (hβ : K β€ AddSubgroup.closure k) : AddSubgroup.closure k = K - AddSubgroup.mem_closure_singleton π Mathlib.Algebra.Group.Subgroup.Lattice
{G : Type u_1} [AddGroup G] {x y : G} : y β AddSubgroup.closure {x} β β n, n β’ x = y - AddSubgroup.mem_closure π Mathlib.Algebra.Group.Subgroup.Lattice
{G : Type u_1} [AddGroup G] {k : Set G} {x : G} : x β AddSubgroup.closure k β β (K : AddSubgroup G), k β βK β x β K - AddSubgroup.closure_eq_top_of_mclosure_eq_top π Mathlib.Algebra.Group.Subgroup.Lattice
{G : Type u_1} [AddGroup G] {S : Set G} (h : AddSubmonoid.closure S = β€) : AddSubgroup.closure S = β€ - AddSubgroup.sup_eq_closure π Mathlib.Algebra.Group.Subgroup.Lattice
{G : Type u_1} [AddGroup G] (H H' : AddSubgroup G) : H β H' = AddSubgroup.closure (βH βͺ βH') - AddSubgroup.le_closure_toAddSubmonoid π Mathlib.Algebra.Group.Subgroup.Lattice
{G : Type u_1} [AddGroup G] (S : Set G) : AddSubmonoid.closure S β€ (AddSubgroup.closure S).toAddSubmonoid - AddSubgroup.mem_closure_pair π Mathlib.Algebra.Group.Subgroup.Lattice
{C : Type u_2} [AddCommGroup C] {x y z : C} : z β AddSubgroup.closure {x, y} β β m n, m β’ x + n β’ y = z - AddSubgroup.toSubgroup'_closure π Mathlib.Algebra.Group.Subgroup.Lattice
{G : Type u_1} [Group G] (S : Set (Additive G)) : AddSubgroup.toSubgroup' (AddSubgroup.closure S) = Subgroup.closure (βAdditive.ofMul β»ΒΉ' S) - AddSubgroup.toSubgroup_closure π Mathlib.Algebra.Group.Subgroup.Lattice
{A : Type u_2} [AddGroup A] (S : Set A) : AddSubgroup.toSubgroup (AddSubgroup.closure S) = Subgroup.closure (βMultiplicative.toAdd β»ΒΉ' S) - Subgroup.toAddSubgroup'_closure π Mathlib.Algebra.Group.Subgroup.Lattice
{A : Type u_2} [AddGroup A] (S : Set (Multiplicative A)) : Subgroup.toAddSubgroup' (Subgroup.closure S) = AddSubgroup.closure (βMultiplicative.ofAdd β»ΒΉ' S) - Subgroup.toAddSubgroup_closure π Mathlib.Algebra.Group.Subgroup.Lattice
{G : Type u_1} [Group G] (S : Set G) : Subgroup.toAddSubgroup (Subgroup.closure S) = AddSubgroup.closure (βAdditive.toMul β»ΒΉ' S) - AddSubgroup.closure_closure_coe_preimage π Mathlib.Algebra.Group.Subgroup.Lattice
{G : Type u_1} [AddGroup G] {k : Set G} : AddSubgroup.closure (Subtype.val β»ΒΉ' k) = β€ - AddSubgroup.closure_induction π Mathlib.Algebra.Group.Subgroup.Lattice
{G : Type u_1} [AddGroup G] {k : Set G} {p : (g : G) β g β AddSubgroup.closure k β Prop} (mem : β (x : G) (hx : x β k), p x β―) (zero : p 0 β―) (add : β (x y : G) (hx : x β AddSubgroup.closure k) (hy : y β AddSubgroup.closure k), p x hx β p y hy β p (x + y) β―) (neg : β (x : G) (hx : x β AddSubgroup.closure k), p x hx β p (-x) β―) {x : G} (hx : x β AddSubgroup.closure k) : p x hx - AddSubgroup.closure_inductionβ π Mathlib.Algebra.Group.Subgroup.Lattice
{G : Type u_1} [AddGroup G] {k : Set G} {p : (x y : G) β x β AddSubgroup.closure k β y β AddSubgroup.closure k β Prop} (mem : β (x y : G) (hx : x β k) (hy : y β k), p x y β― β―) (zero_left : β (x : G) (hx : x β AddSubgroup.closure k), p 0 x β― hx) (zero_right : β (x : G) (hx : x β AddSubgroup.closure k), p x 0 hx β―) (add_left : β (x y z : G) (hx : x β AddSubgroup.closure k) (hy : y β AddSubgroup.closure k) (hz : z β AddSubgroup.closure k), p x z hx hz β p y z hy hz β p (x + y) z β― hz) (add_right : β (y z x : G) (hy : y β AddSubgroup.closure k) (hz : z β AddSubgroup.closure k) (hx : x β AddSubgroup.closure k), p x y hx hy β p x z hx hz β p x (y + z) hx β―) (neg_left : β (x y : G) (hx : x β AddSubgroup.closure k) (hy : y β AddSubgroup.closure k), p x y hx hy β p (-x) y β― hy) (neg_right : β (x y : G) (hx : x β AddSubgroup.closure k) (hy : y β AddSubgroup.closure k), p x y hx hy β p x (-y) hx β―) {x y : G} (hx : x β AddSubgroup.closure k) (hy : y β AddSubgroup.closure k) : p x y hx hy - AddMonoidHom.map_closure π Mathlib.Algebra.Group.Subgroup.Map
{G : Type u_1} [AddGroup G] {N : Type u_4} [AddGroup N] (f : G β+ N) (s : Set G) : AddSubgroup.map f (AddSubgroup.closure s) = AddSubgroup.closure (βf '' s) - AddMonoidHom.closure_preimage_le π Mathlib.Algebra.Group.Subgroup.Map
{G : Type u_1} [AddGroup G] {N : Type u_4} [AddGroup N] (f : G β+ N) (s : Set N) : AddSubgroup.closure (βf β»ΒΉ' s) β€ AddSubgroup.comap f (AddSubgroup.closure s) - AddMonoidHom.eq_of_eqOn_dense π Mathlib.Algebra.Group.Subgroup.Ker
{G : Type u_1} [AddGroup G] {M : Type u_6} [AddMonoid M] {s : Set G} (hs : AddSubgroup.closure s = β€) {f g : G β+ M} (h : Set.EqOn (βf) (βg) s) : f = g - AddMonoidHom.eqOn_closure π Mathlib.Algebra.Group.Subgroup.Ker
{G : Type u_1} [AddGroup G] {M : Type u_6} [AddMonoid M] {f g : G β+ M} {s : Set G} (h : Set.EqOn (βf) (βg) s) : Set.EqOn βf βg β(AddSubgroup.closure s) - AddSubgroup.closure_preimage_eq_top π Mathlib.Algebra.Group.Subgroup.Ker
{G : Type u_1} [AddGroup G] (s : Set G) : AddSubgroup.closure (β(AddSubgroup.closure s).subtype β»ΒΉ' s) = β€ - AddSubgroup.closure_le_normalClosure π Mathlib.Algebra.Group.Subgroup.Basic
{G : Type u_1} [AddGroup G] {s : Set G} : AddSubgroup.closure s β€ AddSubgroup.normalClosure s - AddSubgroup.normalClosure_closure_eq_normalClosure π Mathlib.Algebra.Group.Subgroup.Basic
{G : Type u_1} [AddGroup G] {s : Set G} : AddSubgroup.normalClosure β(AddSubgroup.closure s) = AddSubgroup.normalClosure s - AddSubgroup.normalizer_le_normalizer_closure π Mathlib.Algebra.Group.Subgroup.Basic
{G : Type u_1} [AddGroup G] (s : Set G) : AddSubgroup.normalizer s β€ AddSubgroup.normalizer β(AddSubgroup.closure s) - AddSubgroup.normal_addSubgroupOf_closure_normalizer π Mathlib.Algebra.Group.Subgroup.Basic
{G : Type u_1} [AddGroup G] (s : Set G) : ((AddSubgroup.closure s).addSubgroupOf (AddSubgroup.normalizer s)).Normal - AddSubgroup.closure_prod π Mathlib.Algebra.Group.Subgroup.Basic
{G : Type u_1} [AddGroup G] {N : Type u_4} [AddGroup N] {s : Set G} {t : Set N} (hs : 0 β s) (ht : 0 β t) : AddSubgroup.closure (s ΓΛ’ t) = (AddSubgroup.closure s).prod (AddSubgroup.closure t) - AddSubgroup.le_normalizer_closure_iff π Mathlib.Algebra.Group.Subgroup.Basic
{G : Type u_1} [AddGroup G] {H : AddSubgroup G} {s : Set G} : H β€ AddSubgroup.normalizer β(AddSubgroup.closure s) β β h β H, β g β s, h + g + -h β AddSubgroup.closure s - AddSubgroup.unop_closure π Mathlib.Algebra.Group.Subgroup.MulOppositeLemmas
{G : Type u_2} [AddGroup G] (s : Set Gα΅α΅α΅) : (AddSubgroup.closure s).unop = AddSubgroup.closure (AddOpposite.op β»ΒΉ' s) - AddSubgroup.op_closure π Mathlib.Algebra.Group.Subgroup.MulOppositeLemmas
{G : Type u_2} [AddGroup G] (s : Set G) : (AddSubgroup.closure s).op = AddSubgroup.closure (AddOpposite.unop β»ΒΉ' s) - AddSubgroup.zmultiples_eq_closure π Mathlib.Algebra.Group.Subgroup.ZPowers.Basic
{G : Type u_1} [AddGroup G] (g : G) : AddSubgroup.zmultiples g = AddSubgroup.closure {g} - Int.addSubgroupClosure_one π Mathlib.Algebra.Group.Subgroup.ZPowers.Basic
: AddSubgroup.closure {1} = β€ - AddSubgroup.centralizer_closure π Mathlib.GroupTheory.Subgroup.Centralizer
{G : Type u_1} [AddGroup G] (s : Set G) : AddSubgroup.centralizer β(AddSubgroup.closure s) = AddSubgroup.centralizer s - AddSubgroup.closure_le_centralizer_centralizer π Mathlib.GroupTheory.Subgroup.Centralizer
{G : Type u_1} [AddGroup G] (s : Set G) : AddSubgroup.closure s β€ AddSubgroup.centralizer β(AddSubgroup.centralizer s) - AddSubgroup.center_eq_infi' π Mathlib.GroupTheory.Subgroup.Centralizer
{G : Type u_1} [AddGroup G] {s : Set G} (hs : AddSubgroup.closure s = β€) : AddSubgroup.center G = β¨ g, AddSubgroup.centralizer {βg} - AddSubgroup.center_eq_iInf π Mathlib.GroupTheory.Subgroup.Centralizer
{G : Type u_1} [AddGroup G] {s : Set G} (hs : AddSubgroup.closure s = β€) : AddSubgroup.center G = β¨ g β s, AddSubgroup.centralizer {g} - AddSubgroup.closureAddCommGroupOfComm π Mathlib.GroupTheory.Subgroup.Centralizer
{G : Type u_1} [AddGroup G] {k : Set G} (hcomm : β x β k, β y β k, x + y = y + x) : AddCommGroup β₯(AddSubgroup.closure k) - AddSubgroup.isAddCommutative_closure π Mathlib.GroupTheory.Subgroup.Centralizer
{G : Type u_1} [AddGroup G] {k : Set G} (hcomm : β x β k, β y β k, x + y = y + x) : IsAddCommutative β₯(AddSubgroup.closure k) - AddSubgroup.instIsAddCommutative_closure π Mathlib.GroupTheory.Subgroup.Centralizer
{G : Type u_1} [AddGroup G] {S : Type u_3} [SetLike S G] [AddMemClass S G] (s : S) [IsAddCommutative β₯s] : IsAddCommutative β₯(AddSubgroup.closure βs) - AddSubgroup.closure_neg π Mathlib.Algebra.Group.Subgroup.Pointwise
{G : Type u_2} [AddGroup G] (s : Set G) : AddSubgroup.closure (-s) = AddSubgroup.closure s - AddSubgroup.neg_subset_closure π Mathlib.Algebra.Group.Subgroup.Pointwise
{G : Type u_2} [AddGroup G] (S : Set G) : -S β β(AddSubgroup.closure S) - AddSubgroup.closure_singleton_neg π Mathlib.Algebra.Group.Subgroup.Pointwise
{G : Type u_2} [AddGroup G] (x : G) : AddSubgroup.closure {-x} = AddSubgroup.closure {x} - AddSubgroup.closure_toAddSubmonoid π Mathlib.Algebra.Group.Subgroup.Pointwise
{G : Type u_2} [AddGroup G] (S : Set G) : (AddSubgroup.closure S).toAddSubmonoid = AddSubmonoid.closure (S βͺ -S) - Set.addSubgroupClosure_add π Mathlib.Algebra.Group.Subgroup.Pointwise
{G : Type u_2} [AddGroup G] {s : Set G} (hs : s.Nonempty) : β(AddSubgroup.closure s) + s = β(AddSubgroup.closure s) - Set.add_addSubgroupClosure π Mathlib.Algebra.Group.Subgroup.Pointwise
{G : Type u_2} [AddGroup G] {s : Set G} (hs : s.Nonempty) : s + β(AddSubgroup.closure s) = β(AddSubgroup.closure s) - AddSubgroup.closure_nsmul_le π Mathlib.Algebra.Group.Subgroup.Pointwise
{G : Type u_2} [AddGroup G] {s : Set G} {n : β} : AddSubgroup.closure (n β’ s) β€ AddSubgroup.closure s - AddSubgroup.closure_nsmul π Mathlib.Algebra.Group.Subgroup.Pointwise
{G : Type u_2} [AddGroup G] {s : Set G} {n : β} (hs : 0 β s) (hn : n β 0) : AddSubgroup.closure (n β’ s) = AddSubgroup.closure s - AddSubgroup.closure_add_le π Mathlib.Algebra.Group.Subgroup.Pointwise
{G : Type u_2} [AddGroup G] (S T : Set G) : AddSubgroup.closure (S + T) β€ AddSubgroup.closure S β AddSubgroup.closure T - AddSubgroup.sup_eq_closure_add π Mathlib.Algebra.Group.Subgroup.Pointwise
{G : Type u_2} [AddGroup G] (H K : AddSubgroup G) : H β K = AddSubgroup.closure (βH + βK) - Set.addSubgroupClosure_add_nsmul π Mathlib.Algebra.Group.Subgroup.Pointwise
{G : Type u_2} [AddGroup G] {s : Set G} (hs : s.Nonempty) (n : β) : β(AddSubgroup.closure s) + n β’ s = β(AddSubgroup.closure s) - Set.nsmul_add_addSubgroupClosure π Mathlib.Algebra.Group.Subgroup.Pointwise
{G : Type u_2} [AddGroup G] {s : Set G} (hs : s.Nonempty) (n : β) : n β’ s + β(AddSubgroup.closure s) = β(AddSubgroup.closure s) - AddSubgroup.closure_nsmul_anti π Mathlib.Algebra.Group.Subgroup.Pointwise
{G : Type u_2} [AddGroup G] {s : Set G} {m n : β} (hmn : m β£ n) : AddSubgroup.closure (n β’ s) β€ AddSubgroup.closure (m β’ s) - AddSubgroup.vadd_mem_of_mem_closure_of_mem π Mathlib.Algebra.Group.Subgroup.Pointwise
{G : Type u_2} [AddGroup G] {X : Type u_5} [AddAction G X] {s : Set G} {t : Set X} (hs : β g β s, -g β s) (hst : β g β s, β x β t, g +α΅₯ x β t) {g : G} (hg : g β AddSubgroup.closure s) {x : X} (hx : x β t) : g +α΅₯ x β t - AddSubgroup.closure_induction'' π Mathlib.Algebra.Group.Subgroup.Pointwise
{G : Type u_2} [AddGroup G] {s : Set G} {p : (g : G) β g β AddSubgroup.closure s β Prop} (mem : β (x : G) (hx : x β s), p x β―) (neg_mem : β (x : G) (hx : x β s), p (-x) β―) (zero : p 0 β―) (add : β (x y : G) (hx : x β AddSubgroup.closure s) (hy : y β AddSubgroup.closure s), p x hx β p y hy β p (x + y) β―) {x : G} (h : x β AddSubgroup.closure s) : p x h - AddSubgroup.closure_induction_left π Mathlib.Algebra.Group.Subgroup.Pointwise
{G : Type u_2} [AddGroup G] {s : Set G} {p : (x : G) β x β AddSubgroup.closure s β Prop} (zero : p 0 β―) (add_left : β (x : G) (hx : x β s) (y : G) (hy : y β AddSubgroup.closure s), p y hy β p (x + y) β―) (neg_add_cancel : β (x : G) (hx : x β s) (y : G) (hy : y β AddSubgroup.closure s), p y hy β p (-x + y) β―) {x : G} (h : x β AddSubgroup.closure s) : p x h - AddSubgroup.closure_induction_right π Mathlib.Algebra.Group.Subgroup.Pointwise
{G : Type u_2} [AddGroup G] {s : Set G} {p : (x : G) β x β AddSubgroup.closure s β Prop} (zero : p 0 β―) (add_right : β (x : G) (hx : x β AddSubgroup.closure s) (y : G) (hy : y β s), p x hx β p (x + y) β―) (add_neg_cancel : β (x : G) (hx : x β AddSubgroup.closure s) (y : G) (hy : y β s), p x hx β p (x + -y) β―) {x : G} (h : x β AddSubgroup.closure s) : p x h - FreeAddGroup.closure_range_of π Mathlib.GroupTheory.FreeGroup.Basic
(Ξ± : Type u_1) : AddSubgroup.closure (Set.range FreeAddGroup.of) = β€ - FreeAddGroup.range_map π Mathlib.GroupTheory.FreeGroup.Basic
{Ξ± : Type u} {Ξ² : Type v} {f : Ξ± β Ξ²} : (FreeAddGroup.map f).range = AddSubgroup.closure (FreeAddGroup.of '' Set.range f) - FreeAddGroup.range_lift_eq_closure π Mathlib.GroupTheory.FreeGroup.Basic
{Ξ± : Type u} {Ξ² : Type v} [AddGroup Ξ²] {f : Ξ± β Ξ²} : (FreeAddGroup.lift f).range = AddSubgroup.closure (Set.range f) - FreeAddGroup.lift_surjective_iff_closure_range_eq_top π Mathlib.GroupTheory.FreeGroup.Basic
{Ξ± : Type u} {Ξ² : Type v} [AddGroup Ξ²] {f : Ξ± β Ξ²} : Function.Surjective β(FreeAddGroup.lift f) β AddSubgroup.closure (Set.range f) = β€ - FreeAddGroup.closure_eq_range π Mathlib.GroupTheory.FreeGroup.Basic
{Ξ² : Type v} [AddGroup Ξ²] (s : Set Ξ²) : AddSubgroup.closure s = (FreeAddGroup.lift Subtype.val).range - AddSubgroup.fg_iff π Mathlib.GroupTheory.Finiteness
{G : Type u_3} [AddGroup G] (P : AddSubgroup G) : P.FG β β S, AddSubgroup.closure S = P β§ S.Finite - AddGroup.fg_iff π Mathlib.GroupTheory.Finiteness
{G : Type u_3} [AddGroup G] : AddGroup.FG G β β S, AddSubgroup.closure S = β€ β§ S.Finite - AddGroup.closure_finite_fg π Mathlib.GroupTheory.Finiteness
{G : Type u_3} [AddGroup G] (s : Set G) [Finite βs] : AddGroup.FG β₯(AddSubgroup.closure s) - AddGroup.fg_iff' π Mathlib.GroupTheory.Finiteness
{G : Type u_3} [AddGroup G] : AddGroup.FG G β β n S, S.card = n β§ AddSubgroup.closure βS = β€ - AddGroup.closure_finset_fg π Mathlib.GroupTheory.Finiteness
{G : Type u_3} [AddGroup G] (s : Finset G) : AddGroup.FG β₯(AddSubgroup.closure βs) - addCommutator_eq_closure π Mathlib.GroupTheory.Commutator.Basic
(G : Type u_1) [AddGroup G] : addCommutator G = AddSubgroup.closure (addCommutatorSet G) - AddSubgroup.addCommutator_def π Mathlib.GroupTheory.Commutator.Basic
{G : Type u_1} [AddGroup G] (Hβ Hβ : AddSubgroup G) : β Hβ, Hββ = AddSubgroup.closure {g | β gβ β Hβ, β gβ β Hβ, β gβ, gββ = g} - NonUnitalSubring.mem_closure_iff π Mathlib.RingTheory.NonUnitalSubring.Basic
{R : Type u} [NonUnitalNonAssocRing R] {s : Set R} {x : R} : x β NonUnitalSubring.closure s β x β AddSubgroup.closure β(Subsemigroup.closure s) - Subring.mem_closure_iff π Mathlib.Algebra.Ring.Subring.Basic
{R : Type u} [NonAssocRing R] {s : Set R} {x : R} : x β Subring.closure s β x β AddSubgroup.closure β(Submonoid.closure s) - Submodule.span_int_eq_addSubgroupClosure π Mathlib.LinearAlgebra.Span.Defs
{M : Type u_6} [AddCommGroup M] (s : Set M) : (Submodule.span β€ s).toAddSubgroup = AddSubgroup.closure s - AddSubgroup.toIntSubmodule_closure π Mathlib.LinearAlgebra.Span.Basic
{M : Type u_11} [AddCommGroup M] (s : Set M) : AddSubgroup.toIntSubmodule (AddSubgroup.closure s) = Submodule.span β€ s - Module.Basis.addSubgroupOfClosure π Mathlib.LinearAlgebra.Basis.Submodule
{M : Type u_4} {R : Type u_5} [Ring R] [Nontrivial R] [IsAddTorsionFree R] [AddCommGroup M] [Module R M] (A : AddSubgroup M) {ΞΉ : Type u_6} (b : Module.Basis ΞΉ R M) (h : A = AddSubgroup.closure (Set.range βb)) : Module.Basis ΞΉ β€ β₯(AddSubgroup.toIntSubmodule A) - Module.Basis.addSubgroupOfClosure_apply π Mathlib.LinearAlgebra.Basis.Submodule
{M : Type u_4} {R : Type u_5} [Ring R] [Nontrivial R] [IsAddTorsionFree R] [AddCommGroup M] [Module R M] (A : AddSubgroup M) {ΞΉ : Type u_6} (b : Module.Basis ΞΉ R M) (h : A = AddSubgroup.closure (Set.range βb)) (i : ΞΉ) : β((Module.Basis.addSubgroupOfClosure A b h) i) = b i - Module.Basis.addSubgroupOfClosure_repr_apply π Mathlib.LinearAlgebra.Basis.Submodule
{M : Type u_4} {R : Type u_5} [Ring R] [Nontrivial R] [IsAddTorsionFree R] [AddCommGroup M] [Module R M] (A : AddSubgroup M) {ΞΉ : Type u_6} (b : Module.Basis ΞΉ R M) (h : A = AddSubgroup.closure (Set.range βb)) (x : β₯A) (i : ΞΉ) : β(((Module.Basis.addSubgroupOfClosure A b h).repr x) i) = (b.repr βx) i - AddSubgroup.closure_pi π Mathlib.Algebra.Group.Subgroup.Finite
{Ξ· : Type u_2} {f : Ξ· β Type u_3} [(i : Ξ·) β AddGroup (f i)] [Finite Ξ·] {s : (i : Ξ·) β Set (f i)} (hs : β (i : Ξ·), 0 β s i) : AddSubgroup.closure (Set.univ.pi fun i => s i) = AddSubgroup.pi Set.univ fun i => AddSubgroup.closure (s i) - AddSubgroup.closure_toAddSubmonoid_of_finite π Mathlib.GroupTheory.OrderOfElement
{G : Type u_1} [AddGroup G] [Finite G] {s : Set G} : (AddSubgroup.closure s).toAddSubmonoid = AddSubmonoid.closure s - AddSubgroup.closure_toAddSubmonoid_of_isOfFinAddOrder π Mathlib.GroupTheory.OrderOfElement
{G : Type u_1} [AddGroup G] {s : Set G} (hs : β x β s, IsOfFinAddOrder x) : (AddSubgroup.closure s).toAddSubmonoid = AddSubmonoid.closure s - AddSubgroup.exists_of_mem_closure_range π Mathlib.Algebra.Group.Subgroup.Finsupp
{M : Type u_1} [AddCommGroup M] {ΞΉ : Type u_2} (f : ΞΉ β M) (x : M) [Fintype ΞΉ] (hx : x β AddSubgroup.closure (Set.range f)) : β a, x = β i, a i β’ f i - AddSubgroup.mem_closure_range_iff_of_fintype π Mathlib.Algebra.Group.Subgroup.Finsupp
{M : Type u_1} [AddCommGroup M] {ΞΉ : Type u_2} {f : ΞΉ β M} {x : M} [Fintype ΞΉ] : x β AddSubgroup.closure (Set.range f) β β a, x = β i, a i β’ f i - AddSubgroup.exists_finsupp_of_mem_closure_range π Mathlib.Algebra.Group.Subgroup.Finsupp
{M : Type u_1} [AddCommGroup M] {ΞΉ : Type u_2} (f : ΞΉ β M) (x : M) (hx : x β AddSubgroup.closure (Set.range f)) : β a, x = a.sum fun x1 x2 => x2 β’ f x1 - AddSubgroup.mem_closure_range_iff π Mathlib.Algebra.Group.Subgroup.Finsupp
{M : Type u_1} [AddCommGroup M] {ΞΉ : Type u_2} {f : ΞΉ β M} {x : M} : x β AddSubgroup.closure (Set.range f) β β a, x = a.sum fun x1 x2 => x2 β’ f x1 - AddSubgroup.mem_closure_iff_of_fintype π Mathlib.Algebra.Group.Subgroup.Finsupp
{M : Type u_1} [AddCommGroup M] {x : M} {s : Set M} [Fintype βs] : x β AddSubgroup.closure s β β a, x = β i, a i β’ βi - Int.closure_eq_zmultiples π Mathlib.Algebra.Group.Subgroup.ZPowers.Lemmas
(a b : β€) : AddSubgroup.closure {a, b} = AddSubgroup.zmultiples β(a.gcd b) - Int.closure_eq_zmultiples_finsetGcd π Mathlib.Algebra.Group.Subgroup.ZPowers.Lemmas
(s : Finset β€) : AddSubgroup.closure βs = AddSubgroup.zmultiples (s.gcd id) - AddSubgroup.finsetSup_zmultiples π Mathlib.Algebra.Group.Subgroup.ZPowers.Lemmas
{G : Type u_1} [AddGroup G] (s : Finset G) : s.sup AddSubgroup.zmultiples = AddSubgroup.closure βs - TwoSidedIdeal.mem_span_iff_mem_addSubgroup_closure π Mathlib.RingTheory.TwoSidedIdeal.Operations
{R : Type u_1} [Ring R] {s : Set R} {z : R} : z β TwoSidedIdeal.span s β z β AddSubgroup.closure (Set.univ * s * Set.univ) - TwoSidedIdeal.mem_span_iff_mem_addSubgroup_closure_absorbing π Mathlib.RingTheory.TwoSidedIdeal.Operations
{R : Type u_1} [NonUnitalRing R] {s : Set R} (h_left : β (x y : R), y β s β x * y β s) (h_right : β (y x : R), y β s β y * x β s) {z : R} : z β TwoSidedIdeal.span s β z β AddSubgroup.closure s - TwoSidedIdeal.mem_span_iff_mem_addSubgroup_closure_nonunital π Mathlib.RingTheory.TwoSidedIdeal.Operations
{R : Type u_1} [NonUnitalRing R] {s : Set R} {z : R} : z β TwoSidedIdeal.span s β z β AddSubgroup.closure (s βͺ s * Set.univ βͺ Set.univ * s βͺ Set.univ * s * Set.univ) - AddGroup.rank_le π Mathlib.GroupTheory.Rank
{G : Type u_1} [AddGroup G] [h : AddGroup.FG G] {S : Finset G} (hS : AddSubgroup.closure βS = β€) : AddGroup.rank G β€ S.card - AddGroup.rank_spec π Mathlib.GroupTheory.Rank
(G : Type u_1) [AddGroup G] [h : AddGroup.FG G] : β S, S.card = AddGroup.rank G β§ AddSubgroup.closure βS = β€ - AddSubgroup.rank_closure_finite_le_nat_card π Mathlib.GroupTheory.Rank
{G : Type u_1} [AddGroup G] (s : Set G) [Finite βs] : AddGroup.rank β₯(AddSubgroup.closure s) β€ Nat.card βs - AddSubgroup.rank_closure_finset_le_card π Mathlib.GroupTheory.Rank
{G : Type u_1} [AddGroup G] (s : Finset G) : AddGroup.rank β₯(AddSubgroup.closure βs) β€ s.card - AddSubgroup.closure_image_isAddIndecomposable_baseOf π Mathlib.Algebra.Group.Irreducible.Indecomposable
{ΞΉ : Type u_1} {G : Type u_3} {S : Type u_4} [AddCommGroup G] [LinearOrder S] [Finite ΞΉ] [InvolutiveNeg ΞΉ] [AddCommGroup S] [IsOrderedAddMonoid S] (v : ΞΉ β G) (hv_neg : β (i : ΞΉ), v (-i) = -v i) (f : G β+ S) (hf : β (i : ΞΉ), f (v i) β 0) : AddSubgroup.closure (v '' IsAddIndecomposable.baseOf v f) = AddSubgroup.closure (Set.range v) - Int.subgroup_cyclic π Mathlib.GroupTheory.Archimedean
(H : AddSubgroup β€) : β a, H = AddSubgroup.closure {a} - AddSubgroup.cyclic_of_min π Mathlib.GroupTheory.Archimedean
{G : Type u_1} [AddCommGroup G] [LinearOrder G] [IsOrderedAddMonoid G] [Archimedean G] {H : AddSubgroup G} {a : G} (ha : IsLeast {g | g β H β§ 0 < g} a) : H = AddSubgroup.closure {a} - AddSubgroup.cyclic_of_isolated_zero π Mathlib.GroupTheory.Archimedean
{G : Type u_1} [AddCommGroup G] [LinearOrder G] [IsOrderedAddMonoid G] [Archimedean G] {H : AddSubgroup G} {a : G} (hβ : 0 < a) (hd : Disjoint (βH) (Set.Ioo 0 a)) : β b, H = AddSubgroup.closure {b} - AddSubgroup.dense_or_cyclic π Mathlib.Topology.Algebra.Order.Archimedean
{G : Type u_1} [AddCommGroup G] [LinearOrder G] [IsOrderedAddMonoid G] [TopologicalSpace G] [OrderTopology G] [Archimedean G] (S : AddSubgroup G) : Dense βS β¨ β a, S = AddSubgroup.closure {a} - AddSubgroup.relIndex_eq_abs_det π Mathlib.LinearAlgebra.FreeModule.Finite.CardQuotient
{E : Type u_1} [AddCommGroup E] [Module β E] (Lβ Lβ : AddSubgroup E) (H : Lβ β€ Lβ) {ΞΉ : Type u_2} [DecidableEq ΞΉ] [Fintype ΞΉ] (bβ bβ : Module.Basis ΞΉ β E) (hβ : Lβ = AddSubgroup.closure (Set.range βbβ)) (hβ : Lβ = AddSubgroup.closure (Set.range βbβ)) : β(Lβ.relIndex Lβ) = |bβ.det βbβ| - AddSubgroup.mem_closure_singleton_iff_existsUnique_zsmul π Mathlib.GroupTheory.ArchimedeanDensely
{G : Type u_1} [AddCommGroup G] [LinearOrder G] [IsOrderedAddMonoid G] {a b : G} (ha : a β 0) : b β AddSubgroup.closure {a} β β! k, k β’ a = b - AddSubgroup.isLeast_of_closure_iff_eq_abs π Mathlib.GroupTheory.ArchimedeanDensely
{G : Type u_1} [AddCommGroup G] [LinearOrder G] [IsOrderedAddMonoid G] [Archimedean G] {a b : G} : IsLeast {y | y β AddSubgroup.closure {a} β§ 0 < y} b β b = |a| β§ 0 < b - LinearOrderedAddCommGroup.closure_equiv_closure π Mathlib.GroupTheory.ArchimedeanDensely
{G : Type u_1} {G' : Type u_2} [AddCommGroup G] [LinearOrder G] [IsOrderedAddMonoid G] [AddCommGroup G'] [LinearOrder G'] [IsOrderedAddMonoid G'] (x : G) (y : G') (hxy : x = 0 β y = 0) : β₯(AddSubgroup.closure {x}) β+o β₯(AddSubgroup.closure {y}) - dense_addSubgroupClosure_pair_iff π Mathlib.Topology.Instances.AddCircle.DenseSubgroup
{a b : β} : Dense β(AddSubgroup.closure {a, b}) β Irrational (a / b) - Finset.nsmul_right_strictMono π Mathlib.Geometry.Group.Growth.LinearLowerBound
{G : Type u_1} [AddGroup G] [DecidableEq G] {X : Finset G} (hXβ : 0 β X) (hXclosure : (β(AddSubgroup.closure βX)).Infinite) : StrictMono fun n => n β’ X - Finset.add_nonneg_card_nsmul π Mathlib.Geometry.Group.Growth.LinearLowerBound
{G : Type u_1} [AddGroup G] [DecidableEq G] {X : Finset G} (hXβ : 0 β X) (hXclosure : (β(AddSubgroup.closure βX)).Infinite) (n : β) : n + 1 β€ (n β’ X).card - Finset.nsmul_right_strictMonoOn π Mathlib.Geometry.Group.Growth.LinearLowerBound
{G : Type u_1} [AddGroup G] [DecidableEq G] {X : Finset G} (hXβ : 0 β X) (hX : X.Nontrivial) : StrictMonoOn (fun n => n β’ X) {n | (n - 1) β’ βX β β(AddSubgroup.closure βX)} - Finset.nsmul_ssubset_nsmul_succ_of_nsmul_ne_closure π Mathlib.Geometry.Group.Growth.LinearLowerBound
{G : Type u_1} [AddGroup G] [DecidableEq G] {X : Finset G} {n : β} (hXβ : 0 β X) (hX : X.Nontrivial) (hXclosure : n β’ βX β β(AddSubgroup.closure βX)) : n β’ X β (n + 1) β’ X - AddMonoid.Coprod.closure_range_inl_union_inr π Mathlib.GroupTheory.Coprod.Basic
{G : Type u_1} {H : Type u_2} [AddGroup G] [AddGroup H] : AddSubgroup.closure (Set.range βAddMonoid.Coprod.inl βͺ Set.range βAddMonoid.Coprod.inr) = β€ - AddSubgroup.closure_add_image_eq π Mathlib.GroupTheory.Schreier
{G : Type u_1} [AddGroup G] {H : AddSubgroup G} {R S : Set G} (hR : AddSubgroup.IsComplement (βH) R) (hR1 : 0 β R) (hS : AddSubgroup.closure S = β€) : AddSubgroup.closure ((fun g => g + -β(hR.toRightFun g)) '' (R + S)) = H - AddSubgroup.closure_add_image_add_eq_top π Mathlib.GroupTheory.Schreier
{G : Type u_1} [AddGroup G] {H : AddSubgroup G} {R S : Set G} (hR : AddSubgroup.IsComplement (βH) R) (hR1 : 0 β R) (hS : AddSubgroup.closure S = β€) : β(AddSubgroup.closure ((fun g => g + -β(hR.toRightFun g)) '' (R + S))) + R = β€ - AddSubgroup.exists_finset_card_le_add π Mathlib.GroupTheory.Schreier
{G : Type u_1} [AddGroup G] (H : AddSubgroup G) [H.FiniteIndex] {S : Finset G} (hS : AddSubgroup.closure βS = β€) : β T, T.card β€ H.index * S.card β§ AddSubgroup.closure βT = β€ - AddSubgroup.closure_add_image_eq_top π Mathlib.GroupTheory.Schreier
{G : Type u_1} [AddGroup G] {H : AddSubgroup G} {R S : Set G} (hR : AddSubgroup.IsComplement (βH) R) (hR1 : 0 β R) (hS : AddSubgroup.closure S = β€) : AddSubgroup.closure ((fun g => β¨g + -β(hR.toRightFun g), β―β©) '' (R + S)) = β€ - AddSubgroup.closure_add_image_eq_top' π Mathlib.GroupTheory.Schreier
{G : Type u_1} [AddGroup G] {H : AddSubgroup G} [DecidableEq G] {R S : Finset G} (hR : AddSubgroup.IsComplement βH βR) (hR1 : 0 β R) (hS : AddSubgroup.closure βS = β€) : AddSubgroup.closure β(Finset.image (fun g => β¨g + -β(hR.toRightFun g), β―β©) (R + S)) = β€ - AddSubgroup.focalAddSubgroup_def π Mathlib.GroupTheory.Focal
{G : Type u_1} [AddGroup G] (H : AddSubgroup G) : H.focalAddSubgroup = AddSubgroup.closure {g | g β H β§ β x β H, β u, g = β x, uβ} - AddSubgroup.focalAddSubgroupOf_eq_closure π Mathlib.GroupTheory.Focal
{G : Type u_1} [AddGroup G] (H : AddSubgroup G) : H.focalAddSubgroupOf = AddSubgroup.closure {g | β x β H, β u, βg = β x, uβ} - AddSubgroup.mem_lowerCentralSeries_succ_iff π Mathlib.GroupTheory.Nilpotent
{G : Type u_1} [AddGroup G] (S : AddSubgroup G) (n : β) (q : G) : q β S.lowerCentralSeries (n + 1) β q β AddSubgroup.closure {x | β p β S.lowerCentralSeries n, β q β S, β p, qβ = x} - dense_addSubmonoidClosure_iff_addSubgroupClosure π Mathlib.Topology.Algebra.Group.SubmonoidClosure
{G : Type u_1} [AddGroup G] [TopologicalSpace G] [CompactSpace G] [IsTopologicalAddGroup G] {s : Set G} : Dense β(AddSubmonoid.closure s) β Dense β(AddSubgroup.closure s) - closure_addSubmonoidClosure_eq_closure_addSubgroupClosure π Mathlib.Topology.Algebra.Group.SubmonoidClosure
{G : Type u_1} [AddGroup G] [TopologicalSpace G] [CompactSpace G] [IsTopologicalAddGroup G] (s : Set G) : closure β(AddSubmonoid.closure s) = closure β(AddSubgroup.closure s) - topologicalClosure_addSubgroupClosure_toAddSubmonoid π Mathlib.Topology.Algebra.Group.SubmonoidClosure
{G : Type u_1} [AddGroup G] [TopologicalSpace G] [CompactSpace G] [IsTopologicalAddGroup G] (s : Set G) : (AddSubgroup.closure s).topologicalClosure = (AddSubmonoid.closure s).topologicalClosure
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