Differences

This shows you the differences between two versions of the page.

Link to this comparison view

Both sides previous revision Previous revision
Next revision
Previous revision
modular:ordered_sets [2014/01/30 00:29]
marje
modular:ordered_sets [2014/01/31 01:07]
marje
Line 38: Line 38:
 Of the examples above, sets in 1. are totally ordered, while the set in 3. is not, because, e.g., $2$ and $3$ are incomparable (neither $2 \mid 3$ nor $3 \mid 2$). Of the examples above, sets in 1. are totally ordered, while the set in 3. is not, because, e.g., $2$ and $3$ are incomparable (neither $2 \mid 3$ nor $3 \mid 2$).
  
-<​WRAP ​indent+<​WRAP ​task
-:?: Which of the following sets are totally ordered?+Which of the following sets are totally ordered?
   - The set on the Hasse diagram above. ++Answer| ​ No, because, e.g., $\{1\}$ and $\{3\}$ are incomparable.++   - The set on the Hasse diagram above. ++Answer| ​ No, because, e.g., $\{1\}$ and $\{3\}$ are incomparable.++
   - The set given by the following ++diagram. |   - The set given by the following ++diagram. |
Line 64: Line 64:
 The symmetrical notion, the **greatest lower bound** (aka **infimum**) of $A$ is denoted $\inf A$. The symmetrical notion, the **greatest lower bound** (aka **infimum**) of $A$ is denoted $\inf A$.
 </​box>​ </​box>​
- 
-<WRAP indent> 
-:?: 
-Exercises on suprema. TODO 
-</​WRAP>​ 
  
 <box 100% round blue> <box 100% round blue>
Line 74: Line 69:
 </​box>​ </​box>​
  
-<WRAP indent> + 
-:?: +-----------------------------------------------------------------------------------------------------------------------------------------
-Which of the following sets are lattices? +
-</​WRAP>​+
modular/ordered_sets.txt · Last modified: 2014/01/31 01:07 by marje