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
Enumeration
(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!
=== Comparison of cardinalities === Formally, the most inclusive definition of an enumeration of a set ''S'' is any [[surjection]] from an arbitrary [[index set]] ''I'' onto ''S''. In this broad context, every set ''S'' can be trivially enumerated by the [[identity function]] from ''S'' onto itself. If one does ''not'' assume the [[axiom of choice]] or one of its variants, ''S'' need not have any [[well-ordering]]. Even if one does assume the axiom of choice, ''S'' need not have any natural well-ordering. This general definition therefore lends itself to a counting notion where we are interested in "how many" rather than "in what order." In practice, this broad meaning of enumeration is often used to compare the relative sizes or [[cardinality|cardinalities]] of different sets. If one works in [[Zermelo–Fraenkel set theory]] without the axiom of choice, one may want to impose the additional restriction that an enumeration must also be [[injective]] (without repetition) since in this theory, the existence of a surjection from ''I'' onto ''S'' need not imply the existence of an [[Injection (mathematics)|injection]] from ''S'' into ''I''.
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)