Spahn internal formulation of cohesion (Rev #2, changes)

Showing changes from revision #1 to #2: Added | Removed | Changed

category: cohesion

The axioms

theorem

For Disc:B↪HDisc : \mathbf{B} \hookrightarrow \mathbf{H} a sub-(∞,1)-category, the inclusion extends to an adjoint quadruple of the form

H↩coDisc→Γ↩Disc→ΠB \mathbf{H} \stackrel{\overset{\Pi}{\to}}{\stackrel{\overset{Disc}{\hookleftarrow}}{\stackrel{\overset{\Gamma}{\to}}{\underset{coDisc}{\hookleftarrow}}}} \mathbf{B}

precisely if there exists for each object X∈HX \in \mathbf{H}

  1. a morphism X→Π(X)X \to \mathbf{\Pi}(X) with Π(X)∈B↪DiscH\mathbf{\Pi}(X) \in \mathbf{B} \stackrel{Disc}{\hookrightarrow} \mathbf{H};

  2. a morphism ♭X→X\mathbf{\flat} X \to X with ♭X∈B↪DiscH\mathbf{\flat} X \in \mathbf{B} \stackrel{Disc}{\hookrightarrow} \mathbf{H};

  3. a morphism X→#XX \to #X with #X∈B↪coDiscH# X \in \mathbf{B} \stackrel{coDisc}{\hookrightarrow} \mathbf{H}

such that for all Y∈B↪DiscHY \in \mathbf{B} \stackrel{Disc}{\hookrightarrow} \mathbf{H} and Y˜∈B↪coDiscH\tilde Y \in \mathbf{B} \stackrel{coDisc}{\hookrightarrow} \mathbf{H} the induced morphisms

  1. H(ΠX,Y)→≃H(X,Y)\mathbf{H}(\mathbf{\Pi}X , Y) \stackrel{\simeq}{\to} \mathbf{H}(X,Y);

  2. H(Y,♭X)→≃H(Y,X)\mathbf{H}(Y, \mathbf{\flat}X) \stackrel{\simeq}{\to} \mathbf{H}(Y,X);

  3. H(#X,Y˜)→≃H(X,Y˜)\mathbf{H}(# X , \tilde Y) \stackrel{\simeq}{\to} \mathbf{H}(X,\tilde Y);

  4. #(♭X→X)# (\flat X \to X);

  5. ♭(X→#X)\flat (X \to # X)

are equivalences (the first three of ∞-groupoids the last two in H\mathbf{H}).

Moreover, if H\mathbf{H} is a cartesian closed category, then Π\Pi preserves finite products precisely if the DiscDisc-inclusion is an exponential ideal.

The last statement follows from the (∞,1)(\infty,1)-category analog of the discussion here.

Coq

Subtopos

Reflective subfibration

github

  • A:Type⊢inRsc(A):Prop.A:Type\vdash inRsc(A):Prop. This says that for any type AA, we have a proposition inRsc(A)inRsc(A) (expressing the assertion that AA is in our putative reflective subcategory).

  • A:Type\dashv \sharp A:Type.Thissaysthatforany This says that for any A,wehaveanothertype♯A, we have another type \sharp A (its reflection into the subcategory).

A:Type⊣inRsc(♯A).A:Type\dashv inRsc(\sharp A). This says that for any AA, the type ♯A\sharp A is in the subcategory.

A:Type⊣η A:A→♯AA:Type\dashv \eta_A:A\to \sharp A. This says that for any AA, we have a map η A:A→♯A\eta_A:A\to \sharp A.

A,B:Type,inRsc(B)⊣isEquiv(λg.g∘ηA)A,B:Type,inRsc(B)\dashv isEquiv(\lambda g.g\circ\eta A). This says that for any types A and B, where B is in the subcategory, precomposing with ηA\eta A yields an equivalence between B♯AB\sharp A and BABA.

Stable factorization system

github

Lex-reflective subcategory

github

Lex-reflective subcategory of codiscrete objects

github

Local topos

github

Cohesive topos

github

Revision on November 21, 2012 at 15:20:10 by Stephan Alexander Spahn?. See the history of this page for a list of all contributions to it.