In mathematics, an ÷ set (eta set) is a type of totally ordered set introduced by that generalizes the order type ÷ of the rational numbers.
If is an ordinal then an set is a totally ordered set in which for any two subsets and of cardinality less than , if every element of is less than every element of then there is some element greater than all elements of and less than all elements of .
The only non-empty countable ÷<sub>0</sub> set (up to isomorphism) is the ordered set of rational numbers.
Suppose that ú = âµ<sub>ñ</sub> is a regular cardinal and let X be the set of all functions f from ú to {âÂÂ1,0,1} such that if f(ñ) = 0 then f(ò) = 0 for all ò > ñ, ordered lexicographically. Then X is a ÷<sub>ñ</sub> set. The direct limit of all these orders is isomorphic to the class of surreal numbers.
A dense totally ordered set without endpoints is an ÷<sub>ñ</sub> set if and only if it is âµ<sub>ñ</sub> saturated.
Any ÷<sub>ñ</sub> set X is universal for totally ordered sets of cardinality at most âµ<sub>ñ</sub>, meaning that any such set can be embedded into X.
For any given ordinal ñ, any two ÷<sub>ñ</sub> sets of cardinality âµ<sub>ñ</sub> are isomorphic (as ordered sets). An ÷<sub>ñ</sub> set of cardinality âµ<sub>ñ</sub> exists if âµ<sub>ñ</sub> is regular and ã<sub>ò<ñ</sub> 2<sup>âµ<sub>ò</sub></sup> ⤠âµ<sub>ñ</sub>.