The Cup Product

Research Depth 32 in the knowledge graph I know this Set as goal
Unlocks 1 downstream topic
algebraic-topology cup-product cohomology-ring multiplicative-structure

Core Idea

The cup product is a bilinear operation H^p(X; R) x H^q(X; R) -> H^{p+q}(X; R) that gives the cohomology groups the structure of a graded ring. Defined at the cochain level by (f cup g)(sigma) = f(front p-face of sigma) * g(back q-face of sigma), the cup product is associative, has an identity (the class in H^0), and satisfies graded commutativity: alpha cup beta = (-1)^{pq} beta cup alpha. The resulting cohomology ring H^*(X; R) is a strictly finer topological invariant than the individual cohomology groups and distinguishes spaces that homology alone cannot.

Explainer

The cup product gives cohomology a multiplicative structure that transforms H^*(X; R) = direct sum H^n(X; R) from a sequence of abelian groups into a graded ring. At the cochain level, for f in C^p(X; R) and g in C^q(X; R), the cup product f cup g in C^{p+q}(X; R) is defined on a singular (p+q)-simplex sigma : Delta^{p+q} -> X by (f cup g)(sigma) = f(sigma|_{[v_0, ..., v_p]}) * g(sigma|_{[v_p, ..., v_{p+q}]}). Here sigma|_{[v_0, ..., v_p]} is the front p-face (restriction to the first p+1 vertices) and sigma|_{[v_p, ..., v_{p+q}]} is the back q-face (restriction to the last q+1 vertices). The product of the values in R uses the ring multiplication.

The cup product descends to cohomology because of the Leibniz rule (also called the derivation property): d(f cup g) = (df) cup g + (-1)^p f cup (dg). This formula implies that the cup product of two cocycles is a cocycle, and that the cup product of a cocycle with a coboundary (or vice versa) is a coboundary. Therefore the operation [f] cup [g] = [f cup g] is well-defined on cohomology classes and is independent of the choice of cocycle representatives. The resulting operation H^p(X; R) x H^q(X; R) -> H^{p+q}(X; R) is bilinear, associative, and has a two-sided identity (the class 1 in H^0(X; R) = R for connected X).

A crucial property is graded commutativity: for alpha in H^p and beta in H^q, we have alpha cup beta = (-1)^{pq} beta cup alpha. When both p and q are even, the product commutes. When both are odd, it anti-commutes. This is proved at the cochain level using chain homotopies that relate the front-face/back-face decomposition to its reverse. Graded commutativity has important consequences: if alpha in H^p with p odd, then alpha cup alpha = -alpha cup alpha, so 2(alpha cup alpha) = 0. Over Z, this means alpha^2 is 2-torsion (or zero). Over Z/2Z, the distinction between commutativity and anti-commutativity disappears, which is why mod-2 cohomology is often technically simpler.

The cup product is natural with respect to continuous maps: for f : X -> Y, we have f*(alpha cup beta) = f*(alpha) cup f*(beta). This means f* : H^*(Y; R) -> H^*(X; R) is a ring homomorphism. This is a significant strengthening of functoriality: not only does f induce a group homomorphism in each degree, it preserves the entire multiplicative structure. The ring homomorphism property is the reason the cup product is such a powerful invariant — it provides additional constraints that any continuous map must satisfy.

The power of the cup product as a topological invariant is illustrated by the standard example of CP^2 versus S^2 wedge S^4. Both spaces have identical cohomology groups (Z in degrees 0, 2, and 4; zero elsewhere). But the cohomology ring of CP^2 is Z[alpha]/(alpha^3), where alpha in H^2 is a generator and alpha^2 is the nonzero generator of H^4. The cohomology ring of S^2 wedge S^4 is Z[beta, gamma]/(beta^2, beta*gamma, gamma^2), where beta in H^2 and gamma in H^4 are generators and all products of positive-degree elements vanish. These rings are not isomorphic: in one, the degree-4 generator is a square of the degree-2 generator; in the other, it is independent. This algebraic difference reflects a genuine topological difference and cannot be detected by any invariant that looks only at individual homology groups.

Practice Questions 4 questions

Prerequisite Chain

Longest path: 33 steps · 117 total prerequisite topics

Prerequisites (2)

Leads To (1)