Definition: Well-order, Well-ordered Set

Poset Version

If a poset $(V,\preceq)$ has the property that each of its non-empty subsets $S\subseteq V$ has a minimum, then it is called a well-ordered set. Moreover, the partial order "$\preceq$" is called a well-order on $V.$

Strictly-ordered Set Version

If a strictly ordered set $(V,\prec)$ has the property, that each of its non-empty subsets $S\subseteq V$ has a minimal element, it is called a well-ordered set, and the strict order "$\prec$" is called a well-order on $V.$

Explanations: 1

  1. Proposition: Well-ordered Sets are Chains
  2. Proposition: Finite Chains are Well-ordered

Corollaries: 1
Definitions: 2 3
Examples: 4
Explanations: 5
Parts: 6
Proofs: 7 8 9 10 11 12 13 14
Propositions: 15 16 17 18 19


Thank you to the contributors under CC BY-SA 4.0!

Github:
bookofproofs


References

Bibliography

  1. Reinhardt F., Soeder H.: "dtv-Atlas zur Mathematik", Deutsche Taschenbuch Verlag, 1994, 10th Edition