Exact sequences are the grammar of algebraic topology. They do not merely “organize computations.” They express the way information passes between a space, a subspace, and a quotient, or between fibers and bases, or between pieces in a decomposition. Once you can read and build exact sequences fluently, many problems stop feeling mysterious: you start seeing where the unknown group must sit, what map could possibly connect it to known groups, and which hypotheses force kernels or cokernels to vanish.
This guide is a strategy manual for using exact sequences as a first move. The emphasis is not on memorizing named sequences, but on learning when each one is the right lens.
Premium Audio PickWireless ANC Over-Ear HeadphonesBeats Studio Pro Premium Wireless Over-Ear Headphones
Beats Studio Pro Premium Wireless Over-Ear Headphones
A broad consumer-audio pick for music, travel, work, mobile-device, and entertainment pages where a premium wireless headphone recommendation fits naturally.
- Wireless over-ear design
- Active Noise Cancelling and Transparency mode
- USB-C lossless audio support
- Up to 40-hour battery life
- Apple and Android compatibility
Why it stands out
- Broad consumer appeal beyond gaming
- Easy fit for music, travel, and tech pages
- Strong feature hook with ANC and USB-C audio
Things to know
- Premium-price category
- Sound preferences are personal
What exactness really buys you
An exact sequence is a controlled statement about failure:
- The image of one map is exactly the obstruction to injectivity of the next.
- Kernels and cokernels become computable objects when you can identify images.
In practice, exactness lets you replace a global question (“What is $H_n(X)$?”) with local questions (“What is the image of this boundary map?”). That replacement is what makes computations possible.
A good mental model is to think of exact sequences as an accounting ledger:
- terms you know,
- terms you want,
- maps that carry constraints,
- and exactness that forces consistency.
The three sequences you reach for first
Most day-\to-day work in basic algebraic topology relies on three big sources of exact sequences:
- the long exact sequence of a pair $(X,A)$,
- Mayer–Vietoris for a union $X=U\cup V$,
- and long exact sequences from fibrations (and, in simpler cases, covering spaces).
They are related, but they feel different in use. The table below summarizes when each is the right first move.
| Situation | First sequence to try | Why it fits |
|—|—|—|
| you have a subspace $A\subseteq X$ that is “simpler” | long exact sequence of the pair $(X,A)$ | relative groups convert “add $A$” into a boundary map |
| you can decompose $X$ into overlapping pieces | Mayer–Vietoris | it turns local data on $U,V,U\cap V$ into global data on $X$ |
| $X$ is built from repeating local structure (fibers, covers) | fibration / covering long exact sequence | it relates invariants of total space, base, and fiber |
The rest of this article shows how \to think with each sequence.
Strategy 1: Long exact sequence of a pair $(X,A)$
If $A\subseteq X$, the pair produces a long exact sequence in homology:
The new object $H_n(X,A)$ measures what is “added” when you pass from $A$ \to $X$. That is the conceptual value: relative homology turns a space-building problem into an algebra problem.
When the pair is a cell attachment
The cleanest use of the pair sequence is when $X$ is built from $A$ by attaching cells. If you attach $n$–cells \to $A$, then $H_k(X,A)$ is usually concentrated in degree $n$ and looks like a free abelian group generated by those cells. The boundary map $\partial$ then encodes the attaching maps.
That gives a repeatable computation pattern:
- identify $A$ and the attached cells,
- compute $H_*(A)$,
- compute $H_*(X,A)$ from cell counts,
- determine $\partial$ from attaching degrees,
- solve for $H_*(X)$ using exactness.
This is why CW complexes are so algebra-friendly: the pair sequence becomes a controlled pipeline.
A compact worked example: $\mathbb{R}P^2$
Let $X=\mathbb{R}P^2$ and let $A=\mathbb{R}P^1\cong S^1$. The CW structure attaches one 2–cell \to $S^1$ by a map of degree 2. Relative homology $H_2(X,A)\cong \mathbb{Z}$ is generated by that 2–cell, and $H_1(A)\cong \mathbb{Z}$.
The boundary map $\partial: H_2(X,A)\to H_1(A)$ records the attaching degree, so it is multiplication by 2. Exactness at $H_1(A)$ then forces
Everything else follows similarly, yielding the standard result:
The point is not the answer. The point is that the pair sequence reduced topology \to “what is the degree of the attaching map?”
Strategy 2: Mayer–Vietoris as a controlled glueing argument
When $X=U\cup V$ with $U$ and $V$ “simpler,” Mayer–Vietoris gives a long exact sequence
This is an exactness statement about glueing: what disappears when you identify overlap data.
Mayer–Vietoris is most powerful when:
- $U$ and $V$ deformation retract to lower-dimensional cores, and
- $U\cap V$ is simple enough that its homology is easy.
A worked example: the torus from two cylinders
Take $X=T^2$. Cover it by two open sets $U$ and $V$, each a thickened circle (a cylinder), so each deformation retracts \to $S^1$. Their intersection $U\cap V$ deformation retracts to two disjoint circles, so $U\cap V\simeq S^1\sqcup S^1$.
Now compute:
- $H_1(U)\cong \mathbb{Z}$, $H_1(V)\cong \mathbb{Z}$,
- $H_1(U\cap V)\cong \mathbb{Z}\oplus \mathbb{Z}$,
- $H_0(U\cap V)\cong \mathbb{Z}\oplus \mathbb{Z}$,
- $H_0(U)\cong H_0(V)\cong H_0(X)\cong \mathbb{Z}$.
The crucial map is $H_1(U\cap V)\to H_1(U)\oplus H_1(V)$. It comes from the two inclusions of each component circle into $U$ and $V$. One component maps as the generator in $U$ and the generator in $V$; the other component maps as the generator in $U$ and minus the generator in $V$, depending on orientation choices. Algebraically, the image has rank one, so the cokernel has rank one. Exactness then forces
Again, the invariant is forced by a small amount of glueing information.
How to use Mayer–Vietoris without getting lost
Most mistakes with Mayer–Vietoris come from not tracking the maps. A practical tactic is to focus on ranks first, then torsion, then map details.
- Start by computing the ranks of all known groups.
- Use exactness to bound the rank of the unknown group.
- Only then return to identify the map on generators if torsion or exact identification matters.
This is not laziness. It is exploiting the fact that exactness already imposes many constraints before you do any detailed algebra.
Strategy 3: Exact sequences from fibrations and covers
Many spaces come with a projection map $E\to B$ whose fibers are all the same up to homotopy. In such cases, the relationship between $E$, $B$, and a fiber $F$ is not an accident. It is a structural feature, and exact sequences express it.
A standard example is a covering space. If $\widetilde{X}\to X$ is a covering with discrete fiber, then $\pi_1(X)$ acts on the fiber, and the fundamental group controls the cover. Even without writing a long exact sequence, you use exactness-style logic:
- subgroup data corresponds to intermediate covers,
- normal subgroups correspond to regular covers,
- and the deck group is a quotient.
For genuine fibrations $F\to E\to B$, there is a long exact sequence in homotopy:
It is the homotopy analogue of the pair sequence, and it is the backbone of many classification results.
A worked example: $\pi_1$ and the circle bundle lesson
Suppose $S^1\to E\to B$ is a circle bundle. The long exact sequence begins:
Since $\pi_1(S^1)\cong \mathbb{Z}$, exactness says $\pi_1(E)$ is an extension of $\pi_1(B)$ by a quotient of $\mathbb{Z}$. That is already strong information, even before computing any characteristic class.
You learn an important habit here: in fibration problems, the exact sequence often tells you what $\pi_1(E)$ must look like as a group-theoretic object. Only after that should you chase the class that tells you which extension it is.
A practical “sequence choice” checklist
When you open a topology problem, you want to choose a sequence quickly and defensibly. The following questions are a reliable way to do it.
- Is the space naturally built by attaching cells \to a simpler subspace?
– Use the pair sequence (or cellular chains, which are the same idea in packaged form).
- Can you cover the space by two pieces whose overlap you understand?
– Use Mayer–Vietoris.
- Does the space come with a projection that looks locally like a product?
– Use the fibration or cover viewpoint and its exact sequence.
If more than one applies, choose the one where the maps are most concrete. In most computations, understanding the maps is the real work.
How to chase a long exact sequence without pain
Long exact sequences are long. The way to handle them is to treat them as short exact sequences on demand.
A useful technique is to isolate the three-term window you need:
and use exactness to translate into:
- $\operatorname{im}(f)=\ker(g)$,
- so $C\cong B/\operatorname{im}(f)$ when $g$ is surjective,
- and $\operatorname{im}(f)\cong B$ when $g=0$ and $f$ is surjective.
If you can recognize when a map is zero, injective, or surjective for geometric reasons, you can collapse large sections of the sequence immediately.
Common geometric reasons include:
- deformation retractions making induced maps isomorphisms,
- contractible pieces killing homology groups,
- connectivity forcing certain groups to vanish,
- degree computations for attaching maps,
- and naturality arguments showing a map factors through zero.
These are not separate tricks. They are the same idea: interpret algebraic properties of maps using geometry.
Exactness as a proof template, not only a computation tool
Exact sequences also power existence and nonexistence proofs.
- To show a group is nontrivial, show it must contain an image of a known nontrivial group.
- To show a map cannot exist, show it would force an induced map between groups that contradicts exactness or functoriality.
- To show an invariant is complete in a regime, show every obstruction appears as a kernel or cokernel in a controlling exact sequence.
Once you train your eye to see kernels and cokernels as “where the topology lives,” many arguments become routine.
The main habit to build
If you build one habit from this article, make it this:
- Do not ask “What is the group?” first.
- Ask “What is the sequence?” first.
Exact sequences are how algebraic topology remembers assembly instructions. If you can recover the assembly instructions, the invariants follow.
Books by Drew Higgins
Prophecy and Its Meaning for Today
New Testament Prophecies and Their Meaning for Today
A focused study of New Testament prophecy and why it still matters for believers now.
Leave a Reply