Lably
Skip to content

Prewellordering

Set theory concept

  • 2 min read
  • 2 chapters

Related on Lably

Through Set theory, Transitive relation and Homogeneous relation

Prewellordering on a set

A prewellordering on a set X is a homogeneous binary relation ≤ on X that satisfies the following conditions:

  1. Reflexivity: x≤x for all x∈X.
  2. Transitivity: if x<y and y<z then x<z for all x,y,z∈X.
  3. Total/Strongly connected: x≤y or y≤x for all x,y∈X.
  4. for every non-empty subset S⊆X, there exists some m∈S such that m≤s for all s∈S.
    • This condition is equivalent to the induced strict preorder x<y defined by x≤y and y≰x being a well-founded relation.

A homogeneous binary relation ≤ on X is a prewellordering if and only if there exists a surjection π:X→Y into a well-ordered set (Y,≲) such that for all x,y∈X, x≤y if and only if π(x)≲π(y).

Examples

Given a set A, the binary relation on the set X:=Finite⁡(A) of all finite subsets of A defined by S≤T if and only if |S|≤|T| (where |⋅| denotes the set's cardinality) is a prewellordering.

Properties

If ≤ is a prewellordering on X, then the relation ∼ defined by x∼y if and only if x≤y∧y≤x is an equivalence relation on X, and ≤ induces a wellordering on the quotient X/∼. The order-type of this induced wellordering is an ordinal, referred to as the length of the prewellordering.

A norm on a set X is a map from X into the ordinals. Every norm induces a prewellordering; if ϕ:X→Ord is a norm, the associated prewellordering is given by x≤y if and only if ϕ(x)≤ϕ(y) Conversely, every prewellordering is induced by a unique regular norm (a norm ϕ:X→Ord is regular if, for any x∈X and any α<ϕ(x), there is y∈X such that ϕ(y)=α).

Sign in to keep reading

One more chapter is free with a Lably account.

More in Discrete mathematics