Scribd
Upload
13 views

Elect1 (Midterm)

The document defines and compares different types of sets including equal vs equivalent sets, universal vs empty sets, finite vs infinite sets, union vs intersection of sets, and disjoint vs subset sets. It then provides examples evaluating sets using operations like union, intersection, difference and complement. Boolean algebra laws are used to determine the truth values of statements involving set operations. A Venn diagram is constructed and a set is defined and verified using a membership table.

Uploaded by

Michael John Unay
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
13 views

Elect1 (Midterm)

The document defines and compares different types of sets including equal vs equivalent sets, universal vs empty sets, finite vs infinite sets, union vs intersection of sets, and disjoint vs subset sets. It then provides examples evaluating sets using operations like union, intersection, difference and complement. Boolean algebra laws are used to determine the truth values of statements involving set operations. A Venn diagram is constructed and a set is defined and verified using a membership table.

Uploaded by

Michael John Unay
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

1) Compare the following sets: (4 points each)

1.1) equal and equivalent sets


Two sets with exactly the same elements are called equal sets. Two sets with the same number of elements
or with the same cardinality are called equivalent sets.

1.2) universal and empty sets


The set containing all the elements under consideration is the universal set. An empty set is a set with no
elements.

1.3) finite and infinite sets


A set with a fixed number of elements is a finite set. A set without a fixed number of elements is an infinite
set.

1.4) union and intersection of sets


The union of two sets is a set containing elements on both sets. The intersection of two sets is a set
containing elements common to both sets.

1.5) disjoint sets and subsets


Consider sets A and B. Sets A and B are disjoint if they do not have common elements. If the intersection
of sets A and B is an empty set, then sets A and B are disjoint sets. Set A is subset of B, if all elements in A
are contained in B.

2) Let 𝑈 = {1, 2, 3, 4, 5, 6, 7, 8, 9}, 𝐴 = {1, 3, 4, 7, 9}, 𝐵 = {2, 3, 6, 8}, 𝐶 = {1, 2, 3, 4, 5},


𝐷 = {6, 7, 8, 9}, and 𝐸 = {1, 4, 9}. For each statement below, determine if true or false. Justify your answer. (3
point each)
2.1) 𝐴 − 𝐷 = 𝐷 − 𝐴 False
𝑨 − 𝑫 = {𝟏, 𝟑, 𝟒}
𝑫 − 𝑨 = {𝟔, 𝟖}
Thus, 𝑨 − 𝑫 ≠ 𝑫 − 𝑨.
2.2) 𝐵 ∩ (𝐶 ∩ 𝐸) = 𝐵 ∩ 𝐷 False
𝑩 ∩ (𝑪 ∩ 𝑬) = {2, 3, 6, 8} ∩ {1, 4} = ∅
𝑩 ∩ 𝑫 = {𝟔, 𝟖}
Thus, 𝑩 ∩ (𝑪 ∩ 𝑬) ≠ 𝑩 ∩ 𝑫.
2.3) (𝐴 − 𝐶) ∪ (𝐴 ′ ∪ 𝐶) = 𝑈 True
(𝑨 − 𝑪) ∪ (𝑨′ ∪ 𝑪) = {𝟕, 𝟗} ∪ [{𝟐, 𝟓, 𝟔, 𝟖} ∪ {𝟏, 𝟐, 𝟑, 𝟒, 𝟓}] = {𝟕, 𝟗} ∪ {𝟏, 𝟐, 𝟑, 𝟒, 𝟓, 𝟔, 𝟖}
= {𝟏, 𝟐, 𝟑, 𝟒, 𝟓, 𝟔, 𝟕, 𝟖, 𝟗} = 𝑼
Thus, (𝑨 − 𝑪) ∪ (𝑨 ′ ∪ 𝑪) = 𝑼.

