# Cardinality, Logarithms, and Hyperreals

Take some infinite hypernatural number, $$M$$, and consider the integers (finite and infinite) less than or equal to $$M$$. There are uncountably many. Then consider $$\log_2 M$$. Is there a straightforward way to understand the cardinality? Could it be countable?

• The cardinality of what? – Eric Wofsey Oct 29 '18 at 3:36
• If $M$ is infinite, so is $\log_2(M)$ ... – Noah Schweber Oct 29 '18 at 3:37

If $$M$$ is nonstandard, so is $$\log_2(M)$$, so the same reasoning shows that there are uncountably many nonstandard integers $$<\log_2(M)$$ as well.
• Although, I wonder: if you are in some arbitrary nonstandard model of arithmetic (not necessarily an ultrapower), is it possible that the set of numbers less than $N$ has different cardinality from the set of numbers less than $2^N$ for some nonstandard $N$? – Eric Wofsey Oct 29 '18 at 3:40
• @RichardS. No, it's not correct. In general, actually, they won't have different cardinalities: in any sufficiently saturated model of arithmetic, we'll have $[0,M]\equiv[0,N]$ for any nonstandard $M,N$. In particular, the integers of a hyperrreal field form such a model, so - for the hyperreals at least - you'll never see different cardinalities. – Noah Schweber Oct 29 '18 at 17:09
• And (looking at arithmetic for simplicity) there's no nonstandard model in which $[0,M]$ has smaller cardinality than $[0, 2^M]$ for every $M$, since otherwise the sequence $M,\log_2(M),\log_2(\log_2(M)),...$ would give us a strictly descending chain of cardinalities. In fact, it's not obvious - and this is what Eric is asking - that a cardinality difference can ever happen! – Noah Schweber Oct 29 '18 at 17:10