I am taking a class on Set Theory, and using the book $\textit{Set Theory}$ by Thomas Jech. Both in class and in the book, it was mentioned that the statement $X = \mathbb{P}(Y)$ is not a $\Delta_0$ (bounded quantifiers) formula, with my professor claiming that there is no $\Delta_0$ representation for this formula in particular because $\forall z \in X(z \subseteq Y)$ is not $\Delta_0$. I can't exactly figure out why. Can't we express this statement in the form $\forall z \in X \forall t\in z(t\in Y)$? Could we not then express the whole statement by saying $\forall z \in X \forall t\in z(t\in Y) \wedge [\forall y\in z (y \in Y) \Rightarrow z \in X]$? All these quantifiers seem bounded. Thanks in advance for any response.
2026-04-12 13:58:05.1776002285
Why is "$Y = \mathbb{P}(X)$ not a $\Delta_0$?
281 Views Asked by Bumbble Comm https://math.techqa.club/user/bumbble-comm/detail At
1
There are 1 best solutions below
Related Questions in LOGIC
- Theorems in MK would imply theorems in ZFC
- What is (mathematically) minimal computer architecture to run any software
- What formula proved in MK or Godel Incompleteness theorem
- Determine the truth value and validity of the propositions given
- Is this a commonly known paradox?
- Help with Propositional Logic Proof
- Symbol for assignment of a truth-value?
- Find the truth value of... empty set?
- Do I need the axiom of choice to prove this statement?
- Prove that any truth function $f$ can be represented by a formula $φ$ in cnf by negating a formula in dnf
Related Questions in SET-THEORY
- Theorems in MK would imply theorems in ZFC
- What formula proved in MK or Godel Incompleteness theorem
- Proving the schema of separation from replacement
- Understanding the Axiom of Replacement
- Ordinals and cardinals in ETCS set axiomatic
- Minimal model over forcing iteration
- How can I prove that the collection of all (class-)function from a proper class A to a class B is empty?
- max of limit cardinals smaller than a successor cardinal bigger than $\aleph_\omega$
- Canonical choice of many elements not contained in a set
- Non-standard axioms + ZF and rest of math
Trending Questions
- Induction on the number of equations
- How to convince a math teacher of this simple and obvious fact?
- Find $E[XY|Y+Z=1 ]$
- Refuting the Anti-Cantor Cranks
- What are imaginary numbers?
- Determine the adjoint of $\tilde Q(x)$ for $\tilde Q(x)u:=(Qu)(x)$ where $Q:U→L^2(Ω,ℝ^d$ is a Hilbert-Schmidt operator and $U$ is a Hilbert space
- Why does this innovative method of subtraction from a third grader always work?
- How do we know that the number $1$ is not equal to the number $-1$?
- What are the Implications of having VΩ as a model for a theory?
- Defining a Galois Field based on primitive element versus polynomial?
- Can't find the relationship between two columns of numbers. Please Help
- Is computer science a branch of mathematics?
- Is there a bijection of $\mathbb{R}^n$ with itself such that the forward map is connected but the inverse is not?
- Identification of a quadrilateral as a trapezoid, rectangle, or square
- Generator of inertia group in function field extension
Popular # Hahtags
second-order-logic
numerical-methods
puzzle
logic
probability
number-theory
winding-number
real-analysis
integration
calculus
complex-analysis
sequences-and-series
proof-writing
set-theory
functions
homotopy-theory
elementary-number-theory
ordinary-differential-equations
circles
derivatives
game-theory
definite-integrals
elementary-set-theory
limits
multivariable-calculus
geometry
algebraic-number-theory
proof-verification
partial-derivative
algebra-precalculus
Popular Questions
- What is the integral of 1/x?
- How many squares actually ARE in this picture? Is this a trick question with no right answer?
- Is a matrix multiplied with its transpose something special?
- What is the difference between independent and mutually exclusive events?
- Visually stunning math concepts which are easy to explain
- taylor series of $\ln(1+x)$?
- How to tell if a set of vectors spans a space?
- Calculus question taking derivative to find horizontal tangent line
- How to determine if a function is one-to-one?
- Determine if vectors are linearly independent
- What does it mean to have a determinant equal to zero?
- Is this Batman equation for real?
- How to find perpendicular vector to another vector?
- How to find mean and median from histogram
- How many sides does a circle have?
I think you've switched your "$Y$" and "$X$" - your formulas read like you're trying to describe "$X=\mathcal{P}(Y)$." I'll use that interpretation below.
"$\forall z\in X(z\subseteq Y)$" is definitely $\Delta_0$, so you're right there. However, to say that $X$ is the powereset of $Y$ you need to say that every subset of $Y$ occurs in $X$, and this requires unbounded quantification (or if you prefer, quantification over the powerset of $Y$ - which you don't have as a parameter).
In particular, in your purported definition $$"\forall z \in X \forall t\in z(t\in Y) \wedge [\forall y\in z (y \in Y) \Rightarrow z \in X],"$$ note that something weird is going on with the second occurrence of "$z$." Previously, $z$ was required to be an element of $X$ ("$\forall z\in X$"), but that makes the clause "$\forall y\in z(y\in Y)\implies z\in X$" trivial. Really, that clause has an implicit "$\forall z$" preceding it - but that's an unbounded quantifier!
Summary: The problem is that, while it's easy to express "every element of $X$ is a subset of $Y$" ($X\subseteq\mathcal{P}(Y)$) in a $\Delta_0$ way, saying "every subset of $Y$ is an element of $X$" ($X\supseteq\mathcal{P}(Y)$) is something we can't do in a bounded way. It's possible you either misheard your professor or they misspoke when describing the key obstacle here.
A bit of advanced content:
Note that the above doesn't prove that "$X=\mathcal{P}(Y)$" isn't $\Delta_0$-expressible, it just shows why your particular approach doesn't work. To show that it really isn't $\Delta_0$-expressible at all is harder: we need to find two models $M, N$ of ZFC and some objects $X,Y\in M$ such that
$N$ is an end extension of $M$. (This means that sets in $M$ don't "gain elements" when we pass to $N$; formally, $M\subseteq N$ as models and for each $m\in M$, we have $$\{n\in M: M\models n\in m\}=\{n\in N: N\models n\in m\}.$$ The point is - and this is a good exercise if you haven't done it already - that $\Delta_0$ formulas are preserved under end extensions.)
$M$ thinks $X$ is the powerset of $Y$: for every $z\in M$, if $z\subseteq Y$ (in the sense of $M$) then $z\in X$ (in the sense of $M$) and conversely.
$N$ doesn't think $X$ is the powerset of $Y$: there is some $z\in N$ with $z\not\in X$ (in the sense of $N$) but $z\subseteq Y$ (in the sense of $N$).
This is difficult, since building models of ZFC is hard (it's a really complicated theory!). But once we've developed the machinery of forcing, this becomes quite easy: if $M$ is a model of ZFC, $\mathbb{P}$ is any nontrivial forcing notion in $M$, and $G$ is $\mathbb{P}$-generic over $M$, then $M[G]$ is an end extension of $M$ which is a model of ZFC and $\mathcal{P}^M(\mathbb{P})\not=\mathcal{P}^{M[G]}(\mathbb{P})$ (since $M[G]$ contains a subset of $\mathbb{P}$ which doesn't appear in $M$ - namely, $G$ itself).
Maybe more interestingly: if $M$ is any countable model of ZFC, $Y\in M$, and $M$ thinks $Y$ is infinite, then there is a forcing notion which adds a new subset of $Y$; if $G$ is generic for this forcing over $M$ (and such a $G$ will exist since $M$ is countable), then $M[G]$ contains a subset of $Y$ which isn't in $M$, so the powerset of $Y$ changes when we go from $M$ to $M[G]$. In particular: even being $\mathcal{P}(\omega)$ isn't $\Delta_0$!