try ai
Popular Science
Edit
Share
Feedback
  • Short Exact Sequence

Short Exact Sequence

SciencePediaSciencePedia
Key Takeaways
  • A short exact sequence 0→A→B→C→00 \to A \to B \to C \to 00→A→B→C→0 precisely describes how an algebraic object BBB is constructed as an extension of CCC by a subobject AAA.
  • The sequence "splits" if BBB is equivalent to the simple direct sum of AAA and CCC; non-splitting sequences represent more complex, "twisted" constructions.
  • The Ext1(C,A)\text{Ext}^1(C, A)Ext1(C,A) group classifies all possible ways to construct an object from AAA and CCC, providing a powerful tool for understanding algebraic structures.
  • This concept serves as a unifying language across mathematics, fundamental to group theory, algebraic topology (homology), and even differential geometry.

Introduction

The short exact sequence is one of the most powerful and elegant concepts in modern mathematics. Represented by a concise chain of objects and maps, 0→A→B→C→00 \to A \to B \to C \to 00→A→B→C→0, it provides a profound language for understanding how complex algebraic structures are built from simpler components. Its importance lies in its ability to precisely capture the relationship between a subobject (AAA), a larger object (BBB), and the resulting quotient structure (CCC). This article addresses the fundamental question of how algebraic objects are assembled and whether they can be broken down into their constituent parts, revealing the deep connections that underpin various mathematical fields.

This article will guide you through the world of short exact sequences in two main parts. First, we will explore the core "Principles and Mechanisms," dissecting the sequence to understand what exactness means at each step, the crucial difference between sequences that split and those that do not, and how these constructions are classified. Following this, the chapter on "Applications and Interdisciplinary Connections" will reveal how this abstract tool becomes a practical lens for solving problems and forging links between algebra, topology, and geometry.

Principles and Mechanisms

A short exact sequence, that compact chain of arrows and letters 0→A→B→C→00 \to A \to B \to C \to 00→A→B→C→0, is one of the most elegant and powerful pieces of notation in modern mathematics. It looks like a fragment of a secret code, but it’s actually a complete, self-contained story. It tells us how three objects are related, and more specifically, how a central object, BBB, is constructed from two others, AAA and CCC. Our mission in this chapter is to become fluent in the language of these sequences, to understand the drama they encode, and to see how they form the backbone of countless arguments in algebra and topology.

A Story in Three Acts: Subobject, Whole, and Quotient

Let's break down the sequence into its three main acts. We'll imagine our objects AAA, BBB, and CCC are abelian groups (or modules, the intuition is the same), which are sets where we can add and subtract elements.

The first part of the sequence, 0→A→fB0 \to A \xrightarrow{f} B0→Af​B, tells us that AAA is faithfully represented inside BBB. The map fff is ​​injective​​, a one-to-one mapping. This is guaranteed by the "exactness" at AAA, which states that the kernel of fff is the image of the map coming from the initial zero object—a map whose image is just the zero element. So, ker⁡(f)={0}\ker(f) = \{0\}ker(f)={0}, which is the very definition of injectivity. You can think of f(A)f(A)f(A) as a perfect, undistorted copy of AAA living inside BBB as a subgroup. AAA is the "subobject".

The final part, B→gC→0B \xrightarrow{g} C \to 0Bg​C→0, tells us that CCC is a kind of "shadow" or "quotient" of BBB. The map ggg is ​​surjective​​, meaning every element in CCC is the image of some element from BBB. The exactness at CCC ensures this: the image of ggg must equal the kernel of the final map into the zero object, which is the entire group CCC itself. So ggg covers all of CCC.

The central, most crucial part is the "exactness at BBB": im(f)=ker⁡(g)\text{im}(f) = \ker(g)im(f)=ker(g). This is the link that ties the story together. It says that the subgroup of BBB that is the copy of AAA is precisely the set of elements in BBB that are "crushed" to zero by the map ggg. When we form CCC by mapping BBB with ggg, we are effectively ignoring the structure of AAA. By the First Isomorphism Theorem, this means CCC is what's left of BBB after we "quotient out" by the image of AAA. In other words, we have the fundamental relationship:

