Graduate
  1. Real Analysis  1.1. Set Theory and Logic  1.1.1. Sets and Operations  1.1.2. Relations and Functions  1.1.3. Logic and Quantifiers  1.1.4. Cardinality of Sets  1.2. Metric Spaces  1.2.1. Open and Closed Sets  1.2.2. Convergence of Sequences  1.2.3. Continuous Functions in Metric Spaces  1.2.4. Compactness and Completeness in Metric Spaces in Real Analysis  1.3. Sequence and Series  1.3.1. Convergence of Sequences  1.3.2. Infinite Series  1.3.3. Uniform Convergence  1.3.4. Power Series  1.4. Differentiation  1.4.1. Mean Value Theorems  1.4.2. Taylor Series  1.4.3. Functions of Several Variables  1.4.4. Partial Derivatives  1.5. Integration  1.5.1. Riemann and Lebesgue Integration  1.5.2. Improper Integrals  1.5.3. Measure Theory  1.5.4. Fubini’s Theorem  1.6. Functional Analysis  1.6.1. Banach Spaces  1.6.2. Hilbert Spaces  1.6.3. Operators on Spaces  1.6.4. Spectral Theory
  2. Abstract Algebra  2.1. Groups  2.1.1. Definitions and Examples in Groups in Abstract Algebra  2.1.2. Group Homomorphisms  2.1.3. Normal Subgroups  2.1.4. Sylow Theorems  2.2. Rings and Fields  2.2.1. Ideals and Factor Rings  2.2.2. Field Extensions  2.2.3. Galois Theory  2.2.4. Polynomial Rings  2.3. Modules  2.3.1. Module Homomorphisms  2.3.2. Free Modules  2.3.3. Tensor Products  2.3.4. Exact Sequences  2.4. Linear Algebra  2.4.1. Vector Spaces  2.4.2. Eigenvalues and Eigenvectors  2.4.3. Inner Product Spaces  2.4.4. Diagonalization
  3. Topology  3.1. General Topology  3.1.1. Open and Closed Sets  3.1.2. Compactness and Connectedness  3.1.3. Continuous Maps  3.1.4. Separation Axioms  3.2. Algebraic Topology  3.2.1. Fundamental Groups  3.2.2. Homotopy and Homology  3.2.3. Simplicial Complexes  3.2.4. Exact Sequences in Homology  3.3. Differential Topology  3.3.1. Manifolds  3.3.2. Smooth Functions  3.3.3. Tangent and Cotangent Spaces  3.3.4. Vector Bundles
  4. Differential Equations  4.1. Ordinary Differential Equations  4.1.1. First-Order Equations  4.1.2. Second-Order Linear Equations  4.1.3. Systems of Differential Equations  4.1.4. Stability Analysis  4.2. Partial Differential Equations  4.2.1. Classification of PDEs  4.2.2. Fourier Series  4.2.3. Green's Functions  4.2.4. Method of Characteristics  4.3. Dynamical Systems  4.3.1. Stability Theory  4.3.2. Limit Cycles  4.3.3. Chaos Theory  4.3.4. Bifurcation Theory
  5. Probability and Statistics  5.1. Probability Theory  5.1.1. Random Variables  5.1.2. Probability Distributions  5.1.3. Law of Large Numbers  5.1.4. Central Limit Theorem  5.2. Statistical Inference  5.2.1. Hypothesis Testing  5.2.2. Confidence Intervals  5.2.3. Bayesian Methods  5.2.4. Maximum Likelihood Estimation  5.3. Stochastic Processes  5.3.1. Markov Chains  5.3.2. Brownian Motion  5.3.3. Poisson Processes  5.3.4. Martingales
  6. Numerical Analysis  6.1. Numerical Solutions of Equations  6.1.1. Root Finding  6.1.2. Iterative Methods  6.1.3. Convergence Analysis  6.1.4. Error Bounds in Numerical Solutions of Equations  6.2. Numerical Linear Algebra  6.2.1. Matrix Factorizations  6.2.2. Eigenvalue Computations  6.2.3. Sparse Matrices  6.2.4. Preconditioning Techniques  6.3. Numerical Integration and Differentiation  6.3.1. Quadrature Methods  6.3.2. Finite Differences  6.3.3. Error Analysis in Numerical Integration and Differentiation  6.3.4. Adaptive Methods
  7. Complex Analysis  7.1. Complex Numbers  7.1.1. Polar Form  7.1.2. Complex Conjugates  7.1.3. Exponential Form  7.1.4. Roots of Unity  7.2. Analytic Functions  7.2.1. Cauchy-Riemann Equations  7.2.2. Power Series  7.2.3. Conformal Mappings  7.2.4. Harmonic Functions  7.3. Integration in the Complex Plane  7.3.1. Cauchy’s Theorem  7.3.2. Residue Theorem  7.3.3. Contour Integration  7.3.4. Integral Transforms
  8. Mathematical Logic and Foundations  8.1. Propositional Logic  8.1.1. Truth Tables  8.1.2. Logical Equivalences  8.1.3. Proof Techniques in Propositional Logic  8.1.4. Resolution  8.2. Predicate Logic  8.2.1. Quantifiers in Predicate Logic  8.2.2. Formal Systems in Predicate Logic  8.2.3. Completeness and Soundness  8.2.4. Model Theory  8.3. Set Theory  8.3.1. Cardinality and Ordinality  8.3.2. Axiomatic Systems  8.3.3. Zermelo-Fraenkel Set Theory  8.3.4. Forcing
  9. Optimization  9.1. Linear Programming  9.1.1. Simplex Method  9.1.2. Duality in Linear Programming  9.1.3. Sensitivity Analysis  9.1.4. Interior Point Methods  9.2. Nonlinear Programming  9.2.1. Gradient Descent  9.2.2. Lagrange Multipliers  9.2.3. Convex Optimization  9.2.4. Quadratic Programming  9.3. Combinatorial Optimization  9.3.1. Graph Algorithms  9.3.2. Integer Programming  9.3.3. Network Flows  9.3.4. Approximation Algorithms
  10. Discrete Mathematics  10.1. Graph Theory  10.1.1. Graph Representations  10.1.2. Planarity and Coloring  10.1.3. Shortest Path Algorithms  10.1.4. Network Flows  10.2. Combinatorics  10.2.1. Permutations and Combinations  10.2.2. Generating Functions  10.2.3. Recurrence Relations  10.2.4. Inclusion-Exclusion Principle  10.3. Cryptography  10.3.1. Number Theory Applications in Cryptography  10.3.2. Symmetric and Asymmetric Cryptography  10.3.3. RSA and Elliptic Curve Cryptography  10.3.4. Post-Quantum Cryptography

