Internal Languages of Higher Categories Karol Szumi lo University - - PowerPoint PPT Presentation

internal languages of higher categories
SMART_READER_LITE
LIVE PREVIEW

Internal Languages of Higher Categories Karol Szumi lo University - - PowerPoint PPT Presentation

Internal Languages of Higher Categories Karol Szumi lo University of Leeds HoTT 2019 1/18 Theorem (LambekScott) The category of -calculi is equivalent to the category of cartesian closed categories. 2/18 Theorem (LambekScott)


slide-1
SLIDE 1

1/18

Internal Languages of Higher Categories

Karol Szumi lo

University of Leeds

HoTT 2019

slide-2
SLIDE 2

2/18

Theorem (Lambek–Scott)

The category of λ-calculi is equivalent to the category of cartesian closed categories.

slide-3
SLIDE 3

2/18

Theorem (Lambek–Scott)

The category of λ-calculi is equivalent to the category of cartesian closed categories.

Theorem (Lambek–Scott)

The category of higher order intuitionistic type theories is (almost) equivalent to the category of elementary toposes with NNO.

slide-4
SLIDE 4

2/18

Theorem (Lambek–Scott)

The category of λ-calculi is equivalent to the category of cartesian closed categories.

Theorem (Lambek–Scott)

The category of higher order intuitionistic type theories is (almost) equivalent to the category of elementary toposes with NNO. What is a counterpart for HoTT?

slide-5
SLIDE 5

3/18

Joint work with Chris Kapulkin:

Theorem (2017)

The homotopy theory of comprehension categories with Id and Σ is equivalent to the homotopy theory of quasicategories with finite limits.

slide-6
SLIDE 6

3/18

Joint work with Chris Kapulkin:

Theorem (2017)

The homotopy theory of comprehension categories with Id and Σ is equivalent to the homotopy theory of quasicategories with finite limits.

Theorem (in progress)

The homotopy theory of comprehension categories with Id, Π and Σ satisfying functional extensionality is equivalent to the homotopy theory

  • f locally cartesian closed quasicategories.
slide-7
SLIDE 7

4/18

A homotopy theory is modeled by a homotopical category, i.e., a category C with a subcategory of weak equivalences.

slide-8
SLIDE 8

4/18

A homotopy theory is modeled by a homotopical category, i.e., a category C with a subcategory of weak equivalences. C has an associated (∞,1)-category obtained by universally inverting the weak equivalences.

slide-9
SLIDE 9

4/18

A homotopy theory is modeled by a homotopical category, i.e., a category C with a subcategory of weak equivalences. C has an associated (∞,1)-category obtained by universally inverting the weak equivalences. A functor F∶C → D is homotopical if it preserves weak equivalences.

slide-10
SLIDE 10

4/18

A homotopy theory is modeled by a homotopical category, i.e., a category C with a subcategory of weak equivalences. C has an associated (∞,1)-category obtained by universally inverting the weak equivalences. A functor F∶C → D is homotopical if it preserves weak equivalences. It is a DK-equivalence if HoC → HoD is essentially surjective and LHC(X,Y ) → LHD(FX,FY ) are weak homotopy equivalences, i.e., it induces an equivalences of (∞,1)-categories.

slide-11
SLIDE 11

5/18

CompCatId,Π,Σ LCCQ

comprehension categories locally cartesian closed quasicategories

slide-12
SLIDE 12

5/18

CompCatId,Π,Σ LCCQ

comprehension categories locally cartesian closed quasicategories Π-tribes

Π-Trb

slide-13
SLIDE 13

5/18

CompCatId,Π,Σ LCCQ

comprehension categories locally cartesian closed quasicategories Π-tribes

Π-Trb Π-sTrb

semisimplicial Π-tribes

slide-14
SLIDE 14

5/18

CompCatId,Π,Σ LCCQ

comprehension categories locally cartesian closed quasicategories Π-tribes

Π-Trb Π-sTrb

semisimplicial Π-tribes

