Every love story is a GHOsT story: Goerss–Hopkins obstruction ...

97
Introduction Obstruction theory Model -categories Every love story is a GHOsT story: Goerss–Hopkins obstruction theory for -categories Aaron Mazel-Gee University of California, Berkeley [email protected] July 2, 2014 Aaron Mazel-Gee GHOsT for -categories

Transcript of Every love story is a GHOsT story: Goerss–Hopkins obstruction ...

Page 1: Every love story is a GHOsT story: Goerss–Hopkins obstruction ...

IntroductionObstruction theory

Model∞-categories

Every love story is a GHOsT story:Goerss–Hopkins obstruction theory for

∞-categories

Aaron Mazel-Gee

University of California, Berkeley

[email protected]

July 2, 2014

Aaron Mazel-Gee GHOsT for∞-categories

Page 2: Every love story is a GHOsT story: Goerss–Hopkins obstruction ...

IntroductionObstruction theory

Model∞-categories

1. Introduction

Aaron Mazel-Gee GHOsT for∞-categories

Page 3: Every love story is a GHOsT story: Goerss–Hopkins obstruction ...

IntroductionObstruction theory

Model∞-categories

main goal: use purely algebraic computations to obtainexistence and uniqueness results for structured ring spectra.

setup: CE∗−→ A. (e.g. C = E∞-ring spectra; A the appropriate algebraic target)

question: Given A ∈ A, is there X ∈ C with E∗X ∼= A?

obstructions live in Andre–Quillen cohomology in A:

to existence in Hn+2AQ (A,ΩnA) for n ≥ 1,

to uniqueness in Hn+1AQ (A,ΩnA) for n ≥ 1.

Aaron Mazel-Gee GHOsT for∞-categories

Page 4: Every love story is a GHOsT story: Goerss–Hopkins obstruction ...

IntroductionObstruction theory

Model∞-categories

main goal: use purely algebraic computations to obtainexistence and uniqueness results for structured ring spectra.

setup: CE∗−→ A. (e.g. C = E∞-ring spectra; A the appropriate algebraic target)

question: Given A ∈ A, is there X ∈ C with E∗X ∼= A?

obstructions live in Andre–Quillen cohomology in A:

to existence in Hn+2AQ (A,ΩnA) for n ≥ 1,

to uniqueness in Hn+1AQ (A,ΩnA) for n ≥ 1.

Aaron Mazel-Gee GHOsT for∞-categories

Page 5: Every love story is a GHOsT story: Goerss–Hopkins obstruction ...

IntroductionObstruction theory

Model∞-categories

main goal: use purely algebraic computations to obtainexistence and uniqueness results for structured ring spectra.

setup: CE∗−→ A. (e.g. C = E∞-ring spectra; A the appropriate algebraic target)

question: Given A ∈ A, is there X ∈ C with E∗X ∼= A?

obstructions live in Andre–Quillen cohomology in A:

to existence in Hn+2AQ (A,ΩnA) for n ≥ 1,

to uniqueness in Hn+1AQ (A,ΩnA) for n ≥ 1.

Aaron Mazel-Gee GHOsT for∞-categories

Page 6: Every love story is a GHOsT story: Goerss–Hopkins obstruction ...

IntroductionObstruction theory

Model∞-categories

higher-categorical perspective: write

C A

M (A) A

E∗

for the moduli space (i.e.∞-gpd) of realizations of A.

now, existence and uniqueness: asks about π0(M (A)).

higher data: are any two equivalences equivalent (i.e. homotopic)? asks about π1(M (A)).

GHOsT: can (try to) compute all πn(M (A))!spectral sequence H∗AQ(A,Ω∗A)⇒ π∗(M (A))

Aaron Mazel-Gee GHOsT for∞-categories

Page 7: Every love story is a GHOsT story: Goerss–Hopkins obstruction ...

IntroductionObstruction theory

Model∞-categories

higher-categorical perspective: write

C A

M (A) A

E∗

for the moduli space (i.e.∞-gpd) of realizations of A.

now, existence and uniqueness: asks about π0(M (A)).

higher data: are any two equivalences equivalent (i.e. homotopic)? asks about π1(M (A)).

GHOsT: can (try to) compute all πn(M (A))!spectral sequence H∗AQ(A,Ω∗A)⇒ π∗(M (A))

Aaron Mazel-Gee GHOsT for∞-categories

Page 8: Every love story is a GHOsT story: Goerss–Hopkins obstruction ...

IntroductionObstruction theory

Model∞-categories

higher-categorical perspective: write

C A

M (A) A

E∗

for the moduli space (i.e.∞-gpd) of realizations of A.

now, existence and uniqueness: asks about π0(M (A)).

higher data: are any two equivalences equivalent (i.e. homotopic)? asks about π1(M (A)).

GHOsT: can (try to) compute all πn(M (A))!spectral sequence H∗AQ(A,Ω∗A)⇒ π∗(M (A))

Aaron Mazel-Gee GHOsT for∞-categories

Page 9: Every love story is a GHOsT story: Goerss–Hopkins obstruction ...

IntroductionObstruction theory

Model∞-categories

higher-categorical perspective: write

C A

M (A) A

E∗

for the moduli space (i.e.∞-gpd) of realizations of A.

now, existence and uniqueness: asks about π0(M (A)).

higher data: are any two equivalences equivalent (i.e. homotopic)? asks about π1(M (A)).

GHOsT: can (try to) compute all πn(M (A))!spectral sequence H∗AQ(A,Ω∗A)⇒ π∗(M (A))

Aaron Mazel-Gee GHOsT for∞-categories

Page 10: Every love story is a GHOsT story: Goerss–Hopkins obstruction ...

IntroductionObstruction theory

Model∞-categories

sample application: “naive” theory of spectral alg geometry .

should have Spec : (E∞-rings)op → (spectral schemes).

Whatever a spectral scheme is, it should be “locally” Spec R forsome E∞-ring R... so what does “locally” mean?

a priori: abstract definition coming from ∞-topos theory.

“naive” defn: (top space Specπ0R) + (E∞-structure sheaf).

why this works: π0 : Zar(R)∼−→ Zar(π0R).

key fact: AQ coh measures failure of smoothness...but inclusions of Zariski opens are smooth.

GHOsT for ∞-cats ? “naive” theory of DAG in other ∞-cats

Aaron Mazel-Gee GHOsT for∞-categories

Page 11: Every love story is a GHOsT story: Goerss–Hopkins obstruction ...

IntroductionObstruction theory

Model∞-categories

sample application: “naive” theory of spectral alg geometry .

should have Spec : (E∞-rings)op → (spectral schemes).

Whatever a spectral scheme is, it should be “locally” Spec R forsome E∞-ring R... so what does “locally” mean?

a priori: abstract definition coming from ∞-topos theory.

“naive” defn: (top space Specπ0R) + (E∞-structure sheaf).

why this works: π0 : Zar(R)∼−→ Zar(π0R).

key fact: AQ coh measures failure of smoothness...but inclusions of Zariski opens are smooth.

GHOsT for ∞-cats ? “naive” theory of DAG in other ∞-cats

Aaron Mazel-Gee GHOsT for∞-categories

Page 12: Every love story is a GHOsT story: Goerss–Hopkins obstruction ...

IntroductionObstruction theory

Model∞-categories

sample application: “naive” theory of spectral alg geometry .

should have Spec : (E∞-rings)op → (spectral schemes).

Whatever a spectral scheme is, it should be “locally” Spec R forsome E∞-ring R... so what does “locally” mean?

a priori: abstract definition coming from ∞-topos theory.

“naive” defn: (top space Specπ0R) + (E∞-structure sheaf).

why this works: π0 : Zar(R)∼−→ Zar(π0R).

key fact: AQ coh measures failure of smoothness...but inclusions of Zariski opens are smooth.

GHOsT for ∞-cats ? “naive” theory of DAG in other ∞-cats

Aaron Mazel-Gee GHOsT for∞-categories

Page 13: Every love story is a GHOsT story: Goerss–Hopkins obstruction ...

IntroductionObstruction theory

Model∞-categories

sample application: “naive” theory of spectral alg geometry .

should have Spec : (E∞-rings)op → (spectral schemes).

Whatever a spectral scheme is, it should be “locally” Spec R forsome E∞-ring R... so what does “locally” mean?

a priori: abstract definition coming from ∞-topos theory.

“naive” defn: (top space Specπ0R) + (E∞-structure sheaf).

why this works: π0 : Zar(R)∼−→ Zar(π0R).

key fact: AQ coh measures failure of smoothness...but inclusions of Zariski opens are smooth.

GHOsT for ∞-cats ? “naive” theory of DAG in other ∞-cats

Aaron Mazel-Gee GHOsT for∞-categories

Page 14: Every love story is a GHOsT story: Goerss–Hopkins obstruction ...

IntroductionObstruction theory

Model∞-categories

sample application: “naive” theory of spectral alg geometry .

should have Spec : (E∞-rings)op → (spectral schemes).

Whatever a spectral scheme is, it should be “locally” Spec R forsome E∞-ring R... so what does “locally” mean?

a priori: abstract definition coming from ∞-topos theory.

“naive” defn: (top space Specπ0R) + (E∞-structure sheaf).

why this works: π0 : Zar(R)∼−→ Zar(π0R).

key fact: AQ coh measures failure of smoothness...but inclusions of Zariski opens are smooth.

GHOsT for ∞-cats ? “naive” theory of DAG in other ∞-cats

Aaron Mazel-Gee GHOsT for∞-categories

Page 15: Every love story is a GHOsT story: Goerss–Hopkins obstruction ...

IntroductionObstruction theory

Model∞-categories

