Order, lattices, ordered algebraic structures Definition
Cofinal subset
Definition
Let be a preordered set and let be a subset. The subset is cofinal in when for every there is with .
Remarks
Example: the set is cofinal in with the usual order. Check: for , the integer is in and is at least .
Non-example: the set is not cofinal in , since no element of it is at least .
If has a greatest element , then a subset is cofinal exactly when it contains some with . In a partial order, this means that the subset contains . Being cofinal is transitive: a cofinal subset of a cofinal subset of is cofinal in . The dual notion is a coinitial subset, in which every element of lies above some element of the subset.
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
- Preorder concept
- Subset concept
- Cofinal subset definition
Further reading
About this page
| Tag | 75EJ0HB40M |
|---|---|
| URI | m2://75EJ0HB40M |
| Kind | definition |
| Writing | W0 stub |
| MSC | 06A06, 03E04 |
| Defines | Cofinal subset |
| Uses | Preorder, Subset |
| 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.
What links here
No page links to this page yet.