Difference between revisions of "Well-ordering"
From Maths
(Created page with "A well-ordering is a special kind of ordering ==Definition== An ordering <math><</math> of a set {{M|P}} which is both: * Linear (total) * strict Is a ''well-or...") |
m |
||
| Line 6: | Line 6: | ||
* strict | * strict | ||
| − | Is a ''well-ordering'' if every {{M|A\subset P}} with {{M|A\ne\emptyset}} has a least element. | + | Is a ''well-ordering'' if every {{M|A\subset P}} with {{M|A\ne\emptyset}} has a least element. (Then {{M|A}} is ''[[Well-ordered set|well-ordered]]''<ref name="Top">Topology - James R. Munkres - 2nd edition</ref>) |
{{Todo|Finish off}} | {{Todo|Finish off}} | ||
| + | |||
| + | ==See also== | ||
| + | * [[Well-ordered set]] | ||
| + | |||
| + | ==References== | ||
| + | <references/> | ||
| + | |||
{{Definition|Set Theory}} | {{Definition|Set Theory}} | ||
Latest revision as of 17:34, 24 July 2015
A well-ordering is a special kind of ordering
Definition
An ordering < of a set P which is both:
- Linear (total)
- strict
Is a well-ordering if every A⊂P with A≠∅ has a least element. (Then A is well-ordered[1])
TODO: Finish off
See also
References
- Jump up ↑ Topology - James R. Munkres - 2nd edition