Graduate → Real Analysis → Set Theory and Logic ↓


Cardinality of Sets


In mathematics, particularly in set theory and real analysis, the concept of the cardinality of a set is a fundamental concept. Cardinality refers to the number of elements in a set. Understanding cardinality helps mathematicians compare different sets in terms of size, even when dealing with potentially infinite sets.

Basic concepts of sets

Before exploring cardinality, let's start with the basics of set theory. A set is a collection of distinct objects that is treated as an object in its own right. Sets are typically represented by curly braces, like this:

{1, 2, 3, 4}

This is a group with four elements: 1, 2, 3, and 4.

Finite and infinite sets

Sets can be finite or infinite:

  • Finite set: A set with a finite number of elements, such as: 
    {apple, banana, cherry}
    There are three elements in this set.
  • Infinite set: A set with an infinite number of elements, such as the set of all natural numbers: 
    {1, 2, 3, 4, 5, ...}

Defining cardinality

The cardinality of a set is a measure of the "number of elements" present in that set. For a finite set, cardinality is the number of distinct elements. For example:

set 

{2, 4, 6}
Its cardinality is 3.

Cardinality is often represented using absolute value symbols. If A is a set, the cardinality of A is represented as |A|. For example:

|{2, 4, 6}| = 3

Comparison of cardinality