more motivation for GHOsT for ∞-categories

dogmatic: ∞-cat : model cat :: manifold : atlasGoerss–Hopkins worked very, very hard to get just the right‘atlases’ when they set up GHOsT, but this shouldn’t be necessary. GHOsT should be model-independent, i.e. construction itselfshould descend to the underlying ∞-category of spectra.

pragmatic: then, may as well do it for all ∞-categories, to get:

GHOsT inequivariant / motivic homotopy theorylogarithmic E∞-ring spectracxes of qcoh sheaves ( coeffs for factorizn homology)

∞-categorical Rognes–Galois correspondenceet al.

Aaron Mazel-Gee GHOsT for∞-categories

Page 16: Every love story is a GHOsT story: Goerss–Hopkins obstruction ...

IntroductionObstruction theory

Model∞-categories

more motivation for GHOsT for ∞-categories

dogmatic: ∞-cat : model cat :: manifold : atlasGoerss–Hopkins worked very, very hard to get just the right‘atlases’ when they set up GHOsT, but this shouldn’t be necessary. GHOsT should be model-independent, i.e. construction itselfshould descend to the underlying ∞-category of spectra.

pragmatic: then, may as well do it for all ∞-categories, to get:

GHOsT inequivariant / motivic homotopy theorylogarithmic E∞-ring spectracxes of qcoh sheaves ( coeffs for factorizn homology)

∞-categorical Rognes–Galois correspondenceet al.

Aaron Mazel-Gee GHOsT for∞-categories

Page 17: Every love story is a GHOsT story: Goerss–Hopkins obstruction ...

IntroductionObstruction theory

Model∞-categories

more motivation for GHOsT for ∞-categories

dogmatic: ∞-cat : model cat :: manifold : atlasGoerss–Hopkins worked very, very hard to get just the right‘atlases’ when they set up GHOsT, but this shouldn’t be necessary. GHOsT should be model-independent, i.e. construction itselfshould descend to the underlying ∞-category of spectra.

pragmatic: then, may as well do it for all ∞-categories, to get:

GHOsT inequivariant / motivic homotopy theorylogarithmic E∞-ring spectracxes of qcoh sheaves ( coeffs for factorizn homology)

∞-categorical Rognes–Galois correspondenceet al.

Aaron Mazel-Gee GHOsT for∞-categories

Page 18: Every love story is a GHOsT story: Goerss–Hopkins obstruction ...

IntroductionObstruction theory

Model∞-categories

precursors / inputs to GHOsT

Hopkins–Miller obstruction theory for A∞-ring spectrasimpler than GHOsT: Σn acts freely on π0((A∞)n)

Blanc–Dwyer–Goerss obstruction theory for Top∗yet simpler: no operad at all, use π∗ instead of E∗(stability is nbd either way)

E 2-model structure of Dwyer–Kan–Stover on sTop∗a/k/a resolution model structure: generalizes the notion of “projectiveresolutions” to nonabelian setting

Aaron Mazel-Gee GHOsT for∞-categories

Page 19: Every love story is a GHOsT story: Goerss–Hopkins obstruction ...

IntroductionObstruction theory

Model∞-categories

precursors / inputs to GHOsT

Hopkins–Miller obstruction theory for A∞-ring spectrasimpler than GHOsT: Σn acts freely on π0((A∞)n)

Blanc–Dwyer–Goerss obstruction theory for Top∗yet simpler: no operad at all, use π∗ instead of E∗(stability is nbd either way)

E 2-model structure of Dwyer–Kan–Stover on sTop∗a/k/a resolution model structure: generalizes the notion of “projectiveresolutions” to nonabelian setting

Aaron Mazel-Gee GHOsT for∞-categories

Page 20: Every love story is a GHOsT story: Goerss–Hopkins obstruction ...

IntroductionObstruction theory

Model∞-categories

precursors / inputs to GHOsT

Hopkins–Miller obstruction theory for A∞-ring spectrasimpler than GHOsT: Σn acts freely on π0((A∞)n)

Blanc–Dwyer–Goerss obstruction theory for Top∗yet simpler: no operad at all, use π∗ instead of E∗(stability is nbd either way)

E 2-model structure of Dwyer–Kan–Stover on sTop∗a/k/a resolution model structure: generalizes the notion of “projectiveresolutions” to nonabelian setting

Aaron Mazel-Gee GHOsT for∞-categories

Page 21: Every love story is a GHOsT story: Goerss–Hopkins obstruction ...

IntroductionObstruction theory

Model∞-categories

precursors / inputs to GHOsT

Hopkins–Miller obstruction theory for A∞-ring spectrasimpler than GHOsT: Σn acts freely on π0((A∞)n)

Blanc–Dwyer–Goerss obstruction theory for Top∗yet simpler: no operad at all, use π∗ instead of E∗(stability is nbd either way)

E 2-model structure of Dwyer–Kan–Stover on sTop∗a/k/a resolution model structure: generalizes the notion of “projectiveresolutions” to nonabelian setting

Aaron Mazel-Gee GHOsT for∞-categories

Page 22: Every love story is a GHOsT story: Goerss–Hopkins obstruction ...

IntroductionObstruction theory

Model∞-categories

2. Obstruction theory

Aaron Mazel-Gee GHOsT for∞-categories

Page 23: Every love story is a GHOsT story: Goerss–Hopkins obstruction ...

IntroductionObstruction theory

Model∞-categories

setup

(for simplicity, just BDG obstrn theory; the GHOsT story is kind of scary.)

C a presentable homotopy theory;

G a set of generators;

define “homotopy” functor

C Aπ∗

byπ∗X = [Sβ,X ]Sβ∈G.

(by defn of “generators”, π∗ detects equivalences.)

example: C = Top≥1∗ , G = Snn≥1.

example: C = Spectra, G = Snn∈Z.

Aaron Mazel-Gee GHOsT for∞-categories

Page 24: Every love story is a GHOsT story: Goerss–Hopkins obstruction ...

IntroductionObstruction theory

Model∞-categories

setup (for simplicity, just BDG obstrn theory; the GHOsT story is kind of scary.)

C a presentable homotopy theory;

G a set of generators;

define “homotopy” functor

C Aπ∗

byπ∗X = [Sβ,X ]Sβ∈G.

(by defn of “generators”, π∗ detects equivalences.)

example: C = Top≥1∗ , G = Snn≥1.

example: C = Spectra, G = Snn∈Z.

Aaron Mazel-Gee GHOsT for∞-categories

Page 25: Every love story is a GHOsT story: Goerss–Hopkins obstruction ...

C

AlgO(C)

PΣ(GEC )

sCE2

GEC

PΣ(T (GEC ))

AlgT (sC)E2

GEC

LE(AlgO(C))AlgO(LE(C)) AlgΦ(A) PδΣ(Φ(GA))

LE(AlgT (sC)) PΣ(TE(Aproj))

AlgT (sC)π∗E∗ AlgTE(sA)E2

GAAlgTE

(sA)Quillen

π 0

LE(C) A PδΣ(GA)

LE(sC) PΣ(GA)

sCπ∗E∗ sAE2GA

sAQuillen

Mod0(A)

PδΣ(GEC )

PδΣ(T (GEC ))

PΣ(Aproj)

π0,∗ π≥1

Modπ0,∗(PδΣ(GEC ))

π≥

1,∗

⊥ ⊥

d⊥

Q⊥ Q⊥

⊥ ⊥

d⊥ d⊥

Q⊥ Q⊥

⊥ ⊥ ⊥ ⊥

d⊥ d⊥ d⊥

Q⊥

Q⊥

Q⊥

Q⊥

Page 26: Every love story is a GHOsT story: Goerss–Hopkins obstruction ...

IntroductionObstruction theory

Model∞-categories

setup (for simplicity, just BDG obstrn theory; the GHOsT story is kind of scary.)

C a presentable homotopy theory;

G a set of generators;

define “homotopy” functor

C Aπ∗

byπ∗X = [Sβ,X ]Sβ∈G.

(by defn of “generators”, π∗ detects equivalences.)

example: C = Top≥1∗ , G = Snn≥1.

example: C = Spectra, G = Snn∈Z.

Aaron Mazel-Gee GHOsT for∞-categories

Page 27: Every love story is a GHOsT story: Goerss–Hopkins obstruction ...

IntroductionObstruction theory

Model∞-categories

setup (for simplicity, just BDG obstrn theory; the GHOsT story is kind of scary.)

C a presentable homotopy theory;

G a set of generators;

define “homotopy” functor

C Aπ∗

byπ∗X = [Sβ,X ]Sβ∈G.

(by defn of “generators”, π∗ detects equivalences.)

example: C = Top≥1∗ , G = Snn≥1.

example: C = Spectra, G = Snn∈Z.

Aaron Mazel-Gee GHOsT for∞-categories

Page 28: Every love story is a GHOsT story: Goerss–Hopkins obstruction ...

IntroductionObstruction theory

Model∞-categories

C Aπ∗

goal: given A ∈ A, want to understand M (A) ⊂ C.

key tool: Postnikov methods.

problem: π∗ not necessarily bounded-below: nowhere to start.(e.g. htpy groups of spectra are Z-graded.)

solution: “flip Z’s worth of π∗ on its side” and resolve “upwards”in a new simplicial direction.

Aaron Mazel-Gee GHOsT for∞-categories

Page 29: Every love story is a GHOsT story: Goerss–Hopkins obstruction ...

IntroductionObstruction theory

Model∞-categories

C Aπ∗

goal: given A ∈ A, want to understand M (A) ⊂ C.

key tool: Postnikov methods.

problem: π∗ not necessarily bounded-below: nowhere to start.(e.g. htpy groups of spectra are Z-graded.)

