Lecture 2 - Basic Concepts and Proof By Induction Flashcards

1
Q

What is a sequence of objects?

A

It is a list of these objects in some order.

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

Does order matter in a sequence?

A

Yes! but it does not matter in a set

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

Does repetition matter in a sequence?

A

Yes! but it does not matter in a set

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

What is the power set of a given set A?

A

It is the set of all subsets of A

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

What is the Cartesian Product?

A

The Cartesian Product is the set of all ordered pairs.

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

What is a function?

A

A function is something that takes an input and produces an output

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

What is a predicate (or property)?

A

It is a function whose range is {TRUE, FALSE}

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

What is an equivalence relation?

A

It is a special type of binary relation that captures the notion of 2 object being equal in some feature

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

What are the 3 conditions of an equivalence relation?

A
  1. Reflexive
  2. Symmetric
  3. Transitive
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

What is reflexive?

A

For every x, xRx

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

What is symmetric?

A

For every x y, xRy implies yRx

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

What is transitive?

A

For every x y z, xRy and yRz implies xRz

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

What is a proof?

A

A proof is a convincing logical argument that a statement is true.
They must be airtight, beyond any doubt

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

What is proof by induction?

A

It is a proof that shows that all elements of some infinite set have a specified property.
They have 2 parts, a base case and an induction.

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

What is the base case?

A

The first start of proof by induction - prove that P(1) holds

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

What is the induction step?

A

Prove that for every i > 1, if P(1) holds, then so must P(i+1)