slide-15
SLIDE 15

6/18

A tribe is a category C with a subcategory of fibrations. T1 There is a terminal object and all objects are fibrant. T2 There are pullbacks along fibrations and fibrations are stable under pullback. T3 Every morphism factors as an anodyne morphism followed by a fibration. T4 Anodyne morphisms are stable under pullbacks along fibrations.

slide-16
SLIDE 16

6/18

A tribe is a category C with a subcategory of fibrations. T1 There is a terminal object and all objects are fibrant. T2 There are pullbacks along fibrations and fibrations are stable under pullback. T3 Every morphism factors as an anodyne morphism followed by a fibration. T4 Anodyne morphisms are stable under pullbacks along fibrations. anodyne = LLP with respect to fibrations

slide-17
SLIDE 17

6/18

A tribe is a category C with a subcategory of fibrations. T1 There is a terminal object and all objects are fibrant. T2 There are pullbacks along fibrations and fibrations are stable under pullback. T3 Every morphism factors as an anodyne morphism followed by a fibration. T4 Anodyne morphisms are stable under pullbacks along fibrations. anodyne = LLP with respect to fibrations a b

slide-18
SLIDE 18

6/18

A tribe is a category C with a subcategory of fibrations. T1 There is a terminal object and all objects are fibrant. T2 There are pullbacks along fibrations and fibrations are stable under pullback. T3 Every morphism factors as an anodyne morphism followed by a fibration. T4 Anodyne morphisms are stable under pullbacks along fibrations. anodyne = LLP with respect to fibrations a b a Pa a ×b a

slide-19
SLIDE 19

6/18

A tribe is a category C with a subcategory of fibrations. T1 There is a terminal object and all objects are fibrant. T2 There are pullbacks along fibrations and fibrations are stable under pullback. T3 Every morphism factors as an anodyne morphism followed by a fibration. T4 Anodyne morphisms are stable under pullbacks along fibrations. anodyne = LLP with respect to fibrations a b a Pa a ×b a

a Pa Pa c

slide-20
SLIDE 20

7/18

A path object on a is given by a factorization a ↣

∼ Pa ↠ a × a.

slide-21
SLIDE 21

7/18

A path object on a is given by a factorization a ↣

∼ Pa ↠ a × a.

A homotopy between morphisms a → b is a morphism a → Pb.

slide-22
SLIDE 22

7/18

A path object on a is given by a factorization a ↣

∼ Pa ↠ a × a.

A homotopy between morphisms a → b is a morphism a → Pb. A homotopy equivalence is a morphism with an inverse up to homotopy.

slide-23
SLIDE 23

7/18

A path object on a is given by a factorization a ↣

∼ Pa ↠ a × a.

A homotopy between morphisms a → b is a morphism a → Pb. A homotopy equivalence is a morphism with an inverse up to homotopy. A homomorphism of tribes is a functor that preserves fibrations, anodyne morphisms, terminal object and pullbacks along fibrations.

slide-24
SLIDE 24

7/18

A path object on a is given by a factorization a ↣

∼ Pa ↠ a × a.

A homotopy between morphisms a → b is a morphism a → Pb. A homotopy equivalence is a morphism with an inverse up to homotopy. A homomorphism of tribes is a functor that preserves fibrations, anodyne morphisms, terminal object and pullbacks along fibrations. A Π-tribe is a tribe T such that for all fibrations p∶a ↠ b, the pullback functor p∗∶T ↡b → T ↡a has a right adjoint Πp that is a homomorphism.

slide-25
SLIDE 25

7/18

A path object on a is given by a factorization a ↣

∼ Pa ↠ a × a.

A homotopy between morphisms a → b is a morphism a → Pb. A homotopy equivalence is a morphism with an inverse up to homotopy. A homomorphism of tribes is a functor that preserves fibrations, anodyne morphisms, terminal object and pullbacks along fibrations. A Π-tribe is a tribe T such that for all fibrations p∶a ↠ b, the pullback functor p∗∶T ↡b → T ↡a has a right adjoint Πp that is a homomorphism. A Π-homomorphism is a homomorphism that preserves Π.

