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).
|||G. Birkhoff, "Lattice theory" , Colloq. Publ. , 25 , Amer. Math. Soc. (1973)|
|||A.G. Kurosh, "Lectures on general algebra" , Chelsea (1963) (Translated from Russian)|
|||L.A. Skornyakov, "Elements of lattice theory" , A. Hilger & Hindushtan Publ. Comp. (1977) (Translated from Russian)|
The phrase "chain condition" is used in a different sense in the theory of Boolean algebras and in set theory (a Boolean algebra, considered as a partially ordered set, satisfies the descending chain condition if and only if it is finite, so this condition is not of interest in the context of Boolean algebras). A Boolean algebra is said to satisfy the -chain condition, where is an infinite cardinal number, if every chain (i.e. totally ordered subset) in has cardinality less then . In particular, the -chain condition is commonly called the countable chain condition (abbreviated ccc); this is an important condition in the set-theoretic forcing method (see [a1], Section 3, for example). For a complete Boolean algebra, the -chain condition is equivalent to the -antichain condition, i.e. the condition that every discretely ordered subset has cardinality less than . In the theory of forcing, set-theorists frequently work not with complete Boolean algebras of forcing conditions, but with partially ordered sets which generate them (as algebras of regular open sets); such a set satisfies the -antichain condition if and only if the same condition holds for the Boolean algebra which it generates. Unfortunately, set-theorists tend to use the term "k-chain condition" in this context, when they really mean "k-antichain condition" .
|[a1]||J.P. Burgess, "Forcing" J. Barwise (ed.) , Handbook of mathematical logic , North-Holland (1977) pp. 403–452|
Chain condition. Encyclopedia of Mathematics. URL: http://encyclopediaofmath.org/index.php?title=Chain_condition&oldid=15683