Chapter 5 Flashcards
Suppose A, B, and C are sets; set containment is… (give 2 answers) [proposition]
- set containment is reflexive
A ⊆ A - set containment is transitive
if A ⊆ B and B ⊆ C, then A ⊆ C
Suppose A, B, and C are sets; state the 3 characteristics of set equality [proposition]
- set equality is reflexive
A = A - set eqaulity is symmetric
if A = B, then B = A - set equality is transitive
if A = B and B = C, then A = C
the empty set [definition / notation]
The empty set, denoted ∅, is the set with no elements. That is, it is the set such that x ∈ ∅ is never true, no matter what x is.
state the proposition that says that there is only one empty set [proposition]
Suppose ∅1 and ∅2 have the property that x ∈ ∅1 is never true
andx ∈ ∅2 is never true.
Then ∅1 = ∅2.
intersection of two sets A and B [definition / notation]
A ∩ B = {x : x ∈ A and x ∈ B}
or
(x ∈ A ∩ B) ⇐⇒ (x ∈ A and x ∈ B)
If A ∩ B = ∅, we say that A and B are… [terminology]
If A ∩ B = ∅, we say that A and B are disjoint.
union of 2 sets A and B [definition / notation]
A ∪ B = {x : x ∈ A or x ∈ B}
or
(x ∈ A ∪ B) ⇐⇒ (x ∈ A or x ∈ B)
If A and B are sets, then their set difference is…
[definition / notation]
A − B = {x: x ∈ A and x ∉ B}
or
A \ B = {x: x ∈ A and x ∉ B}
If A and B are sets, then their symmetric difference is…
[definition / notation]
A∆B = (A − B) ∪ (B − A)
Suppose A, B ⊆ X ; then A ⊆ B ⇔ []C ⊆ []C
[proposition]
A ⊆ B ⇔ BC⊆ AC
De Morgan’s laws (2) [theorem]
- (A ∩ B)C = AC ∪ BC
- (A ∪ B)C = AC ∩ BC
Suppose A, B, and C are sets; then
C ∩ (A ∪ B) = ?
[proposition]
C ∩ (A ∪ B) = (C ∩ A) ∪ (C ∩ B)
Suppose A, B, and C are sets; then
C ∪ (A ∩ B) = ?
[proposition]
C ∪ (A ∩ B) = (C ∪ A) ∩ (C ∪ B)
Suppose A and B are sets; the cartesian product of A and B is defined… [definition / notation]
A × B := {(a, b): a ∈ A, b ∈ B}
where (a,b) is an ordered pair, NOT a set
Equality of ordered pairs is given by… [definition]
(a, b) = (c, d) ⇐⇒ a = c and b = d
Thus (a, b) = (b, a) if and only if a = b .
If A and B are nonempty sets such that A ̸= B, then… [proposition]
If A and B are nonempty sets such that A ≠ B,
then A × B ≠ B × A .
Let A, B, and C be sets.
A × (B ∪ C) = ?
A × (B ∩ C) = ?
[proposition]
A × (B ∪ C) = (A × B) ∪ (A × C)
and
A × (B ∩ C) = (A × B) ∩ (A × C)
A function consists of… (3 points) and is denoted…
[definition / notation]
- a set A called the domain of the function
- a set B called the codomain of the function
- a “rule” f that “assigns” to each a ∈ A an element f(a) ∈ B.
We denote such a function f : A → B
definition of a function [definition]
A function with domain A and codomain B is a subset Γ of A × B such that for each a ∈ A, there is one and only one b ∈ B, such that (a, b) ∈ Γ. If (a, b) ∈ Γ, we write b = f(a).