Set Theory Visualizer

Enter elements for each set and instantly see the result highlighted on an interactive Venn diagram. Explore union, intersection, complement, difference, symmetric difference, power set, and Cartesian product for 2 or 3 sets.

Set Inputs

Preset

Set A (teal)comma-separated values

Set B (blue)

Universal Set U (for complements)

Operation

Venn Diagram

Set ASet BHighlighted region

Result

A ∪ B

{ 1, 2, 3, 4, 5, 6 }

Cardinality: 6

Set Properties

|A|4

|B|4

|U|10

|A \u2229 B|2

A \u2286 Bno

B \u2286 Ano

A = Bno

A \u2229 B = \u2205not disjoint

Understanding Set Theory Visualizer

A set is a collection in which membership is what matters. Repeating an item does not create a new member, so the list red, red, blue represents the same set as red, blue. Order does not matter either.

This differs from a shopping list or a sequence, where position and repeats can carry information. Students often make mistakes by treating sets like ordinary lists.

Before using complements or some differences, define the universal set. It contains every item currently allowed in the discussion. If the universe is all students in a class, the complement of the football set means students in that class who are not in football.

It does not mean every person outside the class. Changing the universe can change a complement, even when the original set stays exactly the same.

The separate regions in a three-set diagram help track precise membership. An item in the middle belongs to all three sets, while an item in the overlap of the first two but outside the third belongs to exactly those two.

Pay close attention to words such as at least one, exactly one, and none. They describe different regions and lead to different answers in survey problems, club memberships, and probability questions.

Counting gives set ideas a practical purpose. When two groups overlap, adding their sizes counts shared members twice. The inclusion-exclusion principle fixes this by subtracting the size of the overlap once.

With three groups, the shared center needs special care because it has been added too many times and then removed too many times. This method is useful when a school records students taking subjects, playing sports, or using several transport methods.

De Morgan's laws describe how a complement changes a combined condition. The complement of being in either group is being in neither group. The complement of being in both groups is missing at least one group.

These statements are helpful for checking work because the shaded regions must match. They also connect to computer searches, where a filter that excludes two conditions can be rewritten in a clearer form.

A power set is the set of every possible subset, including the empty set and the full original set. For a set with three members, there are eight subsets.

Each extra member doubles the number of subsets, which explains why the total grows quickly. This idea appears when counting possible choices, testing combinations, and studying binary decisions.

A Cartesian product makes ordered pairs from two sets. Unlike an ordinary set operation, order matters here because first coordinate, second coordinate is different from second coordinate, first coordinate when the values differ.

If one set has three members and another has four, their product has twelve pairs. Coordinate grids, tables of possible meals, and input-output relations all use this structure.

Good set work starts by writing each element clearly and deciding what counts as the same item. Names with different spelling, capital letters, or extra spaces may look different to a computer even if they mean the same person.

Check whether every listed element belongs to the chosen universe. Then read the operation in words before trusting a shaded picture or a final count.

Reference Guide

Set Operations

A set is a well-defined collection of distinct objects called elements. The notation $x \in A$ means x is an element of A; $x \notin A$ means it is not.

A \cup B = \{x \mid x \in A \text{ or } x \in B\}

A \cap B = \{x \mid x \in A \text{ and } x \in B\}

A \setminus B = \{x \mid x \in A \text{ and } x \notin B\}

A \triangle B = (A \setminus B) \cup (B \setminus A)

The symmetric difference contains elements in exactly one of the two sets. Two sets are disjoint when $A \cap B = \emptyset$ .

Venn Diagrams

A Venn diagram shows all possible logical relations between a finite collection of sets. Each circle represents a set; overlapping regions show shared elements.

For two sets A and B, there are four regions: only in A, only in B, in both (the intersection), and in neither (outside both, inside U). For three sets there are eight regions.

The complement $A' = U \setminus A$ contains everything in the universal set U that is not in A. In a Venn diagram it is the area outside circle A but inside the rectangle for U.

The power set $\mathcal{P}(A)$ is the set of all subsets of A. If $|A| = n$ , then $|\mathcal{P}(A)| = 2^n$ . For A = {1, 2}, the power set has 4 elements: $\emptyset, \{1\}, \{2\}, \{1,2\}$ .

De Morgan's Laws

De Morgan's laws relate complements of unions and intersections. They are among the most useful identities in set theory and logic.

(A \cup B)' = A' \cap B'

(A \cap B)' = A' \cup B'

The first law says: everything outside the union is outside both sets. The second says: everything outside the intersection is outside at least one set.

These laws extend to any finite collection of sets and are the foundation of Boolean algebra and digital logic design (NOT(A OR B) = (NOT A) AND (NOT B)).

Inclusion-Exclusion Principle

The inclusion-exclusion principle counts elements in a union without double-counting those in intersections.

|A \cup B| = |A| + |B| - |A \cap B|

For three sets, each pairwise intersection is subtracted once, but the triple intersection was subtracted three times, so it must be added back once.

|A \cup B \cup C| = |A|+|B|+|C| - |A\cap B| - |A\cap C| - |B\cap C| + |A\cap B\cap C|

The Cartesian product $A \times B$ is the set of all ordered pairs with the first from A and the second from B. Its cardinality is $|A| \cdot |B|$ .

Sign in to save

Sign in to save

Set Theory Visualizer

Set Inputs

Venn Diagram

Result

Set Properties

Understanding Set Theory Visualizer

Reference Guide

Set Operations

Venn Diagrams

De Morgan's Laws

Inclusion-Exclusion Principle

Related Content

Visual Explainers

Related Tools

Related Labs

Study Posters

Worksheets

Cheat Sheets