Order, lattices, ordered algebraic structures Definition
Well-founded order
Builds on Partial orderWell-founded relation
Definition
Let be a partially ordered set, and write when and . The order is well-founded when every nonempty subset has a minimal element, that is, an element such that no satisfies .
Remarks
Example: the set with the product order, when and , is well-founded. Check: in a nonempty , take the least first coordinate occurring in , and then the least with ; no element of is strictly below .
Non-example: the set of rational numbers with the usual order is not well-founded, since the whole set has no minimal element.
The order is well-founded exactly when the strict order is a well-founded relation. With the axiom of dependent choice, the condition is equivalent to the absence of an infinite sequence . The same definition applies to a preorder, with meaning and not .
Reading path
To understand this page from the ground up, read these 3 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Partial order concept
- Well-founded relation concept
- Well-founded order definition
Further reading
About this page
| Tag | ZANKHGE1YC |
|---|---|
| URI | m2://ZANKHGE1YC |
| Kind | definition |
| Writing | W0 stub |
| MSC | 06A06, 03E20 |
| Defines | Well-founded order |
| Uses | Partial order, Well-founded relation |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
- a source with a locator (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
What links here
No page links to this page yet.