Rep k G is the category of k-linear representations of G.

If V : Rep k G, there is a coercion that allows you to treat V as a type, and this type comes equipped with a Module k V instance. Also V.ρ gives the homomorphism G →* (V →ₗ[k] V).

Conversely, given a homomorphism ρ : G →* (V →ₗ[k] V), you can construct the bundled representation as Rep.of ρ.

We construct the categorical equivalence Rep k G ≌ ModuleCat (MonoidAlgebra k G). We verify that Rep k G is a k-linear abelian symmetric monoidal category with all (co)limits.

@[reducible, inline]

noncomputable abbrev Rep (k : Type u) (G : Type u) [Ring k] [Monoid G] : Type (u + 1)

The category of k-linear representations of a monoid G.

Equations

• Rep k G = Action (ModuleCat k) (MonCat.of G)

noncomputable instance instLinearRep (k : Type u) (G : Type u) [CommRing k] [Monoid G] : CategoryTheory.Linear k (Rep k G)

Equations

• instLinearRep k G = inferInstance

noncomputable instance Rep.instCoeSortType {k : Type u} {G : Type u} [CommRing k] [Monoid G] : CoeSort (Rep k G) (Type u)

Equations

• Rep.instCoeSortType = CategoryTheory.ConcreteCategory.hasCoeToSort (Rep k G)

noncomputable instance Rep.instAddCommGroupCoe {k : Type u} {G : Type u} [CommRing k] [Monoid G] (V : Rep k G) : AddCommGroup (CoeSort.coe V)

Equations

• V.instAddCommGroupCoe = let_fun this := inferInstance; this

noncomputable instance Rep.instModuleCoe {k : Type u} {G : Type u} [CommRing k] [Monoid G] (V : Rep k G) : Module k (CoeSort.coe V)

Equations

• V.instModuleCoe = let_fun this := inferInstance; this

noncomputable def Rep.ρ {k : Type u} {G : Type u} [CommRing k] [Monoid G] (V : Rep k G) : Representation k G (CoeSort.coe V)

Specialize the existing Action.ρ, changing the type to Representation k G V.

Equations

• V.ρ = V.ρ

noncomputable def Rep.of {k : Type u} {G : Type u} [CommRing k] [Monoid G] {V : Type u} [AddCommGroup V] [Module k V] (ρ : G →* V →ₗ[k] V) : Rep k G

Lift an unbundled representation to Rep.

Equations

• Rep.of ρ = { V := ModuleCat.of k V, ρ := ρ }

@[simp]

theorem Rep.coe_of {k : Type u} {G : Type u} [CommRing k] [Monoid G] {V : Type u} [AddCommGroup V] [Module k V] (ρ : G →* V →ₗ[k] V) : CoeSort.coe (Rep.of ρ) = V

@[simp]

theorem Rep.of_ρ {k : Type u} {G : Type u} [CommRing k] [Monoid G] {V : Type u} [AddCommGroup V] [Module k V] (ρ : G →* V →ₗ[k] V) : (Rep.of ρ).ρ = ρ

theorem Rep.Action_ρ_eq_ρ {k : Type u} {G : Type u} [CommRing k] [Monoid G] {A : Rep k G} : A.ρ = A.ρ

theorem Rep.of_ρ_apply {k : Type u} {G : Type u} [CommRing k] [Monoid G] {V : Type u} [AddCommGroup V] [Module k V] (ρ : Representation k G V) (g : ↑(MonCat.of G)) : (Rep.of ρ).ρ g = ρ g

Allows us to apply lemmas about the underlying ρ, which would take an element g : G rather than g : MonCat.of G as an argument.

@[simp]

theorem Rep.ρ_inv_self_apply {k : Type u} [CommRing k] {G : Type u} [Group G] (A : Rep k G) (g : G) (x : CoeSort.coe A) : (A.ρ g⁻¹) ((A.ρ g) x) = x

@[simp]

theorem Rep.ρ_self_inv_apply {k : Type u} [CommRing k] {G : Type u} [Group G] {A : Rep k G} (g : G) (x : CoeSort.coe A) : (A.ρ g) ((A.ρ g⁻¹) x) = x

