nLab
orthogonal factorization system in an (infinity,1)-category

Context

Factorization systems

(,1)-Category theory

Contents

Definition

Definition

Let C be an (∞,1)-category and f:AB and g:XY two morphisms in C. Write C AY for the under-over-(∞,1)-category.

We say that f is left orthogonal to g and that g is right orthogonal to f and write

fgf \perp g

if for every commuting diagram

A X f g B Y\array{ A &\to& X \\ {}^{\mathllap{f}}\downarrow &\swArrow_{\simeq}& \downarrow^{\mathrlap{g}} \\ B &\to& Y }

in C we have that C AY(B,X)* is contractible.

Note that the notation C AY(B,X) subtly includes the given commuting diagram, since C AY is only defined relative to a particular given morphism AY. Here we take that to be the common composite of the given commuting square, with B and X regarded as objects of C AY via the resulting commuting triangles.

Definition

Let C be an (∞,1)-category. An orthogonal factorization system on C is a pair (S L,S R) of classes of morphisms in C that satisfy the following axioms.

  1. Both classes are stable under retracts.

  2. Every morphism in S L is left orthogonal to every morphism in S R;

  3. For every morphism h:XZ in C there exists a commuting triangle

    Y f g X h Z\array{ && Y \\ & {}^{\mathllap{f}}\nearrow && \searrow^{\mathrlap{g}} \\ X &&\stackrel{h}{\to}&& Z }

    with fS L and gS R.

Properties

Closure properties

Proposition

For (L,R) a factorization system in an (∞,1)-category 𝒞, the full sub-(∞,1)-category of the arrow category Func(Δ 1,𝒞) on the morphisms in R is closed under (∞,1)-limits of shapes that exist in 𝒞. Similarly the full subcategory on L is closed under (∞,1)-colimits that exist in 𝒞.

This is (Lurie, prop. 5.2.6.8 (7), (8)).

Reflection

Definition

Let (L,R) be an orthogonal factorization system on an (,1)-category 𝒞. Write 𝒞 R I𝒞 I for the full sub-(∞,1)-category of the arrow category on the morphisms in R.

Then

  1. this is a reflective sub-(∞,1)-category

    𝒞 R I𝒞 I\mathcal{C}^I_R \stackrel{\stackrel{}{\leftarrow}}{\hookrightarrow} \mathcal{C}^I
  2. The adjunction units η f:ff¯ are of the form

    X L X¯ f f¯R Y Y¯.\array{ X &\stackrel{\in L}{\to}& \bar X \\ {}^{\mathllap{f}}\downarrow && \downarrow^{\mathrlap{\bar f \in R} } \\ Y &\stackrel{\simeq}{\to}& \bar Y } \,.

    (In words: the reflection into 𝒞 R I is given by the factorization in (L,R)).

This is (Lurie, lemma 5.2.8.19).

Examples

References

Section 5.2.8 of

Revised on November 12, 2012 23:49:06 by Urs Schreiber (89.204.137.233)