Powerset
https://en.wikipedia.org/wiki/Power_set
𝒫(S) ordered by inclusion
\mathcal{P}(S) = \{ \\ \quad \{\}, \qquad \small\text{ the empty set is a subset of any set } \\ \quad \{x\}, \qquad \quad\small\text{ for each element } \\ \quad \{y\}, \qquad \quad\small\text{ α of S: {α} is an } \\ \quad \{z\}, \qquad \quad\small\text{ element of 𝒫(S) } \\ \quad \{x, y\}, \qquad \\ \quad \{x, z\}, \qquad \\ \quad \{y, z\}, \qquad \\ \quad \{x, y, z\} \quad \small\text{ any set is an element & subset of its 𝒫 } \\ \}
Powerset properties
The empty set is a subset of any set, ∅ ∈ S, but not an explicit member.
hence besides always being a subset of any set, , it is also an element and a subset of the powerset of any set.
In axiomatic set theory (e.g. ZFC), the existence of the power set of any set is postulated by the axiom of power set.
Any subset of P(S) is called a family of sets over S.
Notation
ASCII: P(S),
Unicode glyphs: 𝒫(S), ℘(S), ℙ(S)
Leftovers
r ℘ ℘
Last updated