well-ordering property
Quick Summary
The well-ordering property, also known as the well-ordering principle, is a fundamental concept in mathematics, particularly in set theory. It states that every non-empty set of positive integers can be arranged in a specific order such that every subset has a least element. This property is crucial for proving theorems using transfinite induction, a generalization of mathematical induction.12
The axiom of choice is closely related to the well-ordering property. It asserts that for any collection of non-empty sets, it's possible to choose exactly one element from each set. This axiom is essential for proving that any set can be well-ordered. While some mathematicians have debated its use due to its non-constructive nature, it is now widely accepted as an indispensable tool in mathematics.1
Ask Britannica AI about this topic
Britannica doesn't have a full article on this topic, so we've curated a list of our relevant coverage.
foundations of mathematicsNonconstructive arguments…asserts the existence of a well-ordering of the reals, as was proved by Feferman. An ordered set is said to be well-ordered if every nonempty subset has a least element. It had been shown by the German mathematician Ernst Zermelo (1871–1951) that every set can be well-ordered, provided one adopts…
Read More…asserts the existence of a well-ordering of the reals, as was proved by Feferman. An ordered set is said to be well-ordered if every nonempty subset has a least element. It had been shown by the German mathematician Ernst Zermelo (1871–1951) that every set can be well-ordered, provided one adopts…
Read More- set theoryAxioms for infinite and ordered sets
…be equivalent to the so-called well-ordering theorem.
Read More…be equivalent to the so-called well-ordering theorem.
Read More