Order, lattices, ordered algebraic structures Well-orders, well-founded orders, well-quasi-orders Concept
Cofinal subset
Summary
A subset of a preordered set is cofinal when every element of lies below some element of . A cofinal subset reaches arbitrarily far up in . For example, and have the same upper bounds, so a supremum of can be computed from alone. The least cardinality of a cofinal subset is the cofinality of .
Further reading
About this page
| Tag | 2PFQY2RZBC |
|---|---|
| URI | m2://2PFQY2RZBC |
| Kind | concept |
| Writing | W0 stub |
| MSC | 06A06, 03E04 |
| Same as | |
| Changed | 2 November 2026 |
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.