C≅B/im(f)C \cong B / \text{im}(f)C≅B/im(f)

This isn't just an abstract statement. If you know BBB is the group of integers modulo 10, Z10\mathbb{Z}_{10}Z10​, and AAA is the group Z2\mathbb{Z}_2Z2​ which is mapped to the subgroup {0,5}\{0, 5\}{0,5} inside Z10\mathbb{Z}_{10}Z10​, then the sequence tells you CCC must be the quotient group Z10/{0,5}\mathbb{Z}_{10} / \{0, 5\}Z10​/{0,5}, which is isomorphic to Z5\mathbb{Z}_5Z5​. The sequence acts like a calculator for group structures.

So, a short exact sequence tells a story of an object BBB containing a subobject AAA (f(A)f(A)f(A)), such that when BBB is simplified by "collapsing" AAA to nothing, the result is CCC. BBB is, in a precise sense, an ​​extension​​ of CCC by AAA.

The Big Question: Does It Come Apart?

This brings us to the most natural question imaginable: if BBB is built from AAA and CCC, is it just their simplest possible combination, the direct sum A⊕CA \oplus CA⊕C? Sometimes, the answer is a delightful "yes". When this happens, we say the sequence ​​splits​​.

A split sequence is one where the "gluing" of AAA and CCC to form BBB is trivial. Imagine a ship in a bottle. The ship is BBB. It contains the rigging, AAA, and the hull, CCC. Is the ship just a hull with rigging sitting next to it? Or is the rigging inextricably woven through the hull in a complex way? A split sequence is like the first case.

Formally, a sequence splits if BBB is isomorphic to A⊕CA \oplus CA⊕C. But how can we tell? There are two beautiful and equivalent criteria that are often easier to check:

  1. ​​Existence of a Retraction:​​ There is a map r:B→Ar: B \to Ar:B→A that "pulls back" BBB onto AAA in a way that is the identity for the elements that were already in AAA. That is, r∘f=idAr \circ f = \text{id}_Ar∘f=idA​. The map rrr acts like a principled dismantling, recognizing the AAA part of BBB and extracting it perfectly.

  2. ​​Existence of a Section:​​ There is a map s:C→Bs: C \to Bs:C→B that embeds CCC into BBB as a subgroup, such that when we then project BBB back to CCC, we get CCC back. That is, g∘s=idCg \circ s = \text{id}_Cg∘s=idC​. This means we can find a "cross-section" of the B→CB \to CB→C projection—a pristine copy of CCC sitting inside BBB.

If any of these conditions hold, BBB falls apart neatly into its constituent pieces, AAA and CCC.

The Art of Not Splitting

Here is where the story gets really interesting. The power and richness of this theory come from the fact that sequences often do not split. The object BBB can be a genuinely new structure—a "twisted" product of AAA and CCC that cannot be untangled.

The most famous example is the sequence of integers:

0→Z→×2Z→mod 2Z2→00 \to \mathbb{Z} \xrightarrow{\times 2} \mathbb{Z} \xrightarrow{\text{mod } 2} \mathbb{Z}_2 \to 00→Z×2​Zmod 2​Z2​→0

Here, A=ZA = \mathbb{Z}A=Z, B=ZB = \mathbb{Z}B=Z, and C=Z2C = \mathbb{Z}_2C=Z2​. The map fff is multiplication by 2, embedding Z\mathbb{Z}Z into itself as the even numbers. The map ggg reduces an integer modulo 2. The image of fff (the even numbers) is precisely the kernel of ggg. The sequence is exact.