solution: “flip Z’s worth of π∗ on its side” and resolve “upwards”in a new simplicial direction.

Aaron Mazel-Gee GHOsT for∞-categories

Page 30: Every love story is a GHOsT story: Goerss–Hopkins obstruction ...

IntroductionObstruction theory

Model∞-categories

C Aπ∗

goal: given A ∈ A, want to understand M (A) ⊂ C.

key tool: Postnikov methods.

problem: π∗ not necessarily bounded-below: nowhere to start.(e.g. htpy groups of spectra are Z-graded.)

solution: “flip Z’s worth of π∗ on its side” and resolve “upwards”in a new simplicial direction.

Aaron Mazel-Gee GHOsT for∞-categories

Page 31: Every love story is a GHOsT story: Goerss–Hopkins obstruction ...

IntroductionObstruction theory

Model∞-categories

So, work in sC. We have a homotopy spectral sequence

E 2 = π∗(πlw∗ X )⇒ π∗|X |.

question: When does X ∈ sC have |X | ∈M (A)?

easiest answer: When the spectral sequence collapses!

E 2 =

A

0

πi (πlw∗ X) ∼=

A, i = 00, i > 0

Aaron Mazel-Gee GHOsT for∞-categories

Page 32: Every love story is a GHOsT story: Goerss–Hopkins obstruction ...

IntroductionObstruction theory

Model∞-categories

So, work in sC. We have a homotopy spectral sequence

E 2 = π∗(πlw∗ X )⇒ π∗|X |.

question: When does X ∈ sC have |X | ∈M (A)?

easiest answer: When the spectral sequence collapses!

E 2 =

A

0

πi (πlw∗ X) ∼=

A, i = 00, i > 0

Aaron Mazel-Gee GHOsT for∞-categories

Page 33: Every love story is a GHOsT story: Goerss–Hopkins obstruction ...

IntroductionObstruction theory

Model∞-categories

call such an X ∈ sC an ∞-stage for A.

sC C

(∞-stages) M (A)

|−|

recall: want to study M (A) want this to be an equivalence!

obviously false as stated: a map X → Y of ∞-stages can be an isoon E 2 = π∗(π

lw∗ (−)) (so that |X | ∼−→ |Y |) even if it’s not a

levelwise equivalence, i.e. an iso on E 1 = πlw∗ (−).

invert such “E 2-equivalences” E 2-model structure on sC

moduli space M∞(A) ⊂ sCE2 of ∞-stages for A

Aaron Mazel-Gee GHOsT for∞-categories

Page 34: Every love story is a GHOsT story: Goerss–Hopkins obstruction ...

IntroductionObstruction theory

Model∞-categories

call such an X ∈ sC an ∞-stage for A.

sC C

(∞-stages) M (A)

|−|

recall: want to study M (A) want this to be an equivalence!

obviously false as stated: a map X → Y of ∞-stages can be an isoon E 2 = π∗(π

lw∗ (−)) (so that |X | ∼−→ |Y |) even if it’s not a

levelwise equivalence, i.e. an iso on E 1 = πlw∗ (−).

invert such “E 2-equivalences” E 2-model structure on sC

moduli space M∞(A) ⊂ sCE2 of ∞-stages for A

Aaron Mazel-Gee GHOsT for∞-categories

Page 35: Every love story is a GHOsT story: Goerss–Hopkins obstruction ...

IntroductionObstruction theory

Model∞-categories

call such an X ∈ sC an ∞-stage for A.

sC C

(∞-stages) M (A)

|−|

recall: want to study M (A) want this to be an equivalence!

obviously false as stated: a map X → Y of ∞-stages can be an isoon E 2 = π∗(π

lw∗ (−)) (so that |X | ∼−→ |Y |) even if it’s not a

levelwise equivalence, i.e. an iso on E 1 = πlw∗ (−).

invert such “E 2-equivalences” E 2-model structure on sC

moduli space M∞(A) ⊂ sCE2 of ∞-stages for A

Aaron Mazel-Gee GHOsT for∞-categories

Page 36: Every love story is a GHOsT story: Goerss–Hopkins obstruction ...

IntroductionObstruction theory

Model∞-categories

It turns out that this is just what we need:

sCE2 C

M∞(A) M (A)

|−|

moral reason: ∞-stages only have πiπlw∗ at i = 0

maps between them are totally determined by behavior on π0πlw∗

great!

step 2: find a Postnikov decomposition of M∞(A).

“global” version of Postnikov tower

Aaron Mazel-Gee GHOsT for∞-categories

Page 37: Every love story is a GHOsT story: Goerss–Hopkins obstruction ...

IntroductionObstruction theory

Model∞-categories

It turns out that this is just what we need:

sCE2 C

M∞(A) M (A)

|−|

moral reason: ∞-stages only have πiπlw∗ at i = 0

maps between them are totally determined by behavior on π0πlw∗

great!

step 2: find a Postnikov decomposition of M∞(A).

“global” version of Postnikov tower

Aaron Mazel-Gee GHOsT for∞-categories

Page 38: Every love story is a GHOsT story: Goerss–Hopkins obstruction ...

IntroductionObstruction theory

Model∞-categories

Define an n-stage for A to be X ∈ sC with

E 2 =

A

Ωn+1A

0

n+2

∼= ∼= ∼=

(really, n-truncation of the “hidden” part of the exact couple for an ∞-stage)

moduli space Mn(A) ⊂ sCE2 of n-stages for A.

have “truncation” functors Mn(A)Pn−1−−−→Mn−1(A), and

M (A)∼←−M∞(A)

lim−−→ · · · →M2(A)P1−→M1(A)

P0−→M0(A).

Aaron Mazel-Gee GHOsT for∞-categories

Page 39: Every love story is a GHOsT story: Goerss–Hopkins obstruction ...

IntroductionObstruction theory

Model∞-categories

Define an n-stage for A to be X ∈ sC with

E 2 =

A

Ωn+1A

0

n+2

∼= ∼= ∼=

(really, n-truncation of the “hidden” part of the exact couple for an ∞-stage)

moduli space Mn(A) ⊂ sCE2 of n-stages for A.

have “truncation” functors Mn(A)Pn−1−−−→Mn−1(A), and

M (A)∼←−M∞(A)

lim−−→ · · · →M2(A)P1−→M1(A)

P0−→M0(A).

Aaron Mazel-Gee GHOsT for∞-categories

Page 40: Every love story is a GHOsT story: Goerss–Hopkins obstruction ...

IntroductionObstruction theory

Model∞-categories

climbing the tower: where does the AQ coh come from?

we just saw: if Y ∈Mn−1(A), then πi (πlw∗ Y ) ∼=

A, i = 0ΩnA, i = n + 10, otherwise.

however, for Y to extend to an n-stage, actually need to have aweak equivalence (!) πlw

∗ Y ' A n (ΩnA)[n + 1] in sA.(as always, the abstract π∗-iso isn’t enough: need a map inducing it.)

in sAA/, we have Loops(A n M[k]) ' A n M[k − 1].

have algebraic Postnikov theory in sA, giving ho-p.b. squareπlw∗ Y A

A ' Palgn (πlw

∗ Y ) A n (ΩnA)[n + 2]

Palgn

kalgn

need kalgn to be trivial, i.e. to represent 0 ∈ Hn+2

AQ (A,ΩnA).

obstrns to existence really do lie in Hn+2AQ (A,ΩnA)! :o)

Aaron Mazel-Gee GHOsT for∞-categories

Page 41: Every love story is a GHOsT story: Goerss–Hopkins obstruction ...

IntroductionObstruction theory

Model∞-categories

climbing the tower: where does the AQ coh come from?

we just saw: if Y ∈Mn−1(A), then πi (πlw∗ Y ) ∼=

A, i = 0ΩnA, i = n + 10, otherwise.

however, for Y to extend to an n-stage, actually need to have aweak equivalence (!) πlw

∗ Y ' A n (ΩnA)[n + 1] in sA.(as always, the abstract π∗-iso isn’t enough: need a map inducing it.)

in sAA/, we have Loops(A n M[k]) ' A n M[k − 1].

have algebraic Postnikov theory in sA, giving ho-p.b. squareπlw∗ Y A

A ' Palgn (πlw

∗ Y ) A n (ΩnA)[n + 2]

Palgn

kalgn

need kalgn to be trivial, i.e. to represent 0 ∈ Hn+2

AQ (A,ΩnA).

obstrns to existence really do lie in Hn+2AQ (A,ΩnA)! :o)

Aaron Mazel-Gee GHOsT for∞-categories

Page 42: Every love story is a GHOsT story: Goerss–Hopkins obstruction ...

IntroductionObstruction theory

Model∞-categories

climbing the tower: where does the AQ coh come from?

we just saw: if Y ∈Mn−1(A), then πi (πlw∗ Y ) ∼=

A, i = 0ΩnA, i = n + 10, otherwise.

however, for Y to extend to an n-stage, actually need to have aweak equivalence (!) πlw

∗ Y ' A n (ΩnA)[n + 1] in sA.(as always, the abstract π∗-iso isn’t enough: need a map inducing it.)

in sAA/, we have Loops(A n M[k]) ' A n M[k − 1].

have algebraic Postnikov theory in sA, giving ho-p.b. squareπlw∗ Y A

A ' Palgn (πlw

∗ Y ) A n (ΩnA)[n + 2]

Palgn

kalgn

need kalgn to be trivial, i.e. to represent 0 ∈ Hn+2

AQ (A,ΩnA).

obstrns to existence really do lie in Hn+2AQ (A,ΩnA)! :o)

