Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Von Neumann universe
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
===Rank of a set=== The '''rank''' of a set ''S'' is the smallest α such that <math>S \subseteq V_\alpha \,.</math> In other words, <math>\mathcal{P} (V_\alpha) </math> is the set of sets with rank ≤α. The stage ''V''<sub>α</sub> can also be characterized as the set of sets with rank strictly less than α, regardless of whether α is 0, a successor ordinal, or a limit ordinal: <math display="block">V_\alpha := \bigcup_{\beta < \alpha} \mathcal{P} (V_\beta).</math> This gives an equivalent definition of ''V''<sub>α</sub> by transfinite recursion. Substituting the above definition of ''V''<sub>α</sub> back into the definition of the rank of a set gives a self-contained recursive definition: {{block indent| The rank of a set is the smallest ordinal number strictly greater than the rank of all of its members.}} In other words, <math display="block">\operatorname{rank} (S) = \bigcup \{ \operatorname{rank} (z) + 1 \mid z \in S \}.</math>
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)