Inclusion-Exclusion Calculator: Drag |A|, |B|, |A ∩ B| and Watch |A ∪ B| Update

The two-set inclusion-exclusion formula

is the sort of identity that looks trivial once you have seen the Venn diagram and mysterious if you have not. Students learn it by copying, apply it robotically, and then get blindsided by a problem where the overlap is zero (or where it equals one of the sets outright). The fix is to turn the formula into a live object — one you can poke. Change one input and watch two other quantities change. After a minute of dragging, the subtraction stops being a memorised rule and starts being the only arithmetic that can possibly be correct.

The live calculator

Drag the three coloured dots below. The top dot controls |A|, the middle dot controls |B|, and the bottom dot controls |A \cap B|. The formula line at the top updates in real time.

What to notice while dragging

Three boundary cases are worth feeling, not just reading.

Disjoint sets. Drag |A \cap B| all the way to 0. The formula reduces to |A \cup B| = |A| + |B|. This is the everyday intuition — "two groups of students, no overlap, total is the sum." It is a special case, not the general rule. The moment any student is in both groups, addition over-counts.

Why: when A and B share no elements, each element of the union lives in exactly one of the two sets. Summing |A| and |B| visits each union-element exactly once, so no correction is needed.

One set inside the other. Set |A| = 10 and |B| = 6, then drag |A \cap B| up to 6. The readout shows |A \cup B| = 10. Why? Because B has slipped entirely inside A, so their union is just A. The formula gives 10 + 6 - 6 = 10, which matches. The subtraction has exactly cancelled the extra |B|.

Why: if every element of B is also in A, then A \cap B = B, so |A \cap B| = |B|, and the formula telescopes to |A \cup B| = |A|.

Impossible overlap. Try to drag |A \cap B| above \min(|A|, |B|). On paper, people sometimes write |A \cap B| = 12 while |A| = 10 and not notice. The Venn diagram forbids it — the intersection cannot be larger than either set, because the overlap is a subset of each. Whenever a competition problem lets you compute |A \cap B| from other data and the answer exceeds |A| or |B|, you have made an arithmetic error.

Reading the formula as a correction

The cleanest mental model is add-then-correct.

1. Add. Sum |A| + |B| as if the two sets were disjoint. This counts every union-element at least once, but it double-counts every element that is in both.
2. Correct. The elements in the overlap were counted twice — once inside |A| and once inside |B|. Subtracting |A \cap B| once removes one of the two counts, leaving exactly one.

Net effect: every element of A \cup B is counted exactly once. The formula is not a magic identity; it is a counting audit.

Three bounds every answer must satisfy

The calculator enforces these silently, but writing them down is useful for spotting bad exam answers.

• |A \cup B| \ge \max(|A|, |B|) — the union contains each set, so it is at least as big as the larger one.
• |A \cup B| \le |A| + |B| — no element is counted more than twice in the sum, so subtracting a non-negative overlap can't push the total above the sum.
• |A \cap B| \le \min(|A|, |B|) — the intersection is contained in each set, so it is at most as small as the smaller one.

If an answer breaks any of these, the arithmetic is wrong somewhere upstream — recheck the givens before moving on.

Related: Set Operations · Three-Set Venn Diagram · Venn Diagrams from Scratch · Cardinality Meter · Sets — Introduction