When it comes to comparing the size of two sets, we focus on whether there is a one-to-one correspondence (also known as bijection) between the elements of the two sets.

Visual example of one-to-one correspondence

Set A: {a, b, c} Set B: {1, 2, 3}
A B C 1 2 3

In this example, there is a one-to-one matching between the elements of Set A and Set B, such that each element in A corresponds to a unique element in B. Thus, the cardinality of the two sets is equal.

Infinite sets and cardinality

Things get even more interesting when dealing with infinite sets. Not all infinities are the same, and this is where the notion of cardinality helps to distinguish between different types of infinite sets.

Countable infinity

A set is called countably infinite if its elements can be put into one-to-one correspondence with the natural numbers. The most common example is the set of all natural numbers:

N = {0, 1, 2, 3, 4, ...}

Another common countable infinite set is the set of all even numbers:

E = {0, 2, 4, 6, 8, ...}

Although both N and E are infinite, we can establish a one-to-one correspondence between them. Thus, their cardinality is the same.

Countlessly infinite

An infinite set that cannot be put into one-to-one correspondence with the natural numbers is called uncountable.

An example of an uncountable set is the set of real numbers between 0 and 1. No matter how you try to list them, there will always be some real numbers that you will miss. This was famously demonstrated by Cantor's diagonal argument.

Cantor's diagonal argument

Cantor's diagonal argument shows that there are more real numbers between 0 and 1 than natural numbers.

Suppose, for the sake of contradiction, we can list all the real numbers between 0 and 1. Suppose the list looks like this:

0. a1a2a3... 0. b1b2b3... 0. c1c2c3... ..

Cantor constructed a new number by replacing every n digit of n number, ensuring that this new number could not be part of the list, thus showing that the set of real numbers is uncountable.

Visualization of countable and uncountable sets

Visual understanding can be further enhanced by understanding that countable sets, like the natural numbers, can be represented as a list, while uncountable sets, like the real number line, can be represented as a continuous extension without gaps.

N: , Actual number: Continuous

Types of cardinality

The cardinality of finite sets is simply the count of elements, but infinite sets have a unique kind of cardinality.

Smallest infinite cardinal: ℵ 0

The cardinality of any countable infinite set, such as the natural numbers, the integers, or the rational numbers, is represented by ℵ 0 (pronounced "aleph-null").

Cardinality of continuum

The cardinality of the real numbers is called the cardinality of the continuum, denoted by c. Cantor showed that c is definitely greater than ℵ 0.

Continuum hypothesis

The continuum hypothesis holds that there are no sets whose size is between the integers and the real numbers. In terms of cardinality, this states that there are no cardinal numbers between ℵ 0 and c.

Implications and applications

The study of cardinality has profound implications and applications in mathematics and beyond, shaping our understanding of infinity and influencing fields such as topology, real analysis, and computer science.

Understanding cardinality is important for a variety of reasons:

  • Comparison of infinite sets: Helps to compare different sizes of infinity.
  • Proofs and Theorems: Helps formulate and prove theorems involving infinite sets, such as Cantor's theorem.
  • Mathematical foundations: Cardinality is fundamental to the development of mathematical logic and set theory.

Conclusion

The concept of cardinality in set theory and real analysis provides an important tool for comparing and understanding both finite and infinite sets. It highlights the fascinating idea that even within the realm of infinity, some infinities can be larger than others. It deepens our understanding of mathematics and logic, providing insight into the mystery of infinity.


Graduate → 1.1.4


U
username
0%
completed in Graduate

← Prev (1.1.3)
Logic and Quantifiers
Next (1.2) →
Metric Spaces

Comments 



Cardinality of Sets

https://www.buddymath.com/g/1.1.4?bmal=en