Infinite Cardinalities Flashcards

1
Q

Are there more students in a room, or more chairs? How do you know?

Show a function

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

How to show that a function is injective from A to B?

A

Cardinality from A to B if A>B is injective

Georg Cantor (1845 - 1918) Generalized observation to sets (infinite and finite)

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

Two sets A and B have equal cardinality iff: …

Schroder-Bernstein Theorem

A

|A| </ |B| and |B| </ |A|

By the Schroder-Bernstein Theorem - there is a bijective function between A and B.

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

What is the Schroder-Bernstein Theorem?

A

Two sets A and B are said to have equal cardinality iff |A| ≤ |B| and |B| ≤ |A|

There is a bijective function between A and B, so that A > B and B > A.

Thus, A and B are “equipollent” written A ∿ B

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

Definition of a set which has finite or countable infinite cardinality:

A
  1. Set is finite if it is equinumerous with a set {1, 2 …, n} for some number n
  2. Set is countably infinite if it equinumerous to N [Has a cardinality ℵ0]

Set is countable or denumerable if it is finite or countably infinite
Therefore, enumerable if infinite

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

Of which number is there more?

A

E, N, Z, Q can all be mapped onto the natural numbers, so they have a cardinality of ℵ0, so |N| = |E|

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

Show that |N| = |E|:

Show that |N| = |E|:

A

f(x) = 2x is a bijective function

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

Show that |N| ≤ |Z|:

Show that |N| ≤ |Z|:

A

f(x)=x is an injective function from N to Z

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

Show that |Z| ≤ |N|:

A

Find a function such that |Z| = |N|

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

Can we find a bijection between N and Q?

A

Matching rational number to infinity to N (skip doubles)

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

What is Cardinal Arithmetic?

A

ℵ0 + 1 = ℵ0 + ℵ0 = ℵ0

Ex: Hilbert’s Hotel

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

How do you show the impossible?

A

Indirect Proof: Assume it, and derive a contradiction

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

What is a proof for Diagonalization:

A
  1. Assumption
  2. Define bijection (contradiction)
  3. Table
  4. Construct new element
  5. Construct element should/cannot be in table
  6. Cannot be in table = contradiction
  7. Conclusion

Used to show that ℝ is enumerable

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

What is Cantor’s Theorem?

A

|ℙ(A)| > A
The Cardinality of a power set > set itself

Ex: |ℕ| < |ℙ(ℕ)|

How to prove? Assume |ℙ(A)| = A and derive a contradicition

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

What is the Continuum Hypothesis?

A

|ℝ| = ℵ1

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

What sets are uncountable?

A
  1. Powerset of ℕ(the set of all subsets of ℕ)
  2. Set of function from ℕ to ℕ
  3. Real numbers
17
Q

Homework 01

Show that the cardinality of A ⋃ {a} is still ℵ0

A

To prove this we need to find a bijection from ℕ to A ⋃ {a}.

Since A is countably infinite, there must be a bijection f from ℕ to A. Now, define a bijection g from ℕ to A ⋃ {a} as follows: g(0) = a and g(n) = f(n-1) for all n ∈ ℕ

18
Q

Homework 1

Show that the cardinality of A⋃B is still ℵ0

A
19
Q

Homework 02

A
20
Q

Homework 02

A