Does it split? If it did, it would mean B≅A⊕CB \cong A \oplus CB≅A⊕C, or Z≅Z⊕Z2\mathbb{Z} \cong \mathbb{Z} \oplus \mathbb{Z}_2Z≅Z⊕Z2​. But this is impossible! The group Z\mathbb{Z}Z is ​​torsion-free​​: no non-zero element, when multiplied by an integer, can become zero. But the group Z⊕Z2\mathbb{Z} \oplus \mathbb{Z}_2Z⊕Z2​ has a torsion element, (0,1)(0, 1)(0,1), because 2⋅(0,1)=(0,0)2 \cdot (0, 1) = (0, 0)2⋅(0,1)=(0,0). They cannot be the same. The middle Z\mathbb{Z}Z is a fundamentally different object from the simple direct sum. It's a non-trivial extension.

This non-splitting phenomenon is the difference between simple assembly and true synthesis. Consider building a group of order 4. We can take two copies of Z2\mathbb{Z}_2Z2​ and form the direct sum Z2⊕Z2\mathbb{Z}_2 \oplus \mathbb{Z}_2Z2​⊕Z2​. This corresponds to a split short exact sequence. But there is another group of order 4, the cyclic group Z4\mathbb{Z}_4Z4​. It also fits into a sequence 0→Z2→Z4→Z2→00 \to \mathbb{Z}_2 \to \mathbb{Z}_4 \to \mathbb{Z}_2 \to 00→Z2​→Z4​→Z2​→0. This sequence does not split. The groups Z2⊕Z2\mathbb{Z}_2 \oplus \mathbb{Z}_2Z2​⊕Z2​ and Z4\mathbb{Z}_4Z4​ are two different ways to be "built from two Z2\mathbb{Z}_2Z2​s". One is trivial, one is twisted.

Interestingly, this "twisting" is a feature of modules over most rings, but not all. If we consider modules over a field—that is, vector spaces—every short exact sequence splits!. Given a subspace UUU of a vector space VVV, one can always find a complementary subspace WWW such that V=U⊕WV = U \oplus WV=U⊕W. This is not true for modules in general, and the failure of this property is precisely what short exact sequences are designed to measure.

A Web of Properties

A sequence doesn't just relate structures; it relates their properties. Information flows along the arrows in predictable, though sometimes surprising, ways. Let's revisit the idea of being torsion-free. Consider a general sequence 0→A→B→C→00 \to A \to B \to C \to 00→A→B→C→0.

  • If BBB is torsion-free, then AAA must be too, since it lives inside BBB as a subgroup. However, CCC might not be! Our friend 0→Z→×2Z→Z2→00 \to \mathbb{Z} \xrightarrow{\times 2} \mathbb{Z} \to \mathbb{Z}_2 \to 00→Z×2​Z→Z2​→0 is the perfect example: B=ZB=\mathbb{Z}B=Z is torsion-free, but C=Z2C=\mathbb{Z}_2C=Z2​ is a torsion group. This makes sense: the process of taking a quotient can introduce torsion.

  • Conversely, if AAA and CCC are torsion-free, then BBB must be torsion-free as well. The proof is a beautiful "diagram chase": if an element b∈Bb \in Bb∈B has torsion, its image in CCC must be zero (since CCC is torsion-free). So bbb must have come from AAA. But AAA is also torsion-free, so bbb must have been the zero element to begin with.

This shows the sequence as a powerful logical tool. Properties like being finite, cyclic, or free also propagate through the sequence in specific ways, allowing us to deduce facts about one object from facts about the others.

The Geography of Extensions

We've seen that for a given AAA and CCC, there can be at least two ways to form BBB: the simple direct sum A⊕CA \oplus CA⊕C (the split case) and potentially other, twisted versions like Z4\mathbb{Z}_4Z4​. This begs the question: how many different extensions are there? Can we classify them?

The answer is one of the most profound results in the field. The collection of all possible extensions of CCC by AAA (up to a natural equivalence) is not just a messy pile; it forms an abelian group itself! This group is called the first ​​Ext group​​, denoted ExtR1(C,A)\text{Ext}^1_R(C, A)ExtR1​(C,A).

