Detailed Notes on Set Theory

Chapter 3: Set Theory

Definition of Sets

  • Set: A well-defined collection of distinct objects (elements). Sets are fundamental in mathematics and can represent various types of collections based on context.

    • Denoted by capital letters (e.g., A, B, C), making it easy to reference sets in mathematical expressions.

    • Elements enclosed in curly brackets (e.g., A = {1, 2, 3}). This notation visually distinguishes sets from other mathematical entities.

    • Properties:

      • Order does not matter: {1, 2, 3} = {3, 2, 1}. This property allows for flexible representation of sets.

      • No repetitions allowed: {1, 1, 2, 3} = {1, 2, 3}. Sets inherently ignore duplicates, simplifying the collection.

Definition of Multisets

  • Multiset: A collection of objects allowing repetition of elements, used to represent scenarios where duplicate entries are significant in context.

    • Each element's count is referred to as its multiplicity, which is crucial in fields like combinatorics and probability analysis, where the number of occurrences matters.

Set Inclusion Notation

  • Membership:

    • Symbol ∈ indicates that an element is part of a set, while ∉ denotes that it is not part of the set. This is essential in formulating mathematical arguments and conducting proofs.

Set Notation: "Such That"

  • Symbol: | used to describe conditions elements must satisfy, enhancing the precision of set definitions.

  • Set Builder Notation:

    • {x | P(x)} means the set of all x such that P(x) is true. This notation is widely used in mathematical texts to define sets based on particular properties or formulas.

Examples of Set Notation

  • Universal Set: U = {1, 2, 3, …}, representing the overall collection under consideration, providing context for other sets.

Finite and Infinite Sets

  • Finite Set: A set with a finite number of elements (|A| = n), where n can be explicitly counted.

  • Infinite Set: A set that is not finite, indicating an uncountable collection of elements.

Subsets and Proper Subsets

  • Subset: C ⊆ D if every element of C is contained in D, forming the basis of many mathematical operations and proofs regarding containment.

  • Proper Subset: C ⊂ D if C is a subset of D and D contains at least one element not in C, illustrating the hierarchy of sets.

Transitive Properties of Subsets

  • Theorem: If A ⊆ B and B ⊆ C, then A ⊆ C, a vital property used in proofs and logical reasoning in mathematics.

Power Set Definition

  • Power Set P(A) is the set of all subsets of A, including the empty set and A itself.

  • Example:

    • If C = {1, 2, 3, 4}, then the power set has 16 subsets, illustrating the extensive nature of combinations derived from a finite set.

Common Sets of Numbers

  • Sets:

    • Z: Integers Z = {…, -3, -2, -1, 0, 1, 2, 3, …}. This set includes all whole numbers and is foundational in number theory.

    • N: Nonnegative integers or natural numbers N = {0, 1, 2, …}. Natural numbers are the building blocks for counting and ordering.

    • Q: Rational numbers Q = {a/b | a, b ∈ Z, b ≠ 0}. Rational numbers are critical for various applications in mathematics, particularly in fractions and ratios.

    • R: The set of real numbers, encompassing both rational and irrational numbers, forming the basis for continuous mathematics.

Intervals of Real Numbers

  • Types of Intervals:

    • Closed: [a, b] = {x | a ≤ x ≤ b}, indicates that the endpoints are included.

    • Open: (a, b) = {x | a < x < b}, showing that endpoints are excluded.

Set Operations

  • Union: A ∪ B = {x | x ∈ A ∨ x ∈ B}, combining all elements from both sets without duplication, forming larger sets.

  • Intersection: A ∩ B = {x | x ∈ A ∧ x ∈ B}, representing common elements shared by both sets, crucial for analyzing relationships.

Examples of Set Operations

  • Given Sets:

    • A = {2, 7, 4, 8, 11}, B = {11, 16, 5, 2}, illustrating how set operations are computed and understood.

Set Difference

  • Definition: For A, B, A \ B = {x ∈ A | x ∉ B}, indicating which elements remain in set A after removing those also in B.

Main Properties of Set Operations

  • Commutativity: - A ∪ B = B ∪ A, A ∩ B = B ∩ A, emphasizing the interchangeable nature of these operations.

Additional Laws of Set Theory

  • De Morgan’s Laws: - Complementation properties that relate unions and intersections, vital in advanced mathematical logic.

Inclusion-Exclusion Principle

  • Definition: Calculates the size of unions of sets considering overlaps, enhancing count accuracy across overlapping regions.