Cardinal arithmetic operations extend basic math to infinite numbers. Addition, multiplication, and exponentiation now apply to infinite cardinals. These operations follow familiar rules like commutativity and associativity, but with some unique twists for infinite sets.

Infinite sums and products take these ideas even further. They allow us to work with endless sequences of cardinals. gives us important limits on these operations, helping us understand how big these infinite results can get.

Cardinal Arithmetic Operations

Defining Cardinal Arithmetic

Top images from around the web for Defining Cardinal Arithmetic
Top images from around the web for Defining Cardinal Arithmetic
  • Cardinal arithmetic operations generalize arithmetic operations to numbers
  • Cardinal addition extends the concept of adding natural numbers to infinite cardinals
  • Cardinal multiplication extends the concept of multiplying natural numbers to infinite cardinals
  • Cardinal exponentiation extends the concept of exponentiation to infinite cardinals

Properties of Cardinal Arithmetic

  • holds for cardinal addition and multiplication (0+1=1+0\aleph_0 + \aleph_1 = \aleph_1 + \aleph_0, 01=10\aleph_0 \cdot \aleph_1 = \aleph_1 \cdot \aleph_0)
  • holds for cardinal addition and multiplication ((0+1)+2=0+(1+2)(\aleph_0 + \aleph_1) + \aleph_2 = \aleph_0 + (\aleph_1 + \aleph_2), (01)2=0(12)(\aleph_0 \cdot \aleph_1) \cdot \aleph_2 = \aleph_0 \cdot (\aleph_1 \cdot \aleph_2))
  • holds for cardinal multiplication over addition (0(1+2)=01+02\aleph_0 \cdot (\aleph_1 + \aleph_2) = \aleph_0 \cdot \aleph_1 + \aleph_0 \cdot \aleph_2)
  • state that for any two infinite cardinals κ\kappa and λ\lambda, κ+λ=max(κ,λ)\kappa + \lambda = \max(\kappa, \lambda) and κλ=max(κ,λ)\kappa \cdot \lambda = \max(\kappa, \lambda) (0+1=1\aleph_0 + \aleph_1 = \aleph_1, 01=1\aleph_0 \cdot \aleph_1 = \aleph_1)

