Theorems · Definition · group theory

Representation.Equiv.invFun

{A : Type u_1} →
  {G : Type u_2} →
    {V : Type u_3} →
      {W : Type u_4} →
        [inst : Semiring A] →
          [inst_1 : Monoid G] →
            [inst_2 : AddCommMonoid V] →
              [inst_3 : AddCommMonoid W] →
                [inst_4 : Module A V] →
                  [inst_5 : Module A W] → {ρ : Representation A G V} → {σ : Representation A G W} → ρ.Equiv σ → W → V

The backward map of an equivalence. Do NOT use e.invFun directly. Use the coercion of e.symm instead.

Defined in

Mathlib.RepresentationTheory.Intertwining

Cited by

7 results in Mathlib

Foundations

Depth 34 from the axioms · uses propext, Quot.sound

Assumes

SemiringMonoidAddCommMonoidAddCommMonoidModuleModule