More precisely, is either of the following two statements consistent with ZF:
$2^{\aleph_0}\geq\aleph_{\alpha}$ for every ordinal number $\alpha$,
$2^{\aleph_0}\leq\aleph_{\alpha}\implies 2^{\aleph_0}=\aleph_{\alpha}$ for every ordinal number $\alpha$?
I'm asking mainly out of curiosity.
Both are inconsistent with ZFC, and the first is inconsistent with ZF as well.
The axiom of infinity tells us that $\mathbb N$, the collection of natural numbers (or finite ordinals) is a set. The axiom of power set tells us therefore that every set has a power set, in particular $\mathbb N$.
We know that the size of $P(\mathbb N)=\mathbb R$ is $2^{\aleph_0}$, however this can be $\aleph_1$ or $\aleph_2$ or even higher. Without the axiom of choice it might not even be an $\aleph$ number.
So we have that $\mathbb R$ is a set, therefore so is $\mathbb R\times\mathbb R$. It therefore has as power set, from which we can take all the subsets of $\mathbb R\times\mathbb R$ which are order relations on some subset of $\mathbb R$, and we can take all those which are well ordered.
Each is order isomorphic to a unique ordinal, so mapping every relation $R$ from this collection to the ordinal is a function defined by a formula (possibly with parameters), whose domain is a set. By the axiom of replacement the image is a set of ordinals, since isomorphism goes "both ways" we have that this is the same set as $\{\beta\in\mathrm{Ord}\mid\ \exists f\colon\beta\to\mathbb R\text{ injective}\}$
Since $\mathbb R$ is a set there can only be set many ordinals of this property, the least ordinal above them is called Hartogs number of $\mathbb R$ and it cannot be injected into $\mathbb R$, denote it by $\aleph(\mathbb R)$, we have if so that $\aleph(R)\nleq\mathbb R$.
As for the second question, if we assume the axiom of choice then the previous argument shows that for some $\aleph_\alpha$ we have that $2^{\aleph_0}<\aleph_\alpha$, and therefore for all $\beta>\alpha$. The second assertion implies, if so, that $\aleph_\alpha=\aleph_\beta=2^{\aleph_0}$ for almost all ordinals.
However without the axiom of choice it is consistent to have that for every ordinal (finite or not) we have either $\alpha=0$ and then $\aleph_0<2^{\aleph_0}$ and otherwise $\aleph_\alpha\neq 2^{\aleph_0}$. This would make the assumption in the implication of the second assertion false and the assertion itself vacuously true.
Further reading:
I am reading your statement "$2^{\aleph_0} \geq \aleph_\alpha$" to say that there is an injection from $\omega_\alpha$ into $\mathbb{R}$. (And similarly for "$2^{\aleph_0} \leq \aleph_\alpha$".)
(1) is not consistent, since given any set $X$, there are only set-many well-orderings of subsets of $X$. (Without Choice, define $WO(X) = \{ R : R\text{ is a well-ordering of a subset of }X \}$. This is clearly a set by Power Set, Pairing and Separation). Using Replacement the family of order-types of elements of $WO(X)$ is also a set. From this it follows that for every set $X$ there must be an $\alpha$ such that "$\aleph_\alpha \leq | X |$" does not hold.
(2) would only be consistent vacuously: where there is no well-ordering of the reals and so the statement $2^{\aleph_0} \leq \aleph_\alpha$ never holds. (If there is an injection from $\mathbb{R}$ into $\omega_\alpha$, then there is also an injection from $\mathbb{R}$ into $\omega_{\alpha+1}$, and clearly $\aleph_\alpha \neq \aleph_{\alpha+1}$.)
Being careful about quantifiers, the answer to your first question is yes, and to your second one is no. More precisely, for any ordinal $\alpha$ there is a forcing extension of the universe where (not just ZF but even ZFC holds and) $2^{\aleph_0} \ge\aleph_\alpha$. A simple modification of Cohen's original argument works. What Cohen proved is that one can "add lots of (Cohen) reals" to the universe without changing any cardinals, meaning that if and ordinal $\alpha$ was a cardinal, then it is a cardinal after adding all those reals. So, if you add at least $\aleph_\alpha$ reals, in the forcing extension the continuum has size at least $\aleph_\alpha$.
However, equality is not always possible, at least under some choice. There is a basic restriction: Koenig proved that $\kappa^{cf(\kappa)}>\kappa$ for any infinite cardinal $\kappa$. Since $(2^{\aleph_0})^{\aleph_0}=2^{\aleph_0}$, we conclude that $2^{\aleph_0}$ cannot be a cardinal of cofinality $\omega$.
Solovay proved (right after Cohen's result) that this is basically the only objection: Cohen's construction mentioned above not only "preserves cardinals" but in fact preserves all cofinalities. Solovay showed that if we start in Goedel's L, or more generally in a model of the GCH, then adding $\aleph_\alpha$ Cohen reals gives a model where $2^{\aleph_0}$ is precisely $\aleph_\alpha$, provided that $\aleph_\alpha$ did not have countable cofinality to begin with.
For example, if one adds $\aleph_\omega$ Cohen reals, then somehow one has actually added $\aleph_{\omega+1}$ reals.
If the original model is not a model of GCH, then there is an obvious additional restriction, given by monotonicity of cardinal exponentiation: If $2^\kappa >\lambda > \kappa$, then of course we cannot preserve all cardinals and make $2^{\aleph_0}=\lambda$, regardless of the cofinality of $\lambda$. But this situation does not occur if GCH holds.
I see that you meant literally to have the quantifiers the way you wrote them. The answer to the first question is now no: Hartog proved (in ZF) that for any set $X$ there is an upper bound on the ordinals that can inject into $X$. This is easy to see: If $\alpha$ injects into $X$, then there is a subset $Y$ of $X$ and a binary relation $R$ on that subset such that $(Y,R)$ is isomorphic to $(\alpha,\in)$. But then the collection of $\alpha$ that inject into $X$ is a set (the image of the collection of such pairs $(Y,R)$).
As for the second question, the answer is no if the reals are well-orderable, because they are always larger than $\aleph_0$, since Cantor theorem does not use choice. The answer is yes (vacuously) if the reals cannot be well-ordered, and this is consistent. (Cohen's proof that choice is independent of ZF actually gives models where the reals are not well-orderable.)
1.instead of(1)the software will parse this as an ordered list automatically... – Asaf Karagila Mar 02 '12 at 16:11