Equations
- CRep R G = ContAction (TopModuleCat R) G
Instances For
Equations
Equations
Equations
- CRep.instCoeSortType = { coe := fun (V : CRep R G) => ↑((CategoryTheory.forget₂ (CRep R G) (TopModuleCat R)).obj V).toModuleCat }
Equations
- V.toTopModuleCat = (CategoryTheory.forget₂ (CRep R G) (TopModuleCat R)).obj V
Instances For
The underlying morphism in TopModuleCat induced by a morphism in CRep.
Equations
- CRep.toTopModuleCatMap f = (CategoryTheory.forget₂ (CRep R G) (TopModuleCat R)).map f
Instances For
Instances For
Equations
Instances For
Equations
- V.act g v = (CategoryTheory.ConcreteCategory.hom (CRep.toTop.map (V.toAction.ρ g))) v
Instances For
Equations
- V.toRep = ((CategoryTheory.forget₂ (TopModuleCat R) (ModuleCat R)).mapAction G).obj V.toAction
Instances For
Equations
- CRep.instCoeRep = { coe := CRep.toRep }
Instances For
From joint continuity of the action map G × V → V, deduce pointwise continuity in V.
Upgrade ((Action.ρ V) g).hom to a morphism in TopModuleCat using pointwise continuity.
Equations
- CRep.repActiontoTopModuleCatHom V hcont g = TopModuleCat.ofHom { toLinearMap := V.ρ g, cont := ⋯ }
Instances For
The upgraded morphism sends 1 to the identity.
The upgraded morphism respects multiplication (with the Action convention).
Assemble the upgraded morphisms into a monoid hom G →* End (TopModuleCat.of R V).
Equations
- CRep.repActiontoTopModuleCatEnd V hcont = { toFun := CRep.repActiontoTopModuleCatHom V hcont, map_one' := ⋯, map_mul' := ⋯ }
Instances For
Pointwise simp lemma for the upgraded End action.
The Action (TopModuleCat R) G obtained from V : Rep R G and a continuity hypothesis.
Equations
- CRep.ofRepAction V hcont = { V := TopModuleCat.of R ↑V.V, ρ := CRep.repActiontoTopModuleCatEnd V hcont }
Instances For
Joint continuity of the action map for ofRepAction.
Upgrade V : Rep R G to CRep R G assuming the action map is jointly continuous.
Equations
- CRep.ofRep V hcont = { obj := CRep.ofRepAction V hcont, property := ⋯ }
Instances For
Upgrade ρ : ContinuousRep R G V to an object of CRep R G.
This composes Rep.of with CRep.ofRep.
Equations
- CRep.of ρ = CRep.ofRep (Rep.of ↑ρ) ⋯