In the category Set, the product A × B is the Cartesian product and the coproduct A ⊔ B is the disjoint union — these are different objects. What additional structure does an additive category provide that forces them to coincide as a biproduct?
AA distinguished isomorphism between every product and every coproduct, imposed as an axiom
BHom-sets that are abelian groups, a zero object, and composition that distributes over addition — allowing zero morphisms to construct each universal property from the other
CA functor from products to coproducts that is naturally isomorphic to the identity
DThe requirement that all objects are finite, so products and coproducts are automatically the same size
The additive structure is the key. In an additive category, every hom-set Hom(X,Y) is an abelian group (so morphisms can be added), there is a zero object (providing zero morphisms in every hom-set), and composition distributes over addition. Given a product A × B with projections, you can construct the coproduct injection ι₁: A → A × B by combining id_A with the zero map to B's factor — this requires the zero morphism, which only exists because of the zero object. Conversely, given injections you reconstruct projections. In Set, you have none of this: no meaningful way to add functions or form zero maps, so the construction fails and product ≠ coproduct.
Question 2 Multiple Choice
The identity morphism on a biproduct A ⊕ B satisfies id_{A⊕B} = ι₁π₁ + ι₂π₂. What is the significance of the '+' in this equation?
AIt is informal notation for composition; in categorical terms it means first apply one then the other
BIt requires the additive structure of an additive category — without abelian hom-sets, the sum of two morphisms is undefined, so this identity cannot be stated
CIt means the two morphisms are parallel and the biproduct chooses between them depending on the input
DIt is the coproduct of the two morphisms in the arrow category
The identity decomposition ι₁π₁ + ι₂π₂ = id_{A⊕B} literally requires morphism addition, which only exists because hom-sets in an additive category are abelian groups. ι₁π₁ and ι₂π₂ are two morphisms from A⊕B to itself; their sum (in the abelian group structure on that hom-set) must equal the identity. This equation is precisely what fails in Set: you cannot add the 'project to A then inject back' function with the 'project to B then inject back' function — there is no addition of Set-functions that gives identity on the disjoint union. The additive structure is not auxiliary machinery; it is the reason biproducts exist.
Question 3 True / False
In an additive category, every product of two objects is also a coproduct of those same objects.
TTrue
FFalse
Answer: True
This is the defining property of biproducts. In an additive category, the additive structure (abelian hom-sets, zero object) allows the construction of coproduct injections from product projections and vice versa, making every product automatically a coproduct and vice versa. The coincidence is not assumed — it is derived from the additive axioms. This is why the biproduct notation A ⊕ B is justified: a single object serves both roles simultaneously, equipped with both projections and injections satisfying the biproduct identities.
Question 4 True / False
Most category that has both products and coproducts necessarily has biproducts, since biproducts are just products and coproducts that happen to coincide.
TTrue
FFalse
Answer: False
This is the central misconception identified in the topic. The category Set has both products (Cartesian product) and coproducts (disjoint union), but they do not coincide and Set has no biproducts. Biproducts require not just the existence of products and coproducts, but the additive structure (abelian hom-sets, zero object, composition distributing over addition) that forces them to coincide. The coincidence is a theorem about additive categories, not a consequence of merely having both constructions separately.
Question 5 Short Answer
Why does the existence of biproducts in a category explain why composition of linear maps corresponds to matrix multiplication?
Think about your answer, then reveal below.
Model answer: In an additive category with biproducts, any morphism f: A⊕B → C⊕D can be written as a 2×2 matrix of component morphisms [[f₁₁, f₁₂], [f₂₁, f₂₂]] where fᵢⱼ = πᵢ ∘ f ∘ ιⱼ. When you compose two such morphisms (matrices), the calculation of each component of the composite involves summing terms across an intermediate index — which is exactly the formula for matrix multiplication. This is not a coincidence imposed by notation: the composition law in the category, applied to morphisms expressed via biproduct decompositions, produces the matrix multiplication formula as a theorem. Vec_k (vector spaces over a field) is an additive category with biproducts equal to direct sums, so linear maps between direct sums are matrices, and composition of linear maps is matrix multiplication — categorical composition law realized concretely.
The matrix calculus of linear algebra is thus a manifestation of categorical structure: biproducts provide the decomposition, the additive structure provides the ability to sum component contributions, and composition provides the product formula. This insight extends immediately to modules over a ring, explaining why module homomorphisms between direct sums also form matrices.