slide-26
SLIDE 26

7/18

A path object on a is given by a factorization a ↣

∼ Pa ↠ a × a.

A homotopy between morphisms a → b is a morphism a → Pb. A homotopy equivalence is a morphism with an inverse up to homotopy. A homomorphism of tribes is a functor that preserves fibrations, anodyne morphisms, terminal object and pullbacks along fibrations. A Π-tribe is a tribe T such that for all fibrations p∶a ↠ b, the pullback functor p∗∶T ↡b → T ↡a has a right adjoint Πp that is a homomorphism. A Π-homomorphism is a homomorphism that preserves Π. It is a weak equivalence if it induces an equivalence on homotopy categories.

slide-27
SLIDE 27

8/18

A semisimplicial set is a “simplicial set without degeneracies”.

slide-28
SLIDE 28

8/18

A semisimplicial set is a “simplicial set without degeneracies”. Semisimplicial sets carry a symmetric monoidal geometric product.

slide-29
SLIDE 29

8/18

A semisimplicial set is a “simplicial set without degeneracies”. Semisimplicial sets carry a symmetric monoidal geometric product. A semisimplicial Π-tribe is a Π-tribe that is enriched in semisimplicial sets such that ▸ cotensors by finite semisimplicial sets exist and the “pullback cotensor property” is satisfied; ▸ cotensors preserve anodyne morphisms; ▸ adjunctions p∗ ⊢ Πp are semisimplicial.

slide-30
SLIDE 30

9/18

A frame in a Π-tribe T is a Reedy fibrant homotopically constant semisimplicial object in T .

slide-31
SLIDE 31

9/18

A frame in a Π-tribe T is a Reedy fibrant homotopically constant semisimplicial object in T . The category of frames Fr T is a semisimplicial Π-tribe.

slide-32
SLIDE 32

9/18

A frame in a Π-tribe T is a Reedy fibrant homotopically constant semisimplicial object in T . The category of frames Fr T is a semisimplicial Π-tribe. Π-sTrb Π-Trb

U Fr

slide-33
SLIDE 33

9/18

A frame in a Π-tribe T is a Reedy fibrant homotopically constant semisimplicial object in T . The category of frames Fr T is a semisimplicial Π-tribe. Π-sTrb Π-Trb

U Fr

U Fr T T

slide-34
SLIDE 34

9/18

A frame in a Π-tribe T is a Reedy fibrant homotopically constant semisimplicial object in T . The category of frames Fr T is a semisimplicial Π-tribe. Π-sTrb Π-Trb

U Fr

U Fr T T

∼ ̂ Fr

Fr UT ′ ̂ FrT ′ T ′

∼ ∼

slide-35
SLIDE 35

10/18

A quasicategory is a simplicial set C with the RLP with respect to the inner horn inclusions. Quasicategories model (∞,1)-categories.

slide-36
SLIDE 36

10/18

A quasicategory is a simplicial set C with the RLP with respect to the inner horn inclusions. Quasicategories model (∞,1)-categories. C has finite limits if for all finite simplicial sets K and x∶K → C, the functor CK(const ,x) is representable.

slide-37
SLIDE 37

10/18

A quasicategory is a simplicial set C with the RLP with respect to the inner horn inclusions. Quasicategories model (∞,1)-categories. C has finite limits if for all finite simplicial sets K and x∶K → C, the functor CK(const ,x) is representable. C is cartesian closed if for all x,y ∈ C, the functor C( ×x,y) is representable.

slide-38
SLIDE 38

10/18

A quasicategory is a simplicial set C with the RLP with respect to the inner horn inclusions. Quasicategories model (∞,1)-categories. C has finite limits if for all finite simplicial sets K and x∶K → C, the functor CK(const ,x) is representable. C is cartesian closed if for all x,y ∈ C, the functor C( ×x,y) is representable. C is locally cartesian closed if for all x ∈ C, C ↓ x is cartesian closed.

