Discrete Structures Week 6 Quiz 2 Flashcards
definition of set
an unordered list of elements without repetitions
set of S
S = { x C- DOMAIN/SET | P(x) }
for any x in DOMAIN/SET such that P(x) is true
subset
A c_ B
A is a subset of B if every element of A is also an element of B
empty set and S
empty set - set for which Po/(x) is a contradiction (always false)
V- x, Po/(x) = F
theorem
for any set S, empty c_S and S c_ S
- S c_ S
- we need to show that if V- x, x C- S then x C- S is always true so S c_ S - empty c_ S
-want to show if x C- empty, then x C- S, in other words V- x, the conditional
x C- empty –> x C- S is vacuously true
induction
P(n), n >= 1, n C- DOMAIN
- P(1 or base case) = T
- P(k) -> P(k+1), k >= 1, k C- DOMAIN
then P(n) = T, V-n >= 1, n C- DOMAIN
venn diagrams and operation of sets
intersection
A n B
= {x C- U | P(x) ^ Q(x) }
union
A u B
={x C- U | P(x) v Q(x)}
compliment
A^c = A - (bar on top)
= {x C- U | !P(x)}
disjoint
A n B = o/ empty set
symbols for set of integers, natural numbers, and rational numbers, and real numbers
set of integers = Z
-numbers positive and negative whole numbers
set of all natural numbers = N
1 to inf
set of rational numbers = Q
- decimals and fractions
set of all real numbers = N
- everything
natural numbers c_ whole numbers c_ integers c_ rational numbers c_ real numbers
when two sets are equal
A = B iff P(x) = (3 lines_ Q(x), V- x C- U
P iff Q, P-> Q and Q-> P
symmetric difference
Xor
o with + inside
A Xor B
= {x C- U | P(x) Xor Q(X)}
= (A \ B) U (B \ A)
set difference
A \ B
= {x C- U | P(x) ^ !Q(x)}