Math 2.0

Order, lattices, ordered algebraic structures Definition

Locally finite poset

Builds on Partial orderFinite set

Definition

Let (P,≤)(P, \le) be a partially ordered set. For x,y∈Px, y \in P, the closed interval from xx to yy is [x,y]={z∈P:x≤z≤y}[x, y] = \set{z \in P : x \le z \le y}. The poset PP is locally finite when [x,y][x, y] is a finite set for all x,y∈Px, y \in P.

Remarks

Example: ℕk\N^k with the product order is locally finite. Check: if x≤yx \le y, the interval [x,y][x, y] is the box ∏i=1k{xi,…,yi}\prod_{i=1}^k \set{x_i, \ldots, y_i}, which has ∏i(yi−xi+1)\prod_i (y_i - x_i + 1) elements; if x≰yx \not\le y, it is empty.

Non-example: ℚ\Q with the usual order is not locally finite, since [0,1][0, 1] is infinite.

Every finite poset is locally finite. The interval [x,y][x, y] is empty unless x≤yx \le y, so only comparable pairs matter. In Mathlib the class LocallyFiniteOrder provides the intervals as finite sets.

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. Finite set concept
  2. Partial order concept
  3. Locally finite poset definition

Further reading

  1. Web https://en.wikipedia.org/wiki/Locally_finite_poset
About this page
Tag9HTB5KVS72
URIm2://9HTB5KVS72
Kinddefinition
WritingW0 stub
MSC06A07, 06A11
DefinesLocally finite poset
UsesPartial order, Finite set
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.