Introduction to Proofs Flashcards

1
Q

the proofs of theorems designed for human
consumption are almost always

A

informal proofs

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

is a statement that can be shown to be true

A

theorem

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

Less important theorems sometimes are called

A

propositions

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

Theorems can also be referred to
as

A

facts or results

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

We demonstrate that a theorem is true
with a

A

proof

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

The statements used in a proof can include

A

axioms (or postulates)

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

axioms (or postulates), which are

A

statements we assume to be true

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

In practice, the
nal step of a proof is usually just the

A

conclusion of the theorem

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

A less important theorem that is helpful in the proof of other results is called a

A

lemma
(plural lemmas or lemmata)

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

is a theorem that can be established directly from a theorem that has been proved

A

corollary

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

is a statement that is being proposed to be a true statement, usually on the basis of some partial
evidence, a heuristic argument, or the intuition of an expert

A

conjecture

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

A ____________________ of a conditional statement p → q is constructed when the first step is the assumption that p is true; subsequent steps are constructed using rules of inference, with the final step showing that q must also be true.

A

direct proof

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

The integer n is ______ if there exists an integer k such that n = 2k, and n is _____ if there exists an integer k such that n = 2k + 1. (Note that every integer is either even or odd, and no
integer is both even and odd.)

A

even, odd

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

Two integers have the _____________ when both are even or both
are odd; they have ________________ when one is even and the other is odd.

A

same parity, opposite parity

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

An integer a is a _________________ if there is an integer b such that a = b2

A

perfect square

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

Proofs of theorems of this type that are not direct
proofs, that is, that do not start with the premises and end with the conclusion, are called

A

indirect proofs.

17
Q

An extremely useful type of indirect proof is known as

A

proof by contraposition

18
Q

if we can show that p is false, then we have a proof, called a

A

vacuous proof, of the conditional statement p → q

19
Q

We can also quickly prove a conditional statement p → q if we know that the conclusion

A

q is true

20
Q

A proof of p → q that uses the fact that q is true is called a

A

trivial proof

21
Q

The real number r is _________if there exist integers p and q with q = 0 such that r = p/q. / suppose to be through first = sign

A

rational

22
Q

A real number that is not rational is called

A

irrational

23
Q

Because the statement r ∧ ¬r is a contradiction whenever r is a proposition, we can prove that p is true if we can show that ¬p → (r ∧ ¬r) is true for some proposition r. Proofs of this
type are called

A

proofs by contradiction

24
Q

a statement of the form ∀xP (x) is false, we need only find a

A

counterexample

25
Q

Every positive integer is the sum of the

A

squares of two integers”

26
Q

Many incorrect arguments are based on a fallacy called

A

begging the question

27
Q

begging the question fallacy is also called

A

circular reasoning

28
Q

circular reasoning.

A

fallacy arises when a statement is proved using itself, or a statement equivalent to it