Working with Sets and Venn Diagrams

Working with Sets and Venn Diagrams

Sets are simply collections of items. A set may contain your favorite even numbers, the days of the week, or the names of your brothers and sisters. The items contained within a set are called elements, and elements in a set do not “repeat”.
The elements of a set are often listed by roster.
A roster is a list of the elements in a set, separated by commas and surrounded by French curly braces.
For information on other methods of describing sets, see Set-Builder and Interval Notation.
Working with Sets and Venn Diagrams 2
The empty set is denoted with the symbol: Ø = { }
The empty set is a subset of every set.

Sets are often represented in pictorial form with a circle containing the elements of the set. Such a depiction is called a Venn Diagram.
A Venn diagram is a drawing, in which circular areas represent groups of items usually sharing common properties. The drawing consists of two or more circles, each representing a specific group or set. This process of visualizing logical relationships was devised by John Venn (1834-1923).

Each Venn diagram begins with a rectangle representing the universal set. Then each set of values in the problem is represented by a circle. Any values that belong to more than one set will be placed in the sections where the circles overlap.
Working with Sets and Venn Diagrams 3
The universal set is often the “type” of values that are solutions to the problem. For example, the universal set could be the set of all integers from -10 to +10, set A the set of positive integers in that universe, set B the set of integers divisible by 5 in that universe, and set C the set of elements -1, – 5, and 6.
If set A is contained within set B, then set A is a subset of set B. All of the elements in set A are also elements of set B.
Notation: A⊆B means A is a subset of B and A may be equal to B (they may be the same set).
A⊂B means A is a proper subset of B (these is at least one element of B which is not in A).
Some authors use the symbol for both “subset” and “proper subset”.
Working with Sets and Venn Diagrams 4
The Venn diagram below shows two sets A and B that overlap. The universal set is U. Values that belong to both set A and set B are located in the center region labeled A ∩ B where the circles overlap. This region is called the “intersection” of the two sets.
Working with Sets and Venn Diagrams 6
(Intersection, is only where the two sets intersect, or overlap.)
Working with Sets and Venn Diagrams 5
The Venn diagram below shows two sets A and B that overlap. The notation A ∪ B represents the entire region covered by both sets A and B (and the section where they overlap). This region is called the “union” of the two sets.
Working with Sets and Venn Diagrams 8
(Union, like marriage, brings all of both sets together.)
Working with Sets and Venn Diagrams 7
The Venn diagram below shows two sets A and B that do not overlap. Sets that do not overlap, are called mutually exclusive.
The union of these two sets is the set of elements that are in set A along with the set of elements that are in set B. Working with Sets and Venn Diagrams 8
( “Union” is the blending of both sets.)
Working with Sets and Venn Diagrams 9
If we cut out sets A and B from the picture above, the remaining region in U, the universal set, is labeled, (A ∪ B)c and is called the complement of the union of sets A and B.
A complement of a set is all of the elements (in the universe) that are NOT in the set.
Working with Sets and Venn Diagrams 10
Working with Sets and Venn Diagrams 11
Example:
Let U (the universal set for this example) = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10}
Let A = {2, 4, 6, 8}
Let B = {1, 2, 3, 4, 5}
A ∪ B = {1, 2, 3, 4, 5, 6, 7, 8} Union – ALL elements in BOTH sets
A ∩ B = {2, 4} Intersection – elements where sets overlap
Ac = {1, 3, 5, 7, 9, 10}Complement – elements NOT in the set
Bc = {6, 7, 8, 9, 10}
** One of the most interesting features of Venn diagrams is the areas or sections where the circles overlap one another — implying that a sharing is occurring.

