If $X$ is a set, let $\operatorname{CARD}(X)$ denote the Cardinal number of $X$. Let GCH(1) be the statement "If $K$ is an infinite initial ordinal number, then there exists no initial ordinal number $L$ such that $\operatorname{CARD}(X)<\operatorname{CARD}(L)<\operatorname{CARD}(2^X)$". Let GCH(2) be the stronger statement "If $X$ is an infinite set, then there exists no set $Y$ such that $\operatorname{CARD}(X)<\operatorname{CARD}(Y)<\operatorname{CARD}(2^X)$". Most discussions of GCH seem to be about GCH(1). Assume that we are working in ZF-without the Axiom of Choice. Sierpinski proved that GCH(2) implies the Axiom of Choice. Does GCH(1) also imply the Axiom of Choice?
2026-04-03 01:01:32.1775178092
Can we prove AC from the statement "There is no $\aleph$ cardinal strictly between $\operatorname{CARD}(X)$ and $\operatorname{CARD}(2^X)$"?
252 Views Asked by Bumbble Comm https://math.techqa.club/user/bumbble-comm/detail At
1
There are 1 best solutions below
Related Questions in ELEMENTARY-SET-THEORY
- how is my proof on equinumerous sets
- Composition of functions - properties
- Existence of a denumerble partition.
- Why is surjectivity defined using $\exists$ rather than $\exists !$
- Show that $\omega^2+1$ is a prime number.
- A Convention of Set Builder Notation
- I cannot understand that $\mathfrak{O} := \{\{\}, \{1\}, \{1, 2\}, \{3\}, \{1, 3\}, \{1, 2, 3\}\}$ is a topology on the set $\{1, 2, 3\}$.
- Problem with Cartesian product and dimension for beginners
- Proof that a pair is injective and surjective
- Value of infinite product
Related Questions in CARDINALS
- Ordinals and cardinals in ETCS set axiomatic
- max of limit cardinals smaller than a successor cardinal bigger than $\aleph_\omega$
- If $\kappa$ is a regular cardinal then $\kappa^{<\kappa} = \max\{\kappa, 2^{<\kappa}\}$
- Intuition regarding: $\kappa^{+}=|\{\kappa\leq\alpha\lt \kappa^{+}\}|$
- On finding enough rationals (countable) to fill the uncountable number of intervals between the irrationals.
- Is the set of cardinalities totally ordered?
- Show that $n+\aleph_0=\aleph_0$
- $COF(\lambda)$ is stationary in $k$, where $\lambda < k$ is regular.
- What is the cardinality of a set of all points on a line?
- Better way to define this bijection [0,1) to (0,1)
Related Questions in AXIOM-OF-CHOICE
- Do I need the axiom of choice to prove this statement?
- Canonical choice of many elements not contained in a set
- Strength of $\sf ZF$+The weak topology on every Banach space is Hausdorff
- Example of sets that are not measurable?
- A,B Sets injective map A into B or bijection subset A onto B
- Equivalence of axiom of choice
- Proving the axiom of choice in propositions as types
- Does Diaconescu's theorem imply cubical type theory is non-constructive?
- Axiom of choice condition.
- How does Axiom of Choice imply Axiom of Dependent Choice?
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?
As it turns out, the answer is negative. But the solution, as far as I understand requires [very] large cardinals.
To see this, first note that the first statement necessarily means that $X$ can be well-ordered (since it can be mapped into a well-ordered set injectively). So it suffices to show that for well-ordered sets this happens, while the axiom of choice fails. In fact it suffices to show that for every ordinal $\alpha$, $\aleph_{\alpha+1}\nleq2^{\aleph_\alpha}$.
Apter showed that it is consistent from a $3$-huge cardinal that there is a model of $\sf ZF$ in which every successor cardinal is Ramsey. (The paper mentions at the end that the consistency strength can be lowered to an almost huge cardinal.)
The proof that Ramsey cardinals are strongly inaccessible can be followed in $\sf ZF$ to obtain that if $\kappa\leq2^\lambda$ for some $\lambda<\kappa$, then $\kappa$ is not weakly compact, and in particular not Ramsey. The idea lies in the fact that in the lexicographic ordering of $2^\lambda$ there is no sequence which is strictly increasing, or strictly decreasing, of length $\lambda^+$.
While the failure of $\sf GCH(1)\rightarrow AC$ is probably not equiconsistent with a $3$-huge, or even an almost huge cardinal, it does imply the consistency of some large cardinals, to say the least.
If $\kappa^+\nleq2^\kappa$, then given any inner model $M$ which satisfy $\sf AC$, it is necessarily the case that $(\kappa^+)^M<(\kappa^+)^V$. Otherwise the two models agree on $\kappa^+$, and in $V$ the set $\mathcal P(\kappa)$ can only be larger.
This means that in any inner model satisfying choice, $\kappa^+$ is a limit cardinal. If $\kappa^+$ is regular there, it is inaccessible; if $\kappa$ happened to be singular, then we move to the next point.
Suppose that $\kappa$ is singular in $V$, either it is regular in some inner model, in which case $0^\#$ exists and we jumped quite high in the consistency strength; or $\kappa^+$ is a limit cardinal in $L$ (by the argument above) and therefore $(\kappa^+)^L\neq(\kappa^+)^V$ and we get back to $0^\#$.
My guess is that you can obtain this for successor ordinals without much more than a proper class of inaccessible cardinals; but once you need to change the successors of singular cardinals, you are in for much larger cardinals than just that.