Drag (physics): Difference between revisions
en>NjardarBot m r2.7.3) (Robot: Adding nn:Luftmotstand |
en>ClueBot NG m Reverting possible vandalism by 75.73.132.85 to version by 85.110.45.5. False positive? Report it. Thanks, ClueBot NG. (1668308) (Bot) |
||
Line 1: | Line 1: | ||
In [[set theory]], a '''prewellordering''' is a [[binary relation]] <math>\le</math> that is [[Transitive relation|transitive]], [[total relation|total]], and [[Well-founded relation|wellfounded]] (more precisely, the relation <math>x\le y\land y\nleq x</math> is wellfounded). In other words, if <math>\leq</math> is a prewellordering on a set <math>X</math>, and if we define <math>\sim</math> by | |||
:<math>x\sim y\iff x\leq y \land y\leq x</math> | |||
then <math>\sim</math> is an [[equivalence relation]] on <math>X</math>, and <math>\leq</math> induces a [[wellordering]] on the [[Quotient set|quotient]] <math>X/\sim</math>. The [[order-type]] of this induced wellordering is an [[ordinal number|ordinal]], referred to as the '''length''' of the prewellordering. | |||
A '''norm''' on a set <math>X</math> is a map from <math>X</math> into the ordinals. Every norm induces a prewellordering; if <math>\phi:X\to Ord</math> is a norm, the associated prewellordering is given by | |||
:<math>x\leq y\iff\phi(x)\leq\phi(y)</math> | |||
Conversely, every prewellordering is induced by a unique '''regular norm''' (a norm <math>\phi:X\to Ord</math> is regular if, for any <math>x\in X</math> and any <math>\alpha<\phi(x)</math>, there is <math>y\in X</math> such that <math>\phi(y)=\alpha</math>). | |||
== Prewellordering property == | |||
If <math>\boldsymbol{\Gamma}</math> is a [[pointclass]] of subsets of some collection <math>\mathcal{F}</math> of [[Polish space]]s, <math>\mathcal{F}</math> closed under [[Cartesian product]], and if <math>\leq</math> is a prewellordering of some subset <math>P</math> of some element <math>X</math> of <math>\mathcal{F}</math>, then <math>\leq</math> is said to be a <math>\boldsymbol{\Gamma}</math>-'''prewellordering''' of <math>P</math> if the relations <math><^*\,</math> and <math>\leq^*</math> are elements of <math>\boldsymbol{\Gamma}</math>, where for <math>x,y\in X</math>, | |||
# <math>x<^*y\iff x\in P\land[y\notin P\lor\{x\leq y\land y\not\leq x\}]</math> | |||
# <math>x\leq^* y\iff x\in P\land[y\notin P\lor x\leq y]</math> | |||
<math>\boldsymbol{\Gamma}</math> is said to have the '''prewellordering property''' if every set in <math>\boldsymbol{\Gamma}</math> admits a <math>\boldsymbol{\Gamma}</math>-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=== | |||
<math>\boldsymbol{\Pi}^1_1\,</math> and <math>\boldsymbol{\Sigma}^1_2</math> both have the prewellordering property; this is provable in [[Zermelo-Fraenkel set theory|ZFC]] alone. Assuming sufficient [[large cardinal]]s, for every <math>n\in\omega</math>, <math>\boldsymbol{\Pi}^1_{2n+1}</math> and <math>\boldsymbol{\Sigma}^1_{2n+2}</math> | |||
have the prewellordering property. | |||
===Consequences=== | |||
====Reduction==== | |||
If <math>\boldsymbol{\Gamma}</math> is an [[adequate pointclass]] with the prewellordering property, then it also has the '''reduction property''': For any space <math>X\in\mathcal{F}</math> and any sets <math>A,B\subseteq X</math>, <math>A</math> and <math>B</math> both in <math>\boldsymbol{\Gamma}</math>, the union <math>A\cup B</math> may be partitioned into sets <math>A^*,B^*\,</math>, both in <math>\boldsymbol{\Gamma}</math>, such that <math>A^*\subseteq A</math> and <math>B^*\subseteq B</math>. | |||
====Separation==== | |||
If <math>\boldsymbol{\Gamma}</math> is an [[adequate pointclass]] whose [[dual pointclass]] has the prewellordering property, then <math>\boldsymbol{\Gamma}</math> has the '''separation property''': For any space <math>X\in\mathcal{F}</math> and any sets <math>A,B\subseteq X</math>, <math>A</math> and <math>B</math> ''disjoint'' sets both in <math>\boldsymbol{\Gamma}</math>, there is a set <math>C\subseteq X</math> such that both <math>C</math> and its [[Complement (set theory)|complement]] <math>X\setminus C</math> are in <math>\boldsymbol{\Gamma}</math>, with <math>A\subseteq C</math> and <math>B\cap C=\emptyset</math>. | |||
For example, <math>\boldsymbol{\Pi}^1_1</math> has the prewellordering property, so <math>\boldsymbol{\Sigma}^1_1</math> has the separation property. This means that if <math>A</math> and <math>B</math> are disjoint [[analytic set|analytic]] subsets of some Polish space <math>X</math>, then there is a [[Borel set|Borel]] subset <math>C</math> of <math>X</math> such that <math>C</math> includes <math>A</math> and is disjoint from <math>B</math>. | |||
== See also == | |||
*[[Descriptive set theory]] | |||
*[[Scale property]] | |||
*[[Graded poset]] – a graded poset is analogous to a prewellordering with a norm, replacing a map to the ordinals with a map to the integers | |||
== References == | |||
* {{cite book | author=Moschovakis, Yiannis N. | title=Descriptive Set Theory | publisher=North Holland | year=1980 |isbn=0-444-70199-0}} | |||
[[Category:Mathematical relations]] | |||
[[Category:Descriptive set theory]] | |||
[[Category:Wellfoundedness]] | |||
[[Category:Order theory]] |
Revision as of 23:41, 24 January 2014
In set theory, a prewellordering is a binary relation that is transitive, total, and wellfounded (more precisely, the relation is wellfounded). In other words, if is a prewellordering on a set , and if we define by
then is an equivalence relation on , and induces a wellordering on the quotient . 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 of subsets of some collection of Polish spaces, closed under Cartesian product, 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 cardinals, 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
- Descriptive set theory
- Scale property
- Graded poset – a graded poset is analogous to a prewellordering with a norm, replacing a map to the ordinals with a map to the integers
References
- 20 year-old Real Estate Agent Rusty from Saint-Paul, has hobbies and interests which includes monopoly, property developers in singapore and poker. Will soon undertake a contiki trip that may include going to the Lower Valley of the Omo.
My blog: http://www.primaboinca.com/view_profile.php?userid=5889534