Back to the index. Or to the chambers

This article has 9 links. View as Cloud or List.

Partial Order Infinite Poset Finite Upper Bound Total Order Sequent Maximal Element Hasse Diagram

1	Partial Order
1	Upper Bound
1	Total Order
1	Poset
1	Finite
1	Infinite
2	Sequent
2	Maximal Element
6	Hasse Diagram

Loading ...

Planetmath Browser (2008—2009)

BSD licence | A django site

All articles taken from PlanetMath.org snapshot under CC-BY-SA licence.

→ The original article on PlanetMath.org

Other Formats: LaTeX

New! You can click on formulas to copy the LaTeX source to your clipboard. | Math Videos

Chain Finite

A poset is said to be chain finite if every chain with both maximal and minimal element is finite.

$\mathbb{Z}$ with the standard order relation is chain finite, since any infinite subset of $\mathbb{Z}$ must be unbounded above or below. $\mathbb{Q}$ with the standard order relation is not chain finite, since for example $\{ x \in\nobreak \mathbb{Q} \,\mid\, 0 \leqslant\nobreak x \leqslant\nobreak 1 \}$ is infinite and has both a maximal element and a minimal element 0.

Chain finiteness is often used to draw conclusions about an order from information about its covering relation (or equivalently, from its Hasse diagram).