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 moreDerived 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 ZeroThe Number ZeroCounting to FiveCounting to 10Counting to 20Counting a Set of Objects Up to 20Cardinality: The Last Number CountedMatching Numerals to QuantitiesSubitizing Small QuantitiesAddition Within 10Number Bonds to 10Addition Within 20Doubles and Near DoublesDoubles Facts Within 10Near Doubles Facts Within 20Mental Math Strategies for AdditionMental Math: Adding and Subtracting TensAddition Within 100Repeated Addition as MultiplicationMultiplication as Equal GroupsMultiplication: ArraysBasic Multiplication Facts (0s, 1s, 2s, 5s, 10s)Multiplication Facts Within 100Division as Equal SharingDivision as Grouping (Measurement Division)Division: Grouping (Repeated Subtraction) ModelDivision: Fair Sharing ModelDivision as Equal SharingDivision as GroupingBasic Division FactsDivision Facts Within 100Multiplication and Division Fact FamiliesRelationship Between Multiplication and DivisionDivision Facts as Inverse of MultiplicationRemainders and Quotients in DivisionDivision Word ProblemsMulti-Step Word ProblemsSolving Multi-Step Word ProblemsMultiplication Word ProblemsDivision Word ProblemsIntroduction to Long DivisionFactors and MultiplesPrime and Composite NumbersEquivalent FractionsRelating Fractions and DecimalsDecimal Place ValueIntegers and the Number LineComparing and Ordering IntegersAbsolute ValueAdding IntegersSubtracting IntegersMultiplying IntegersIntroduction to ExponentsOrder of OperationsInteger Order of OperationsVariable ExpressionsThe Distributive PropertyVariables and Expressions ReviewIntroduction to PolynomialsAdding and Subtracting PolynomialsMultiplying PolynomialsFactorialPermutationsCombinationsCounting Principles: Addition and Multiplication RulesIntroduction to Graph TheoryPropositional Logic FoundationsLogical EquivalencesSet Operations: Union, Intersection, and ComplementCartesian Products and RelationsPartial OrdersBinary RelationsEquivalence RelationsInjective, Surjective, and Bijective FunctionsCategories and MorphismsFunctorsCommutative Diagrams in Category TheoryCommutative Diagrams and CompositionNatural Transformations2-Categories and Weak FunctorsNatural Isomorphisms Between FunctorsIsomorphisms in CategoriesUniversal PropertiesInitial and Terminal ObjectsProducts and CoproductsEqualizers and CoequalizersLimits and ColimitsPullbacks and PushoutsAdjoint FunctorsFree ObjectsProjective Objects and Projective CoversHomological Dimension in CategoriesExact Sequences in CategoriesExt Functors as Derived HomTor Functors as Derived Tensor Product

Longest path: 95 steps · 560 total prerequisite topics

Prerequisites (4)

Leads To (1)