Cardinality of a finite product of sets My lecture notes state that for a set $S$, we have $|S \times S| = |S|$. Some reading on this topic here suggests that this requires the axiom of choice, which implies to me that the assumption of $S$ being infinite is necessary. This makes sense, as I can come up with a counterexample for finite $S$. If $S = \{1,2,3\}$, then $|S \times S| = 3 \cdot 3 = 9 > |S| = 3$.
Am I correct that $S$ must be infinite for this result to hold? Further, is the canonical proof an explicit bijection or using Shroder-Bernstein? Every method of trying to find a bijection led to problems with either injectivity or surjectivity.
 A: The result holds for finite sets of size $x$ where $x^2 = x$ (i.e. 0 or 1).
According to (Show that an infinite set $C$ is equipotent to its cartesian product $C\times C$), $|S \times S| = |S|$ for all $S$ is equivalent to the axiom of choice, so you can expect any solution to involve a well-ordering on $S$.
A: Assuming AC: To show that $|S\times S|=|S|$ when $S$ is infinite, it suffices to prove it when $S$ is an infinite cardinal ordinal.
Let $<$ be the usual order on ordinals.
Induction Hypothesis: $|T\times T|=|T|$ when $T$ is an infinite ordinal and $T<S.$
Define $<^*$ on $S\times S$ as follows. For $(x,y)$ and $(x',y')$ in $S\times S$
$(i)$ if $\max (x,y)=\max (x',y')$ then $<^*$ for $(x,y),(x',y')$ is the $<$-lexicographic order;
$(ii)$ if $\max (x,y)<\max (x',y')$ then $(x,y)<^*(x',y').$
Now show that $<^*$ is a well-order, so $(S\times S,<^*)$ is order-isomorphic to $(J,<)$ for some unique ordinal $J.$  Use the Induction Hypothesis to show that $\forall p\in S\times S \,(|\{r: r<^*p\}|<S\,),$ implying $J\le S.$ But clearly $J\ge S$ (i.e. $J\ge |J|\ge |S\times \{0\}|=|S|=S.)$
Remark: For $p=(x,y)\in S\times S,$ let $t=\max (x,y).$ Then
$\{r: r<^*p\}\subseteq$ $ \{r:r<^*(t,t)\}=[(t+1)\times (t+1)]\setminus \{(t,t)\}\subset$ $ (t+1)\times (t+1),$
and by the Induction Hypothesis, the cardinal of this last set is $<S.$
