The cardinality ∣X∣ of a set X expresses its size up to bijection. Two sets have the same cardinality exactly when a bijection pairs their members. For a finite set, cardinality is the ordinary number of set elements. In the presence of the axiom of choice, every set can be assigned the least ordinal in its bijection class as its cardinal number.
An injective function A→B shows that A is no larger than B: different members of A receive different partners in B. If there are injections in both directions, the Cantor-Schröder-Bernstein theorem supplies a bijection. Infinite cardinality records this pairing structure rather than a geometric dimension or density. That is why a line of natural numbers and a grid of natural-number pairs can have the same size, while an interval of real numbers has larger cardinality.
Two sets are equinumerous when a bijection exists between them. This is equality of their cardinalities.
Ancestors (6)
Incoming links (283)
- Additive combinatorics
- Additive energy
- Ambient cardinal bound on the constructible reals
- András Hajnal
- Augmenting path in a matching
- Backtracking leaf bound
- Basis of a matroid
- Berge's theorem
- Beth number
- Bijection
- Binomial theorem
- Cantor-Schröder-Bernstein theorem
- Cantor's theorem
- Capture-recapture model
- Cardinal bound for an increasing chain of countable sets
- Cardinality
- Cardinality of a vector space
- Cardinality of continuous real functions
- Cardinality principle
- Cardinal product
- Cardinal sum
- Categorical theory
- Classical Roth bound for three-term progressions
- Closed-population capture-recapture model
- Cofinality of a linear order
- Cofinality of a power-set cardinal
- Complementation of uniform intersecting families
- Connected component
- Constraint domain
- Coordinate shifts of a set family
- Copy-on-write page accounting
- Countable set
- Counting measure
- Degree (graph theory)
- Degree of a covering map
- Dimension (vector space)
- Discrete uniform distribution
- Discrete uniform moments on an integer interval
- Double coset
- Double counting (proof technique)
- Doubling constant
- Edge cover
- Edge cover and matching identity
- Empty function
- Entropy submodularity for sums
- Equinumerosity
- Existential second-order logic
- Extremal set theory
- Fano's inequality
- Finite candidate elimination bound
- Finite-field Kakeya polynomial bound
- Finite-field Kakeya set
- Finite modification of the identity on the real line
- Finite Ramsey theorem
- Finite ring characteristic divides cardinality
- Finite set
- Fixed-rate source-coding error exponent
- Franel sum
- Free finite actions with equal cardinality are isomorphic
- Free group action
- Function collision
- Group extension by a duplicate carrier
- Groups of order at most six
- Hall matching of maximal separated sets
- Hall obstruction
- Hereditarily locally small membership model
- Hereditary nonmatroid greedy obstruction
- Hook length
- Hook of a Young diagram
- Image of a function
- Inclusion-exclusion principle
- Increasing chain of countable sets
- Independence number
- Independent set (graph theory)
- Indirect selection of bacterial mutants
- Infinite-cardinal categoricity forces completeness
- Integer interval
- Interval scheduling
- Kappa-tree
- Mark and recapture
- Matching number
- Matroid
- Matroid independence axioms
- Maximal matching
- Maximum cardinality matching
- Maximum independent set
- Maximum-weight matching documentation by NetworkX
- Metric epsilon-net
- Minimum excludant
- Minimum vertex cover
- Minimum-weight edge cover
- Minimum-weight edge cover by matching savings
- Multiplicity-free complete dyadic spectrum
- Multiset
- Natural density
- Natural number
- Normalizer
- Orbit-stabilizer theorem
- Order of a finite group
- Past exam of the algebraic curves course of the University of Oxford / 2023 / 1 / d / Solution
- Past exam of the analytic topology and axiomatic set theory course of the University of Oxford / 2007 / B / 7 / ii / Solution
- Past exam of the analytic topology and axiomatic set theory course of the University of Oxford / 2007 / B / 7 / i / Solution
- Past exam of the analytic topology and axiomatic set theory course of the University of Oxford / 2007 / B / 8 / iv / Solution
- Past exam of the analytic topology and axiomatic set theory course of the University of Oxford / 2008 / B / 7 / ii / Solution
- Past exam of the analytic topology and axiomatic set theory course of the University of Oxford / 2009 / A / 3 / iii / Solution
- Past exam of the analytic topology and axiomatic set theory course of the University of Oxford / 2009 / B / 5 / ii / Solution
- Past exam of the analytic topology and axiomatic set theory course of the University of Oxford / 2009 / B / 5 / i / Solution
- Past exam of the analytic topology and axiomatic set theory course of the University of Oxford / 2010 / B / 5 / a / Solution
- Past exam of the analytic topology and axiomatic set theory course of the University of Oxford / 2010 / B / 5 / b / Solution
- Past exam of the analytic topology and axiomatic set theory course of the University of Oxford / 2010 / B / 5 / d / ii / Solution
- Past exam of the computer science course of the University of Oxford / 2015 / Probability and computing / 2 / f / Solution
- Past exam of the computer science course of the University of Oxford / 2018 / Algorithms / 2 / a / Solution
- Past exam of the computer science course of the University of Oxford / 2018 / Algorithms / 2 / b / Solution
- Past exam of the computer science course of the University of Oxford / 2018 / Algorithms / 3 / b / Solution
- Past exam of the computer science course of the University of Oxford / 2019 / Algorithms / 3 / b / Solution
- Past exam of the computer science course of the University of Oxford / 2019 / Computational game theory / 3 / b / Solution
- Past exam of the computer science course of the University of Oxford / 2023 / Artificial intelligence / 3 / c / Solution
- Past exam of the computer science course of the University of Oxford / 2023 / Combinatorial optimisation / 2 / a / Solution
- Past exam of the computer science course of the University of Oxford / 2023 / Combinatorial optimisation / 2 / b / i / Solution
- Past exam of the computer science course of the University of Oxford / 2023 / Combinatorial optimisation / 2 / c / i / Solution
- Past exam of the computer science course of the University of Oxford / 2023 / Combinatorial optimisation / 2 / c / v / Solution
- Past exam of the computer science course of the University of Oxford / 2023 / Combinatorial optimisation / 3 / d / iii / Solution
- Past exam of the computer science course of the University of Oxford / 2023 / Combinatorial optimisation / 3 / d / ii / Solution
- Past exam of the computer science course of the University of Oxford / 2023 / Combinatorial optimisation / 3 / d / i / Solution
- Past exam of the graph theory course of the University of Oxford / 2023 / 3 / c / ii / Solution
- Past exam of the graph theory course of the University of Oxford / 2023 / 3 / c / i / Solution
- Past exam of the information theory course of the University of Oxford / 2023 / 2 / c / i / Solution
- Past exam of the logic and set theory course of the University of Oxford / 2007 / B / 7 / iii / Solution
- Past exam of the logic and set theory course of the University of Oxford / 2007 / B / 7 / iv / Solution
- Past exam of the logic and set theory course of the University of Oxford / 2007 / B / 7 / v / Solution
- Past exam of the logic and set theory course of the University of Oxford / 2008 / A / 4 / d / Solution
- Past exam of the logic and set theory course of the University of Oxford / 2008 / A / 4 / e / Solution
- Past exam of the logic and set theory course of the University of Oxford / 2008 / B / 5 / 2 / Solution
- Past exam of the logic and set theory course of the University of Oxford / 2008 / B / 7 / 1 / Solution
- Past exam of the logic and set theory course of the University of Oxford / 2008 / B / 7 / 5 / Solution
- Past exam of the logic and set theory course of the University of Oxford / 2010 / A / 3 / b / i / Solution
- Past exam of the logic and set theory course of the University of Oxford / 2010 / A / 3 / c / ii / Solution
- Past exam of the logic and set theory course of the University of Oxford / 2010 / B / 6 / b / Solution
- Past exam of the logic and set theory course of the University of Oxford / 2010 / B / 6 / c / Solution
- Past exam of the logic and set theory course of the University of Oxford / 2011 / B / 4 / b / Solution
- Past exam of the mathematics course of the University of Cambridge / 2002 / ia / Paper 4 / 6F / b / Solution
- Past exam of the mathematics course of the University of Cambridge / 2003 / iii / Paper 13 / 2 / Solution
- Past exam of the mathematics course of the University of Cambridge / 2003 / iii / Paper 19 / 2 / Solution
- Past exam of the mathematics course of the University of Cambridge / 2003 / iii / Paper 19 / 5 / Solution
- Past exam of the mathematics course of the University of Cambridge / 2003 / iii / Paper 19 / 7 / ii / Solution
- Past exam of the mathematics course of the University of Cambridge / 2003 / iii / Paper 19 / 7 / i / Solution
- Past exam of the mathematics course of the University of Cambridge / 2003 / iii / Paper 7 / 6 / ii / Solution
- Past exam of the mathematics course of the University of Cambridge / 2003 / iii / Paper 7 / 6 / i / Solution
- Past exam of the mathematics course of the University of Cambridge / 2004 / ia / Paper 4 / 8E / Solution
- Past exam of the mathematics course of the University of Cambridge / 2004 / iii / Paper 24 / 2 / Solution
- Past exam of the mathematics course of the University of Cambridge / 2004 / iii / Paper 24 / 3 / Solution
- Past exam of the mathematics course of the University of Cambridge / 2005 / iii / Paper 1 / 5 / Solution
- Past exam of the mathematics course of the University of Cambridge / 2006 / iii / Paper 12 / 2 / Solution
- Past exam of the mathematics course of the University of Cambridge / 2006 / iii / Paper 25 / 10 / Solution
- Past exam of the mathematics course of the University of Cambridge / 2006 / iii / Paper 25 / 5 / Solution
- Past exam of the mathematics course of the University of Cambridge / 2006 / iii / Paper 25 / 7 / Solution
- Past exam of the mathematics course of the University of Cambridge / 2006 / iii / Paper 25 / 8 / Solution
- Past exam of the mathematics course of the University of Cambridge / 2006 / iii / Paper 25 / 9 / Solution
- Past exam of the mathematics course of the University of Cambridge / 2007 / ib / Paper 3 / 11G / ii / Solution
- Past exam of the mathematics course of the University of Cambridge / 2007 / ib / Paper 3 / 11G / i / Solution
- Past exam of the mathematics course of the University of Cambridge / 2007 / iii / Paper 12 / 1 / Solution
- Past exam of the mathematics course of the University of Cambridge / 2007 / iii / Paper 12 / 3 / Solution
- Past exam of the mathematics course of the University of Cambridge / 2007 / iii / Paper 12 / 4 / Solution
- Past exam of the mathematics course of the University of Cambridge / 2007 / iii / Paper 26 / 6 / Solution
- Past exam of the mathematics course of the University of Cambridge / 2007 / iii / Paper 26 / 7 / Solution
- Past exam of the mathematics course of the University of Cambridge / 2007 / iii / Paper 88 / 2 / ii / Solution
- Past exam of the mathematics course of the University of Cambridge / 2007 / iii / Paper 9 / 1 / Solution
- Past exam of the mathematics course of the University of Cambridge / 2007 / iii / Paper 9 / 4 / Solution
- Past exam of the mathematics course of the University of Cambridge / 2008 / ia / Paper 4 / 7D / b / Solution
- Past exam of the mathematics course of the University of Cambridge / 2008 / iii / Paper 16 / 2 / ii / Solution
- Past exam of the mathematics course of the University of Cambridge / 2009 / iii / Paper 13 / 4 / Solution
- Past exam of the mathematics course of the University of Cambridge / 2010 / iii / Paper 10 / 1 / Solution
- Past exam of the mathematics course of the University of Cambridge / 2010 / iii / Paper 10 / 2 / Solution
- Past exam of the mathematics course of the University of Cambridge / 2010 / iii / Paper 21 / 1 / Solution
- Past exam of the mathematics course of the University of Cambridge / 2012 / iii / Paper 11 / 2 / Solution
- Past exam of the mathematics course of the University of Cambridge / 2012 / iii / Paper 11 / 3 / Solution
- Past exam of the mathematics course of the University of Cambridge / 2012 / iii / Paper 83 / 1 / i / Solution
- Past exam of the mathematics course of the University of Cambridge / 2014 / ia / Paper 4 / 8E / i / Solution
- Past exam of the mathematics course of the University of Cambridge / 2014 / iii / Paper 19 / 1 / ii / a / Solution
- Past exam of the mathematics course of the University of Cambridge / 2014 / iii / Paper 19 / 2 / ii / Solution
- Past exam of the mathematics course of the University of Cambridge / 2014 / iii / Paper 19 / 4 / i / a / Solution
- Past exam of the mathematics course of the University of Cambridge / 2014 / iii / Paper 19 / 5 / iv / a / Solution
- Past exam of the mathematics course of the University of Cambridge / 2014 / iii / Paper 19 / 5 / iv / c / Solution
- Past exam of the mathematics course of the University of Cambridge / 2014 / iii / Paper 19 / 6 / i / a / Solution
- Past exam of the mathematics course of the University of Cambridge / 2015 / iii / Paper 13 / 4 / Solution
- Past exam of the mathematics course of the University of Cambridge / 2015 / iii / Paper 23 / 1 / e / Solution
- Past exam of the mathematics course of the University of Cambridge / 2015 / iii / Paper 24 / 1 / b / iii / Solution
- Past exam of the mathematics course of the University of Cambridge / 2015 / iii / Paper 24 / 1 / b / ii / Solution
- Past exam of the mathematics course of the University of Cambridge / 2016 / iii / Paper 109 / 4 / Solution
- Past exam of the mathematics course of the University of Cambridge / 2016 / iii / Paper 111 / 1 / Solution
- Past exam of the mathematics course of the University of Cambridge / 2016 / iii / Paper 111 / 2 / i / Solution
- Past exam of the mathematics course of the University of Cambridge / 2016 / iii / Paper 121 / 1 / b / Solution
- Past exam of the mathematics course of the University of Cambridge / 2016 / iii / Paper 121 / 2 / b / Solution
- Past exam of the mathematics course of the University of Cambridge / 2016 / iii / Paper 121 / 2 / d / Solution
- Past exam of the mathematics course of the University of Cambridge / 2016 / iii / Paper 121 / 2 / e / Solution
- Past exam of the mathematics course of the University of Cambridge / 2016 / iii / Paper 121 / 4 / d / Solution
- Past exam of the mathematics course of the University of Cambridge / 2017 / iii / Paper 129 / 3 / Solution
- Past exam of the mathematics course of the University of Cambridge / 2017 / ii / Paper 3 / 14H / Solution
- Past exam of the mathematics course of the University of Cambridge / 2018 / iii / Paper 103 / 4 / i / Solution
- Past exam of the mathematics course of the University of Cambridge / 2018 / iii / Paper 121 / 1 / v / b / Solution
- Past exam of the mathematics course of the University of Cambridge / 2018 / iii / Paper 130 / 4 / i / Solution
- Past exam of the mathematics course of the University of Cambridge / 2019 / iii / Paper 121 / 3 / i / c / Solution
- Past exam of the mathematics course of the University of Oxford / 2015 / Prelims / Mathematics I / 5 / a / ii / Solution
- Past exam of the mathematics course of the University of Oxford / 2015 / Prelims / Mathematics I / 6 / a / i / Solution
- Past exam of the mathematics course of the University of Oxford / 2015 / Prelims / Mathematics I / 6 / b / Solution
- Past exam of the mathematics course of the University of Oxford / 2015 / Prelims / Mathematics I / 6 / c / Solution
- Past exam of the mathematics course of the University of Oxford / 2015 / Prelims / Mathematics I / 7 / a / ii / Solution
- Past exam of the mathematics course of the University of Oxford / 2015 / Prelims / Mathematics I / 7 / b / ii / Solution
- Past exam of the mathematics course of the University of Oxford / 2015 / Prelims / Mathematics I / 7 / b / i / Solution
- Past exam of the mathematics course of the University of Oxford / 2021 / Prelims / Mathematics I / 6 / a / ii / Solution
- Past exam of the mathematics course of the University of Oxford / 2023 / Prelims / Mathematics I / 6 / b / i / Solution
- Past exam of the mathematics course of the year 2 of the natural sciences course of the University of Cambridge / 2024 / Paper 2 / 8 / a / Solution
- Past exam of the model theory and Gödel's incompleteness theorems course of the University of Oxford / 2007 / B / 6 / i / Solution
- Past exam of the model theory and Gödel's incompleteness theorems course of the University of Oxford / 2008 / B / 8 / ii / a / Solution
- Past exam of the model theory and Gödel's incompleteness theorems course of the University of Oxford / 2008 / B / 8 / ii / b / Solution
- Past exam of the model theory and Gödel's incompleteness theorems course of the University of Oxford / 2009 / B / 4 / b / iv / Solution
- Past exam of the model theory and Gödel's incompleteness theorems course of the University of Oxford / 2009 / B / 5 / a / Solution
- Past exam of the model theory and Gödel's incompleteness theorems course of the University of Oxford / 2009 / B / 5 / c / vi / Solution
- Past exam of the model theory and Gödel's incompleteness theorems course of the University of Oxford / 2009 / B / 5 / d / Solution
- Past exam of the model theory and Gödel's incompleteness theorems course of the University of Oxford / 2009 / B / 6 / c / Solution
- Past exam of the model theory and Gödel's incompleteness theorems course of the University of Oxford / 2009 / B / 6 / d / ii / Solution
- Past exam of the model theory and Gödel's incompleteness theorems course of the University of Oxford / 2010 / B / 4 / a / Solution
- Past exam of the model theory and Gödel's incompleteness theorems course of the University of Oxford / 2010 / B / 4 / f / v / Solution
- Past exam of the model theory and Gödel's incompleteness theorems course of the University of Oxford / 2010 / B / 6 / b / Solution
- Past exam of the MSc in advanced computer science course of the University of Oxford / 2023 / Computational game theory / 4 / b / Solution
- Past exam of the psychology and primary education course of the University of Oxford / 2022 / 1 / Solution
- Past exam of the topology and groups course of the University of Oxford / 2023 / 3 / a / ii / Solution
- Past exam of the year 1 of the computer science course of the University of Oxford / 2014 / Discrete mathematics, continuous mathematics and probability / 2 / c / Solution
- Past exam of the year 1 of the computer science course of the University of Oxford / 2015 / Discrete mathematics, continuous mathematics, and probability (resit) / 1 / d / ii / Solution
- Past exam of the year 1 of the computer science course of the University of Oxford / 2016 / Discrete mathematics, continuous mathematics and probability / 1 / e / ii / Solution
- Past exam of the year 1 of the computer science course of the University of Oxford / 2017 / Discrete mathematics, continuous mathematics and probability / 1 / c / ii / Solution
- Past exam of the year 1 of the computer science course of the University of Oxford / 2017 / Discrete mathematics, continuous mathematics and probability / 1 / c / i / Solution
- Past exam of the year 1 of the computer science course of the University of Oxford / 2019 / Discrete mathematics, continuous mathematics, and probability / 1 / b / i / Solution
- Past exam of the year 1 of the computer science course of the University of Oxford / 2021 / Imperative programming / 6 / b / Solution
- Past exam of the year 1 of the computer science course of the University of Oxford / 2021 / Imperative programming / 6 / d / Solution
- Past exam of the year 1 of the computer science course of the University of Oxford / 2021 / Imperative programming / 6 / f / Solution
- Past exam of the year 1 of the computer science course of the University of Oxford / 2021 / Imperative programming (resit) / 3 / d / Solution
- Past exam of the year 1 of the computer science course of the University of Oxford / 2021 / Imperative programming (resit) / 7 / b / ii / Solution
- Past exam of the year 1 of the computer science course of the University of Oxford / 2022 / Discrete mathematics, continuous mathematics, and probability / Discrete mathematics / 1 / a / ii / Solution
- Past exam of the year 1 of the computer science course of the University of Oxford / 2022 / Discrete mathematics, continuous mathematics, and probability / Discrete mathematics / 1 / b / ii / Solution
- Past exam of the year 1 of the computer science course of the University of Oxford / 2022 / Discrete mathematics, continuous mathematics, and probability / Discrete mathematics / 1 / c / ii / Solution
- Past exam of the year 1 of the computer science course of the University of Oxford / 2022 / Discrete mathematics, continuous mathematics, and probability / Discrete mathematics / 1 / c / i / Solution
- Past exam of the year 1 of the computer science course of the University of Oxford / 2023 / Digital systems, linear algebra and introduction to formal proof / 8 / c / Solution
- Power-set failure in hereditarily small sets
- Power-set product cardinality inequality
- Prime omega function
- Prime support of an integer
- Quotient set
- Rank of a matroid
- Real-valued function
- Reflection theorem for definable hierarchies
- Relative constructible universe can violate the continuum hypothesis
- Removal of an exponential prefactor by Cartesian powers
- Right coset
- Row-and-column enumeration of an ordinal square
- Sample space
- Second-order relation variable
- Set inclusion
- Set theory
- Set union
- Simplicial order on the discrete cube
- Simply transitive group action
- Skolem's paradox
- Small matroid enumeration
- Small subgroups of tetrahedral symmetry
- Stable matching in a bipartite graph
- Standard Young tableau
- Sumset
- Supermodular set function
- Support of a multiset
- Symmetry of players in a cooperative game
- Tangent-line finite-field Kakeya construction
- Torsion subgroup killed by an integer
- Translate of a subset of a group
- Type class
- Type (information theory)
- Uniform matroid
- UV-compression
- Venn diagram
- Weighted three-vector matroid
- Working set
- Working set size
- Worldly cardinals below an inaccessible cardinal
Discussion (0) New discussion
There are no discussions about this article yet.
Articles by others on the same topic (2)
Cardinality is a mathematical concept that refers to the number of elements in a set or the size of a set. It is used to describe the quantity of items in both finite and infinite sets. 1. **Finite Sets**: For finite sets, cardinality is simply the count of distinct elements.
But for infinity, things are messier, e.g. the size of the real numbers is strictly larger than the size of the integers as shown by Cantor's diagonal argument, which is kind of what justifies a fancier word "cardinality" to distinguish it from the more normal word "size".
The key idea is to compare set sizes with bijections.