In this group, the "zero element" corresponds to the one trivial, split extension, B≅A⊕CB \cong A \oplus CB≅A⊕C. All the other, non-split, twisted extensions correspond to the non-zero elements of ExtR1(C,A)\text{Ext}^1_R(C, A)ExtR1​(C,A). For our example A=C=Z2A=C=\mathbb{Z}_2A=C=Z2​, the group ExtZ1(Z2,Z2)\text{Ext}^1_{\mathbb{Z}}(\mathbb{Z}_2, \mathbb{Z}_2)ExtZ1​(Z2​,Z2​) turns out to be Z2\mathbb{Z}_2Z2​. This means there is one non-zero element, corresponding to exactly one non-split extension—the Z4\mathbb{Z}_4Z4​ group! The Ext\text{Ext}Ext group perfectly classifies the ways AAA and CCC can be glued together.

Some modules are simply "allergic" to being part of a twisted construction. A module PPP is called ​​projective​​ if every short exact sequence 0→A→B→P→00 \to A \to B \to P \to 00→A→B→P→0 that ends in PPP must split. Projective modules are so well-behaved that they refuse to form non-trivial extensions. They always guarantee the existence of a section. Free modules are the prime examples of projective modules, and it turns out that projective modules are precisely the pieces you can "chip off" of free modules—they are the direct summands of free modules. The dual notion of an ​​injective module​​ III ensures that any sequence 0→I→B→C→00 \to I \to B \to C \to 00→I→B→C→0 starting with III must split.

The existence of non-zero Ext\text{Ext}Ext groups—the fact that some sequences don't split—is the engine that drives a vast area of mathematics called homological algebra. It is a measure of how far the world of modules is from the simpler world of vector spaces. And it all begins with that simple, elegant line of arrows, a short story with a surprisingly deep plot.

Applications and Interdisciplinary Connections

We have seen that a short exact sequence is a tidy, powerful piece of algebraic machinery. But like any good tool, its true value is not in what it is, but in what it does. It's not just a definition to be memorized; it is a lens through which we can view the world, a language that reveals deep and often surprising connections between seemingly disparate fields of thought. Once you learn to speak this language, you start seeing these sequences everywhere, whispering secrets about the hidden structure of mathematics itself. Let's embark on a journey to see where this simple-looking arrow notation takes us.

The Anatomy of Abstract Structures

At its heart, a short exact sequence 0→A→B→C→00 \to A \to B \to C \to 00→A→B→C→0 tells a story about how a larger object BBB is built from smaller pieces, a sub-object AAA and a quotient object CCC. A natural first question is: can we always reconstruct BBB by just sticking AAA and CCC together? The answer to this question is a fascinating "sometimes," and exploring that "sometimes" reveals the very anatomy of algebraic structures.

Let's start with the most familiar of groups: the integers modulo nnn, or Zn\mathbb{Z}_nZn​. These are the groups of clock arithmetic. If you have a short exact sequence of these cyclic groups, like 0→Za→Zb→Zc→00 \to \mathbb{Z}_a \to \mathbb{Z}_b \to \mathbb{Z}_c \to 00→Za​→Zb​→Zc​→0, it turns out this structure can only exist if aaa is a divisor of bbb, and in that case, ccc is forced to be b/ab/ab/a. This means the short exact sequence provides a complete census of all the ways one cyclic group can be a subgroup of another with a cyclic quotient. It's a crisp, elegant description of the internal structure of these fundamental groups.

But what happens when the groups are more complicated? Consider any finite group GGG with a normal subgroup HHH. This setup naturally gives us the short exact sequence 1→H→G→G/H→11 \to H \to G \to G/H \to 11→H→G→G/H→1. Now we can ask our question again: can GGG be "decomposed" back into HHH and G/HG/HG/H? The celebrated ​​Schur-Zassenhaus theorem​​ gives us a powerful condition for when this is possible. It states that if the orders of HHH and G/HG/HG/H are coprime, then the sequence splits. In our language, this means there is a way to "reverse" the projection map, embedding a copy of the quotient G/HG/HG/H back into GGG. The consequence is that GGG can be written as a semidirect product, G≅H⋊(G/H)G \cong H \rtimes (G/H)G≅H⋊(G/H). So, the abstract question of whether a sequence splits tells us something very concrete about the group's structure: it can be built by taking the elements of HHH and "stirring" them using the elements of G/HG/HG/H.

