Chapter Summary: Sets
Introduction
- Sets are fundamental in modern mathematics, used in various branches including geometry, probability, and functions.
- Developed by Georg Cantor (1845-1918).
Basic Definitions
- Set: A well-defined collection of objects.
- Empty Set: A set with no elements, denoted as Φ.
- Finite Set: A set with a definite number of elements.
- Infinite Set: A set that is not finite.
- Equal Sets: Two sets A and B are equal if they contain the same elements.
- Subset: A set A is a subset of B if every element of A is also in B.
Set Operations
- Union (A ∪ B): The set of elements in A or B.
- Intersection (A ∩ B): The set of elements common to both A and B.
- Difference (A - B): The set of elements in A but not in B.
- Complement (A'): The set of elements not in A, relative to a universal set U.
Important Laws
- De Morgan's Laws:
- (A ∪ B)' = A' ∩ B'
- (A ∩ B)' = A' ∪ B'
Venn Diagrams
- Used to represent relationships between sets visually.
Examples of Sets
- Odd natural numbers less than 10: {1, 3, 5, 7, 9}
- Rivers of India
- Vowels in the English alphabet: {a, e, i, o, u}
- Prime factors of 210: {2, 3, 5, 7}
- Solutions of x² - 5x + 6 = 0: {2, 3}
Historical Note
- Georg Cantor's work on set theory began in the 1870s, focusing on properties of sets and their cardinalities.