Math 2.0

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

Locally finite poset

Summary

A locally finite poset is a partially ordered set in which every closed interval [x,y]={z:x≤z≤y}[x, y] = \set{z : x \le z \le y} is finite. This is the condition under which the incidence algebra and the Möbius function of the poset are defined. Most posets of enumerative combinatorics are locally finite, even when they are infinite.

Where this leads

1 page builds on this one.

Further reading

  1. Web https://en.wikipedia.org/wiki/Locally_finite_poset
About this page
TagTV1V4JDRDD
URIm2://TV1V4JDRDD
Kindconcept
WritingW0 stub
MSC06A07, 06A11
SpecializesPartial order
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

Used by