A combinatorial formula giving the cardinality of a finite union of sets as an alternating sum of the sizes of all nonempty intersections of those sets.

Principle

Count the union by alternately adding and subtracting sizes of intersections so that overcounts from overlaps are corrected exactly.

Demonstration

For two sets A and B, |A ∪ B| = |A| + |B| − |A ∩ B|; for three sets A,B,C, |A ∪ B ∪ C| = |A|+|B|+|C| − |A∩B|−|A∩C|−|B∩C| + |A∩B∩C|.

Misapplication

Applying the finite inclusion–exclusion formula to infinite families without convergence analysis, or summing only pairwise intersections when higher-order overlaps are nonempty, producing incorrect counts.

Consequence

When applied correctly to a finite family, it yields an exact count of distinct elements in the union and enables principled probability calculations for unions of events.

Reversal

Möbius inversion on the Boolean lattice inverts the inclusion–exclusion relation, expressing intersection sizes from union counts or vice versa.

Boundary

Requires a finite number of sets or control of infinite alternating series; excludes naive use on uncountable measure spaces without measure-theoretic justification.

Semantic Tension

Competes with simpler heuristics (e.g., treating overlaps as negligible) or with inclusion via indicator functions and linearity of expectation; the tension is between exact alternating correction and approximate or probabilistic methods.

Synthesis

Inclusion–exclusion is the exact combinatorial mechanism that corrects overcounting by alternating contributions from all intersections; it is the discrete counterpart of Möbius inversion on the lattice of subsets.