A Quillen model structure for bigroupoids and pseudofunctors - - PowerPoint PPT Presentation

a quillen model structure for bigroupoids and
SMART_READER_LITE
LIVE PREVIEW

A Quillen model structure for bigroupoids and pseudofunctors - - PowerPoint PPT Presentation

A Quillen model structure for bigroupoids and pseudofunctors Martijn den Besten ILLC, University of Amsterdam July 8, 2019 1 / 13 Some similar results Model structures exist on: Groupoids (Anderson) 2-Groupoids (Moerdijk-Svensson)


slide-1
SLIDE 1

A Quillen model structure for bigroupoids and pseudofunctors

Martijn den Besten

ILLC, University of Amsterdam

July 8, 2019

1 / 13

slide-2
SLIDE 2

Some similar results

Model structures exist on: Groupoids (Anderson) 2-Groupoids (Moerdijk-Svensson) 2-Categories (Lack) Bicategories (Lack) Pseudogroupoids (Lack)

2 / 13

slide-3
SLIDE 3

Bigroupoids

A bigroupoid consists of: 0-cells A, B, C, . . . 1-cells (between 0-cells) A B

f

2-cells (between parallel 1-cells) A B

f g α

3 / 13

slide-4
SLIDE 4

Bigroupoids

Bigroupoids have (on two levels): Identity A A

1A

and · ·

f f 1f

Composition · · ·

f gf g

and · ·

α β βα

Inversion · ·

f f −1

and · ·

α α−1

4 / 13

slide-5
SLIDE 5

Bigroupoids

The 2-cells follow the familiar laws: (γβ)α = γ(βα), αα−1 = 1, α1 = α, etc. The 1-cells follow these laws only up to a 2-cell. Example: In general: (hg)f = h(gf ) Instead: (hg)f

α

= ⇒ h(gf ) Plus coherence laws . . .

5 / 13

slide-6
SLIDE 6

Morphisms

A pseudofunctor F : A − → B is structure preserving on 2-cells: Fβα = FβFα, Fα−1 = (Fα)−1, F1 = 1 On 1-cells this holds only up to a 2-cell. Example: In general: Fgf = FgFf Instead: Fgf

α

= ⇒ FgFf Plus coherence laws . . . Bigroupoids + pseudofunctors form a category.

6 / 13

slide-7
SLIDE 7

Model structures

A model structure on a category C consists of: C, F, W ⊂ Mor(C), such that: Iso ⊂ W. W satifies 2-out-of-3. (C, F ∩ W) and (C ∩ W, F) are weak factorization systems. We do not require that C is (co)complete.

7 / 13

slide-8
SLIDE 8

Model structure on bigroupoids

The classes of maps are given by: F ∈ C ⇐ ⇒ F is injective on 0-cells and locally injective on 1-cells. F ∈ F ⇐ ⇒ F lifts 1-cells and 2-cells. F ∈ W ⇐ ⇒ F is a biequivalence.

8 / 13

slide-9
SLIDE 9

Model structure on bigroupoids

The classes of maps are given by: F ∈ C ⇐ ⇒ F is injective on 0-cells and locally injective on 1-cells. F ∈ F ⇐ ⇒ F lifts 1-cells and 2-cells. F ∈ W ⇐ ⇒ F is a biequivalence. Lifting property for F : A − → B (on 1-cells): ∃A A′ B FA′

∃a b

8 / 13

slide-10
SLIDE 10

Model structure on bigroupoids

Theorem

The category of bigroupoids and pseudofunctors carries a model structure, with C, F and W as defined on the previous slide.

Theorem

The inclusion I : 2 − Grpd − → Bigrpd, of the category of 2-groupoids and 2-functors into the category of bigroupoids and pseudofunctors is the right adjoint part of a Quillen equivalence.

9 / 13

slide-11
SLIDE 11

Coherence laws

For every propery (associativity, functoriality, . . .) that needs to hold up to a 2-cell, we have a favourite witness. Example: (hg)f h(gf )

ah,g,f

These witnesses need to interact in a coherent way. Example: (g1)f g(1f ) gf

ag,1,f rg∗1f 1g∗lf

10 / 13

slide-12
SLIDE 12

Coherence theorem

Theorem

Every formal diagram (≈ a diagram consisting of favourite witnesses) commutes. Equivalently:

Theorem

For every morphism F : G − → H of (groupoid enriched) graphs, the induced 2-functor ∆ : FreeF(H) − → Free2−Grpd(H), from the codomain of the free pseudofunctor on F to the free 2-groupoid on H is a biequivalence.

11 / 13

slide-13
SLIDE 13

Remarks on the proof

The coherence theorem is used to construct both the model structure and the Quillen equivalence. The small object argument is not used. Instead, more explicit constructions are given. Pullbacks of fibrations exist. Some constructions are made by mimicking constructions familiar from groupoids. The model structure on groupoids is used locally.

12 / 13

slide-14
SLIDE 14

Future research

Does there exist a model structure on bicategories + pseudofunctors? Or other similar weak higher order structures? Does it give rise to an (interesting) model of (some) type theory?

13 / 13