Examples of Cardinal Arithmetic

  • If AA is a set of even numbers and BB is a set of odd numbers, then [A](https://www.fiveableKeyTerm:a)+B=N=0[|A|](https://www.fiveableKeyTerm:|a|) + |B| = |\mathbb{N}| = \aleph_0
  • If CC is the set of all functions from N\mathbb{N} to {0,1}\{0, 1\}, then C=20=c|C| = 2^{\aleph_0} = \mathfrak{c} (the cardinality of the continuum)
  • For any infinite cardinal κ\kappa, κκ=κ\kappa \cdot \kappa = \kappa (00=0\aleph_0 \cdot \aleph_0 = \aleph_0, 11=1\aleph_1 \cdot \aleph_1 = \aleph_1)
  • For any two infinite cardinals κ\kappa and λ\lambda, κλ=max(κ,2λ)\kappa^\lambda = \max(\kappa, 2^\lambda) (01=21=2\aleph_0^{\aleph_1} = 2^{\aleph_1} = \aleph_2, assuming the Continuum Hypothesis)

Infinite Cardinal Operations

Infinite Sums and Products

  • Infinite sums and products are generalizations of finite sums and products to infinite cardinals
  • The infinite sum of a sequence of cardinals (κi)iI(\kappa_i)_{i \in I} is defined as the cardinality of the disjoint union of sets with cardinalities κi\kappa_i (i=0i=ω\sum_{i=0}^\infty \aleph_i = \aleph_\omega)
  • The infinite product of a sequence of cardinals (κi)iI(\kappa_i)_{i \in I} is defined as the cardinality of the of sets with cardinalities κi\kappa_i (i=0i=ω\prod_{i=0}^\infty \aleph_i = \aleph_\omega)
  • The infinite sum and product of a constant sequence of cardinals κ\kappa are both equal to κ\kappa (i=00=0\sum_{i=0}^\infty \aleph_0 = \aleph_0, i=00=0\prod_{i=0}^\infty \aleph_0 = \aleph_0)

König's Theorem

  • König's theorem states that for any infinite cardinal κ\kappa, the sum of κ\kappa many cardinals, each smaller than κ\kappa, is less than or equal to κ\kappa (i<κλiκ\sum_{i < \kappa} \lambda_i \leq \kappa if λi<κ\lambda_i < \kappa for all i<κi < \kappa)
  • Corollary 1: The infinite sum of a sequence of cardinals (κi)iI(\kappa_i)_{i \in I} is always less than or equal to IsupiIκi|I| \cdot \sup_{i \in I} \kappa_i (i=0i0ω=ω\sum_{i=0}^\infty \aleph_i \leq \aleph_0 \cdot \aleph_\omega = \aleph_\omega)
  • Corollary 2: The infinite product of a sequence of cardinals (κi)iI(\kappa_i)_{i \in I} is always less than or equal to (supiIκi)I(\sup_{i \in I} \kappa_i)^{|I|} (i=0iω0=ω\prod_{i=0}^\infty \aleph_i \leq \aleph_\omega^{\aleph_0} = \aleph_\omega)
  • König's theorem and its corollaries provide upper bounds for infinite sums and products of cardinals

Examples of Infinite Cardinal Operations

  • The set of all finite sequences of natural numbers has cardinality n=00=0\sum_{n=0}^\infty \aleph_0 = \aleph_0
  • The set of all infinite sequences of natural numbers has cardinality i=00=00=c\prod_{i=0}^\infty \aleph_0 = \aleph_0^{\aleph_0} = \mathfrak{c} (the cardinality of the continuum)
  • If (κi)iI(\kappa_i)_{i \in I} is a sequence of cardinals with I=0|I| = \aleph_0 and κi<1\kappa_i < \aleph_1 for all iIi \in I, then iIκi1\sum_{i \in I} \kappa_i \leq \aleph_1 by König's theorem

Key Terms to Review (23)

|a ∪ b|: |a ∪ b| represents the cardinality of the union of two sets, a and b, which is the total number of distinct elements contained in either set. This concept is crucial in understanding how different sets interact, particularly when calculating sizes of combined sets. It helps illustrate the principle of inclusion-exclusion, ensuring that common elements between sets are not double-counted in determining the total size of their union.
|a|: |a| represents the cardinality of the set 'a', which is a measure of the size of the set, indicating the number of elements it contains. This concept allows for comparisons between different sets and plays a crucial role in understanding both finite and infinite sets. The cardinality helps to classify sets as either countably infinite or uncountably infinite, connecting it to important mathematical ideas regarding set sizes and operations involving those sizes.
Absorption laws: Absorption laws are fundamental rules in set theory that describe how certain operations with sets can simplify expressions. Specifically, they express the idea that combining a set with a union or intersection involving itself will yield that original set, providing insight into the structure of sets and their relationships. These laws help in understanding cardinal arithmetic operations by demonstrating how certain combinations can lead to more straightforward conclusions about the sizes and relationships of sets.
Addition of cardinals: Addition of cardinals refers to the operation of combining two cardinal numbers to determine the total quantity of distinct elements represented by these numbers. This operation goes beyond simple arithmetic, especially when dealing with infinite sets, where the results can differ from finite cardinal arithmetic due to the nature of infinity.
Associative Property: The associative property states that the way in which numbers are grouped in an operation does not change the result. This means that when performing operations like addition or multiplication, the grouping of the numbers can be altered without affecting the outcome. This property highlights a fundamental aspect of arithmetic and set operations, allowing for flexibility in calculations and reasoning about mathematical relationships.
Bijective Function: A bijective function is a type of function that establishes a one-to-one correspondence between elements of two sets, meaning that every element in the first set is paired with a unique element in the second set and vice versa. This characteristic ensures that both the function is injective (no two elements from the first set map to the same element in the second) and surjective (every element in the second set is an image of at least one element from the first). Understanding bijective functions is crucial because they allow for effective comparisons of set sizes and play a fundamental role in various branches of mathematics, including topology and computer science.
Cantor's Theorem: Cantor's Theorem states that for any set, the power set of that set (the set of all its subsets) has a strictly greater cardinality than the set itself. This theorem highlights a fundamental aspect of the nature of infinity and implies that not all infinities are equal, leading to insights about the structure of different sizes of infinity.
Cardinal function: A cardinal function is a mathematical tool used to measure the size of sets in terms of cardinality, which essentially reflects the number of elements in a set. These functions are significant in understanding how different sizes of infinity relate to one another, and they help describe various operations performed on sets, particularly within cardinal arithmetic. Cardinal functions can lead to conclusions about the relationships between sets, such as whether one set can be put into a one-to-one correspondence with another.
Cardinality of a union: The cardinality of a union refers to the number of distinct elements in the union of two or more sets. This concept is fundamental in understanding how to combine sets while considering overlaps, as it highlights how many unique items are present when merging the contents of different collections.
Cartesian Product: The Cartesian product is a mathematical operation that combines two sets to form a new set, consisting of all possible ordered pairs where the first element comes from the first set and the second element comes from the second set. This concept is foundational in understanding relations and functions, as well as in exploring the structure of finite sets and their interactions through various arithmetic operations.
Commutative Property: The commutative property is a fundamental principle in mathematics that states that the order of the operands does not change the result of an operation. This property applies to operations such as addition and multiplication, where changing the sequence of numbers yields the same outcome. Understanding this property helps simplify calculations and proves useful in various mathematical contexts, including operations involving sets and numbers.
Countably Infinite: Countably infinite refers to a type of infinite set that can be put into a one-to-one correspondence with the set of natural numbers. This means that the elements of a countably infinite set can be listed in a sequence where each element is paired with exactly one natural number, such as 1, 2, 3, and so on. This concept is essential in understanding different sizes of infinity, especially when comparing sets and working with cardinalities.
Distributive Property: The distributive property is a fundamental algebraic principle that states that for any numbers a, b, and c, the equation a(b + c) = ab + ac holds true. This property allows for the distribution of multiplication over addition or subtraction, simplifying expressions and solving equations effectively. It connects various mathematical operations and is crucial for understanding how to manipulate sets and their operations like union, intersection, and complement as well as cardinal arithmetic.
Exponentiation of cardinals: Exponentiation of cardinals is the operation that takes two cardinal numbers, where one acts as the base and the other as the exponent, resulting in a new cardinal number representing the size of the set of functions from one set to another. This concept is essential in understanding how different sizes of infinite sets interact, especially in operations involving cardinal arithmetic.
Finite cardinal: A finite cardinal is a number that represents the size of a finite set, indicating how many elements are in that set. Finite cardinals are essential in understanding the concept of counting within set theory, as they help to establish a foundation for comparing sizes of sets and performing arithmetic operations on them.
Infinite cardinal: An infinite cardinal is a type of cardinal number that represents the size of an infinite set. Unlike finite cardinals, which count a specific number of elements, infinite cardinals measure the size of sets that do not have a last element. They play a crucial role in understanding different sizes of infinity and the properties that arise when performing arithmetic operations on these quantities.
Injection and Surjection: Injection and surjection are two important concepts in set theory related to functions between sets. An injection (or one-to-one function) means that each element in the domain is mapped to a unique element in the codomain, ensuring no two elements in the domain share the same image. A surjection (or onto function) guarantees that every element in the codomain is covered by at least one element from the domain, meaning the function reaches its full range. These concepts are crucial when discussing cardinal arithmetic operations as they determine how sets can be compared and manipulated.
König's Theorem: König's Theorem is a principle in set theory that states that for any infinite bipartite graph, the size of the maximum matching equals the size of the minimum vertex cover. This theorem illustrates an important relationship between two concepts in graph theory, emphasizing how they can be used to analyze infinite sets and their cardinalities.
Multiplication of cardinals: The multiplication of cardinals is an operation that combines two cardinal numbers to produce a new cardinal number representing the size of the Cartesian product of two sets. This operation extends the concept of multiplication from finite sets to infinite sets, allowing us to explore relationships between different sizes of infinity. The rules governing cardinal multiplication differ significantly from standard arithmetic, especially when dealing with infinite sets.
Power Set: A power set is the set of all possible subsets of a given set, including the empty set and the set itself. Understanding power sets helps in exploring relationships among sets, such as union, intersection, and complement operations, as well as foundational concepts like the Zermelo-Fraenkel axioms, which support the structure of set theory.
Schroeder-Bernstein Theorem: The Schroeder-Bernstein Theorem states that if there are injective functions from set A to set B and from set B to set A, then there exists a bijection between the two sets A and B. This theorem connects the concept of cardinality with the idea of countable and uncountable sets, making it essential for understanding relationships between different sizes of infinity, as well as implications for cardinal arithmetic and hypotheses regarding the continuum.
Transfinite Numbers: Transfinite numbers are types of numbers that extend beyond the finite, representing sizes of infinite sets. They are particularly significant in set theory, where they help to classify different levels of infinity and facilitate operations involving infinite cardinalities, especially in cardinal arithmetic operations.
Uncountably infinite: Uncountably infinite refers to a type of infinity that is larger than the infinity of countable sets, meaning that there is no way to list or enumerate all the elements of such a set. This concept is essential when discussing the different sizes of infinity, particularly in relation to sets like the real numbers, which cannot be matched one-to-one with the natural numbers. Understanding uncountably infinite helps to differentiate between various infinite sets and their cardinalities, including how they relate to concepts like Dedekind-infinite sets, the properties of the continuum, and operations involving cardinal numbers.
© 2024 Fiveable Inc. All rights reserved.
AP® and SAT® are trademarks registered by the College Board, which is not affiliated with, and does not endorse this website.