Processing math: 100%
Not signed in (Sign In)

Not signed in

Want to take part in these discussions? Sign in if you have an account, or apply for one below

  • Sign in using OpenID

Site Tag Cloud

2-category 2-category-theory abelian-categories adjoint algebra algebraic algebraic-geometry algebraic-topology analysis analytic-geometry arithmetic arithmetic-geometry book bundles calculus categorical categories category category-theory chern-weil-theory cohesion cohesive-homotopy-type-theory cohomology colimits combinatorics complex complex-geometry computable-mathematics computer-science constructive cosmology definitions deformation-theory descent diagrams differential differential-cohomology differential-equations differential-geometry digraphs duality elliptic-cohomology enriched fibration foundation foundations functional-analysis functor gauge-theory gebra geometric-quantization geometry graph graphs gravity grothendieck group group-theory harmonic-analysis higher higher-algebra higher-category-theory higher-differential-geometry higher-geometry higher-lie-theory higher-topos-theory homological homological-algebra homotopy homotopy-theory homotopy-type-theory index-theory integration integration-theory k-theory lie-theory limits linear linear-algebra locale localization logic mathematics measure-theory modal modal-logic model model-category-theory monad monads monoidal monoidal-category-theory morphism motives motivic-cohomology nlab noncommutative noncommutative-geometry number-theory of operads operator operator-algebra order-theory pages pasting philosophy physics pro-object probability probability-theory quantization quantum quantum-field quantum-field-theory quantum-mechanics quantum-physics quantum-theory question representation representation-theory riemannian-geometry scheme schemes set set-theory sheaf simplicial space spin-geometry stable-homotopy-theory stack string string-theory superalgebra supergeometry svg symplectic-geometry synthetic-differential-geometry terminology theory topological topology topos topos-theory tqft type type-theory universal variational-calculus

Vanilla 1.1.10 is a product of Lussumo. More Information: Documentation, Community Support.

Welcome to nForum
If you want to take part in these discussions either sign in now (if you have an account), apply for one now (if you don't).
    • CommentRowNumber1.
    • CommentAuthorUrs
    • CommentTimeMay 19th 2012
    • (edited May 19th 2012)

    Here is a kind of summary of the little fact that Mike and I have been discussing in another thread here. I tought this is nice and we should discuss this a bit more, it feels like there might be some nice implications here, at least conceptually. So I am probably going to post this to the nCafé in a little while. For them moment, I post a preliminary version here.

    [edit: I have now posted this to the nCafé here]


    Here is a charming statement:

    Do you see it? Once you know what these terms mean this is pretty obvious, once stated. But it seems not to have been stated before.

    I now briefly spell this out and give further pointers. This might be the beginning of a nice story. I am posting this here in the hope of discussing it a bit more.

    Consider some ambient (∞,1)-topos and inside it an internal (∞,1)-category, hence a complete Segal space object X. Its 1-skeleton, on which I will focus attention here, looks as follows (in this and the following formulas I display on the left the syntax and on the right its semantics, see HoTT methods for homotopy theorists if you are a homotopy theorist and need more background):

    the object of morphisms X1 sits by the source-and-target map (d0,d1) over the object of objects X0

    [x,y:X0X1(x,y):Type][X1(d0,d1)X0×X0]

    and the identity-assigning map s0 is a diagonal section

    [x:X0s0(x):X1(x,x)][X0s0X1Δ(d0,d1)X0×X0].

    Syntactically, the recursion principle / simple elimination rule for the inductive identity types, and semantically the (acyclic cofibrations fibrations)-weak factorization system, says that this section factors through the identity type [x,y:X0(x=y):Type] (syntactically) respectively the path space object XI0X0×X0 (semantically):

    [x,y:X0ˆs0(x,y):(x=y)X1(x,y)][X0s0X1ˆs0XI0X0×X0].

    Now, Segal-completeness of X is the statement that this ˆs0 exhibits the inclusion of the core, hence of those morphisms fX1 that are equivalences under the composition operation of X.

    Specifically, consider the case that X is the universal small internal category object, equivalently the small reflection of the ambient (,1)-topos into itself, equivalently the classfier of the small codomain fibration, equivalently its stack semantics, or whatever you want to call it, that whose 1-skeleton is

    [A,B:TypeAB:Type]d0s0d1Type,

    where “Type” denotes the small universe / small object classifier.

    Then the Segal-completeness condition of this internal category object is the univalence condition on ˜TypeType.