and algebraic properties of sets are key concepts in set theory. They provide rules for manipulating sets and their complements, helping us simplify complex set expressions.

These laws and properties form the foundation for solving set problems. Understanding them allows us to work with sets more efficiently, making it easier to analyze relationships between different sets and perform set operations.

De Morgan's Laws and Complement Laws

De Morgan's Laws for Set Operations

Top images from around the web for De Morgan's Laws for Set Operations
Top images from around the web for De Morgan's Laws for Set Operations
  • First law: The complement of the of two sets AA and BB is equal to the of their complements: AB=AB\overline{A \cup B} = \overline{A} \cap \overline{B}
  • Second law: The complement of the intersection of two sets AA and BB is equal to the union of their complements: AB=AB\overline{A \cap B} = \overline{A} \cup \overline{B}
  • Generalization: De Morgan's laws can be extended to any finite number of sets
  • Example: Let A={1,2,3}A = \{1, 2, 3\} and B={2,3,4}B = \{2, 3, 4\}. Then AB={1,2,3,4}={5,6,7,...}\overline{A \cup B} = \overline{\{1, 2, 3, 4\}} = \{5, 6, 7, ...\} and AB={5,6,7,...}{1,5,6,7,...}={5,6,7,...}\overline{A} \cap \overline{B} = \{5, 6, 7, ...\} \cap \{1, 5, 6, 7, ...\} = \{5, 6, 7, ...\}