Aaron Mazel-Gee GHOsT for∞-categories

Page 43: Every love story is a GHOsT story: Goerss–Hopkins obstruction ...

IntroductionObstruction theory

Model∞-categories

climbing the tower: where does the AQ coh come from?

we just saw: if Y ∈Mn−1(A), then πi (πlw∗ Y ) ∼=

A, i = 0ΩnA, i = n + 10, otherwise.

however, for Y to extend to an n-stage, actually need to have aweak equivalence (!) πlw

∗ Y ' A n (ΩnA)[n + 1] in sA.(as always, the abstract π∗-iso isn’t enough: need a map inducing it.)

in sAA/, we have Loops(A n M[k]) ' A n M[k − 1].

have algebraic Postnikov theory in sA, giving ho-p.b. squareπlw∗ Y A

A ' Palgn (πlw

∗ Y ) A n (ΩnA)[n + 2]

Palgn

kalgn

need kalgn to be trivial, i.e. to represent 0 ∈ Hn+2

AQ (A,ΩnA).

obstrns to existence really do lie in Hn+2AQ (A,ΩnA)!

:o)

Aaron Mazel-Gee GHOsT for∞-categories

Page 44: Every love story is a GHOsT story: Goerss–Hopkins obstruction ...

IntroductionObstruction theory

Model∞-categories

climbing the tower: where does the AQ coh come from?

we just saw: if Y ∈Mn−1(A), then πi (πlw∗ Y ) ∼=

A, i = 0ΩnA, i = n + 10, otherwise.

however, for Y to extend to an n-stage, actually need to have aweak equivalence (!) πlw

∗ Y ' A n (ΩnA)[n + 1] in sA.(as always, the abstract π∗-iso isn’t enough: need a map inducing it.)

in sAA/, we have Loops(A n M[k]) ' A n M[k − 1].

have algebraic Postnikov theory in sA, giving ho-p.b. squareπlw∗ Y A

A ' Palgn (πlw

∗ Y ) A n (ΩnA)[n + 2]

Palgn

kalgn

need kalgn to be trivial, i.e. to represent 0 ∈ Hn+2

AQ (A,ΩnA).

obstrns to existence really do lie in Hn+2AQ (A,ΩnA)! :o)

Aaron Mazel-Gee GHOsT for∞-categories

Page 45: Every love story is a GHOsT story: Goerss–Hopkins obstruction ...

IntroductionObstruction theory

Model∞-categories

towards a GHOsT for ∞-categories

recall: for M a model category, obstrn thy takes place in sME2 .

fact: if M C, then sME2 PΣ(G) = FunΣ(Gop, S), the∞-category of product-preserving presheaves of spaces on G.(WLOG, the set G (of generators of C) is closed under finite coproducts)(a/k/a the nonabelian derived ∞-category of C)

problem: The setup of GHOsT uses the actual 1-category sM –and its E 2-model structure – to make computations in sM[W−1

E2 ].How can we do this in the ∞-categorical context?

solution: We need an “E 2-model structure” on the ∞-category sCwhich presents the ∞-category PΣ(G)!

two ingredients in generalizing GHOsT to ∞-categories:1 a theory of model ∞-categories.2 plagiarism.

Aaron Mazel-Gee GHOsT for∞-categories

Page 46: Every love story is a GHOsT story: Goerss–Hopkins obstruction ...

IntroductionObstruction theory

Model∞-categories

towards a GHOsT for ∞-categories

recall: for M a model category, obstrn thy takes place in sME2 .

fact: if M C, then sME2 PΣ(G) = FunΣ(Gop, S), the∞-category of product-preserving presheaves of spaces on G.(WLOG, the set G (of generators of C) is closed under finite coproducts)(a/k/a the nonabelian derived ∞-category of C)

problem: The setup of GHOsT uses the actual 1-category sM –and its E 2-model structure – to make computations in sM[W−1

E2 ].How can we do this in the ∞-categorical context?

solution: We need an “E 2-model structure” on the ∞-category sCwhich presents the ∞-category PΣ(G)!

two ingredients in generalizing GHOsT to ∞-categories:1 a theory of model ∞-categories.2 plagiarism.

Aaron Mazel-Gee GHOsT for∞-categories

Page 47: Every love story is a GHOsT story: Goerss–Hopkins obstruction ...

IntroductionObstruction theory

Model∞-categories

towards a GHOsT for ∞-categories

recall: for M a model category, obstrn thy takes place in sME2 .

fact: if M C, then sME2 PΣ(G) = FunΣ(Gop, S), the∞-category of product-preserving presheaves of spaces on G.(WLOG, the set G (of generators of C) is closed under finite coproducts)(a/k/a the nonabelian derived ∞-category of C)

problem: The setup of GHOsT uses the actual 1-category sM –and its E 2-model structure – to make computations in sM[W−1

E2 ].How can we do this in the ∞-categorical context?

solution: We need an “E 2-model structure” on the ∞-category sCwhich presents the ∞-category PΣ(G)!

two ingredients in generalizing GHOsT to ∞-categories:1 a theory of model ∞-categories.2 plagiarism.

Aaron Mazel-Gee GHOsT for∞-categories

Page 48: Every love story is a GHOsT story: Goerss–Hopkins obstruction ...

IntroductionObstruction theory

Model∞-categories

towards a GHOsT for ∞-categories

recall: for M a model category, obstrn thy takes place in sME2 .

fact: if M C, then sME2 PΣ(G) = FunΣ(Gop, S), the∞-category of product-preserving presheaves of spaces on G.(WLOG, the set G (of generators of C) is closed under finite coproducts)(a/k/a the nonabelian derived ∞-category of C)

problem: The setup of GHOsT uses the actual 1-category sM –and its E 2-model structure – to make computations in sM[W−1

E2 ].How can we do this in the ∞-categorical context?

solution: We need an “E 2-model structure” on the ∞-category sCwhich presents the ∞-category PΣ(G)!

two ingredients in generalizing GHOsT to ∞-categories:1 a theory of model ∞-categories.2 plagiarism.

Aaron Mazel-Gee GHOsT for∞-categories

Page 49: Every love story is a GHOsT story: Goerss–Hopkins obstruction ...

IntroductionObstruction theory

Model∞-categories

towards a GHOsT for ∞-categories

recall: for M a model category, obstrn thy takes place in sME2 .

fact: if M C, then sME2 PΣ(G) = FunΣ(Gop, S), the∞-category of product-preserving presheaves of spaces on G.(WLOG, the set G (of generators of C) is closed under finite coproducts)(a/k/a the nonabelian derived ∞-category of C)

problem: The setup of GHOsT uses the actual 1-category sM –and its E 2-model structure – to make computations in sM[W−1

E2 ].How can we do this in the ∞-categorical context?

solution: We need an “E 2-model structure” on the ∞-category sCwhich presents the ∞-category PΣ(G)!

two ingredients in generalizing GHOsT to ∞-categories:

1 a theory of model ∞-categories.2 plagiarism.

Aaron Mazel-Gee GHOsT for∞-categories

Page 50: Every love story is a GHOsT story: Goerss–Hopkins obstruction ...

IntroductionObstruction theory

Model∞-categories

towards a GHOsT for ∞-categories

recall: for M a model category, obstrn thy takes place in sME2 .

fact: if M C, then sME2 PΣ(G) = FunΣ(Gop, S), the∞-category of product-preserving presheaves of spaces on G.(WLOG, the set G (of generators of C) is closed under finite coproducts)(a/k/a the nonabelian derived ∞-category of C)

problem: The setup of GHOsT uses the actual 1-category sM –and its E 2-model structure – to make computations in sM[W−1

E2 ].How can we do this in the ∞-categorical context?

solution: We need an “E 2-model structure” on the ∞-category sCwhich presents the ∞-category PΣ(G)!

two ingredients in generalizing GHOsT to ∞-categories:1 a theory of model ∞-categories.

2 plagiarism.

Aaron Mazel-Gee GHOsT for∞-categories

Page 51: Every love story is a GHOsT story: Goerss–Hopkins obstruction ...

IntroductionObstruction theory

Model∞-categories

towards a GHOsT for ∞-categories

recall: for M a model category, obstrn thy takes place in sME2 .

fact: if M C, then sME2 PΣ(G) = FunΣ(Gop, S), the∞-category of product-preserving presheaves of spaces on G.(WLOG, the set G (of generators of C) is closed under finite coproducts)(a/k/a the nonabelian derived ∞-category of C)

problem: The setup of GHOsT uses the actual 1-category sM –and its E 2-model structure – to make computations in sM[W−1

E2 ].How can we do this in the ∞-categorical context?

solution: We need an “E 2-model structure” on the ∞-category sCwhich presents the ∞-category PΣ(G)!

two ingredients in generalizing GHOsT to ∞-categories:1 a theory of model ∞-categories.2 plagiarism.

Aaron Mazel-Gee GHOsT for∞-categories

Page 52: Every love story is a GHOsT story: Goerss–Hopkins obstruction ...

IntroductionObstruction theory

Model∞-categories

3. Model ∞-categories

Aaron Mazel-Gee GHOsT for∞-categories

Page 53: Every love story is a GHOsT story: Goerss–Hopkins obstruction ...

IntroductionObstruction theory

Model∞-categories

A model structure on a category M allows us to effectivelycompute the hom-sets

homM[W−1](x , y).

A model structure on an ∞-category M allows us to effectivelycompute the hom-spaces

homM[W−1](x , y).

axioms: almost identical, but careful with lifting axiom: instead ofasking for an epimorphism of sets, want an effective epimorphismof spaces (i.e. π0-surjection).

