Motivation: The Problem with Union
Given sets A and B, the ordinary union A∪B loses information:
- If x∈A∩B, we cannot tell if x came from A, from B, or from both
- The size is ∣A∪B∣=∣A∣+∣B∣−∣A∩B∣, not simply ∣A∣+∣B∣
Definition of Disjoint Union
The disjoint union (also called coproduct or sum) of A and B is:
A+B=({0}×A)∪({1}×B)
Each element is “tagged” with its origin: 0 for elements from A, 1 for elements from B.
Alternative Notations
- A⨿B (amalgamation symbol)
- A⊔B
- A⊕B
Examples
Example 1
A={a,b}, B={b,c}.
- A∪B={a,b,c} (ordinary union, b appears once)
- A+B={(0,a),(0,b),(1,b),(1,c)} (disjoint union, b appears twice with different tags)
Example 2
A={1,2,3}, B={x,y}.
A+B={(0,1),(0,2),(0,3),(1,x),(1,y)}
Properties
Cardinality
∣A+B∣=∣A∣+∣B∣
This is the key advantage: the size adds without any correction.
Injective Maps
There are natural injection maps:
- ιA:A→A+B given by ιA(a)=(0,a)
- ιB:B→A+B given by ιB(b)=(1,b)
Universal Property
Given any set C and functions f:A→C, g:B→C, there is a unique function [f,g]:A+B→C such that:
[f,g]∘ιA=fand[f,g]∘ιB=g
Explicitly: [f,g](0,a)=f(a) and [f,g](1,b)=g(b).

Case Analysis
The disjoint union enables case analysis in proofs:
To define a function h:A+B→C, define:
- A function hA:A→C for the “left” case
- A function hB:B→C for the “right” case
Then h=[hA,hB].
n-ary Disjoint Union
For sets A1,…,An:
A1+A2+⋯+An={(i,a):i∈{1,…,n},a∈Ai}
Cardinality
∣∑i=1nAi∣=∑i=1n∣Ai∣
Product vs Sum
| Product × | Sum + |
|---|
| Pair (a,b) with both | Tagged (i,a) with one |
| $ | A \times B |
| Projection maps | Injection maps |
| Universal: maps out | Universal: maps in |
These are dual constructions in category theory.
Summary
- Disjoint union A+B tags elements to preserve origin
- ∣A+B∣=∣A∣+∣B∣ without intersection correction
- Natural injections ιA, ιB embed A, B into the sum
- Universal property: maps A+B→C correspond to pairs of maps A→C, B→C