Well-ordering

From Maths
Revision as of 17:34, 24 July 2015 by Alec (Talk | contribs)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to: navigation, search

A well-ordering is a special kind of ordering

Definition

An ordering [math]<[/math] of a set [ilmath]P[/ilmath] which is both:

  • Linear (total)
  • strict

Is a well-ordering if every [ilmath]A\subset P[/ilmath] with [ilmath]A\ne\emptyset[/ilmath] has a least element. (Then [ilmath]A[/ilmath] is well-ordered[1])


TODO: Finish off



See also

References

  1. Topology - James R. Munkres - 2nd edition