N.B.: ∞-categories are already homotopically well-behaved . has more to do with interesting mathematical structures(namely, with resolutions) than with eliminating pathologies (e.g.replacing spaces with CW-cxes).

Aaron Mazel-Gee GHOsT for∞-categories

Page 54: Every love story is a GHOsT story: Goerss–Hopkins obstruction ...

IntroductionObstruction theory

Model∞-categories

A model structure on an ∞-category M allows us to effectivelycompute the hom-spaces

homM[W−1](x , y).

axioms: almost identical, but careful with lifting axiom: instead ofasking for an epimorphism of sets, want an effective epimorphismof spaces (i.e. π0-surjection).

N.B.: ∞-categories are already homotopically well-behaved . has more to do with interesting mathematical structures(namely, with resolutions) than with eliminating pathologies (e.g.replacing spaces with CW-cxes).

Aaron Mazel-Gee GHOsT for∞-categories

Page 55: Every love story is a GHOsT story: Goerss–Hopkins obstruction ...

IntroductionObstruction theory

Model∞-categories

A model structure on an ∞-category M allows us to effectivelycompute the hom-spaces

homM[W−1](x , y).

axioms: almost identical, but careful with lifting axiom: instead ofasking for an epimorphism of sets, want an effective epimorphismof spaces (i.e. π0-surjection).

N.B.: ∞-categories are already homotopically well-behaved . has more to do with interesting mathematical structures(namely, with resolutions) than with eliminating pathologies (e.g.replacing spaces with CW-cxes).

Aaron Mazel-Gee GHOsT for∞-categories

Page 56: Every love story is a GHOsT story: Goerss–Hopkins obstruction ...

IntroductionObstruction theory

Model∞-categories

A model structure on an ∞-category M allows us to effectivelycompute the hom-spaces

homM[W−1](x , y).

axioms: almost identical, but careful with lifting axiom: instead ofasking for an epimorphism of sets, want an effective epimorphismof spaces (i.e. π0-surjection).

N.B.: ∞-categories are already homotopically well-behaved . has more to do with interesting mathematical structures(namely, with resolutions) than with eliminating pathologies (e.g.replacing spaces with CW-cxes).

Aaron Mazel-Gee GHOsT for∞-categories

Page 57: Every love story is a GHOsT story: Goerss–Hopkins obstruction ...

IntroductionObstruction theory

Model∞-categories

A model structure on an ∞-category M allows us to effectivelycompute the hom-spaces

homM[W−1](x , y).

axioms: almost identical, but careful with lifting axiom: instead ofasking for an epimorphism of sets, want an effective epimorphismof spaces (i.e. π0-surjection).

N.B.: ∞-categories are already homotopically well-behaved . has more to do with interesting mathematical structures(namely, with resolutions) than with eliminating pathologies (e.g.replacing spaces with CW-cxes).

Aaron Mazel-Gee GHOsT for∞-categories

Page 58: Every love story is a GHOsT story: Goerss–Hopkins obstruction ...

IntroductionObstruction theory

Model∞-categories

first examples

trivial model structure: W = M', C = F = M.model 1-categories.Reedy and E 2 model structures on sC.left localizn L : M LM : i gives model structure on M

presenting LM 'M[W−1]. this has Mc = M, Mf = i(LM).(e.g. τ≤n : S S≤n, LQ : S SQ, |−| : sS S : const, LE : Sp LESp)

...and dually (so all obj’s fibt). (e.g. S≥n S : τ≥n)

a model structure is a simultaneous generalization of thenotions of left and right localizations.

