Set Operations, Explained

After reading this you can compute the union, intersection, both differences, the symmetric difference and the power set of two sets, and you will know how to read each result without confusing "and" with "or".

A set is a collection of distinct items with no order. The set {1, 2, 3, 4} is the same as {4, 3, 2, 1}, and writing 2 twice changes nothing: {2, 2, 3} is just {2, 3}. Set operations combine two collections in the four standard ways, and each one answers a different plain-language question about membership.

Here is the hook. Take A = {1, 2, 3, 4} and B = {3, 4, 5, 6}. The union has 6 elements, the intersection has 2, and the two differences have 2 elements each. Six numbers, four answers, no overlap in what they mean. The rest of this article shows how those counts arise and how to interpret them.

What each operation means

There are four core operations plus the power set. Each is defined by a membership rule, so you decide whether an element belongs by answering a yes or no question.

Union A \cup B

Everything in A, or in B, or in both. The "or" here is inclusive.

Intersection A \cap B

Only the elements that are in both A and B at the same time.

Difference A \setminus B

Elements in A that are not in B. Order matters: A \setminus B and B \setminus A are usually different.

Symmetric difference A \triangle B

Elements in exactly one of the two sets, never in both. This is the "or, but not both" case, the exclusive or.

Power set \mathcal{P}(A)

The set of all subsets of A, including the empty set and A itself.

When to use this, and when not

Reach for set operations when you have two lists and you care about membership, not counts or order. Which customers appear in both mailing lists? That is intersection. Which items are in the new inventory but were not in the old one? That is a difference. Which tags belong to exactly one of two articles? That is symmetric difference.

Do not use a set when duplicates carry information. If you are tracking how many times each value occurs, a set will collapse the repeats and lose the counts. A list of the numbers 3, 3, 3, 5 becomes the set {3, 5}, and the fact that 3 appeared three times is gone. For frequency work you want a tally or a multiset, not a set.

Order is also discarded. If sequence matters, for example the steps of a route, a set is the wrong container.

The formulas and the intuition

The four core operations are defined by membership conditions on an element x.

Read this as: x is in the union exactly when x is in A or in B. An element counted once, even if it sits in both sets.

Here x must pass both tests. If either fails, x is out.

x \in A means x is an element of A, and x \notin B means x is not an element of B. Swap the letters and you get the other difference.

The sizes are linked by one identity worth memorizing. Let |A| denote the number of elements in A.

You subtract the intersection because elements in both sets would otherwise be counted twice. This is inclusion-exclusion for two sets. Check it against the hook: 4 + 4 - 2 = 6, which matches the union size.

The power set has a fixed size that depends only on how many elements the set has.

Each element is either in a given subset or not, two choices per element, multiplied across all elements. A set of 4 elements has 2^4 = 16 subsets. A set of 10 has 1024. This growth is why the power set is only practical for small sets.

Worked example with the demo data

Reading the results

Every output is itself a set, so treat it as unordered and duplicate-free. Three checks help you trust a result quickly.

First, the union size can never exceed |A| + |B| and can never be less than the larger of the two sizes. Here that is between 4 and 8, and 6 fits. Second, the intersection is a subset of both sets, so its size can never exceed the smaller input, here min(4, 4) = 4, and 2 fits. Third, the two differences and the intersection partition each input: |A \setminus B| + |A \cap B| = |A|, and indeed 2 + 2 = 4.

For subset tests, remember that every set is a subset of itself and the empty set is a subset of everything. If A \cap B = A, then A is a subset of B. In the demo data the intersection is {3, 4}, not equal to A, so neither set is a subset of the other.

Common mistakes

A second trap is confusing intersection with symmetric difference. Intersection keeps what is common, {3, 4}. Symmetric difference keeps what is not common, {1, 2, 5, 6}. They are complements of each other inside the union, so together they rebuild it.

A third trap is treating repeated entries as separate. If you type 1, 1, 2 the tool reads the set {1, 2}. The count is 2, not 3. If your data genuinely has repeats that matter, a set is not the right model.

Finally, watch the item type. The strings "3" and the number 3 may or may not be treated as equal depending on how you enter them. Keep both lists in the same format, all numbers or all words, so that matching behaves the way you expect.

Related tools

Set logic connects to several other topics on this site. The truth table generator handles the propositional versions of "and", "or" and "exclusive or". When your sets are ranges of primes, the prime number tools generate the members for you. For number-theoretic sets defined by remainders, the congruence solver finds which integers satisfy a system, and the linear Diophantine equations page describes the full solution set of ax + by = c. If your elements are written in another base, convert them first with base-N arithmetic so the matching is done on comparable values.

Related tools

Truth Table Generator

Full truth tables plus DNF/CNF simplification.

Prime Number Tools

Primality tests, the nth prime, prime ranges and π(x).

Base-N Arithmetic

Add, subtract, multiply and divide directly in any base.

Congruence Solver (CRT)

Linear congruences and Chinese Remainder Theorem systems.

Linear Diophantine Equations

Integer solutions of ax + by = c with the general formula.

3D Solid Geometry Calculator

Volume and surface area of spheres, cones, prisms and more.