I'm looking for a way to link to author pages within one WordPress install simply by putting the @ symbol in front of a person's username in a post.... just like on twitter.

Example:

If the username is "Bill256" and I write "@Bill256" it will be linked to his author page.


Question: How prove this equation $\alpha=\aleph_{0}\alpha$
Answer: Recall that $\aleph_\alpha$ is the cardinality of the $\alpha$-th [infinite] initial ordinal, denoted by $\omega_\alpha$.

For this proof you will need an extra fact:


  If $\alpha$ is an uncountable ordinal then $|\alpha|=|\{\delta&lt;\alpha\mid\delta\text{ is a limit ordinal}\}|$.


If $\alpha=0$ then you can prove directly that $\aleph_0\cdot\aleph_0=\aleph_0$ by using a pairing function.

Now define an equivalence relation on the ordinals below $\omega_\alpha$, $\xi\sim\zeta$ if there are only finitely many ordinals between $\xi$ and $\zeta$. I will leave you to verify that this is an equivalence relation. $\omega_\alpha$ is well-ordered, each equivalence class has a least element, and it is a limit ordinal, or zero. Otherwise its predecessor is in the same equivalence class, which is a contradiction to the minimality. And of course, different limit ordinals cannot be in the same equivalence class, because they have infinitely many ordinals between them.

So we have $\aleph_\alpha$ equivalence classes; and $\aleph_0$ points in each of the classes. Therefore $|\omega_\delta|=\aleph_\alpha\cdot\aleph_0$. Note that the axiom of choice wasn't used here, because we have a canonical ordering of each equivalence class.

Now. How to prove the fact? Usually the proof goes through defining the above equivalence relation and using the fact that $\aleph_0\cdot\aleph_\alpha=\aleph_\alpha$. So we can't really use that here. But we can use transfinite induction. It suffices to prove this for the initial ordinals, because every limit ordinal which is not an initial ordinal is either countable, or equipotent with its initial ordinal.

Suppose that for $\alpha$ it is true that for all $\beta&lt;\alpha$, either $\beta=0$ or there are $\aleph_\beta$ limit ordinals below $\omega_\beta$. Then it holds that $\aleph_0\cdot\aleph_\beta=\aleph_\beta$ for those $\beta$'s.

By contradiction there are less than $\aleph_\alpha$ limit ordinals below $\omega_\alpha$, then there is some $\beta&lt;\alpha$ such that $|\{\delta&lt;\omega_\alpha\mid\delta\text{ is a limit ordinal}\}|=\aleph_\beta$. Consider the above equivalence relation defined on $\omega_\alpha$, then it only has $\aleph_\beta$ equivalence classes, and therefore $\aleph_\beta=\aleph_\beta\cdot\aleph_0=\aleph_\alpha$, but $\beta&lt;\alpha$ and that is impossible. $\square$

So at the end we have to resort to transfinite recursion if we want to use the structure of ordinals, but it's just a scary term, it's not that scary once you understand this extremely useful technique.



Now, using the axiom of choice if $\alpha$ is an infinite cardinal then it is an $\aleph$ number. However, some people define "cardinal" as an $\aleph$ number to begin with, in which case you don't use the axiom of choice.

In the general form, where cardinal need not be an $\aleph$ number, it is consistent with the failure of the axiom of choice that there are cardinals which do not satisfy this property.