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

Tor Functors as Derived Tensor Product

Research Depth 94 in the knowledge graph ☐ I know this ☆ Set as goal
8topics build on this
560prerequisites beneath it
See this on the map →
Exact Sequences in CategoriesProjective Objects and Projective Covers+2 more→→Derived Functors
derived-functors homological-algebra tensor-products

Core Idea

The Tor functor Tor_n(A, B) is the n-th left derived functor of − ⊗ B, computed via a projective resolution of A. Tor_1(A, B) measures the failure of A ⊗ − to be exact, capturing torsion phenomena. Higher Tor groups measure higher-order non-exactness. Tor is dual to Ext and crucial in computing tensor products of complexes and understanding flatness.

Explainer

From exact sequences, you know what it means for a functor to be exact: it preserves the exactness of short exact sequences 0 → A' → A → A'' → 0. The tensor product − ⊗ B is right-exact: a short exact sequence 0 → A' → A → A'' → 0 yields A' ⊗ B → A ⊗ B → A'' ⊗ B → 0, with the zero on the right preserved. But the map A' ⊗ B → A ⊗ B may fail to be injective — left-exactness can break. The Tor functors are the derived functors that measure precisely how and how much it breaks.

The construction uses projective resolutions. For a module A, take a projective resolution: a long exact sequence ... → P₂ → P₁ → P₀ → A → 0 where each Pᵢ is projective (you know projective modules: they are the modules for which Hom(P, −) is exact, equivalently the direct summands of free modules). Remove A from the sequence. Tensor the remaining complex with B to get ... → P₂⊗B → P₁⊗B → P₀⊗B → 0. This tensored complex is generally no longer exact. Take its homology: Tor_n(A, B) = Hₙ(P_• ⊗ B). A key theorem establishes that this is independent of the choice of projective resolution, so Tor_n is well-defined.

The lowest cases give the most intuition. Tor_0(A, B) = A ⊗ B: the zeroth homology just recovers the original tensor product. Tor_1(A, B) is the most geometrically meaningful and gives Tor its name. For cyclic groups: Tor_1(ℤ/mℤ, ℤ/nℤ) ≅ ℤ/gcd(m,n)ℤ. This captures torsion interaction: two cyclic groups have non-trivial Tor₁ exactly when their orders share a common factor. The torsion in A interacts with the torsion in B in a way that is invisible to the tensor product itself (ℤ/mℤ ⊗ ℤ/nℤ ≅ ℤ/gcd(m,n)ℤ as well, but the information about the failure of exactness in the resolution is what Tor records at higher levels).

The flatness connection ties Tor back to module theory: A is flat if and only if Tor_n(A, B) = 0 for all n ≥ 1 and all B. Flat modules are precisely those for which tensoring preserves exact sequences — they are the "good" modules for tensor products, analogous to projective modules for Hom. Free modules are flat, projective modules are flat, but flatness is a strictly weaker condition (every projective is flat, but not conversely). In algebraic geometry, the fibers of a flat morphism vary "continuously" — Tor vanishing is the algebraic condition ensuring this geometric regularity. Higher Tor groups also appear in the Künneth formula for computing homology of product spaces, where Tor_1 terms correct for the non-exactness that can arise when the chain groups have torsion. Tor is, alongside Ext, one of the two fundamental invariants of homological algebra.

Practice Questions 5 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 → Cartesian Products and Relations → Partial Orders → Binary Relations → Equivalence Relations → Injective, Surjective, and Bijective Functions → Categories and Morphisms → Functors → Commutative Diagrams in Category Theory → Commutative Diagrams and Composition → Natural Transformations → 2-Categories and Weak Functors → Natural Isomorphisms Between Functors → Isomorphisms in Categories → Universal Properties → Initial and Terminal Objects → Products and Coproducts → Equalizers and Coequalizers → Limits and Colimits → Pullbacks and Pushouts → Adjoint Functors → Free Objects → Projective Objects and Projective Covers → Homological Dimension in Categories → Exact Sequences in Categories → Ext Functors as Derived Hom → Tor Functors as Derived Tensor Product

Longest path: 95 steps · 560 total prerequisite topics

Prerequisites (4)

Leads To (1)