ScholarQuill logoScholarQuillUniversity Notes
  • Notes
  • Past Papers
  • Blogs
  • Todo
Login
ScholarQuill logoScholarQuillUniversity Notes
Login
NotesPast PapersBlogsTodo
More
SubjectsDiscussionCGPA CalculatorGPA CalculatorStudent PortalCourse Outline
About
About usPrivacy PolicyReportContact
Notes
Past Papers
Blogs
Todo
Analytics
    Current Subject
    🧩
    Discrete Structures
    GE-167
    Progress0 / 67 topics
    Topics
    1. Mathematical Reasoning: Propositional and Predicate Logic2. Propositional Logic: Logical Operators3. Translations Between Symbolic Expressions and Formal English Expression4. Logical Equivalences5. Predicate Logic: Quantifiers6. Nested Quantification7. Equivalences in Predicate Logic8. Translations Between Symbolic Forms and Formal English9. Rules of Inference: Proof Methods and Strategies10. Direct Proof11. Proof by Contraposition12. Proof by Induction13. Proof by Implication14. Existence Proof15. Uniqueness Proofs16. Trivial Proofs17. Vacuous Proofs18. Sets: Notations and Set Operations19. Venn Diagrams20. Countable and Uncountable Sets21. Relations: Equivalence Relations and Partitions22. Partial Orderings23. Recurrence Relations24. Functions: Injective, Surjective, Bijective25. Special Types of Functions26. Function Composition27. Inverse Functions28. Recursive Functions29. Compositions30. Number Theory: Sequences and Series31. Counting: Inclusion and Exclusion Principle32. Pigeonhole Principle33. Permutations and Combinations34. Integers and Divisibility: Division Theorem35. Modular Arithmetic36. LCM and GCD37. Euclidean and Extended Euclidean Method38. Finding Solutions to Congruence39. Primes: Fundamental Theorem of Arithmetic40. Characterizations of Primes41. Mersenne Primes42. Induction: Weak Induction43. Strong Induction44. Recursion and Recurrences: Formulation of Recurrences45. Closed Formulas46. Counting: Product Rule and Sum Rule47. Principle of Inclusion-Exclusion48. Binomial Coefficients49. Pascal's Identity and Pascal’s Triangle50. Binomial Theorem51. Relations: Reflexive, Symmetric, Transitive, and Antisymmetric52. Equivalence Relations and Equivalence Classes53. Partial Orders54. Graph Theory: Terminologies55. Elements of Graph Theory56. Planar Graphs57. Graph Coloring58. Euler Graph59. Hamiltonian Path60. Rooted Trees61. Graph Traversals62. Handshaking Lemma and Corollary63. Special Families of Graphs64. Graph Isomorphism65. Planarity in Graphs66. Eulerian and Hamiltonian Graphs67. Trees in Graph Theory
    GE-167›Sets: Notations and Set Operations
    Discrete StructuresTopic 18 of 67

    Sets: Notations and Set Operations

    13 minread
    2,240words
    Intermediatelevel

    Sets: Notations and Set Operations

    In mathematics, a set is a well-defined collection of distinct objects, considered as an object in its own right. Sets are fundamental in various areas of mathematics, and understanding their notation and operations is essential for many topics in discrete structures, logic, and beyond.

    1. Notation of Sets

    The basic idea of a set is to represent a collection of elements (or members). The notation used for sets typically involves curly brackets {}.

    • Set Builder Notation: Describes a set by stating the properties that its members must satisfy. For example, the set of all even numbers can be written as:

      {x∣x is an even number}\{ x \mid x \text{ is an even number} \}{x∣x is an even number}

      This reads as "the set of all xxx such that xxx is an even number."

    • Roster or Tabular Notation: In this notation, the set is explicitly listed by its elements. For example:

      A={1,2,3,4}A = \{ 1, 2, 3, 4 \}A={1,2,3,4}

      This means that AAA is the set containing the numbers 1, 2, 3, and 4.

    • Set Membership: To denote that an element xxx is a member of a set AAA, we use the symbol ∈\in∈. If xxx is an element of AAA, we write:

      x∈Ax \in Ax∈A

      If xxx is not an element of AAA, we write:

      x∉Ax \notin Ax∈/A
    • Empty Set: The set with no elements is called the empty set, and is denoted by:

      ∅or{}\emptyset \quad \text{or} \quad \{\}∅or{}
    • Universal Set: The set that contains all possible elements within a particular context or discussion is called the universal set, often denoted by UUU.


    2. Types of Sets

    • Finite Set: A set with a specific number of elements. For example, A={1,2,3}A = \{1, 2, 3\}A={1,2,3}.

    • Infinite Set: A set with an infinite number of elements. For example, B={1,2,3,4,5,… }B = \{1, 2, 3, 4, 5, \dots \}B={1,2,3,4,5,…} represents the set of all positive integers.

    • Subset: A set AAA is a subset of a set BBB if every element of AAA is also an element of BBB. This is denoted as:

      A⊆BA \subseteq BA⊆B

      If AAA is a subset of BBB, but AAA is not equal to BBB, we write:

      A⊂BA \subset BA⊂B
    • Proper Subset: A set AAA is a proper subset of a set BBB if every element of AAA is in BBB, and BBB contains at least one element that is not in AAA. This is denoted as:

      A⊂BA \subset BA⊂B
    • Power Set: The power set of a set AAA is the set of all subsets of AAA. It is denoted as:

      P(A)orP(A)P(A) \quad \text{or} \quad \mathcal{P}(A)P(A)orP(A)

      For example, if A={1,2}A = \{1, 2\}A={1,2}, then the power set P(A)P(A)P(A) is:

      P(A)={∅,{1},{2},{1,2}}P(A) = \{\emptyset, \{1\}, \{2\}, \{1, 2\}\}P(A)={∅,{1},{2},{1,2}}
    • Universal Set: The universal set is the set that contains all possible elements for a given context. If AAA is a subset of the universal set UUU, then every element in AAA is also in UUU.


    3. Set Operations

    Union of Sets (∪\cup∪)

    The union of two sets AAA and BBB is the set that contains all elements that are in AAA, in BBB, or in both. This is denoted by:

    A∪B={x∣x∈A or x∈B}A \cup B = \{ x \mid x \in A \text{ or } x \in B \}A∪B={x∣x∈A or x∈B}

    For example, if A={1,2,3}A = \{1, 2, 3\}A={1,2,3} and B={3,4,5}B = \{3, 4, 5\}B={3,4,5}, then:

    A∪B={1,2,3,4,5}A \cup B = \{1, 2, 3, 4, 5\}A∪B={1,2,3,4,5}

    Intersection of Sets (∩\cap∩)

    The intersection of two sets AAA and BBB is the set of elements that are common to both AAA and BBB. This is denoted by:

    A∩B={x∣x∈A and x∈B}A \cap B = \{ x \mid x \in A \text{ and } x \in B \}A∩B={x∣x∈A and x∈B}

    For example, if A={1,2,3}A = \{1, 2, 3\}A={1,2,3} and B={3,4,5}B = \{3, 4, 5\}B={3,4,5}, then:

    A∩B={3}A \cap B = \{3\}A∩B={3}

    Difference of Sets (−-−)

    The difference of two sets AAA and BBB (also called the set difference) is the set of elements that are in AAA but not in BBB. This is denoted by:

    A−B={x∣x∈A and x∉B}A - B = \{ x \mid x \in A \text{ and } x \notin B \}A−B={x∣x∈A and x∈/B}

    For example, if A={1,2,3}A = \{1, 2, 3\}A={1,2,3} and B={3,4,5}B = \{3, 4, 5\}B={3,4,5}, then:

    A−B={1,2}A - B = \{1, 2\}A−B={1,2}

    Similarly, the difference B−AB - AB−A would be {4,5}\{4, 5\}{4,5}.

    Complement of a Set (AcA^cAc or A‾\overline{A}A)

    The complement of a set AAA refers to the elements that are in the universal set UUU but not in AAA. This is denoted by:

    Ac={x∣x∈U and x∉A}A^c = \{ x \mid x \in U \text{ and } x \notin A \}Ac={x∣x∈U and x∈/A}

    For example, if the universal set U={1,2,3,4,5}U = \{1, 2, 3, 4, 5\}U={1,2,3,4,5} and A={1,2,3}A = \{1, 2, 3\}A={1,2,3}, then:

    Ac={4,5}A^c = \{4, 5\}Ac={4,5}

    Symmetric Difference of Sets

    The symmetric difference of two sets AAA and BBB is the set of elements that are in either AAA or BBB, but not in both. It is denoted by:

    AΔB=(A−B)∪(B−A)A \Delta B = (A - B) \cup (B - A)AΔB=(A−B)∪(B−A)

    For example, if A={1,2,3}A = \{1, 2, 3\}A={1,2,3} and B={3,4,5}B = \{3, 4, 5\}B={3,4,5}, then:

    AΔB={1,2,4,5}A \Delta B = \{1, 2, 4, 5\}AΔB={1,2,4,5}

    4. Venn Diagrams

    Venn diagrams are often used to visualize set operations. In a Venn diagram, each set is represented by a circle, and the relationships between the sets (such as union, intersection, and difference) are shown by the overlap or separation of the circles.

    • Union: The area covered by both sets (overlapping regions and individual set areas).
    • Intersection: The area where the circles overlap.
    • Difference: The area in one circle that is not in the other.
    • Complement: The area outside the circle (but within the universal set).

    5. Summary of Set Operations

    Operation Symbol Description Example
    Union A∪BA \cup BA∪B All elements in AAA or BBB (or both) {1,2,3}∪{3,4,5}={1,2,3,4,5}\{1, 2, 3\} \cup \{3, 4, 5\} = \{1, 2, 3, 4, 5\}{1,2,3}∪{3,4,5}={1,2,3,4,5}
    Intersection A∩BA \cap BA∩B All elements in both AAA and BBB {1,2,3}∩{3,4,5}={3}\{1, 2, 3\} \cap \{3, 4, 5\} = \{3\}{1,2,3}∩{3,4,5}={3}
    Difference A−BA - BA−B Elements in AAA, but not in BBB {1,2,3}−{3,4,5}={1,2}\{1, 2, 3\} - \{3, 4, 5\} = \{1, 2\}{1,2,3}−{3,4,5}={1,2}
    Complement AcA^cAc Elements in the universal set but not in AAA A={1,2,3},U={1,2,3,4,5},Ac={4,5}A = \{1, 2, 3\}, U = \{1, 2, 3, 4, 5\}, A^c = \{4, 5\}A={1,2,3},U={1,2,3,4,5},Ac={4,5}
    Symmetric Difference AΔBA \Delta BAΔB Elements in AAA or BBB, but not both {1,2,3}Δ{3,4,5}={1,2,4,5}\{1, 2, 3\} \Delta \{3, 4, 5\} = \{1, 2, 4, 5\}{1,2,3}Δ{3,4,5}={1,2,4,5}

    Conclusion

    Understanding set notation and set operations is fundamental for working with sets in mathematics. These operations provide powerful tools for manipulating and reasoning about collections of objects. Whether you're performing algebraic manipulations or applying these operations in logic or computer science, they are critical building blocks in discrete mathematics and related fields.

    Previous topic 17
    Vacuous Proofs
    Next topic 19
    Venn Diagrams

    Past Papers

    Open this section to load past papers

    Click on Show Past Papers to see past papers.
    On This Page
      Reading Stats
      Est. reading time13 min
      Word count2,240
      Code examples0
      DifficultyIntermediate