The Axiom Shema of Comprehension in ZF set theory states that: Let P (x) be a property of x. For any A, there exists a B such that x∈B if and only if x∈A and P(x) holds. (https://www.math.uchicago.edu/~may/VIGRE/VIGRE2011/REUPapers/Lian.pdf) The paper does not state a definition for a property. How can we define a property in this set theory?
2026-04-18 06:53:27.1776495207
Definition of a property in ZF set theory
60 Views Asked by Bumbble Comm https://math.techqa.club/user/bumbble-comm/detail At
1
There are 1 best solutions below
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?
The author is speaking informally; the axiom scheme of comprehension, as well as that of replacement, has an axiom corresponding to each formula of first-order logic (that is, "property" is shorthand for "first-order formula with parameters"). This is identical to how the induction scheme works in (first-order) Peano arithmetic. You will find a better treatment in an actual textbook, e.g. Kunen.
To help understand this, here's what an instance of the comprehension scheme looks like. Let $\varphi(x, y_1, ..., y_n)$ be a first-order formula in $n+1$ variables ($n$ could be $0$). Then the corresponding instance of the comprehension scheme is $$\forall z, w_1, ..., w_n\exists u\forall x[x\in u\iff x\in z\wedge \varphi(x, w_1, ..., w_n)].$$ That is:
The fact that parameters are allowed here is very important (and things can get quite messy when we look at limiting the use of parameters!). As a concrete example, suppose $M$ is a model of ZFC and $a, b$ are in $M$. Then the comprehension scheme lets us prove that $$\{x: x\in a, x\not\in b\}$$ is in $M$ (or rather, if you want to be completely precise about it, the comprehension scheme tells us that there is an object $c$ in $M$ such that $M\models \forall x(x\in c\iff (x\in a\wedge x\not\in b)))$. In this case the instance of comprehension we use is that given by the formula $$\varphi(x, y_1)\equiv x\not\in y_1,$$ we take our parameter $w$ to be $b$, and we take our "outer set" to be $a$.