Order
1.[2p] Which of these relations are partial orders?
Which of these relations are partial orders?
Select all that apply
The answer is: on , on , for a set , Divisibility on
The answer is: on , on , for a set , Divisibility on
The answer is: on , on , for a set , Divisibility on
2.[1p] A relation that is symmetric cannot also be antisymmetric.
A relation that is symmetric cannot also be antisymmetric.
The answer is: False
3.[2p] Divisibility on is not a partial order. Which property fails, and what shows it?
Divisibility on is not a partial order. Which property fails, and what shows it?
The answer is: Antisymmetry: and , yet
The answer is: Antisymmetry: and , yet
The answer is: Antisymmetry: and , yet
4.[2p] Which of these are total orders?
Which of these are total orders?
Select all that apply
The answer is: on , Divisibility on
The answer is: on , Divisibility on
5.[2p] The Hasse diagram of the divisors of under divisibility draws one line for each covering pair. How many lines does it have?
The Hasse diagram of the divisors of under divisibility draws one line for each covering pair. How many lines does it have?
6.[3p] Match each poset to the description that fits it.
Match each poset to the description that fits it.
under divisibility
The divisors of under divisibility
under
under
a greatest element, which is the only maximal one
a least element and no maximal element
no maximal and no minimal element
two maximal elements and no greatest element
Show the answer
under divisibility: two maximal elements and no greatest element The divisors of under divisibility: a greatest element, which is the only maximal one under : a least element and no maximal element under : no maximal and no minimal element
7.[1p] What is in ?
What is in ?
The answer is: , which is not an element of the set
The answer is: , which is not an element of the set
The answer is: , which is not an element of the set
8.[3p] Let , ordered by . Which statements are true?
Let , ordered by . Which statements are true?
Select all that apply
The answer is: is bounded above in , is an upper bound of , Viewed as a subset of , has supremum
The answer is: is bounded above in , is an upper bound of , Viewed as a subset of , has supremum
9.[2p] Put the lines of the proof that is transitive in order.
Put the lines of the proof that is transitive in order.
Let and .
Since was arbitrary, .
Let .
Since , .
Since , .
Show the answer
a, b, c, d, e
10.[1p] In , what is the meet , the infimum of ?
In , what is the meet , the infimum of ?
The answer is: , the greatest common divisor
The answer is: , the greatest common divisor
The answer is: , the greatest common divisor
11.[3p] Which of these are well-orders?
Which of these are well-orders?
Select all that apply
The answer is: on , The lexicographic order on , The shortlex order on finite words in the letters and
The answer is: on , The lexicographic order on , The shortlex order on finite words in the letters and
The answer is: on , The lexicographic order on , The shortlex order on finite words in the letters and
12.[2p] What is the largest number of elements in an antichain of under divisibility?
What is the largest number of elements in an antichain of under divisibility?
13.[1p] Every finite non-empty poset has a minimal element.
Every finite non-empty poset has a minimal element.
The answer is: True
14.[2p] Zorn's lemma says that a non-empty poset in which every non-empty chain has an upper bound has what?
Zorn's lemma says that a non-empty poset in which every non-empty chain has an upper bound has what?
The answer is: A maximal element
The answer is: A maximal element
The answer is: A maximal element