Set Concepts & Operations
A set is a well-defined collection of objects. We usually write its elements inside braces. For example,
.
The statement means “4 belongs to ,” while means “5 does not belong to .”
Two sets are equal when they contain exactly the same elements. They are equivalent when they contain the same number of elements, even if the elements themselves are different.
A set is a subset of , written , if every element of is also in . A proper subset is a subset that is not equal to the whole set.
If a set has distinct elements, it has subsets in total. Those subsets form the power set.
The main set operations are:
- Union: contains everything in or , without repeating elements.
- Intersection: contains only elements common to both.
- Difference: contains elements in that are not in .
- Complement: contains elements of the universal set that are not in .
- Symmetric difference: elements in exactly one of the two sets, not in both.
Remember that repeated entries do not change a set. For example, .
Example 1: Let and . Are the sets equal or equivalent?
They are not equal because their elements differ. Each has three elements, so they are equivalent.
Example 2: Let and . Find .
Collect every distinct element appearing in either set:
.
Example 3: Using the same sets, find .
The common elements are 3 and 4, so
.
Example 4: Using the same sets, find .
Keep the elements that belong to but not :
.
Example 5: Let and . Find .
Remove the elements of from the universal set:
.
Example 6: How many subsets does have?
There are four elements, so the number of subsets is
.
Only one of these subsets is the whole set itself, so there are proper subsets if the empty set is counted as a proper subset.
Example 7: Let and . Find the elements that belong to exactly one of and .
and .
Their union is .
Venn Diagrams & Set Counting
A Venn diagram turns set relationships into regions. Before calculating, decide what each region means. In a two-set diagram:
- the overlap is ;
- the two circles together are ;
- outside both circles is “neither.”
For two sets,
.
We subtract the intersection once because adding and counts the overlap twice.
If the universal set has elements, then
.
For three sets,
.
The final three-way intersection is added back because the earlier subtraction removes it too many times.
Example 8: In a class of 40 students, 25 study Physics, 20 study Chemistry, and 10 study both. How many study at least one subject?
.
So 35 students study at least one.
Example 9: Using Example 8, how many study neither subject?
There are 40 students in total and 35 in the union.
Therefore study neither.
Example 10: In a group, , , and . Find .
Use .
Hence .
Example 11: A class has 65 students. 45 offer Physics, 38 offer Chemistry, and every student offers at least one. How many offer both?
Because every student is in the union, .
Thus , so .
Example 12: In a survey of 100 people, 60 like tea, 50 like coffee, and 20 like both. Find the probability that a randomly chosen person likes neither.
The union is .
So 10 like neither, and the probability is .
Example 13: In a group, 30 study Mathematics, 25 Physics, and 20 Chemistry. Pairwise intersections are 12, 10, and 8 respectively, and 5 study all three. Find the number studying at least one.
Use inclusion-exclusion:
.
So 50 people study at least one of the three subjects.
Binary Operations
A binary-operation symbol such as , , or does not automatically mean ordinary multiplication. The question defines what the symbol means. Your first job is to copy that rule and substitute the two inputs carefully.
For example, if
,
then means
.
When operations are nested, work from the innermost brackets outward, just as you do with ordinary algebra.
An identity element leaves every input unchanged. For an operation , it must satisfy the required identity condition, typically
.
An inverse of is an element that combines with to give the identity.
An operation is commutative if changing the order never changes the result:
.
It is associative if regrouping never changes the result:
.
These are different properties; one does not automatically imply the other.
Example 14: If , find .
Substitute and :
.
Example 15: If , find .
.
Example 16: If , find .
Do the inner operation first:
.
Then .
Example 17: If , solve .
The definition gives .
So , which factorises as .
Therefore or .
Example 18: Suppose . Find the identity element.
Let the identity be . Require :
.
So for every allowed , which gives .
Check the other order: . Thus the identity is 0.
Example 19: Suppose and the identity is 2. Find the inverse of .
Let the inverse be . We need .
So , giving and .
Example 20: Let . Is this operation commutative?
, while .
These are not equal for all . For instance, but .
Therefore the operation is not commutative.
A simple exam plan
- For ordinary sets, write the elements explicitly when that makes the operation easier to see.
- Never repeat an element in a set answer.
- For complements, identify the universal set first.
- In Venn counting, put the intersection in first and use inclusion-exclusion carefully.
- Do not assume everyone belongs to at least one set unless the question actually says so.
- For a custom binary symbol, ignore its appearance and use only the stated rule.
- For nested binary operations, evaluate the innermost operation first.
- For identity or inverse questions, translate the definition into an equation and solve it.
Check that your final answer is consistent with the original sets or operation before moving on.