Logic and sets · Power sets · Transitive sets · Iterated constructions · Self membership
Problem 4, 2018
For a set \(X\) let \(\mathcal{P}(X) = \{Y : Y \subseteq X\}\) denote its power set. For example \(\mathcal{P}(\{1\}) = \{\varnothing, \{1\}\}\), since the subsets of \(\{1\}\) are \(\varnothing\) and \(\{1\}\), and \(\mathcal{P}(\varnothing) = \{\varnothing\}\), since \(\varnothing\) has exactly one subset, namely \(\varnothing\) itself. Write \(\mathcal{P}^{n}(X)\) for \(\mathcal{P}(\mathcal{P}(\ldots \mathcal{P}(X) \ldots))\), where \(\mathcal{P}\) is applied \(n\) times.
Find all two-element subsets \(A\) of the set
for which \(A \subseteq \mathcal{P}(A)\).
Sign in to check answers, open hints, read the full solution, and track your progress. Statements are always free.
Serbian Regional Competition 2018, high school grade I, category A, problem 4. Organized by the Mathematical Society of Serbia (DMS). Source