---
title: Zero sharp
slug: zero-sharp
qid: 
snapshot: enwiki-001375049995
content_hash: 
license: CC BY-SA 4.0
source: https://en.wikipedia.org/w/index.php?oldid=1375049995
tags: [116685906, 20477142, 23118434, 23603337, 24745114, 25823649, 27946839, 28342526]
---

# Zero sharp

> [!note] Provenance
> Snapshot `enwiki-001375049995` · content root `…`
> Derived from <https://en.wikipedia.org/w/index.php?oldid=1375049995> · Licensed CC BY-SA 4.0

In the mathematical discipline of set theory, 0 # (zero sharp, also 0#) is the set of true formulae about indiscernibles and order-indiscernibles in the Gödel constructible universe. It is often encoded as a subset of the natural numbers (using Gödel numbering), or as a subset of the hereditarily finite sets, or as a 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 Silver's 1966 thesis, later published as , where it was denoted by Σ, and rediscovered by , who considered it as a subset of the natural numbers and introduced the notation O # (with a capital letter O; this later changed to the numeral '0'). Roughly speaking, if 0 # 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.

In the mathematical discipline of set theory, 0 # (zero sharp, also 0#) is the set of true formulae about indiscernibles and order-indiscernibles in the Gödel constructible universe. It is often encoded as a subset of the natural numbers (using Gödel numbering), or as a subset of the hereditarily finite sets, or as a 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 Silver's 1966 thesis, later published as , where it was denoted by Σ, and rediscovered by , who considered it as a subset of the natural numbers and introduced the notation O # (with a capital letter O; this later changed to the numeral '0'). Roughly speaking, if 0 # 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. ==Statements implying existence== The condition about the existence of a Ramsey cardinal implying that 0^\sharp exists can be weakened. The existence of \omega_1 -Erdős cardinals implies the existence of 0^\sharp . This is close to being best possible, because the existence of 0^\sharp implies that in the constructible universe there is an \alpha -Erdős cardinal for all countable \alpha , so such cardinals cannot be used to prove the existence of 0^\sharp . Chang's conjecture implies the existence of 0^\sharp . ==Statements equivalent to existence== Kenneth Kunen showed that 0^\sharp exists if and only if there exists a non-trivial elementary embedding of the Gödel constructible universe L into itself. Donald A. Martin and Leo Harrington have shown that the existence of 0^\sharp is equivalent to the determinacy of lightface analytic games. In fact, the strategy for a universal lightface analytic game has the same Turing degree as 0^\sharp . It follows from Jensen's covering theorem that the existence of 0^\sharp is equivalent to \omega_\omega of V 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^\sharp . The existence of 0^\sharp implies that every uncountable 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 totally ineffable). It follows that the existence of 0^\sharp contradicts the axiom of constructibility: V=L . If 0^\sharp exists, then it is an example of a non-constructible \Delta^1_3 set of natural numbers. This is in some sense the simplest possibility for a non-constructible set, since all \Sigma^1_2 and \Pi^1_2 sets of natural numbers are constructible. On the other hand, if 0^\sharp 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\subseteq y and y has the same cardinality as x . This deep result is due to Ronald Jensen. Using forcing it is easy to see that the condition that x is uncountable cannot be removed. For example, consider Namba forcing, that preserves \omega_1 and collapses \omega_2 to an ordinal of cofinality \omega . Let G be an \omega -sequence cofinal on \omega_2^L and generic over L . Then no set in L of L -size smaller than \omega_2^L (which is uncountable in V , since \omega_1 is preserved) can cover G , since \omega_2 is a regular cardinal. If 0^\sharp does not exist, it also follows that the singular cardinals hypothesis holds. p. 20 ===Citations===