This ability to represent a “sharing of conditions” makes Venn diagrams useful tools for solving complicated problems. Consider the following example:
Example: Twenty-four dogs are in a kennel. Twelve of the dogs are black, six of the dogs have short tails, and fifteen of the dogs have long hair. There is only one dog that is black with a short tail and long hair. Two of the dogs are black with short tails and do not have long hair. Two of the dogs have short tails and long hair but are not black. If all of the dogs in the kennel have at least one of the mentioned characteristics, how many dogs are black with long hair but do not have short tails?
Solution: Draw a Venn diagram to represent the situation described in the problem.
Represent the number of dogs that you are looking for with x.
Working with Sets and Venn Diagrams 12

  • Notice that the number of dogs in each of the three categories is labeled OUTSIDE of the circle in a colored box. This number is a reminder of the total of the numbers which may appear anywhere inside that particular circle.
  • After you have labeled all of the conditions listed in the problem, use this OUTSIDE box number to help you determine how many dogs are to be labeled in the empty sections of each circle.
  • Once you have EVERY section in the diagram labeled with a number or an expression, you are ready to solve the problem.
  • Add together EVERY section in the diagram and set it equal to the total number of dogs in the kennel (24). Do NOT use the OUTSIDE box numbers.
  • 9 – x + 2 + 1 + 1 + 2 + x + 12 – x = 24
  • 27 – x = 24
  • x = 3 (There are 3 dogs which are black with long hair but do not have a short tail.)

 

Sets and Venn Diagrams

Sets and Venn Diagrams

Set: A set is well defined class or collection of objects.
Sets and Venn Diagrams 1

Venn-Euler diagrams

The combination of rectangles and circles are called Venn-Euler diagrams or simply Venn-diagrams.
Sets and Venn Diagrams 2If A and B are not equal but they have some common elements, then to represent A and B we draw two intersecting circles. Two disjoints sets are represented by two non-intersecting circles.

Operations on sets

  1. Union of sets: Let A and B be two sets. The union of A and B is the set of all elements which are in set A or in B. We denote the union of A and B by A∪B, which is usually read as “A union B”.
    Symbolically, A ∪ B = {x : x ∈ A or x ∈ B}
    Sets and Venn Diagrams 3
  2. Intersection of sets: Let A and B be two sets. The intersection of A and B is the set of all those elements that belong to both A and B.
    The intersection of A and B is denoted by A ∩ B (read as “A intersection B”).
    Thus, A ∩ B = {x : x ∈ A and x ∈ B}.
    Sets and Venn Diagrams 4
  3. Disjoint sets: Two sets A and B are said to be disjoint, if A∩B = ϕ. If A∩B ≠ ϕ, then A and B are said to be non-intersecting or non-overlapping sets.
    Example: Sets {1, 2}; {3, 4} are disjoint sets.
  4. Difference of sets: Let A and B be two sets. The difference of A and B written as A – B, is the set of all those elements of A which do not belong to B.
    Sets and Venn Diagrams 5
    Thus, A – B = {x : x ∈ A and x ∉ B}
    Similarly, the difference B – A is the set of all those elements of B that do not belong to A i.e., B – A = {x ∈ B : and x ∉ A}.
    Example: Consider the sets A = {1, 2, 3} and B = {3, 4, 5} then A – B = {1, 2} and B – A = {4, 5}.
  5. Symmetric difference of two sets: Let A and B be two sets. The symmetric difference of sets A and B is the set (A – B) ∪ (B – A) and is denoted by A ∆ B. Thus, A ∆ B = (A – B) ∪ (B – A) = {x : x ∉ A∩B}.
  6. Complement of a set: Let U be the universal set and let A be a set such that A ⊂ U. Then, the complement of A with respect to U is denoted by A or Ac or C(A) or U – A and is defined the set of all those elements of U which are not in A.
    Sets and Venn Diagrams 6
    Thus, A = {x ∈ U : x ∉ A}.
    Clearly, x ∈ A ⇔ x ∉ A
    Example : Consider U = {1, 2, …… 10}
    and A = {1, 3, 5, 7, 9}.
    Then A = {2, 4, 6, 8, 10}

https://www.youtube.com/watch?v=_YpK82_mjns

Some important results on number of elements in sets

