Search arXivSearch

arXiv · 2006.01103

Periodicity in the cumulative hierarchy

Abstract

We investigate the structure of rank-to-rank elementary embeddings, working in ZF set theory without the Axiom of Choice. Recall that the levels $V_α$ of the cumulative hierarchy are defined via iterated application of the power set operation, starting from $V_0=\emptyset$, and taking unions at limit stages. Assuming that $j:V_{α+1}\to V_{α+1}$ is a (non-trivial) elementary embedding, we show that the structure of $V_α$ is fundamentally different to that of $V_{α+1}$. We show that $j$ is definable from parameters over $V_{α+1}$ iff $α+1$ is an odd ordinal. Moreover, if $α+1$ is odd then $j$ is definable over $V_{α+1}$ from the parameter $j`` V_α=\{j(x)\bigm|x\in V_α\}$, and uniformly so. This parameter is optimal in that $j$ is not definable from any parameter which is an element of $V_α$. In the case that $α=β+1$, we also give a characterization of such $j$ in terms of ultrapower maps via certain ultrafilters. Assuming $λ$ is a limit ordinal, we prove that if $j:V_λ\to V_λ$ is $Σ_1$-elementary, then $j$ is not definable over $V_λ$ from parameters, and if $β<λ$ and $j:V_β\to V_λ$ is fully elementary and $\in$-cofinal, then $j$ is likewise not definable; note that this last result is relevant to embeddings of much lower consistency strength than rank-to-rank. If there is a Reinhardt cardinal, then for all sufficiently large ordinals $α$, there is indeed an elementary $j:V_α\to V_α$, and therefore the cumulative hierarchy is eventually periodic (with period 2).

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Gabriel Goldberg, Farmer Schlutzenberg. 2020-11-15. Periodicity in the cumulative hierarchy. https://arxiv.org/abs/2006.01103

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Bluebirds and mockingbirds cannot produce a fixed-point combinator

Let $B$ be the bluebird combinator with reduction rule $Bxyz \to_{w} x\left(yz\right)$, let $M$ be the mockingbird combinator with reduction rule $Mx \to_{w} xx$, and let $I$ be the identity bird combinator with reduction rule $Ix \to_{w} x$. A fixed-point combinator, called a sage bird by Smullyan, is a closed term $Y$ such that, for a fresh variable $x$, $Yx$ is equivalent to $x\left(Yx\right)$ under these reduction rules. For a fixed variable $x$, we construct an invariant $\mathrm{Tr}_{x}\left(u\right)$ of a $BMI$-term $u$ with respect to $\to_{w}$. This invariant traces the occurrences of $x$ in the leftmost-innermost reduction sequence of $u$. We then prove that $\mathrm{Tr}_{x}\left(Yx\right) \neq \mathrm{Tr}_{x}\left(x^{r}\left( Yx \right)\right)$ for every $x$-free $BMI$-term $Y$ and every $r\geq 1$. Consequently, there exists no fixed-point combinator in $BMI$-combinatory logic. This provides a negative answer to the problem posed by Smullyan in 1985.

math.LO

Pointwise provable equality and the failure of composition

Montagna (1989) and Di Paola--Montagna (1991) claim that the algebraic systems $S'$ and $S'_T$, respectively, are categories. We show that the proposed composition is not independent of the choice of representatives. For every consistent recursively enumerable extension $T$ of Peano arithmetic ($\mathrm{PA}$), we exhibit two program indices that are pointwise provably equal in $T$ but yield inequivalent composites when each is run after the same program. Montagna's $S'$ is the case $T=\mathrm{PA}$. The failure already occurs for partial maps from $ω$ to itself. Weak totality and the proposed range assignment also depend on the choice of representatives. More generally, for consistent $T\supseteq\mathrm{PA}$, pointwise provable equality is a composition congruence exactly when $T$ proves every true $Π^0_1$ sentence, in which case it is extensional equality. This completeness condition fails for every consistent recursively enumerable $T\supseteq\mathrm{PA}$ by Gödel's second incompleteness theorem. For every extension $T\supseteq\mathrm{PA}$, the least composition congruence containing pointwise provable equality is extensional equality if $T$ is $Σ^0_1$-sound and the universal relation otherwise.

math.LO

Compactness via Consistency Properties

We will use consistency properties to characterize strongly compact cardinals, first showing an adequate Model Existence Theorem for larger fragments.

math.LO