In mathematics, a well-order relation (or well-ordering) on a set S is a total order on S with the property that every non-empty subset of S has a least element in this ordering. The set S together with the well-order relation is then called a well-ordered set. The hyphen is frequently omitted in contemporary papers, yielding the spellings wellorder, wellordered, and wellordering.