(a) Let Is(Γ,Γ′) be the relation "Γ is an ordering (on E), and Γ′ is an ordering (on E'), and there exists an isomorphism of E, ordered by Γ, onto E', ordered by Γ′". Show that Is(Γ,Γ′) is an equivalence relation on every set whose elements are orderings. The term τΔ(Is(Γ,Δ)) is an ordering called the order-type of Γ and is denoted by Ord (Γ), or Ord(E) by abuse of notation. Two ordered sets are isomorphic if and only if their order-types are equal.
(b) Let R{λ,μ} be the relation : "λ is an order-type, and μ is an order-type, and there exists an isomorphism of the set ordered by λ onto a subset of the set ordered by μ". Show that R{λ,μ} is a preorder relation between λ and μ. It will be denoted by λ≺μ.
(c) Let I be an ordered set and let (λι)ι∈I be a family of order-types indexed by I. The order-type of the ordinal sum (§ 1, Exercise 3) of the family of sets ordered by the λι (ι∈I) is called the ordinal sum of the order-types λι (ι∈I) and is denoted by ι∈I∑λι. If (Eι)ι∈I is a family of ordered sets, the order-type of ι∈I∑Eι is ι∈I∑Ord(Eι). If I is the ordinal sum of a family (Jϰ)ϰ∈K, show that
ϰ∈K∑(ι∈Jϰ∑λι)=ι∈I∑λι.
(d) Let I be a well-ordered set and (λι)ι∈I a family of order-types indexed by I. The order-type of the lexicographic product of the family of sets ordered by the λι (ι∈I) is called the ordinal product of the family (λι)ι∈I and is denoted by ι∈IPλι. If (Eι)ι∈I is a family of ordered sets, the order-type of the lexicographic product of the family (Eι)ι∈I is ι∈IPOrd(Eι). If I is the ordinal sum of a family of well-ordered sets (Jϰ)ϰ∈K, indexed by a well-ordered set K, show that
Pϰ∈K(Pι∈Jϰλι)=Pι∈Iλι.
(e) We denote by λ+μ (resp. μλ) the ordinal sum (resp. ordinal product) of the family (ξι)ι∈J, where J={α,β} is a set with two distinct elements, ordered by the relation whose graph is {(α,α),(α,β),(β,β)}, and where ξα=λ, ξβ=μ. Show that if I is a well-ordered set of order-type λ, and if (μι)ι∈I is a family of order-types such that μι=μ for each ι∈I, then ι∈I∑μι=μλ. We have (λ+μ)+ν=λ+(μ+ν), (λμ)ν=λ(μν), and λ(μ+ν)=λμ+λν (but in general λ+μ=μ+λ, λμ=μλ, (λ+μ)ν=λν+μν).
(f) Let (λι)ι∈I and (μι)ι∈I be two families of order-types indexed by the same ordered set I. Show that, if λι≺μι for each ι∈I, then ι∈I∑λι≺ι∈I∑μι and (if I is well-ordered) ι∈IPλι≺ι∈IPμι. If J is a subset of I, show that ι∈J∑λι≺ι∈I∑λι and (if I is well-ordered and the λι are non-empty) ι∈JPλι≺ι∈IPλι.
(g) Let λ∗ denote the order-type of the set ordered by the opposite of the ordering λ. Then we have
(λ∗)∗=λand(ι∈I∑λι)∗=ι∈I∗∑λι∗,
where I∗ denotes the set I endowed with the opposite of the ordering given on I.