Biproduct: Difference between revisions
No edit summary Tags: Mobile edit Mobile web edit |
formatting |
||
Line 7: | Line 7: | ||
Let '''C''' be a [[category (mathematics)|category]]. |
Let '''C''' be a [[category (mathematics)|category]]. |
||
Given a finite (possibly empty) collection of objects ''A''<sub>1</sub>,...,''A''<sub>''n''</sub> in '''C''', their ''biproduct'' is an object |
Given a finite (possibly empty) collection of objects ''A''<sub>1</sub>, ..., ''A''<sub>''n''</sub> in '''C''', their ''biproduct'' is an [[Object (category theory)|object]] <math display="inline">A_1 \oplus \dots \oplus A_n</math> in '''C''' together with [[Morphism|morphisms]] |
||
*''p''<sub>''k''</sub>: ''A''<sub>1</sub> ⊕ ··· ⊕ ''A''<sub>''n''</sub> → ''A''<sub>''k''</sub> in '''C''' (the ''projection morphisms'') |
|||
*<math display="inline">p_k \!: A_1 \oplus \dots \oplus A_n \to A_k</math> in '''C''' (the ''[[Projection (mathematics)|projection]] morphisms'') |
|||
*''i''<sub>''k''</sub>: ''A''<sub>''k''</sub> → ''A''<sub>1</sub> ⊕ ··· ⊕ ''A''<sub>''n''</sub> (the ''embedding morphisms'') |
|||
*<math display="inline">i_k \!: A_k \to A_1 \oplus \dots \oplus A_n</math> (the ''[[embedding]] morphisms'') |
|||
and such that |
and such that |
||
* |
*<math display="inline">\left( A_1 \oplus \dots \oplus A_n, p_k \right)</math> is a [[product (category theory)|product]] for the <math display="inline">A_k,</math> and |
||
* |
*<math display="inline">\left( A_1 \oplus \dots \oplus A_n, i_k \right)</math> is a [[coproduct]] for the <math display="inline">A_k.</math> |
||
An empty, or [[nullary]], product is always a [[terminal object]] in the category, and the empty coproduct is always an [[initial object]] in the category. Thus an empty, or [[nullary]], biproduct is always a [[zero object]]. |
An empty, or [[nullary]], product is always a [[terminal object]] in the category, and the empty coproduct is always an [[initial object]] in the category. Thus an empty, or [[nullary]], biproduct is always a [[zero object]]. |
||
Line 32: | Line 33: | ||
==Properties== |
==Properties== |
||
If the biproduct |
If the biproduct <math display="inline">A \oplus B</math> exists for all pairs of objects ''A'' and ''B'' in the category '''C''', then all finite biproducts exist, making '''C''' both a [[Cartesian closed category]] and a co-Cartesian closed category. |
||
⚫ | |||
*<math>p_k \circ f \circ i_k = 1_{A_k} </math> |
|||
*<math>p_l \circ f \circ i_k = 0 </math> for <math display="inline">k \neq l.</math> |
|||
⚫ | |||
⚫ | |||
*<math>p_k \circ i_k = 1_{A_k} </math> |
|||
⚫ | |||
*<math>p_l \circ i_k = 0 </math> for <math display="inline">k \neq l.</math> |
|||
*''p''<sub>''k''</sub> ∘ ''f'' ∘ ''i''<sub>k</sub> = 1<sub>''A''<sub>k</sub></sub> |
|||
*''p''<sub>''l''</sub> ∘ ''f'' ∘ ''i''<sub>k</sub> = 0 for ''k'' ≠ ''l''. |
|||
⚫ | |||
To see that <math display="inline">A_1 \times A_2</math> is now also a coproduct, and hence a biproduct, suppose we have morphisms <math display="inline">f_k: A_k \to X</math> for some object <math display="inline">X</math>. Define <math display="inline">f := f_1 \circ p_1 + f_2 \circ p_2.</math> Then <math display="inline">f: A_1 \times A_2 \to X</math> is a morphism and <math display="inline">f \circ i_k = f_k</math>. |
|||
⚫ | If '''C''' is a [[preadditive category]], then every finite product is a biproduct, and every finite coproduct is a biproduct. For example, if |
||
*''p''<sub>k</sub> ∘ ''i''<sub>k</sub> = 1<sub>''A''<sub>k</sub></sub> |
|||
*''p''<sub>l</sub> ∘ ''i''<sub>k</sub> = 0 for ''k'' ≠ ''l''. |
|||
To see that ''A''<sub>1</sub> × ''A''<sub>2</sub> is now also a coproduct, and hence a biproduct, suppose we have morphisms ''f''<sub>k</sub>: ''A''<sub>k</sub> → ''X'' for some object ''X''. Define ''f'' := ''f''<sub>1</sub> ∘ ''p''<sub>1</sub> + ''f''<sub>2</sub> ∘ ''p''<sub>2</sub>. Then ''f'': ''A''<sub>1</sub> × ''A''<sub>2</sub> → ''X'' is a morphism and ''f'' ∘ ''i''<sub>k</sub> = ''f''<sub>k</sub>. |
|||
Note also that in this case we always have |
Note also that in this case we always have |
||
*<math display="inline">i_1 \circ p_1 + i_2 \circ p_2 = 1_{A_1 \times A_2}.</math> |
|||
*''i''<sub>1</sub> ∘ ''p''<sub>1</sub> + ''i''<sub>2</sub> ∘ ''p''<sub>2</sub> = 1<sub>''A''<sub>1</sub> × ''A''<sub>2</sub></sub>. |
|||
An [[additive category]] is a preadditive category in which all finite biproduct exist. In particular, biproducts always exist in [[abelian categories]]. |
An [[additive category]] is a [[preadditive category]] in which all finite biproduct exist. In particular, biproducts always exist in [[abelian categories]]. |
||
==References== |
==References== |
Revision as of 20:35, 12 November 2018
In category theory and its applications to mathematics, a biproduct of a finite collection of objects, in a category with zero objects, is both a product and a coproduct. In a preadditive category the notions of product and coproduct coincide for finite collections of objects.[1] The biproduct is a generalization of finite direct sums of modules.
Definition
Let C be a category.
Given a finite (possibly empty) collection of objects A1, ..., An in C, their biproduct is an object in C together with morphisms
- in C (the projection morphisms)
- (the embedding morphisms)
and such that
An empty, or nullary, product is always a terminal object in the category, and the empty coproduct is always an initial object in the category. Thus an empty, or nullary, biproduct is always a zero object.
Examples
In the category of abelian groups, biproducts always exist and are given by the direct sum.[2] Note that the zero object is the trivial group.
Similarly, biproducts exist in the category of vector spaces over a field. The biproduct is again the direct sum, and the zero object is the trivial vector space.
More generally, biproducts exist in the category of modules over a ring.
On the other hand, biproducts do not exist in the category of groups.[3] Here, the product is the direct product, but the coproduct is the free product.
Also, biproducts do not exist in the category of sets. For, the product is given by the Cartesian product, whereas the coproduct is given by the disjoint union. Note also that this category does not have a zero object.
Block matrix algebra relies upon biproducts in categories of matrices.[4]
Properties
If the biproduct exists for all pairs of objects A and B in the category C, then all finite biproducts exist, making C both a Cartesian closed category and a co-Cartesian closed category.
If the product and coproduct both exist for some pair of objects Ai, then there is a unique morphism such that
- for
It follows that the biproduct exists if and only if f is an isomorphism.
If C is a preadditive category, then every finite product is a biproduct, and every finite coproduct is a biproduct. For example, if exists, then there are unique morphisms such that
- for
To see that is now also a coproduct, and hence a biproduct, suppose we have morphisms for some object . Define Then is a morphism and .
Note also that in this case we always have
An additive category is a preadditive category in which all finite biproduct exist. In particular, biproducts always exist in abelian categories.
References
- ^ Borceux, 4-5
- ^ Borceux, 8
- ^ Borceux, 7
- ^ H.D. Macedo, J.N. Oliveira, Typing linear algebra: A biproduct-oriented approach, Science of Computer Programming, Volume 78, Issue 11, 1 November 2013, Pages 2160-2191, ISSN 0167-6423, doi:10.1016/j.scico.2012.07.012.
- Borceux, Francis (2008). Handbook of Categorical Algebra. Cambridge University Press. ISBN 978-0-521-06122-3.