This is wonderful, but the most profound insights often come from when things don't work out so simply. The cases where a sequence doesn't split are where the magic happens. A prime example is the quaternion group, Q8Q_8Q8​. Its center is the two-element group Z(Q8)={1,−1}Z(Q_8) = \{1, -1\}Z(Q8​)={1,−1}, and the quotient group Q8/Z(Q8)Q_8/Z(Q_8)Q8​/Z(Q8​) is the Klein four-group V4V_4V4​. This gives us a central extension described by the sequence 1→Z2→Q8→V4→11 \to \mathbb{Z}_2 \to Q_8 \to V_4 \to 11→Z2​→Q8​→V4​→1. Does this sequence split? If it did, Q8Q_8Q8​ would have to be a direct or semidirect product of Z2\mathbb{Z}_2Z2​ and V4V_4V4​. But it is not! The group Q8Q_8Q8​ has a more intricate, "twisted" structure that cannot be so easily undone. This non-splitting nature is a precise algebraic fingerprint of that twist. Short exact sequences, therefore, don't just classify the simple cases; they precisely describe the non-trivial ways in which larger structures can be assembled.

This principle extends beautifully into the world of representation theory. A cornerstone of the subject, ​​Maschke's Theorem​​, tells us when representations of a group can be broken down into their simplest, irreducible components. It turns out this entire theorem can be rephrased in a breathtakingly simple way using our new language: under the right conditions, every representation is completely reducible if and only if every short exact sequence of modules splits. This is a moment of profound unification. An entire, seemingly complex theorem about decomposing representations is captured by a single, elegant statement about the behavior of these sequences.

The Language of Topology and Homology

If short exact sequences provide the anatomy of algebra, they form the very grammar of algebraic topology. In topology, we study shapes by associating algebraic objects—like groups—to them. The process of "homology" is a primary tool for doing this. It measures, in a sense, the number and type of "holes" in a space.

The very definition of the iii-th homology or cohomology group, HiH^iHi, is encoded in a short exact sequence. The group HiH^iHi is defined as the quotient of "cycles" (ZiZ^iZi) by "boundaries" (BiB^iBi). A cycle is something that could be the boundary of a higher-dimensional object, but isn't necessarily one within our space. A boundary is a cycle that actually is the boundary of something. The homology group consists of cycles that are not boundaries—the "holes." This entire foundational concept, Hi=Zi/BiH^i = Z^i / B^iHi=Zi/Bi, is expressed perfectly by the canonical short exact sequence: 0→Bi→Zi→Hi→00 \to B^i \to Z^i \to H^i \to 00→Bi→Zi→Hi→0. Homology, at its core, is a short exact sequence.

Building on this, homological algebra provides a powerful strategy: if you have a complicated object (like a module MMM), try to "approximate" it with simpler ones you understand well, like free modules. A "finite free resolution" does just this, giving a short exact sequence 0→F1→F0→M→00 \to F_1 \to F_0 \to M \to 00→F1​→F0​→M→0, where F0F_0F0​ and F1F_1F1​ are free. You might think that there are many ways to do this, and you'd be right. But a remarkable fact is that certain properties are invariant. For instance, the difference in the "sizes" (ranks) of the free modules, rank(F0)−rank(F1)\text{rank}(F_0) - \text{rank}(F_1)rank(F0​)−rank(F1​), is always the same, and it tells you something intrinsic about the original module MMM—its own rank. This is like measuring the weight of a oddly shaped object by balancing it against a set of standard, well-understood weights.

