Altanis

September 29th, 2026

Updated 30 Sep 2026Notes (PDF)

[0.0.72]Definition(Exact Sequence)#

Let A,B,CA, B, C be arbitrary groups, together with exact sequences f:A→Bf: A \to B and g:B→Cg: B \to C. We write this as a sequence of objects and maps as such.

We say the sequence is exact if im⁡(f)=ker⁡(g)\im(f) = \ker(g). In general, a longer sequence is exact if all parts of the sequence are exact wherever possible.

[0.0.73]Remark(Intuition Behind Exactness)#

Consider the sequence of three objects again. We split (heh, see what I did there) the condition im⁡(f)=ker⁡(g)\im(f) = \ker(g) into the conditions im⁡(f)⊆ker⁡(g)\im(f) \subseteq \ker(g) and ker⁡(g)⊆im⁡(f)\ker(g) \subseteq \im(f). The first says that, for all objects “entering” at BB (i.e., for all objects that are sent from AA to BB by ff), when these objects “leave” BB (i.e., the objects are sent to CC by gg), they are killed. Conversely, the only objects killed when leaving BB are precisely the objects that enter BB. In sum, all objects that enter BB are killed when leaving, and these are the only objects killed when exiting BB.

We denote 11 to be the trivial group (we write it as 00 if the group is additive).

[0.0.74]Remark(Exact Sequences Encoding Injectivity and Surjectivity)#

By the definition of exactness, we can construct short sequences that encode whether a map is injective or surjective. For example, consider the following sequence:

This sequence is exact at AA if and only if ff is injective. The unique map ¡:1→A\text{¡} : 1 \to A from the zero (initial) object sends the trivial element of 11 to the identity element of AA. Because no other elements are mapped, its image is simply the trivial subgroup: im⁡(¡)={1A}\im(\text{¡}) = \{1_A\}. By definition, exactness at AA requires everything entering to match everything killed when leaving, meaning im⁡(¡)=ker⁡(f)\im(\text{¡}) = \ker(f). Substituting our image, we get ker⁡(f)={1A}\ker(f) = \{1_A\}, which is precisely the condition for ff to be an injective map.

Moreover, consider the following sequence:

Similarly, this sequence is exact at CC if and only if gg is surjective. The unique map !:C→1! : C \to 1 into the zero (terminal) object sends every single element in CC to the trivial element in 11. Because everything in CC is “killed” by this map, its kernel is the entire object: ker⁡(!)=C\ker(!) = C. Exactness at CC requires that im⁡(g)=ker⁡(!)\im(g) = \ker(!). Substituting our kernel, this reduces to im⁡(g)=C\im(g) = C, which is precisely the condition for gg to be a surjective map.

[0.0.75]Definition(Short Exact Sequence, Extension)#

Consider the sequence as follows.

We say this sequence is short exact if the sequence is exact. In other words, the sequence is short exact if ff is injective, im⁡(f)=ker⁡(g)\im(f) = \ker(g), and gg is surjective.

We typically do not notate the initial and terminal maps in a short exact sequence.

[0.0.76]Remark(Quotients in Exact Sequences)#

Suppose we have a short exact sequence given as follows.

First, note that ff is injective, so ker⁡(f)=1\ker(f) = 1. Then ff is an isomorphism onto its image, and so A≅f(A)A \cong f(A). But note the image of a subgroup of the domain is a subgroup in the codomain, so we have that f(A)f(A) is a subgroup of BB. Since A≅f(A)A \cong f(A), it has all the structural properties of f(A)f(A), and so we can also treat AA as a subgroup of BB! Moreover, note that the sequence is exact, so [im⁡(f)=f(A)]=ker⁡(g)[\im(f) = f(A)] = \ker(g), and so f(A)f(A) is a normal subgroup of BB. Then, AA is realized as a normal subgroup of BB. Finally, recall that gg is surjective. Then im⁡(g)=C\im(g) = C. This culminates into an encoding of the First Isomorphism Theorem. Indeed, since B/ker⁡(g)≅im⁡(g)B/{\ker(g)} \cong \im(g), we have that B/A≅CB/A \cong C. Noting this, we can actually rewrite the exact sequence as follows.

From this, we will realize the First Isomorphism Theorem for an arbitrary homomorphism φ:G→G′\phi: G \to G'. Indeed, note that

is a short exact sequence. Recalling the fact that every normal subgroup NN of a group GG is the kernel of some homomorphism, namely of the canonical projection π:G→G/N\pi: G \to G/N, we can make any exact sequence of the form 1→A→B→B/A→11 \to A \to B \to B/A \to 1 as usual.

