the grothendieck construction for enriched internal and
play

The Grothendieck Construction for Enriched, Internal and -Categories - PowerPoint PPT Presentation

The Grothendieck Construction for Enriched, Internal and -Categories Liang Ze Wong Final Exam 26 Feb 2019 Publications BW1 Jonathan Beardsley and Liang Ze Wong. The enriched Grothendieck construction . Advances in Math, 2019. BW2 . The


  1. Examples For c ∈ C , let C / c be the slice category over c : x y c g ◦− Have C / • : C → Cat sending g : c → d to C / c − − − − − − → C / d . ( C / • ) ⋊ C has objects ( x → c , c ) and morphisms: x y g c d

  2. Examples For c ∈ C , let C / c be the slice category over c : x y c g ◦− Have C / • : C → Cat sending g : c → d to C / c − − − − − − → C / d . ( C / • ) ⋊ C has objects ( x → c , c ) and morphisms: x y g c d ( C / • ) ⋊ C = Arr C and Arr C → C is the codomain functor.

  3. Examples We have a functor Mod • : Ring op → Cat sending f : R → S to f ∗ : Mod S → Mod R .

  4. Examples We have a functor Mod • : Ring op → Cat sending f : R → S to f ∗ : Mod S → Mod R . Mod • ⋊ Ring op has objects ( M , R ) and morphisms:

  5. Examples We have a functor Mod • : Ring op → Cat sending f : R → S to f ∗ : Mod S → Mod R . Mod • ⋊ Ring op has objects ( M , R ) and morphisms: ( ) , ( M , R ) − − − − − − − − − − − → ( N , S )

  6. Examples We have a functor Mod • : Ring op → Cat sending f : R → S to f ∗ : Mod S → Mod R . Mod • ⋊ Ring op has objects ( M , R ) and morphisms: f − → S ) ( , R ( M , R ) − − − − − − − − − − − → ( N , S )

  7. Examples We have a functor Mod • : Ring op → Cat sending f : R → S to f ∗ : Mod S → Mod R . Mod • ⋊ Ring op has objects ( M , R ) and morphisms: f − → S ) ( M → f ∗ N , R ( M , R ) − − − − − − − − − − − → ( N , S )

  8. Examples We have a functor Mod • : Ring op → Cat sending f : R → S to f ∗ : Mod S → Mod R . Mod • ⋊ Ring op has objects ( M , R ) and morphisms: f − → S ) ( M → f ∗ N , R ( M , R ) − − − − − − − − − − − → ( N , S ) This is the global module category Mod .

  9. The Skew Group Ring and Smash Products Let G be a group.

  10. The Skew Group Ring and Smash Products Let G be a group. Instead of G acting on another group, suppose it acts on a k -algebra A G × A → A .

  11. The Skew Group Ring and Smash Products Let G be a group. Instead of G acting on another group, suppose it acts on a k -algebra A G × A → A . Can form the skew group ring A ⋊ G

  12. The Skew Group Ring and Smash Products Let G be a group. Instead of G acting on another group, suppose it acts on a k -algebra A G × A → A . Can form the skew group ring A ⋊ G = � g ∈ G A where ( a , g ) · ( b , h ) = ( a ( g · b ) , gh ) .

  13. The Skew Group Ring and Smash Products Let G be a group. Instead of G acting on another group, suppose it acts on a k -algebra A G × A → A . Can form the skew group ring A ⋊ G = � g ∈ G A where ( a , g ) · ( b , h ) = ( a ( g · b ) , gh ) . But we don’t have an algebra map A ⋊ G → kG . . .

  14. Interlude: Comonoids and Comodules kG is both an algebra and a coalgebra , with comultiplication : ∆: kG → kG ⊗ kG , g → g ⊗ g .

  15. Interlude: Comonoids and Comodules kG is both an algebra and a coalgebra , with comultiplication : ∆: kG → kG ⊗ kG , g → g ⊗ g . Can define comodules for any coalgebra C , with coactions M → M ⊗ C .

  16. Interlude: Comonoids and Comodules kG is both an algebra and a coalgebra , with comultiplication : ∆: kG → kG ⊗ kG , g → g ⊗ g . Can define comodules for any coalgebra C , with coactions M → M ⊗ C . We can similarly define comonoids and their comodules in any monoidal category ( V , ⊗ , 1 ).

  17. Interlude: Comonoids and Comodules kG is both an algebra and a coalgebra , with comultiplication : ∆: kG → kG ⊗ kG , g → g ⊗ g . Can define comodules for any coalgebra C , with coactions M → M ⊗ C . We can similarly define comonoids and their comodules in any monoidal category ( V , ⊗ , 1 ). Any X ∈ Set has a unique comonoid structure

  18. Interlude: Comonoids and Comodules kG is both an algebra and a coalgebra , with comultiplication : ∆: kG → kG ⊗ kG , g → g ⊗ g . Can define comodules for any coalgebra C , with coactions M → M ⊗ C . We can similarly define comonoids and their comodules in any monoidal category ( V , ⊗ , 1 ). Any X ∈ Set has a unique comonoid structure, and TFAE: a function f : W → X

  19. Interlude: Comonoids and Comodules kG is both an algebra and a coalgebra , with comultiplication : ∆: kG → kG ⊗ kG , g → g ⊗ g . Can define comodules for any coalgebra C , with coactions M → M ⊗ C . We can similarly define comonoids and their comodules in any monoidal category ( V , ⊗ , 1 ). Any X ∈ Set has a unique comonoid structure, and TFAE: a function f : W → X an X - grading W = � x ∈ X W x

  20. Interlude: Comonoids and Comodules kG is both an algebra and a coalgebra , with comultiplication : ∆: kG → kG ⊗ kG , g → g ⊗ g . Can define comodules for any coalgebra C , with coactions M → M ⊗ C . We can similarly define comonoids and their comodules in any monoidal category ( V , ⊗ , 1 ). Any X ∈ Set has a unique comonoid structure, and TFAE: a function f : W → X an X - grading W = � x ∈ X W x an X - coaction W → W × X

  21. Interlude: Comonoids and Comodules kG is both an algebra and a coalgebra , with comultiplication : ∆: kG → kG ⊗ kG , g → g ⊗ g . Can define comodules for any coalgebra C , with coactions M → M ⊗ C . We can similarly define comonoids and their comodules in any monoidal category ( V , ⊗ , 1 ). Any X ∈ Set has a unique comonoid structure, and TFAE: a function f : W → X an X - grading W = � x ∈ X W x an X - coaction W → W × X

  22. Interlude: Comonoids and Comodules kG is both an algebra and a coalgebra , with comultiplication : ∆: kG → kG ⊗ kG , g → g ⊗ g . Can define comodules for any coalgebra C , with coactions M → M ⊗ C . We can similarly define comonoids and their comodules in any monoidal category ( V , ⊗ , 1 ). Any X ∈ Set has a unique comonoid structure, and TFAE: a function f : W → X an X - grading W = � x ∈ X W x an X - coaction W → W × X In Vect k , these are not equivalent.

  23. The Skew Group Ring and Smash Products We don’t have an algebra map from A ⋊ G = � g ∈ G A to kG .

  24. The Skew Group Ring and Smash Products We don’t have an algebra map from A ⋊ G = � g ∈ G A to kG . But we do have a G-grading on A ⋊ G ,

  25. The Skew Group Ring and Smash Products We don’t have an algebra map from A ⋊ G = � g ∈ G A to kG . But we do have a G-grading on A ⋊ G , or equivalently, a kG - coaction on A ⋊ G ( a , g ) �→ ( a , g ) ⊗ g .

  26. The Skew Group Ring and Smash Products We don’t have an algebra map from A ⋊ G = � g ∈ G A to kG . But we do have a G-grading on A ⋊ G , or equivalently, a kG - coaction on A ⋊ G ( a , g ) �→ ( a , g ) ⊗ g . The coaction perspective allows us to replace kG with any bialgebra or Hopf algebra H .

  27. The Skew Group Ring and Smash Products Theorem (Cohen-Montgomery 1984) For G a group, there is a bijective correspondence:     ⋊  G-graded algebras  G-actions     ∼ = G × A → A    A ⋊ G  fibers  

  28. The Skew Group Ring and Smash Products Theorem (Cohen-Montgomery 1984) For G a group, there is a bijective correspondence:     ⋊  G-graded algebras  G-actions     ∼ = G × A → A    A ⋊ G  fibers   Theorem (v.d.Bergh 1984, Blattner-Montgomery 1985) For H a Hopf algebra, there is a bijective correspondence:     ⋊  H-module algebras   H-comodule algebras      ∼ = H ⊗ A → A    A ⋊ H  coinv    

  29. Grothendieck Smash Product Construction A ⋊ H N • ⋊ C k -linear many objects Semi-direct Product N ⋊ G

  30. ? Grothendieck Smash Product Construction A ⋊ H N • ⋊ C k -linear many objects Semi-direct Product N ⋊ G

  31. Enriched and Internal Categories A small category C has: a set of objects C 0 for all x , y ∈ C 0 , a set of arrows Hom C ( x , y )

  32. Enriched and Internal Categories A small category C has: a set of objects C 0 for all x , y ∈ C 0 , a set of arrows Hom C ( x , y ) Can replace ( Set , × , {∗} ) with any monoidal category ( V , ⊗ , 1 ):

  33. Enriched and Internal Categories A small category C has: a set of objects C 0 for all x , y ∈ C 0 , a set of arrows Hom C ( x , y ) Can replace ( Set , × , {∗} ) with any monoidal category ( V , ⊗ , 1 ): A V -enriched category C has: a set of objects C 0 for all x , y ∈ C 0 , arrows Hom C ( x , y ) ∈ V

  34. Enriched and Internal Categories A small category C has: a set of objects C 0 for all x , y ∈ C 0 , a set of arrows Hom C ( x , y ) Can replace ( Set , × , {∗} ) with any monoidal category ( V , ⊗ , 1 ): A V -enriched category C has: a set of objects C 0 for all x , y ∈ C 0 , arrows Hom C ( x , y ) ∈ V A V -internal category C has: objects C 0 ∈ V arrows C 1 ∈ V

  35. Enriched and Internal Categories A small category C has: a set of objects C 0 for all x , y ∈ C 0 , a set of arrows Hom C ( x , y ) Can replace ( Set , × , {∗} ) with any monoidal category ( V , ⊗ , 1 ): A V -enriched category C has: a set of objects C 0 for all x , y ∈ C 0 , arrows Hom C ( x , y ) ∈ V A V -internal category C has: objects C 0 ∈ V objects C 0 ∈ Comon ( V ) arrows C 1 ∈ V arrows C 1 ∈ C 0 Comod C 0

  36. Enriched and Internal Categories for ( Vect k , ⊗ k , k )

  37. Enriched and Internal Categories for ( Vect k , ⊗ k , k ) A Vect k -enriched category is a k -linear category C with: a set of objects C 0 for all x , y ∈ C 0 , a k -vector space Hom C ( x , y )

  38. Enriched and Internal Categories for ( Vect k , ⊗ k , k ) A Vect k -enriched category is a k -linear category C with: a set of objects C 0 for all x , y ∈ C 0 , a k -vector space Hom C ( x , y ) A e.g. a k -algebra A gives a k -linear category ∗

  39. Enriched and Internal Categories for ( Vect k , ⊗ k , k ) A Vect k -enriched category is a k -linear category C with: a set of objects C 0 for all x , y ∈ C 0 , a k -vector space Hom C ( x , y ) A e.g. a k -algebra A gives a k -linear category ∗ A many-object enriched category replaces ∗ with any set.

  40. Enriched and Internal Categories for ( Vect k , ⊗ k , k ) A Vect k -enriched category is a k -linear category C with: a set of objects C 0 for all x , y ∈ C 0 , a k -vector space Hom C ( x , y ) A e.g. a k -algebra A gives a k -linear category ∗ A many-object enriched category replaces ∗ with any set. Any k -linear category gives rise to a Vect k -internal category with: objects kC 0 arrows ⊕ x , y Hom C ( x , y )

  41. Enriched and Internal Categories for ( Vect k , ⊗ k , k ) A Vect k -enriched category is a k -linear category C with: a set of objects C 0 for all x , y ∈ C 0 , a k -vector space Hom C ( x , y ) A e.g. a k -algebra A gives a k -linear category ∗ A many-object enriched category replaces ∗ with any set. Any k -linear category gives rise to a Vect k -internal category with: objects kC 0 arrows ⊕ x , y Hom C ( x , y ) A e.g. a k -algebra A gives an internal category k

  42. Enriched and Internal Categories for ( Vect k , ⊗ k , k ) A Vect k -enriched category is a k -linear category C with: a set of objects C 0 for all x , y ∈ C 0 , a k -vector space Hom C ( x , y ) A e.g. a k -algebra A gives a k -linear category ∗ A many-object enriched category replaces ∗ with any set. Any k -linear category gives rise to a Vect k -internal category with: objects kC 0 arrows ⊕ x , y Hom C ( x , y ) A e.g. a k -algebra A gives an internal category k A ‘many-object’ internal category replaces k with a k -coalgebra.

  43. Enriched and Internal Categories for ( Vect k , ⊗ k , k ) A Vect k -enriched category is a k -linear category C with: a set of objects C 0 for all x , y ∈ C 0 , a k -vector space Hom C ( x , y ) A e.g. a k -algebra A gives a k -linear category ∗ A many-object enriched category replaces ∗ with any set. Any k -linear category gives rise to a Vect k -internal category with: objects kC 0 arrows ⊕ x , y Hom C ( x , y ) A e.g. a k -algebra A gives an internal category k A ‘many-object’ internal category replaces k with a k -coalgebra. (possibly with other properties, e.g. cocommutativty)

  44. cocomm. comon. of objects k -linear objects k -linear Homs Smash Grothendieck Product Construction N • ⋊ C A ⋊ H k -linear many objects Semi-direct Product N ⋊ G

  45. cocomm. comon. of objects k -linear objects Enriched version k -linear Homs Smash Grothendieck Product Construction N • ⋊ C A ⋊ H k -linear many objects Semi-direct Product N ⋊ G

  46. Internal version cocomm. comon. of objects k -linear objects Smash Enriched Product version A ⋊ H k -linear Homs Smash Grothendieck Product Construction N • ⋊ C A ⋊ H k -linear many objects Semi-direct Product N ⋊ G

  47. Enriched Versions Suppose V has coproducts, and ⊗ preserves them.

  48. Enriched Versions Suppose V has coproducts, and ⊗ preserves them. Theorem (Cibils-Marcos 2006, Lowen 2008, Tamaki 2009)     ⋊ C-graded V -cats  Functors    ∼ = A • : C → V - Cat A • ⋊ C     fibers

  49. Enriched Versions Suppose V has coproducts, and ⊗ preserves them. Theorem (Cibils-Marcos 2006, Lowen 2008, Tamaki 2009)     ⋊ C-graded V -cats  Functors    ∼ = A • : C → V - Cat A • ⋊ C     fibers Want to replace the ordinary category C with a V -category C .

  50. Enriched Versions Suppose V has coproducts, and ⊗ preserves them. Theorem (Cibils-Marcos 2006, Lowen 2008, Tamaki 2009)     ⋊ C-graded V -cats  Functors    ∼ = A • : C → V - Cat A • ⋊ C     fibers Want to replace the ordinary category C with a V -category C . Theorem (W) Let C be a comonoidal V -category.

  51. Enriched Versions Suppose V has coproducts, and ⊗ preserves them. Theorem (Cibils-Marcos 2006, Lowen 2008, Tamaki 2009)     ⋊ C-graded V -cats  Functors    ∼ = A • : C → V - Cat A • ⋊ C     fibers Want to replace the ordinary category C with a V -category C . Theorem (W) Let C be a comonoidal V -category. Then     ⋊ C -module V -cats C -comodule V -cats     ∼ = C ⊗ A → A A ⋊ C     coinv

  52. Internal Version Theorem (W) Suppose V has equalizers, and ⊗ preserves them.

  53. Internal Version Theorem (W) Suppose V has equalizers, and ⊗ preserves them. Let C be a comonoidal internal category. Then     ⋊ C -module int cats C -comod int cats     ∼ = C ⊗ A → A A ⋊ C     coinv

  54. Internal Version Theorem (W) Suppose V has equalizers, and ⊗ preserves them. Let C be a comonoidal internal category. Then     ⋊ C -module int cats C -comod int cats     ∼ = C ⊗ A → A A ⋊ C     coinv Let C = ( C 0 , C 1 ) be comonoidal internal category, and A = ( A 0 , A 1 ) be a C -module category.

  55. Internal Version Theorem (W) Suppose V has equalizers, and ⊗ preserves them. Let C be a comonoidal internal category. Then     ⋊ C -module int cats C -comod int cats     ∼ = C ⊗ A → A A ⋊ C     coinv Let C = ( C 0 , C 1 ) be comonoidal internal category, and A = ( A 0 , A 1 ) be a C -module category. Can form A ⋊ C with objects A 0

  56. Internal Version Theorem (W) Suppose V has equalizers, and ⊗ preserves them. Let C be a comonoidal internal category. Then     ⋊ C -module int cats C -comod int cats     ∼ = C ⊗ A → A A ⋊ C     coinv Let C = ( C 0 , C 1 ) be comonoidal internal category, and A = ( A 0 , A 1 ) be a C -module category. Can form A ⋊ C with objects A 0 and arrows A 1 ⊠ A 0 ( C 1 ⊠ C 0 A 0 ).

  57. Internal Version Theorem (W) Suppose V has equalizers, and ⊗ preserves them. Let C be a comonoidal internal category. Then     ⋊ C -module int cats C -comod int cats     ∼ = C ⊗ A → A A ⋊ C     coinv Let C = ( C 0 , C 1 ) be comonoidal internal category, and A = ( A 0 , A 1 ) be a C -module category. Can form A ⋊ C with objects A 0 and arrows A 1 ⊠ A 0 ( C 1 ⊠ C 0 A 0 ). When C = ( k , H ) , A = ( k , A ), this is just A ⊠ k ( H ⊠ k k ) ∼ = A ⊗ H .

  58. Internal Version A 1 ⊠ A 0 C 1 ⊠ C 0 A 0 ⊠ A 0 A 1 ⊠ A 0 C 1 ⊠ C 0 A 0 A 1 ⊠ A 0 C 1 ⊠ C 0 A 1 ⊠ A 0 C 1 ⊠ C 0 C 1 ⊠ C 0 A 0 A 1 A 1 C 1 A 0 ⊠ A 0 ⊠ A 0 ⊠ C 0 A 1 C 1 A 0 ⊠ A 0 ⊠ C 0

  59. Internal Version A 1 ⊠ A 0 C 1 ⊠ C 0 A 0 ⊠ A 0 A 1 ⊠ A 0 C 1 ⊠ C 0 A 0 A 1 ⊠ A 0 C 1 ⊠ C 0 A 1 ⊠ A 0 C 1 ⊠ C 0 C 1 ⊠ C 0 A 0 A 1 A 1 C 1 A 0 ⊠ A 0 ⊠ A 0 ⊠ C 0 A 1 C 1 A 0 ⊠ A 0 ⊠ C 0

  60. Internal Version A 1 ⊠ A 0 C 1 ⊠ C 0 A 0 ⊠ A 0 A 1 ⊠ A 0 C 1 ⊠ C 0 A 0 A 1 ⊠ A 0 C 1 ⊠ C 0 A 1 ⊠ A 0 C 1 ⊠ C 0 C 1 ⊠ C 0 A 0 A 1 A 1 C 1 A 0 ⊠ A 0 ⊠ A 0 ⊠ C 0 A 1 C 1 A 0 ⊠ A 0 ⊠ C 0

  61. Internal Version A 1 ⊠ A 0 C 1 ⊠ C 0 A 0 ⊠ A 0 A 1 ⊠ A 0 C 1 ⊠ C 0 A 0 A 1 ⊠ A 0 C 1 ⊠ C 0 A 1 ⊠ A 0 C 1 ⊠ C 0 C 1 ⊠ C 0 A 0 A 1 A 1 C 1 A 0 ⊠ A 0 ⊠ A 0 ⊠ C 0 A 1 C 1 A 0 ⊠ A 0 ⊠ C 0

  62. Internal Version A 1 ⊠ A 0 C 1 ⊠ C 0 A 0 ⊠ A 0 A 1 ⊠ A 0 C 1 ⊠ C 0 A 0 A 1 ⊠ A 0 C 1 ⊠ C 0 A 1 ⊠ A 0 C 1 ⊠ C 0 C 1 ⊠ C 0 A 0 A 1 A 1 C 1 A 0 ⊠ A 0 ⊠ A 0 ⊠ C 0 A 1 C 1 A 0 ⊠ A 0 ⊠ C 0

Recommend


More recommend