Spahn
internal formulation of cohesion (Rev #3, changes)
Showing changes from revision #2 to #3:
Added | Removed | Changed
The axioms For generalities on the translation Ho CT-Ho TT see dictionary HoCT-HoTT .
theorem
For Disc : B ↪ H Disc : \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 ∈ H X \in \mathbf{H}
a morphism X → Π ( X ) X \to \mathbf{\Pi}(X) with Π ( X ) ∈ B ↪ Disc H \mathbf{\Pi}(X) \in \mathbf{B} \stackrel{Disc}{\hookrightarrow} \mathbf{H} ;
a morphism ♭ X → X \mathbf{\flat} X \to X with ♭ X ∈ B ↪ Disc H \mathbf{\flat} X \in \mathbf{B} \stackrel{Disc}{\hookrightarrow} \mathbf{H} ;
a morphism X → # X X \to #X with # X ∈ B ↪ coDisc H # X \in \mathbf{B} \stackrel{coDisc}{\hookrightarrow} \mathbf{H}
such that for all Y ∈ B ↪ Disc H Y \in \mathbf{B} \stackrel{Disc}{\hookrightarrow} \mathbf{H} and Y ˜ ∈ B ↪ coDisc H \tilde Y \in \mathbf{B} \stackrel{coDisc}{\hookrightarrow} \mathbf{H} the induced morphisms
H ( Π X , Y ) → ≃ H ( X , Y ) \mathbf{H}(\mathbf{\Pi}X , Y) \stackrel{\simeq}{\to} \mathbf{H}(X,Y) ;
H ( Y , ♭ X ) → ≃ H ( Y , X ) \mathbf{H}(Y, \mathbf{\flat}X) \stackrel{\simeq}{\to} \mathbf{H}(Y,X) ;
H ( # X , Y ˜ ) → ≃ H ( X , Y ˜ ) \mathbf{H}(# X , \tilde Y) \stackrel{\simeq}{\to} \mathbf{H}(X,\tilde Y) ;
# ( ♭ X → X ) # (\flat X \to X) ;
♭ ( 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 Disc Disc -inclusion is an exponential ideal .
For generalities on cohesive toposes see Urs Schreiber , differential cohomology in a cohesive topos
The last statement follows from the ( ∞ , 1 ) (\infty,1) -category analog of the discussion here .
The Ho CT-axioms of cohesion
theorem
For Disc : B ↪ H Disc : \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 ∈ H X \in \mathbf{H}
a morphism X → Π ( X ) X \to \mathbf{\Pi}(X) with Π ( X ) ∈ B ↪ Disc H \mathbf{\Pi}(X) \in \mathbf{B} \stackrel{Disc}{\hookrightarrow} \mathbf{H} ;
a morphism ♭ X → X \mathbf{\flat} X \to X with ♭ X ∈ B ↪ Disc H \mathbf{\flat} X \in \mathbf{B} \stackrel{Disc}{\hookrightarrow} \mathbf{H} ;
a morphism X → # X X \to #X with # X ∈ B ↪ coDisc H # X \in \mathbf{B} \stackrel{coDisc}{\hookrightarrow} \mathbf{H}
such that for all Y ∈ B ↪ Disc H Y \in \mathbf{B} \stackrel{Disc}{\hookrightarrow} \mathbf{H} and Y ˜ ∈ B ↪ coDisc H \tilde Y \in \mathbf{B} \stackrel{coDisc}{\hookrightarrow} \mathbf{H} the induced morphisms
H ( Π X , Y ) → ≃ H ( X , Y ) \mathbf{H}(\mathbf{\Pi}X , Y) \stackrel{\simeq}{\to} \mathbf{H}(X,Y) ;
H ( Y , ♭ X ) → ≃ H ( Y , X ) \mathbf{H}(Y, \mathbf{\flat}X) \stackrel{\simeq}{\to} \mathbf{H}(Y,X) ;
H ( # X , Y ˜ ) → ≃ H ( X , Y ˜ ) \mathbf{H}(# X , \tilde Y) \stackrel{\simeq}{\to} \mathbf{H}(X,\tilde Y) ;
# ( ♭ X → X ) # (\flat X \to X) ;
♭ ( 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 Disc Disc -inclusion is an exponential ideal .
The last statement follows from the ( ∞ , 1 ) (\infty,1) -category analog of the discussion here .
Coq
This section is on the Coq formalization of axiomatic homotopy cohesion . It draws from Mike Shulman , Internalizing the external, or The Joys of Codiscreteness (blog post ). The corresponding Coq-code library is at Mike Shulman , HoTT/Coq/Subcatgeories
Subtopos
Reflective subfibration
github This section comments on the code ReflectiveSubfibration.v .
A : Type ⊢ inRsc ( A ) : Prop . A:Type\vdash inRsc(A):Prop. This says that for any type A A , we have a proposition inRsc ( A ) inRsc(A) (expressing the assertion that A A is in our putative reflective subcategory).
A:Type\dashv \sharp A:Type.This says that for any This says that for any A, we have another type ♯ A , we have another type \sharp A (its reflection into the subcategory).
For plain types
A : Type ⊣ inRsc ( ♯ A ) . A:Type\dashv inRsc(\sharp A). The following axioms characterize in type theoretical language the relations between objects of a reflective subcategory This says that for any A A , the type ♯ A \sharp A is in the subcategory.
A : Type ⊣ η A : A → ♯ A A:Type\dashv \eta_A:A\to \sharp A . This says that for any A A , we have a map η A : A → ♯ A \eta_A:A\to \sharp A .
A ↪ ← ♯ H A\stackrel{\xleftarrow{\sharp}}{\hookrightarrow} H A , B : Type , inRsc ( B ) ⊣ isEquiv ( λ g . g ∘ η A ) A,B:Type,inRsc(B)\dashv isEquiv(\lambda g.g\circ\eta A) and objects of the ambient category . This says that for any types A and B, where B is in the subcategory, precomposing with H H η A \eta A wrt. the reflector yields an equivalence between ♯ ⊣ ι \sharp\dashv \iota B ♯ A B\sharp A : and BA BA .
A : Type ⊢ in Rsc ( A ) : Prop . A:Type\vdash in Rsc(A):Prop. This says that for any type A A , we have a proposition in Rsc ( A ) in Rsc(A) (expressing the assertion that A A is in our putative reflective subcategory).
A : Type ⊣ ♯ A : Type . A:Type\dashv \sharp A:Type. This says that for any A A , we have another type ♯ A \sharp A (its reflection into the subcategory).
A : Type ⊣ in Rsc ( ♯ A ) . A:Type\dashv in Rsc(\sharp A). This says that for any A A , the type ♯ A \sharp A is in the subcategory.
A : Type ⊣ η A : A → ♯ A A:Type\dashv \eta_A:A\to \sharp A . This says that for any A A , we have a map η A : A → ♯ A \eta_A:A\to \sharp A (which we can think of as the unit of the adjunction).
A , B : Type , inRsc ( B ) ⊣ is Equiv ( λ g . g ∘ η A ) A,B:Type,inRsc(B)\dashv is Equiv(\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 ♯ A B^{\sharp A} and B A B^A (which we can think of as the adjunction isomorphism since precomposition g ↦ g ∘ η A g\mapsto g\circ \eta_A with the adjunction-unit assigns the adjunct).
For dependent types
The previous axioms are given for plain types but one can impose them also on dependent types x : A ⊣ P ( x ) : Type x:A\dashv P(x):Type in that we require
x : A ⊣ ♯ P ( x ) : Type . x:A \dashv \sharp P(x):Type.
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 22:29:04 by
Stephan Alexander Spahn? .
See the history of this page for a list of all contributions to it.