Sets Class 11 One Shot | NCERT Class 11th Maths Chapter-1 | Kuldeep Sir | CBSE 2025-26 Exam

Sets: Definitions, Operations, and Venn Diagrams

The concept of a set is one of the most fundamental ideas in modern mathematics, serving as the building block for nearly every branch including relations, functions, probability, and logic. A set is defined as a well-defined collection of distinct objects, called elements or members. "Well-defined" means there is no ambiguity about whether a given object belongs to the set or not — for example, "the collection of all even numbers less than 10" is a well-defined set {2, 4, 6, 8}, whereas "the collection of beautiful flowers" is not well-defined because beauty is subjective. Sets are usually denoted by capital letters (A, B, C) and their elements by small letters (a, b, c). If a is an element of set A, we write a ∈ A; if it is not, we write a ∉ A.

Sets can be represented in two main ways: the roster (or tabular) form lists all elements within curly braces separated by commas, such as A = {1, 2, 3, 4, 5}. The set-builder form describes the common property shared by all elements, such as A = {x : x is a natural number less than 6}. Important types of sets include: the empty set (null set, ∅) containing no elements, singleton sets with exactly one element, finite sets with a countable number of elements, infinite sets with uncountable elements, equal sets with exactly the same elements, subsets (A ⊂ B means every element of A is also in B), the universal set (U) containing all elements under consideration, and the power set P(A) which is the set of all subsets of A. If a finite set has n elements, its power set has 2ⁿ elements. The set of natural numbers N = {1, 2, 3, ...}, whole numbers W = {0, 1, 2, ...}, integers Z = {..., −2, −1, 0, 1, 2, ...}, rational numbers Q, and real numbers R follow the inclusion chain N ⊂ W ⊂ Z ⊂ Q ⊂ R.

Set operations mirror arithmetic operations. The union of two sets A ∪ B contains all elements that are in A or in B or in both. The intersection A ∩ B contains only the elements common to both sets. The difference A − B contains elements in A that are not in B. The complement A' (or A̅) contains all elements in the universal set U that are not in A. These operations follow important laws: the commutative laws (A ∪ B = B ∪ A and A ∩ B = B ∩ A), the associative laws, the distributive laws (A ∪ (B ∩ C) = (A ∪ B) ∩ (A ∪ C)), and De Morgan's laws: (A ∪ B)' = A' ∩ B' and (A ∩ B)' = A' ∪ B'. Venn diagrams provide a visual way to represent sets and verify these identities. For two finite sets, the cardinality formula n(A ∪ B) = n(A) + n(B) − n(A ∩ B) is used extensively in problems. For three sets, the inclusion-exclusion principle extends to: n(A ∪ B ∪ C) = n(A) + n(B) + n(C) − n(A ∩ B) − n(B ∩ C) − n(A ∩ C) + n(A ∩ B ∩ C). This formula is the basis for solving practical problems involving survey data, group membership, and counting problems that appear frequently in board examinations.

• A set is a well-defined collection of distinct objects; represented in roster form {a, b, c} or set-builder form {x : property}.
• Key types: empty set ∅, finite/infinite sets, subsets, universal set U, power set (2ⁿ elements for a set of n elements).
• Operations: union ∪, intersection ∩, difference −, complement ' follow commutative, associative, and distributive laws.
• De Morgan's laws: (A ∪ B)' = A' ∩ B' and (A ∩ B)' = A' ∪ B' — verified using Venn diagrams.
• Cardinality: n(A ∪ B) = n(A) + n(B) − n(A ∩ B); the inclusion-exclusion principle extends this to three or more sets.