Prewellordering

From testwiki
Jump to navigation Jump to search

Template:Short description Template:Stack In set theory, a prewellordering on a set X is a preorder ≤ on X (a transitive and reflexive relation on X) that is strongly connected (meaning that any two points are comparable) and well-founded in the sense that the induced relation x<y defined by x≤y and y≰x is a well-founded relation.

Prewellordering on a set

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

  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).Template:Sfn

Examples

Hasse diagram of the prewellordering ⌊x/4⌋≤⌊y/5⌋ on the non-negative integers, shown up to 29. Cycles are indicated in red and ⌊⋅⌋ denotes the floor function.
Hasse diagram of the prewellordering ⌊x/4⌋≤⌊y/4⌋ on the non-negative integers, shown up to 18. The associated equivalence relation is ⌊x/4⌋=⌊y/4⌋; it identifies the numbers in each light red square.

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.Template:Sfn

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.

Template:AnchorA 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)=α).

Prewellordering property

If 𝜞 is a pointclass of subsets of some collection ℱ of Polish spaces, ℱ closed under Cartesian product, and if ≤ is a prewellordering of some subset P of some element X of ℱ, then ≤ is said to be a 𝜞-prewellordering of P if the relations <∗ and ≤∗ are elements of 𝜞, where for x,y∈X,

  1. x<∗y if and only if x∈P∧(y∉P∨(x≤y∧y≰x))
  2. x≤∗y if and only if x∈P∧(y∉P∨x≤y)

𝜞 is said to have the prewellordering property if every set in 𝜞 admits a 𝜞-prewellordering.

The prewellordering property is related to the stronger scale property; in practice, many pointclasses having the prewellordering property also have the scale property, which allows drawing stronger conclusions.

Examples

𝜫11 and 𝜮21 both have the prewellordering property; this is provable in ZFC alone. Assuming sufficient large cardinals, for every n∈ω, 𝜫2n+11 and 𝜮2n+21 have the prewellordering property.

Consequences

Reduction

If 𝜞 is an adequate pointclass with the prewellordering property, then it also has the reduction property: For any space X∈ℱ and any sets A,B⊆X, A and B both in 𝜞, the union A∪B may be partitioned into sets A∗,B∗, both in 𝜞, such that A∗⊆A and B∗⊆B.

Separation

If 𝜞 is an adequate pointclass whose dual pointclass has the prewellordering property, then 𝜞 has the separation property: For any space X∈ℱ and any sets A,B⊆X, A and B disjoint sets both in 𝜞, there is a set C⊆X such that both C and its complement X∖C are in 𝜞, with A⊆C and B∩C=∅.

For example, 𝜫11 has the prewellordering property, so 𝜮11 has the separation property. This means that if A and B are disjoint analytic subsets of some Polish space X, then there is a Borel subset C of X such that C includes A and is disjoint from B.

See also

References

Template:Reflist Template:Refbegin

Template:Refend

Template:Order theory