3) Let 𝑋, 𝑌 and 𝑍 be subsets of 𝑈. Construct a Venn diagram described by the following conditions: (2 points each)
3.1) Sets 𝑋 and 𝑌 are disjoint. Set 𝑍 is a proper subset of 𝑌. There are elements in 𝑈 that do not belong either to
𝑋, 𝑌 or 𝑍.

𝑈
𝑌
𝑋
𝑍
3.2) Set 𝑍 is a proper subset of 𝑋. Sets 𝑋 and 𝑌 have elements in common but they are not a subset of one
another. Sets 𝑌 and 𝑍 have elements in common but they are not a subset of one another. Finally, there are
elements in 𝑈 that do not belong either to 𝑋, 𝑌 or 𝑍.

𝑈
𝑋
𝑍 𝑌

4) Check the three (3) properties satisfying the following Venn diagrams for sets A, B, and C. Each item will have 3
answers. (3 points each)

4.1) 4.3)

4.2) 

 

5) Using the laws of Boolean algebra, determine whether or not the following statements are true. Justify your
answer. (4 points each)
5.1) (𝐴 − 𝐵) ∪ (𝐴 − 𝐶) = 𝐴 − (𝐵 − 𝐶)

(1) (𝐴 − 𝐵) ∪ (𝐴 − 𝐶) Given
(2) (𝐴 ∩ 𝐵′ ) ∪ (𝐴 ∩ 𝐶 ′ ) 1, Difference
(3) 𝐴 ∩ (𝐵′ ∪ 𝐶 ′ ) 2, Distributive
(4) 𝐴 ∩ (𝐵 ∩ 𝐶)′ 3, De Morgan’s law
(5) 𝐴 − (𝐵 ∩ 𝐶) 4, Difference
(6) 𝐴 − (𝐵 − 𝐶 ′ ) 5, Difference
Another solution:
(1) 𝐴 − (𝐵 − 𝐶) Given
(2) 𝐴 ∩ (𝐵 ∩ 𝐶 ′ )′ 1, Difference
(3) 𝐴 ∩ (𝐵′ ∪ 𝐶) 2, De Morgan’s law; Double Complement
(4) (𝐴 ∩ 𝐵′ ) ∪ (𝐴 ∩ 𝐶) 3, Distributive
(5) (𝐴 − 𝐵) ∪ (𝐴 − 𝐶 ′ ) 4, Difference

Thus, (𝐴 − 𝐵) ∪ (𝐴 − 𝐶) = 𝐴 − (𝐵 − 𝐶) is a false statement. That is, (𝐴 − 𝐵) ∪ (𝐴 − 𝐶) ≠ 𝐴 − (𝐵 − 𝐶).

5.2) (𝐶 − 𝐴) − (𝐵 − 𝐴) = 𝐶 − (𝐴 ∪ 𝐵)

(1) (𝐶 − 𝐴) − (𝐵 − 𝐴) Given
(2) (𝐶 ∩ 𝐴′) ∩ (𝐵 ∩ 𝐴′ )′ 1, Difference
(3) (𝐶 ∩ 𝐴′) ∩ (𝐵′ ∪ 𝐴) 2, De Morgan’s law, Double Complement

Another solution:
(1) 𝐶 − (𝐴 ∪ 𝐵) Given
(2) 𝐶 ∩ (𝐴 ∪ 𝐵)′ 1, Difference
(3) 𝐶 ∩ (𝐴′ ∩ 𝐵′ ) 2, De Morgan’s law

Thus, (𝐶 − 𝐴) − (𝐵 − 𝐴) = 𝐶 − (𝐴 ∪ 𝐵) is a false statement. That is, (𝐶 − 𝐴) − (𝐵 − 𝐴) ≠ 𝐶 − (𝐴 ∪ 𝐵).

5.3) 𝐴 ∩ (𝐵 − 𝐶) = (𝐴 ∩ 𝐵) − 𝐶

