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 ...
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, ...
on
(a
transitive and
reflexive relation on
) 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
defined by
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 ...
is a
homogeneous binary relation on
that satisfies the following conditions:
- Reflexivity: for all
- Transitivity: if and then for all
- Total/Strongly connected: or for all
- for every non-empty subset there exists some such that for all
* This condition is equivalent to the induced strict preorder defined by and 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 on
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 ...
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 ...
such that for all
if and only if
Examples
Given a set
the binary relation on the set
of all finite subsets of
defined by
if and only if
(where
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
is a prewellordering on
then the relation
defined by
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
and
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 ...
The
order-type of this induced wellordering is an
ordinal, referred to as the length of the prewellordering.
A norm on a set
is a map from
into the ordinals. Every norm induces a prewellordering; if
is a norm, the associated prewellordering is given by
Conversely, every prewellordering is induced by a unique regular norm (a norm
is regular if, for any
and any
there is
such that
).
Prewellordering property
If
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
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,
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
is a prewellordering of some subset
of some element
of
then
is said to be a
-prewellordering of
if the relations
and
are elements of
where for
#
#
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
and
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
and
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
and any sets
and
both in
the union
may be partitioned into sets
both in
such that
and
Separation
If
is an
adequate pointclass whose
dual pointclass has the prewellordering property, then
has the separation property: For any space
and any sets
and
''disjoint'' sets both in
there is a set
such that both
and its
complement are in
with
and
For example,
has the prewellordering property, so
has the separation property. This means that if
and
are disjoint
analytic subsets of some Polish space
then there is a
Borel subset
of
such that
includes
and is disjoint from
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