Chapter Notes: Sets

1.1 Introduction to Sets

• Sets are fundamental in mathematics. They form the basis for concepts in geometry, probability, etc. The theory of sets began with Georg Cantor, known for his work on infinite sets.

1.2 Sets and Their Representations

• Definition: A set is a well-defined collection of objects.
• Objects in a set are called elements or members.
• Examples of sets can include numbers like odd natural numbers less than 10 or vowels in the English alphabet.
• Well-defined sets can clearly identify whether an object belongs to a set (e.g., the river Ganga belongs to the set of rivers in India).

Representation Methods

1. Roster Form: Lists all elements enclosed in braces {}. E.g., the set of even numbers less than 7 can be written as {2, 4, 6}.
2. Set-Builder Form: Describes the properties that define the set. E.g., V = {x: x is a vowel in the English alphabet}.

Examples:

• Roster: {1, 3, 5,...} indicates an infinite series, while {a, e, i, o, u} shows the vowels clearly.
• Set-builder can describe the natural numbers: {x: x ∈ N}.

Membership Notation

• Symbol ∈ denotes membership. For instance, if a belongs to set A, we write a ∈ A. Conversely, if an element does not belong, we use ∉ (not in).

1.3 The Empty Set

• Empty set (also called null set) is a set containing no elements, denoted φ or {}. An example is a set of students in a class that does not exist.

1.4 Finite and Infinite Sets

• A finite set has a specific number of elements, while an infinite set continues indefinitely (e.g., natural numbers).
• Important definitions: finite set contains a definite number of elements, while infinite does not.

1.5 Equal Sets

• Two sets A and B are equal (A = B) if they contain the same elements. Notation: Set A can include repeated elements but is defined by distinct members.

1.6 Subsets

• A subset A of B (A ⊆ B) is when every element of A is also in B. A proper subset (A ⊂ B) has elements that are in A but not all in B.
• The universal set includes all elements relevant to a specific discussion.

1.7 Venn Diagrams

• Venn diagrams illustrate relationships between sets visually, using circles to represent sets. The areas represent unions, intersections, and differences between them.

1.8 Operations on Sets

Union and Intersection

• Union (A ∪ B): All elements in A, B or both.
• Intersection (A ∩ B): Elements present in both sets.

Difference of Sets

• Difference (A - B): Elements in A that are not in B.

Complement of a Set

• Complement (A′): Set of elements not in A but in the universal set U.
• De Morgan's Laws: Two important laws defining relationships between unions and intersections of sets.

Key Properties to Remember:

1. Sets are finite if they have a defined number of elements; otherwise, they are infinite.
2. Subset Notation: A ⊆ B indicates A is a subset of B.
3. Union represents all items from both sets (A ∪ B)
4. Intersection gathers common elements (A ∩ B).
5. Difference clarifies elements unique to one set (A - B).
6. The complement of A gives elements from U not in A.
7. Important laws like De Morgan’s offer insights into set relationships.
8. Venn diagrams are useful for visualizing relations among sets.
9. Sets can be represented in roster or set-builder form effectively to showcase their contents clearly.
10. Equal sets contain the exact same elements, regardless of order or duplication.

Historical Context

• The modern theory of sets is largely attributed to Georg Cantor. Early discussions framed the problems experienced by mathematicians due to Russell's Paradox which questioned the very foundations of set theory.

Overview

Understanding sets is crucial as they form the basis of numerous mathematical concepts used across disciplines. The organization of collections, operations on them, and their various properties are vital for both pure and applied mathematics. Familiarity with these foundational ideas will support more complex mathematical learning and application.

1. A set is a well-defined collection of distinct objects.
2. The empty set contains no elements, denoted by φ.
3. Sets can be finite (limited elements) or infinite (limitless elements).
4. Equal sets contain exactly the same elements; repetition does not count.
5. A set A is a subset of B if every element of A is also in B.
6. The union of sets A and B combines all elements from both, removing duplicates (A ∪ B).
7. Intersection finds common elements shared between sets A and B (A ∩ B).
8. The difference of sets identifies unique elements in set A not present in B (A - B).
9. The complement of set A includes all elements of the universal set U that are not in A.
10. De Morgan’s Laws dictate relationships between union and intersection operations.