0

See this question Prove that for any two sets $A$ and $B$, $A\notin B$ or $B\notin A$

I am having some doubt in it

Let two sets A and B be such that

A ={ B } and B = { A } . Then both contain each other . What is wrong here ?

Principal of regularity says atleast one element is disjoint from A and A contains a set which contains A . So different objects and I guess disjoint .

Also if we keep using principal of substituting here then sets

A = { B }

A = { { A } }

A = { { { B } } }

.

.

I think these all sets are different because they contains different objects but then they all are equal to A .

RKK
  • 408

1 Answers1

2

Here is a claim: there are real numbers $x, y$ such that $x=y+1$ and $y=x+1$.

There, I wrote it down, so there are two such real numbers! Now we can simplify and see $x=y+1=x+1$ and so $0=1$. Mathematics is inconsistent, we are all working too hard, let's go home and take a nap.

Or, more likely, writing down equations does not mean that there is a solution to these equations.

In the context of set theory $A=\{B\}$ is an equation, which we would normally posit has a solution. But this requires proof, after all, $R=\{x\mid x\notin x\}$ is an equation, and Russell's paradox is exactly the statement that it has no solution.

So the short answer here is that $A=\{B\}, B=\{A\}$ simply doesn't admit a solution, assuming $\sf ZFC$.

Asaf Karagila
  • 393,674