Scribd
Upload
27 views3 pages

121Lab5Soln PDF

This document contains solutions to problems from MA121 Lab 5 - Quiz on sets and functions. For the first problem, it shows that statement (ii) is not an identity by providing a counterexample, and that statement (i) is an identity by giving a proof. For the second problem, it uses the principle of duality to determine that another statement is not an identity. The third problem contains proofs regarding sets, functions, and their properties.

Uploaded by

Ana Winter
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
27 views3 pages

121Lab5Soln PDF

This document contains solutions to problems from MA121 Lab 5 - Quiz on sets and functions. For the first problem, it shows that statement (ii) is not an identity by providing a counterexample, and that statement (i) is an identity by giving a proof. For the second problem, it uses the principle of duality to determine that another statement is not an identity. The third problem contains proofs regarding sets, functions, and their properties.

Uploaded by

Ana Winter
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

MA121 Lab 5 - Quiz Winter 2021

1. [7 marks] Consider the sets A, B and C from the same universal set and the two equations below:
i) (A ∪ B) ∩ C = (A ∩ C) ∪ (B ∩ C)
ii) (A ∩ B) ∩ C = (A ∩ C) ∪ (B ∩ C) .

(a) Either equation (i) or (ii) is not an identity. State which one and use a counterexample to disprove it.

Statement (ii) is not an identity.

Answers will vary.


Let A = {1, 2}, B = ∅ and C = {1},
then LS = ∅ and RS = {1} so LS 6= RS.

(b) Either equation (i) or (ii) is an identity. State which one and provide a proof.

Statement (i) is an identity.

Proof: We need to show x ∈ (A ∪ B) ∩ C ⇐⇒ x ∈ (A ∩ C) ∪ (B ∩ C).

x ∈ (A ∪ B) ∩ C
⇐⇒ x ∈ A ∪ B and x ∈ C
⇐⇒ (x ∈ A or x ∈ B) and x ∈ C
⇐⇒ (x ∈ A and x ∈ C) or (x ∈ B and x ∈ C)
⇐⇒ x ∈ A ∩ C or x ∈ B ∩ C
⇐⇒ x ∈ (A ∩ C) ∪ (B ∩ C)


(c) Without doing any further work, and making reference to the principle of duality, determine if
(A ∪ B) ∪ C = (A ∪ C) ∩ (B ∪ C) is an identity. Briefly explain.

Since (A ∪ B) ∪ C = (A ∪ C) ∩ (B ∪ C) is the dual to (A ∩ B) ∩ C = (A ∩ C) ∪ (B ∩ C), equation (ii),


it also can’t hold true.

This study source was downloaded by 100000831960167 from CourseHero.com on 02-16-2024 08:50:45 GMT -06:00
7
Lab Grade:
7
https://www.coursehero.com/file/136827996/121Lab5Solnpdf/
MA121 5 Tutorial:

1. Four additional lines were accidentally inserted into the “proof” of the statement that, as subsets of the product set U × V :
(A × B) ∪ (A × C) = A × (B ∪ C).
Create a complete and accurate proof for the statement by rewriting the proof with the extra lines removed.

A × (B ∪ C)
= {(x, y) : (x ∈ A) × (y ∈ B ∪ C)}
= {(x, y) : x ∈ A and y ∈ B ∪ C}
= {(x, y) : x ∈ A and (y ∈ B or y ∈ C)}
= {(x, y) : (x, y ∈ A ∩ B) ∪ (x, y ∈ A ∩ C)}
= {(x, y) : (x, y ∈ A and B) or (x, y ∈ A and C)}
= {(x, y) : (x ∈ A and y ∈ B) or (x ∈ A and y ∈ C)}
= {(x, y) : (x, y) ∈ A × B or (x, y) ∈ A × C}
= {(x, y) : ((x, y) ∈ A × B) ∪ ((x, y) ∈ A × C)}
= (A × B) ∪ (A × C)

2. Denote by P(X) the power set of the set X. Prove the statement:
A ⊆ B if and only if P(A) ⊆ P(B), for sets A and B.

Proof:

Proving the forward direction (⇒).


Assume A ⊆ B.
For every S ∈ P(A), S ⊆ A ⊆ B.
From S ⊆ B it follows that S ∈ P(B).
Thus P(A) ⊆ P(B).

Proving the backwards direction (⇐).


Assume P(A) ⊆ P(B).
For the set A, A ⊆ A.
Hence, A ∈ P(A), and by the assumption A ∈ P(B).
By the definition of a power set A ⊆ B.

3. Given a function f : S → T , where S and T are sets. Let x ∈ S and y ∈ S be the variables for the following predicate
statements in propositional logic:
p(x, y) : f (x) = f (y); q(x, y) : x = y.

(a) Write the statement in propositional logic that is implied directly by the following mathematical statement:
for every x, y ∈ S, if f (x) = f (y) then x = y.

∀x∀y[p(x, y) → q(x, y) ]

(b) Write the negation of the logical statement in part (a) and simplify it until the connectives inside the brackets
are ∼ and ∧ only, each appearing once.

∼ ( ∀x∀y [p(x, y) → q(x, y)] )

⇐⇒ ∃x∃y [∼ (p(x, y) → q(x, y))]

⇐⇒ ∃x∃y [∼ (∼ p(x, y) ∨ q(x, y))]

⇐⇒ by∃x∃y
This study source was downloaded [p(x, y)∧ ∼
100000831960167 from CourseHero.com
q(x, y)] on 02-16-2024 08:50:45 GMT -06:00

https://www.coursehero.com/file/136827996/121Lab5Solnpdf/
(c) Write a mathematical statement that is implied directly by the final logical statement in your answer of part
(b).

There exist x, y ∈ S such that f (x) = f (y) and x 6= y.

(d) The statement:


for every x, y ∈ S, if f (x) = f (y) then x = y
for a function f : S → T is the definition for

(i) a one-to-one function. (ii) an onto function. (iii) neither a one-to-one nor an onto function.

Circle your answer.

This study source was downloaded by 100000831960167 from CourseHero.com on 02-16-2024 08:50:45 GMT -06:00

https://www.coursehero.com/file/136827996/121Lab5Solnpdf/
Powered by TCPDF (www.tcpdf.org)

You might also like