NIMCET Set Theory covers the basic concepts of sets and helps students understand how different sets are represented and used. It includes topics such as set representation, types of sets, important symbols, cardinality, subsets, and power sets.
This topic also covers set operations such as union, intersection, difference, and complement. Students can also learn about set algebra, Venn diagrams, and relations. These concepts and formulas can help students revise the important parts of Set Theory in a simple and structured way.
A set is a well-defined collection of distinct objects called elements or members. A collection is well-defined when there is no confusion about whether an object belongs to it.
For example, the collection of all vowels in English is a set. However, terms such as "good students" or "tall people" do not define a set because their criteria are subjective.
Sets are usually represented using capital letters such as A, B, and C. Two standard forms are used.
In roster form, all elements are written inside curly brackets. Example:
A = {a, e, i, o, u}
In set-builder form, a rule or property is used to describe the elements. Example:
A = {x : x is a vowel in English}
Understanding the basic symbols is important for solving NIMCET Set Theory questions. These symbols are used to show relationships between elements and sets and make set-related statements easier to understand.
| Symbol | Meaning |
| ∀ | For all elements |
| ∃ | There exists |
| ∈ | Belongs to |
| ∉ | Does not belong to |
| ⊆ | Subset |
| ⊈ | Not a subset |
| ⊂ | Proper subset |
Set Theory includes different types of sets based on the number of elements they contain and their properties. Understanding these types helps in solving questions related to subsets, cardinality, and set operations in NIMCET. The following are some of the commonly used types of sets covered in the NIMCET syllabus:
Empty set: A set with no elements, denoted by φ or {}.
Singleton set: A set containing exactly one element.
Finite set: A set with a countable number of elements.
Infinite set: A set with an uncountable number of elements, such as the set of natural numbers.
Non-empty set: A set containing at least one element.
The empty set is unique. Also, changing the order or repeating elements does not change the identity of a set.
Cardinality refers to the total number of distinct elements present in a set. It is an important concept in Set Theory because it helps determine the size of a set. The cardinality of a set A is represented by n(A) or |A|.
For example, consider the set A = {a, e, i, o, u}. Since this set contains five distinct elements, its cardinality is n(A) = 5. Similarly, if a set contains six different elements, its cardinality will be 6.
The cardinality of the empty set is 0 because it contains no elements. A singleton set, which contains exactly one element, has a cardinality of 1. Thus, cardinality simply tells us how many distinct elements are present in a set.
Membership and subset are two different concepts in Set Theory, and it is important to understand the difference between them. The symbol ∈ is used to show the relationship between an element and a set, while ⊆ is used to show the relationship between two sets.
For example, if A = {1, 2, 3}, then 2 ∈ A means that 2 is an element of set A. On the other hand, if B = {1, 2}, then B ⊆ A means that every element of B is also present in A.
The empty set is a subset of every set, and every set is also a subset of itself. Therefore, students should carefully distinguish between element membership (∈) and subset relationship (⊆) while solving Set Theory questions.
A power set is the set of all possible subsets of a given set. It includes the empty set and the original set itself. The power set of a set A is represented by P(A).
To find the total number of subsets in the power set, use the formula |P(A)| = 2ⁿ, where n represents the total number of elements in the set. For example, if a set has three elements, the number of subsets will be 2³ = 8.
The formula can be used for sets of different sizes. If a set has no elements, then |P(φ)| = 2⁰ = 1, as the power set contains the empty set.
When a set contains n elements, we can find the number of subsets that contain exactly r elements using the combination formula ⁿCᵣ. This helps determine how many different subsets of a particular size can be formed from the given set.
For example, if a set has three elements, the number of subsets containing one element is ³C₁ = 3, while the number containing two elements is ³C₂ = 3. The following relation shows that the total number of subsets of a set is 2ⁿ:
2ⁿ = ⁿC₀ + ⁿC₁ + ⁿC₂ + ... + ⁿCₙ
Strengthen Your NIMCET Preparation with Complete Set Theory Notes
A proper subset is a subset of a set that does not contain all the elements of the original set. In other words, a proper subset is always different from the original set. If B is a proper subset of A, then every element of B is present in A, but B is not equal to A.
If a set has n elements, the total number of subsets is 2ⁿ. Since the original set itself is not counted as a proper subset, one is subtracted from the total.
Number of proper subsets = 2ⁿ − 1
A universal set, represented by U, is a set that contains all the objects being considered in a particular situation. All the sets being discussed in that context are treated as subsets of the universal set. For example, if U contains all the elements under consideration, every set within that discussion will be a subset of U.
A superset is a set that contains every element of another set. If all elements of set B are present in set A, then A is a superset of B. The universal set is also a superset of every set being considered in that context.
Set operations are used to compare two or more sets and identify how their elements are related. Each operation follows a different rule, so understanding what each symbol represents is important when solving NIMCET Set Theory questions.
These operations help determine the elements that are common, different, or present in either of the given sets. The main set operations are as follows:
Union (A ∪ B): Contains all elements that are in A, in B, or in both.
Intersection (A ∩ B): Contains only the elements that are common to A and B.
Difference (A − B): Contains the elements that are in A but not in B.
Symmetric Difference (A Δ B): Contains the elements that are in A or B, but not in both
The symmetric difference can be written as:
A Δ B = (A − B) ∪ (B − A)
or
A Δ B = (A ∪ B) − (A ∩ B)
The complement of A contains the elements of the universal set that are not in A.
A′ = U − A
Important results include:
(A′)′ = A
φ′ = U
U′ = φ
Two sets are disjoint when they have no common elements.
A ∩ B = φ
For disjoint sets:
n(A ∪ B) = n(A) + n(B)
The important laws of set algebra include the idempotent, identity, commutative, associative, and distributive laws.
The two important forms are:
(A ∪ B)′ = A′ ∩ B′
(A ∩ B)′ = A′ ∪ B′
A common mistake is to forget that the operation changes from union to intersection, or from intersection to union.
For two sets:
n(A ∪ B) = n(A) + n(B) − n(A ∩ B)
n(A − B) = n(A) − n(A ∩ B)
n(B − A) = n(B) − n(A ∩ B)
For three sets:
n(A ∪ B ∪ C) = n(A) + n(B) + n(C) − n(A ∩ B) − n(B ∩ C) − n(C ∩ A) + n(A ∩ B ∩ C)
Venn diagrams make it easier to understand the relationship between different sets by showing their elements in separate regions. They can be used to identify common elements, elements belonging to only one set, and elements outside a particular set.
The main regions represented in a Venn diagram are:
Union: The entire area covered by both circles.
Intersection: The overlapping region of the two circles.
Difference: The part of A that does not overlap with B.
Symmetric difference: The non-overlapping parts of A and B.
Complement: The area outside A but inside the universal set.
If A and B are two non-empty sets, a relation R from A to B is a subset of A × B.
A relation can be represented in roster form as a set of ordered pairs or in set-builder form using a rule connecting elements of the two sets.
The Cartesian product is:
A × B = {(a,b) : a ∈ A, b ∈ B}
If n(A) = p and n(B) = q, then:
n(A × B) = pq
Also, A × φ = φ, and in general A × B ≠ B × A.
For a relation R from A to B:
Domain: Set of first components of the ordered pairs
Range: Set of second components of the ordered pairs
Codomain: The set B
Relations can have different properties based on how the ordered pairs in a relation are connected. Understanding these types is important for identifying the nature of a relation and solving NIMCET Set. The main types of relations are:
Empty or Void Relation: R = φ
Universal Relation: R = A × A
Identity Relation: Iₐ = {(a,a) : a ∈ A}
Reflexive Relation: (a,a) ∈ R for every a ∈ A
Symmetric Relation: If (a,b) ∈ R, then (b,a) ∈ R
Transitive Relation: If (a,b) ∈ R and (b,c) ∈ R, then (a,c) ∈ R
Equivalence Relation: A relation that is reflexive, symmetric, and transitive.
The following formulas are useful for quick revision of NIMCET Set Theory and Relations. They help students revise important concepts such as power sets, proper subsets, Cartesian products, cardinality, and set operations.
Keep these formulas handy while practising questions, as they provide a quick way to recall the main rules and relationships:
| Concept | Formula |
| Power set | |P(A)| = 2ⁿ |
| Proper subsets | 2ⁿ − 1 |
| Subsets of size r | ⁿCᵣ |
| Cartesian product | n(A × B) = pq |
| Two-set union | n(A ∪ B) = n(A) + n(B) − n(A ∩ B) |
| Three-set union | n(A)+n(B)+n(C)−n(A∩B)−n(B∩C)−n(C∩A)+n(A∩B∩C) |
| De Morgan's I | (A ∪ B)′ = A′ ∩ B′ |
| De Morgan's II | (A ∩ B)′ = A′ ∪ B′ |
| Symmetric difference | (A−B) ∪ (B−A) |
Students can make small mistakes while applying basic Set Theory concepts, especially when working with symbols, set operations, and formulas. Understanding these common errors can help avoid confusion and improve accuracy while solving NIMCET Set Theory questions.
Keep the difference between similar concepts clear and check the conditions before applying any formula. The following are some common mistakes to avoid:
Using vague or subjective criteria to define a set.
Confusing the empty set with {0} or {φ}.
Confusing ∈ (element of) with ⊆ (subset of).
Assuming A × B = B × A, which is not generally true.
Applying De Morgan's Laws incorrectly.
Forgetting that the double complement of a set gives the original set, that is, (A′)′ = A.
Confusing union and intersection while applying set cardinality formulas.
The formula is: n(A ∪ B) = n(A) + n(B) − n(A ∩ B)
A relation from A to B is a subset of A × B.