|
|
| Line 1: |
Line 1: |
| In the mathematical discipline of [[set theory]], '''0<sup>#</sup>''' ('''zero sharp''', also '''0#''') is the set of true [[formula (mathematical logic)|formulae]] about [[indiscernibles]] and order-indiscernables in the [[Gödel constructible universe]]. It is often encoded as a subset of the integers (using [[Gödel numbering]]), or as a subset of the [[hereditarily finite set]]s, or as a [[Baire space (set theory)|real number]]. Its existence is unprovable in [[ZFC]], the standard form of [[axiomatic set theory]], but follows from a suitable [[large cardinal]] axiom. It was first introduced as a set of formulae in [[Jack Silver|Silver's]] 1966 thesis, later published as {{harvtxt|Silver|1971}}, where it was denoted by Σ, and rediscovered by {{harvtxt|Solovay|1967|loc=p.52}}, who considered it as a subset of the natural numbers and introduced the notation O<sup>#</sup> (with a capital letter O; this later changed to a number 0).
| | The person who wrote the blog is [http://Www.twitpic.com/tag/called+Eusebio called Eusebio]. His [http://photobucket.com/images/friends friends] say it's no real for him but what he loves doing is going to be acting and he's has been doing it for many years. Filing has been his profession as news got around. Massachusetts has always been his lifestyle place and his wife and kids loves it. Go to his website to find out more: http://prometeu.net<br><br>Here is my blog: clash of clans hack android ([http://prometeu.net source website]) |
| | |
| Roughly speaking, if 0<sup>#</sup> exists then the universe ''V'' of sets is much larger than the universe ''L'' of constructible sets, while if it does not exist then the universe of all sets is closely approximated by the constructible sets.
| |
| | |
| == Definition ==
| |
| | |
| Zero sharp was defined by Silver and Solovay as follows. Consider the language of set theory with extra constant symbols ''c''<sub>1</sub>, ''c''<sub>2</sub>, ... for each positive integer. Then 0<sup>#</sup> is defined to be the set of [[Gödel number]]s of the true sentences about the constructible universe, with ''c''<sub>''i''</sub> interpreted as the uncountable cardinal ℵ<sub>''i''</sub>.
| |
| (Here ℵ<sub>''i''</sub> means ℵ<sub>''i''</sub> in the full universe, not the constructible universe.)
| |
| | |
| There is a subtlety about this definition: by [[Tarski's undefinability theorem]] it is not in general possible to define the truth of a formula of set theory in the language of set theory. To solve this, Silver and Solovay assumed the existence of a suitable large cardinal, such as a [[Ramsey cardinal]], and showed that with this extra assumption it is possible to define the truth of statements about the constructible universe. More generally, the definition of 0<sup>#</sup> works provided that there is an uncountable set of indiscernibles for some ''L''<sub>α</sub>, and the phrase "0<sup>#</sup> exists" is used as a shorthand way of saying this.
| |
| | |
| There are several minor variations of the definition of 0<sup>#</sub>, which make no significant difference to its properties. There are many different choices of Gödel numbering, and 0<sup>#</sub> depends on this choice. Instead of being considered as a subset of the natural numbers, it is also possible to encode 0<sup>#</sub> as a subset of formulae of a language, or as a subset of the hereditarily finite sets, or as a real number.
| |
| | |
| ==Statements that imply the existence of 0<sup>#</sup>==
| |
| | |
| The condition about the existence of a Ramsey cardinal implying that 0<sup>#</sup> exists can be weakened. The existence of ω<sub>1</sub>-[[Erdős cardinal]]s implies the existence of 0<sup>#</sup>. This is close to being best possible, because the existence of 0<sup>#</sup> implies that in the constructible universe there is an α-Erdős cardinal for all countable α, so such cardinals cannot be used to prove the existence of 0<sup>#</sup>.
| |
| | |
| [[Chang's conjecture]] implies the existence of 0<sup>#</sup>.
| |
| | |
| ==Statements equivalent to existence of 0<sup>#</sup>==
| |
| Kunen showed that 0<sup>#</sup> exists if and only if there exists a non-trivial elementary embedding for the [[Gödel constructible universe]] ''L'' into itself.
| |
| | |
| [[Donald A. Martin]] and [[Leo Harrington]] have shown that the existence of 0<sup>#</sup> is equivalent to the determinacy of [[lightface analytic game]]s. In fact, the strategy for a universal lightface analytic game has the same [[Turing degree]] as 0<sup>#</sup>.
| |
| | |
| It follows from [[Jensen's covering theorem]] that the existence of 0<sup>#</sup> is equivalent to ω<sub>ω</sub> being a [[regular cardinal]] in the constructible universe ''L''.
| |
| | |
| Silver showed that the existence of an uncountable set of indiscernibles in the constructible universe is equivalent to the existence of 0<sup>#</sup>.
| |
| | |
| == Consequences of existence and non-existence ==
| |
| Its existence implies that every [[Uncountable set|uncountable]] [[Cardinal number|cardinal]] in the set-theoretic universe ''V'' is an indiscernible in ''L'' and satisfies all [[large cardinal]] axioms that are realized in ''L'' (such as being [[Ineffable cardinal|totally ineffable]]). It follows that the existence of 0<sup>#</sup> contradicts the ''[[axiom of constructibility]]'': ''V'' = ''L''.
| |
| | |
| If 0<sup>#</sup> exists, then it is an example of a non-constructible Δ{{su|p=1|b=3}} set of integers. This is in some sense the simplest possibility for a non-constructible set, since all Σ{{su|p=1|b=2}} and Π{{su|p=1|b=2}} sets of integers are constructible.
| |
| | |
| On the other hand, if 0<sup>#</sup> does not exist, then the constructible universe ''L'' is the core model—that is, the canonical inner model that approximates the large cardinal structure of the universe considered. In that case, [[Jensen's covering lemma]] holds:
| |
| | |
| :For every uncountable set ''x'' of ordinals there is a constructible ''y'' such that ''x'' ⊂ ''y'' and ''y'' has the same [[cardinality]] as ''x''. | |
| | |
| This deep result is due to [[Ronald Jensen]]. Using [[forcing (mathematics)|forcing]] it is easy to see that the condition that ''x'' is uncountable cannot be removed. For example, consider '''[[List of forcing_notions#Namba_forcing|Namba forcing]]''', that preserves <math>\omega_1</math> and collapses <math>\omega_2</math> to an ordinal of [[cofinality]] <math>\omega</math>. Let <math>G</math> be an <math>\omega</math>-sequence [[cofinal (mathematics)|cofinal]] on <math>\omega_2^L</math> and [[generic filter|generic]] over ''L''. Then no set in ''L'' of ''L''-size smaller than <math>\omega_2^L</math> (which is uncountable in ''V'', since <math>\omega_1</math> is preserved) can cover <math>G</math>, since <math>\omega_2</math> is a [[regular cardinal|regular]] cardinal.
| |
| | |
| == Other sharps ==
| |
| If x is any set, then x<sup>#</sup> is defined analogously to 0<sup>#</sup> except that one uses L[x] instead of L. See the section on relative constructibility in [[constructible universe]].
| |
| | |
| == See also ==
| |
| * [[Zero dagger|0<sup>†</sup>]], a set similar to 0<sup>#</sup> where the constructible universe is replaced by a larger inner model with a [[measurable cardinal]].
| |
| | |
| == References ==
| |
| * {{cite book|author=Drake, F. R.|title=Set Theory: An Introduction to Large Cardinals (Studies in Logic and the Foundations of Mathematics ; V. 76)|publisher=Elsevier Science Ltd|year=1974|isbn=0-444-10535-2}}
| |
| *{{Citation | last1=Harrington | first1=Leo | title=Analytic determinacy and 0<sup>#</sup> | doi=10.2307/2273508 | mr=518675 | year=1978 | journal=The Journal of Symbolic Logic | issn=0022-4812 | volume=43 | issue=4 | pages=685–693}}
| |
| * {{cite book|last=Kanamori|first=Akihiro|year=2003|publisher=Springer|authorlink=Akihiro Kanamori|title=The Higher Infinite : Large Cardinals in Set Theory from Their Beginnings|edition=2nd ed|isbn=3-540-00384-3}}
| |
| *{{Citation | last1=Martin | first1=Donald A. | title=Measurable cardinals and analytic games | url=http://matwbn.icm.edu.pl/tresc.php?wyd=1&tom=66 | mr=0258637 | year=1970 | journal=Polska Akademia Nauk. Fundamenta Mathematicae | issn=0016-2736 | volume=66 | pages=287–291}}
| |
| *{{Citation | last1=Silver | first1=Jack H. | title=Some applications of model theory in set theory | origyear=1966 | doi=10.1016/0003-4843(71)90010-6 | mr=0409188 | year=1971 | journal=Annals of Pure and Applied Logic | issn=0168-0072 | volume=3 | issue=1 | pages=45–110}}
| |
| *{{Citation | last1=Solovay | first1=Robert M. | author1-link=Robert M. Solovay | title=A nonconstructible Δ{{su|p=1|b=3}} set of integers | jstor=1994631 | MR=0211873 | year=1967 | journal=[[Transactions of the American Mathematical Society]] | issn=0002-9947 | volume=127 | pages=50–75}}
| |
| | |
| [[Category:Real numbers]]
| |
| [[Category:Determinacy]]
| |
| [[Category:Large cardinals]]
| |
| [[Category:Constructible universe]]
| |
The person who wrote the blog is called Eusebio. His friends say it's no real for him but what he loves doing is going to be acting and he's has been doing it for many years. Filing has been his profession as news got around. Massachusetts has always been his lifestyle place and his wife and kids loves it. Go to his website to find out more: http://prometeu.net
Here is my blog: clash of clans hack android (source website)