Complement Laws for Sets

  • : The complement of the AA is the set itself: A=A\overline{\overline{A}} = A
  • : The union of a set AA and its complement A\overline{A} is the universal set [U](https://www.fiveableKeyTerm:u)[U](https://www.fiveableKeyTerm:u): AA=UA \cup \overline{A} = U
  • : The intersection of a set AA and its complement A\overline{A} is the \emptyset: AA=A \cap \overline{A} = \emptyset
  • Example: Let U={1,2,3,4,5}U = \{1, 2, 3, 4, 5\} and A={1,2,3}A = \{1, 2, 3\}. Then A={4,5}\overline{A} = \{4, 5\}, A={1,2,3}\overline{\overline{A}} = \{1, 2, 3\}, AA={1,2,3,4,5}A \cup \overline{A} = \{1, 2, 3, 4, 5\}, and AA=A \cap \overline{A} = \emptyset

Commutative, Associative, and Distributive Properties

Commutative Properties of Union and Intersection

  • Union: The union of sets AA and BB is the same as the union of sets BB and AA: AB=BAA \cup B = B \cup A
  • Intersection: The intersection of sets AA and BB is the same as the intersection of sets BB and AA: AB=BAA \cap B = B \cap A
  • Order independence: The order of the sets in a union or intersection operation does not affect the result
  • Example: Let A={1,2,3}A = \{1, 2, 3\} and B={2,3,4}B = \{2, 3, 4\}. Then AB={1,2,3,4}=BAA \cup B = \{1, 2, 3, 4\} = B \cup A and AB={2,3}=BAA \cap B = \{2, 3\} = B \cap A

Associative Properties of Union and Intersection

  • Union: The union of sets AA, BB, and CC can be performed in any order: (AB)C=A(BC)(A \cup B) \cup C = A \cup (B \cup C)
  • Intersection: The intersection of sets AA, BB, and CC can be performed in any order: (AB)C=A(BC)(A \cap B) \cap C = A \cap (B \cap C)
  • Grouping independence: The grouping of sets in a union or intersection operation does not affect the result
  • Example: Let A={1,2}A = \{1, 2\}, B={2,3}B = \{2, 3\}, and C={3,4}C = \{3, 4\}. Then (AB)C={1,2,3}{3,4}={1,2,3,4}=A(BC)(A \cup B) \cup C = \{1, 2, 3\} \cup \{3, 4\} = \{1, 2, 3, 4\} = A \cup (B \cup C) and (AB)C={2}{3,4}==A(BC)(A \cap B) \cap C = \{2\} \cap \{3, 4\} = \emptyset = A \cap (B \cap C)

Distributive Properties of Union and Intersection

  • Union over intersection: The union of a set AA with the intersection of sets BB and CC is equal to the intersection of the unions of AA with BB and AA with CC: A(BC)=(AB)(AC)A \cup (B \cap C) = (A \cup B) \cap (A \cup C)
  • Intersection over union: The intersection of a set AA with the union of sets BB and CC is equal to the union of the intersections of AA with BB and AA with CC: A(BC)=(AB)(AC)A \cap (B \cup C) = (A \cap B) \cup (A \cap C)
  • Distribution of operations: Union distributes over intersection and intersection distributes over union
  • Example: Let A={1,2}A = \{1, 2\}, B={2,3}B = \{2, 3\}, and C={3,4}C = \{3, 4\}. Then A(BC)={1,2}{3}={1,2,3}=({1,2}{2,3})({1,2}{3,4})=(AB)(AC)A \cup (B \cap C) = \{1, 2\} \cup \{3\} = \{1, 2, 3\} = (\{1, 2\} \cup \{2, 3\}) \cap (\{1, 2\} \cup \{3, 4\}) = (A \cup B) \cap (A \cup C) and A(BC)={1,2}{2,3,4}={2}=({1,2}{2,3})({1,2}{3,4})=(AB)(AC)A \cap (B \cup C) = \{1, 2\} \cap \{2, 3, 4\} = \{2\} = (\{1, 2\} \cap \{2, 3\}) \cup (\{1, 2\} \cap \{3, 4\}) = (A \cap B) \cup (A \cap C)

Identity, Idempotent, and Absorption Properties

Identity Properties of Union and Intersection

  • Union with the empty set: The union of any set AA with the empty set \emptyset is the set AA itself: A=AA \cup \emptyset = A
  • Intersection with the universal set: The intersection of any set AA with the universal set UU is the set AA itself: AU=AA \cap U = A
  • Identity elements: The empty set is the identity element for union, and the universal set is the identity element for intersection
  • Example: Let A={1,2,3}A = \{1, 2, 3\}, ={}\emptyset = \{\}, and U={1,2,3,4,5}U = \{1, 2, 3, 4, 5\}. Then A={1,2,3}{}={1,2,3}=AA \cup \emptyset = \{1, 2, 3\} \cup \{\} = \{1, 2, 3\} = A and AU={1,2,3}{1,2,3,4,5}={1,2,3}=AA \cap U = \{1, 2, 3\} \cap \{1, 2, 3, 4, 5\} = \{1, 2, 3\} = A

Idempotent Properties of Union and Intersection

  • Union: The union of a set AA with itself is the set AA: AA=AA \cup A = A
  • Intersection: The intersection of a set AA with itself is the set AA: AA=AA \cap A = A
  • Redundancy: Performing a union or intersection operation on a set with itself does not change the set
  • Example: Let A={1,2,3}A = \{1, 2, 3\}. Then AA={1,2,3}{1,2,3}={1,2,3}=AA \cup A = \{1, 2, 3\} \cup \{1, 2, 3\} = \{1, 2, 3\} = A and AA={1,2,3}{1,2,3}={1,2,3}=AA \cap A = \{1, 2, 3\} \cap \{1, 2, 3\} = \{1, 2, 3\} = A

Absorption Properties of Union and Intersection

  • Union: The union of a set AA with the intersection of AA and another set BB is the set AA: A(AB)=AA \cup (A \cap B) = A
  • Intersection: The intersection of a set AA with the union of AA and another set BB is the set AA: A(AB)=AA \cap (A \cup B) = A
  • Absorption of operations: A set absorbs the result of an intersection or union operation with itself and another set
  • Example: Let A={1,2,3}A = \{1, 2, 3\} and B={2,3,4}B = \{2, 3, 4\}. Then A(AB)={1,2,3}{2,3}={1,2,3}=AA \cup (A \cap B) = \{1, 2, 3\} \cup \{2, 3\} = \{1, 2, 3\} = A and A(AB)={1,2,3}{1,2,3,4}={1,2,3}=AA \cap (A \cup B) = \{1, 2, 3\} \cap \{1, 2, 3, 4\} = \{1, 2, 3\} = A

Key Terms to Review (25)

¬(a ∩ b): ¬(a ∩ b) represents the complement of the intersection of sets a and b, meaning it includes all elements that are not in both a and b simultaneously. This concept is essential in understanding how sets interact with each other, particularly through De Morgan's laws, which provide a way to express the relationship between unions and intersections. It illustrates how negation affects the relationships of sets, emphasizing the distinction between what is included and excluded within set operations.
¬(a ∪ b): The expression ¬(a ∪ b) represents the complement of the union of two sets a and b. This means it includes all elements that are not in either set a or set b. Understanding this concept is crucial as it directly relates to De Morgan's laws, which provide essential rules for working with complements and unions in set theory.
¬a: The symbol ¬a represents the negation of a statement 'a', indicating the opposite truth value of 'a'. In set theory, it is often used to denote that an element does not belong to a particular set. Understanding this concept is crucial when applying De Morgan's laws, which relate the union and intersection of sets through negation.
A ∩ b: The symbol 'a ∩ b' represents the intersection of two sets, a and b, meaning it includes all elements that are common to both sets. This concept is essential in understanding how sets interact with each other through operations like union, complement, and specifically intersection. When two sets intersect, the resulting set consists of shared elements, which plays a critical role in various mathematical principles and laws, including De Morgan's laws.
A ∪ b: The expression 'a ∪ b' represents the union of two sets, a and b, which consists of all elements that are in either set a, set b, or in both. This operation is fundamental in set theory, as it allows the combination of multiple sets into one, highlighting how elements can be shared or unique across different sets. Understanding the union operation also ties into other key concepts such as intersection and complement, as these operations help to define relationships between sets.
Absorption properties: Absorption properties refer to specific rules in set theory that describe how certain operations on sets interact with each other. These properties state that a set combined with the union or intersection of itself and another set yields the original set, which emphasizes the inherent relationships between sets. Understanding these properties is essential as they simplify expressions and facilitate proofs within set algebra.
Associative properties: Associative properties refer to the rules that dictate how operations are grouped when performing mathematical calculations, particularly in relation to addition and multiplication. These properties state that the way numbers are grouped does not change their sum or product, which allows for flexibility in computation. In the context of sets, these properties play a crucial role in understanding how unions and intersections can be rearranged without affecting the outcome.
Commutative Properties: Commutative properties refer to the mathematical rules that state the order of operations does not affect the outcome when combining certain operations, specifically addition and union in the context of sets. This concept highlights that changing the order of operands yields the same result, showcasing the flexibility and consistency of these operations in set theory and algebra.
Complement Law: The complement law in set theory states that the union of a set and its complement equals the universal set, while the intersection of a set and its complement equals the empty set. This law highlights the fundamental relationship between a set and everything outside it, showing how these two concepts interact. Understanding this law is crucial for grasping other algebraic properties of sets, especially when applying De Morgan's laws.
Complement of a set: The complement of a set refers to all the elements in a universal set that are not included in the specified set. This concept is crucial in understanding the relationships between sets and is often used in conjunction with other set operations, such as unions and intersections. The complement can help clarify boundaries of sets and is essential for applying De Morgan's laws, which describe how complements interact with unions and intersections.
De Morgan's Laws: De Morgan's Laws are fundamental rules in set theory that describe the relationship between union and intersection of sets through complements. These laws state that the complement of the union of two sets is equal to the intersection of their complements, and conversely, the complement of the intersection of two sets is equal to the union of their complements. This principle helps in understanding how to manipulate and visualize sets, especially in relation to power sets, universal sets, finite sets, and their properties.
Distributive properties: Distributive properties refer to the fundamental algebraic rules that describe how operations distribute over each other, specifically in the context of sets. This means when you take the union or intersection of sets, you can distribute these operations across one another, leading to equivalent expressions. This property is crucial for simplifying expressions and proving relationships between different set operations, particularly when working with De Morgan's laws and the algebraic properties of sets.
Empty set: The empty set is a unique set that contains no elements, represented by the symbols ∅ or {}. It serves as a fundamental concept in set theory, highlighting the idea that a set can exist without containing any objects, and connects to various principles like membership and operations involving sets.
Idempotent Law: The idempotent law states that for any set A, the union of A with itself is equal to A, and the intersection of A with itself is also equal to A. This property illustrates how performing the same operation on a set does not change its outcome, reinforcing the concept of consistency within set operations and contributing to the algebraic properties of sets, including those highlighted by De Morgan's laws.
Identity Properties: Identity properties refer to specific characteristics of operations in set theory that indicate how certain sets interact with elements under union and intersection. In this context, the identity property states that for any set A, the union of A with the empty set results in A itself (A ∪ ∅ = A), while the intersection of A with the universal set results in A as well (A ∩ U = A). These properties highlight fundamental relationships between sets and their operations.
Intersection: The intersection of two sets is the set containing all elements that are common to both sets. It highlights shared elements and is fundamental in understanding relationships between sets, particularly in operations involving unions, complements, and the visualization of sets using diagrams.
Law of double complement: The law of double complement states that the complement of the complement of a set returns the original set. In mathematical notation, this can be expressed as $$A'' = A$$, where $$A$$ is any set and $$A''$$ is its double complement. This law highlights a fundamental property of sets and complements, showcasing how applying the complement operation twice essentially cancels itself out.
Law of the empty set: The law of the empty set states that the empty set, denoted as \( \emptyset \), is a subset of every set and that its union with any set yields that same set. This principle is fundamental in understanding set relationships and operations, particularly within the framework of algebraic properties of sets and De Morgan's laws. It emphasizes how the empty set interacts with other sets, reinforcing the concept that operations involving the empty set will not change the properties of other sets.
Law of the Universe: The law of the universe in set theory refers to the concept that a set and its universal set combine all possible elements within a particular context. This law underlines the relationship between sets, particularly when it comes to operations like union and intersection, and emphasizes the idea that every element is either part of a set or not, establishing a clear boundary between inclusion and exclusion.
Negation of Intersections: The negation of intersections refers to the logical operation that describes the complement of the intersection of two or more sets. This concept highlights that if you take the intersection of sets A and B, the negation expresses all elements that are not in this intersection, which is equivalent to the union of the complements of those sets. It emphasizes how intersections and their negations can be transformed using fundamental set operations and laws.
Negation of Unions: The negation of unions refers to the concept in set theory where the complement of the union of two or more sets is equal to the intersection of their complements. This is formally expressed as $$ eg(A igcup B) = eg A igcap eg B$$. Understanding this relationship highlights the interplay between union and intersection operations in set algebra and is central to De Morgan's laws.
Subset: A subset is a set where every element of that set is also contained within another set. Understanding subsets is crucial because they form the basis for defining relationships between sets, including set membership, unions, intersections, and various operations performed on sets.
Superset: A superset is a set that contains all elements of another set, meaning if set A is a superset of set B, then every element of B is also an element of A. Understanding superset relationships helps clarify concepts like membership and subset relations, as well as the interactions between sets through operations like union and intersection. Recognizing supersets also plays a crucial role in visualizing relationships using Venn diagrams and grasping the nature of cardinal numbers when comparing sizes of sets.
U: In set theory, the symbol 'u' often represents the union of two or more sets, indicating all elements that are in any of the sets being considered. This concept is fundamental in understanding how sets interact and combine to form new sets, highlighting the inclusiveness of set operations. The union operation is critical for applying De Morgan's laws and exploring algebraic properties related to sets, as it allows for the merging of different elements into a single comprehensive set.
Union: In set theory, the union of two or more sets is the set that contains all the elements from those sets, combining them without duplicates. Understanding union is essential as it relates to concepts like membership and subsets, as well as operations like intersection and complement.
© 2024 Fiveable Inc. All rights reserved.
AP® and SAT® are trademarks registered by the College Board, which is not affiliated with, and does not endorse this website.