Infinite descending chain: Difference between revisions
Content deleted Content added
No edit summary |
m remove Erik9bot category,outdated, tag and general fixes |
||
Line 1: | Line 1: | ||
{{Unreferenced|date=December 2009}} |
|||
Given a [[Set (mathematics)|set]] ''S'' with a [[partial order]] |
Given a [[Set (mathematics)|set]] ''S'' with a [[partial order]] ≤, an '''infinite descending chain''' is a [[Chain (order theory)|chain]] ''V'', that is, a subset of ''S'' upon which ≤ defines a [[total order]], such that ''V'' has no [[least element]], that is, an element ''m'' such that for all elements ''n'' in ''V'' it holds that ''m'' ≤ ''n''. |
||
As an example, in the set of [[integer]]s, the chain −1, −2, −3, ... is an infinite descending chain, but there exists no infinite descending chain on the [[natural number]]s, as every chain of natural numbers has a minimal element. |
As an example, in the set of [[integer]]s, the chain −1, −2, −3, ... is an infinite descending chain, but there exists no infinite descending chain on the [[natural number]]s, as every chain of natural numbers has a minimal element. |
||
Line 9: | Line 10: | ||
* [[Well-founded relation]] |
* [[Well-founded relation]] |
||
{{DEFAULTSORT:Infinite Descending Chain}} |
|||
[[Category:Order theory]] |
[[Category:Order theory]] |
||
[[Category:Wellfoundedness]] |
[[Category:Wellfoundedness]] |
||
[[Category:Articles lacking sources (Erik9bot)]] |
|||
[[zh:无穷降链]] |
[[zh:无穷降链]] |
Revision as of 11:09, 16 December 2009
Given a set S with a partial order ≤, an infinite descending chain is a chain V, that is, a subset of S upon which ≤ defines a total order, such that V has no least element, that is, an element m such that for all elements n in V it holds that m ≤ n.
As an example, in the set of integers, the chain −1, −2, −3, ... is an infinite descending chain, but there exists no infinite descending chain on the natural numbers, as every chain of natural numbers has a minimal element.
If a partially ordered set does not contain any infinite descending chains, it is called well-founded. A totally ordered set without infinite descending chains is called well-ordered.