Loogle!
Result
Found 117 declarations mentioning ModuleCat.isFG.
- ModuleCat.isFG 📋 Mathlib.Algebra.Category.FGModuleCat.Basic
(R : Type u) [Ring R] : CategoryTheory.ObjectProperty (ModuleCat R) - FGModuleCat.instIsMonoidalModuleCatIsFG 📋 Mathlib.Algebra.Category.FGModuleCat.Basic
(R : Type u) [CommRing R] : (ModuleCat.isFG R).IsMonoidal - FGModuleCat.obj_carrier 📋 Mathlib.Algebra.Category.FGModuleCat.Basic
{R : Type u} [Ring R] (M : FGModuleCat R) : ↑M.obj = ↑M - FGModuleCat.ulift 📋 Mathlib.Algebra.Category.FGModuleCat.Basic
(R : Type u) [Ring R] : CategoryTheory.Functor (FGModuleCat R) (FGModuleCat R) - FGModuleCat.fullyFaithfulULift 📋 Mathlib.Algebra.Category.FGModuleCat.Basic
(R : Type u) [Ring R] : (FGModuleCat.ulift R).FullyFaithful - FGModuleCat.instFaithfulUlift 📋 Mathlib.Algebra.Category.FGModuleCat.Basic
(R : Type u) [Ring R] : (FGModuleCat.ulift R).Faithful - FGModuleCat.instFullUlift 📋 Mathlib.Algebra.Category.FGModuleCat.Basic
(R : Type u) [Ring R] : (FGModuleCat.ulift R).Full - ModuleCat.isFG_iff 📋 Mathlib.Algebra.Category.FGModuleCat.Basic
{R : Type u} [Ring R] (V : ModuleCat R) : ModuleCat.isFG R V ↔ Module.Finite R ↑V - FGModuleCat.instIsMonoidalClosedModuleCatIsFG 📋 Mathlib.Algebra.Category.FGModuleCat.Basic
(K : Type u) [Field K] : (ModuleCat.isFG K).IsMonoidalClosed - instFiniteCarrier 📋 Mathlib.Algebra.Category.FGModuleCat.Basic
{R : Type u} [Ring R] (M : FGModuleCat R) : Module.Finite R ↑M - FGModuleCat.instFiniteCarrier 📋 Mathlib.Algebra.Category.FGModuleCat.Basic
(R : Type u) [Ring R] (V : FGModuleCat R) : Module.Finite R ↑V - FGModuleCat.rightRigidCategory 📋 Mathlib.Algebra.Category.FGModuleCat.Basic
(K : Type u) [Field K] : CategoryTheory.RightRigidCategory (FGModuleCat K) - FGModuleCat.rightDual 📋 Mathlib.Algebra.Category.FGModuleCat.Basic
(K : Type u) [Field K] (V : FGModuleCat K) : CategoryTheory.HasRightDual V - FGModuleCat.exactPairing 📋 Mathlib.Algebra.Category.FGModuleCat.Basic
(K : Type u) [Field K] (V : FGModuleCat K) : CategoryTheory.ExactPairing V (FGModuleCat.FGModuleCatDual K V) - FGModuleCat.tensorUnit_obj 📋 Mathlib.Algebra.Category.FGModuleCat.Basic
(R : Type u) [CommRing R] : (CategoryTheory.MonoidalCategoryStruct.tensorUnit (FGModuleCat R)).obj = CategoryTheory.MonoidalCategoryStruct.tensorUnit (ModuleCat R) - FGModuleCat.FGModuleCatDual_coe 📋 Mathlib.Algebra.Category.FGModuleCat.Basic
(K : Type u) [Field K] (V : FGModuleCat K) : ↑(FGModuleCat.FGModuleCatDual K V) = Module.Dual K ↑V - FGModuleCat.ofHom 📋 Mathlib.Algebra.Category.FGModuleCat.Basic
{R : Type u} [Ring R] {V W : Type v} [AddCommGroup V] [Module R V] [Module.Finite R V] [AddCommGroup W] [Module R W] [Module.Finite R W] (f : V →ₗ[R] W) : FGModuleCat.of R V ⟶ FGModuleCat.of R W - LinearEquiv.toFGModuleCatIso 📋 Mathlib.Algebra.Category.FGModuleCat.Basic
{R : Type u} [Ring R] {V W : Type v} [AddCommGroup V] [Module R V] [Module.Finite R V] [AddCommGroup W] [Module R W] [Module.Finite R W] (e : V ≃ₗ[R] W) : FGModuleCat.of R V ≅ FGModuleCat.of R W - FGModuleCat.tensorObj_obj 📋 Mathlib.Algebra.Category.FGModuleCat.Basic
(R : Type u) [CommRing R] (M N : FGModuleCat R) : (CategoryTheory.MonoidalCategoryStruct.tensorObj M N).obj = CategoryTheory.MonoidalCategoryStruct.tensorObj M.obj N.obj - FGModuleCat.isoToLinearEquiv 📋 Mathlib.Algebra.Category.FGModuleCat.Basic
{R : Type u} [Ring R] {V W : FGModuleCat R} (i : V ≅ W) : ↑V ≃ₗ[R] ↑W - FGModuleCat.FGModuleCatCoevaluation 📋 Mathlib.Algebra.Category.FGModuleCat.Basic
(K : Type u) [Field K] (V : FGModuleCat K) : CategoryTheory.MonoidalCategoryStruct.tensorUnit (FGModuleCat K) ⟶ CategoryTheory.MonoidalCategoryStruct.tensorObj V (FGModuleCat.FGModuleCatDual K V) - FGModuleCat.FGModuleCatEvaluation 📋 Mathlib.Algebra.Category.FGModuleCat.Basic
(K : Type u) [Field K] (V : FGModuleCat K) : CategoryTheory.MonoidalCategoryStruct.tensorObj (FGModuleCat.FGModuleCatDual K V) V ⟶ CategoryTheory.MonoidalCategoryStruct.tensorUnit (FGModuleCat K) - FGModuleCat.hom_hom_id 📋 Mathlib.Algebra.Category.FGModuleCat.Basic
(R : Type u) [Ring R] (A : FGModuleCat R) : ModuleCat.Hom.hom (CategoryTheory.CategoryStruct.id A).hom = LinearMap.id - FGModuleCat.instFiniteHom 📋 Mathlib.Algebra.Category.FGModuleCat.Basic
(K : Type u) [Field K] (V W : FGModuleCat K) : Module.Finite K (V ⟶ W) - FGModuleCat.hom_ext 📋 Mathlib.Algebra.Category.FGModuleCat.Basic
{R : Type u} [Ring R] {V W : FGModuleCat R} {f g : V ⟶ W} (h : ModuleCat.Hom.hom f.hom = ModuleCat.Hom.hom g.hom) : f = g - FGModuleCat.hom_ext_iff 📋 Mathlib.Algebra.Category.FGModuleCat.Basic
{R : Type u} [Ring R] {V W : FGModuleCat R} {f g : V ⟶ W} : f = g ↔ ModuleCat.Hom.hom f.hom = ModuleCat.Hom.hom g.hom - LinearMap.comp_id_fgModuleCat 📋 Mathlib.Algebra.Category.FGModuleCat.Basic
{R : Type u_1} [Ring R] {G : FGModuleCat R} {H : Type v} [AddCommGroup H] [Module R H] (f : ↑G →ₗ[R] H) : f ∘ₗ ModuleCat.Hom.hom (CategoryTheory.CategoryStruct.id G).hom = f - LinearMap.id_fgModuleCat_comp 📋 Mathlib.Algebra.Category.FGModuleCat.Basic
{R : Type u_1} [Ring R] {G : Type v} [AddCommGroup G] [Module R G] {H : FGModuleCat R} (f : G →ₗ[R] ↑H) : ModuleCat.Hom.hom (CategoryTheory.CategoryStruct.id H).hom ∘ₗ f = f - FGModuleCat.FGModuleCatDual_obj 📋 Mathlib.Algebra.Category.FGModuleCat.Basic
(K : Type u) [Field K] (V : FGModuleCat K) : (FGModuleCat.FGModuleCatDual K V).obj = ModuleCat.of K (Module.Dual K ↑V) - FGModuleCat.hom_hom_comp 📋 Mathlib.Algebra.Category.FGModuleCat.Basic
(R : Type u) [Ring R] {A B C : FGModuleCat R} (f : A ⟶ B) (g : B ⟶ C) : ModuleCat.Hom.hom (CategoryTheory.CategoryStruct.comp f g).hom = ModuleCat.Hom.hom g.hom ∘ₗ ModuleCat.Hom.hom f.hom - FGModuleCat.instFiniteHomModuleCatObjIsFG 📋 Mathlib.Algebra.Category.FGModuleCat.Basic
(K : Type u) [Field K] (V W : FGModuleCat K) : Module.Finite K (V.obj ⟶ W.obj) - LinearEquiv.toFGModuleCatIso_hom 📋 Mathlib.Algebra.Category.FGModuleCat.Basic
{R : Type u} [Ring R] {V W : Type v} [AddCommGroup V] [Module R V] [Module.Finite R V] [AddCommGroup W] [Module R W] [Module.Finite R W] (e : V ≃ₗ[R] W) : e.toFGModuleCatIso.hom = CategoryTheory.ConcreteCategory.ofHom ↑e - LinearEquiv.toFGModuleCatIso_inv 📋 Mathlib.Algebra.Category.FGModuleCat.Basic
{R : Type u} [Ring R] {V W : Type v} [AddCommGroup V] [Module R V] [Module.Finite R V] [AddCommGroup W] [Module R W] [Module.Finite R W] (e : V ≃ₗ[R] W) : e.toFGModuleCatIso.inv = CategoryTheory.ConcreteCategory.ofHom ↑e.symm - FGModuleCat.instFullModuleCatForget₂LinearMapIdCarrierObjIsFG 📋 Mathlib.Algebra.Category.FGModuleCat.Basic
(R : Type u) [Ring R] : (CategoryTheory.forget₂ (FGModuleCat R) (ModuleCat R)).Full - FGModuleCat.ihom_obj 📋 Mathlib.Algebra.Category.FGModuleCat.Basic
(K : Type u) [Field K] (V W : FGModuleCat K) : (V ⟹ W) = FGModuleCat.of K (V.obj ⟶ W.obj) - FGModuleCat.instAdditiveModuleCatForget₂LinearMapIdCarrierObjIsFG 📋 Mathlib.Algebra.Category.FGModuleCat.Basic
(R : Type u) [CommRing R] : (CategoryTheory.forget₂ (FGModuleCat R) (ModuleCat R)).Additive - FGModuleCat.instLinearModuleCatForget₂LinearMapIdCarrierObjIsFG 📋 Mathlib.Algebra.Category.FGModuleCat.Basic
(R : Type u) [CommRing R] : CategoryTheory.Functor.Linear R (CategoryTheory.forget₂ (FGModuleCat R) (ModuleCat R)) - FGModuleCat.FGModuleCatEvaluation_apply 📋 Mathlib.Algebra.Category.FGModuleCat.Basic
(K : Type u) [Field K] (V : FGModuleCat K) (f : ↑(FGModuleCat.FGModuleCatDual K V)) (x : ↑V) : (CategoryTheory.ConcreteCategory.hom (FGModuleCat.FGModuleCatEvaluation K V).hom) (f ⊗ₜ[K] x) = f.toFun x - FGModuleCat.FGModuleCatCoevaluation_apply_one 📋 Mathlib.Algebra.Category.FGModuleCat.Basic
(K : Type u) [Field K] (V : FGModuleCat K) : (CategoryTheory.ConcreteCategory.hom (FGModuleCat.FGModuleCatCoevaluation K V).hom) 1 = ∑ i, (Module.Basis.ofVectorSpace K ↑V) i ⊗ₜ[K] (Module.Basis.ofVectorSpace K ↑V).coord i - FGModuleCat.Iso.conj_eq_conj 📋 Mathlib.Algebra.Category.FGModuleCat.Basic
(R : Type u) [CommRing R] {V W : FGModuleCat R} (i : V ≅ W) (f : CategoryTheory.End V) : i.conj f = FGModuleCat.ofHom ((FGModuleCat.isoToLinearEquiv i).conj (ModuleCat.Hom.hom f.hom)) - FGModuleCat.Iso.conj_hom_eq_conj 📋 Mathlib.Algebra.Category.FGModuleCat.Basic
(R : Type u) [CommRing R] {V W : FGModuleCat R} (i : V ≅ W) (f : CategoryTheory.End V) : ModuleCat.Hom.hom (i.conj f).hom = (FGModuleCat.isoToLinearEquiv i).conj (ModuleCat.Hom.hom f.hom) - FGModuleCat.FGModuleCatEvaluation_apply' 📋 Mathlib.Algebra.Category.FGModuleCat.Basic
(K : Type u) [Field K] (V : FGModuleCat K) (f : ↑(FGModuleCat.FGModuleCatDual K V)) (x : ↑V) : (ModuleCat.Hom.hom (FGModuleCat.FGModuleCatEvaluation K V).hom) (f ⊗ₜ[K] x) = f.toFun x - FGModuleCat.instHasFiniteColimits 📋 Mathlib.Algebra.Category.FGModuleCat.Colimits
{k : Type u} [Ring k] : CategoryTheory.Limits.HasFiniteColimits (FGModuleCat k) - FGModuleCat.instHasColimitsOfShapeOfFinCategory 📋 Mathlib.Algebra.Category.FGModuleCat.Colimits
{k : Type u} [Ring k] (J : Type) [CategoryTheory.SmallCategory J] [CategoryTheory.FinCategory J] : CategoryTheory.Limits.HasColimitsOfShape J (FGModuleCat k) - FGModuleCat.instPreservesFiniteColimitsModuleCatForget₂LinearMapIdCarrierObjIsFG 📋 Mathlib.Algebra.Category.FGModuleCat.Colimits
{k : Type u} [Ring k] : CategoryTheory.Limits.PreservesFiniteColimits (CategoryTheory.forget₂ (FGModuleCat k) (ModuleCat k)) - FGModuleCat.instCreatesColimitsOfShapeModuleCatForget₂LinearMapIdCarrierObjIsFG 📋 Mathlib.Algebra.Category.FGModuleCat.Colimits
{J : Type} [CategoryTheory.SmallCategory J] [CategoryTheory.FinCategory J] {k : Type u} [Ring k] : CategoryTheory.CreatesColimitsOfShape J (CategoryTheory.forget₂ (FGModuleCat k) (ModuleCat k)) - FGModuleCat.forget₂CreatesColimit 📋 Mathlib.Algebra.Category.FGModuleCat.Colimits
{J : Type} [CategoryTheory.SmallCategory J] [CategoryTheory.FinCategory J] {k : Type u} [Ring k] (F : CategoryTheory.Functor J (FGModuleCat k)) : CategoryTheory.CreatesColimit F (CategoryTheory.forget₂ (FGModuleCat k) (ModuleCat k)) - FGModuleCat.instFiniteCarrierColimitModuleCatCompForget₂LinearMapIdObjIsFG 📋 Mathlib.Algebra.Category.FGModuleCat.Colimits
{J : Type} [CategoryTheory.SmallCategory J] [CategoryTheory.FinCategory J] {k : Type u} [Ring k] (F : CategoryTheory.Functor J (FGModuleCat k)) : Module.Finite k ↑(CategoryTheory.Limits.colimit (F.comp (CategoryTheory.forget₂ (FGModuleCat k) (ModuleCat k)))) - FGModuleCat.instHasFiniteLimits 📋 Mathlib.Algebra.Category.FGModuleCat.Limits
{k : Type u} [Ring k] [IsNoetherianRing k] : CategoryTheory.Limits.HasFiniteLimits (FGModuleCat k) - FGModuleCat.instHasLimitsOfShapeOfFinCategory 📋 Mathlib.Algebra.Category.FGModuleCat.Limits
{k : Type u} [Ring k] [IsNoetherianRing k] (J : Type) [CategoryTheory.SmallCategory J] [CategoryTheory.FinCategory J] : CategoryTheory.Limits.HasLimitsOfShape J (FGModuleCat k) - FGModuleCat.instPreservesFiniteLimitsModuleCatForget₂LinearMapIdCarrierObjIsFG 📋 Mathlib.Algebra.Category.FGModuleCat.Limits
{k : Type u} [Ring k] [IsNoetherianRing k] : CategoryTheory.Limits.PreservesFiniteLimits (CategoryTheory.forget₂ (FGModuleCat k) (ModuleCat k)) - FGModuleCat.instCreatesLimitsOfShapeModuleCatForget₂LinearMapIdCarrierObjIsFG 📋 Mathlib.Algebra.Category.FGModuleCat.Limits
{J : Type} [CategoryTheory.SmallCategory J] [CategoryTheory.FinCategory J] {k : Type u} [Ring k] [IsNoetherianRing k] : CategoryTheory.CreatesLimitsOfShape J (CategoryTheory.forget₂ (FGModuleCat k) (ModuleCat k)) - FGModuleCat.forget₂CreatesLimit 📋 Mathlib.Algebra.Category.FGModuleCat.Limits
{J : Type} [CategoryTheory.SmallCategory J] [CategoryTheory.FinCategory J] {k : Type u} [Ring k] [IsNoetherianRing k] (F : CategoryTheory.Functor J (FGModuleCat k)) : CategoryTheory.CreatesLimit F (CategoryTheory.forget₂ (FGModuleCat k) (ModuleCat k)) - FGModuleCat.instFiniteCarrierLimitModuleCatCompForget₂LinearMapIdObjIsFG 📋 Mathlib.Algebra.Category.FGModuleCat.Limits
{J : Type} [CategoryTheory.SmallCategory J] [CategoryTheory.FinCategory J] {k : Type u} [Ring k] [IsNoetherianRing k] (F : CategoryTheory.Functor J (FGModuleCat k)) : Module.Finite k ↑(CategoryTheory.Limits.limit (F.comp (CategoryTheory.forget₂ (FGModuleCat k) (ModuleCat k)))) - FGModuleCat.instAbelian 📋 Mathlib.Algebra.Category.FGModuleCat.Abelian
{k : Type u} [Ring k] [IsNoetherianRing k] : CategoryTheory.Abelian (FGModuleCat k) - FGModuleCat.instIsIsoCoimageImageComparison 📋 Mathlib.Algebra.Category.FGModuleCat.Abelian
{k : Type u} [Ring k] [IsNoetherianRing k] {X Y : FGModuleCat k} (f : X ⟶ Y) : CategoryTheory.IsIso (CategoryTheory.Abelian.coimageImageComparison f) - instEssentiallySmallFGModuleCat 📋 Mathlib.Algebra.Category.FGModuleCat.EssentiallySmall
(R : Type u) [Ring R] : CategoryTheory.EssentiallySmall.{u, v, max (v + 1) u} (FGModuleCat R) - FGModuleRepr.embed 📋 Mathlib.Algebra.Category.FGModuleCat.EssentiallySmall
(R : Type u) [Ring R] : CategoryTheory.Functor (FGModuleRepr R) (FGModuleCat R) - FGModuleRepr.instIsEquivalenceFGModuleCatEmbed 📋 Mathlib.Algebra.Category.FGModuleCat.EssentiallySmall
(R : Type u) [Ring R] : (FGModuleRepr.embed R).IsEquivalence - instIsEquivalenceFGModuleCatUlift 📋 Mathlib.Algebra.Category.FGModuleCat.EssentiallySmall
(R : Type u) [Ring R] : (FGModuleCat.ulift R).IsEquivalence - FDRep.instHasKernels 📋 Mathlib.RepresentationTheory.FDRep
{k : Type u} {G : Type v} [Field k] [Monoid G] : CategoryTheory.Limits.HasKernels (FDRep k G) - FDRep.isoToLinearEquiv 📋 Mathlib.RepresentationTheory.FDRep
{R : Type u} {G : Type v} [CommRing R] [Monoid G] {V W : FDRep R G} (i : V ≅ W) : ↑V.V ≃ₗ[R] ↑W.V - FDRep.instFiniteDimensionalHom 📋 Mathlib.RepresentationTheory.FDRep
{k : Type u} {G : Type v} [Field k] [Monoid G] (V W : FDRep k G) : FiniteDimensional k (V ⟶ W) - FDRep.finrank_hom_simple_simple 📋 Mathlib.RepresentationTheory.FDRep
{k : Type u} {G : Type v} [Field k] [Monoid G] [IsAlgClosed k] (V W : FDRep k G) [CategoryTheory.Simple V] [CategoryTheory.Simple W] : Module.finrank k (V ⟶ W) = if Nonempty (V ≅ W) then 1 else 0 - FDRep.ρ 📋 Mathlib.RepresentationTheory.FDRep
{R : Type u} {G : Type v} [CommRing R] [Monoid G] (V : FDRep R G) : G →* ↑V.V →ₗ[R] ↑V.V - FDRep.of_ρ' 📋 Mathlib.RepresentationTheory.FDRep
{R : Type u} {G : Type v} [CommRing R] [Monoid G] {V : Type u} [AddCommGroup V] [Module R V] [Module.Finite R V] (ρ : G →* V →ₗ[R] V) : (FDRep.of ρ).ρ = ρ - FDRep.instHasForget₂HomSubtypeFGModuleCatLinearMapIdCarrierObjModuleCatIsFGVRepIntertwiningMapVρ 📋 Mathlib.RepresentationTheory.FDRep
{R : Type u} {G : Type v} [CommRing R] [Monoid G] : CategoryTheory.HasForget₂ (FDRep R G) (Rep.{u, u, v} R G) - FDRep.instFaithfulRepForget₂HomSubtypeFGModuleCatLinearMapIdCarrierObjModuleCatIsFGVIntertwiningMapVρ 📋 Mathlib.RepresentationTheory.FDRep
{R : Type u} {G : Type v} [CommRing R] [Monoid G] : (CategoryTheory.forget₂ (FDRep R G) (Rep.{u, u, v} R G)).Faithful - FDRep.instFullRepForget₂HomSubtypeFGModuleCatLinearMapIdCarrierObjModuleCatIsFGVIntertwiningMapVρ 📋 Mathlib.RepresentationTheory.FDRep
{R : Type u} {G : Type v} [CommRing R] [Monoid G] : (CategoryTheory.forget₂ (FDRep R G) (Rep.{u, u, v} R G)).Full - FDRep.instPreservesFiniteColimitsRepForget₂HomSubtypeFGModuleCatLinearMapIdCarrierObjModuleCatIsFGVIntertwiningMapVρ 📋 Mathlib.RepresentationTheory.FDRep
{R : Type u} {G : Type v} [CommRing R] [Monoid G] : CategoryTheory.Limits.PreservesFiniteColimits (CategoryTheory.forget₂ (FDRep R G) (Rep.{u, u, v} R G)) - FDRep.instPreservesFiniteLimitsRepForget₂HomSubtypeFGModuleCatLinearMapIdCarrierObjModuleCatIsFGVIntertwiningMapVρOfIsNoetherianRing 📋 Mathlib.RepresentationTheory.FDRep
{R : Type u} {G : Type v} [CommRing R] [Monoid G] [IsNoetherianRing R] : CategoryTheory.Limits.PreservesFiniteLimits (CategoryTheory.forget₂ (FDRep R G) (Rep.{u, u, v} R G)) - FDRep.dualTensorIsoLinHom 📋 Mathlib.RepresentationTheory.FDRep
{k : Type u} {G : Type v} {V : Type u} [Field k] [Group G] [AddCommGroup V] [Module k V] [FiniteDimensional k V] (ρV : Representation k G V) (W : FDRep k G) : CategoryTheory.MonoidalCategoryStruct.tensorObj (FDRep.of ρV.dual) W ≅ FDRep.of (ρV.linHom W.ρ) - FDRep.dualTensorIsoLinHomAux 📋 Mathlib.RepresentationTheory.FDRep
{k : Type u} {G : Type v} {V : Type u} [Field k] [Group G] [AddCommGroup V] [Module k V] [FiniteDimensional k V] (ρV : Representation k G V) (W : FDRep k G) : (CategoryTheory.MonoidalCategoryStruct.tensorObj (FDRep.of ρV.dual) W).V ≅ (FDRep.of (ρV.linHom W.ρ)).V - FDRep.of_ρ 📋 Mathlib.RepresentationTheory.FDRep
{R : Type u} {G : Type v} [CommRing R] [Monoid G] {V : Type u} [AddCommGroup V] [Module R V] [Module.Finite R V] (ρ : Representation R G V) : (FDRep.of ρ).ρ = CategoryTheory.InducedCategory.endEquiv.symm.toMonoidHom.comp ((ModuleCat.of R V).endRingEquiv.symm.toMonoidHom.comp ρ) - FDRep.hom_hom_action_ρ 📋 Mathlib.RepresentationTheory.FDRep
{R : Type u} {G : Type v} [CommRing R] [Monoid G] (V : FDRep R G) (g : G) : ModuleCat.Hom.hom (V.ρ g).hom = V.ρ g - FDRep.dualTensorIsoLinHom_hom_hom 📋 Mathlib.RepresentationTheory.FDRep
{k : Type u} {G : Type v} {V : Type u} [Field k] [Group G] [AddCommGroup V] [Module k V] [FiniteDimensional k V] (ρV : Representation k G V) (W : FDRep k G) : (FDRep.dualTensorIsoLinHom ρV W).hom.hom = CategoryTheory.ConcreteCategory.ofHom (dualTensorHom k V ↑W.V) - FDRep.forget₂_ρ 📋 Mathlib.RepresentationTheory.FDRep
{R : Type u} {G : Type v} [CommRing R] [Monoid G] (V : FDRep R G) : ((CategoryTheory.forget₂ (FDRep R G) (Rep.{u, u, v} R G)).obj V).ρ = V.ρ - FDRep.Iso.conj_ρ 📋 Mathlib.RepresentationTheory.FDRep
{R : Type u} {G : Type v} [CommRing R] [Monoid G] {V W : FDRep R G} (i : V ≅ W) (g : G) : W.ρ g = (FDRep.isoToLinearEquiv i).conj (V.ρ g) - FDRep.forget₂HomLinearEquiv 📋 Mathlib.RepresentationTheory.FDRep
{R : Type u} {G : Type v} [CommRing R] [Monoid G] (X Y : FDRep R G) : ((CategoryTheory.forget₂ (FDRep R G) (Rep.{u, u, v} R G)).obj X ⟶ (CategoryTheory.forget₂ (FDRep R G) (Rep.{u, u, v} R G)).obj Y) ≃ₗ[R] X ⟶ Y - FDRep.endRingEquiv_symm_comp_ρ 📋 Mathlib.RepresentationTheory.FDRep
{R : Type u} {G : Type v} [CommRing R] [Monoid G] (V : FDRep R G) : (↑V.V.obj.endRingEquiv.symm).comp V.ρ = CategoryTheory.InducedCategory.endEquiv.toMonoidHom.comp V.ρ - FDRep.endRingEquiv_comp_ρ 📋 Mathlib.RepresentationTheory.FDRep
{R : Type u} {G : Type v} [CommRing R] [Monoid G] (V : FDRep R G) : (↑V.V.obj.endRingEquiv).comp (CategoryTheory.InducedCategory.endEquiv.toMonoidHom.comp V.ρ) = V.ρ - Representation.linHom.invariantsEquivFDRepHom 📋 Mathlib.RepresentationTheory.Invariants
{k : Type u} [Field k] {G : Type v} [Group G] (X Y : FDRep k G) : ↥(Representation.linHom X.ρ Y.ρ).invariants ≃ₗ[k] X ⟶ Y - FDRep.char_iso 📋 Mathlib.RepresentationTheory.Character
{k : Type u} [Field k] {G : Type v} [Monoid G] {V W : FDRep k G} (i : V ≅ W) : V.character = W.character - FDRep.char_tensor 📋 Mathlib.RepresentationTheory.Character
{k : Type u} [Field k] {G : Type v} [Monoid G] (V W : FDRep k G) : (CategoryTheory.MonoidalCategoryStruct.tensorObj V W).character = V.character * W.character - FDRep.char_one 📋 Mathlib.RepresentationTheory.Character
{k : Type u} [Field k] {G : Type v} [Monoid G] (V : FDRep k G) : V.character 1 = ↑(Module.finrank k ↑V.V) - FDRep.char_orthonormal 📋 Mathlib.RepresentationTheory.Character
{k : Type u} [Field k] {G : Type v} [Group G] [IsAlgClosed k] [Fintype G] [Invertible ↑(Nat.card G)] (V W : FDRep k G) [CategoryTheory.Simple V] [CategoryTheory.Simple W] : (↑(Nat.card G))⁻¹ * ∑ g, V.character g * W.character g⁻¹ = if Nonempty (V ≅ W) then 1 else 0 - FDRep.scalar_product_char_eq_finrank_equivariant 📋 Mathlib.RepresentationTheory.Character
{k : Type u} [Field k] {G : Type v} [Group G] [Fintype G] [Invertible ↑(Nat.card G)] (V W : FDRep k G) : (↑(Nat.card G))⁻¹ * ∑ g, W.character g * V.character g⁻¹ = ↑(Module.finrank k (V ⟶ W)) - FDRep.char_dual 📋 Mathlib.RepresentationTheory.Character
{k : Type u} [Field k] {G : Type v} [Group G] (V : FDRep k G) (g : G) : (FDRep.of (Representation.dual V.ρ)).character g = V.character g⁻¹ - FDRep.average_char_eq_finrank_invariants 📋 Mathlib.RepresentationTheory.Character
{k : Type u} [Field k] {G : Type v} [Group G] [Fintype G] [Invertible ↑(Nat.card G)] (V : FDRep k G) : (↑(Nat.card G))⁻¹ * ∑ g, V.character g = ↑(Module.finrank k ↥(Representation.invariants V.ρ)) - FDRep.char_linHom 📋 Mathlib.RepresentationTheory.Character
{k : Type u} [Field k] {G : Type v} [Group G] (V W : FDRep k G) (g : G) : (FDRep.of (Representation.linHom V.ρ W.ρ)).character g = V.character g⁻¹ * W.character g - FDRep.instInjectiveOfNeZeroCastCard 📋 Mathlib.RepresentationTheory.FinGroupCharZero
{k : Type u} [Field k] {G : Type u} [Finite G] [Group G] [NeZero ↑(Nat.card G)] (V : FDRep k G) : CategoryTheory.Injective V - FDRep.instProjectiveOfNeZeroCastCard 📋 Mathlib.RepresentationTheory.FinGroupCharZero
{k : Type u} [Field k] {G : Type u} [Finite G] [Group G] [NeZero ↑(Nat.card G)] (V : FDRep k G) : CategoryTheory.Projective V - FDRep.simple_iff_char_is_norm_one 📋 Mathlib.RepresentationTheory.FinGroupCharZero
{k : Type u} [Field k] {G : Type u} [Group G] [IsAlgClosed k] [CharZero k] [Fintype G] (V : FDRep k G) : CategoryTheory.Simple V ↔ ∑ g, V.character g * V.character g⁻¹ = ↑(Nat.card G) - FDRep.simple_iff_end_is_rank_one 📋 Mathlib.RepresentationTheory.FinGroupCharZero
{k : Type u} [Field k] {G : Type u} [Finite G] [Group G] [IsAlgClosed k] [NeZero ↑(Nat.card G)] (V : FDRep k G) : CategoryTheory.Simple V ↔ Module.finrank k (V ⟶ V) = 1 - TannakaDuality.FiniteGroup.leftRegularFDRepHom 📋 Mathlib.RepresentationTheory.Tannaka
{k G : Type u} [CommRing k] [Group G] [Finite G] (s : G) : CategoryTheory.End TannakaDuality.FiniteGroup.rightFDRep - TannakaDuality.FiniteGroup.equivApp 📋 Mathlib.RepresentationTheory.Tannaka
{k G : Type u} [CommRing k] [Group G] (g : G) (X : FDRep k G) : X.V ≅ X.V - TannakaDuality.FiniteGroup.ofRightFDRep 📋 Mathlib.RepresentationTheory.Tannaka
{k G : Type u} [CommRing k] [Group G] [Finite G] [Fintype G] (X : FDRep k G) (v : ↑X.V) : TannakaDuality.FiniteGroup.rightFDRep ⟶ X - TannakaDuality.FiniteGroup.forget 📋 Mathlib.RepresentationTheory.Tannaka
(k G : Type u) [CommRing k] [Group G] : CategoryTheory.LaxMonoidalFunctor (FDRep k G) (FGModuleCat k) - TannakaDuality.FiniteGroup.mulRepHom 📋 Mathlib.RepresentationTheory.Tannaka
{k G : Type u} [CommRing k] [Group G] [Finite G] : CategoryTheory.MonoidalCategoryStruct.tensorObj TannakaDuality.FiniteGroup.rightFDRep TannakaDuality.FiniteGroup.rightFDRep ⟶ TannakaDuality.FiniteGroup.rightFDRep - TannakaDuality.FiniteGroup.forget_obj 📋 Mathlib.RepresentationTheory.Tannaka
{k G : Type u} [CommRing k] [Group G] (X : FDRep k G) : (TannakaDuality.FiniteGroup.forget k G).obj X = X.V - TannakaDuality.FiniteGroup.sumSMulInv 📋 Mathlib.RepresentationTheory.Tannaka
{k G : Type u} [CommRing k] [Group G] [Fintype G] {X : FDRep k G} (v : ↑X.V) : (G → k) →ₗ[k] ↑X.V - TannakaDuality.FiniteGroup.algHomOfRightFDRepComp 📋 Mathlib.RepresentationTheory.Tannaka
{k G : Type u} [CommRing k] [Group G] [Finite G] (η : CategoryTheory.Aut (TannakaDuality.FiniteGroup.forget k G)) : (G → k) →ₐ[k] G → k - TannakaDuality.FiniteGroup.ofRightFDRep_hom 📋 Mathlib.RepresentationTheory.Tannaka
{k G : Type u} [CommRing k] [Group G] [Finite G] [Fintype G] (X : FDRep k G) (v : ↑X.V) : (TannakaDuality.FiniteGroup.ofRightFDRep X v).hom = CategoryTheory.InducedCategory.homMk (ModuleCat.ofHom (TannakaDuality.FiniteGroup.sumSMulInv v)) - TannakaDuality.FiniteGroup.forget_map 📋 Mathlib.RepresentationTheory.Tannaka
{k G : Type u} [CommRing k] [Group G] (X Y : FDRep k G) (f : X ⟶ Y) : (TannakaDuality.FiniteGroup.forget k G).map f = f.hom - TannakaDuality.FiniteGroup.equivHom 📋 Mathlib.RepresentationTheory.Tannaka
(k G : Type u) [CommRing k] [Group G] : G →* CategoryTheory.Aut (TannakaDuality.FiniteGroup.forget k G) - TannakaDuality.FiniteGroup.equiv 📋 Mathlib.RepresentationTheory.Tannaka
(k G : Type u) [CommRing k] [Group G] [Finite G] [IsDomain k] : G ≃* CategoryTheory.Aut (TannakaDuality.FiniteGroup.forget k G) - TannakaDuality.FiniteGroup.map_mul_toRightFDRepComp 📋 Mathlib.RepresentationTheory.Tannaka
{k G : Type u} [CommRing k] [Group G] [Finite G] (η : CategoryTheory.Aut (TannakaDuality.FiniteGroup.forget k G)) (f g : G → k) : have α := ModuleCat.Hom.hom (η.hom.hom.app TannakaDuality.FiniteGroup.rightFDRep).hom; α (f * g) = α f * α g - TannakaDuality.FiniteGroup.toRightFDRepComp_injective 📋 Mathlib.RepresentationTheory.Tannaka
{k G : Type u} [CommRing k] [Group G] [Finite G] {η₁ η₂ : CategoryTheory.Aut (TannakaDuality.FiniteGroup.forget k G)} (h : η₁.hom.hom.app TannakaDuality.FiniteGroup.rightFDRep = η₂.hom.hom.app TannakaDuality.FiniteGroup.rightFDRep) : η₁ = η₂ - TannakaDuality.FiniteGroup.instMonoidalFDRepFGModuleCatForget₂HomSubtypeLinearMapIdCarrierObjModuleCatIsFGV 📋 Mathlib.RepresentationTheory.Tannaka
{k G : Type u} [CommRing k] [Group G] : (CategoryTheory.forget₂ (FDRep k G) (FGModuleCat k)).Monoidal - TannakaDuality.FiniteGroup.equivHom_injective 📋 Mathlib.RepresentationTheory.Tannaka
{k G : Type u} [CommRing k] [Group G] [Finite G] [Nontrivial k] : Function.Injective ⇑(TannakaDuality.FiniteGroup.equivHom k G) - TannakaDuality.FiniteGroup.equivHom_surjective 📋 Mathlib.RepresentationTheory.Tannaka
{k G : Type u} [CommRing k] [Group G] [Finite G] [IsDomain k] : Function.Surjective ⇑(TannakaDuality.FiniteGroup.equivHom k G) - TannakaDuality.FiniteGroup.equivHom_apply 📋 Mathlib.RepresentationTheory.Tannaka
(k G : Type u) [CommRing k] [Group G] (g : G) : (TannakaDuality.FiniteGroup.equivHom k G) g = CategoryTheory.LaxMonoidalFunctor.isoOfComponents (TannakaDuality.FiniteGroup.equivApp g) ⋯ ⋯ ⋯ - TannakaDuality.FiniteGroup.equivApp_hom 📋 Mathlib.RepresentationTheory.Tannaka
{k G : Type u} [CommRing k] [Group G] (g : G) (X : FDRep k G) : (TannakaDuality.FiniteGroup.equivApp g X).hom = CategoryTheory.InducedCategory.homMk (ModuleCat.ofHom (X.ρ g)) - TannakaDuality.FiniteGroup.equivApp_inv 📋 Mathlib.RepresentationTheory.Tannaka
{k G : Type u} [CommRing k] [Group G] (g : G) (X : FDRep k G) : (TannakaDuality.FiniteGroup.equivApp g X).inv = CategoryTheory.InducedCategory.homMk (ModuleCat.ofHom (X.ρ g⁻¹)) - TannakaDuality.FiniteGroup.toRightFDRepComp_in_rightRegular 📋 Mathlib.RepresentationTheory.Tannaka
{k G : Type u} [CommRing k] [Group G] [Finite G] [IsDomain k] (η : CategoryTheory.Aut (TannakaDuality.FiniteGroup.forget k G)) : ∃ s, ModuleCat.Hom.hom (η.hom.hom.app TannakaDuality.FiniteGroup.rightFDRep).hom = TannakaDuality.FiniteGroup.rightRegular s - TannakaDuality.FiniteGroup.sumSMulInv_single_id 📋 Mathlib.RepresentationTheory.Tannaka
{k G : Type u} [CommRing k] [Group G] [Fintype G] [DecidableEq G] {X : FDRep k G} (v : ↑X.V) : ∑ s, Pi.single 1 1 s • (X.ρ s⁻¹) v = v - TannakaDuality.FiniteGroup.sumSMulInv_apply 📋 Mathlib.RepresentationTheory.Tannaka
{k G : Type u} [CommRing k] [Group G] [Fintype G] {X : FDRep k G} (v : ↑X.V) (f : G → k) : (TannakaDuality.FiniteGroup.sumSMulInv v) f = ∑ s, f s • (X.ρ s⁻¹) v
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