Prewellordering Example Svg
   HOME

TheInfoList



OR:

In
set theory Set theory is the branch of mathematical logic that studies 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 mathematics, is mostly conce ...
, 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 and transitive. Preorders are more general than equivalence relations and (non-strict) partial orders, both of which are special c ...
\leq on X (a transitive and
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 an arbitrary directed graph form a partition into subgraphs that ...
relation on X) that is
wellfounded In mathematics, a binary relation ''R'' is called well-founded (or wellfounded) on a class ''X'' if every non-empty subset ''S'' âŠ† ''X'' has a minimal element with respect to ''R'', that is, an element ''m'' not related by ''s& ...
in the sense that the relation x \leq y \land y \nleq x is wellfounded. 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. Each equivalence relation ...
on X, and \leq induces a
wellordering In mathematics, a well-order (or well-ordering or well-order relation) on a set ''S'' is a total order on ''S'' with the property that every non-empty subset of ''S'' has a least element in this ordering. The set ''S'' together with the well-o ...
on the
quotient In arithmetic, a quotient (from lat, quotiens 'how many times', pronounced ) is a quantity produced by the division of two numbers. The quotient has widespread use throughout mathematics, and is commonly referred to as the integer part of a ...
X / \sim. 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 sets of points, where a ''point'' is ordinarily understood to be an element of some perfect Polish space. In practice, a pointclass is usually characterized by ...
of subsets of some collection \mathcal of
Polish space In the mathematical discipline of general topology, a Polish space is a separable completely metrizable topological space; that is, a space homeomorphic to a complete metric space that has a countable dense subset. Polish spaces are so named bec ...
s, \mathcal closed under
Cartesian product In mathematics, specifically set theory, the Cartesian product of two sets ''A'' and ''B'', denoted ''A''×''B'', is the set of all ordered pairs where ''a'' is in ''A'' and ''b'' is in ''B''. In terms of set-builder notation, that is : A\ti ...
, 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 In the mathematical field of descriptive set theory, a pointclass can be called adequate if it contains all recursive Recursion (adjective: ''recursive'') occurs when a thing is defined in terms of itself or of its type. Recursion is used in ...
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 In the mathematical field of descriptive set theory, a pointclass can be called adequate if it contains all recursive Recursion (adjective: ''recursive'') occurs when a thing is defined in terms of itself or of its type. Recursion is used in ...
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 A complement is something that completes something else. Complement may refer specifically to: The arts * Complement (music), an interval that, when added to another, spans an octave ** Aggregate complementation, the separation of pitch-class ...
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 Borel may refer to: People * Borel (author), 18th-century French playwright * Jacques Brunius, Borel (1906–1967), pseudonym of the French actor Jacques Henri Cottance * Émile Borel (1871 – 1956), a French mathematician known for his founding ...
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 integers *


References

* {{Order theory Binary relations Descriptive set theory Order theory Wellfoundedness