(1) 𝐴 ∩ (𝐵 − 𝐶) Given
(2) 𝐴 ∩ (𝐵 ∩ 𝐶 ′ ) 1, Difference
(3) (𝐴 ∩ 𝐵) ∩ 𝐶′ 2, Associative
(4) (𝐴 ∩ 𝐵) − 𝐶 3, Difference

Another Solution:
(1) (𝐴 ∩ 𝐵) − 𝐶 Given
(2) (𝐴 ∩ 𝐵) ∩ 𝐶′ 1, Difference
(3) 𝐴 ∩ (𝐵 ∩ 𝐶 ′ ) 2, Associative
(4) 𝐴 ∩ (𝐵 − 𝐶) 3, Difference

Thus, 𝐴 ∩ (𝐵 − 𝐶) = (𝐴 ∩ 𝐵) − 𝐶 is a true statement.

5.4) 𝐴 − (𝐴′ − 𝐵) = 𝐴 ∩ (𝐴 ∪ 𝐵)

(1) 𝐴 − (𝐴′ − 𝐵) Given


(2) 𝐴 ∩ (𝐴′ ∩ 𝐵′ )′ 1, Difference
(3) 𝐴 ∩ (𝐴 ∪ 𝐵) 2, De Morgan’s law; Double Complement

Another solution:
(1) 𝐴 ∩ (𝐴 ∪ 𝐵) Given
(2) 𝐴 − (𝐴 ∪ 𝐵)′ 1, Difference
(3) 𝐴 − (𝐴′ ∩ 𝐵′ ) 2, De Morgan’s law
(4) 𝐴 − (𝐴′ − 𝐵) 3, Difference

Thus, 𝐴 − (𝐴′ − 𝐵) = 𝐴 ∩ (𝐴 ∪ 𝐵) is a true statement.


6) Construct the Venn diagram and shade in the set [(𝐴 ∩ 𝐵) − 𝐶] ∪ [(𝐵 ∩ 𝐶) ∪ 𝐴] and verify the result by the
membership table. (10 points)

𝑈 Let 𝑈 = {1, 2, 3, 4, 5, 6, 7, 8}; 𝐴 = {1, 2, 3, 4}; 𝐵 = {1, 2, 5, 6}, and 𝐶 = {1, 3, 5, 7}


𝐴 𝐵
2 [(𝐴 ∩ 𝐵) − 𝐶] ∪ [(𝐵 ∩ 𝐶) ∪ 𝐴] = {2} ∪ {1, 2, 3, 4, 5} = {1, 2, 3, 4, 5}
4 6
1
3 5
7
𝐶
8

[(𝐴 ∩ 𝐵) − 𝐶] ∪ [(𝐵 ∩ 𝐶) ∪ 𝐴] = [(𝐴 ∩ 𝐵) ∩ 𝐶′] ∪ [(𝐵 ∩ 𝐶) ∪ 𝐴]

[(𝐴 ∩ 𝐵) ∩ 𝐶′] ∪ [(𝐵 ∩ 𝐶] ∪ 𝐴] regions Shaded regions


∈ ∈ ∈ ∉ ∉ ∈ ∈ ∈ ∈ ∈ ∈ 1 1
∈ ∈ ∈ ∈ ∈ ∈ ∈ ∉ ∉ ∈ ∈ 2 2
∈ ∉ ∉ ∉ ∉ ∈ ∉ ∉ ∈ ∈ ∈ 3 3
∈ ∉ ∉ ∉ ∈ ∈ ∉ ∉ ∉ ∈ ∈ 4 4
∉ ∉ ∈ ∉ ∉ ∈ ∈ ∈ ∈ ∈ ∉ 5 5
∉ ∉ ∈ ∉ ∈ ∉ ∈ ∉ ∉ ∉ ∉ 6
∉ ∉ ∉ ∉ ∉ ∉ ∉ ∉ ∈ ∉ ∉ 7
∉ ∉ ∉ ∉ ∈ ∉ ∉ ∉ ∉ ∉ ∉ 8

You might also like