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 internal-categories k-theory lie-theory limits linear linear-algebra locale localization logic mathematics measure 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.
    • CommentAuthorEric
    • CommentTimeAug 11th 2010
    • (edited Aug 11th 2010)

    Hi,

    Over in the discussion on semidirect product, I cooked up something that looks like it might have general applicability. As such, it is almost certainly not “new”. So one of the purposes for writing this here is to ask for references. If you’ve seen something like this, I’d love to read up on it, so please let me know. Of course, the whole thing could just be bogus :)

    Another purpose is to seek help ironing out any details I’ve left out.

    The idea is that given any (k1)(k-1)-morphisms f,g:xyf,g:x\to y and kk-morphism

    α:fg,\alpha:f\to g,

    we can define a (k1)(k-1)-endomorphism

    α:yy\partial\alpha:y\to y

    such that

    αg=f.\partial\alpha\circ g = f.

    I think the “=” here is important.

    This makes sense even when the category is not a groupoid.

    Now, a DD-valued differential form is just a functor

    F:CD.F:C\to D.

    If CC and DD are (,p)(\infty,p)-categories, we could call F:CDF:C\to D a DD-valued pp-form.

    We can define the exterior derivative of a DD-valued form in the obvious way such that Stokes’ theory is satisfied, i.e. Stokes theorem is taken to define dd. That is, we define

    dF(α)=F(α)d F(\alpha) = F(\partial\alpha)

    so we have

    F(αg)=F(α)F(g)=dF(α)F(g)=F(f).F(\partial\alpha\circ g) = F(\partial\alpha)\circ F(g) = d F(\alpha)\circ F(g) = F(f).

    Note, this version of Stokes’ theorem (I believe) is defined for any category.

    Also note that I’ve used bigons for the sake of communicating the idea, but the language I used to cook this up is that of kk-maps (to avoid a name clash with kk-morphisms) defined here.

    • CommentRowNumber2.
    • CommentAuthorTobyBartels
    • CommentTimeAug 11th 2010

    […] given any […] we can […]

    That’s not true in general, but maybe you want to focus attention on (higher) categories equipped with an operation \partial such that this is true? Even so, I’d be inclined to think that this could only work if α\alpha is an automorphism (invertible, or at least weakly invertible). In that case, I believe that you should be able to replace CC with an equivalent category such that the statement is always true (when α\alpha is an automorphism).

    Also, I think that you should have both a target boundary and a source boundary; the target boundary is τα:yy\tau \alpha\colon y \to y, while the source boundary is σα:xx\sigma \alpha\colon x \to x. The boundary as we normally think of it is something that exists only in additive situations, where we can write α=τασα\partial \alpha = \tau \alpha - \sigma \alpha. (And now that I write this down, I see that this really only makes sense when x=yx = y.) That is my intuition, at least.

    • CommentRowNumber3.
    • CommentAuthorEric
    • CommentTimeAug 11th 2010
    • (edited Aug 11th 2010)

    Hi Toby,

    Thanks for your feedback :)

    I’ll have to think about the automorphism issue, but I thought I would try to clarify one point.

    Integration is actually more like “product integration” not “summation”. In the case of groupoid, where the intuition is clear, we’d have αg=f\partial\alpha\circ g = f as usual, but since it is a groupoid, this can be rewritten as

    α=fg 1.\partial\alpha = f\circ g^{-1}.

    This is opposed to the way we usually might think of it, i.e. as a difference fgf - g. All we need is composition. Not summation or subtraction.

    I’m not sure how/if this viewpoint might change your earlier comments.

    • CommentRowNumber4.
    • CommentAuthorEric
    • CommentTimeAug 11th 2010
    • (edited Aug 11th 2010)

    This is a thought that just popped into my head: maybe we can think of α\partial\alpha as a (higher) coequalizer of (k1)(k-1)-morphisms f,g:xyf,g:x\to y. Or something…

    PS: Everything I write here should be prefixed with “(higher)”, but I was being lazy and assuming all higher stuff exists. Trying to channel Urs. Everything is an \infinity-category :)

    Edit: In grad school, my friend and I had an expression: “Every idea is a good idea… for the first 5 minutes.” Then the reality sets in :)

    This one took less than 5 minutes. I no longer want to think of α\partial\alpha as a coequalizer, but will leave this comment here for the record.

    The “spirit” of α\partial\alpha is similar to that of a coequalizer though. It is an endomorphism (as opposed to object with components) that is inserted in order to make diagrams commute.

    • CommentRowNumber5.
    • CommentAuthorTobyBartels
    • CommentTimeAug 12th 2010

    You’re right, what I wrote about subtraction was silly.

    The target boundary of α\alpha is simply gg, and the source boundary is simply ff, so it makes sense to define α\partial \alpha as fg 1f \circ g^{-1}.

    However, there are still two possible meanings of α\partial \alpha; the other is gf 1g \circ f^{-1}. So that is what led to my comment, mistaken as that comment was.

    • CommentRowNumber6.
    • CommentAuthorEric
    • CommentTimeAug 12th 2010
    • (edited Aug 12th 2010)

    Yeah. There is a choice. I think I am going to switch to the second option you mention, i.e.

    αf=g.\partial\alpha\circ f = g.

    This way, the action of α\alpha on ff is post composition with the boundary, i.e.

    αf=αf=g.\alpha\cdot f = \partial\alpha\circ f = g.

    Using this boundary operation, last night I demonstrated that if the boundary exists, it defines a calculus and using this calculus you can derive/confirm the interchange law algebraically in a straightforward manner. I suspect the proof goes both ways and the interchange law implies the existence of a boundary so that a boundary operation of 2-morphisms is inherent in the definition of a (strict?) 2-category.

    It may not be “new”, but it is not devoid of utility either. I think with this, I am finally starting to understand 2-categories :)

    I’ll put the proof on my personal web and provide a link shortly.

    Edit: Here is the link