Hyperfunction: Difference between revisions

From formulasearchengine
Jump to navigation Jump to search
en>Stevenliuyi
m +zh
 
en>Enyokoyama
Line 1: Line 1:
<br><br>Bryan is often a celebrity inside the creating as well as the job development initial next to his third studio record, & , may be the confirmation. He burst on the scene in 2009 along with his amazing mixture of down-residence convenience, motion picture superstar wonderful appearance and words, is set t within a main way. The newest recor about the land graph and #2 around the put graphs, making it the second top very first during that time of   [http://www.senatorwonderling.com meet and greet luke bryan tickets] 2010 for a region artist. <br><br>The son of the ,  knows persistence and perseverance are important elements in  [http://minioasis.com concert tickets luke bryan] terms of an effective  job- . His to start with album, Stay Me, produced the best  reaches “All My Pals “Country and Say” Guy,” while his  effort, Doin’  Issue, located the artist-a few direct No. 5 singles:  Else Getting in touch with Is really a Great Factor.”<br><br>Inside the fall of 2015, Concert tour: Luke Bryan  And that had an amazing set of , which includes Downtown. “It’s much like you are getting a   approval to go to the next level, states those musicians that  [http://www.museodecarruajes.org is luke bryan touring in 2014] were a part of the Concert tourabove in a bigger degree of  [http://lukebryantickets.lazintechnologies.com photos luke bryan] designers.” It packaged as among the best  organized tours in its twenty-year history.<br><br>Here is my homepage :: [http://lukebryantickets.pyhgy.com last minute tickets]
{{Redirect|Thin set (set theory)|other uses|Thin set (disambiguation){{!}}Thin set}}
 
In [[mathematics]], particularly in [[set theory]] and [[model theory]], there are at least three notions of '''stationary set''':
 
==Classical notion==
If <math> \kappa \,</math> is a [[cardinal number|cardinal]] of uncountable [[cofinality]], <math> S \subseteq \kappa \,,</math> and <math> S \,</math> [[Intersection (set theory)|intersects]] every [[club set]] in <math> \kappa \,,</math> then <math> S \,</math> is called a '''stationary set'''. If a set is not stationary, then it is called a '''thin set'''. This notion should not be confused with the notion of a [[Thin set (Serre)|thin set in number theory]].
 
If <math> S \,</math> is a stationary set and <math> C \,</math> is a club set, then their intersection <math> S \cap C \,</math> is also stationary. Because if <math> D \,</math> is any club set, then <math> C \cap D \,</math> is a club set because the intersection of two club sets is club. Thus <math> (S \cap C) \cap D = S \cap (C  \cap D) \,</math> is non empty. Therefore <math> (S \cap C) \,</math> must be stationary.
 
