Discrete Structures Week 5 Flashcards
Theorem of Induction
given a predicate P(n), domain n >= 0 then if
p(0) = T
For all K, p(K) -> p(k+1)
then p(n) = T for all n >= 0
Steps for Induction Professor way
find base
(rhs and lhs are equal)
show p(k) -> p(k+1)
assume P(k) = T
do p(k+1)
staring turning the lhs of p(k+1) into rhs of p(k+1)
make rhs look like rhs of the claim
steps for induction TA way
prove base case
state inductive hypothesis
for induction we may assume p(n-1) is true that is we may assume
plug into n
inductive step to show p(n) convert p(n-1) into p(n) by manipulating
set
an unordered list of elements without repetitions
set of all integers
Z
set of all natural numbers
N
set of rational numbers
Q
{x E U | p(x)}
for any x contained in domain U, P(x) is true
look at examples on notes lecture 12 for more of set examples
:)
subset
we say set A is a subset of set B if every element of A is also an element of B
A c_ B
A is contained in B
A = B
A c_ B
B c_ A
definition of tautology in sets
given set A in U, define Pa(x) = “x C- A”
U = the set for which Pu(x) is a tautology
empty set
set for which Po/(x) is a contradiction V-x, Po/(x) = F
how to prove on notes
theorem for empty set
For any set S, o/ c_ S and Sc_ S
proof in notes