Not signed in (Sign In)

Start a new discussion

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

(0 1)-category-theory 2-category 2-category-theory 2-monad abelian-categories accessible adjoint algebra algebraic algebraic-geometry analysis arithmetic beauty book bug bundle categories category category-theory chern-simons-theory cohesion cohesive-homotopy-type-theory cohomology combinatorics complex-geometry conference connection constructive constructive-mathematics cosmology database deformation-theory descent differential differential-cohomology differential-geometry duality enriched enriched-category-theory enrichment examples factorization-system fiber fibration forms foundation foundations functional-analysis functor galois-theory gauge-theory gebra general topology geometric geometric-quantization geometry gravity group-theory higher higher-algebra higher-category-theory higher-geometry higher-lie-theory higher-topos-theory history homological homological-algebra homotopy homotopy-theory homotopy-type-theory homtopy-type-theory infinity-groupoid integration-theory internal-categories kan lie lie-algebras lie-theory limit limits linear linear-algebra locale localization localization-theory logic manifolds mathematics measure measure-theory mechanics meta modal-logic model model-category-theory monoidal monoidal-category monoidal-category-theory morphism n-groups newpage noncommutative noncommutative-geometry object operator operator-algebra order-theory philosophy physics predicative pretopology pro-object probability-theory quantum quantum-field-theory quantum-mechanics quantum-physics quantum-theory question representation representation-theory riemannian-geometry set set-theory sheaf simplicial site space stable-homotopy-theory stack string string-theory subobject supergeometry symplectic-geometry tannaka tensor terminology theory topologica-quantum-field-theory topology topos topos-theory torsor tqft type type-theory universal weighted-limit

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
    • CommentTimeApr 30th 2012

    Stephan Spahn added stuff to plus construction on presheaves

    • CommentRowNumber2.
    • CommentAuthorUrs
    • CommentTimeApr 30th 2012

    Thanks, Stephan!

    you ask

    To address the question of compact objects in Sh ∞(SmoothMfd) there should be an (∞,1)-plus construction, too. Is in this case where the (∞,1)-site is just a 1-site somehow clear how this works?

    For n-truncated objects it is in principle clear: one has to apply the plus-construction (n+2)-times in a row!

    See for instance section 6.5.3 of HTT.

    • CommentRowNumber3.
    • CommentAuthorUrs
    • CommentTimeApr 30th 2012

    I have added a brief remark on this in the Idea section. But am out of time now.

    • CommentRowNumber4.
    • CommentAuthorzskoda
    • CommentTimeApr 30th 2012
    • (edited Apr 30th 2012)

    I have added the reference to the famous Heller-Rowe article where the plus construction in the case of abelian sheaves is studied. In the abelian context one usually says Heller-Rowe functor. Interestingly, the theory of Q-categories of Rosenberg has been written out in 1988 to exhibit the common and nontrivial generalization of the functor H in the theory of Gabriel localization and Heller/Rowe functor, as the instances of the same construction. Gabriel localization is also H 2, just like sheafification. Here is a Gabriel filter.

    • CommentRowNumber5.
    • CommentAuthorZhen Lin
    • CommentTimeApr 30th 2012

    I always thought that the fact that we needed to do () + twice had something to do with the fact that the equaliser diagram has two stages, but I never did find a good technical explanation of this point. What is clear, though, is that doing it once is a generalisation of computing Hˇ 0. I imagine these two facts are related via n-categories…

Add your comments
  • Please login, or your comments will be posted as "Guest".
     
     
     
     
     
    Type the two words.
     
     
    Get a new recaptcha
    Get an audio challenge
    Help
     
     
     
  • Format comments as (Help) (Help)