Prewellordering

Prewellordering

In set theory, a prewellordering is a binary relation that is transitive, wellfounded, and total. In other words, if leq is a prewellordering on a set X, and if we define sim by:xsim yiff xleq y land yleq xthen sim is an equivalence relation on X, and leq induces a wellordering on the quotient 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 o Ord is a norm, the associated prewellordering is given by:xleq yiffphi(x)leqphi(y)Conversely, every prewellordering is induced by a unique regular norm (a norm phi:X o Ord is regular if, for any xin X and any alpha, there is yin X such that phi(y)=alpha).

Prewellordering property

If oldsymbol{Gamma} is a pointclass of subsets of some collection mathcal{F} of Polish spaces, mathcal{F} closed under Cartesian product, and if leq is a prewellordering of some subset P of some element X of mathcal{F}, then leq is said to be a oldsymbol{Gamma}-prewellordering of P if the relations <^*, and leq^* are elements of oldsymbol{Gamma}, where for x,yin X,
# x<^*yiff xin Pland [y otin Plor{xleq yland y otleq x}]
# xleq^* yiff xin Pland [y otin Plor xleq y]

oldsymbol{Gamma} is said to have the prewellordering property if every set in oldsymbol{Gamma} admits a oldsymbol{Gamma}-prewellordering.

Examples

oldsymbol{Pi}^1_1, and oldsymbol{Sigma}^1_2 both have the prewellordering property; this is provable in ZFC alone. Assuming sufficient large cardinals, for every ninomega, oldsymbol{Pi}^1_{2n+1} and oldsymbol{Sigma}^1_{2n+2}have the prewellordering property.

Consequences

Reduction

If oldsymbol{Gamma} is an adequate pointclass with the prewellordering property, then it also has the reduction property: For any space Xinmathcal{F} and any sets A,Bsubseteq X, A and B both in oldsymbol{Gamma}, the union Acup B may be partitioned into sets A^*,B^*,, both in oldsymbol{Gamma}, such that A^*subseteq A and B^*subseteq B.

eparation

If oldsymbol{Gamma} is an adequate pointclass whose dual pointclass has the prewellordering property, then oldsymbol{Gamma} has the separation property: For any space Xinmathcal{F} and any sets A,Bsubseteq X, A and B "disjoint" sets both in oldsymbol{Gamma}, there is a set Csubseteq X such that both C and its complement Xsetminus C are in oldsymbol{Gamma}, with Asubseteq C and Bcap C=emptyset.

For example, oldsymbol{Pi}^1_1 has the prewellordering property, so oldsymbol{Sigma}^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.

References

*


Wikimedia Foundation. 2010.

Игры ⚽ Поможем решить контрольную работу

Look at other dictionaries:

  • Determinacy — Determined redirects here. For the 2005 heavy metal song, see Determined (song). For other uses, see Indeterminacy (disambiguation). In set theory, a branch of mathematics, determinacy is the study of under what circumstances one or the other… …   Wikipedia

  • Preorder — In mathematics, especially in order theory, preorders are binary relations that satisfy certain conditions. For example, all partial orders and equivalence relations are preorders. The name quasiorder is also common for preorders. Other notations …   Wikipedia

  • Well-order — In mathematics, a well order relation (or well ordering) 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.Equivalently, a well ordering is a well founded total order.The set… …   Wikipedia

  • List of mathematical logic topics — Clicking on related changes shows a list of most recent edits of articles to which this page links. This page links to itself in order that recent changes to this page will also be included in related changes. This is a list of mathematical logic …   Wikipedia

  • List of order topics — This is a list of order topics, by Wikipedia page.An alphabetical list of many notions of order theory can be found in the order theory glossary. See also inequality, extreme value, optimization (mathematics), domain theory.Basic… …   Wikipedia

  • Descriptive set theory — In mathematical logic, descriptive set theory is the study of certain classes of well behaved subsets of the real line and other Polish spaces. As well as being one of the primary areas of research in set theory, it has applications to other… …   Wikipedia

  • Well-quasi-ordering — In mathematics, specifically order theory, a well quasi ordering or wqo is a well founded quasi ordering with an additional restriction on sequences that there is no infinite sequence x i with x i ot le x j for all i < j . Motivation We can use… …   Wikipedia

  • Norm (mathematics) — This article is about linear algebra and analysis. For field theory, see Field norm. For ideals, see Norm of an ideal. For group theory, see Norm (group). For norms in descriptive set theory, see prewellordering. In linear algebra, functional… …   Wikipedia

  • Norm — or NORM may refer to: Contents 1 In academia 1.1 In mathematics 2 People 3 Miscellaneous 4 …   Wikipedia

  • List of mathematics articles (P) — NOTOC P P = NP problem P adic analysis P adic number P adic order P compact group P group P² irreducible P Laplacian P matrix P rep P value P vector P y method Pacific Journal of Mathematics Package merge algorithm Packed storage matrix Packing… …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”