theorem Rep.hom_comm_apply {k : Type u} {G : Type u} [CommRing k] [Monoid G] {A : Rep k G} {B : Rep k G} (f : A ⟶ B) (g : G) (x : CoeSort.coe A) : f.hom ((A.ρ g) x) = (B.ρ g) (f.hom x)

noncomputable def Rep.trivial (k : Type u) (G : Type u) [CommRing k] [Monoid G] (V : Type u) [AddCommGroup V] [Module k V] : Rep k G

The trivial k-linear G-representation on a k-module V.

Equations

• Rep.trivial k G V = Rep.of (Representation.trivial k)

theorem Rep.trivial_def {k : Type u} {G : Type u} [CommRing k] [Monoid G] {V : Type u} [AddCommGroup V] [Module k V] (g : G) (v : V) : ((Rep.trivial k G V).ρ g) v = v

@[reducible, inline]

noncomputable abbrev Rep.IsTrivial {k : Type u} {G : Type u} [CommRing k] [Monoid G] (A : Rep k G) : Prop

A predicate for representations that fix every element.

Equations

• A.IsTrivial = A.ρ.IsTrivial

noncomputable instance Rep.instIsTrivialTrivial {k : Type u} {G : Type u} [CommRing k] [Monoid G] {V : Type u} [AddCommGroup V] [Module k V] : (Rep.trivial k G V).IsTrivial

Equations

• ⋯ = ⋯

noncomputable instance Rep.instIsTrivialOfOfIsTrivial {k : Type u} {G : Type u} [CommRing k] [Monoid G] {V : Type u} [AddCommGroup V] [Module k V] (ρ : Representation k G V) [ρ.IsTrivial] : (Rep.of ρ).IsTrivial

Equations

• ⋯ = ⋯

noncomputable instance Rep.instPreservesLimitsModuleCatForget₂ {k : Type u} {G : Type u} [CommRing k] [Monoid G] : CategoryTheory.Limits.PreservesLimits (CategoryTheory.forget₂ (Rep k G) (ModuleCat k))

Equations

• Rep.instPreservesLimitsModuleCatForget₂ = Action.instPreservesLimitsForget (ModuleCat k) (MonCat.of G)

noncomputable instance Rep.instPreservesColimitsModuleCatForget₂ {k : Type u} {G : Type u} [CommRing k] [Monoid G] : CategoryTheory.Limits.PreservesColimits (CategoryTheory.forget₂ (Rep k G) (ModuleCat k))

Equations

• Rep.instPreservesColimitsModuleCatForget₂ = Action.instPreservesColimitsForget (ModuleCat k) (MonCat.of G)

theorem Rep.MonoidalCategory.braiding_hom_apply {k : Type u} {G : Type u} [CommRing k] [Monoid G] {A : Rep k G} {B : Rep k G} (x : CoeSort.coe A) (y : CoeSort.coe B) : (β_ A B).hom.hom (x ⊗ₜ[k] y) = y ⊗ₜ[k] x

theorem Rep.MonoidalCategory.braiding_inv_apply {k : Type u} {G : Type u} [CommRing k] [Monoid G] {A : Rep k G} {B : Rep k G} (x : CoeSort.coe A) (y : CoeSort.coe B) : (β_ A B).inv.hom (y ⊗ₜ[k] x) = x ⊗ₜ[k] y

noncomputable def Rep.linearization (k : Type u) (G : Type u) [CommRing k] [Monoid G] : CategoryTheory.MonoidalFunctor (Action (Type u) (MonCat.of G)) (Rep k G)

The monoidal functor sending a type H with a G-action to the induced k-linear G-representation on k[H].

Equations

• Rep.linearization k G = (ModuleCat.monoidalFree k).mapAction (MonCat.of G)

@[simp]

theorem Rep.linearization_obj_ρ {k : Type u} {G : Type u} [CommRing k] [Monoid G] (X : Action (Type u) (MonCat.of G)) (g : G) (x : X.V →₀ k) : (((Rep.linearization k G).obj X).ρ g) x = (Finsupp.lmapDomain k k (X.ρ g)) x

theorem Rep.linearization_of {k : Type u} {G : Type u} [CommRing k] [Monoid G] (X : Action (Type u) (MonCat.of G)) (g : G) (x : X.V) : (((Rep.linearization k G).obj X).ρ g) (Finsupp.single x 1) = Finsupp.single (X.ρ g x) 1

