Processing math: 100%
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

Discussion Tag Cloud

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.
    • CommentAuthorzskoda
    • CommentTimeJun 24th 2013

    I am going to rewrite a part of the Baer sum, the section “On short exact sequences”, partly following S. MacLane, Homology, 1963 (he does the version for extensions of R-modules). I am not fully understanding and would like to discuss the issue, but I think the current notation is a bit hiding. So here is the version of the section before my update, so it can be reversed if somebody not happy:

    For 0AˆGiG0 for i=1,2 two short exact sequences of abelian groups, their Baer sum is

    ˆG1+ˆG2+*Δ*ˆG1׈G2

    The first step forms the pullback of the short exact sequence along rhe diagonal on G:

    AAAAΔ*(ˆG1ˆG2)ˆG1ˆG2GΔGGG

    The second forms the pushout along the addition map on A:

    AA+AΔ*(ˆG1ˆG2)+*Δ*(ˆG1ˆG2)GG
    • CommentRowNumber2.
    • CommentAuthorTodd_Trimble
    • CommentTimeJun 24th 2013

    What you copied in #1 looks notationally just fine to me – is there a problem with it?

    • CommentRowNumber3.
    • CommentAuthorzskoda
    • CommentTimeJun 24th 2013
    • (edited Jun 24th 2013)

    This is my treatment (the old one is still there). I think it is more clear, though some more diagrams could be useful.

    In any category with products, for any object C there is a diagonal morphism ΔC:CC×C; in a category with coproducts there is a codiagonal morphism C:CCC (addition in the case of modules). Every additive category is, in particular, a category with finite biproducts, so both morphisms are there. Short exact sequences in the category of R-modules, or in arbitrary abelian category 𝒜, form an additive category (morphisms are commutative ladders of arrows) in which the biproduct 0AiHiGi0 for i=1,2 is 0A1A2H1H2G1G20.

    Now if 0MNP0 is any extension, call it E, and γ:P1P a morphism, then there is a morphism Γ=(idM,β1,γ) from an extension E1 of the form 0MN1P10 to E, where the pair (E1,Γ1) s unique up to isomorphism of extensions, and it is called Eγ. In fact, the diagram

    N1P1β1γNP

    is a pullback diagram. Every morphism of abelian extensions (α,β,γ):EE in a unique way decomposes as

    E(α,βa,id)Eγ(id,β1,γ)E

    for some βa, with β1 as above. In short, the morphism of extensions factorizes through Eγ.

    Dually, for any morphism α:MM2, there is a morphism Γ2=(α,β2,idP) to an extension E2 of the form 0M2N2P; the pair (E2,Γ2) is unique up to isomorphism of extensions and it is called αE.

    In fact, the diagram

    MNαβ2M2N2

    is a pushout diagram. Every morphism of abelian extensions (α,β,γ):EE in a unique way decomposes as

    E(α,β2,id)αE(id,βb,γ)E

    for some βb, with β2 as above. In short, the morphism of extensions factorizes through αE.

    There are the following isomorphisms of extensions: (αE)γα(Eγ), idMEE, EidPP, (αα)Eα(αE), (Eγ)γE(γγ).

    The Baer’s sum of two extensions E1,E2 of the form 0MNiP0 (i.e. with the same M and P) is given by E1+E2=M(E1E2)ΔP; this gives the structure of the abelian group on Ext(P,M) and Ext:𝒜op×𝒜Ab is a biadditive (bi)functor. This is also related to the isomorphisms of extensions α(E1+E2)αE1+αE2, (α1+α2)Eα1E+α2E, (E1+E2)γE1γ+E2γ, E(γ1+γ2)Eγ1+Eγ2.

    • CommentRowNumber4.
    • CommentAuthorzskoda
    • CommentTimeJun 24th 2013
    • (edited Jun 24th 2013)

    2 Notation +*Δ*(ˆG1ˆG2) does not reveal the additive nor abelian duality, nor the fact that the pullback and pushout steps can be interchanged. It s quite obscure to me; if I had not read it before I would not understand the treatment. I think the treatment a la MacLane with diagonal and codiagonal on the same footing, plus usage of operations of pullback and pushout as general operation on extensions (not of the same groups) is giving broad but clean context.

    On the other hand, the notation M(E1E2)ΔP, is symmetric and a special case of reconstruction of additive structure from the categorical structure in additive categories, a trick also used for stable infinity categories.

    • CommentRowNumber5.
    • CommentAuthorzskoda
    • CommentTimeJun 24th 2013
    • (edited Jun 24th 2013)

    My edits may be improperly reflected in the entry, as the nLab stalled when I was sending the biggest change to the entry. I wanted to have the content of entry 3 there.

    • CommentRowNumber6.
    • CommentAuthorzskoda
    • CommentTimeJun 24th 2013

    In fact, my interest is if we have a proper notion of short exact sequence and we have finite biproducts but not an additive category. Then one can still define the associative addition, however one may lack inverses. I am curious about such cases of Baer sum (giving additive monoids, if I am right).

    • CommentRowNumber7.
    • CommentAuthorzskoda
    • CommentTimeJun 24th 2013
    • (edited Jun 24th 2013)

    I have slightly updated 3, with much additional information. P.S. I am getting now the point of the original notation, as in 1. It looked to me that both stars are attached to Δ what was quite an obstacle to understanding.

    • CommentRowNumber8.
    • CommentAuthorTodd_Trimble
    • CommentTimeJun 24th 2013

    I mean, I agree with you that it’s a good idea to have some lemmas first on morphisms of ses (short exact sequences), such as are implicit in your #3, before launching into the text of #1. This is the bread and butter of homological algebra. I am not sure about more minimal hypotheses to push these lemmas through, such as weakening to enrichment in commutative monoids as opposed to abelian groups. I’d think one would have to work throughout with kernel pairs instead of mere kernels.

    I think adding words like “pullback functor” and “pushforward functor” could help some readers parse the notation Δ* and +* more readily.