Math 2.0

Order, lattices, ordered algebraic structures Well-orders, well-founded orders, well-quasi-orders Concept

Cofinal subset

Summary

A subset CC of a preordered set PP is cofinal when every element of PP lies below some element of CC. A cofinal subset reaches arbitrarily far up in PP. For example, CC and PP have the same upper bounds, so a supremum of PP can be computed from CC alone. The least cardinality of a cofinal subset is the cofinality of PP.

Further reading

  1. Web https://en.wikipedia.org/wiki/Cofinal_(mathematics)
About this page
Tag2PFQY2RZBC
URIm2://2PFQY2RZBC
Kindconcept
WritingW0 stub
MSC06A06, 03E04
Same as
Changed2 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

Definitions