A set equal to the cross product of two of its subsets I was wondering, in ZFC, if a set can ever equal to the cross product of two of its subsets. Or, more generally, the cross product of one of its subsets with any other set. (Exclude trivial examples like $\phi=\phi \times \phi$.)
So for example $\{a,b\}=\{a\} \times \mathbb{N}$ or $\mathbb{N}=\mathbb{Z} \times \{0,1\}$ are impossible. I want to write a proof that it's always impossible.
It feels like this can be proven using the Axiom of Foundation... or does someone have a counterexample?
 A: Define the rank of a set as the number of layers of braces down to its deepest buried $\emptyset$, so $\operatorname{rank}(\emptyset)=0,$ $\operatorname{rank}(\{\emptyset\})=1,$ and so on.  It is an ordinal, and can be infinite, since for instance $\operatorname{rank}(\omega)=\omega,\operatorname{rank}(\{\omega\})=\omega+1$, etc.  The rank of an ordered pair (assuming you use the usual Kuratowski definition) is $2$ more than the maximum rank of its components using ordinal addition.  Take one of the members of your set of minimum rank.  It cannot be the ordered pair of two members of the set.
A: Ross's answer shows that you can't have such a set if you use the usual Kuratowski representation of ordered pairs.
On the other hand, you could use Quine's "type-level" definition of ordered pairs. With this definition we have, $(\varnothing,\varnothing)=\varnothing$, and so $X=\{\varnothing\}$ satisfies $X=X\times X$.
In fact, with Quine pairs every set whatsoever is an ordered pair, so you can get an infinity of examples by defining
$$ f(S) = S \cup (S\times S) \cup \{x\mid \exists y: (x,y)\in S \lor (y,x)\in S\} $$
Then for any set $A$, $X=\bigcup_{n\in\mathbb N} f^n(A)$ is a solution to $X=X\times X$ that contains $A$.
