Set Questions 260118
Set Questions 260118
(a) {2} ∈ A
(b) {1, 2} $ A
(c) {2, {1, 2}} ⊆ A
(d) ∅ ∈ A
(e) A ∩ P(A) = ∅
2. Answer each question true or false, and briefly explain your reasoning.
3. Let A and B be sets. Prove that any two of the following statements
are (logically) equivalent.
(a) A ⊆ B
(b) A ∪ B = B
(c) A ∩ B = A
(d) A \ B = ∅
(e) A ⊕ B ⊆ B
(f) B c ⊆ Ac
(a) x ∈ A.
(b) {∅} ⊆ A.
(c) B ⊆ A.
(d) 1 ∈ B ∩ A.
13. Prove the same statement as in the previous question by showing LHS
⊆ RHS and RHS ⊆ LHS.
14. Prove or disprove: For all sets A, B and C, (A\B) ∪ (B\C) = A\C.
(a) using the Associative Law to inset brackets and then DeMorgan’s
Law;
(b) Showing LHS ⊆ RHS and RHS ⊆ LHS;
(c) using set-builder notation and showing the LHS and RHS are de-
fined by logically equivalent expressions
17. Let A and B be sets. Prove that the following statements are all
(logically) equivalent.
(a) A = B
(b) A ⊆ B and B ⊆ A
(c) A \ B = B \ A
(d) A ⊕ B = ∅
(e) A ∩ B = A ∪ B
(f) Ac = B c
19. Repeat the previous question but use the Laws of Set Theory instead
of set-builder notation.
(C \ A) ∩ (B \ A) = ∅.
by using set-builder notation and using the fact that the hypothesis
corresponds to the logical implication that for any x, (x ∈ B) ∧ (x ∈
C) ⇒ (x ∈ A).
21. Repeat the previous question but use the Laws of Set Theory instead
of set-builder notation.
(a) contain z;
(b) do not contain a, e, i, o, u;
(c) are such that {w, x, y} ⊂ T ;
(d) contain a and b but not c;
(e) contain m or do not contain n;
(f) contain at least one of p, q, r;
(g) are such that {f, g, h} 6⊆ T .