Venn Diagram (3 Sets) Generator
Count the seven regions of a three-set Venn diagram element by element, with the region sum checked against the union size.
Venn Diagram (3 Sets) Generator
Count the seven regions of a three-set Venn diagram element by element, with the region sum checked against the union size.
How this page computes
Each set is parsed and de-duplicated. For every element, the page asks which of the three lists contain it and adds it to the matching region, so no region is inferred from a size.
The union is collected independently. The printed sum of the seven regions is compared with it, and the exactly-two and at-least-two totals are read from the same region lists.
The calculation runs entirely in this browser tab; nothing is uploaded.
Three overlapping sets cut the page into seven non-empty regions, and this page counts each one. For A = {1,2,3,4}, B = {3,4,5} and C = {4,5,6} the region counts are 2, 0, 1, 1, 0, 1 and 1, which sum to the union of six.
Each element is placed by asking which of the three lists contain it, so a region count is a count of real elements rather than a number derived from three sizes. The sum of the seven regions must equal the union, and the page prints both so the arithmetic is visible.
How to use Venn Diagram (3 Sets) Generator
Type each set into its own field, separated by commas or spaces, then press Run. Repeats are removed per set, since a set has no duplicates.
The output lists the seven regions with their members — A only, B only, C only, the three pairwise regions, and the triple overlap — then the union size and two summaries: how many elements sit in exactly two sets, and how many sit in at least two.
Why seven regions, and not eight
An element is either in or out of each of three sets, which gives eight combinations. One of them is in none of the sets, and that region is not part of the diagram's universe unless a universe is stated, so the page counts the seven regions that are inside the union.
Every element of the union falls into exactly one region, which is why the region counts add up to the union size. The page prints that sum beside the union count; a mismatch would mean the region assignment and the union were computed from different things.
What to Expect
Best for
- Counting the seven regions of a three-set Venn diagram
- Checking a textbook diagram's numbers against real elements
- Seeing which specific elements sit in two sets but not three
Not ideal for
- Drawing the diagram, which this page does not render
- A stated universe, so the "in none of the three" region is not counted
- Symbolic set expressions
What this tool keeps
- Every element exactly as typed
What may need cleanup
- Nothing: the region counts are final
Common errors
- An empty set field is refused, because the empty set is written {}, not left blank
- A region with no members prints 0 rather than being omitted
Example use cases
- Count the seven regions of three overlapping sets
- Find the elements in exactly two of the three sets
- Check that the region counts sum to the union
Sample input
A = 1,2,3,4; B = 3,4,5; C = 4,5,6
Sample output
regions 2, 0, 1, 1, 0, 1, 1 summing to a union of 6
Who this is for
- Students checking a Venn diagram
- Readers counting overlaps
Frequently asked questions
Why are there seven regions and not eight?
Three sets give eight in-or-out combinations. One of them is "in none of the three", which is outside the union and undefined without a stated universe, so the page counts the seven regions inside the union.
What is the difference between "exactly two" and "at least two"?
An element in all three sets is in at least two sets but not in exactly two. The page prints both totals so a diagram's overlap figures can be read either way.
Can two sets be identical?
Yes. Then every element of that pair sits in the B and C only or A and C only region as appropriate, and the pairwise region for those two is empty because a third set is involved.
Build custom tools for your store
Join the SDK program to create useful ecommerce utilities for your store.