The pinnacle of this approach is found in the ​​Universal Coefficient Theorems (UCT)​​. Suppose you've done the hard work of computing the homology of a space XXX with integer coefficients, Hn(X;Z)H_n(X; \mathbb{Z})Hn​(X;Z). What if you need to know the homology with coefficients in a different group, say GGG? The UCT provides the answer, and it does so, of course, with a short exact sequence. For homology, it states there is a split short exact sequence: 0→(Hn(X;Z)⊗G)→Hn(X;G)→Tor(Hn−1(X;Z),G)→00 \to \left(H_n(X; \mathbb{Z}) \otimes G\right) \to H_n(X; G) \to \text{Tor}\left(H_{n-1}(X; \mathbb{Z}), G\right) \to 00→(Hn​(X;Z)⊗G)→Hn​(X;G)→Tor(Hn−1​(X;Z),G)→0. A similar, related sequence exists for cohomology, involving the Hom\text{Hom}Hom and Ext\text{Ext}Ext functors. Don't worry too much about the new terms like ⊗\otimes⊗, Tor\text{Tor}Tor, and Ext\text{Ext}Ext. The big idea is that the homology with new coefficients, Hn(X;G)H_n(X; G)Hn​(X;G), is built from two pieces. The main piece is just the old homology tensored with GGG. The second piece, the Tor\text{Tor}Tor term, is a "correction" term that depends on the homology in the dimension below. The short exact sequence tells us precisely how these pieces fit together to give the full answer. It is a universal translation machine, and it is powered by the logic of short exact sequences.

From Abstract Algebra to Concrete Geometry

The connections forged by short exact sequences are not confined to the abstract realms of algebra. They provide a sturdy bridge to the tangible world of geometry.

A fascinating correspondence links the algebra of groups to the topology of spaces. To any group GGG, one can associate a special "classifying space" BGBGBG whose fundamental group is GGG. Now, what happens if we start with a short exact sequence of groups, 1→K→G→H→11 \to K \to G \to H \to 11→K→G→H→1? Incredibly, this algebraic structure blossoms into a geometric one: the corresponding classifying spaces form a fiber sequence, BK→BG→BHBK \to BG \to BHBK→BG→BH. This sequence has profound topological consequences, chief among them being a ​​long exact sequence of homotopy groups​​. This long sequence weaves together the homotopy groups of all three spaces, linking the topological features of the fiber (BKBKBK), the total space (BGBGBG), and the base (BHBHBH) in an intricate, beautiful pattern. An algebraic relationship between groups becomes a deep geometric relationship between spaces.

Perhaps the most stunningly direct application comes from differential geometry. Imagine two surfaces, SSS and TTT, inside a larger space MMM, like R4\mathbb{R}^4R4. Suppose they are oriented and intersect transversely at a point ppp. The intersection itself will be a lower-dimensional manifold, which we would also like to orient. For a zero-dimensional intersection (an isolated point), this just means assigning it a sign, +1+1+1 or −1-1−1. How do we decide? A short exact sequence of tangent spaces comes to the rescue: 0→Tp(S∩T)→TpS⊕TpT→TpM→00 \to T_p(S \cap T) \to T_pS \oplus T_pT \to T_pM \to 00→Tp​(S∩T)→Tp​S⊕Tp​T→Tp​M→0 The orientations of SSS, TTT, and MMM provide orientations on their respective tangent spaces. The abstract algebraic properties of this sequence then uniquely determine a natural orientation for the intersection space Tp(S∩T)T_p(S \cap T)Tp​(S∩T). This allows one to rigorously define an "intersection number" by summing up these signs over all intersection points. What began as a purely algebraic notion provides the foundation for a concrete, computable geometric invariant.

From the building blocks of groups to the holes in a donut, and from the decomposition of representations to the collision of surfaces, the short exact sequence is a unifying thread. It is a simple, elegant concept that, once understood, reveals the profound and beautiful unity that underlies the vast landscape of mathematics.