another perspective: model structures on ∞-categories cancompute the composition of total derived functors of (classical)left and right Quillen functors.(e.g. sC→ sC[W−1

E2 ] ' PΣ(G) is a right adjoint followed by a left adjoint)

Aaron Mazel-Gee GHOsT for∞-categories

Page 59: Every love story is a GHOsT story: Goerss–Hopkins obstruction ...

IntroductionObstruction theory

Model∞-categories

first examples

trivial model structure: W = M', C = F = M.

model 1-categories.Reedy and E 2 model structures on sC.left localizn L : M LM : i gives model structure on M

presenting LM 'M[W−1]. this has Mc = M, Mf = i(LM).(e.g. τ≤n : S S≤n, LQ : S SQ, |−| : sS S : const, LE : Sp LESp)

...and dually (so all obj’s fibt). (e.g. S≥n S : τ≥n)

a model structure is a simultaneous generalization of thenotions of left and right localizations.

another perspective: model structures on ∞-categories cancompute the composition of total derived functors of (classical)left and right Quillen functors.(e.g. sC→ sC[W−1

E2 ] ' PΣ(G) is a right adjoint followed by a left adjoint)

Aaron Mazel-Gee GHOsT for∞-categories

Page 60: Every love story is a GHOsT story: Goerss–Hopkins obstruction ...

IntroductionObstruction theory

Model∞-categories

first examples

trivial model structure: W = M', C = F = M.model 1-categories.

Reedy and E 2 model structures on sC.left localizn L : M LM : i gives model structure on M

presenting LM 'M[W−1]. this has Mc = M, Mf = i(LM).(e.g. τ≤n : S S≤n, LQ : S SQ, |−| : sS S : const, LE : Sp LESp)

...and dually (so all obj’s fibt). (e.g. S≥n S : τ≥n)

a model structure is a simultaneous generalization of thenotions of left and right localizations.

another perspective: model structures on ∞-categories cancompute the composition of total derived functors of (classical)left and right Quillen functors.(e.g. sC→ sC[W−1

E2 ] ' PΣ(G) is a right adjoint followed by a left adjoint)

Aaron Mazel-Gee GHOsT for∞-categories

Page 61: Every love story is a GHOsT story: Goerss–Hopkins obstruction ...

IntroductionObstruction theory

Model∞-categories

first examples

trivial model structure: W = M', C = F = M.model 1-categories.Reedy and E 2 model structures on sC.

left localizn L : M LM : i gives model structure on M

presenting LM 'M[W−1]. this has Mc = M, Mf = i(LM).(e.g. τ≤n : S S≤n, LQ : S SQ, |−| : sS S : const, LE : Sp LESp)

...and dually (so all obj’s fibt). (e.g. S≥n S : τ≥n)

a model structure is a simultaneous generalization of thenotions of left and right localizations.

another perspective: model structures on ∞-categories cancompute the composition of total derived functors of (classical)left and right Quillen functors.(e.g. sC→ sC[W−1

E2 ] ' PΣ(G) is a right adjoint followed by a left adjoint)

Aaron Mazel-Gee GHOsT for∞-categories

Page 62: Every love story is a GHOsT story: Goerss–Hopkins obstruction ...

IntroductionObstruction theory

Model∞-categories

first examples

trivial model structure: W = M', C = F = M.model 1-categories.Reedy and E 2 model structures on sC.left localizn L : M LM : i gives model structure on M

presenting LM 'M[W−1]. this has Mc = M, Mf = i(LM).(e.g. τ≤n : S S≤n, LQ : S SQ, |−| : sS S : const, LE : Sp LESp)

...and dually (so all obj’s fibt). (e.g. S≥n S : τ≥n)

a model structure is a simultaneous generalization of thenotions of left and right localizations.

another perspective: model structures on ∞-categories cancompute the composition of total derived functors of (classical)left and right Quillen functors.(e.g. sC→ sC[W−1

E2 ] ' PΣ(G) is a right adjoint followed by a left adjoint)

Aaron Mazel-Gee GHOsT for∞-categories

Page 63: Every love story is a GHOsT story: Goerss–Hopkins obstruction ...

IntroductionObstruction theory

Model∞-categories

first examples

trivial model structure: W = M', C = F = M.model 1-categories.Reedy and E 2 model structures on sC.left localizn L : M LM : i gives model structure on M

presenting LM 'M[W−1]. this has Mc = M, Mf = i(LM).(e.g. τ≤n : S S≤n, LQ : S SQ, |−| : sS S : const, LE : Sp LESp)

...and dually (so all obj’s fibt). (e.g. S≥n S : τ≥n)

a model structure is a simultaneous generalization of thenotions of left and right localizations.

another perspective: model structures on ∞-categories cancompute the composition of total derived functors of (classical)left and right Quillen functors.(e.g. sC→ sC[W−1

E2 ] ' PΣ(G) is a right adjoint followed by a left adjoint)

Aaron Mazel-Gee GHOsT for∞-categories

Page 64: Every love story is a GHOsT story: Goerss–Hopkins obstruction ...

IntroductionObstruction theory

Model∞-categories

first examples

trivial model structure: W = M', C = F = M.model 1-categories.Reedy and E 2 model structures on sC.left localizn L : M LM : i gives model structure on M

presenting LM 'M[W−1]. this has Mc = M, Mf = i(LM).(e.g. τ≤n : S S≤n, LQ : S SQ, |−| : sS S : const, LE : Sp LESp)

...and dually (so all obj’s fibt). (e.g. S≥n S : τ≥n)

a model structure is a simultaneous generalization of thenotions of left and right localizations.

another perspective: model structures on ∞-categories cancompute the composition of total derived functors of (classical)left and right Quillen functors.(e.g. sC→ sC[W−1

E2 ] ' PΣ(G) is a right adjoint followed by a left adjoint)

Aaron Mazel-Gee GHOsT for∞-categories

Page 65: Every love story is a GHOsT story: Goerss–Hopkins obstruction ...

IntroductionObstruction theory

Model∞-categories

first examples

trivial model structure: W = M', C = F = M.model 1-categories.Reedy and E 2 model structures on sC.left localizn L : M LM : i gives model structure on M

presenting LM 'M[W−1]. this has Mc = M, Mf = i(LM).(e.g. τ≤n : S S≤n, LQ : S SQ, |−| : sS S : const, LE : Sp LESp)

...and dually (so all obj’s fibt). (e.g. S≥n S : τ≥n)

a model structure is a simultaneous generalization of thenotions of left and right localizations.

another perspective: model structures on ∞-categories cancompute the composition of total derived functors of (classical)left and right Quillen functors.(e.g. sC→ sC[W−1

E2 ] ' PΣ(G) is a right adjoint followed by a left adjoint)

Aaron Mazel-Gee GHOsT for∞-categories

Page 66: Every love story is a GHOsT story: Goerss–Hopkins obstruction ...

IntroductionObstruction theory

Model∞-categories

computing hom-spaces

model 1-categories: start with a set of maps, quotient byrelations to obtain a set of “homotopy classes of maps”.

taking a quotient goes against the core thesis of higher categorytheory : instead, remember the relations, build them into a spaceof “homotopy classes of maps”.

recall: in a model 1-category, a cylinder for x ∈M is a factorizn

x t x cyl(x)≈−→ x ,

and a path for y ∈M is a factorizn

y ≈−→ path(y) y × y .

model ∞-categories: don’t truncate these co/simplicial objects! a cylinder obj is cyl•(x) ∈ cM, a path obj is path•(y) ∈ sM.(“cofibt W-cohypercover” and “fibt W-hypercover”, resp.)

Aaron Mazel-Gee GHOsT for∞-categories

Page 67: Every love story is a GHOsT story: Goerss–Hopkins obstruction ...

IntroductionObstruction theory

Model∞-categories

computing hom-spaces

model 1-categories: start with a set of maps, quotient byrelations to obtain a set of “homotopy classes of maps”.

taking a quotient goes against the core thesis of higher categorytheory : instead, remember the relations, build them into a spaceof “homotopy classes of maps”.

recall: in a model 1-category, a cylinder for x ∈M is a factorizn

x t x cyl(x)≈−→ x ,

and a path for y ∈M is a factorizn

y ≈−→ path(y) y × y .

model ∞-categories: don’t truncate these co/simplicial objects! a cylinder obj is cyl•(x) ∈ cM, a path obj is path•(y) ∈ sM.(“cofibt W-cohypercover” and “fibt W-hypercover”, resp.)

Aaron Mazel-Gee GHOsT for∞-categories

Page 68: Every love story is a GHOsT story: Goerss–Hopkins obstruction ...

IntroductionObstruction theory

Model∞-categories

computing hom-spaces

model 1-categories: start with a set of maps, quotient byrelations to obtain a set of “homotopy classes of maps”.

taking a quotient goes against the core thesis of higher categorytheory : instead, remember the relations, build them into a spaceof “homotopy classes of maps”.

recall: in a model 1-category, a cylinder for x ∈M is a factorizn

x t x cyl(x)≈−→ x ,

and a path for y ∈M is a factorizn

y ≈−→ path(y) y × y .

model ∞-categories: don’t truncate these co/simplicial objects! a cylinder obj is cyl•(x) ∈ cM, a path obj is path•(y) ∈ sM.(“cofibt W-cohypercover” and “fibt W-hypercover”, resp.)

Aaron Mazel-Gee GHOsT for∞-categories

Page 69: Every love story is a GHOsT story: Goerss–Hopkins obstruction ...

IntroductionObstruction theory

Model∞-categories

1-topos theory : quotient by an equivce reln ::∞-topos theory : geom realizn of a simplicial object

define space of left htpy classes of maps by

homl∼M(x , y) =

∣∣∣homlwM(cyl•(x), y)

∣∣∣and space of right htpy classes of maps by

homr∼M(x , y) =

∣∣∣homlwM(x , path•(y))

∣∣∣ .

Aaron Mazel-Gee GHOsT for∞-categories

Page 70: Every love story is a GHOsT story: Goerss–Hopkins obstruction ...

IntroductionObstruction theory

Model∞-categories

fundamental theorem of model ∞-categories

if x cofibt and y fibt, then for any cylinder/path obj’s,

homl∼M(x , y) homM[W−1](x , y) hom

r∼M(x , y).∼ ∼

proof uses model two important model ∞-categories:the Quillen model structure on sS,the Thomason model structure on Cat∞.

(can’t use fund thm here: must prove things in these model ∞-cats by hand!)

Aaron Mazel-Gee GHOsT for∞-categories

Page 71: Every love story is a GHOsT story: Goerss–Hopkins obstruction ...

IntroductionObstruction theory

Model∞-categories

fundamental theorem of model ∞-categories

if x cofibt and y fibt, then for any cylinder/path obj’s,

homl∼M(x , y) homM[W−1](x , y) hom

r∼M(x , y).∼ ∼

proof uses model two important model ∞-categories:the Quillen model structure on sS,the Thomason model structure on Cat∞.

(can’t use fund thm here: must prove things in these model ∞-cats by hand!)

Aaron Mazel-Gee GHOsT for∞-categories

Page 72: Every love story is a GHOsT story: Goerss–Hopkins obstruction ...

IntroductionObstruction theory

Model∞-categories

Quillen model structure on sS

model 1-cats enriched in sets sSetQ plays a distinguished role.model ∞-cats enriched in spaces sSQ plays a distinguished role.

both give “presentations of spaces” via geometric realization.

write

π0 : sS sSet : δ, IQ = ∂∆n → ∆nn≥0, JQ = Λni → ∆n0≤i≤n>0.

(for sSetQ, IQ = generating cofibns and JQ = generating acyclic cofibns.)

then, sSQuillen is cofibtly generated too:IsSQ = δ(IQ) and J sS

Q = δ(JQ);WQ = Wcolim created by colim = |−| : sS→ S.

sSQ sSetQ a Quillen equivce! (derived adjunction is Sid S.)

Aaron Mazel-Gee GHOsT for∞-categories

Page 73: Every love story is a GHOsT story: Goerss–Hopkins obstruction ...

IntroductionObstruction theory

Model∞-categories

Quillen model structure on sS

model 1-cats enriched in sets sSetQ plays a distinguished role.model ∞-cats enriched in spaces sSQ plays a distinguished role.

both give “presentations of spaces” via geometric realization.

write

π0 : sS sSet : δ, IQ = ∂∆n → ∆nn≥0, JQ = Λni → ∆n0≤i≤n>0.

(for sSetQ, IQ = generating cofibns and JQ = generating acyclic cofibns.)

then, sSQuillen is cofibtly generated too:IsSQ = δ(IQ) and J sS

Q = δ(JQ);WQ = Wcolim created by colim = |−| : sS→ S.

sSQ sSetQ a Quillen equivce! (derived adjunction is Sid S.)

Aaron Mazel-Gee GHOsT for∞-categories

Page 74: Every love story is a GHOsT story: Goerss–Hopkins obstruction ...

IntroductionObstruction theory

Model∞-categories

Quillen model structure on sS

model 1-cats enriched in sets sSetQ plays a distinguished role.model ∞-cats enriched in spaces sSQ plays a distinguished role.

both give “presentations of spaces” via geometric realization.

write

π0 : sS sSet : δ, IQ = ∂∆n → ∆nn≥0, JQ = Λni → ∆n0≤i≤n>0.

(for sSetQ, IQ = generating cofibns and JQ = generating acyclic cofibns.)

then, sSQuillen is cofibtly generated too:IsSQ = δ(IQ) and J sS

Q = δ(JQ);WQ = Wcolim created by colim = |−| : sS→ S.

sSQ sSetQ a Quillen equivce! (derived adjunction is Sid S.)

Aaron Mazel-Gee GHOsT for∞-categories

Page 75: Every love story is a GHOsT story: Goerss–Hopkins obstruction ...

IntroductionObstruction theory

Model∞-categories

Quillen model structure on sS

model 1-cats enriched in sets sSetQ plays a distinguished role.model ∞-cats enriched in spaces sSQ plays a distinguished role.

both give “presentations of spaces” via geometric realization.

write

π0 : sS sSet : δ, IQ = ∂∆n → ∆nn≥0, JQ = Λni → ∆n0≤i≤n>0.

(for sSetQ, IQ = generating cofibns and JQ = generating acyclic cofibns.)

then, sSQuillen is cofibtly generated too:IsSQ = δ(IQ) and J sS

Q = δ(JQ);WQ = Wcolim created by colim = |−| : sS→ S.

sSQ sSetQ a Quillen equivce! (derived adjunction is Sid S.)

Aaron Mazel-Gee GHOsT for∞-categories

Page 76: Every love story is a GHOsT story: Goerss–Hopkins obstruction ...

IntroductionObstruction theory

Model∞-categories

Quillen model structure on sS

model 1-cats enriched in sets sSetQ plays a distinguished role.model ∞-cats enriched in spaces sSQ plays a distinguished role.

both give “presentations of spaces” via geometric realization.

write

π0 : sS sSet : δ, IQ = ∂∆n → ∆nn≥0, JQ = Λni → ∆n0≤i≤n>0.

(for sSetQ, IQ = generating cofibns and JQ = generating acyclic cofibns.)

then, sSQuillen is cofibtly generated too:IsSQ = δ(IQ) and J sS

Q = δ(JQ);WQ = Wcolim created by colim = |−| : sS→ S.

sSQ sSetQ a Quillen equivce! (derived adjunction is Sid S.)

Aaron Mazel-Gee GHOsT for∞-categories

Page 77: Every love story is a GHOsT story: Goerss–Hopkins obstruction ...

IntroductionObstruction theory

Model∞-categories

comparison with analogous results on sS from model 1-cats

Moerdijk model structure: diag! : sSetQQ. eq. ssSetMoer : diag∗,

IMoer = ∂∆n ∂∆n → ∆n ∆n.

· · · in sS, rlp(∂∆n Sn−1 → ∆n pt

)⊂WQ = Wcolim.

These maps have serious geometric content!

n = 2:IsSM IsS

Q

∂∆n Sn−1 δ(∆n) δ(∂∆n) δ(∆n)

only needing to check rlp(IsSQ ) is a substantial improvement.

similarly: ‘dreaded’ π∗-Kan condition for ho-p.b.’s in s(sSet)Reedy;replace with “htpy-coherent π0-Kan condition”.

moral: working with model ∞-cats allows us to replace maps infrom spheres with homotopy-coherent maps in from points.

Aaron Mazel-Gee GHOsT for∞-categories

Page 78: Every love story is a GHOsT story: Goerss–Hopkins obstruction ...

IntroductionObstruction theory

Model∞-categories

comparison with analogous results on sS from model 1-cats

Moerdijk model structure: diag! : sSetQQ. eq. ssSetMoer : diag∗,

IMoer = ∂∆n ∂∆n → ∆n ∆n.

· · · in sS, rlp(∂∆n Sn−1 → ∆n pt

)⊂WQ = Wcolim.

These maps have serious geometric content!

n = 2:IsSM IsS

Q

∂∆n Sn−1 δ(∆n) δ(∂∆n) δ(∆n)

only needing to check rlp(IsSQ ) is a substantial improvement.

similarly: ‘dreaded’ π∗-Kan condition for ho-p.b.’s in s(sSet)Reedy;replace with “htpy-coherent π0-Kan condition”.

moral: working with model ∞-cats allows us to replace maps infrom spheres with homotopy-coherent maps in from points.

Aaron Mazel-Gee GHOsT for∞-categories

Page 79: Every love story is a GHOsT story: Goerss–Hopkins obstruction ...

IntroductionObstruction theory

Model∞-categories

comparison with analogous results on sS from model 1-cats

Moerdijk model structure: diag! : sSetQQ. eq. ssSetMoer : diag∗,

IMoer = ∂∆n ∂∆n → ∆n ∆n.

· · · in sS, rlp(∂∆n Sn−1 → ∆n pt

)⊂WQ = Wcolim.

These maps have serious geometric content!

n = 2:IsSM IsS

Q

∂∆n Sn−1 δ(∆n) δ(∂∆n) δ(∆n)

only needing to check rlp(IsSQ ) is a substantial improvement.

similarly: ‘dreaded’ π∗-Kan condition for ho-p.b.’s in s(sSet)Reedy;replace with “htpy-coherent π0-Kan condition”.

moral: working with model ∞-cats allows us to replace maps infrom spheres with homotopy-coherent maps in from points.

Aaron Mazel-Gee GHOsT for∞-categories

Page 80: Every love story is a GHOsT story: Goerss–Hopkins obstruction ...

IntroductionObstruction theory

Model∞-categories

comparison with analogous results on sS from model 1-cats

Moerdijk model structure: diag! : sSetQQ. eq. ssSetMoer : diag∗,

IMoer = ∂∆n ∂∆n → ∆n ∆n.

· · · in sS, rlp(∂∆n Sn−1 → ∆n pt

)⊂WQ = Wcolim.

These maps have serious geometric content!

n = 2:IsSM IsS

Q

∂∆n Sn−1 δ(∆n) δ(∂∆n) δ(∆n)

only needing to check rlp(IsSQ ) is a substantial improvement.

similarly: ‘dreaded’ π∗-Kan condition for ho-p.b.’s in s(sSet)Reedy;replace with “htpy-coherent π0-Kan condition”.

moral: working with model ∞-cats allows us to replace maps infrom spheres with homotopy-coherent maps in from points.

Aaron Mazel-Gee GHOsT for∞-categories

Page 81: Every love story is a GHOsT story: Goerss–Hopkins obstruction ...

IntroductionObstruction theory

Model∞-categories

comparison with analogous results on sS from model 1-cats

Moerdijk model structure: diag! : sSetQQ. eq. ssSetMoer : diag∗,

IMoer = ∂∆n ∂∆n → ∆n ∆n.

· · · in sS, rlp(∂∆n Sn−1 → ∆n pt

)⊂WQ = Wcolim.

These maps have serious geometric content!

n = 2:IsSM IsS

Q

∂∆n Sn−1 δ(∆n) δ(∂∆n) δ(∆n)

only needing to check rlp(IsSQ ) is a substantial improvement.

similarly: ‘dreaded’ π∗-Kan condition for ho-p.b.’s in s(sSet)Reedy;replace with “htpy-coherent π0-Kan condition”.

moral: working with model ∞-cats allows us to replace maps infrom spheres with homotopy-coherent maps in from points.

Aaron Mazel-Gee GHOsT for∞-categories

Page 82: Every love story is a GHOsT story: Goerss–Hopkins obstruction ...

IntroductionObstruction theory

Model∞-categories

Thomason model structure on Cat∞

cofibtly gend, lifted directly along sSQ CSS ' Cat∞, which is aQuillen equivce (so this model ∞-cat also presents S).

WTh created by Cat∞CSS−−→ sS |−|−−→ S, i.e. by Cat∞

(−)gpd−−−−→ S.

fibrant objects are exactly the ∞-groupoids.

image of C ∈ Cat N−→ sSetQ or C ∈ Cat∞CSS−−→ sSQ is fibrant iff C is a groupoid .

note: 1-gpds only model 1-types, but ∞-gpds model all spaces.

CatTh can only be lifted along

ho sd2 : sSetQ sSet sSet Cat : Ex2 N,

at least if we want this to be a Quillen equivalence.

Aaron Mazel-Gee GHOsT for∞-categories

Page 83: Every love story is a GHOsT story: Goerss–Hopkins obstruction ...

IntroductionObstruction theory

Model∞-categories

Thomason model structure on Cat∞

cofibtly gend, lifted directly along sSQ CSS ' Cat∞, which is aQuillen equivce (so this model ∞-cat also presents S).

WTh created by Cat∞CSS−−→ sS |−|−−→ S, i.e. by Cat∞

(−)gpd−−−−→ S.

fibrant objects are exactly the ∞-groupoids.

image of C ∈ Cat N−→ sSetQ or C ∈ Cat∞CSS−−→ sSQ is fibrant iff C is a groupoid .

note: 1-gpds only model 1-types, but ∞-gpds model all spaces.

CatTh can only be lifted along

ho sd2 : sSetQ sSet sSet Cat : Ex2 N,

at least if we want this to be a Quillen equivalence.

Aaron Mazel-Gee GHOsT for∞-categories

Page 84: Every love story is a GHOsT story: Goerss–Hopkins obstruction ...

IntroductionObstruction theory

Model∞-categories

Thomason model structure on Cat∞

cofibtly gend, lifted directly along sSQ CSS ' Cat∞, which is aQuillen equivce (so this model ∞-cat also presents S).

WTh created by Cat∞CSS−−→ sS |−|−−→ S, i.e. by Cat∞

(−)gpd−−−−→ S.

fibrant objects are exactly the ∞-groupoids.

image of C ∈ Cat N−→ sSetQ or C ∈ Cat∞CSS−−→ sSQ is fibrant iff C is a groupoid .

note: 1-gpds only model 1-types, but ∞-gpds model all spaces.

CatTh can only be lifted along

ho sd2 : sSetQ sSet sSet Cat : Ex2 N,

at least if we want this to be a Quillen equivalence.

Aaron Mazel-Gee GHOsT for∞-categories

Page 85: Every love story is a GHOsT story: Goerss–Hopkins obstruction ...

IntroductionObstruction theory

Model∞-categories

Q.: why is this useful?A.: the Grothendieck construction, just as with CatTh.

e.g.: if C F−→ (Cat∞)Th, then Gr(F ) ≈ hocolim(F ), i.e.

Gr(F )gpd ' colim(C

F−→ Cat∞(−)gpd−−−−→ S

).

(think of F as “presenting” a C-shaped diagram in S.)

e.g.: ifC Cat∞

WTh

Fthen ∀x ∈ C,

F (x) Gr(F )

x C

is a ho-p.b.

in (Cat∞)Th, i.e.F (x)gpd Gr(F )gpd

xgpd Cgpd

is a p.b. in S.

(compare with Quillen’s Theorem B.)

Aaron Mazel-Gee GHOsT for∞-categories

Page 86: Every love story is a GHOsT story: Goerss–Hopkins obstruction ...

IntroductionObstruction theory

Model∞-categories

Q.: why is this useful?A.: the Grothendieck construction, just as with CatTh.

e.g.: if C F−→ (Cat∞)Th, then Gr(F ) ≈ hocolim(F ), i.e.

Gr(F )gpd ' colim(C

F−→ Cat∞(−)gpd−−−−→ S

).

(think of F as “presenting” a C-shaped diagram in S.)

e.g.: ifC Cat∞

WTh

Fthen ∀x ∈ C,

F (x) Gr(F )

x C

is a ho-p.b.

in (Cat∞)Th, i.e.F (x)gpd Gr(F )gpd

xgpd Cgpd

is a p.b. in S.

(compare with Quillen’s Theorem B.)

Aaron Mazel-Gee GHOsT for∞-categories

Page 87: Every love story is a GHOsT story: Goerss–Hopkins obstruction ...

IntroductionObstruction theory

Model∞-categories

Q.: why is this useful?A.: the Grothendieck construction, just as with CatTh.

e.g.: if C F−→ (Cat∞)Th, then Gr(F ) ≈ hocolim(F ), i.e.

Gr(F )gpd ' colim(C

F−→ Cat∞(−)gpd−−−−→ S

).

(think of F as “presenting” a C-shaped diagram in S.)

e.g.: ifC Cat∞

WTh

Fthen ∀x ∈ C,

F (x) Gr(F )

x C

is a ho-p.b.

in (Cat∞)Th, i.e.F (x)gpd Gr(F )gpd

xgpd Cgpd

is a p.b. in S.

(compare with Quillen’s Theorem B.)

Aaron Mazel-Gee GHOsT for∞-categories

Page 88: Every love story is a GHOsT story: Goerss–Hopkins obstruction ...

IntroductionObstruction theory

Model∞-categories

Q.: why is this useful?A.: the Grothendieck construction, just as with CatTh.

e.g.: if C F−→ (Cat∞)Th, then Gr(F ) ≈ hocolim(F ), i.e.

Gr(F )gpd ' colim(C

F−→ Cat∞(−)gpd−−−−→ S

).

(think of F as “presenting” a C-shaped diagram in S.)

e.g.: ifC Cat∞

WTh

Fthen ∀x ∈ C,

F (x) Gr(F )

x C

is a ho-p.b.

in (Cat∞)Th, i.e.F (x)gpd Gr(F )gpd

xgpd Cgpd

is a p.b. in S.

(compare with Quillen’s Theorem B.)

Aaron Mazel-Gee GHOsT for∞-categories

Page 89: Every love story is a GHOsT story: Goerss–Hopkins obstruction ...

IntroductionObstruction theory

Model∞-categories

Q.: why is this useful?A.: the Grothendieck construction, just as with CatTh.

e.g.: if C F−→ (Cat∞)Th, then Gr(F ) ≈ hocolim(F ), i.e.

Gr(F )gpd ' colim(C

F−→ Cat∞(−)gpd−−−−→ S

).

(think of F as “presenting” a C-shaped diagram in S.)

e.g.: ifC Cat∞

WTh

Fthen ∀x ∈ C,

F (x) Gr(F )

x C

is a ho-p.b.

in (Cat∞)Th, i.e.F (x)gpd Gr(F )gpd

xgpd Cgpd

is a p.b. in S.

(compare with Quillen’s Theorem B.)

Aaron Mazel-Gee GHOsT for∞-categories

Page 90: Every love story is a GHOsT story: Goerss–Hopkins obstruction ...

IntroductionObstruction theory

Model∞-categories

proof of fundamental theorem of model ∞-cats

set up sSQ, then prove string of equivces in S following Dwyer–Kan.

eventually, need to access hom-space homM[W−1](x , y). do so using

localizn thm for model ∞-cats: define CSS(M,W)• ∈ sS by

CSS(M,W)n =(

Fun([n],M)W)gpd

,

• • · · · •

• • · · · •

≈ ≈ ≈

(following Rezk’s “classification diagram” functor RelCat→ s(sSet)).

then: CSS(M,W)• is actually a complete Segal space, and

(CSS(M)• → CSS(M,W)•) ∈ CSS ! (M→M[W−1]) ∈ Cat∞.

proof: set up (Cat∞)Thomason, then follow Barwick–Kan.

Aaron Mazel-Gee GHOsT for∞-categories

Page 91: Every love story is a GHOsT story: Goerss–Hopkins obstruction ...

IntroductionObstruction theory

Model∞-categories

proof of fundamental theorem of model ∞-cats

set up sSQ, then prove string of equivces in S following Dwyer–Kan.

eventually, need to access hom-space homM[W−1](x , y). do so using

localizn thm for model ∞-cats: define CSS(M,W)• ∈ sS by

CSS(M,W)n =(

Fun([n],M)W)gpd

,

• • · · · •

• • · · · •

≈ ≈ ≈

(following Rezk’s “classification diagram” functor RelCat→ s(sSet)).

then: CSS(M,W)• is actually a complete Segal space, and

(CSS(M)• → CSS(M,W)•) ∈ CSS ! (M→M[W−1]) ∈ Cat∞.

proof: set up (Cat∞)Thomason, then follow Barwick–Kan.

Aaron Mazel-Gee GHOsT for∞-categories

Page 92: Every love story is a GHOsT story: Goerss–Hopkins obstruction ...

IntroductionObstruction theory

Model∞-categories

proof of fundamental theorem of model ∞-cats

set up sSQ, then prove string of equivces in S following Dwyer–Kan.

eventually, need to access hom-space homM[W−1](x , y).

do so using

localizn thm for model ∞-cats: define CSS(M,W)• ∈ sS by

CSS(M,W)n =(

Fun([n],M)W)gpd

,

• • · · · •

• • · · · •

≈ ≈ ≈

(following Rezk’s “classification diagram” functor RelCat→ s(sSet)).

then: CSS(M,W)• is actually a complete Segal space, and

(CSS(M)• → CSS(M,W)•) ∈ CSS ! (M→M[W−1]) ∈ Cat∞.

proof: set up (Cat∞)Thomason, then follow Barwick–Kan.

Aaron Mazel-Gee GHOsT for∞-categories

Page 93: Every love story is a GHOsT story: Goerss–Hopkins obstruction ...

IntroductionObstruction theory

Model∞-categories

proof of fundamental theorem of model ∞-cats

set up sSQ, then prove string of equivces in S following Dwyer–Kan.

eventually, need to access hom-space homM[W−1](x , y). do so using

localizn thm for model ∞-cats:

define CSS(M,W)• ∈ sS by

CSS(M,W)n =(

Fun([n],M)W)gpd

,

• • · · · •

• • · · · •

≈ ≈ ≈

(following Rezk’s “classification diagram” functor RelCat→ s(sSet)).

then: CSS(M,W)• is actually a complete Segal space, and

(CSS(M)• → CSS(M,W)•) ∈ CSS ! (M→M[W−1]) ∈ Cat∞.

proof: set up (Cat∞)Thomason, then follow Barwick–Kan.

Aaron Mazel-Gee GHOsT for∞-categories

Page 94: Every love story is a GHOsT story: Goerss–Hopkins obstruction ...

IntroductionObstruction theory

Model∞-categories

proof of fundamental theorem of model ∞-cats

set up sSQ, then prove string of equivces in S following Dwyer–Kan.

eventually, need to access hom-space homM[W−1](x , y). do so using

localizn thm for model ∞-cats: define CSS(M,W)• ∈ sS by

CSS(M,W)n =(

Fun([n],M)W)gpd

,

• • · · · •

• • · · · •

≈ ≈ ≈

(following Rezk’s “classification diagram” functor RelCat→ s(sSet)).

then: CSS(M,W)• is actually a complete Segal space, and

(CSS(M)• → CSS(M,W)•) ∈ CSS ! (M→M[W−1]) ∈ Cat∞.

proof: set up (Cat∞)Thomason, then follow Barwick–Kan.

Aaron Mazel-Gee GHOsT for∞-categories

Page 95: Every love story is a GHOsT story: Goerss–Hopkins obstruction ...

IntroductionObstruction theory

Model∞-categories

proof of fundamental theorem of model ∞-cats

set up sSQ, then prove string of equivces in S following Dwyer–Kan.

eventually, need to access hom-space homM[W−1](x , y). do so using

localizn thm for model ∞-cats: define CSS(M,W)• ∈ sS by

CSS(M,W)n =(

Fun([n],M)W)gpd

,

• • · · · •

• • · · · •

≈ ≈ ≈

(following Rezk’s “classification diagram” functor RelCat→ s(sSet)).

then: CSS(M,W)• is actually a complete Segal space, and

(CSS(M)• → CSS(M,W)•) ∈ CSS ! (M→M[W−1]) ∈ Cat∞.

proof: set up (Cat∞)Thomason, then follow Barwick–Kan.

Aaron Mazel-Gee GHOsT for∞-categories

Page 96: Every love story is a GHOsT story: Goerss–Hopkins obstruction ...

IntroductionObstruction theory

Model∞-categories

Thanks for listening!

references:Goerss–Hopkins, Moduli problems for structured ring spectra.Rezk, Notes on the Hopkins–Miller theorem.Blanc–Dwyer–Goerss, The realization space of a Π-algebra: a moduli problem inalgebraic topology.Dwyer–Kan–Stover, An E2 model category structure for pointed simplicialspaces.Dwyer–Kan, Function complexes in homotopical algebra.Barwick–Kan, From partial model categories to ∞-categories.

this talk:

http://math.berkeley.edu/∼aaron/writing/ytm-cghost-beamer.pdf

greatly expanded version:

http://math.berkeley.edu/∼aaron/writing/thursday-cghost-beamer.pdf

/thursday-cghost-talk-notes.pdf

/BDG-diagram-beamer.pdf

Aaron Mazel-Gee GHOsT for∞-categories

Page 97: Every love story is a GHOsT story: Goerss–Hopkins obstruction ...

IntroductionObstruction theory

Model∞-categories

Thanks for listening!references:

Goerss–Hopkins, Moduli problems for structured ring spectra.Rezk, Notes on the Hopkins–Miller theorem.Blanc–Dwyer–Goerss, The realization space of a Π-algebra: a moduli problem inalgebraic topology.Dwyer–Kan–Stover, An E2 model category structure for pointed simplicialspaces.Dwyer–Kan, Function complexes in homotopical algebra.Barwick–Kan, From partial model categories to ∞-categories.

this talk:

http://math.berkeley.edu/∼aaron/writing/ytm-cghost-beamer.pdf

greatly expanded version:

http://math.berkeley.edu/∼aaron/writing/thursday-cghost-beamer.pdf

/thursday-cghost-talk-notes.pdf

/BDG-diagram-beamer.pdf

Aaron Mazel-Gee GHOsT for∞-categories