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
    • CommentTimeDec 14th 2009

    Created extranatural transformation by moving the relevant information from dinatural transformation and adding the definition. Disagreements are welcome, but I feel that since dinaturals that aren't extranatural are so rare and harder to deal with and understand, extranaturals merit their own page.

    • CommentRowNumber2.
    • CommentAuthorTobyBartels
    • CommentTimeDec 14th 2009

    Looks good to me.

    • CommentRowNumber3.
    • CommentAuthorYaron
    • CommentTimeAug 12th 2017

    I have a (perhaps silly) question regarding the entry extranatural transformation. After Lemmas 1-3, it is stated that “In fact, these lemmas essentially capture “all possible” ways in which extranatural transformations can be composed. The general statement, which is obtained by combining these, is that if the graphs representing the two transformations can be composed without creating any closed loops, then the transformations can be composed, and the resulting graph is the composite of the individual graphs.”

    However, I don’t understand how, for example, the general version of yanking, where the domain of GG has any odd number of factors (Prop. 1 of Eilenberg-Kelly) follows by combining Lemmas 1-3 as stated. To really become the “general building blocks,” shouldn’t Lemma 1-3 be stated with any number of even (Lemma 1,2) or odd (Lemma 3) factors for the relevant transformations, as in Props. 1,2,2* of E-K?

    • CommentRowNumber4.
    • CommentAuthorMike Shulman
    • CommentTimeAug 13th 2017

    That statement seems to be my fault. I’m not sure what I had in mind. Please fix it!

    • CommentRowNumber5.
    • CommentAuthorYaron
    • CommentTimeAug 13th 2017

    Sure. It will take me a day or two to get to it, and I will update when I’m done.

    • CommentRowNumber6.
    • CommentAuthorYaron
    • CommentTimeAug 13th 2017

    Done. I hope that all the right indices are there. I have also slightly changed the concluding sentence after Lemma 1-3.

    • CommentRowNumber7.
    • CommentAuthorTodd_Trimble
    • CommentTimeAug 13th 2017

    Thanks, Yaron!

    • CommentRowNumber8.
    • CommentAuthorYaron
    • CommentTimeAug 13th 2017

    Sure, my pleasure!

    • CommentRowNumber9.
    • CommentAuthorMike Shulman
    • CommentTimeAug 14th 2017

    Nice, thanks!

    I wonder whether it would be worth stating the theorems in the simpler n=1n=1 case first, to help the reader’s intuition, before the general one with all the indices?

    • CommentRowNumber10.
    • CommentAuthorYaron
    • CommentTimeAug 14th 2017

    Sounds like a good idea.