theorem Rep.linearization_single {k : Type u} {G : Type u} [CommRing k] [Monoid G] (X : Action (Type u) (MonCat.of G)) (g : G) (x : X.V) (r : k) : (((Rep.linearization k G).obj X).ρ g) (Finsupp.single x r) = Finsupp.single (X.ρ g x) r

@[simp]

theorem Rep.linearization_map_hom {k : Type u} {G : Type u} [CommRing k] [Monoid G] {X : Action (Type u) (MonCat.of G)} {Y : Action (Type u) (MonCat.of G)} (f : X ⟶ Y) : ((Rep.linearization k G).map f).hom = Finsupp.lmapDomain k k f.hom

theorem Rep.linearization_map_hom_single {k : Type u} {G : Type u} [CommRing k] [Monoid G] {X : Action (Type u) (MonCat.of G)} {Y : Action (Type u) (MonCat.of G)} (f : X ⟶ Y) (x : X.V) (r : k) : ((Rep.linearization k G).map f).hom (Finsupp.single x r) = Finsupp.single (f.hom x) r

@[simp]

theorem Rep.linearization_μ_hom {k : Type u} {G : Type u} [CommRing k] [Monoid G] (X : Action (Type u) (MonCat.of G)) (Y : Action (Type u) (MonCat.of G)) : ((Rep.linearization k G).μ X Y).hom = ↑(finsuppTensorFinsupp' k X.V Y.V)

@[simp]

theorem Rep.linearization_μ_inv_hom {k : Type u} {G : Type u} [CommRing k] [Monoid G] (X : Action (Type u) (MonCat.of G)) (Y : Action (Type u) (MonCat.of G)) : (CategoryTheory.inv ((Rep.linearization k G).μ X Y)).hom = ↑(finsuppTensorFinsupp' k X.V Y.V).symm

@[simp]

theorem Rep.linearization_ε_hom {k : Type u} {G : Type u} [CommRing k] [Monoid G] : (Rep.linearization k G).ε.hom = Finsupp.lsingle PUnit.unit

theorem Rep.linearization_ε_inv_hom_apply {k : Type u} {G : Type u} [CommRing k] [Monoid G] (r : k) : (CategoryTheory.inv (Rep.linearization k G).ε).hom (Finsupp.single PUnit.unit r) = r

noncomputable def Rep.linearizationTrivialIso (k : Type u) (G : Type u) [CommRing k] [Monoid G] (X : Type u) : (Rep.linearization k G).obj { V := X, ρ := 1 } ≅ Rep.trivial k G (X →₀ k)

The linearization of a type X on which G acts trivially is the trivial G-representation on k[X].

Equations

• Rep.linearizationTrivialIso k G X = Action.mkIso (CategoryTheory.Iso.refl ((Rep.linearization k G).obj { V := X, ρ := 1 }).V) ⋯

@[simp]

theorem Rep.linearizationTrivialIso_inv_hom_apply (k : Type u) (G : Type u) [CommRing k] [Monoid G] (X : Type u) (a : ↑((Rep.linearization k G).obj { V := X, ρ := 1 }).V) : (Rep.linearizationTrivialIso k G X).inv.hom a = a

@[simp]

theorem Rep.linearizationTrivialIso_hom_hom_apply (k : Type u) (G : Type u) [CommRing k] [Monoid G] (X : Type u) (a : ↑((Rep.linearization k G).obj { V := X, ρ := 1 }).V) : (Rep.linearizationTrivialIso k G X).hom.hom a = a

@[reducible, inline]

noncomputable abbrev Rep.ofMulAction (k : Type u) (G : Type u) [CommRing k] [Monoid G] (H : Type u) [MulAction G H] : Rep k G

Given a G-action on H, this is k[H] bundled with the natural representation G →* End(k[H]) as a term of type Rep k G.

Equations

• Rep.ofMulAction k G H = Rep.of (Representation.ofMulAction k G H)

noncomputable def Rep.leftRegular (k : Type u) (G : Type u) [CommRing k] [Monoid G] : Rep k G

The k-linear G-representation on k[G], induced by left multiplication.

Equations

• Rep.leftRegular k G = Rep.ofMulAction k G G

noncomputable def Rep.diagonal (k : Type u) (G : Type u) [CommRing k] [Monoid G] (n : ℕ) : Rep k G

The k-linear G-representation on k[Gⁿ], induced by left multiplication.

Equations

• Rep.diagonal k G n = Rep.ofMulAction k G (Fin n → G)

noncomputable def Rep.linearizationOfMulActionIso (k : Type u) (G : Type u) [CommRing k] [Monoid G] (H : Type u) [MulAction G H] : (Rep.linearization k G).obj (Action.ofMulAction G H) ≅ Rep.ofMulAction k G H

The linearization of a type H with a G-action is definitionally isomorphic to the k-linear G-representation on k[H] induced by the G-action on H.

Equations

• Rep.linearizationOfMulActionIso k G H = CategoryTheory.Iso.refl ((Rep.linearization k G).obj (Action.ofMulAction G H))

noncomputable def Rep.ofDistribMulAction (k : Type u) (G : Type u) (A : Type u) [CommRing k] [Monoid G] [AddCommGroup A] [Module k A] [DistribMulAction G A] [SMulCommClass G k A] : Rep k G

Turns a k-module A with a compatible DistribMulAction of a monoid G into a k-linear G-representation on A.

Equations

• Rep.ofDistribMulAction k G A = Rep.of (Representation.ofDistribMulAction k G A)

@[simp]

theorem Rep.ofDistribMulAction_ρ_apply_apply (k : Type u) (G : Type u) (A : Type u) [CommRing k] [Monoid G] [AddCommGroup A] [Module k A] [DistribMulAction G A] [SMulCommClass G k A] (g : G) (a : A) : ((Rep.ofDistribMulAction k G A).ρ g) a = g • a

noncomputable def Rep.ofAlgebraAut (R : Type) (S : Type) [CommRing R] [CommRing S] [Algebra R S] : Rep ℤ (S ≃ₐ[R] S)

Given an R-algebra S, the ℤ-linear representation associated to the natural action of S ≃ₐ[R] S on S.

Equations

• Rep.ofAlgebraAut R S = Rep.ofDistribMulAction ℤ (S ≃ₐ[R] S) S

noncomputable def Rep.ofMulDistribMulAction (M : Type) (G : Type) [Monoid M] [CommGroup G] [MulDistribMulAction M G] : Rep ℤ M

Turns a CommGroup G with a MulDistribMulAction of a monoid M into a ℤ-linear M-representation on Additive G.

Equations

• Rep.ofMulDistribMulAction M G = Rep.of (Representation.ofMulDistribMulAction M G)

@[simp]

theorem Rep.ofMulDistribMulAction_ρ_apply_apply (M : Type) (G : Type) [Monoid M] [CommGroup G] [MulDistribMulAction M G] (g : M) (a : Additive G) : ((Rep.ofMulDistribMulAction M G).ρ g) a = Additive.ofMul (g • Additive.toMul a)

noncomputable def Rep.ofAlgebraAutOnUnits (R : Type) (S : Type) [CommRing R] [CommRing S] [Algebra R S] : Rep ℤ (S ≃ₐ[R] S)

Given an R-algebra S, the ℤ-linear representation associated to the natural action of S ≃ₐ[R] S on Sˣ.

Equations

• Rep.ofAlgebraAutOnUnits R S = Rep.ofMulDistribMulAction (S ≃ₐ[R] S) Sˣ

noncomputable def Rep.leftRegularHom {k : Type u} {G : Type u} [CommRing k] [Monoid G] (A : Rep k G) (x : CoeSort.coe A) : Rep.ofMulAction k G G ⟶ A

Given an element x : A, there is a natural morphism of representations k[G] ⟶ A sending g ↦ A.ρ(g)(x).

Equations

• A.leftRegularHom x = { hom := (Finsupp.lift (↑A.V) k G) fun (g : G) => (A.ρ g) x, comm := ⋯ }

@[simp]

theorem Rep.leftRegularHom_hom {k : Type u} {G : Type u} [CommRing k] [Monoid G] (A : Rep k G) (x : CoeSort.coe A) : (A.leftRegularHom x).hom = (Finsupp.lift (↑A.V) k G) fun (g : G) => (A.ρ g) x

theorem Rep.leftRegularHom_apply {k : Type u} {G : Type u} [CommRing k] [Monoid G] {A : Rep k G} (x : CoeSort.coe A) : (A.leftRegularHom x).hom (Finsupp.single 1 1) = x

noncomputable def Rep.leftRegularHomEquiv {k : Type u} {G : Type u} [CommRing k] [Monoid G] (A : Rep k G) : (Rep.ofMulAction k G G ⟶ A) ≃ₗ[k] CoeSort.coe A

Given a k-linear G-representation A, there is a k-linear isomorphism between representation morphisms Hom(k[G], A) and A.

Equations

• One or more equations did not get rendered due to their size.

@[simp]

theorem Rep.leftRegularHomEquiv_symm_apply {k : Type u} {G : Type u} [CommRing k] [Monoid G] (A : Rep k G) (x : CoeSort.coe A) : A.leftRegularHomEquiv.symm x = A.leftRegularHom x

@[simp]

theorem Rep.leftRegularHomEquiv_apply {k : Type u} {G : Type u} [CommRing k] [Monoid G] (A : Rep k G) (f : Rep.ofMulAction k G G ⟶ A) : A.leftRegularHomEquiv f = f.hom (Finsupp.single 1 1)

theorem Rep.leftRegularHomEquiv_symm_single {k : Type u} {G : Type u} [CommRing k] [Monoid G] {A : Rep k G} (x : CoeSort.coe A) (g : G) : (A.leftRegularHomEquiv.symm x).hom (Finsupp.single g 1) = (A.ρ g) x

noncomputable def Rep.ihom {k : Type u} {G : Type u} [CommRing k] [Group G] (A : Rep k G) : CategoryTheory.Functor (Rep k G) (Rep k G)

Given a k-linear G-representation (A, ρ₁), this is the 'internal Hom' functor sending (B, ρ₂) to the representation Homₖ(A, B) that maps g : G and f : A →ₗ[k] B to (ρ₂ g) ∘ₗ f ∘ₗ (ρ₁ g⁻¹).

Equations

• One or more equations did not get rendered due to their size.

@[simp]

theorem Rep.ihom_obj {k : Type u} {G : Type u} [CommRing k] [Group G] (A : Rep k G) (B : Rep k G) : A.ihom.obj B = Rep.of (A.ρ.linHom B.ρ)

@[simp]

theorem Rep.ihom_map_hom {k : Type u} {G : Type u} [CommRing k] [Group G] (A : Rep k G) {X : Rep k G} {Y : Rep k G} (f : X ⟶ Y) : (A.ihom.map f).hom = ModuleCat.ofHom ((LinearMap.llcomp k (CoeSort.coe A) (CoeSort.coe X) (CoeSort.coe Y)) f.hom)

@[simp]

theorem Rep.ihom_obj_ρ_apply {k : Type u} {G : Type u} [CommRing k] [Group G] {A : Rep k G} {B : Rep k G} (g : G) (x : CoeSort.coe A →ₗ[k] CoeSort.coe B) : ((A.ihom.obj B).ρ g) x = B.ρ g ∘ₗ x ∘ₗ A.ρ g⁻¹

noncomputable def Rep.homEquiv {k : Type u} {G : Type u} [CommRing k] [Group G] (A : Rep k G) (B : Rep k G) (C : Rep k G) : (CategoryTheory.MonoidalCategory.tensorObj A B ⟶ C) ≃ (B ⟶ A.ihom.obj C)

Given a k-linear G-representation A, this is the Hom-set bijection in the adjunction A ⊗ - ⊣ ihom(A, -). It sends f : A ⊗ B ⟶ C to a Rep k G morphism defined by currying the k-linear map underlying f, giving a map A →ₗ[k] B →ₗ[k] C, then flipping the arguments.

Equations

• One or more equations did not get rendered due to their size.

theorem Rep.homEquiv_apply_hom {k : Type u} {G : Type u} [CommRing k] [Group G] {A : Rep k G} {B : Rep k G} {C : Rep k G} (f : CategoryTheory.MonoidalCategory.tensorObj A B ⟶ C) : ((A.homEquiv B C) f).hom = (TensorProduct.curry f.hom).flip

Porting note: if we generate this with @[simps] the linter complains some types in the LHS simplify.

theorem Rep.homEquiv_symm_apply_hom {k : Type u} {G : Type u} [CommRing k] [Group G] {A : Rep k G} {B : Rep k G} {C : Rep k G} (f : B ⟶ A.ihom.obj C) : ((A.homEquiv B C).symm f).hom = (TensorProduct.uncurry k (CoeSort.coe A) (CoeSort.coe B) (CoeSort.coe C)) (LinearMap.flip f.hom)

Porting note: if we generate this with @[simps] the linter complains some types in the LHS simplify.

noncomputable instance Rep.instMonoidalClosed {k : Type u} {G : Type u} [CommRing k] [Group G] : CategoryTheory.MonoidalClosed (Rep k G)

Equations

• One or more equations did not get rendered due to their size.

@[simp]

theorem Rep.ihom_obj_ρ_def {k : Type u} {G : Type u} [CommRing k] [Group G] (A : Rep k G) (B : Rep k G) : ((CategoryTheory.ihom A).obj B).ρ = (A.ihom.obj B).ρ

@[simp]

theorem Rep.homEquiv_def {k : Type u} {G : Type u} [CommRing k] [Group G] (A : Rep k G) (B : Rep k G) (C : Rep k G) : (CategoryTheory.ihom.adjunction A).homEquiv B C = A.homEquiv B C

@[simp]

theorem Rep.ihom_ev_app_hom {k : Type u} {G : Type u} [CommRing k] [Group G] (A : Rep k G) (B : Rep k G) : ((CategoryTheory.ihom.ev A).app B).hom = (TensorProduct.uncurry k (CoeSort.coe A) (CoeSort.coe A →ₗ[k] CoeSort.coe B) (CoeSort.coe B)) LinearMap.id.flip

@[simp]

theorem Rep.ihom_coev_app_hom {k : Type u} {G : Type u} [CommRing k] [Group G] (A : Rep k G) (B : Rep k G) : ((CategoryTheory.ihom.coev A).app B).hom = (TensorProduct.mk k (CoeSort.coe A) ↑((CategoryTheory.Functor.id (Rep k G)).obj B).V).flip

noncomputable def Rep.MonoidalClosed.linearHomEquiv {k : Type u} {G : Type u} [CommRing k] [Group G] (A : Rep k G) (B : Rep k G) (C : Rep k G) : (CategoryTheory.MonoidalCategory.tensorObj A B ⟶ C) ≃ₗ[k] B ⟶ (CategoryTheory.ihom A).obj C

There is a k-linear isomorphism between the sets of representation morphismsHom(A ⊗ B, C) and Hom(B, Homₖ(A, C)).

Equations

• One or more equations did not get rendered due to their size.

noncomputable def Rep.MonoidalClosed.linearHomEquivComm {k : Type u} {G : Type u} [CommRing k] [Group G] (A : Rep k G) (B : Rep k G) (C : Rep k G) : (CategoryTheory.MonoidalCategory.tensorObj A B ⟶ C) ≃ₗ[k] A ⟶ (CategoryTheory.ihom B).obj C

There is a k-linear isomorphism between the sets of representation morphismsHom(A ⊗ B, C) and Hom(A, Homₖ(B, C)).

Equations

• Rep.MonoidalClosed.linearHomEquivComm A B C = (CategoryTheory.Linear.homCongr k (β_ A B) (CategoryTheory.Iso.refl C)).trans (Rep.MonoidalClosed.linearHomEquiv B A C)

@[simp]

theorem Rep.MonoidalClosed.linearHomEquiv_hom {k : Type u} {G : Type u} [CommRing k] [Group G] {A : Rep k G} {B : Rep k G} {C : Rep k G} (f : CategoryTheory.MonoidalCategory.tensorObj A B ⟶ C) : ((Rep.MonoidalClosed.linearHomEquiv A B C) f).hom = (TensorProduct.curry f.hom).flip

@[simp]

theorem Rep.MonoidalClosed.linearHomEquivComm_hom {k : Type u} {G : Type u} [CommRing k] [Group G] {A : Rep k G} {B : Rep k G} {C : Rep k G} (f : CategoryTheory.MonoidalCategory.tensorObj A B ⟶ C) : ((Rep.MonoidalClosed.linearHomEquivComm A B C) f).hom = TensorProduct.curry f.hom

theorem Rep.MonoidalClosed.linearHomEquiv_symm_hom {k : Type u} {G : Type u} [CommRing k] [Group G] {A : Rep k G} {B : Rep k G} {C : Rep k G} (f : B ⟶ (CategoryTheory.ihom A).obj C) : ((Rep.MonoidalClosed.linearHomEquiv A B C).symm f).hom = (TensorProduct.uncurry k (CoeSort.coe A) (CoeSort.coe B) (CoeSort.coe C)) (LinearMap.flip f.hom)

theorem Rep.MonoidalClosed.linearHomEquivComm_symm_hom {k : Type u} {G : Type u} [CommRing k] [Group G] {A : Rep k G} {B : Rep k G} {C : Rep k G} (f : A ⟶ (CategoryTheory.ihom B).obj C) : ((Rep.MonoidalClosed.linearHomEquivComm A B C).symm f).hom = (TensorProduct.uncurry k (CoeSort.coe A) (CoeSort.coe B) (CoeSort.coe C)) f.hom

noncomputable def Representation.repOfTprodIso {k : Type u} {G : Type u} [CommRing k] [Monoid G] {V : Type u} {W : Type u} [AddCommGroup V] [AddCommGroup W] [Module k V] [Module k W] (ρ : Representation k G V) (τ : Representation k G W) : Rep.of (ρ.tprod τ) ≅ CategoryTheory.MonoidalCategory.tensorObj (Rep.of ρ) (Rep.of τ)

Tautological isomorphism to help Lean in typechecking.

Equations

• ρ.repOfTprodIso τ = CategoryTheory.Iso.refl (Rep.of (ρ.tprod τ))

theorem Representation.repOfTprodIso_apply {k : Type u} {G : Type u} [CommRing k] [Monoid G] {V : Type u} {W : Type u} [AddCommGroup V] [AddCommGroup W] [Module k V] [Module k W] (ρ : Representation k G V) (τ : Representation k G W) (x : TensorProduct k V W) : (ρ.repOfTprodIso τ).hom.hom x = x

theorem Representation.repOfTprodIso_inv_apply {k : Type u} {G : Type u} [CommRing k] [Monoid G] {V : Type u} {W : Type u} [AddCommGroup V] [AddCommGroup W] [Module k V] [Module k W] (ρ : Representation k G V) (τ : Representation k G W) (x : TensorProduct k V W) : (ρ.repOfTprodIso τ).inv.hom x = x

The categorical equivalence Rep k G ≌ Module.{u} (MonoidAlgebra k G).

theorem Rep.to_Module_monoidAlgebra_map_aux {k : Type u_1} {G : Type u_2} [CommRing k] [Monoid G] (V : Type u_3) (W : Type u_4) [AddCommGroup V] [AddCommGroup W] [Module k V] [Module k W] (ρ : G →* V →ₗ[k] V) (σ : G →* W →ₗ[k] W) (f : V →ₗ[k] W) (w : ∀ (g : G), f ∘ₗ ρ g = σ g ∘ₗ f) (r : MonoidAlgebra k G) (x : V) : f ((((MonoidAlgebra.lift k G (V →ₗ[k] V)) ρ) r) x) = (((MonoidAlgebra.lift k G (W →ₗ[k] W)) σ) r) (f x)

Auxiliary lemma for toModuleMonoidAlgebra.

noncomputable def Rep.toModuleMonoidAlgebraMap {k : Type u} {G : Type u} [CommRing k] [Monoid G] {V : Rep k G} {W : Rep k G} (f : V ⟶ W) : ModuleCat.of (MonoidAlgebra k G) V.ρ.asModule ⟶ ModuleCat.of (MonoidAlgebra k G) W.ρ.asModule

Auxiliary definition for toModuleMonoidAlgebra.

Equations

• Rep.toModuleMonoidAlgebraMap f = let __src := f.hom; { toAddHom := __src.toAddHom, map_smul' := ⋯ }

noncomputable def Rep.toModuleMonoidAlgebra {k : Type u} {G : Type u} [CommRing k] [Monoid G] : CategoryTheory.Functor (Rep k G) (ModuleCat (MonoidAlgebra k G))

Functorially convert a representation of G into a module over MonoidAlgebra k G.

Equations

• One or more equations did not get rendered due to their size.

noncomputable def Rep.ofModuleMonoidAlgebra {k : Type u} {G : Type u} [CommRing k] [Monoid G] : CategoryTheory.Functor (ModuleCat (MonoidAlgebra k G)) (Rep k G)

Functorially convert a module over MonoidAlgebra k G into a representation of G.

Equations

• One or more equations did not get rendered due to their size.

theorem Rep.ofModuleMonoidAlgebra_obj_coe {k : Type u} {G : Type u} [CommRing k] [Monoid G] (M : ModuleCat (MonoidAlgebra k G)) : CoeSort.coe (Rep.ofModuleMonoidAlgebra.obj M) = RestrictScalars k (MonoidAlgebra k G) ↑M

theorem Rep.ofModuleMonoidAlgebra_obj_ρ {k : Type u} {G : Type u} [CommRing k] [Monoid G] (M : ModuleCat (MonoidAlgebra k G)) : (Rep.ofModuleMonoidAlgebra.obj M).ρ = Representation.ofModule ↑M

noncomputable def Rep.counitIsoAddEquiv {k : Type u} {G : Type u} [CommRing k] [Monoid G] {M : ModuleCat (MonoidAlgebra k G)} : ↑((Rep.ofModuleMonoidAlgebra.comp Rep.toModuleMonoidAlgebra).obj M) ≃+ ↑M

Auxiliary definition for equivalenceModuleMonoidAlgebra.

Equations

• Rep.counitIsoAddEquiv = id ((Representation.ofModule ↑M).asModuleEquiv.trans (RestrictScalars.addEquiv k (MonoidAlgebra k G) ↑M))

noncomputable def Rep.unitIsoAddEquiv {k : Type u} {G : Type u} [CommRing k] [Monoid G] {V : Rep k G} : CoeSort.coe V ≃+ CoeSort.coe ((Rep.toModuleMonoidAlgebra.comp Rep.ofModuleMonoidAlgebra).obj V)

Auxiliary definition for equivalenceModuleMonoidAlgebra.

Equations

• Rep.unitIsoAddEquiv = id (V.ρ.asModuleEquiv.symm.trans (RestrictScalars.addEquiv k (MonoidAlgebra k G) V.ρ.asModule).symm)

noncomputable def Rep.counitIso {k : Type u} {G : Type u} [CommRing k] [Monoid G] (M : ModuleCat (MonoidAlgebra k G)) : (Rep.ofModuleMonoidAlgebra.comp Rep.toModuleMonoidAlgebra).obj M ≅ M

Auxiliary definition for equivalenceModuleMonoidAlgebra.

Equations

• Rep.counitIso M = (let __src := Rep.counitIsoAddEquiv; { toFun := __src.toFun, map_add' := ⋯, map_smul' := ⋯, invFun := __src.invFun, left_inv := ⋯, right_inv := ⋯ }).toModuleIso'

theorem Rep.unit_iso_comm {k : Type u} {G : Type u} [CommRing k] [Monoid G] (V : Rep k G) (g : G) (x : CoeSort.coe V) : Rep.unitIsoAddEquiv ((V.ρ g).toFun x) = ((Rep.ofModuleMonoidAlgebra.obj (Rep.toModuleMonoidAlgebra.obj V)).ρ g).toFun (Rep.unitIsoAddEquiv x)

noncomputable def Rep.unitIso {k : Type u} {G : Type u} [CommRing k] [Monoid G] (V : Rep k G) : V ≅ (Rep.toModuleMonoidAlgebra.comp Rep.ofModuleMonoidAlgebra).obj V

Auxiliary definition for equivalenceModuleMonoidAlgebra.

Equations

• One or more equations did not get rendered due to their size.

noncomputable def Rep.equivalenceModuleMonoidAlgebra {k : Type u} {G : Type u} [CommRing k] [Monoid G] : Rep k G ≌ ModuleCat (MonoidAlgebra k G)

The categorical equivalence Rep k G ≌ ModuleCat (MonoidAlgebra k G).

Equations

• One or more equations did not get rendered due to their size.