Math 2.0

Order, lattices, ordered algebraic structures Definition

Cofinal subset

Builds on PreorderSubset

Definition

Let (P,≤)(P, \le) be a preordered set and let C⊆PC \subseteq P be a subset. The subset CC is cofinal in PP when for every x∈Px \in P there is c∈Cc \in C with x≤cx \le c.

Remarks

Example: the set ℕ\N is cofinal in ℝ\R with the usual order. Check: for x∈ℝx \in \R, the integer ⌈∣x∣⌉\ceil{\abs{x}} is in ℕ\N and is at least xx.

Non-example: the set (−∞,0](-\infty, 0] is not cofinal in ℝ\R, since no element of it is at least 11.

If PP has a greatest element mm, then a subset is cofinal exactly when it contains some cc with m≤cm \le c. In a partial order, this means that the subset contains mm. Being cofinal is transitive: a cofinal subset of a cofinal subset of PP is cofinal in PP. The dual notion is a coinitial subset, in which every element of PP 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
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Preorder concept
  2. Subset concept
  3. Cofinal subset definition

Further reading

  1. Web https://en.wikipedia.org/wiki/Cofinal_(mathematics)
About this page
Tag75EJ0HB40M
URIm2://75EJ0HB40M
Kinddefinition
WritingW0 stub
MSC06A06, 03E04
DefinesCofinal subset
UsesPreorder, Subset
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

No page links to this page yet.