As a little aside, the idea of (A≅f(A))≤B(A \cong f(A)) \le B is a common trick. For example, if f:A→Bf: A \to B is an embedding of topological spaces, then AA and f(A)f(A) are homeomorphic, and f(A)f(A) is a subspace of BB. Thus AA is realized as a subspace of BB by isomorphism in Top\Top. If T:V→WT: V \to W is an injective linear map, then (V≅T(V))(V \cong T(V)) is a subspace of WW, and so on, so forth.

[0.0.77]Definition(Section)#

Consider, once again, the following exact sequence.

A section of the surjection p:G→Hp: G \to H is a homomorphism s:H→Gs: H \to G such that p∘s=idHp \circ s = \id_H.

Note that the surjection p:G→Hp: G \to H acts like a “projection”. Indeed, identify (N≅ι(N))(N \cong \iota(N)) as a normal subgroup of GG, and note that G/N≅HG/N \cong H. In the same way π:G→G/N\pi: G \to G/N is the perfect, canonical projection of GG onto G/NG/N, we have that s:G→Hs: G \to H is a more general version of the canonical projection. Namely, it is surjective, and it maps a group to effectively its quotient (up to isomorphism), so it is OK to loosely interpret pp as a projection.

[0.0.78]Example(Exact Sequence of Vector Spaces)#

Consider the exact sequence as follows.

Define p:R3→R2p: \bR^3 \to \bR^2 by p(x,y,z)=(x,y)p(x, y, z) = (x, y). We will observe what a section of pp truly is.

First, a section s:R2→R3s: \bR^2 \to \bR^3 must be a right-inverse. For p∘s=idR2p \circ s = \id_{\bR^2} to be true, we need that s(x,y)=(x,y,f(x,y))s(x, y) = (x, y, f(x, y)) for any function f(x,y)f(x, y). But we also need ss to be a homomorphism. For example, consider the right-inverse

s(x,y)=(x,y,1).s(x, y) = (x, y, 1).

Then note that ss is not a homomorphism of vector spaces (i.e., a linear map), since ss does not preserve the origin. Instead, consider the following right-inverses.

(x,y)↦(x,y,0)(x,y)↦(x,y,x)(x,y)↦(x,y,2x+4y)(x, y) \mapsto (x, y, 0) \quad (x, y) \mapsto (x, y, x) \quad (x, y) \mapsto (x, y, 2x + 4y)

Note they are all proper sections, since these represent homomorphisms.

We note one more thing: geometrically, all of these sections work by physically embedding R2\bR^2 into R3\bR^3. The entire xyxy-plane is mapped into R3\bR^3 with a potential tilt, angle, or general transformation that respects linearity. If, instead, we did not demand that a section be a homomorphism, a map like (x,y)↦(x,y,x2)(x, y) \mapsto (x, y, x^2) would be problematic. Indeed, the image of R2\bR^2 under this map would no longer be a plane, but an ugly, mangled, grotesque paraboloid. We illustrate this property in more generality as follows.

Suppose p:G→Hp: G \to H is a projection of groups as usual, and s:H→Gs: H \to G a section. Note that ss admits a left-inverse by construction, namely pp, and so ss is injective. Recall that an injective homomorphism s:H→Gs: H \to G tells us that (H≅s(H))(H \cong s(H)) is a subgroup of GG. Thus the map ss embeds a nice copy of HH, namely s(H)s(H), inside GG. The point is that, in enforcing the section s:H→Gs: H \to G be a homomorphism, we are able to establish H≅s(H)H \cong s(H), and so we can embed a perfect copy of HH in GG as desired.

[0.0.79]Definition(Split Short Exact Sequence)#

A short exact sequence 1→N→G→pH→11 \to N \to G \xrightarrow{p} H \to 1 is said to be split if it admits a section.

[0.0.80]Theorem(Equivalent Conditions for Splitting in Exact Sequences of Groups)#

Suppose 1→N→G→pH→11 \to N \to G \xrightarrow{p} H \to 1 is a short exact sequence of groups. Then the following statements are equivalent:

  1. The exact sequence splits.

  2. pp has a section s:H→Gs: H \to G.

  3. There is a subgroup H′≤GH' \le G such that p∣H′:H′→Hp|_{H'}: H' \to H is an isomorphism of groups.

  4. There is some group action φ:H→Aut⁡(N)\phi: H \to \Aut(N) such that G≅N⋊φHG \cong N \rtimes_{\phi} H.

[0.0.81]Remark(Deriving the Semidirect Product)#

The equivalences (1)  ⟺  (2)  ⟺  (3)(1) \iff (2) \iff (3) follow readily from our earlier discussion, as any section s:H→Gs: H \to G embeds an isomorphic copy H′=s(H)≤GH' = s(H) \le G with inverse p∣H′p|_{H'}. We now elaborate on how these conditions produce (4)(4).

