Ascending Chain Condition

In mathematics, a poset P is said to satisfy the ascending chain condition (ACC) if every ascending chain a1 ≤ a2 ≤ ... of elements of P is eventually stationary, that is, there is some positive integer n such that am = an for all m > n. Similarly, P is said to satisfy the descending chain condition (DCC) if every descending chain a1 ≥ a2 ≥ ... of elements of P is eventually stationary (that is, there is no infinite descending chain). The ascending chain condition on P is equivalent to the maximum condition: every nonempty subset of P has a maximal element. Similarly, the descending chain condition is equivalent to the minimum condition: every nonempty subset of P has a minimal element. Every finite poset satisfies both ACC and DCC. A totally ordered set that satisfies the descending chain condition is called a well-ordered set See also Noetherian and Artinian.

 

<< PreviousWord BrowserNext >>
aim 7 sparrow
aim 120 amraam
agm 84 harpoon
agm 88 harm
av 8 harrier ii
agm 65 maverick
aim 54 phoenix
a 10 thunderbolt ii
ac 130 gunship
alternative
alternative algebra
akira
arbitrage
argument from evolution
acf fiorentina
afrobeat
arithmetic function
adamantium
ansi c
alien and sedition acts
antinomy
anti intellectualism
anti communism
anomalous phenomenon
albury
aquarium
adin steinsaltz
aberrant (role playing game)
aleksandr vladimirovich rutskoy
alfred edward housman
augusto pinochet
attribution of recent climate change
achduart
achiltibuie
adaptive expectations
mexican tetra
atom probe
al capone
amplifier
astable
army of darkness
asroc
ahmed al nami
ahmed al haznawi