slide-39
SLIDE 39

10/18

A quasicategory is a simplicial set C with the RLP with respect to the inner horn inclusions. Quasicategories model (∞,1)-categories. C has finite limits if for all finite simplicial sets K and x∶K → C, the functor CK(const ,x) is representable. C is cartesian closed if for all x,y ∈ C, the functor C( ×x,y) is representable. C is locally cartesian closed if for all x ∈ C, C ↓ x is cartesian closed. A morphism of LCCQs is a functor (simplicial map) that preserves finite limits and local exponentials.

slide-40
SLIDE 40

10/18

A quasicategory is a simplicial set C with the RLP with respect to the inner horn inclusions. Quasicategories model (∞,1)-categories. C has finite limits if for all finite simplicial sets K and x∶K → C, the functor CK(const ,x) is representable. C is cartesian closed if for all x,y ∈ C, the functor C( ×x,y) is representable. C is locally cartesian closed if for all x ∈ C, C ↓ x is cartesian closed. A morphism of LCCQs is a functor (simplicial map) that preserves finite limits and local exponentials. It is an categorical equivalence if it has an inverse up to natural equivalence.

slide-41
SLIDE 41

11/18

LCCQ Π-Trb Π-sTrb

U Fr

slide-42
SLIDE 42

11/18

LCCQ Π-Trb Π-sTrb

U Fr

Outline of the proof: ▸ Show that Π-sTrb and LCCQ are fibration categories.

slide-43
SLIDE 43

11/18

LCCQ Π-Trb Π-sTrb

U Nf Fr

Outline of the proof: ▸ Show that Π-sTrb and LCCQ are fibration categories. ▸ Implement the rightward functors with a convenient construction: the quasicategory of frames.

slide-44
SLIDE 44

11/18

LCCQ Π-Trb Π-sTrb

U Nf Fr

Outline of the proof: ▸ Show that Π-sTrb and LCCQ are fibration categories. ▸ Implement the rightward functors with a convenient construction: the quasicategory of frames. ▸ Show that Nf is an exact functor with Approximation Properties.

slide-45
SLIDE 45

11/18

LCCQ Π-Trb Π-sTrb

U Nf Fr

Outline of the proof: ▸ Show that Π-sTrb and LCCQ are fibration categories. ▸ Implement the rightward functors with a convenient construction: the quasicategory of frames. ▸ Show that Nf is an exact functor with Approximation Properties. ▸ For that use tribes of representable injectively fibrant presheaves.

slide-46
SLIDE 46

12/18

A fibration category is a category with subcategories of weak equivalences and fibrations. F1 There is a terminal object and all objects are fibrant. F2 Pullbacks along fibrations exist and (acyclic) fibrations are stable under pullback. F3 Every morphism factors as a weak equivalence followed by a fibration. F4 Weak equivalences satisfy the 2-out-of-6 property.

slide-47
SLIDE 47

12/18

A fibration category is a category with subcategories of weak equivalences and fibrations. F1 There is a terminal object and all objects are fibrant. F2 Pullbacks along fibrations exist and (acyclic) fibrations are stable under pullback. F3 Every morphism factors as a weak equivalence followed by a fibration. F4 Weak equivalences satisfy the 2-out-of-6 property. An exact functor between fibration categories is a functor that preserves weak equivalences, fibrations, terminal object and pullbacks along fibrations.

slide-48
SLIDE 48

12/18

A fibration category is a category with subcategories of weak equivalences and fibrations. F1 There is a terminal object and all objects are fibrant. F2 Pullbacks along fibrations exist and (acyclic) fibrations are stable under pullback. F3 Every morphism factors as a weak equivalence followed by a fibration. F4 Weak equivalences satisfy the 2-out-of-6 property. An exact functor between fibration categories is a functor that preserves weak equivalences, fibrations, terminal object and pullbacks along fibrations. Every tribe is a fibration category and every homomorphism is exact.

