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 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 nforum 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 sheaves 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.
    • CommentAuthorTodd_Trimble
    • CommentTimeOct 8th 2011
    • (edited Oct 8th 2011)

    A question appeared on Math Overflow which I answered, but I’m not completely satisfied with my answer, and I wondered whether any of you had seen this before.

    In some generality, the question is this. Let EE be a cocomplete pretopos (say), and let FF be a finitary polynomial endofunctor on EE without constant term. Then, if I’m not mistaken, the canonical arrow iF(A i)F( iA i)\sum_i F(A_i) \to F(\sum_i A_i) is monic. Is something like this true for wide pushouts in place of coproducts, i.e., is the canonical arrow ( i) FPF(A i)F(( i) PA i)(\sum_i)_{F P} F(A_i) \to F((\sum_i)_P A_i) monic, for any cone from PP to the collection of the A iA_i? I’m pretty sure that it’s going to be true, but I don’t think I’m thinking all that clearly this morning.

    This seems like a handy little lemma to have archived at the Lab…

    • CommentRowNumber2.
    • CommentAuthorMike Shulman
    • CommentTimeOct 8th 2011

    It looks to me as though your proof at MO should work in the generality of a cocomplete pretopos, if you do the zigzag thing appropriately internally. Offhand, I don’t recall seeing this anywhere before.

    • CommentRowNumber3.
    • CommentAuthorTodd_Trimble
    • CommentTimeOct 9th 2011

    Thanks. I think I was worried over nothing. In any case, I did a little write-up on my web which hopefully does the job.

    • CommentRowNumber4.
    • CommentAuthorMike Shulman
    • CommentTimeOct 9th 2011

    Nice! I was wondering last night whether the category has to be an infinitary-pretopos, or whether a cocomplete pretopos suffices – and also whether every cocomplete pretopos is an infinitary-pretopos, i.e. whether arbitrary coproducts in a pretopos are necessarily stable and disjoint.

    Is there a nice argument for why finite power functors preserve filtered colimits? Perhaps that is where we have to assume something (like extensivity) about the colimits being constructed in a “set-like way”?

    • CommentRowNumber5.
    • CommentAuthorTodd_Trimble
    • CommentTimeOct 10th 2011

    So I was construing a finite power functor as

    CΔC nprodCC \stackrel{\Delta}{\to} C^n \stackrel{prod}{\to} C

    where Δ\Delta preserves filtered colimits because it is left adjoint to prodprod, and prodprod preserves filtered colimits because of the interchange between finite limits and filtered co… ohhh, dang, you’re right, I misapplied the famous theorem. Hm! Back to the old drawing board…

    I’d love to think about the other questions, too, but today it feels like I have a big mess of confusions of various sorts, all crying for attention. :-)

    • CommentRowNumber6.
    • CommentAuthorTodd_Trimble
    • CommentTimeOct 10th 2011
    • (edited Oct 10th 2011)

    Okay, let me try again. If CC is an \infty-pretopos, then c×:CCc \times -: C \to C preserves arbitrary colimits. So now let JJ be a filtered category, and let F,GF, G be functors JCJ \to C. Then

    (colim j:JF(j))×(colim k:JG(k))colim k:J(colim j:JF(j))×G(k)colim j:Jcolim k:J(F(j)×G(k))colim (j,k):J×JF(j)×G(k)colim j:JF(j)×G(j)(colim_{j: J} F(j)) \times (colim_{k: J} G(k)) \cong colim_{k: J} (colim_{j: J} F(j)) \times G(k) \cong colim_{j: J} colim_{k: J} (F(j) \times G(k)) \cong colim_{(j, k): J \times J} F(j) \times G(k) \cong colim_{j: J} F(j) \times G(j)

    where the last isomorphism comes about because Δ:JJ×J\Delta: J \to J \times J is final. So prod:C×CCprod: C \times C \to C preserves filtered colimits. Does that work?

    (Maybe I should say infinitary pretopos instead of \infty-pretopos?)

    • CommentRowNumber7.
    • CommentAuthorMike Shulman
    • CommentTimeOct 10th 2011

    Ah, that looks good! So that actually says that any functor of two variables which preserves filtered colimits in each variable separately preserves filtered colimits in both variables together. I knew that for reflexive coequalizers, but I don’t recall seeing it for filtered colimits before, although I could easily be misremembering.

    (“Infinitary pretopos” is an nLabism, intended to express the same thing as the more common “\infty-pretopos”, but also avoid a terminological collision with “\infty-topos”, where the \infty denotes the category-level rather than the cardinality of extensivity. You can use it or not, as you like. (-: )