Loogle!
Result
Found 173 declarations mentioning SubMulAction.
- SubMulAction π Mathlib.GroupTheory.GroupAction.SubMulAction
(R : Type u) (M : Type v) [SMul R M] : Type v - SubMulAction.instBot π Mathlib.GroupTheory.GroupAction.SubMulAction
{R : Type u} {M : Type v} [SMul R M] : Bot (SubMulAction R M) - SubMulAction.instCompleteLattice π Mathlib.GroupTheory.GroupAction.SubMulAction
{R : Type u} {M : Type v} [SMul R M] : CompleteLattice (SubMulAction R M) - SubMulAction.instInfSet π Mathlib.GroupTheory.GroupAction.SubMulAction
{R : Type u} {M : Type v} [SMul R M] : InfSet (SubMulAction R M) - SubMulAction.instInhabited π Mathlib.GroupTheory.GroupAction.SubMulAction
{R : Type u} {M : Type v} [SMul R M] : Inhabited (SubMulAction R M) - SubMulAction.instMax π Mathlib.GroupTheory.GroupAction.SubMulAction
{R : Type u} {M : Type v} [SMul R M] : Max (SubMulAction R M) - SubMulAction.instMin π Mathlib.GroupTheory.GroupAction.SubMulAction
{R : Type u} {M : Type v} [SMul R M] : Min (SubMulAction R M) - SubMulAction.instPartialOrder π Mathlib.GroupTheory.GroupAction.SubMulAction
{R : Type u} {M : Type v} [SMul R M] : PartialOrder (SubMulAction R M) - SubMulAction.instSupSet π Mathlib.GroupTheory.GroupAction.SubMulAction
{R : Type u} {M : Type v} [SMul R M] : SupSet (SubMulAction R M) - SubMulAction.instTop π Mathlib.GroupTheory.GroupAction.SubMulAction
{R : Type u} {M : Type v} [SMul R M] : Top (SubMulAction R M) - SubMulAction.carrier π Mathlib.GroupTheory.GroupAction.SubMulAction
{R : Type u} {M : Type v} [SMul R M] (self : SubMulAction R M) : Set M - SubMulAction.instSetLike π Mathlib.GroupTheory.GroupAction.SubMulAction
{R : Type u} {M : Type v} [SMul R M] : SetLike (SubMulAction R M) M - SubMulAction.instSMulMemClass π Mathlib.GroupTheory.GroupAction.SubMulAction
{R : Type u} {M : Type v} [SMul R M] : SMulMemClass (SubMulAction R M) R M - SubMulAction.copy π Mathlib.GroupTheory.GroupAction.SubMulAction
{R : Type u} {M : Type v} [SMul R M] (p : SubMulAction R M) (s : Set M) (hs : s = βp) : SubMulAction R M - SubMulAction.instSMulSubtypeMem π Mathlib.GroupTheory.GroupAction.SubMulAction
{R : Type u} {M : Type v} [SMul R M] (p : SubMulAction R M) : SMul R β₯p - SubMulAction.instCompl π Mathlib.GroupTheory.GroupAction.SubMulAction
{R : Type u} {M : Type v} [Group R] [MulAction R M] : Compl (SubMulAction R M) - SubMulAction.mk π Mathlib.GroupTheory.GroupAction.SubMulAction
{R : Type u} {M : Type v} [SMul R M] (carrier : Set M) (smul_mem' : β (c : R) {x : M}, x β carrier β c β’ x β carrier) : SubMulAction R M - SubMulAction.copy_eq π Mathlib.GroupTheory.GroupAction.SubMulAction
{R : Type u} {M : Type v} [SMul R M] (p : SubMulAction R M) (s : Set M) (hs : s = βp) : p.copy s hs = p - fixedPointsSubMulOfNormal π Mathlib.GroupTheory.GroupAction.SubMulAction
{G : Type u_1} [Group G] {Ξ± : Type u_2} [MulAction G Ξ±] {H : Subgroup G} [hH : H.Normal] : SubMulAction G Ξ± - SubMulAction.mem_carrier π Mathlib.GroupTheory.GroupAction.SubMulAction
{R : Type u} {M : Type v} [SMul R M] {p : SubMulAction R M} {x : M} : x β p.carrier β x β βp - SubMulAction.subtype π Mathlib.GroupTheory.GroupAction.SubMulAction
{R : Type u} {M : Type v} [SMul R M] (p : SubMulAction R M) : β₯p ββ[id] M - SubMulAction.smul_mem' π Mathlib.GroupTheory.GroupAction.SubMulAction
{R : Type u} {M : Type v} [SMul R M] (self : SubMulAction R M) (c : R) {x : M} : x β self.carrier β c β’ x β self.carrier - SubMulAction.coe_copy π Mathlib.GroupTheory.GroupAction.SubMulAction
{R : Type u} {M : Type v} [SMul R M] (p : SubMulAction R M) (s : Set M) (hs : s = βp) : β(p.copy s hs) = s - Units.nonZeroSubMul π Mathlib.GroupTheory.GroupAction.SubMulAction
(R : Type u_1) (M : Type u_2) [Monoid R] [AddCommMonoid M] [DistribMulAction R M] : SubMulAction RΛ£ M - SubMulAction.smul_mem π Mathlib.GroupTheory.GroupAction.SubMulAction
{R : Type u} {M : Type v} [SMul R M] (p : SubMulAction R M) {x : M} (r : R) (h : x β p) : r β’ x β p - SubMulAction.ext π Mathlib.GroupTheory.GroupAction.SubMulAction
{R : Type u} {M : Type v} [SMul R M] {p q : SubMulAction R M} (h : β (x : M), x β p β x β q) : p = q - SubMulAction.ext_iff π Mathlib.GroupTheory.GroupAction.SubMulAction
{R : Type u} {M : Type v} [SMul R M] {p q : SubMulAction R M} : p = q β β (x : M), x β p β x β q - SubMulAction.mem_iInf π Mathlib.GroupTheory.GroupAction.SubMulAction
{R : Type u} {M : Type v} [SMul R M] {ΞΉ : Sort u_1} {p : ΞΉ β SubMulAction R M} {x : M} : x β β¨ i, p i β β (i : ΞΉ), x β p i - SubMulAction.mem_iSup π Mathlib.GroupTheory.GroupAction.SubMulAction
{R : Type u} {M : Type v} [SMul R M] {ΞΉ : Sort u_1} {p : ΞΉ β SubMulAction R M} {x : M} : x β β¨ i, p i β β i, x β p i - SubMulAction.mulAction π Mathlib.GroupTheory.GroupAction.SubMulAction
{R : Type u} {M : Type v} [Monoid R] [MulAction R M] (p : SubMulAction R M) : MulAction R β₯p - SubMulAction.smul' π Mathlib.GroupTheory.GroupAction.SubMulAction
{S : Type u'} {R : Type u} {M : Type v} [Monoid R] [MulAction R M] [SMul S R] [SMul S M] [IsScalarTower S R M] (p : SubMulAction R M) : SMul S β₯p - SubMulAction.mulAction' π Mathlib.GroupTheory.GroupAction.SubMulAction
{S : Type u'} {R : Type u} {M : Type v} [Monoid R] [MulAction R M] [Monoid S] [SMul S R] [MulAction S M] [IsScalarTower S R M] (p : SubMulAction R M) : MulAction S β₯p - SubMulAction.inclusion π Mathlib.GroupTheory.GroupAction.SubMulAction
{M : Type u_1} {Ξ± : Type u_2} [Monoid M] [MulAction M Ξ±] (s : SubMulAction M Ξ±) : β₯s ββ[id] Ξ± - SubMulAction.compl_def π Mathlib.GroupTheory.GroupAction.SubMulAction
{R : Type u} {M : Type v} [Group R] [MulAction R M] (s : SubMulAction R M) : sαΆ.carrier = (βs)αΆ - SubMulAction.isScalarTower π Mathlib.GroupTheory.GroupAction.SubMulAction
{S : Type u'} {R : Type u} {M : Type v} [Monoid R] [MulAction R M] [SMul S R] [SMul S M] [IsScalarTower S R M] (p : SubMulAction R M) : IsScalarTower S R β₯p - SubMulAction.subtype_injective π Mathlib.GroupTheory.GroupAction.SubMulAction
{R : Type u} {M : Type v} [SMul R M] (p : SubMulAction R M) : Function.Injective βp.subtype - SubMulAction.isCentralScalar π Mathlib.GroupTheory.GroupAction.SubMulAction
{S : Type u'} {R : Type u} {M : Type v} [Monoid R] [MulAction R M] [SMul S R] [SMul S M] [IsScalarTower S R M] (p : SubMulAction R M) [SMul Sα΅α΅α΅ R] [SMul Sα΅α΅α΅ M] [IsScalarTower Sα΅α΅α΅ R M] [IsCentralScalar S M] : IsCentralScalar S β₯p - SubMulAction.smul_of_tower_mem π Mathlib.GroupTheory.GroupAction.SubMulAction
{S : Type u'} {R : Type u} {M : Type v} [Monoid R] [MulAction R M] [SMul S R] [SMul S M] [IsScalarTower S R M] (p : SubMulAction R M) (s : S) {x : M} (h : x β p) : s β’ x β p - SubMulAction.isScalarTower' π Mathlib.GroupTheory.GroupAction.SubMulAction
{S : Type u'} {R : Type u} {M : Type v} [Monoid R] [MulAction R M] [SMul S R] [SMul S M] [IsScalarTower S R M] (p : SubMulAction R M) {S' : Type u_1} [SMul S' R] [SMul S' S] [SMul S' M] [IsScalarTower S' R M] [IsScalarTower S' S M] : IsScalarTower S' S β₯p - SubMulAction.val_smul π Mathlib.GroupTheory.GroupAction.SubMulAction
{R : Type u} {M : Type v} [SMul R M] {p : SubMulAction R M} (r : R) (x : β₯p) : β(r β’ x) = r β’ βx - SubMulAction.subtype_eq_val π Mathlib.GroupTheory.GroupAction.SubMulAction
{R : Type u} {M : Type v} [SMul R M] (p : SubMulAction R M) : βp.subtype = Subtype.val - SubMulAction.subtype_apply π Mathlib.GroupTheory.GroupAction.SubMulAction
{R : Type u} {M : Type v} [SMul R M] {p : SubMulAction R M} (x : β₯p) : p.subtype x = βx - SubMulAction.smul_mem_iff' π Mathlib.GroupTheory.GroupAction.SubMulAction
{R : Type u} {M : Type v} [Monoid R] [MulAction R M] (p : SubMulAction R M) {G : Type u_1} [Group G] [SMul G R] [MulAction G M] [IsScalarTower G R M] (g : G) {x : M} : g β’ x β p β x β p - SubMulAction.stabilizer_of_subMul.submonoid π Mathlib.GroupTheory.GroupAction.SubMulAction
{R : Type u} {M : Type v} [Monoid R] [MulAction R M] {p : SubMulAction R M} (m : β₯p) : MulAction.stabilizerSubmonoid R m = MulAction.stabilizerSubmonoid R βm - SubMulAction.smul_mem_iff π Mathlib.GroupTheory.GroupAction.SubMulAction
{S : Type u'} {R : Type u} {M : Type v} [GroupWithZero S] [Monoid R] [MulAction R M] [SMul S R] [MulAction S M] [IsScalarTower S R M] (p : SubMulAction R M) {s : S} {x : M} (s0 : s β 0) : s β’ x β p β x β p - SubMulAction.inclusion.toFun_eq_coe π Mathlib.GroupTheory.GroupAction.SubMulAction
{M : Type u_1} {Ξ± : Type u_2} [Monoid M] [MulAction M Ξ±] (s : SubMulAction M Ξ±) : s.inclusion.toFun = Subtype.val - SubMulAction.instNegSubtypeMem π Mathlib.GroupTheory.GroupAction.SubMulAction
{R : Type u} {M : Type v} [Ring R] [AddCommGroup M] [Module R M] (p : SubMulAction R M) : Neg β₯p - SubMulAction.zero_mem π Mathlib.GroupTheory.GroupAction.SubMulAction
{R : Type u} {M : Type v} [Semiring R] [AddCommMonoid M] [Module R M] (p : SubMulAction R M) (h : (βp).Nonempty) : 0 β p - SubMulAction.stabilizer_of_subMul π Mathlib.GroupTheory.GroupAction.SubMulAction
{R : Type u} {M : Type v} [Group R] [MulAction R M] {p : SubMulAction R M} (m : β₯p) : MulAction.stabilizer R m = MulAction.stabilizer R βm - SubMulAction.instZeroSubtypeMemOfNonempty π Mathlib.GroupTheory.GroupAction.SubMulAction
{R : Type u} {M : Type v} [Semiring R] [AddCommMonoid M] [Module R M] (p : SubMulAction R M) [n_empty : Nonempty β₯p] : Zero β₯p - SubMulAction.val_image_orbit π Mathlib.GroupTheory.GroupAction.SubMulAction
{R : Type u} {M : Type v} [Monoid R] [MulAction R M] {p : SubMulAction R M} (m : β₯p) : Subtype.val '' MulAction.orbit R m = MulAction.orbit R βm - SubMulAction.orbitRel_of_subMul π Mathlib.GroupTheory.GroupAction.SubMulAction
{R : Type u} {M : Type v} [Group R] [MulAction R M] (p : SubMulAction R M) : MulAction.orbitRel R β₯p = Setoid.comap Subtype.val (MulAction.orbitRel R M) - SubMulAction.val_smul_of_tower π Mathlib.GroupTheory.GroupAction.SubMulAction
{S : Type u'} {R : Type u} {M : Type v} [Monoid R] [MulAction R M] [SMul S R] [SMul S M] [IsScalarTower S R M] (p : SubMulAction R M) (s : S) (x : β₯p) : β(s β’ x) = s β’ βx - SubMulAction.val_preimage_orbit π Mathlib.GroupTheory.GroupAction.SubMulAction
{R : Type u} {M : Type v} [Monoid R] [MulAction R M] {p : SubMulAction R M} (m : β₯p) : Subtype.val β»ΒΉ' MulAction.orbit R βm = MulAction.orbit R m - SubMulAction.inclusion_injective π Mathlib.GroupTheory.GroupAction.SubMulAction
{M : Type u_1} {Ξ± : Type u_2} [Monoid M] [MulAction M Ξ±] (s : SubMulAction M Ξ±) : Function.Injective βs.inclusion - SubMulAction.image_inclusion π Mathlib.GroupTheory.GroupAction.SubMulAction
{M : Type u_1} {Ξ± : Type u_2} [Monoid M] [MulAction M Ξ±] (s : SubMulAction M Ξ±) : Set.range βs.inclusion = s.carrier - SubMulAction.neg_mem π Mathlib.GroupTheory.GroupAction.SubMulAction
{R : Type u} {M : Type v} [Ring R] [AddCommGroup M] [Module R M] (p : SubMulAction R M) {x : M} (hx : x β p) : -x β p - SubMulAction.neg_mem_iff π Mathlib.GroupTheory.GroupAction.SubMulAction
{R : Type u} {M : Type v} [Ring R] [AddCommGroup M] [Module R M] (p : SubMulAction R M) {x : M} : -x β p β x β p - SubMulAction.inclusion.coe_eq π Mathlib.GroupTheory.GroupAction.SubMulAction
{M : Type u_1} {Ξ± : Type u_2} [Monoid M] [MulAction M Ξ±] (s : SubMulAction M Ξ±) : βs.inclusion = Subtype.val - SubMulAction.mem_orbit_subMul_iff π Mathlib.GroupTheory.GroupAction.SubMulAction
{R : Type u} {M : Type v} [Monoid R] [MulAction R M] {p : SubMulAction R M} {x m : β₯p} : x β MulAction.orbit R m β βx β MulAction.orbit R βm - SubMulAction.val_neg π Mathlib.GroupTheory.GroupAction.SubMulAction
{R : Type u} {M : Type v} [Ring R] [AddCommGroup M] [Module R M] (p : SubMulAction R M) (x : β₯p) : β(-x) = -βx - Submodule.toSubMulAction π Mathlib.Algebra.Module.Submodule.Defs
{R : Type u} {M : Type v} [Semiring R] [AddCommMonoid M] [Module R M] (self : Submodule R M) : SubMulAction R M - Submodule.toSubMulAction_injective π Mathlib.Algebra.Module.Submodule.Defs
{R : Type u} {M : Type v} [Semiring R] [AddCommMonoid M] [Module R M] : Function.Injective Submodule.toSubMulAction - Submodule.toSubMulAction_inj π Mathlib.Algebra.Module.Submodule.Defs
{R : Type u} {M : Type v} [Semiring R] [AddCommMonoid M] [Module R M] {p q : Submodule R M} : p.toSubMulAction = q.toSubMulAction β p = q - Submodule.coe_toSubMulAction π Mathlib.Algebra.Module.Submodule.Defs
{R : Type u} {M : Type v} [Semiring R] [AddCommMonoid M] [Module R M] (p : Submodule R M) : βp.toSubMulAction = βp - Submodule.toSubMulAction_mono π Mathlib.Algebra.Module.Submodule.Basic
{R : Type u} {M : Type v} [Semiring R] [AddCommMonoid M] [Module R M] : Monotone Submodule.toSubMulAction - Submodule.toSubMulAction_strictMono π Mathlib.Algebra.Module.Submodule.Basic
{R : Type u} {M : Type v} [Semiring R] [AddCommMonoid M] [Module R M] : StrictMono Submodule.toSubMulAction - SubMulAction.instOne π Mathlib.GroupTheory.GroupAction.SubMulAction.Pointwise
{R : Type u_1} {M : Type u_2} [Monoid R] [MulAction R M] [One M] : One (SubMulAction R M) - SubMulAction.instMul π Mathlib.GroupTheory.GroupAction.SubMulAction.Pointwise
{R : Type u_1} {M : Type u_2} [Monoid R] [MulAction R M] [Mul M] [IsScalarTower R M M] : Mul (SubMulAction R M) - SubMulAction.instSemigroup π Mathlib.GroupTheory.GroupAction.SubMulAction.Pointwise
{R : Type u_1} {M : Type u_2} [Monoid R] [MulAction R M] [Semigroup M] [IsScalarTower R M M] : Semigroup (SubMulAction R M) - SubMulAction.instMulOneClass π Mathlib.GroupTheory.GroupAction.SubMulAction.Pointwise
{R : Type u_1} {M : Type u_2} [Monoid R] [MulAction R M] [MulOneClass M] [IsScalarTower R M M] [SMulCommClass R M M] : MulOneClass (SubMulAction R M) - SubMulAction.instMonoid π Mathlib.GroupTheory.GroupAction.SubMulAction.Pointwise
{R : Type u_1} {M : Type u_2} [Monoid R] [MulAction R M] [Monoid M] [IsScalarTower R M M] [SMulCommClass R M M] : Monoid (SubMulAction R M) - SubMulAction.subset_coe_one π Mathlib.GroupTheory.GroupAction.SubMulAction.Pointwise
{R : Type u_1} {M : Type u_2} [Monoid R] [MulAction R M] [One M] : 1 β β1 - SubMulAction.coe_one π Mathlib.GroupTheory.GroupAction.SubMulAction.Pointwise
{R : Type u_1} {M : Type u_2} [Monoid R] [MulAction R M] [One M] : β1 = Set.range fun r => r β’ 1 - SubMulAction.mem_one π Mathlib.GroupTheory.GroupAction.SubMulAction.Pointwise
{R : Type u_1} {M : Type u_2} [Monoid R] [MulAction R M] [One M] {x : M} : x β 1 β β r, r β’ 1 = x - SubMulAction.coe_mul π Mathlib.GroupTheory.GroupAction.SubMulAction.Pointwise
{R : Type u_1} {M : Type u_2} [Monoid R] [MulAction R M] [Mul M] [IsScalarTower R M M] (p q : SubMulAction R M) : β(p * q) = βp * βq - SubMulAction.subset_coe_pow π Mathlib.GroupTheory.GroupAction.SubMulAction.Pointwise
{R : Type u_1} {M : Type u_2} [Monoid R] [MulAction R M] [Monoid M] [IsScalarTower R M M] [SMulCommClass R M M] (p : SubMulAction R M) {n : β} : βp ^ n β β(p ^ n) - SubMulAction.coe_pow π Mathlib.GroupTheory.GroupAction.SubMulAction.Pointwise
{R : Type u_1} {M : Type u_2} [Monoid R] [MulAction R M] [Monoid M] [IsScalarTower R M M] [SMulCommClass R M M] (p : SubMulAction R M) {n : β} : n β 0 β β(p ^ n) = βp ^ n - SubMulAction.mem_mul π Mathlib.GroupTheory.GroupAction.SubMulAction.Pointwise
{R : Type u_1} {M : Type u_2} [Monoid R] [MulAction R M] [Mul M] [IsScalarTower R M M] {p q : SubMulAction R M} {x : M} : x β p * q β β y β p, β z β q, y * z = x - SubMulAction.algebraMap_mem π Mathlib.Algebra.Algebra.Operations
{R : Type u} {A : Type v} [CommSemiring R] [Semiring A] [Algebra R A] (r : R) : (algebraMap R A) r β 1 - SubMulAction.mem_one' π Mathlib.Algebra.Algebra.Operations
{R : Type u} {A : Type v} [CommSemiring R] [Semiring A] [Algebra R A] {x : A} : x β 1 β β y, (algebraMap R A) y = x - Submodule.toSubMulAction_one π Mathlib.Algebra.Algebra.Operations
{R : Type u} [Semiring R] {A : Type v} [Semiring A] [Module R A] : Submodule.toSubMulAction 1 = 1 - MultilinearMap.range π Mathlib.LinearAlgebra.Multilinear.Basic
{R : Type uR} {ΞΉ : Type uΞΉ} {Mβ : ΞΉ β Type vβ} {Mβ : Type vβ} [Ring R] [(i : ΞΉ) β AddCommMonoid (Mβ i)] [AddCommMonoid Mβ] [(i : ΞΉ) β Module R (Mβ i)] [Module R Mβ] [Nonempty ΞΉ] (f : MultilinearMap R Mβ Mβ) : SubMulAction R Mβ - MultilinearMap.map π Mathlib.LinearAlgebra.Multilinear.Basic
{R : Type uR} {ΞΉ : Type uΞΉ} {Mβ : ΞΉ β Type vβ} {Mβ : Type vβ} [Ring R] [(i : ΞΉ) β AddCommMonoid (Mβ i)] [AddCommMonoid Mβ] [(i : ΞΉ) β Module R (Mβ i)] [Module R Mβ] [Nonempty ΞΉ] (f : MultilinearMap R Mβ Mβ) (p : (i : ΞΉ) β Submodule R (Mβ i)) : SubMulAction R Mβ - MultilinearMap.map_nonempty π Mathlib.LinearAlgebra.Multilinear.Basic
{R : Type uR} {ΞΉ : Type uΞΉ} {Mβ : ΞΉ β Type vβ} {Mβ : Type vβ} [Ring R] [(i : ΞΉ) β AddCommMonoid (Mβ i)] [AddCommMonoid Mβ] [(i : ΞΉ) β Module R (Mβ i)] [Module R Mβ] [Nonempty ΞΉ] (f : MultilinearMap R Mβ Mβ) (p : (i : ΞΉ) β Submodule R (Mβ i)) : (β(f.map p)).Nonempty - SubMulAction.FG π Mathlib.GroupTheory.GroupAction.SubMulAction.Closure
{R : Type u_1} {M : Type u_2} [SMul R M] (p : SubMulAction R M) : Prop - SubMulAction.closure π Mathlib.GroupTheory.GroupAction.SubMulAction.Closure
(R : Type u_1) {M : Type u_2} [SMul R M] (s : Set M) : SubMulAction R M - SubMulAction.subset_closure π Mathlib.GroupTheory.GroupAction.SubMulAction.Closure
{R : Type u_1} {M : Type u_2} [SMul R M] {s : Set M} : s β β(SubMulAction.closure R s) - SubMulAction.fg_iff π Mathlib.GroupTheory.GroupAction.SubMulAction.Closure
{R : Type u_1} {M : Type u_2} [SMul R M] {p : SubMulAction R M} : p.FG β β s, p = SubMulAction.closure R βs - SubMulAction.mem_closure_of_mem π Mathlib.GroupTheory.GroupAction.SubMulAction.Closure
{R : Type u_1} {M : Type u_2} [SMul R M] {s : Set M} {x : M} (hx : x β s) : x β SubMulAction.closure R s - SubMulAction.closure_mono π Mathlib.GroupTheory.GroupAction.SubMulAction.Closure
{R : Type u_1} {M : Type u_2} [SMul R M] {s t : Set M} (h : s β t) : SubMulAction.closure R s β€ SubMulAction.closure R t - SubMulAction.closure_le π Mathlib.GroupTheory.GroupAction.SubMulAction.Closure
{R : Type u_1} {M : Type u_2} [SMul R M] {s : Set M} {p : SubMulAction R M} : SubMulAction.closure R s β€ p β s β βp - SubMulAction.mem_closure π Mathlib.GroupTheory.GroupAction.SubMulAction.Closure
{R : Type u_1} {M : Type u_2} [SMul R M] {s : Set M} {x : M} : x β SubMulAction.closure R s β β (p : SubMulAction R M), s β βp β x β p - StrongDual.polarSubmodule_eq_polar π Mathlib.Analysis.LocallyConvex.Polar
(π : Type u_4) [NontriviallyNormedField π] {E : Type u_5} [AddCommMonoid E] [TopologicalSpace E] [Module π E] (m : SubMulAction π E) : β(StrongDual.polarSubmodule π m) = StrongDual.polar π βm - IsQuotientCoveringMap.toPermFiber_apply_apply_coe π Mathlib.Topology.Covering.Quotient
{E : Type u_1} {X : Type u_2} [TopologicalSpace E] [TopologicalSpace X] {f : E β X} {G : Type u_3} [Group G] [MulAction G E] (hf : IsQuotientCoveringMap f G) (x : X) (a : G) (xβ : β(f β»ΒΉ' {x})) : β(((hf.toPermFiber x) a) xβ) = a β’ βxβ - IsQuotientCoveringMap.toPermFiber_apply_symm_apply_coe π Mathlib.Topology.Covering.Quotient
{E : Type u_1} {X : Type u_2} [TopologicalSpace E] [TopologicalSpace X] {f : E β X} {G : Type u_3} [Group G] [MulAction G E] (hf : IsQuotientCoveringMap f G) (x : X) (a : G) (xβ : β(f β»ΒΉ' {x})) : β((Equiv.symm ((hf.toPermFiber x) a)) xβ) = aβ»ΒΉ β’ βxβ - MulAction.IsBlock.subtype_val_preimage π Mathlib.GroupTheory.GroupAction.Blocks
{G : Type u_1} [Group G] {X : Type u_2} [MulAction G X] {B : Set X} {C : SubMulAction G X} (hB : MulAction.IsBlock G B) : MulAction.IsBlock G (Subtype.val β»ΒΉ' B) - MulAction.isBlock_subtypeVal π Mathlib.GroupTheory.GroupAction.Blocks
{G : Type u_1} [Group G] {X : Type u_2} [MulAction G X] {C : SubMulAction G X} {B : Set β₯C} : MulAction.IsBlock G (Subtype.val '' B) β MulAction.IsBlock G B - SubMulAction.ofStabilizer π Mathlib.GroupTheory.GroupAction.SubMulAction.OfStabilizer
(G : Type u_1) [Group G] {Ξ± : Type u_2} [MulAction G Ξ±] (a : Ξ±) : SubMulAction (β₯(MulAction.stabilizer G a)) Ξ± - SubMulAction.mem_ofStabilizer_iff π Mathlib.GroupTheory.GroupAction.SubMulAction.OfStabilizer
(G : Type u_1) [Group G] {Ξ± : Type u_2} [MulAction G Ξ±] (a : Ξ±) {x : Ξ±} : x β SubMulAction.ofStabilizer G a β x β a - SubMulAction.ofStabilizer.snoc π Mathlib.GroupTheory.GroupAction.SubMulAction.OfStabilizer
{G : Type u_1} [Group G] {Ξ± : Type u_2} [MulAction G Ξ±] {a : Ξ±} {n : β} (x : Fin n βͺ β₯(SubMulAction.ofStabilizer G a)) : Fin n.succ βͺ Ξ± - SubMulAction.ENat_card_ofStabilizer_add_one_eq π Mathlib.GroupTheory.GroupAction.SubMulAction.OfStabilizer
(G : Type u_1) [Group G] {Ξ± : Type u_2} [MulAction G Ξ±] (a : Ξ±) : ENat.card β₯(SubMulAction.ofStabilizer G a) + 1 = ENat.card Ξ± - SubMulAction.nat_card_ofStabilizer_add_one_eq π Mathlib.GroupTheory.GroupAction.SubMulAction.OfStabilizer
(G : Type u_1) [Group G] {Ξ± : Type u_2} [MulAction G Ξ±] [Finite Ξ±] (a : Ξ±) : Nat.card β₯(SubMulAction.ofStabilizer G a) + 1 = Nat.card Ξ± - SubMulAction.nat_card_ofStabilizer_eq π Mathlib.GroupTheory.GroupAction.SubMulAction.OfStabilizer
(G : Type u_1) [Group G] {Ξ± : Type u_2} [MulAction G Ξ±] [Finite Ξ±] (a : Ξ±) : Nat.card β₯(SubMulAction.ofStabilizer G a) = Nat.card Ξ± - 1 - SubMulAction.ofStabilizer.snoc_last π Mathlib.GroupTheory.GroupAction.SubMulAction.OfStabilizer
{G : Type u_1} [Group G] {Ξ± : Type u_2} [MulAction G Ξ±] {a : Ξ±} {n : β} (x : Fin n βͺ β₯(SubMulAction.ofStabilizer G a)) : (SubMulAction.ofStabilizer.snoc x) (Fin.last n) = a - SubMulAction.neq_of_mem_ofStabilizer π Mathlib.GroupTheory.GroupAction.SubMulAction.OfStabilizer
(G : Type u_1) [Group G] {Ξ± : Type u_2} [MulAction G Ξ±] (a : Ξ±) {x : β₯(SubMulAction.ofStabilizer G a)} : βx β a - SubMulAction.exists_smul_of_last_eq π Mathlib.GroupTheory.GroupAction.SubMulAction.OfStabilizer
(G : Type u_1) [Group G] {Ξ± : Type u_2} [MulAction G Ξ±] [MulAction.IsPretransitive G Ξ±] {n : β} (a : Ξ±) (x : Fin n.succ βͺ Ξ±) : β g y, g β’ x = SubMulAction.ofStabilizer.snoc y - SubMulAction.notMem_val_image π Mathlib.GroupTheory.GroupAction.SubMulAction.OfStabilizer
(G : Type u_1) [Group G] {Ξ± : Type u_2} [MulAction G Ξ±] {a : Ξ±} (t : Set β₯(SubMulAction.ofStabilizer G a)) : a β Subtype.val '' t - SubMulAction.ofStabilizer.conjMap π Mathlib.GroupTheory.GroupAction.SubMulAction.OfStabilizer
{G : Type u_1} [Group G] {Ξ± : Type u_2} [MulAction G Ξ±] {g : G} {a b : Ξ±} (hg : b = g β’ a) : β₯(SubMulAction.ofStabilizer G a) ββ[β(MulAction.stabilizerEquivStabilizer hg)] β₯(SubMulAction.ofStabilizer G b) - SubMulAction.ofStabilizer.snoc_castSucc π Mathlib.GroupTheory.GroupAction.SubMulAction.OfStabilizer
{G : Type u_1} [Group G] {Ξ± : Type u_2} [MulAction G Ξ±] {a : Ξ±} {n : β} (x : Fin n βͺ β₯(SubMulAction.ofStabilizer G a)) (i : Fin n) : (SubMulAction.ofStabilizer.snoc x) i.castSucc = β(x i) - SubMulAction.ofStabilizer.conjMap_comp π Mathlib.GroupTheory.GroupAction.SubMulAction.OfStabilizer
{G : Type u_1} [Group G] {Ξ± : Type u_2} [MulAction G Ξ±] {g h k : G} {a b c : Ξ±} (hg : b = g β’ a) (hh : c = h β’ b) (hk : c = k β’ a) (H : k = h * g) : (SubMulAction.ofStabilizer.conjMap hh).comp (SubMulAction.ofStabilizer.conjMap hg) = SubMulAction.ofStabilizer.conjMap hk - SubMulAction.ofStabilizer.conjMap_bijective π Mathlib.GroupTheory.GroupAction.SubMulAction.OfStabilizer
{G : Type u_1} [Group G] {Ξ± : Type u_2} [MulAction G Ξ±] {g : G} {a b : Ξ±} (hg : b = g β’ a) : Function.Bijective β(SubMulAction.ofStabilizer.conjMap hg) - SubMulAction.ofStabilizer.conjMap_apply π Mathlib.GroupTheory.GroupAction.SubMulAction.OfStabilizer
{G : Type u_1} [Group G] {Ξ± : Type u_2} [MulAction G Ξ±] {g : G} {a b : Ξ±} (hg : b = g β’ a) (x : β₯(SubMulAction.ofStabilizer G a)) : β((SubMulAction.ofStabilizer.conjMap hg) x) = g β’ βx - SubMulAction.ofStabilizer.conjMap_comp_inv_apply π Mathlib.GroupTheory.GroupAction.SubMulAction.OfStabilizer
{G : Type u_1} [Group G] {Ξ± : Type u_2} [MulAction G Ξ±] {g : G} {a b : Ξ±} (hg : b = g β’ a) (x : β₯(SubMulAction.ofStabilizer G a)) : (SubMulAction.ofStabilizer.conjMap β―) ((SubMulAction.ofStabilizer.conjMap hg) x) = x - SubMulAction.ofStabilizer.inv_conjMap_comp_apply π Mathlib.GroupTheory.GroupAction.SubMulAction.OfStabilizer
{G : Type u_1} [Group G] {Ξ± : Type u_2} [MulAction G Ξ±] {g : G} {a b : Ξ±} (hg : b = g β’ a) (x : β₯(SubMulAction.ofStabilizer G b)) : (SubMulAction.ofStabilizer.conjMap hg) ((SubMulAction.ofStabilizer.conjMap β―) x) = x - SubMulAction.ofStabilizer.conjMap_comp_apply π Mathlib.GroupTheory.GroupAction.SubMulAction.OfStabilizer
{G : Type u_1} [Group G] {Ξ± : Type u_2} [MulAction G Ξ±] {g h k : G} {a b c : Ξ±} {hg : b = g β’ a} {hh : c = h β’ b} {hk : c = k β’ a} (H : k = h * g) (x : β₯(SubMulAction.ofStabilizer G a)) : (SubMulAction.ofStabilizer.conjMap hh) ((SubMulAction.ofStabilizer.conjMap hg) x) = (SubMulAction.ofStabilizer.conjMap hk) x - SubMulAction.ofFixingSubgroup π Mathlib.GroupTheory.GroupAction.SubMulAction.OfFixingSubgroup
(M : Type u_1) {Ξ± : Type u_2} [Group M] [MulAction M Ξ±] (s : Set Ξ±) : SubMulAction (β₯(fixingSubgroup M s)) Ξ± - SubMulAction.mem_ofFixingSubgroup_iff π Mathlib.GroupTheory.GroupAction.SubMulAction.OfFixingSubgroup
(M : Type u_1) {Ξ± : Type u_2} [Group M] [MulAction M Ξ±] {s : Set Ξ±} {x : Ξ±} : x β SubMulAction.ofFixingSubgroup M s β x β s - SubMulAction.ofFixingSubgroup.append π Mathlib.GroupTheory.GroupAction.SubMulAction.OfFixingSubgroup
{M : Type u_1} {Ξ± : Type u_2} [Group M] [MulAction M Ξ±] {s : Set Ξ±} {n : β} [Finite βs] (x : Fin n βͺ β₯(SubMulAction.ofFixingSubgroup M s)) : Fin (s.ncard + n) βͺ Ξ± - SubMulAction.ofFixingSubgroup.append_left π Mathlib.GroupTheory.GroupAction.SubMulAction.OfFixingSubgroup
{M : Type u_1} {Ξ± : Type u_2} [Group M] [MulAction M Ξ±] {s : Set Ξ±} {n : β} [Finite βs] (x : Fin n βͺ β₯(SubMulAction.ofFixingSubgroup M s)) (i : Fin s.ncard) : have Hs := β―; (SubMulAction.ofFixingSubgroup.append x) (Fin.castAdd n i) = β((Classical.choice Hs) i) - SubMulAction.not_mem_of_mem_ofFixingSubgroup π Mathlib.GroupTheory.GroupAction.SubMulAction.OfFixingSubgroup
{M : Type u_1} {Ξ± : Type u_2} [Group M] [MulAction M Ξ±] {s : Set Ξ±} (x : β₯(SubMulAction.ofFixingSubgroup M s)) : βx β s - SubMulAction.ofFixingSubgroup_equivariantMap π Mathlib.GroupTheory.GroupAction.SubMulAction.OfFixingSubgroup
(M : Type u_1) {Ξ± : Type u_2} [Group M] [MulAction M Ξ±] (s : Set Ξ±) : β₯(SubMulAction.ofFixingSubgroup M s) ββ[β(fixingSubgroup M s).subtype] Ξ± - SubMulAction.disjoint_val_image π Mathlib.GroupTheory.GroupAction.SubMulAction.OfFixingSubgroup
{M : Type u_1} {Ξ± : Type u_2} [Group M] [MulAction M Ξ±] {s : Set Ξ±} {t : Set β₯(SubMulAction.ofFixingSubgroup M s)} : Disjoint s (Subtype.val '' t) - SubMulAction.conjMap_ofFixingSubgroup π Mathlib.GroupTheory.GroupAction.SubMulAction.OfFixingSubgroup
{M : Type u_1} {Ξ± : Type u_2} [Group M] [MulAction M Ξ±] {s t : Set Ξ±} {g : M} (hg : g β’ t = s) : β₯(SubMulAction.ofFixingSubgroup M t) ββ[β(SubMulAction.fixingSubgroupEquivFixingSubgroup hg)] β₯(SubMulAction.ofFixingSubgroup M s) - SubMulAction.ofFixingSubgroup_of_eq π Mathlib.GroupTheory.GroupAction.SubMulAction.OfFixingSubgroup
(M : Type u_1) {Ξ± : Type u_2} [Group M] [MulAction M Ξ±] {s t : Set Ξ±} (hst : s = t) : have Ο := MulEquiv.subgroupCongr β―; β₯(SubMulAction.ofFixingSubgroup M s) ββ[βΟ] β₯(SubMulAction.ofFixingSubgroup M t) - SubMulAction.ofFixingSubgroup_of_inclusion π Mathlib.GroupTheory.GroupAction.SubMulAction.OfFixingSubgroup
(M : Type u_1) {Ξ± : Type u_2} [Group M] [MulAction M Ξ±] {s t : Set Ξ±} (hst : t β s) : β₯(SubMulAction.ofFixingSubgroup M s) ββ[β(Subgroup.inclusion β―)] β₯(SubMulAction.ofFixingSubgroup M t) - SubMulAction.ofFixingSubgroup_of_singleton π Mathlib.GroupTheory.GroupAction.SubMulAction.OfFixingSubgroup
(M : Type u_1) {Ξ± : Type u_2} [Group M] [MulAction M Ξ±] (a : Ξ±) : have Ο := fun x => match x with | β¨m, hmβ© => β¨m, β―β©; β₯(SubMulAction.ofFixingSubgroup M {a}) ββ[Ο] β₯(SubMulAction.ofStabilizer M a) - SubMulAction.ofFixingSubgroup.append_right π Mathlib.GroupTheory.GroupAction.SubMulAction.OfFixingSubgroup
{M : Type u_1} {Ξ± : Type u_2} [Group M] [MulAction M Ξ±] {s : Set Ξ±} {n : β} [Finite βs] (x : Fin n βͺ β₯(SubMulAction.ofFixingSubgroup M s)) (i : Fin n) : (SubMulAction.ofFixingSubgroup.append x) (Fin.natAdd s.ncard i) = β(x i) - SubMulAction.fixingSubgroup_of_insert π Mathlib.GroupTheory.GroupAction.SubMulAction.OfFixingSubgroup
{M : Type u_1} {Ξ± : Type u_2} [Group M] [MulAction M Ξ±] (a : Ξ±) (s : Set β₯(SubMulAction.ofStabilizer M a)) : fixingSubgroup M (insert a ((fun x => βx) '' s)) = Subgroup.map (MulAction.stabilizer M a).subtype (fixingSubgroup (β₯(MulAction.stabilizer M a)) s) - SubMulAction.IsPretransitive.isPretransitive_ofFixingSubgroup_inter π Mathlib.GroupTheory.GroupAction.SubMulAction.OfFixingSubgroup
{M : Type u_1} {Ξ± : Type u_2} [Group M] [MulAction M Ξ±] {s : Set Ξ±} (hs : MulAction.IsPretransitive β₯(fixingSubgroup M s) β₯(SubMulAction.ofFixingSubgroup M s)) {g : M} (ha : s βͺ g β’ s β β€) : MulAction.IsPretransitive β₯(fixingSubgroup M (s β© g β’ s)) β₯(SubMulAction.ofFixingSubgroup M (s β© g β’ s)) - SubMulAction.IsPreprimitive.isPreprimitive_ofFixingSubgroup_inter π Mathlib.GroupTheory.GroupAction.SubMulAction.OfFixingSubgroup
{M : Type u_1} {Ξ± : Type u_2} [Group M] [MulAction M Ξ±] {s : Set Ξ±} [Finite Ξ±] (hs : MulAction.IsPreprimitive β₯(fixingSubgroup M s) β₯(SubMulAction.ofFixingSubgroup M s)) {g : M} (ha : s βͺ g β’ s β β€) : MulAction.IsPreprimitive β₯(fixingSubgroup M (s β© g β’ s)) β₯(SubMulAction.ofFixingSubgroup M (s β© g β’ s)) - SubMulAction.ofFixingSubgroup_equivariantMap_injective π Mathlib.GroupTheory.GroupAction.SubMulAction.OfFixingSubgroup
{M : Type u_1} {Ξ± : Type u_2} [Group M] [MulAction M Ξ±] {s : Set Ξ±} : Function.Injective β(SubMulAction.ofFixingSubgroup_equivariantMap M s) - SubMulAction.fixingSubgroupInsertEquiv π Mathlib.GroupTheory.GroupAction.SubMulAction.OfFixingSubgroup
{M : Type u_1} {Ξ± : Type u_2} [Group M] [MulAction M Ξ±] (a : Ξ±) (s : Set β₯(SubMulAction.ofStabilizer M a)) : β₯(fixingSubgroup M (insert a (Subtype.val '' s))) β* β₯(fixingSubgroup (β₯(MulAction.stabilizer M a)) s) - SubMulAction.ofFixingSubgroupEmpty_equivariantMap_bijective π Mathlib.GroupTheory.GroupAction.SubMulAction.OfFixingSubgroup
{M : Type u_1} {Ξ± : Type u_2} [Group M] [MulAction M Ξ±] : Function.Bijective β(SubMulAction.ofFixingSubgroup_equivariantMap M β ) - SubMulAction.conjMap_ofFixingSubgroup_bijective π Mathlib.GroupTheory.GroupAction.SubMulAction.OfFixingSubgroup
{M : Type u_1} {Ξ± : Type u_2} [Group M] [MulAction M Ξ±] {s t : Set Ξ±} {g : M} {hst : g β’ s = t} : Function.Bijective β(SubMulAction.conjMap_ofFixingSubgroup hst) - SubMulAction.ofFixingSubgroup_of_eq_bijective π Mathlib.GroupTheory.GroupAction.SubMulAction.OfFixingSubgroup
{M : Type u_1} {Ξ± : Type u_2} [Group M] [MulAction M Ξ±] {s t : Set Ξ±} {hst : s = t} : Function.Bijective β(SubMulAction.ofFixingSubgroup_of_eq M hst) - SubMulAction.ofFixingSubgroup_of_inclusion_injective π Mathlib.GroupTheory.GroupAction.SubMulAction.OfFixingSubgroup
{M : Type u_1} {Ξ± : Type u_2} [Group M] [MulAction M Ξ±] {s t : Set Ξ±} {hst : t β s} : Function.Injective β(SubMulAction.ofFixingSubgroup_of_inclusion M hst) - SubMulAction.conjMap_ofFixingSubgroup_coe_apply π Mathlib.GroupTheory.GroupAction.SubMulAction.OfFixingSubgroup
{M : Type u_1} {Ξ± : Type u_2} [Group M] [MulAction M Ξ±] {s t : Set Ξ±} {g : M} {hg : g β’ t = s} (x : β₯(SubMulAction.ofFixingSubgroup M t)) : β((SubMulAction.conjMap_ofFixingSubgroup hg) x) = g β’ βx - SubMulAction.ofFixingSubgroup_of_eq_apply π Mathlib.GroupTheory.GroupAction.SubMulAction.OfFixingSubgroup
{M : Type u_1} {Ξ± : Type u_2} [Group M] [MulAction M Ξ±] {s t : Set Ξ±} {hst : s = t} (x : β₯(SubMulAction.ofFixingSubgroup M s)) : β((SubMulAction.ofFixingSubgroup_of_eq M hst) x) = βx - SubMulAction.ofFixingSubgroup_of_singleton_bijective π Mathlib.GroupTheory.GroupAction.SubMulAction.OfFixingSubgroup
{M : Type u_1} {Ξ± : Type u_2} [Group M] [MulAction M Ξ±] {a : Ξ±} : Function.Bijective β(SubMulAction.ofFixingSubgroup_of_singleton M a) - SubMulAction.fixingSubgroup_union_to_fixingSubgroup_of_fixingSubgroup π Mathlib.GroupTheory.GroupAction.SubMulAction.OfFixingSubgroup
{M : Type u_1} {Ξ± : Type u_2} [Group M] [MulAction M Ξ±] {s t : Set Ξ±} : β₯(fixingSubgroup M (s βͺ t)) β* β₯(fixingSubgroup (β₯(fixingSubgroup M s)) (Subtype.val β»ΒΉ' t)) - SubMulAction.mem_ofFixingSubgroup_insert_iff π Mathlib.GroupTheory.GroupAction.SubMulAction.OfFixingSubgroup
{M : Type u_1} {Ξ± : Type u_2} [Group M] [MulAction M Ξ±] {a : Ξ±} {s : Set β₯(SubMulAction.ofStabilizer M a)} {x : Ξ±} : x β SubMulAction.ofFixingSubgroup M (insert a ((fun x => βx) '' s)) β β (hx : x β SubMulAction.ofStabilizer M a), β¨x, hxβ© β SubMulAction.ofFixingSubgroup (β₯(MulAction.stabilizer M a)) s - SubMulAction.ofFixingSubgroup_insert_map π Mathlib.GroupTheory.GroupAction.SubMulAction.OfFixingSubgroup
{M : Type u_1} {Ξ± : Type u_2} [Group M] [MulAction M Ξ±] (a : Ξ±) (s : Set β₯(SubMulAction.ofStabilizer M a)) : β₯(SubMulAction.ofFixingSubgroup M (insert a (Subtype.val '' s))) ββ[β(SubMulAction.fixingSubgroupInsertEquiv a s)] β₯(SubMulAction.ofFixingSubgroup (β₯(MulAction.stabilizer M a)) s) - SubMulAction.map_ofFixingSubgroupUnion π Mathlib.GroupTheory.GroupAction.SubMulAction.OfFixingSubgroup
(M : Type u_1) {Ξ± : Type u_2} [Group M] [MulAction M Ξ±] (s t : Set Ξ±) : have Ο := fun m => β¨β¨βm, β―β©, β―β©; β₯(SubMulAction.ofFixingSubgroup M (s βͺ t)) ββ[Ο] β₯(SubMulAction.ofFixingSubgroup (β₯(fixingSubgroup M s)) (Subtype.val β»ΒΉ' t)) - SubMulAction.ofFixingSubgroup_insert_map_bijective π Mathlib.GroupTheory.GroupAction.SubMulAction.OfFixingSubgroup
{M : Type u_1} {Ξ± : Type u_2} [Group M] [MulAction M Ξ±] {a : Ξ±} {s : Set β₯(SubMulAction.ofStabilizer M a)} : Function.Bijective β(SubMulAction.ofFixingSubgroup_insert_map a s) - SubMulAction.ofFixingSubgroup_insert_map_apply π Mathlib.GroupTheory.GroupAction.SubMulAction.OfFixingSubgroup
{M : Type u_1} {Ξ± : Type u_2} [Group M] [MulAction M Ξ±] {a : Ξ±} {s : Set β₯(SubMulAction.ofStabilizer M a)} {x : Ξ±} (hx : x β SubMulAction.ofFixingSubgroup M (insert a (Subtype.val '' s))) : ββ((SubMulAction.ofFixingSubgroup_insert_map a s) β¨x, hxβ©) = x - SubMulAction.map_ofFixingSubgroupUnion_bijective π Mathlib.GroupTheory.GroupAction.SubMulAction.OfFixingSubgroup
{M : Type u_1} {Ξ± : Type u_2} [Group M] [MulAction M Ξ±] {s t : Set Ξ±} : Function.Bijective β(SubMulAction.map_ofFixingSubgroupUnion M s t) - SubMulAction.map_ofFixingSubgroupUnion_def π Mathlib.GroupTheory.GroupAction.SubMulAction.OfFixingSubgroup
{M : Type u_1} {Ξ± : Type u_2} [Group M] [MulAction M Ξ±] {s t : Set Ξ±} (x : β₯(SubMulAction.ofFixingSubgroup M (s βͺ t))) : ββ((SubMulAction.map_ofFixingSubgroupUnion M s t) x) = βx - SubMulAction.ofFixingSubgroup.isMultiplyPretransitive π Mathlib.GroupTheory.GroupAction.MultipleTransitivity
(G : Type u_1) {Ξ± : Type u_2} [Group G] [MulAction G Ξ±] {m n : β} [Hn : MulAction.IsMultiplyPretransitive G Ξ± n] (s : Set Ξ±) [Finite βs] (hmn : s.ncard + m = n) : MulAction.IsMultiplyPretransitive (β₯(fixingSubgroup G s)) (β₯(SubMulAction.ofFixingSubgroup G s)) m - SubMulAction.ofStabilizer.isMultiplyPretransitive π Mathlib.GroupTheory.GroupAction.MultipleTransitivity
{G : Type u_1} {Ξ± : Type u_2} [Group G] [MulAction G Ξ±] [MulAction.IsPretransitive G Ξ±] {n : β} {a : Ξ±} : MulAction.IsMultiplyPretransitive G Ξ± n.succ β MulAction.IsMultiplyPretransitive (β₯(MulAction.stabilizer G a)) (β₯(SubMulAction.ofStabilizer G a)) n - SubMulAction.ofFixingSubgroup.isMultiplyPretransitive' π Mathlib.GroupTheory.GroupAction.MultipleTransitivity
{G : Type u_1} {Ξ± : Type u_2} [Group G] [MulAction G Ξ±] {m n : β} [MulAction.IsMultiplyPretransitive G Ξ± n] (s : Set Ξ±) [Finite βs] (hmn : s.ncard + m β€ n) (hn : βn β€ ENat.card Ξ±) : MulAction.IsMultiplyPretransitive (β₯(fixingSubgroup G s)) (β₯(SubMulAction.ofFixingSubgroup G s)) m - SubMulAction.ofStabilizer.isMultiplyPretransitive_iff π Mathlib.GroupTheory.GroupAction.MultipleTransitivity
{G : Type u_1} {Ξ± : Type u_2} [Group G] [MulAction G Ξ±] [MulAction.IsPretransitive G Ξ±] {n : β} {a b : Ξ±} : MulAction.IsMultiplyPretransitive (β₯(MulAction.stabilizer G a)) (β₯(SubMulAction.ofStabilizer G a)) n β MulAction.IsMultiplyPretransitive (β₯(MulAction.stabilizer G b)) (β₯(SubMulAction.ofStabilizer G b)) n - SubMulAction.ofStabilizer.isMultiplyPretransitive_iff_of_conj π Mathlib.GroupTheory.GroupAction.MultipleTransitivity
{G : Type u_1} {Ξ± : Type u_2} [Group G] [MulAction G Ξ±] {n : β} {a b : Ξ±} {g : G} (hg : b = g β’ a) : MulAction.IsMultiplyPretransitive (β₯(MulAction.stabilizer G a)) (β₯(SubMulAction.ofStabilizer G a)) n β MulAction.IsMultiplyPretransitive (β₯(MulAction.stabilizer G b)) (β₯(SubMulAction.ofStabilizer G b)) n - SubMulAction.ofStabilizer.isPretransitive_iff π Mathlib.GroupTheory.GroupAction.MultipleTransitivity
{G : Type u_1} {Ξ± : Type u_2} [Group G] [MulAction G Ξ±] [MulAction.IsPretransitive G Ξ±] {a b : Ξ±} : MulAction.IsPretransitive β₯(MulAction.stabilizer G a) β₯(SubMulAction.ofStabilizer G a) β MulAction.IsPretransitive β₯(MulAction.stabilizer G b) β₯(SubMulAction.ofStabilizer G b) - SubMulAction.ofStabilizer.isPretransitive_iff_of_conj π Mathlib.GroupTheory.GroupAction.MultipleTransitivity
{G : Type u_1} {Ξ± : Type u_2} [Group G] [MulAction G Ξ±] {a b : Ξ±} {g : G} (hg : b = g β’ a) : MulAction.IsPretransitive β₯(MulAction.stabilizer G a) β₯(SubMulAction.ofStabilizer G a) β MulAction.IsPretransitive β₯(MulAction.stabilizer G b) β₯(SubMulAction.ofStabilizer G b) - MulAction.ofFixingSubgroup.isMultiplyPreprimitive π Mathlib.GroupTheory.GroupAction.MultiplePrimitivity
(M : Type u_1) (Ξ± : Type u_2) [Group M] [MulAction M Ξ±] {m n : β} [MulAction.IsMultiplyPreprimitive M Ξ± n] {s : Set Ξ±} [Finite βs] (hs : s.ncard + m = n) : MulAction.IsMultiplyPreprimitive (β₯(fixingSubgroup M s)) (β₯(SubMulAction.ofFixingSubgroup M s)) m - MulAction.isMultiplyPreprimitive_ofStabilizer π Mathlib.GroupTheory.GroupAction.MultiplePrimitivity
(M : Type u_1) (Ξ± : Type u_2) [Group M] [MulAction M Ξ±] [MulAction.IsPretransitive M Ξ±] {n : β} {a : Ξ±} [MulAction.IsMultiplyPreprimitive M Ξ± n.succ] : MulAction.IsMultiplyPreprimitive (β₯(MulAction.stabilizer M a)) (β₯(SubMulAction.ofStabilizer M a)) n - MulAction.isMultiplyPreprimitive_succ_iff_ofStabilizer π Mathlib.GroupTheory.GroupAction.MultiplePrimitivity
(M : Type u_1) (Ξ± : Type u_2) [Group M] [MulAction M Ξ±] [MulAction.IsPretransitive M Ξ±] {n : β} (hn : 1 β€ n) {a : Ξ±} : MulAction.IsMultiplyPreprimitive M Ξ± n.succ β MulAction.IsMultiplyPreprimitive (β₯(MulAction.stabilizer M a)) (β₯(SubMulAction.ofStabilizer M a)) n - MulAction.IsMultiplyPreprimitive.isPreprimitive_ofFixingSubgroup π Mathlib.GroupTheory.GroupAction.MultiplePrimitivity
(M : Type u_1) {Ξ± : Type u_2} {instβ : Group M} {instβΒΉ : MulAction M Ξ±} (n : β) [self : MulAction.IsMultiplyPreprimitive M Ξ± n] {s : Set Ξ±} (hs : s.encard + 1 = βn) : MulAction.IsPreprimitive β₯(fixingSubgroup M s) β₯(SubMulAction.ofFixingSubgroup M s) - MulAction.IsMultiplyPreprimitive.mk π Mathlib.GroupTheory.GroupAction.MultiplePrimitivity
{M : Type u_1} {Ξ± : Type u_2} [Group M] [MulAction M Ξ±] {n : β} (isMultiplyPretransitive : MulAction.IsMultiplyPretransitive M Ξ± n) (isPreprimitive_ofFixingSubgroup : β {s : Set Ξ±}, s.encard + 1 = βn β MulAction.IsPreprimitive β₯(fixingSubgroup M s) β₯(SubMulAction.ofFixingSubgroup M s)) : MulAction.IsMultiplyPreprimitive M Ξ± n - MulAction.isMultiplyPreprimitive_iff π Mathlib.GroupTheory.GroupAction.MultiplePrimitivity
(M : Type u_1) (Ξ± : Type u_2) [Group M] [MulAction M Ξ±] (n : β) : MulAction.IsMultiplyPreprimitive M Ξ± n β MulAction.IsMultiplyPretransitive M Ξ± n β§ β {s : Set Ξ±}, s.encard + 1 = βn β MulAction.IsPreprimitive β₯(fixingSubgroup M s) β₯(SubMulAction.ofFixingSubgroup M s) - MulAction.isPreprimitive_of_fixingSubgroup_empty_iff π Mathlib.GroupTheory.GroupAction.MultiplePrimitivity
{G : Type u_1} [Group G] {Ξ± : Type u_2} [MulAction G Ξ±] : MulAction.IsPreprimitive β₯(fixingSubgroup G β ) β₯(SubMulAction.ofFixingSubgroup G β ) β MulAction.IsPreprimitive G Ξ± - MulAction.isPreprimitive_ofFixingSubgroup_conj_iff π Mathlib.GroupTheory.GroupAction.MultiplePrimitivity
{G : Type u_1} [Group G] {Ξ± : Type u_2} [MulAction G Ξ±] {s : Set Ξ±} {g : G} : MulAction.IsPreprimitive β₯(fixingSubgroup G s) β₯(SubMulAction.ofFixingSubgroup G s) β MulAction.IsPreprimitive β₯(fixingSubgroup G (g β’ s)) β₯(SubMulAction.ofFixingSubgroup G (g β’ s)) - MulAction.isPreprimitive_fixingSubgroup_insert_iff π Mathlib.GroupTheory.GroupAction.MultiplePrimitivity
{G : Type u_1} [Group G] {Ξ± : Type u_2} [MulAction G Ξ±] {a : Ξ±} {t : Set β₯(SubMulAction.ofStabilizer G a)} : MulAction.IsPreprimitive β₯(fixingSubgroup G (insert a (Subtype.val '' t))) β₯(SubMulAction.ofFixingSubgroup G (insert a (Subtype.val '' t))) β MulAction.IsPreprimitive β₯(fixingSubgroup (β₯(MulAction.stabilizer G a)) t) β₯(SubMulAction.ofFixingSubgroup (β₯(MulAction.stabilizer G a)) t) - MulAction.IsPreprimitive.is_two_preprimitive π Mathlib.GroupTheory.GroupAction.Jordan
{G : Type u_1} {Ξ± : Type u_2} [Group G] [MulAction G Ξ±] (hG : MulAction.IsPreprimitive G Ξ±) {s : Set Ξ±} {n : β} (hsn : s.ncard = n + 1) (hsn' : n + 2 < Nat.card Ξ±) (hs_prim : MulAction.IsPreprimitive β₯(fixingSubgroup G s) β₯(SubMulAction.ofFixingSubgroup G s)) : MulAction.IsMultiplyPreprimitive G Ξ± 2 - MulAction.IsPreprimitive.is_two_pretransitive π Mathlib.GroupTheory.GroupAction.Jordan
{G : Type u_1} {Ξ± : Type u_2} [Group G] [MulAction G Ξ±] (hG : MulAction.IsPreprimitive G Ξ±) {s : Set Ξ±} {n : β} (hsn : s.ncard = n + 1) (hsn' : n + 2 < Nat.card Ξ±) (hs_trans : MulAction.IsPretransitive β₯(fixingSubgroup G s) β₯(SubMulAction.ofFixingSubgroup G s)) : MulAction.IsMultiplyPretransitive G Ξ± 2 - MulAction.IsPreprimitive.isMultiplyPreprimitive π Mathlib.GroupTheory.GroupAction.Jordan
{G : Type u_1} {Ξ± : Type u_2} [Group G] [MulAction G Ξ±] (hG : MulAction.IsPreprimitive G Ξ±) {s : Set Ξ±} {n : β} (hsn : s.ncard = n + 1) (hsn' : n + 2 < Nat.card Ξ±) (hprim : MulAction.IsPreprimitive β₯(fixingSubgroup G s) β₯(SubMulAction.ofFixingSubgroup G s)) : MulAction.IsMultiplyPreprimitive G Ξ± (n + 2) - MulAction.IsPreprimitive.is_two_motive_of_is_motive π Mathlib.GroupTheory.GroupAction.Jordan
{G : Type u_1} {Ξ± : Type u_2} [Group G] [MulAction G Ξ±] (hG : MulAction.IsPreprimitive G Ξ±) {s : Set Ξ±} {n : β} (hsn : s.ncard = n + 1) (hsn' : n + 2 < Nat.card Ξ±) : (MulAction.IsPretransitive β₯(fixingSubgroup G s) β₯(SubMulAction.ofFixingSubgroup G s) β MulAction.IsMultiplyPretransitive G Ξ± 2) β§ (MulAction.IsPreprimitive β₯(fixingSubgroup G s) β₯(SubMulAction.ofFixingSubgroup G s) β MulAction.IsMultiplyPreprimitive G Ξ± 2) - Equiv.Perm.isPretransitive_of_isCycle_mem π Mathlib.GroupTheory.GroupAction.Jordan
{Ξ± : Type u_1} {G : Subgroup (Equiv.Perm Ξ±)} [Fintype Ξ±] [DecidableEq Ξ±] {g : Equiv.Perm Ξ±} (hgc : g.IsCycle) (hg : g β G) : MulAction.IsPretransitive β₯(fixingSubgroup (β₯G) (βg.support)αΆ) β₯(SubMulAction.ofFixingSubgroup (β₯G) (βg.support)αΆ) - Set.powersetCard.subMulAction π Mathlib.GroupTheory.GroupAction.SubMulAction.Combination
(G : Type u_1) [Group G] (Ξ± : Type u_2) [MulAction G Ξ±] (n : β) [DecidableEq Ξ±] : SubMulAction G (Finset Ξ±) - cuspsSubMulAction π Mathlib.NumberTheory.ModularForms.Cusps
(π’ : Subgroup (GL (Fin 2) β)) : SubMulAction (β₯π’) (OnePoint β) - cosetToCuspOrbit_apply_mk π Mathlib.NumberTheory.ModularForms.Cusps
{π’ : Subgroup (GL (Fin 2) β)} [π’.IsArithmetic] (g : Matrix.SpecialLinearGroup (Fin 2) β€) : cosetToCuspOrbit π’ β¦gβ§ = β¦β¨(Matrix.SpecialLinearGroup.mapGL β) gβ»ΒΉ β’ OnePoint.infty, β―β©β§ - ValuationSubring.subMulAction π Mathlib.RingTheory.Valuation.RamificationGroup
(K : Type u_1) {L : Type u_2} [Field K] [Field L] [Algebra K L] (A : ValuationSubring L) : SubMulAction (β₯(ValuationSubring.decompositionSubgroup K A)) L
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 69fae59