Set Theory Lecture 3 Flashcards

1
Q

What is a partial order?

A

A relation that is reflexive, transitive, and anti-symmetric.

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

What are the three properties of a partial order?

A
  1. Reflexivity: x R x 2. Transitivity: x R y ∧ y R z → x R z 3. Anti-symmetry: x R y ∧ y R x → x = y.
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

Is ≤ a partial order on natural numbers?

A

Yes, because it satisfies reflexivity, transitivity, and anti-symmetry.

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

What is the power set of {1,2}?

A

P({1,2}) = {∅, {1}, {2}, {1,2}}.

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

Is ⊆ a partial order on P(V)?

A

Yes, because subset inclusion is reflexive, transitive, and anti-symmetric.

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

What is a linear (or total) order?

A

A partial order where every pair of elements is comparable.

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

Is ≤ on natural numbers a total order?

A

Yes, because for all m, n, either m ≤ n or n ≤ m.

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

Is ⊆ on P({1,2}) a total order?

A

No, because {1} and {2} are not comparable.

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

What is a strict partial order?

A

A relation that is transitive, anti-symmetric, and irreflexive.

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

How is a strict partial order related to a partial order?

A

It is derived by removing all reflexive pairs from the partial order.

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

What does a Hasse diagram represent?

A

A simplified graph representation of a partial order.

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

What is omitted in a Hasse diagram?

A

Reflexive and transitive edges.

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

How do elements appear in a Hasse diagram?

A

Higher elements are greater, and lower elements are smaller.

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

What is the Cartesian order?

A

A × B is ordered as ⟨a1,b1⟩ ≤ ⟨a2,b2⟩ iff a1 ≤ a2 and b1 ≤ b2.

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

What is the lexicographic order?

A

⟨a1,b1⟩ ≤ ⟨a2,b2⟩ iff (a1 < a2) or (a1 = a2 and b1 ≤ b2).

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

Is Cartesian order always a total order?

A

No, it is only a partial order.

17
Q

Is lexicographic order always a total order?

A

Yes, if the original orders are total.

18
Q

Which order is used in dictionaries?

A

Lexicographic order.

19
Q

What is a minimal element in a partially ordered set?

A

An element m such that no element is strictly smaller than m.

20
Q

What is a maximal element in a partially ordered set?

A

An element m such that no element is strictly greater than m.

21
Q

What is the difference between minimal and smallest elements?

A

A minimal element has no smaller elements, but there can be multiple. The smallest element is unique.

22
Q

What is the difference between maximal and largest elements?

A

A maximal element has no larger elements, but there can be multiple. The largest element is unique.

23
Q

What is Theorem 1 about maximal elements?

A

Every maximum of a set is a maximal element.

24
Q

What is Theorem 2 about maximal elements?

A

If a set has a maximum, it is the only maximal element.

25
Q

What is an example of a largest element?

A

In the power set P({a,b,c}), the largest element is {a,b,c}.

26
Q

What is an example of a smallest element?

A

In the power set P({a,b,c}), the smallest element is ∅.

27
Q

What is an example of minimal elements?

A

In P({a,b,c}) \ {∅, {c}}, the minimal elements are {a} and {b}.

28
Q

What is an example of maximal elements?

A

In P({a,b,c}) \ {∅, {c}}, the maximal element is {a,b,c}.