Loogle!
Result
Found 49 declarations mentioning QuotientGroup.rightRel.
- QuotientGroup.rightRel ๐ Mathlib.GroupTheory.Coset.Defs
{ฮฑ : Type u_1} [Group ฮฑ] (s : Subgroup ฮฑ) : Setoid ฮฑ - QuotientGroup.quotientRightRelEquivQuotientLeftRel ๐ Mathlib.GroupTheory.Coset.Defs
{ฮฑ : Type u_1} [Group ฮฑ] (s : Subgroup ฮฑ) : Quotient (QuotientGroup.rightRel s) โ ฮฑ โงธ s - QuotientGroup.rightRelDecidable ๐ Mathlib.GroupTheory.Coset.Defs
{ฮฑ : Type u_1} [Group ฮฑ] (s : Subgroup ฮฑ) [DecidablePred fun x => x โ s] : DecidableRel โ(QuotientGroup.rightRel s) - QuotientGroup.rightRel_apply ๐ Mathlib.GroupTheory.Coset.Defs
{ฮฑ : Type u_1} [Group ฮฑ] {s : Subgroup ฮฑ} {x y : ฮฑ} : (QuotientGroup.rightRel s) x y โ y * xโปยน โ s - QuotientGroup.rightRel_eq ๐ Mathlib.GroupTheory.Coset.Defs
{ฮฑ : Type u_1} [Group ฮฑ] (s : Subgroup ฮฑ) : โ(QuotientGroup.rightRel s) = fun x y => y * xโปยน โ s - QuotientGroup.rightRel_eq_top ๐ Mathlib.GroupTheory.QuotientGroup.Defs
{G : Type u_1} [Group G] {N : Subgroup G} : QuotientGroup.rightRel N = โค โ N = โค - QuotientGroup.rightRel_r_eq_rightCosetEquivalence ๐ Mathlib.GroupTheory.Coset.Basic
{ฮฑ : Type u_1} [Group ฮฑ] (s : Subgroup ฮฑ) : โ(QuotientGroup.rightRel s) = RightCosetEquivalence โs - QuotientGroup.rightRel_pi ๐ Mathlib.GroupTheory.Coset.Basic
{ฮน : Type u_2} {ฮฒ : ฮน โ Type u_3} [(i : ฮน) โ Group (ฮฒ i)] (s' : (i : ฮน) โ Subgroup (ฮฒ i)) : QuotientGroup.rightRel (Subgroup.pi Set.univ s') = piSetoid - QuotientGroup.rightRel_prod ๐ Mathlib.GroupTheory.Coset.Basic
{ฮฑ : Type u_1} [Group ฮฑ] (s : Subgroup ฮฑ) {ฮฒ : Type u_2} [Group ฮฒ] (s' : Subgroup ฮฒ) : QuotientGroup.rightRel (s.prod s') = (QuotientGroup.rightRel s).prod (QuotientGroup.rightRel s') - QuotientGroup.fintypeQuotientRightRel ๐ Mathlib.GroupTheory.Coset.Card
{ฮฑ : Type u_1} [Group ฮฑ] {s : Subgroup ฮฑ} [Fintype (ฮฑ โงธ s)] : Fintype (Quotient (QuotientGroup.rightRel s)) - QuotientGroup.card_quotient_rightRel ๐ Mathlib.GroupTheory.Coset.Card
{ฮฑ : Type u_1} [Group ฮฑ] (s : Subgroup ฮฑ) [Fintype (ฮฑ โงธ s)] : Fintype.card (Quotient (QuotientGroup.rightRel s)) = Fintype.card (ฮฑ โงธ s) - Subgroup.IsComplement.rightQuotientEquiv ๐ Mathlib.GroupTheory.Complement
{G : Type u_1} [Group G] {H : Subgroup G} {T : Set G} (hT : Subgroup.IsComplement (โH) T) : Quotient (QuotientGroup.rightRel H) โ โT - Subgroup.isComplement_subgroup_left_iff_bijective ๐ Mathlib.GroupTheory.Complement
{G : Type u_1} [Group G] {H : Subgroup G} {T : Set G} : Subgroup.IsComplement (โH) T โ Function.Bijective (T.domRestrict Quotient.mk'') - Subgroup.isComplement_range_right ๐ Mathlib.GroupTheory.Complement
{G : Type u_1} [Group G] {H : Subgroup G} {f : Quotient (QuotientGroup.rightRel H) โ G} (hf : โ (q : Quotient (QuotientGroup.rightRel H)), Quotient.mk'' (f q) = q) : Subgroup.IsComplement (โH) (Set.range f) - Subgroup.isComplement_subgroup_left_iff_existsUnique_quotientMk'' ๐ Mathlib.GroupTheory.Complement
{G : Type u_1} [Group G] {H : Subgroup G} {T : Set G} : Subgroup.IsComplement (โH) T โ โ (q : Quotient (QuotientGroup.rightRel H)), โ! t, Quotient.mk'' โt = q - Subgroup.IsComplement.mk''_rightQuotientEquiv ๐ Mathlib.GroupTheory.Complement
{G : Type u_1} [Group G] {H : Subgroup G} {T : Set G} (hT : Subgroup.IsComplement (โH) T) (q : Quotient (QuotientGroup.rightRel H)) : Quotient.mk'' โ(hT.rightQuotientEquiv q) = q - Subgroup.IsComplement.rightQuotientEquiv_apply ๐ Mathlib.GroupTheory.Complement
{G : Type u_1} [Group G] {H : Subgroup G} {f : Quotient (QuotientGroup.rightRel H) โ G} (hf : โ (q : Quotient (QuotientGroup.rightRel H)), Quotient.mk'' (f q) = q) (q : Quotient (QuotientGroup.rightRel H)) : โ(โฏ.rightQuotientEquiv q) = f q - DoubleCoset.right_bot_eq_right_quot ๐ Mathlib.GroupTheory.DoubleCoset
{G : Type u_1} [Group G] (H : Subgroup G) : DoubleCoset.Quotient โH โโฅ = Quotient (QuotientGroup.rightRel H) - DoubleCoset.rel_bot_eq_right_group_rel ๐ Mathlib.GroupTheory.DoubleCoset
{G : Type u_1} [Group G] (H : Subgroup G) : โ(DoubleCoset.setoid โH โโฅ) = โ(QuotientGroup.rightRel H) - DoubleCoset.iUnion_image_mk_rightRel ๐ Mathlib.GroupTheory.DoubleCoset
{G : Type u_1} [Group G] {H K : Subgroup G} : โ q, Quot.mk โ(QuotientGroup.rightRel H) '' DoubleCoset.doubleCoset (Quotient.out q) โH โK = Set.univ - DoubleCoset.iUnion_finset_rightRel_eq_univ_of_rightRel ๐ Mathlib.GroupTheory.DoubleCoset
{G : Type u_1} [Group G] {H K : Subgroup G} {t : Finset (DoubleCoset.Quotient โH โK)} (ht : Set.univ โ โ i โ t, Quot.mk โ(QuotientGroup.rightRel H) '' DoubleCoset.doubleCoset (Quotient.out i) โH โK) : โ q โ t, DoubleCoset.doubleCoset (Quotient.out q) โH โK = Set.univ - Rep.indCoindIso ๐ Mathlib.RepresentationTheory.FiniteIndex
{k : Type u} {G : Type v} [CommRing k] [Group G] {S : Subgroup G} [DecidableRel โ(QuotientGroup.rightRel S)] [S.FiniteIndex] (A : Rep.{max w u, u, v} k โฅS) : Rep.ind S.subtype A โ Rep.coind.{u, v, v, max u w} S.subtype A - Rep.resIndAdjunction ๐ Mathlib.RepresentationTheory.FiniteIndex
(k : Type u) {G : Type v} [CommRing k] [Group G] (S : Subgroup G) [DecidableRel โ(QuotientGroup.rightRel S)] [S.FiniteIndex] : Rep.resFunctor S.subtype โฃ Rep.indFunctor k S.subtype - Rep.coindResAdjunction ๐ Mathlib.RepresentationTheory.FiniteIndex
(k : Type u) {G : Type v} [CommRing k] [Group G] (S : Subgroup G) [DecidableRel โ(QuotientGroup.rightRel S)] [S.FiniteIndex] : Rep.coindFunctor k S.subtype โฃ Rep.resFunctor S.subtype - Rep.indCoindNatIso ๐ Mathlib.RepresentationTheory.FiniteIndex
(k : Type u) {G : Type v} [CommRing k] [Group G] (S : Subgroup G) [DecidableRel โ(QuotientGroup.rightRel S)] [S.FiniteIndex] : Rep.indFunctor k S.subtype โ Rep.coindFunctor k S.subtype - Rep.indToCoindAux ๐ Mathlib.RepresentationTheory.FiniteIndex
{k : Type u} {G : Type v} [CommRing k] [Group G] {S : Subgroup G} [DecidableRel โ(QuotientGroup.rightRel S)] (A : Rep.{w, u, v} k โฅS) (g : G) : โA โโ[k] G โ โA - Rep.indCoindNatIso_hom_app ๐ Mathlib.RepresentationTheory.FiniteIndex
(k : Type u) {G : Type v} [CommRing k] [Group G] (S : Subgroup G) [DecidableRel โ(QuotientGroup.rightRel S)] [S.FiniteIndex] (X : Rep.{max u w, u, v} k โฅS) : (Rep.indCoindNatIso k S).hom.app X = X.indCoindIso.hom - Rep.indCoindNatIso_inv_app ๐ Mathlib.RepresentationTheory.FiniteIndex
(k : Type u) {G : Type v} [CommRing k] [Group G] (S : Subgroup G) [DecidableRel โ(QuotientGroup.rightRel S)] [S.FiniteIndex] (X : Rep.{max u w, u, v} k โฅS) : (Rep.indCoindNatIso k S).inv.app X = X.indCoindIso.inv - Rep.indToCoindAux_self ๐ Mathlib.RepresentationTheory.FiniteIndex
{k : Type u} {G : Type v} [CommRing k] [Group G] {S : Subgroup G} [DecidableRel โ(QuotientGroup.rightRel S)] {A : Rep.{w, u, v} k โฅS} (g : G) (a : โA) : (A.indToCoindAux g) a g = a - Rep.indToCoindAux_of_not_rel ๐ Mathlib.RepresentationTheory.FiniteIndex
{k : Type u} {G : Type v} [CommRing k] [Group G] {S : Subgroup G} [DecidableRel โ(QuotientGroup.rightRel S)] {A : Rep.{w, u, v} k โฅS} (g gโ : G) (a : โA) (h : ยฌ(QuotientGroup.rightRel S) gโ g) : (A.indToCoindAux g) a gโ = 0 - Rep.coindResAdjunction_counit_app ๐ Mathlib.RepresentationTheory.FiniteIndex
{k : Type u} {G : Type v} [CommRing k] [Group G] {S : Subgroup G} [DecidableRel โ(QuotientGroup.rightRel S)] [S.FiniteIndex] (B : Rep.{max w u v, u, v} k G) : (Rep.coindResAdjunction k S).counit.app B = CategoryTheory.CategoryStruct.comp (Rep.res S.subtype B).indCoindIso.inv ((Rep.indResAdjunction k S.subtype).counit.app B) - Rep.resIndAdjunction_unit_app ๐ Mathlib.RepresentationTheory.FiniteIndex
{k : Type u} {G : Type v} [CommRing k] [Group G] {S : Subgroup G} [DecidableRel โ(QuotientGroup.rightRel S)] [S.FiniteIndex] (B : Rep.{max w u v, u, v} k G) : (Rep.resIndAdjunction k S).unit.app B = CategoryTheory.CategoryStruct.comp ((Rep.resCoindAdjunction k S.subtype).unit.app B) (Rep.res S.subtype B).indCoindIso.inv - Rep.indToCoindAux_fst_mul_inv ๐ Mathlib.RepresentationTheory.FiniteIndex
{k : Type u} {G : Type v} [CommRing k] [Group G] {S : Subgroup G} [DecidableRel โ(QuotientGroup.rightRel S)] {A : Rep.{w, u, v} k โฅS} (gโ gโ gโ : G) (a : โA) : (A.indToCoindAux (gโ * gโโปยน)) a gโ = (A.indToCoindAux gโ) a (gโ * gโ) - Rep.indToCoindAux_snd_mul_inv ๐ Mathlib.RepresentationTheory.FiniteIndex
{k : Type u} {G : Type v} [CommRing k] [Group G] {S : Subgroup G} [DecidableRel โ(QuotientGroup.rightRel S)] {A : Rep.{w, u, v} k โฅS} (gโ gโ gโ : G) (a : โA) : (A.indToCoindAux gโ) a (gโ * gโโปยน) = (A.indToCoindAux (gโ * gโ)) a gโ - Rep.resIndAdjunction_counit_app ๐ Mathlib.RepresentationTheory.FiniteIndex
{k : Type u} {G : Type v} [CommRing k] [Group G] {S : Subgroup G} [DecidableRel โ(QuotientGroup.rightRel S)] [S.FiniteIndex] (A : Rep.{max w u v, u, v} k โฅS) : (Rep.resIndAdjunction k S).counit.app A = CategoryTheory.CategoryStruct.comp ((Rep.resFunctor S.subtype).map A.indCoindIso.hom) ((Rep.resCoindAdjunction k S.subtype).counit.app A) - Rep.coindResAdjunction_unit_app ๐ Mathlib.RepresentationTheory.FiniteIndex
{k : Type u} {G : Type v} [CommRing k] [Group G] {S : Subgroup G} [DecidableRel โ(QuotientGroup.rightRel S)] [S.FiniteIndex] (A : Rep.{max w u v, u, v} k โฅS) : (Rep.coindResAdjunction k S).unit.app A = CategoryTheory.CategoryStruct.comp ((Rep.indResAdjunction k S.subtype).unit.app A) ((Rep.resFunctor S.subtype).map A.indCoindIso.hom) - Rep.indToCoind ๐ Mathlib.RepresentationTheory.FiniteIndex
{k : Type u} {G : Type v} [CommRing k] [Group G] {S : Subgroup G} [DecidableRel โ(QuotientGroup.rightRel S)] (A : Rep.{w, u, v} k โฅS) : โ(Rep.ind S.subtype A) โโ[k] โ(Rep.coind.{u, v, v, w} S.subtype A) - Rep.indToCoindAux_comm ๐ Mathlib.RepresentationTheory.FiniteIndex
{k : Type u} {G : Type v} [CommRing k] [Group G] {S : Subgroup G} [DecidableRel โ(QuotientGroup.rightRel S)] {A B : Rep.{u_1, u, v} k โฅS} (f : A โถ B) (gโ gโ : G) (a : โA) : (B.indToCoindAux gโ) ((Rep.Hom.hom f) a) gโ = (Rep.Hom.hom f) ((A.indToCoindAux gโ) a gโ) - Rep.indToCoindAux_mul_fst ๐ Mathlib.RepresentationTheory.FiniteIndex
{k : Type u} {G : Type v} [CommRing k] [Group G] {S : Subgroup G} [DecidableRel โ(QuotientGroup.rightRel S)] {A : Rep.{w, u, v} k โฅS} (gโ gโ : G) (a : โA) (s : โฅS) : (A.indToCoindAux (โs * gโ)) ((A.ฯ s) a) gโ = (A.indToCoindAux gโ) a gโ - Rep.indToCoindAux_mul_snd ๐ Mathlib.RepresentationTheory.FiniteIndex
{k : Type u} {G : Type v} [CommRing k] [Group G] {S : Subgroup G} [DecidableRel โ(QuotientGroup.rightRel S)] {A : Rep.{w, u, v} k โฅS} (g gโ : G) (a : โA) (s : โฅS) : (A.indToCoindAux g) a (โs * gโ) = (A.ฯ s) ((A.indToCoindAux g) a gโ) - Rep.resIndAdjunction_homEquiv_apply ๐ Mathlib.RepresentationTheory.FiniteIndex
{k : Type u} {G : Type v} [CommRing k] [Group G] {S : Subgroup G} [DecidableRel โ(QuotientGroup.rightRel S)] [S.FiniteIndex] (A : Rep.{max w u v, u, v} k โฅS) {B : Rep.{max w u v, u, v} k G} (f : Rep.res S.subtype B โถ A) : ((Rep.resIndAdjunction k S).homEquiv B A) f = CategoryTheory.CategoryStruct.comp ((Rep.resCoindHomEquiv.{max w u v, u, v, v} S.subtype B A) f) A.indCoindIso.inv - Rep.coindResAdjunction_homEquiv_apply ๐ Mathlib.RepresentationTheory.FiniteIndex
{k : Type u} {G : Type v} [CommRing k] [Group G] {S : Subgroup G} [DecidableRel โ(QuotientGroup.rightRel S)] [S.FiniteIndex] (A : Rep.{max w u v, u, v} k โฅS) {B : Rep.{max (max u v) w, u, v} k G} (f : Rep.coind.{u, v, v, max (max u v) w} S.subtype A โถ B) : ((Rep.coindResAdjunction k S).homEquiv A B) f = (Rep.indResHomEquiv S.subtype A B) (CategoryTheory.CategoryStruct.comp A.indCoindIso.hom f) - Rep.resIndAdjunction_homEquiv_symm_apply ๐ Mathlib.RepresentationTheory.FiniteIndex
{k : Type u} {G : Type v} [CommRing k] [Group G] {S : Subgroup G} [DecidableRel โ(QuotientGroup.rightRel S)] [S.FiniteIndex] (A : Rep.{max w u v, u, v} k โฅS) {B : Rep.{max w u v, u, v} k G} (f : B โถ (Rep.indFunctor k S.subtype).obj A) : ((Rep.resIndAdjunction k S).homEquiv B A).symm f = (Rep.resCoindHomEquiv.{max w u v, u, v, v} S.subtype B A).symm (CategoryTheory.CategoryStruct.comp f A.indCoindIso.hom) - Rep.coindResAdjunction_homEquiv_symm_apply ๐ Mathlib.RepresentationTheory.FiniteIndex
{k : Type u} {G : Type v} [CommRing k] [Group G] {S : Subgroup G} [DecidableRel โ(QuotientGroup.rightRel S)] [S.FiniteIndex] (A : Rep.{max w u v, u, v} k โฅS) {B : Rep.{max (max u v) w, u, v} k G} (f : A โถ Rep.res S.subtype B) : ((Rep.coindResAdjunction k S).homEquiv A B).symm f = CategoryTheory.CategoryStruct.comp A.indCoindIso.inv ((Rep.indResHomEquiv S.subtype A B).symm f) - Rep.coindToInd_indToCoind ๐ Mathlib.RepresentationTheory.FiniteIndex
{k : Type u} {G : Type v} [CommRing k] [Group G] {S : Subgroup G} [DecidableRel โ(QuotientGroup.rightRel S)] (A : Rep.{w, u, v} k โฅS) [S.FiniteIndex] : A.indToCoind โโ A.coindToInd = LinearMap.id - Rep.indToCoind_coindToInd ๐ Mathlib.RepresentationTheory.FiniteIndex
{k : Type u} {G : Type v} [CommRing k] [Group G] {S : Subgroup G} [DecidableRel โ(QuotientGroup.rightRel S)] (A : Rep.{w, u, v} k โฅS) [S.FiniteIndex] : A.coindToInd โโ A.indToCoind = LinearMap.id - Rep.coindToInd_apply ๐ Mathlib.RepresentationTheory.FiniteIndex
{k : Type u} {G : Type v} [CommRing k] [Group G] {S : Subgroup G} (A : Rep.{w, u, v} k โฅS) [S.FiniteIndex] (f : โ(Rep.coind.{u, v, v, w} S.subtype A)) : A.coindToInd f = โ g, g.liftOn (fun g => (Representation.IndV.mk S.subtype A.ฯ g) (โf g)) โฏ - Rep.indCoindIso_hom_hom_toLinearMap ๐ Mathlib.RepresentationTheory.FiniteIndex
{k : Type u} {G : Type v} [CommRing k] [Group G] {S : Subgroup G} [DecidableRel โ(QuotientGroup.rightRel S)] [S.FiniteIndex] (A : Rep.{max w u, u, v} k โฅS) : (Rep.Hom.hom A.indCoindIso.hom).toLinearMap = A.indToCoind - Rep.indCoindIso_inv_hom_toLinearMap ๐ Mathlib.RepresentationTheory.FiniteIndex
{k : Type u} {G : Type v} [CommRing k] [Group G] {S : Subgroup G} [DecidableRel โ(QuotientGroup.rightRel S)] [S.FiniteIndex] (A : Rep.{max w u, u, v} k โฅS) : (Rep.Hom.hom A.indCoindIso.inv).toLinearMap = { toFun := (Representation.Equiv.mk (LinearEquiv.ofLinearMap A.indToCoind A.coindToInd โฏ โฏ) โฏ).invFun, map_add' := โฏ, map_smul' := โฏ }
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