slide-49
SLIDE 49

12/18

A fibration category is a category with subcategories of weak equivalences and fibrations. F1 There is a terminal object and all objects are fibrant. F2 Pullbacks along fibrations exist and (acyclic) fibrations are stable under pullback. F3 Every morphism factors as a weak equivalence followed by a fibration. F4 Weak equivalences satisfy the 2-out-of-6 property. An exact functor between fibration categories is a functor that preserves weak equivalences, fibrations, terminal object and pullbacks along fibrations. Every tribe is a fibration category and every homomorphism is exact. LCCQ is a fibration category (fibrations are inner isofibrations).

slide-50
SLIDE 50

13/18

A fibration between tribes F∶S ↠ T : S T

F

slide-51
SLIDE 51

13/18

A fibration between tribes F∶S ↠ T : S T

F

a b Fa y

≅ ≅

slide-52
SLIDE 52

13/18

A fibration between tribes F∶S ↠ T : S T

F

a b Fa y

≅ ≅

a b c Fa y Fc

∼ ∼

slide-53
SLIDE 53

13/18

A fibration between tribes F∶S ↠ T : S T

F

a b Fa y

≅ ≅

a b c Fa y Fc

∼ ∼

a b c d Fa Fb Fc Fd

∼ ∼

slide-54
SLIDE 54

13/18

A fibration between tribes F∶S ↠ T : S T

F

a b Fa y

≅ ≅

a b c Fa y Fc

∼ ∼

a b c d Fa Fb Fc Fd

∼ ∼

a b c Fa Fb Fc

∼ ∼

slide-55
SLIDE 55

13/18

A fibration between tribes F∶S ↠ T : S T

F

a b Fa y

≅ ≅

a b c Fa y Fc

∼ ∼

a b c d Fa Fb Fc Fd

∼ ∼

a b c Fa Fb Fc

∼ ∼

The category Π-sTrb is a fibration category.

slide-56
SLIDE 56

13/18

A fibration between tribes F∶S ↠ T : S T

F

a b Fa y

≅ ≅

a b c Fa y Fc

∼ ∼

a b c d Fa Fb Fc Fd

∼ ∼

a b c Fa Fb Fc

∼ ∼

The category Π-sTrb is a fibration category. A path object on T ∈ Π-sTrb: T T Z

R

T × T

where Z = {● ←

∼ ● → ∼ ●}.

slide-57
SLIDE 57

14/18

If C is a quasicategory, let IC denote the opposite of its category of elements with face operators only.

slide-58
SLIDE 58

14/18

If C is a quasicategory, let IC denote the opposite of its category of elements with face operators only. The “initial projection” functor NIC → C creates weak equivalences in IC.

slide-59
SLIDE 59

14/18

If C is a quasicategory, let IC denote the opposite of its category of elements with face operators only. The “initial projection” functor NIC → C creates weak equivalences in IC. IC is a homotopical inverse category and NIC → C is a localization.

slide-60
SLIDE 60

14/18

If C is a quasicategory, let IC denote the opposite of its category of elements with face operators only. The “initial projection” functor NIC → C creates weak equivalences in IC. IC is a homotopical inverse category and NIC → C is a localization. If T is a Π-tribe, define a simplicial set Nf T (quasicategory of frames): (Nf )m = {x∶I[m] → T ∣ x is homotopical and Reedy fibrant}.

slide-61
SLIDE 61

14/18

If C is a quasicategory, let IC denote the opposite of its category of elements with face operators only. The “initial projection” functor NIC → C creates weak equivalences in IC. IC is a homotopical inverse category and NIC → C is a localization. If T is a Π-tribe, define a simplicial set Nf T (quasicategory of frames): (Nf )m = {x∶I[m] → T ∣ x is homotopical and Reedy fibrant}. Nf T is a locally cartesian closed quasicategory and Nf ∶Π-sTrb → LCCQ is an exact functor.

