Language of Proof Flashcards

1
Q

2 synonyms for a STATEMENT

A

proposition, premise

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

4 types of statements

A

(1) simple sentence
(2) mathematical declaration
(3) assertion/definition
(4) deduction/claim to be proven

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

a statement’s logical value is…

A

either TRUE or FALSE but not both

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

a proven statement is…

A

a statement shown to be true

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

proof is…

A

the evidence used to establish a proven statement

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

a counterexample is…

A

an example that disproves (falsifies) a statement

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

what does negation do

A

changes a statement’s logical value

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

negation of P is…

A

“not P”

¬P or ~P or P’ or P̄

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

the negation of P and Q

A

not P nor Q
¬(P and Q) = ¬P or ¬Q

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

the negation of P or Q

A

not P and not Q
¬(P or Q) = ¬P and ¬Q

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

the negation of P⟹Q

A

P and ~Q
there exists a case where P and not Q

(the condition that causes P to imply Q no longer exists)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

an implication is…

A

an IF-THEN statement;
a conditional statement

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

the notation for “if P then Q”

A

P⟹Q
“P implies Q”

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

2 other ways to say “if P then Q”

A

(1) P is a SUFFICIENT condition to conclude Q
(2) Q is NECESSARY if P

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

what does a converse statement do

A

reverses the implication

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

the converse of P⟹Q

17
Q

two statements are EQUIVALENT (aka are an equivalence) when…

A

the statement and its converse are both true

18
Q

notation for equivalent statements

A

P⇔Q
P if and only if Q
P iff Q
(and all vice versa)

19
Q

what a contrapositive does

A

(1) negates and (2) swaps both parts of a IF-THEN statement

20
Q

the contrapositive of P⟹Q (if P then Q)

A

¬Q⟹¬P
(if not Q then not P)

21
Q

why original and contrapositive statements are an equivalence

A

if P⟹Q is true, then ¬Q⟹¬P is also true (kind of like two negatives makes one positive)

e.g. If I’m 80 years old then I’ll die ⇔ if I’m not dead then I’m not 80 years old yet

22
Q

abbreviation for “if and only if”

23
Q

what do quantifiers do

A

quantify (put a number on) how many values a variable can take on from a specified set

e.g. x is rational for all x∈R

24
Q

universal quantifier:
(1) meaning
(2) notation

A

(1) “for all” x
(2) ∀x

25
existential quantifier (1) meaning (2) notation
(1) "there exists" x that… (2) ∃x
26
abbreviation for "such that"
s.t. or :
27
RTP means
required to prove
28
QED means
demonstrated as required (quod erat demonstrandum)
29
~∀ =
30
~∃ =
31
translate into words: ∀n∈Z, ∃m∈Z, s.t. (n+m)/5 ∈Z
for all integers n, there exists integer m, such that (n+m) divided by 5 is an integer—aka n+m is a multiple of 5
32
translate into words: ∀x∈A, ∃y∈B s.t. P(x,y)
for all x in set A, there exists y in set B such that (statement P)
33
~[∀x∈A, ∃y∈B s.t. P(x,y)] ⇔
∃x∈A, ∀y∈B s.t. ~P(x,y)
34
translate into words: ∃x∈A, ∀y∈B s.t. ~P(x,y)
there exists x in set A for all y in set B, such that (statement P) is not the case