Well-ordering theorem
Set-theoretic theorem or principle, equivalent to the axiom of choice
In mathematics, the well-ordering theorem, also known as Zermelo's theorem, states that every set can be well-ordered. A set X is well-ordered by a strict total order if every non-empty subset of X has a least element under the ordering.
Nº Q1457052 ★★
Uncommon · Knowledge
Well-ordering theorem
Set-theoretic theorem or principle, equivalent to the axiom of choice
In mathematics, the well-ordering theorem, also known as Zermelo's theorem, states that every set can be well-ordered. A set X is well-ordered by a strict total order if every non-empty subset of X has a least element under the ordering.
Last price
—
Floor price
—
7-day median
—
30-day sales
0
30-day range
—
In circulation
0
Price history
median
low – high
sales
No sales in this period
Show table
| Date | median | Low | High | sales |
|---|
Sales history
- Last sale
- —
- 30-day average
- —
- 30-day low
- —
- 30-day high
- —
- Sales 7d
- 0
- Sales 30d
- 0
No sales yet.
Anonymous sales: no buyer or seller shown. Figures count player-to-player sales only.
From Wikipedia
In mathematics, the well-ordering theorem, also known as Zermelo's theorem, states that every set can be well-ordered. A set X is well-ordered by a strict total order if every non-empty subset of X has a least element under the ordering. The well-ordering theorem together with Zorn's lemma are the most important mathematical statements that are equivalent to the axiom of choice (often called AC, see also Axiom of choice § Equivalents). Ernst Zermelo introduced the axiom of choice as an "unobjectionable logical principle" to prove the well-ordering theorem. One can conclude from the well-ordering theorem that every set is susceptible to transfinite induction, which is considered by mathematicians to be a powerful technique.
Text: Wikipédia, CC BY-SA 4.0. ·
Related cards
Well-ordering principle
Statement that all sets of positive numbers contains a least element
Nº Q2488476 ★★★
Axiom of choice
Statement that the product of a collection of non-empty sets is non-empty
Nº Q179692 ★★★
Zermelo–Fraenkel set theory
Variant of ZFC, the standard axiomatic set theory
Nº Q191849 ★★★
Cantor's theorem
In set theory, the theorem that a set has a strictly smaller cardinality than its powerset
Nº Q474881 ★★
Zorn's lemma
Statement equivalent to the axiom of choice, about the existence of a maximal element in a poset with a maximal chain condition
Nº Q290810 ★★
Hausdorff maximal principle
Mathematical statement
Nº Q738328 ★