slide-62
SLIDE 62

15/18

Theorem (Cisinski)

If F∶C → D is an exact functor between fibration categories, then the following are equivalent. ▸ F is a DK-equivalence. ▸ F is a weak equivalence. ▸ F satisfies the Approximation Properties:

App1 it reflects weak equivalences, App2 blah: x Fb b x ′ Fa a.

∼ ∼

slide-63
SLIDE 63

15/18

Theorem (Cisinski)

If F∶C → D is an exact functor between fibration categories, then the following are equivalent. ▸ F is a DK-equivalence. ▸ F is a weak equivalence. ▸ F satisfies the Approximation Properties:

App1 it reflects weak equivalences, App2 blah: x Fb b x ′ Fa a.

∼ ∼

We need to show that Nf satisfies App2.

slide-64
SLIDE 64

16/18

C Nf T T C′ Nf S S

F ∼ ∼

slide-65
SLIDE 65

16/18

C Nf T T C′ Nf S S

F ∼ ∼

A simplicial presheaf A over a simplicial category A is representable if there is A(,a) →

∼ A.

slide-66
SLIDE 66

16/18

C Nf T T C′ Nf S S

F ∼ ∼

A simplicial presheaf A over a simplicial category A is representable if there is A(,a) →

∼ A.

Consider the hammock localization LH IC. Then the category RC of representable injectively fibrant simplicial presheaves over LH IC is a Π-tribe (with injective fibrations). Moreover, Nf RC is equivalent to C.

slide-67
SLIDE 67

17/18

An object of S consists of ▸ presheaves X, ̃ X over LH IC with X injectively fibrant, ▸ an object a ∈ T , ▸ an injective fibration ̃ X ↠ X × LHT (F ,a) such that ▸ ̃ X → X is a weak equivalence, ▸ there is a representation LH IC(,x) →

∼ ̃

X that induces a weak equivalence Fx → a.

slide-68
SLIDE 68

17/18

An object of S consists of ▸ presheaves X, ̃ X over LH IC with X injectively fibrant, ▸ an object a ∈ T , ▸ an injective fibration ̃ X ↠ X × LHT (F ,a) such that ▸ ̃ X → X is a weak equivalence, ▸ there is a representation LH IC(,x) →

∼ ̃

X that induces a weak equivalence Fx → a. S is a Π-tribe.

slide-69
SLIDE 69

17/18

An object of S consists of ▸ presheaves X, ̃ X over LH IC with X injectively fibrant, ▸ an object a ∈ T , ▸ an injective fibration ̃ X ↠ X × LHT (F ,a) such that ▸ ̃ X → X is a weak equivalence, ▸ there is a representation LH IC(,x) →

∼ ̃

X that induces a weak equivalence Fx → a. S is a Π-tribe. An m-simplex of C′ consists of ▸ an m-simplex (X, ̃ X,a) of Nf S, ▸ an m-simplex x of C, ▸ a natural choice of representations LH IC(,xϕ) →

∼ ̃

Xϕ for ϕ∶[k] ↪ [m] inducing weak equivalences Fxϕ → aϕ.

slide-70
SLIDE 70

18/18

C Nf T T C′ Nf S S

F

slide-71
SLIDE 71

18/18

C Nf T T C′ Nf S S

F ∼

C′ → C is an acyclic fibration. In particular, C′ is a LCCQ.

slide-72
SLIDE 72

18/18

C Nf T T C′ Nf S S

F ∼ ∼

C′ → C is an acyclic fibration. In particular, C′ is a LCCQ. C′ → Nf S preserves finite limits and satisfies quasicategorical Approximation Properties.

slide-73
SLIDE 73

18/18

C Nf T T C′ Nf S S

F ∼ ∼

̂ FrT Fr T ̂ FrS Fr S

∼ ∼ ∼ ∼

C′ → C is an acyclic fibration. In particular, C′ is a LCCQ. C′ → Nf S preserves finite limits and satisfies quasicategorical Approximation Properties.