HOME

TheInfoList



OR:

In
set theory Set theory is the branch of mathematical logic that studies Set (mathematics), sets, which can be informally described as collections of objects. Although objects of any kind can be collected into a set, set theory – as a branch of mathema ...
, a prewellordering on a
set Set, The Set, SET or SETS may refer to: Science, technology, and mathematics Mathematics *Set (mathematics), a collection of elements *Category of sets, the category whose objects and morphisms are sets and total functions, respectively Electro ...
X is a
preorder In mathematics, especially in order theory, a preorder or quasiorder is a binary relation that is reflexive relation, reflexive and Transitive relation, transitive. The name is meant to suggest that preorders are ''almost'' partial orders, ...
\leq on X (a transitive and reflexive relation on X) that is
strongly connected In the mathematical theory of directed graphs, a graph is said to be strongly connected if every vertex is reachable from every other vertex. The strongly connected components of a directed graph form a partition into subgraphs that are thems ...
(meaning that any two points are comparable) and
well-founded In mathematics, a binary relation is called well-founded (or wellfounded or foundational) on a set (mathematics), set or, more generally, a Class (set theory), class if every non-empty subset has a minimal element with respect to ; that is, t ...
in the sense that the induced relation x < y defined by x \leq y \text y \nleq x is a
well-founded relation In mathematics, a binary relation is called well-founded (or wellfounded or foundational) on a set or, more generally, a class if every non-empty subset has a minimal element with respect to ; that is, there exists an such that, for every , ...
.


Prewellordering on a set

A prewellordering on a
set Set, The Set, SET or SETS may refer to: Science, technology, and mathematics Mathematics *Set (mathematics), a collection of elements *Category of sets, the category whose objects and morphisms are sets and total functions, respectively Electro ...
X is a homogeneous binary relation \,\leq\, on X that satisfies the following conditions:
  1. Reflexivity: x \leq x for all x \in X.
  2. Transitivity: if x < y and y < z then x < z for all x, y, z \in X.
  3. Total/Strongly connected: x \leq y or y \leq x for all x, y \in X.
  4. for every non-empty subset S \subseteq X, there exists some m \in S such that m \leq s for all s \in S. * This condition is equivalent to the induced strict preorder x < y defined by x \leq y and y \nleq x being a
    well-founded relation In mathematics, a binary relation is called well-founded (or wellfounded or foundational) on a set or, more generally, a class if every non-empty subset has a minimal element with respect to ; that is, there exists an such that, for every , ...
    .
A homogeneous binary relation \,\leq\, on X is a prewellordering if and only if there exists a
surjection In mathematics, a surjective function (also known as surjection, or onto function ) is a function such that, for every element of the function's codomain, there exists one element in the function's domain such that . In other words, for a f ...
\pi : X \to Y into a
well-ordered set In mathematics, a well-order (or well-ordering or well-order relation) on a set is a total ordering on with the property that every non-empty subset of has a least element in this ordering. The set together with the ordering is then called a ...
(Y, \lesssim) such that for all x, y \in X, x \leq y if and only if \pi(x) \lesssim \pi(y).


Examples

Given a set A, the binary relation on the set X := \operatorname(A) of all finite subsets of A defined by S \leq T if and only if , S, \leq , T, (where , \cdot, denotes the set's
cardinality The thumb is the first digit of the hand, next to the index finger. When a person is standing in the medical anatomical position (where the palm is facing to the front), the thumb is the outermost digit. The Medical Latin English noun for thum ...
) is a prewellordering.


Properties

If \leq is a prewellordering on X, then the relation \sim defined by x \sim y \text x \leq y \land y \leq x is an
equivalence relation In mathematics, an equivalence relation is a binary relation that is reflexive, symmetric, and transitive. The equipollence relation between line segments in geometry is a common example of an equivalence relation. A simpler example is equ ...
on X, and \leq induces a wellordering on the
quotient In arithmetic, a quotient (from 'how many times', pronounced ) is a quantity produced by the division of two numbers. The quotient has widespread use throughout mathematics. It has two definitions: either the integer part of a division (in th ...
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 \phi : X \to Ord is a norm, the associated prewellordering is given by x \leq y \text \phi(x) \leq \phi(y) Conversely, every prewellordering is induced by a unique regular norm (a norm \phi : X \to Ord is regular if, for any x \in X and any \alpha < \phi(x), there is y \in X such that \phi(y) = \alpha).


Prewellordering property

If \boldsymbol is a
pointclass In the mathematical field of descriptive set theory, a pointclass is a collection of Set (mathematics), sets of point (mathematics), points, where a ''point'' is ordinarily understood to be an element of some perfect set, perfect Polish space. In ...
of subsets of some collection \mathcal of
Polish space In the mathematical discipline of general topology, a Polish space is a separable space, separable Completely metrizable space, completely metrizable topological space; that is, a space homeomorphic to a Complete space, complete metric space that h ...
s, \mathcal closed under
Cartesian product In mathematics, specifically set theory, the Cartesian product of two sets and , denoted , is the set of all ordered pairs where is an element of and is an element of . In terms of set-builder notation, that is A\times B = \. A table c ...
, and if \leq is a prewellordering of some subset P of some element X of \mathcal, then \leq is said to be a \boldsymbol-prewellordering of P if the relations <^* and \leq^* are elements of \boldsymbol, where for x, y \in X, # x <^* y \text x \in P \land (y \notin P \lor (x \leq y \land y \not\leq x)) # x \leq^* y \text x \in P \land (y \notin P \lor x \leq y) \boldsymbol is said to have the prewellordering property if every set in \boldsymbol admits a \boldsymbol-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

\boldsymbol^1_1 and \boldsymbol^1_2 both have the prewellordering property; this is provable in ZFC alone. Assuming sufficient
large cardinal In the mathematical field of set theory, a large cardinal property is a certain kind of property of transfinite cardinal numbers. Cardinals with such properties are, as the name suggests, generally very "large" (for example, bigger than the least ...
s, for every n \in \omega, \boldsymbol^1_ and \boldsymbol^1_ have the prewellordering property.


Consequences


Reduction

If \boldsymbol is an adequate pointclass with the prewellordering property, then it also has the reduction property: For any space X \in \mathcal and any sets A, B \subseteq X, A and B both in \boldsymbol, the union A \cup B may be partitioned into sets A^*, B^*, both in \boldsymbol, such that A^* \subseteq A and B^* \subseteq B.


Separation

If \boldsymbol is an adequate pointclass whose dual pointclass has the prewellordering property, then \boldsymbol has the separation property: For any space X \in \mathcal and any sets A, B \subseteq X, A and B ''disjoint'' sets both in \boldsymbol, there is a set C \subseteq X such that both C and its complement X \setminus C are in \boldsymbol, with A \subseteq C and B \cap C = \varnothing. For example, \boldsymbol^1_1 has the prewellordering property, so \boldsymbol^1_1 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

* * – a graded poset is analogous to a prewellordering with a norm, replacing a map to the ordinals with a map to the natural numbers *


References

* * {{Order theory Descriptive set theory Order theory Wellfoundedness