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

Tensor Products in Category Theory

Research Depth 87 in the knowledge graph ☐ I know this ☆ Set as goal
8topics build on this
442prerequisites beneath it
See this on the map →
Limits and ColimitsMonoidal Categories+2 more→→Monads in Category TheorySymmetric Monoidal Categories
tensor monoidal bilinear universal-property

Core Idea

The tensor product of two objects in a monoidal category is characterized by a universal property: Hom(A ⊗ B, C) ≅ Bilin(A × B, C), where Bilin denotes bilinear morphisms. Tensor products formalize the notion of free algebra on generators and are definable in any monoidal category. They carry monoidal structure from their factors and interact naturally with functors that preserve the monoidal structure.

How It's Best Learned

Begin with tensor products in abelian groups and vector spaces, verifying the bilinear universal property. Compute tensor products of finite abelian groups and polynomial rings. Study how tensor products interact with limits and colimits.

Common Misconceptions

Tensor product is not Cartesian product—it is right adjoint to hom in the appropriate monoidal category. Not every category admits a tensor product structure. Tensor products of categories (as opposed to objects within a monoidal category) follow different rules.

Explainer

You already know from your study of monoidal categories that a monoidal category (C, ⊗, I) has a bifunctor ⊗ playing the role of "multiplication" on objects. The tensor product of two objects A ⊗ B is an abstract construction defined not by what it is made of internally, but by how morphisms out of it behave. This is the universal property approach you encountered with limits and colimits: instead of defining A ⊗ B by construction, you characterize it by what it represents.

In the case of abelian groups, the tensor product A ⊗_ℤ B is the group that represents bilinear maps out of A × B. A bilinear map f: A × B → C is one that is a group homomorphism in each argument separately when the other is held fixed. The universal property says: there is a bilinear map φ: A × B → A ⊗ B such that every bilinear map f: A × B → C factors uniquely through φ as a group homomorphism A ⊗ B → C. In formula: Hom_Ab(A ⊗ B, C) ≅ Bilin(A × B, C), naturally in C. This is the defining adjunction. Elements of A ⊗ B are generated by simple tensors a ⊗ b, subject to bilinearity relations: (a + a') ⊗ b = a ⊗ b + a' ⊗ b, and a ⊗ (b + b') = a ⊗ b + a ⊗ b'. The tensor product is the quotient of the free abelian group on symbols a ⊗ b by these relations.

In a general monoidal category, the tensor product is simply the monoidal bifunctor ⊗ with whatever universal properties it satisfies in that context. In a symmetric monoidal category, there is also a natural isomorphism A ⊗ B ≅ B ⊗ A — the tensor product commutes up to isomorphism. In the category Vect_k of vector spaces over a field k, the tensor product V ⊗_k W has dimension dim(V) · dim(W) — the space of all formal linear combinations of simple tensors v ⊗ w, subject to bilinearity. The tensor product of two R-modules over a ring R is defined analogously, with the added constraint that r acts consistently on both factors: (v·r) ⊗ w = v ⊗ (r·w).

The interaction of tensor products with limits and colimits is subtle but important. Tensor product is right adjoint to the internal hom functor in closed monoidal categories: A ⊗ - is left adjoint to Hom(A, -). This adjunction generalizes the one in cartesian closed categories (where ⊗ is the categorical product). Because left adjoints preserve colimits, the tensor product distributes over colimits: A ⊗ (colim B_i) ≅ colim (A ⊗ B_i). In particular, A ⊗ - preserves coproducts and coequalizers. However, tensor product does not generally preserve limits — it fails to preserve products, and this failure is precisely captured by the Tor functor in homological algebra.

The failure of the tensor product to preserve exact sequences (specifically to preserve left-exactness) leads directly to derived functors. If 0 → A → B → C → 0 is a short exact sequence, applying M ⊗ - gives M ⊗ A → M ⊗ B → M ⊗ C → 0, which is right-exact but not generally left-exact. The kernel of M ⊗ A → M ⊗ B is measured by Tor_1(M, A) — the first derived functor of the tensor product. This is the bridge between tensor products and the homological algebra you have been building: the failure of tensor products to be exact is precisely what derived functors are designed to measure and control.

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 → Tensor Products in Category Theory

Longest path: 88 steps · 442 total prerequisite topics

Prerequisites (4)

Leads To (2)