Documentation

TauCeti.RepresentationTheory.Rep.TensorInvariant

Tensoring a representation with an invariant #

For an invariant y of a representation N, this file constructs the morphism of representations M ⟶ M ⊗ N that sends m to m ⊗ₜ y. It also records its additivity, linearity, naturality in both representations, and compatibility with the associator and braiding, as well as restriction along arbitrary homomorphisms of groups.

noncomputable def Rep.tensorInvariant {k : Type u} {G : Type v} [CommRing k] [Group G] (M : Rep k G) {N : Rep k G} (y : ↥N.ρ.invariants) :

For an invariant y of the representation N, the morphism of representations M ⟶ M ⊗ N, m ↦ m ⊗ₜ y.

Instances For
    @[simp]
    theorem Rep.tensorInvariant_hom_apply {k : Type u} {G : Type v} [CommRing k] [Group G] (M : Rep k G) {N : Rep k G} (y : ↥N.ρ.invariants) (m : ↑M) :
    (Hom.hom (M.tensorInvariant y)) m = m ⊗ₜ[k] ↑y

    The morphism m ↦ m ⊗ₜ y evaluated at m.

    @[simp]
    theorem Rep.resMap_tensorInvariant {k : Type u} {G : Type v} [CommRing k] [Group G] (M N : Rep k G) {H : Type w} [Group H] (f : H →* G) (y : ↥N.ρ.invariants) :

    Restricting the map m ↦ m ⊗ y along a homomorphism of groups gives the map defined by the restricted invariant.

    @[simp]
    theorem Rep.tensorInvariant_zero {k : Type u} {G : Type v} [CommRing k] [Group G] (M : Rep k G) {N : Rep k G} :

    m ↦ m ⊗ 0 is the zero morphism.

    @[simp]
    theorem Rep.tensorInvariant_add {k : Type u} {G : Type v} [CommRing k] [Group G] (M : Rep k G) {N : Rep k G} (y z : ↥N.ρ.invariants) :

    m ↦ m ⊗ y is additive in y.

    @[simp]
    theorem Rep.tensorInvariant_smul {k : Type u} {G : Type v} [CommRing k] [Group G] (M : Rep k G) {N : Rep k G} (c : k) (y : ↥N.ρ.invariants) :

    m ↦ m ⊗ y is k-linear in y.

    After braiding, tensoring with an invariant is natural in the other factor.

    theorem Rep.tensorInvariant_comp_whiskerLeft {k : Type u} {G : Type v} [CommRing k] [Group G] (M : Rep k G) {N N' : Rep k G} (g : N ⟶ N') (y : ↥N.ρ.invariants) (y' : ↥N'.ρ.invariants) (hy : (Hom.hom g) ↑y = ↑y') :

    m ↦ m ⊗ y is natural in N: composing with M ◁ g gives m ↦ m ⊗ g y.

    Tensoring M ⊗ N with an invariant and then reassociating is tensoring the second factor N with that invariant.

    Tensoring M with an invariant of N, tensoring the result on the right by P, and reassociating puts that invariant between the two original factors.

    theorem TauCeti.Rep.tensorInvariant_braiding_hom_apply {k : Type u} {G : Type v} [CommRing k] [Group G] {M N : Rep k G} (x : ↥M.ρ.invariants) (y : ↑N) :

    Braiding the tensor of a vector with an invariant puts the invariant first.

    @[simp]

    Tensoring a scalar of the trivial representation with an invariant x, braiding, and applying the right unitor sends c to c • x.

    @[simp]

    Tensoring with the invariant 1 of the trivial representation, then braiding and applying the left unitor, is the identity.

    theorem Rep.resMap_tensorInvariant_braiding {k : Type u} {G : Type v} [CommRing k] [Group G] {M : Rep k G} (N : Rep k G) {H : Type w} [Group H] (f : H →* G) (x : ↥M.ρ.invariants) (x' : ↥(res f M).ρ.invariants) (hx : ↑x' = ↑x) :

    Restricting y ↦ x ⊗ₜ y along a monoid homomorphism gives the same map for the restricted representations, tensoring with x viewed as an invariant of the restriction.