Once again, let

1→N→G→pH→11 \to N \to G \xrightarrow{p} H \to 1

be split, so that p:G→Hp: G \to H admits a section s:H→Gs: H \to G, and let H′=s(H)≤GH' = s(H) \le G. First, we demonstrate that each g∈Gg \in G has a unique representation as g=nhg = nh, with n∈Nn \in N and h∈H′h \in H'.

To show existence, take an arbitrary element g∈Gg \in G, project it down to p(g)∈Hp(g) \in H, and pull it back into GG via the section by setting h=s(p(g))∈H′h = s(p(g)) \in H'. Since p∘s=idHp \circ s = \id_H, we immediately see that p(h)=p(s(p(g)))=p(g)p(h) = p(s(p(g))) = p(g), meaning gg and hh share the exact same projection. Because pp is a homomorphism, we have

p(g)=p(h)  ⟹  p(gh−1)=1H,p(g) = p(h) \implies p(gh^{-1}) = 1_H,

and so gh−1∈ker⁡(p)gh^{-1} \in \ker(p). By exactness, recall that ker⁡(p)=N\ker(p) = N, which means gh−1=ngh^{-1} = n for some n∈Nn \in N. Rearranging yields g=nhg = nh, as desired.

To see that this expression is unique, suppose g=n1h1=n2h2g = n_1 h_1 = n_2 h_2 for some n1,n2∈Nn_1, n_2 \in N and h1,h2∈H′h_1, h_2 \in H'. Rearranging gives n2−1n1=h2h1−1n_2^{-1} n_1 = h_2 h_1^{-1}. Notice that the left-hand side lives in NN, while the right-hand side lives in H′H', so this element must lie in the intersection N∩H′N \cap H'. However, any element in N=ker⁡(p)N = \ker(p) is killed by pp, whereas p∣H′p|_{H'} is an isomorphism (and thus injective). The only element in H′H' killed by pp is the identity, so N∩H′={idG}N \cap H' = \{\id_G\}. This forces n2−1n1=idGn_2^{-1} n_1 = \id_G and h2h1−1=idGh_2 h_1^{-1} = \id_G, proving n1=n2n_1 = n_2 and h1=h2h_1 = h_2.

Finally, we examine how multiplication behaves under this decomposition. Given two elements g1=n1h1g_1 = n_1 h_1 and g2=n2h2g_2 = n_2 h_2, we want to express their product (n1h1)(n2h2)(n_1 h_1)(n_2 h_2) in our canonical form (N-part)(H′-part)(N\text{-part})(H'\text{-part}). Because GG is not necessarily abelian, we cannot simply swap h1h_1 and n2n_2. Instead, we introduce h1−1h1=idGh_1^{-1} h_1 = \id_G to move h1h_1 past n2n_2:

(n1h1)(n2h2)=n1(h1n2h1−1)h1h2.(n_1 h_1)(n_2 h_2) = n_1 (h_1 n_2 h_1^{-1}) h_1 h_2.

Because N⊴GN \unlhd G is a normal subgroup, conjugation by h1∈H′h_1 \in H' preserves NN, guaranteeing that h1n2h1−1∈Nh_1 n_2 h_1^{-1} \in N. We record this twisting interaction between the two subgroups via the homomorphism φ:H′→Aut⁡(N)\phi: H' \to \Aut(N) defined by φh(n)=hnh−1\phi_h(n) = hnh^{-1}. Substituting this in, the multiplication law becomes

(n1h1)(n2h2)=(n1φh1(n2))(h1h2).(n_1 h_1)(n_2 h_2) = \big(n_1 \phi_{h_1}(n_2)\big)(h_1 h_2).

Because ss is a homomorphism, H′H' is a subgroup, meaning h1h2h_1 h_2 stays inside H′H'. Identifying H′H' with HH, this multiplication rule is precisely the semidirect-product law, giving G≅N⋊φHG \cong N \rtimes_{\phi} H.

Note that if HH is normal in the exact sequence, then so is H′H', and equivalently the twisting action is trivial. Thus a split SES corresponds to a direct product if NN and HH are both normal.

We can readily apply exact sequences to vector spaces. Considerably nice results are that all short exact sequences in Vect\Vect split, and that rank-nullity is a consequence of the First Isomorphism Theorem (interpreted through the exact sequence 0→ker⁡(T)→V→Tim⁡(T)→00 \to \ker(T) \to V \xrightarrow{T} \im(T) \to 0 if desired).

Internal and external direct sums of vector spaces fall out immediately by considering vector spaces as abelian additive groups. Discussion about bases, direct sums, matrix representations of a linear map, and the equivalence of injectivity, surjectivity, and invertibility are omitted due to their simplicity.