''See also'': [[Fodor's lemma]]
 
The restriction to uncountable cofinality is in order to avoid trivialities: Suppose <math>\kappa</math> has countable cofinality. Then <math>S\subset\kappa</math> is stationary in <math>\kappa</math> if and only if <math>\kappa\setminus S</math> is bounded in <math>\kappa</math>. In particular, if the cofinality of <math>\kappa</math> is <math>\omega=\aleph_0</math>, then any two stationary subsets of <math>\kappa</math> have stationary intersection.
 
This is no longer the case if the cofinality of <math>\kappa</math> is uncountable. In fact, suppose <math>\kappa</math> is [[regular cardinal|regular]] and <math>S\subset\kappa</math> is stationary. Then <math>S</math> can be partitioned into <math>\kappa</math> many disjoint stationary sets. This result is due to [[Robert M. Solovay|Solovay]]. If <math>\kappa</math> is a [[successor cardinal]], this result is due to [[Stanislaw Ulam|Ulam]] and is easily shown by means of what is called an '''Ulam matrix'''.
 
==Jech's notion==
There is also a notion of stationary subset of <math>[X]^\lambda</math>, for <math>\lambda</math> a cardinal and <math>X</math> a set such that <math>|X|\ge\lambda</math>, where <math>[X]^\lambda</math> is the set of subsets of <math>X</math> of cardinality <math>\lambda</math>: <math>[X]^\lambda=\{Y\subset X:|Y|=\lambda\}</math>. This notion is due to [[Thomas Jech]]. As before, <math>S\subset[X]^\lambda</math> is stationary if and only if it meets every club, where a club subset of <math>[X]^\lambda</math> is a set unbounded under <math>\subset</math> and closed under union of chains of length at most <math>\lambda</math>. These notions are in general different, although for <math>X=\omega_1</math> and <math>\lambda=\aleph_0</math> they coincide in the sense that <math>S\subset[\omega_1]^\omega</math> is stationary if and only if <math>S\cap\omega_1</math> is stationary in <math>\omega_1</math>.
 
The appropriate version of Fodor's lemma also holds for this notion.
 
==Generalized notion==
There is yet a third notion, model theoretic in nature and sometimes referred to as '''generalized''' stationarity. This notion is probably due to [[Menachem Magidor|Magidor]], [[Matthew Foreman|Foreman]] and [[Saharon Shelah|Shelah]] and has also been used prominently by [[W. Hugh Woodin|Woodin]].
 
Now let <math>X</math> be a nonempty set. A set <math>C\subset{\mathcal P}(X)</math> is club (closed and unbounded) if and only if there is a function <math>F:[X]^{<\omega}\to X</math> such that <math>C=\{z:F[[z]^{<\omega}]\subset z\}</math>. Here, <math>[y]^{<\omega}</math> is the collection of finite subsets of <math>y</math>.
 
<math>S\subset{\mathcal P}(X)</math> is stationary in <math>{\mathcal P}(X)</math> if and only if it meets every club subset of <math>{\mathcal P}(X)</math>.
 
To see the connection with model theory, notice that if <math>M</math> is a [[Structure (mathematical logic)|structure]] with [[Universe (mathematics)|universe]] <math>X</math> in a countable language and <math>F</math> is a [[Skolem function]] for <math>M</math>, then a stationary <math>S</math> must contain an elementary substructure of <math>M</math>. In fact, <math>S\subset{\mathcal P}(X)</math> is stationary if and only if for any such structure <math>M</math> there is an elementary substructure of <math>M</math> that belongs to <math>S</math>.
 
== References ==
Matthew Foreman, ''Stationary sets, Chang's Conjecture and partition theory'', in Set Theory (The Hajnal Conference) DIMACS Ser. Discrete Math. Theoret. Comp. Sci., 58, Amer. Math. Soc., Providence, RI. 2002 pp.&nbsp;73–94
File at [http://www.math.uci.edu/sub2/Foreman/homepage/hajfin.ps]
 
== External links ==
* {{planetmath reference |id=3228|title=Stationary set}}
 
[[Category:Set theory]]
[[Category:Ordinal numbers]]

Revision as of 04:35, 4 December 2013

Name: Jodi Junker
My age: 32
Country: Netherlands
Home town: Oudkarspel
Post code: 1724 Xg
Street: Waterlelie 22

my page - www.hostgator1centcoupon.info

In mathematics, particularly in set theory and model theory, there are at least three notions of stationary set:

Classical notion

If κ is a cardinal of uncountable cofinality, Sκ, and S intersects every club set in κ, then S is called a stationary set. If a set is not stationary, then it is called a thin set. This notion should not be confused with the notion of a thin set in number theory.

If S is a stationary set and C is a club set, then their intersection SC is also stationary. Because if D is any club set, then CD is a club set because the intersection of two club sets is club. Thus (SC)D=S(CD) is non empty. Therefore (SC) must be stationary.

See also: Fodor's lemma

The restriction to uncountable cofinality is in order to avoid trivialities: Suppose κ has countable cofinality. Then Sκ is stationary in κ if and only if κS is bounded in κ. In particular, if the cofinality of κ is ω=0, then any two stationary subsets of κ have stationary intersection.

This is no longer the case if the cofinality of κ is uncountable. In fact, suppose κ is regular and Sκ is stationary. Then S can be partitioned into κ many disjoint stationary sets. This result is due to Solovay. If κ is a successor cardinal, this result is due to Ulam and is easily shown by means of what is called an Ulam matrix.

Jech's notion

There is also a notion of stationary subset of [X]λ, for λ a cardinal and X a set such that |X|λ, where [X]λ is the set of subsets of X of cardinality λ: [X]λ={YX:|Y|=λ}. This notion is due to Thomas Jech. As before, S[X]λ is stationary if and only if it meets every club, where a club subset of [X]λ is a set unbounded under and closed under union of chains of length at most λ. These notions are in general different, although for X=ω1 and λ=0 they coincide in the sense that S[ω1]ω is stationary if and only if Sω1 is stationary in ω1.

The appropriate version of Fodor's lemma also holds for this notion.

Generalized notion

There is yet a third notion, model theoretic in nature and sometimes referred to as generalized stationarity. This notion is probably due to Magidor, Foreman and Shelah and has also been used prominently by Woodin.

Now let X be a nonempty set. A set C𝒫(X) is club (closed and unbounded) if and only if there is a function F:[X]<ωX such that C={z:F[[z]<ω]z}. Here, [y]<ω is the collection of finite subsets of y.

S𝒫(X) is stationary in 𝒫(X) if and only if it meets every club subset of 𝒫(X).

To see the connection with model theory, notice that if M is a structure with universe X in a countable language and F is a Skolem function for M, then a stationary S must contain an elementary substructure of M. In fact, S𝒫(X) is stationary if and only if for any such structure M there is an elementary substructure of M that belongs to S.

References

Matthew Foreman, Stationary sets, Chang's Conjecture and partition theory, in Set Theory (The Hajnal Conference) DIMACS Ser. Discrete Math. Theoret. Comp. Sci., 58, Amer. Math. Soc., Providence, RI. 2002 pp. 73–94 File at [1]

External links