Biproducts of complete join-semilattices 2026-10-05
In the category of complete join-semilattices, hom-sets have pointwise join as addition and the constant-bottom map as zero, making it a semi-additive category. For any family , the cartesian product with coordinatewise joins is also its coproduct. The injections put an element in one coordinate and bottom in all others. A family of maps extends uniquely by , since each tuple is the join of its coordinate injections. Thus all set-indexed canonical product-coproduct comparisons are invertible. The two-element chain has distinct identity and zero morphisms, so this category is not trivial and not additive.
Past exam of the mathematics course of the University of Cambridge 2018 iii Paper 119 6 iii Solution Created 2026-10-03 Updated 2026-10-05
In the category of complete join-semilattices, define addition of arrows pointwise byand let the zero arrow be the constant-bottom map. These form commutative monoids. Pointwise join of join-preserving maps again preserves all joins, including the empty join, and composition is additive in each variable. Thus the category has the required semi-additive enrichment.
For an arbitrary set-indexed family , the product poset , with coordinatewise joins, is the product in a category. Define by putting an element in coordinate and bottom in all others. Given join-preserving , defineThis preserves arbitrary joins by interchanging the two joins, and . It is unique because every tuple is . Therefore is also the coproduct in a category with these injections, and its canonical coproduct-to-product map is the identity. This proves the biproducts of complete join-semilattices property, even for arbitrary set-indexed families, and in particular makes this a semi-additive category with the hypotheses of part (ii).
The two-element chain has distinct identity and constant-bottom endomorphisms, so the category is not equivalent to . Its addition is idempotent rather than cancellative; for example itself supplies an absorbing endomorphism. Hence