Math 2.0

definition

Ascending chain condition

Definition

Let (P,≤)(P, \le) be a partially ordered set. The set PP satisfies the ascending chain condition if every sequence a1≤a2≤a3≤…a_1 \le a_2 \le a_3 \le \dots of elements of PP is eventually constant. That is, there is an integer NN with an=aNa_n = a_N for all n≥Nn \ge N.

Remarks

Equivalently, every nonempty subset of PP has a maximal element. This equivalence uses the axiom of dependent choice. The set N\mathbb{N} with its usual order does not satisfy the condition. With the reverse order, it does. For the set of the ideals of a ring, ordered by inclusion, the condition defines Noetherian rings. The ideals of Z\mathbb{Z} satisfy the condition: a chain (a1)⊆(a2)⊆…(a_1) \subseteq (a_2) \subseteq \dots means a2∣a1a_2 \mid a_1, a3∣a2a_3 \mid a_2, and so on.

Explanations

L1 human

The condition says that you cannot climb forever. Every increasing chain stops growing after a finite number of steps. For the ideals of the integers, a strictly increasing chain like (12)⊂(6)⊂(3)⊂(1)(12) \subset (6) \subset (3) \subset (1) must end.

What this node needs for W2
  • edge instance_of in: one example (0 of 1)
  • edge not_instance_of in: one non-example that fails one clause (0 of 1)

The writing levels say how complete the text of a node is. They do not measure its truth.

What depends on this

2 nodes use this node, directly or through other nodes.

Sources

  1. Web https://en.wikipedia.org/wiki/Ascending_chain_condition, Definition