Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

Is it possible to show that every cardinality has an ordinal with this cardinality (without the axiom of choice)? If so, how?

share|cite|improve this question
Please define "cardinality" in your choiceless setting. – BrianO Jan 9 at 18:14
This might be relevant for this question: Defining cardinality in the absence of choice – Martin Sleziak Jan 9 at 22:36

The statement "every cardinality has an ordinal with this cardinality" is equivalent to axiom of choice (and hence is unprovable without it). It is so because, if you think about it a little, your statement is equivalent "every set has an ordinal of the same cardinality", and so "for every set there is a bijection between it and some ordinal" and thus "every set can be well-ordered", which is well-known to be equivalent to axiom of choice.

share|cite|improve this answer

I'm no expert, but I think no. IIRC, ordinals are linearly ordered without using any choice. If we could show your result, it would imply cardinals are linearly ordered, and if memory serves me, this implies the Axiom of Choice.

share|cite|improve this answer
You are absolutely right. Thank you. – availanche Jan 9 at 17:56

As suggested by Wojowu and Henno, there are two prime reasons why you cannot show that every cardinality has an ordinal with this cardinality without the use of AC:

  1. The principle of linearity of cardinals is equivalent to AC, and if every cardinality has an ordinal with this cardinality, then, given two cardinalities, there are two ordinals with those cardinalities, one is a subset of the other and hence there is injection between representatives of these cardinalities and hence these cardinalities can be compared (thanks to Henno for this answer).

  2. If A is partially ordered set and there exists bijection f:A->B for some set B, then f defines partial order on B with the same properties as that on A, therefore if you could find for every cardinality an ordinal with this cardinality, since every set is presumed to have cardinality then you could find bijection between a given set and some ordinal, ordering well this set. But the principle of ordering sets well is equivalent to AC.

share|cite|improve this answer

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.