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 comma complex complex-geometry computable-mathematics computer-science constructive cosmology deformation-theory descent diagrams differential differential-cohomology differential-equations differential-geometry digraphs duality elliptic-cohomology enriched fibration finite 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 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.
    • CommentAuthorMike Shulman
    • CommentTimeJul 9th 2013

    Has anyone thought about exponentiability for (,1)(\infty,1)-toposes? I think the Johnstone-Joyal paper “Continuous categories and exponentiable toposes” is crying out to be categorified – there’s even a 1-truncated hypercover in it!

    • CommentRowNumber2.
    • CommentAuthorThomas Holder
    • CommentTimeMar 1st 2018
    • (edited Mar 1st 2018)

    I’ve dropped a reference to the following paper at continuous category:

    • Mathieu Anel, Damien Lejay, Exponentiable Higher Toposes , arXiv:1802.10425 (2018). (abstract)

    I’ve also started a new page exponentiable topos to drop some references there.

  1. Whenever I see results like this, I think to myself: what if we just take as axiomatic that any result from ordinary category theory can be lifted to (,1)(\infty,1)-category theory?! It is pretty clear that this principle is valid, so why not just ignore the technicalities and a) focus on showing what can be done with such a lift, b) focus on defining once and for all a general mechanism for formulating and carrying out this lift?

    • CommentRowNumber4.
    • CommentAuthorMike Shulman
    • CommentTimeMar 1st 2018

    Thanks! I added some cross-links to the “Examples” section of exponentiable object and at continuous category.

    • CommentRowNumber5.
    • CommentAuthorMike Shulman
    • CommentTimeMar 1st 2018

    Re #3: Actually the principle is false; consider for instance the statement that every diagonal map AA×AA\to A\times A is a monomorphism. It should be possible to isolate a class of statements for which it does hold, but this requires formulating a suitably general context (either syntactic or semantic) for “formal category theory”, which is work in progress.

    • CommentRowNumber6.
    • CommentAuthorRichard Williamson
    • CommentTimeMar 1st 2018
    • (edited Mar 1st 2018)

    Hehe, yes, this was deliberately a bit blasé :-), but the essence of it is I think valid. I completely agree regarding your second statement. Do you know of any work in a syntactic direction on this (I am aware of the semantic work of Riehl and Verity, though I’m not sure it goes/is intended to go quite as far as I have in mind)?

    • CommentRowNumber7.
    • CommentAuthorMike Shulman
    • CommentTimeMar 1st 2018

    Do you count Riehl-Shulman?

    Coincidentally, Emily will be talking about the relation between Riehl-Verity and Riehl-Shulman about 2 hours from now in HoTTEST.

  2. I had forgotten about that, your work with Emily is definitely very interesting. Is it in principle able to express the kind of translation principle we were discussing (from ordinary to (,1)(\infty,1)-category theory, rather than between (,1)(\infty,1)-categories)?

    • CommentRowNumber9.
    • CommentAuthorRichard Williamson
    • CommentTimeMar 1st 2018
    • (edited Mar 1st 2018)

    Incidentally, your work with Emily reminds me of something I am very interested in, which is a kind of syntactic version of (and development) Lawvere’s ideas of how to take the category (or, as I think we would certainly proceed nowadays, 2-category) of categories as a foundation. I definitely think introducing primitive types for things like a directed interval is the right approach.

    • CommentRowNumber10.
    • CommentAuthorMike Shulman
    • CommentTimeMar 1st 2018

    Well, since not everything in 1-category theory translates to (,1)(\infty,1)-category theory, there can’t be any direct “translation”. I think the best thing to hope for is some formal context that can be interpreted both into 1-category theory and (,1)(\infty,1)-category theory. Then in place of a “translation” we have a “span” or “partial translation” whereby starting with some result in 1-category theory we have to ask “does it lift to the formal context?” or “can it be expressed in the formal language?”, and then if the answer is yes, we can then interpret that lifting into (,1)(\infty,1)-category theory.

    With this interpretation of the question, the answer for my work with Emily is “up to a point”. Our syntax is explicitly and heavily motivated by the Rezk model for (,1)(\infty,1)-categories in the category of bisimplicial sets. We define syntactically objects called “Segal types” and “Rezk types” that correspond to Segal spaces and Rezk spaces (complete Segal spaces). Morally we should be working with the Rezk types as models of (,1)(\infty,1)-categories, but in fact it turns out that many theorems are already valid for Segal types. Now I believe that our syntax also has an interpretation into simplicial sets, under which the Segal types correspond to (the nerves of) ordinary categories and the Rezk types correspond to categories in which every isomorphism is an identity. So any theorem of 1-category theory that can be lifted to a theorem about Segal types in our syntax is also true about (,1)(\infty,1)-categories. But there are also true things our syntax can say about (,1)(\infty,1)-categories (i.e. Rezk spaces) that don’t “lift backwards” to theorems about 1-categories since not every category is a Rezk type.

    Our syntax is currently also a bit limited in the aspects of category theory it can talk about. For instance, we don’t have yet something corresponding to the category of sets/spaces, nor do we have any notion of “opposite category”. But it seems reasonable to hope that future developments may address these limitations.

    I have also noticed the connection to CCAF. In fact, I noticed recently that Lawvere’s fundamental axiom 3=2+ 123 = 2 +_1 2 is closely connected to the definition of Segal type: the Segal types are exactly the types that “internally think that 3=2+ 123 = 2 +_1 2”.

  3. Thanks! I find this interesting, and have begun looking at your paper in more detail.

    One thing that precludes a semantics in Cat or Poset is the obvious point that you use an intensional dependent type theory as one of the layers (the cube and tope layers are no problem). Somehow this doesn’t seem really fundamental to me. Have you thought about whether a semantics in Cat might be possible if you somehow replace the intensional dependent type theory layer with something else?

    Another point I am very interested in, which I believe is related to your last remark, is that the interval in your syntax has what I call ’strictness of identities’ as well as connections with good properties, which means morally (i.e. up to finding some kind of syntactical category in which to express the same kind of ideas) that one will be able to put a model structure on it by the methods of my thesis. Such a thing would be some kind of ’folk model structure’ for (,1)(\infty,1)-categories.

    Regarding defining something corresponding to sets/spaces, I have thought a bit about that in the past, and one idea I am quite keen on is to define Set to be the free co-completion of 1. Now, this may seem circular. But it does not seem to me impossible that one might be able to define a free co-completion 2-monad without actually referring to Set, if one’s ambient (i.e. axiomatic) 2-category of categories is sufficiently nice.

    • CommentRowNumber12.
    • CommentAuthorMike Shulman
    • CommentTimeMar 1st 2018

    I played around a little with leaving out the identity types entirely and essentially taking Rezk-ness as the definition of identity types. But I wasn’t able to make it work short of putting in explicitly all the higher groupoid structure on such things in a cubical-type-theory-like way. My current feeling is that what makes the Riehl-Shulman theory pretty is that it can “piggyback” the homotopy-coherence of (,1)(\infty,1)-categories on the homotopy-coherence of \infty-groupoids that is ensured by the ambient HoTT, allowing us to express infinite coherence conditions like Segal-ness in a finitary way. But I highly encourage other people like you to think about this; there’s a lot of open ground for variations and improvements. Defining SetSet to be the free cocompletion of 1 might just be possible too, I look forward to hearing whether you can make it work.

  4. Thanks for the thoughts! I’ve now begun a discussion of how to carry out free co-completion without referring to Set\mathsf{Set} here.