How this calculation works
Normalize plain numeric entries, keep other text case-sensitive and remove duplicates. Classify members into only A, both A and B, or only B. Read the union, intersection, two directional differences, symmetric difference and subset checks from those regions. The schematic circles explain membership; their areas are not scaled to counts.
A ∪ B contains either set; A ∩ B contains both; A △ B = (A minus B) ∪ (B minus A)A worked example
For A = {1, 2, 3} and B = {3, 4}, the union is {1, 2, 3, 4}, intersection is {3}, A minus B is {1, 2}, B minus A is {4}, and symmetric difference is {1, 2, 4}. Neither set is a subset of the other.
Good to know
Finite sets of simple numeric or text entries only, with comma or newline separators. Numeric decimal equivalents are merged; other text is case-sensitive after trimming and Unicode normalization. No nested sets, quoted comma-containing values, multiset counts or universal-set complement. Schematic circle areas are not quantitative.
Reference: OpenStax: union and intersection of sets (opens in a new tab) ↗
A set keeps membership rather than repeated occurrences
Writing a member twice does not create a second copy in a set. This calculator therefore removes duplicate entries before it counts regions or checks subset relations. Numeric strings such as 1, 1.0 and +01 refer to the same decimal value here. Other entries remain case-sensitive text: apple and Apple are different members unless you change the input deliberately.
The parser checks an entire entry before treating it as a number. A label such as 1apple remains text rather than being truncated to the number 1. Leading and trailing spaces are trimmed, and equivalent Unicode text is normalized. These conventions are stated because an unnoticed parsing rule can change a union or intersection even when the operation itself is correct.
The finite topology checker uses unions and intersections to verify an entire proposed family of open sets, then checks connectedness and separation. The three-set Venn diagram generator extends membership partitioning to seven disjoint regions when a third list is needed.
Partition the two sets into three membership regions
Every member in the union belongs to only A, both A and B, or only B. The intersection is the middle region. A minus B keeps the first region; B minus A keeps the last. Their union is the symmetric difference, which contains members appearing in exactly one input set. Swapping A and B preserves the union and intersection but can change a directional difference.
For A = {1, 2, 3} and B = {3, 4}, there are two only-A members, one shared member and one only-B member. The union has four members and the symmetric difference has three. The schematic circles show the two-set relationship, while the table supplies the actual counts and members. Circle sizes and overlap are deliberately not presented as proportional measurements.
Empty sets and subset checks are valid outcomes
Enter {} or ∅ to represent the empty set explicitly. Its union with A is A, and its intersection with A is empty. The empty set is a subset of every set because it has no member that violates inclusion. A is a subset of B exactly when A minus B is empty; the calculator uses that membership condition rather than comparing the two set sizes alone.
The cardinality identity |A ∪ B| = |A| + |B| − |A ∩ B| checks the region counts without counting shared members twice. Counts alone cannot reconstruct the actual members, so both are displayed. A universal-set complement would require a separately defined universe and is outside this two-set form. The binomial probability calculator is a separate model requiring a trial count and success probability. A collection of members and a schematic diagram do not supply those probability assumptions.
A few questions, answered
Why did duplicate entries disappear?
A set records distinct membership, not repeated occurrences. Use a multiset model if multiplicity matters.
Are apple and Apple the same member?
No. This tool treats text case-sensitively after trimming and Unicode normalization.
Why are the circle areas unchanged for an empty set?
The circles are a schematic membership illustration. Actual region counts and members are in the table; areas are not quantitative.