A topic in the Open Knowledge Graph — a free, open map of 15,290 topics and the order to learn them in.

The Kunneth Formula

Research Depth 108 in the knowledge graph ☐ I know this ☆ Set as goal
481prerequisites beneath it
See this on the map →
Exact Sequences in Homological AlgebraSingular Homology Groups+3 more→
algebraic-topology kunneth-formula tensor-product product-spaces homology

Core Idea

The Kunneth formula computes the homology of a product space X x Y from the homology groups of the factors. Over a field k, it simplifies to H_n(X x Y; k) = direct sum_{p+q=n} H_p(X; k) tensor H_q(Y; k). Over the integers, there is a correction term involving Tor: 0 -> direct sum H_p(X) tensor H_q(Y) -> H_n(X x Y) -> direct sum Tor(H_p(X), H_{q-1}(Y)) -> 0. The Kunneth formula is the product theorem for homology, reducing the computation of H_*(X x Y) to the known homology of X and Y.

Explainer

The Kunneth formula answers the natural question: if we know H_*(X) and H_*(Y), can we compute H_*(X x Y)? The answer is yes, with a tensor product playing the central role. At the chain level, the Eilenberg-Zilber theorem provides a chain homotopy equivalence between C_*(X x Y) and the tensor product complex C_*(X) tensor C_*(Y), whose n-th chain group is the direct sum over p + q = n of C_p(X) tensor C_q(Y). This chain-level equivalence reduces the computation of H_*(X x Y) to an algebraic question about the homology of a tensor product of chain complexes.

Over a field k, the Kunneth formula is clean: H_n(X x Y; k) = direct sum_{p+q=n} H_p(X; k) tensor_k H_q(Y; k). This is an isomorphism, with no correction terms. The Betti numbers satisfy b_n(X x Y) = sum_{p+q=n} b_p(X) * b_q(Y), which is the "convolution" of the Betti number sequences. For the torus: b_0(T2) = b_0(S1) * b_0(S1) = 1, b_1(T2) = b_0 * b_1 + b_1 * b_0 = 1 + 1 = 2, b_2(T2) = b_1 * b_1 = 1.

Over the integers, the formula acquires a correction term from the Tor functor. The Kunneth short exact sequence is: 0 -> direct sum_{p+q=n} H_p(X) tensor H_q(Y) -> H_n(X x Y) -> direct sum_{p+q=n-1} Tor(H_p(X), H_q(Y)) -> 0. This sequence always splits (non-naturally), so as abelian groups, H_n(X x Y) = (direct sum H_p tensor H_q) direct sum (direct sum Tor(H_p, H_q)), where the first sum is over p + q = n and the second over p + q = n - 1. The Tor term detects interactions between the torsion in H_*(X) and H_*(Y). When both spaces have torsion-free homology, Tor vanishes and the formula simplifies to the tensor product alone.

The Tor functor Tor(A, B) measures the "failure of the tensor product to be exact." For finitely generated abelian groups: Tor(Z, B) = 0 (free groups contribute no Tor), Tor(Z/mZ, Z/nZ) = Z/gcd(m,n)Z (cyclic torsion groups interact via their gcd). So the Tor term contributes torsion to H_*(X x Y) that is not visible in the individual homology groups of X and Y separately. For example, Tor(Z/2Z, Z/2Z) = Z/2Z, so if both X and Y have Z/2Z torsion in adjacent dimensions, additional Z/2Z torsion appears in the product homology.

The Kunneth formula is the product theorem for homology, just as the Mayer-Vietoris sequence is the union theorem. Together with the long exact sequence of a pair (the quotient/subspace theorem), these three results form a complete toolkit for computing homology: any space built from simpler pieces by products, unions, and quotients can have its homology computed by iterating these tools. The cohomological version of the Kunneth formula is enriched by the cup product: H^*(X x Y; k) is isomorphic to H^*(X; k) tensor H^*(Y; k) as graded rings, where the product on the right is the tensor product of rings. This algebraic structure is essential for computing cup products on product spaces.

Practice Questions 4 questions

Prerequisite Chain

Understanding Zero → The Number Zero → Counting to Five → Counting to 10 → Counting to 20 → Counting a Set of Objects Up to 20 → Cardinality: The Last Number Counted → Matching Numerals to Quantities → Subitizing Small Quantities → Addition Within 10 → Number Bonds to 10 → Addition Within 20 → Doubles and Near Doubles → Doubles Facts Within 10 → Near Doubles Facts Within 20 → Mental Math Strategies for Addition → Mental Math: Adding and Subtracting Tens → Addition Within 100 → Repeated Addition as Multiplication → Multiplication as Equal Groups → Multiplication: Arrays → Basic Multiplication Facts (0s, 1s, 2s, 5s, 10s) → Multiplication Facts Within 100 → Division as Equal Sharing → Division as Grouping (Measurement Division) → Division: Grouping (Repeated Subtraction) Model → Division: Fair Sharing Model → Division as Equal Sharing → Division as Grouping → Basic Division Facts → Division Facts Within 100 → Multiplication and Division Fact Families → Relationship Between Multiplication and Division → Division Facts as Inverse of Multiplication → Remainders and Quotients in Division → Division Word Problems → Multi-Step Word Problems → Solving Multi-Step Word Problems → Multiplication Word Problems → Division Word Problems → Introduction to Long Division → Factors and Multiples → Prime and Composite Numbers → Equivalent Fractions → Relating Fractions and Decimals → Decimal Place Value → Integers and the Number Line → Comparing and Ordering Integers → Absolute Value → Adding Integers → Subtracting Integers → Multiplying Integers → Introduction to Exponents → Order of Operations → Integer Order of Operations → Variable Expressions → The Distributive Property → Variables and Expressions Review → Introduction to Polynomials → Adding and Subtracting Polynomials → Multiplying Polynomials → Factorial → Permutations → Combinations → Counting Principles: Addition and Multiplication Rules → Introduction to Graph Theory → Propositional Logic Foundations → Logical Equivalences → Set Operations: Union, Intersection, and Complement → Proof by Cases → Proving by Cases and Exhaustion → Vacuous Truth and Trivial Cases → Proof by Cases (Proof by Exhaustion) → Mathematical Induction → Binary Operations and Algebraic Structures → Group Definition and Examples → Basic Properties of Groups → Group Homomorphisms → Group Isomorphisms → Cayley's Theorem → Cosets and Lagrange's Theorem → Normal Subgroups → Quotient Groups → First Isomorphism Theorem for Groups → First Isomorphism Theorem for Rings → First Isomorphism Theorem for Groups → Third Isomorphism Theorem for Groups → First Isomorphism Theorem for Rings → Integral Domains → Principal Ideal Domains → Unique Factorization Domains → Polynomial Rings → Field Extensions → Algebraic and Transcendental Elements → Splitting Fields → Finite Fields → Galois Groups → Fundamental Theorem of Galois Theory → Second Isomorphism Theorem for Groups → Direct Products of Groups → Classification of Finite Abelian Groups → Chain Complexes and the Boundary Operator → Simplicial Homology Groups → Singular Homology Groups → Homology with Coefficients → Cochain Complexes and Cohomology → Singular Cohomology → The Universal Coefficient Theorem → The Kunneth Formula

Longest path: 109 steps · 481 total prerequisite topics

Prerequisites (5)

Leads To (0)

No topics depend on this one yet.