# Chain condition

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

A finiteness condition for ascending or descending chains in a partially ordered set. The descending chain condition for a partially ordered set states: For any chain of elements there is a number such that . This condition is equivalent to each of the following properties of :

1) every non-empty subset has at least one minimal element in (the minimum condition);

2) all elements of have a given property if all minimal elements of have this property and if the validity of for any can be deduced from the fact that is valid for all , (the inductiveness condition).

The inductiveness condition enables one to carry out proofs and constructions by induction for sets with the descending chain condition. Here if is totally ordered (and hence well-ordered) one obtains transfinite induction, and if is isomorphic to the set of natural numbers, one obtains ordinary mathematical induction (see Induction axiom).

The ascending chain condition (and assertions equivalent to it) is formulated in a dual way (see Duality principle in partially ordered sets); it therefore states that if is an ascending chain in a partially ordered set , then for large enough . In a lattice with the ascending chain condition every ideal is principal. Every finite set obviously satisfies both chain conditions, but the converse assertion (that a set satisfying both these conditions is finite) is false. A lattice satisfying the descending and ascending chain conditions is complete.

In algebra, chain conditions are mainly applied to sets of subsystems of various algebraic systems ordered by inclusion (see for example, Artinian module; Artinian group; Artinian ring; Composition sequence; Noetherian module; Noetherian group; Noetherian ring).

How to Cite This Entry:
Chain condition. Encyclopedia of Mathematics. URL: http://encyclopediaofmath.org/index.php?title=Chain_condition&oldid=15683
This article was adapted from an original article by T.S. Fofanova (originator), which appeared in Encyclopedia of Mathematics - ISBN 1402006098. See original article