Well-ordering principle
Statement that all sets of positive numbers contains a least element
In mathematics, the well-ordering principle states that every non-empty subset of nonnegative integers contains a least element. In other words, the set of nonnegative integers is well-ordered by its "natural" or "magnitude" order in which x {\displaystyle x} precedes y {\displaystyle y} if and only if y {\displaystyle y} is either x {\displaystyle x} or the sum of x {\displaystyle x} and some nonnegative integer (other orderings include the ordering 2 , 4 , 6 , . . . {\displaystyle 2,4,6,...} ; and 1 , 3 , 5 , . . . {\displaystyle 1,3,5,...} )...
Nº Q2488476 ★★★
Rare · Knowledge
Well-ordering principle
Statement that all sets of positive numbers contains a least element
In mathematics, the well-ordering principle states that every non-empty subset of nonnegative integers contains a least element. In other words, the set of nonnegative integers is well-ordered by its "natural" or "magnitude" order in which x {\displaystyle x} precedes y {\displaystyle y} if and only if y {\displaystyle y} is either x {\displaystyle x} or the sum of x {\displaystyle x} and some nonnegative integer (other orderings include the ordering 2 , 4 , 6 , . . . {\displaystyle 2,4,6,...} ; and 1 , 3 , 5 , . . . {\displaystyle 1,3,5,...} )...
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 principle states that every non-empty subset of nonnegative integers contains a least element. In other words, the set of nonnegative integers is well-ordered by its "natural" or "magnitude" order in which x {\displaystyle x} precedes y {\displaystyle y} if and only if y {\displaystyle y} is either x {\displaystyle x} or the sum of x {\displaystyle x} and some nonnegative integer (other orderings include the ordering 2 , 4 , 6 , . . . {\displaystyle 2,4,6,...} ; and 1 , 3 , 5 , . . . {\displaystyle 1,3,5,...} ). The phrase "well-ordering principle" is sometimes taken to be synonymous with the "well-ordering theorem", according to which every set can be well-ordered. On other occasions it is understood to be the proposition that the set of integers { … , − 2 , − 1 , 0 , 1 , 2 , 3 , … } {\displaystyle \{\ldots ,-2,-1,0,1,2,3,\ldots \}} contains a well-ordered subset, called the natural numbers, in which every nonempty subset contains a least element.
Text: Wikipédia, CC BY-SA 4.0. ·
Related cards
Well-ordering theorem
Set-theoretic theorem or principle, equivalent to the axiom of choice
Nº Q1457052 ★★
Maximal and minimal elements
Elements of partially ordered sets such that there is not greater and smaller than each other element, respectively (but there can be incomparable elements)
Nº Q1475294 ★
Ordinal number
Mathematical concept generalizing ordinal numerals to extend enumeration to infinite sets
Nº Q191780 ★★★
Cantor's theorem
In set theory, the theorem that a set has a strictly smaller cardinality than its powerset
Nº Q474881 ★★
Vantieghems theorem
Nº Q2226807 ★★
Interesting number paradox
Logical contradiction in which every possible solution to the problem is exempt: if there were some uninteresting natural numbers, there would be a smallest uninteresting number, which would be therefore interesting
Nº Q1665996 ★