If A, B and C are finite sets and U be the finite universal set, then

  1. n(A ∪ B) = n(A) + n(B) – n(A ∩ B)
  2. n(A ∪ B) = n(A) + n(B) ⇔ A, B are disjoint non-void sets.
  3. n(A – B) = n(A) – n(A ∩ B) i.e., n(A – B) + n(A ∩ B) = n(A)
  4. n(A ∆ B) = Number of elements which belong to exactly one of A or B = n((A – B) ∪ (B – A)) = n (A – B) + n(B – A)     [∵ (A – B) and (B – A) are disjoint]
    = n(A) – n(A ∩ B) + n(B) – n(A ∩ B) = n(A) + n(B) – 2n(A ∩ B)
  5. n(A ∪ B ∪ C) = n(A) + n(B) + n(C) – n(A ∩ B) – n(B ∩ C) – n(A ∩ C) + n(A ∩ B ∩ C)
  6. n (Number of elements in exactly two of the sets A, B, C) = n(A ∩ B) + n(B ∩ C) + n(C ∩ A) – 3n(A ∩ B ∩ C)
  7. n(Number of elements in exactly one of the sets A, B, C) = n(A) + n(B) + n(C) – 2n(A ∩ B) – 2n(B ∩ C) – 2n(A∩ C) + 3n(A ∩ B ∩ C)
  8. n(A ∪ B) = n(A ∩ B) = n(U) – n(A ∩ B)
  9. n(A ∩ B) = n(A ∪ B) = n(U) – n(A ∪ B)

Laws of algebra of sets

(1) Idempotent laws: For any set A, we have

  1. A ∪ A = A
  2. A ∩ A = A

(2) Identity laws: For any set A, we have

  1. A ∪ ϕ = A
  2. A ∩ U = A
    i.e., ϕ and U are identity elements for union and intersection respectively.

(3) Commutative laws: For any two sets A and B, we have

  1. A ∪ B = B ∪ A
  2. A ∩ B = B ∩ A
  3. A ∆ B = B ∆ A
    i.e., union, intersection and symmetric difference of two sets are commutative.
  4. (A – B) ≠ (B – A)
  5. (A × B) ≠ (B × A)
    i.e., difference and cartesian product of two sets are not commutative

(4) Associative laws: If A, B and C are any three sets, then

  1. (A ∪ B) ∪ C = A ∪ (B ∪ C)
  2. A ∩ (B ∩ C) = (A ∩ B) ∩ C
  3. (A ∆ B)∆C = A∆(B ∆ C)
    i.e., union, intersection and symmetric difference of two sets are associative.
  4. (A – B) – C ≠ A – (B – C)
  5. (A × B) × C ≠ A × (B × C)
    i.e., difference and cartesian product of two sets are not associative.

(5) Distributive law: If A, B and C are any three sets, then

  1. A ∪ (B ∩ C) = (A ∪ B) ∩ (A ∪ C)
  2. A ∩ (B ∪ C) = (A ∩ B) ∪ (A ∩ C)
    i.e., union and intersection are distributive over intersection and union respectively.
  3. A × (B ∩ C) = (A × B) ∩ (A × C)
  4. A × (B ∪ C) = (A × B) ∪ (A × C)
  5. A × (B – C) = (A × B) – (A × C)

(6) De-Morgan’s law: If A, B and C are any three sets, then

  1. (A ∪ B) = A ∩ B
  2. (A ∩ B) = A ∪ B
  3. A – (B ∩ C) = (A – B) ∪ (A – C)
  4. A – (B ∪ C) = (A – B) ∩ (A – C)

(7) If A and B are any two sets, then

  1. A – B = A ∩ B
  2. B – A = B ∩ A
  3. A – B = A ⇔ A ∩ B = ϕ
  4. (A – B) ∪ B = A ∪ B
  5. (A – B) ∩ B = ϕ
  6. A ⊆ B ⇔ B ⊆ A
  7. (A – B) ∪ (B – A) = (A ∪ B) – (A ∩ B)

(8) If A, B and C are any three sets, then

  1. A ∩ (B – C) = (A ∩ B) – (A ∩ C)
  2. A ∩ (B ∆ C) = (A ∩ B) ∆ (A ∩ C)