4.3 Partitions and Quotient Sets

Partitions and quotient sets are key concepts in understanding equivalence relations. They help us group similar elements together, simplifying complex structures. This topic builds on earlier ideas about equivalence relations, showing how they create natural divisions within sets.

By exploring partitions and quotient sets, we gain powerful tools for abstraction in math. These concepts allow us to focus on essential properties of mathematical objects, revealing hidden patterns and relationships. They're crucial for simplifying and analyzing various mathematical structures.

Partitions and Equivalence Relations

Defining Partitions and Their Relationship to Equivalence Relations

Top images from around the web for Defining Partitions and Their Relationship to Equivalence Relations

• 

  Category:Measure theory - Wikimedia Commons View original

  Is this image relevant?

• 

  Disjoint union of graphs - WikiVisually View original

  Is this image relevant?

• 

  Category:Equivalence relations - Wikimedia Commons View original

  Is this image relevant?

• 

  Category:Measure theory - Wikimedia Commons View original

  Is this image relevant?

• 

  Disjoint union of graphs - WikiVisually View original

  Is this image relevant?

1 of 3

Top images from around the web for Defining Partitions and Their Relationship to Equivalence Relations

• 

  Category:Measure theory - Wikimedia Commons View original

  Is this image relevant?

• 

  Disjoint union of graphs - WikiVisually View original

  Is this image relevant?

• 

  Category:Equivalence relations - Wikimedia Commons View original

  Is this image relevant?

• 

  Category:Measure theory - Wikimedia Commons View original

  Is this image relevant?

• 

  Disjoint union of graphs - WikiVisually View original

  Is this image relevant?

1 of 3

• A partition of a set $A$ is a collection of non-empty, pairwise disjoint subsets of $A$ whose union is $A$ itself
  • Pairwise disjoint means that no two subsets in the partition share a common element
  • The union of all subsets in the partition must cover the entire set $A$, ensuring that every element of $A$ belongs to exactly one subset
• An equivalence relation on a set $A$ induces a partition of $A$, where the equivalence classes are the subsets in the partition
  • The equivalence classes are formed by grouping together elements that are equivalent under the given equivalence relation
  • Each element of $A$ belongs to exactly one equivalence class, ensuring that the equivalence classes are pairwise disjoint and their union is $A$
• Conversely, given a partition of a set $A$, an equivalence relation can be defined on $A$ by declaring two elements equivalent if and only if they belong to the same subset in the partition
  • This equivalence relation satisfies the reflexive, symmetric, and transitive properties
  • The subsets in the partition become the equivalence classes under this equivalence relation

Properties and Examples of Partitions

• The empty set $\emptyset$ and the set $A$ itself are always subsets in any partition of $A$
  • The partition containing only the empty set and $A$ is called the trivial partition
• A partition can have any number of subsets, ranging from the trivial partition to the discrete partition, where each subset contains a single element of $A$
• Example: Let $A = \{1, 2, 3, 4\}$. One possible partition of $A$ is $\{\{1, 3\}, \{2\}, \{4\}\}$
  • The subsets $\{1, 3\}$, $\{2\}$, and $\{4\}$ are pairwise disjoint and their union is $A$
• Example: Consider the equivalence relation on the set of integers defined by $a \sim b$ if and only if $a - b$ is divisible by 3. The equivalence classes are:
  • $[0] = \{\ldots, -6, -3, 0, 3, 6, \ldots\}$
  • $[1] = \{\ldots, -5, -2, 1, 4, 7, \ldots\}$
  • $[2] = \{\ldots, -4, -1, 2, 5, 8, \ldots\}$
  • These equivalence classes form a partition of the set of integers

Constructing Partitions from Equivalence Relations

Constructing the Partition Induced by an Equivalence Relation

• To construct the partition induced by an equivalence relation $R$ on a set $A$, group elements of $A$ into equivalence classes
  • The equivalence class of an element $a$ in $A$, denoted $[a]$, is the set of all elements in $A$ that are equivalent to $a$ under the relation $R$
  • Formally, $[a] = \{x \in A \mid x \sim a\}$, where $\sim$ represents the equivalence relation $R$
• The collection of all equivalence classes forms the partition of $A$ induced by the equivalence relation $R$
  • Each equivalence class becomes a subset in the partition
  • The equivalence classes are pairwise disjoint because each element of $A$ belongs to exactly one equivalence class
  • The union of all equivalence classes is $A$ itself, ensuring that every element of $A$ is accounted for in the partition

Examples of Constructing Partitions from Equivalence Relations

• Example: Consider the equivalence relation on the set of real numbers defined by $a \sim b$ if and only if $a - b$ is an integer. The equivalence classes are:
  • $[0] = \{\ldots, -2, -1, 0, 1, 2, \ldots\}$
  • $[0.5] = \{\ldots, -1.5, -0.5, 0.5, 1.5, 2.5, \ldots\}$
  • These equivalence classes, along with all other equivalence classes of the form $[r]$ where $0 \leq r < 1$, form a partition of the set of real numbers
• Example: Let $A = \{1, 2, 3, 4, 5, 6\}$ and define an equivalence relation $R$ on $A$ by $a \sim b$ if and only if $a$ and $b$ have the same parity (both even or both odd). The equivalence classes are:
  • $[1] = \{1, 3, 5\}$ (odd numbers)
  • $[2] = \{2, 4, 6\}$ (even numbers)
  • The partition induced by $R$ is $\{\{1, 3, 5\}, \{2, 4, 6\}\}$

Quotient Sets and Equivalence Classes

Defining and Constructing Quotient Sets

• The quotient set of a set $A$ by an equivalence relation $R$, denoted $A/R$, is the set of all equivalence classes of $A$ under the relation $R$
  • Formally, $A/R = \{[a] \mid a \in A\}$, where $[a]$ represents the equivalence class of $a$
• The elements of the quotient set $A/R$ are the equivalence classes themselves, not the individual elements of $A$
  • Each equivalence class is treated as a single element in the quotient set
• The quotient set $A/R$ is a new set constructed from the original set $A$ and the equivalence relation $R$
  • It captures the essential structure of $A$ with respect to the equivalence relation $R$
• The canonical projection map $\pi: A \rightarrow A/R$ sends each element of $A$ to its equivalence class in the quotient set $A/R$
  • Formally, $\pi(a) = [a]$ for all $a \in A$
  • The projection map is surjective (onto) since every equivalence class in $A/R$ is the image of at least one element in $A$

Examples of Quotient Sets

• Example: Consider the equivalence relation on the set of integers defined by $a \sim b$ if and only if $a - b$ is divisible by 5. The quotient set $\mathbb{Z}/\sim$ is:
  • $\mathbb{Z}/\sim = \{[0], [1], [2], [3], [4]\}$
  • Each equivalence class $[i]$ represents the set of integers that leave a remainder of $i$ when divided by 5
• Example: Let $A = \{a, b, c, d\}$ and define an equivalence relation $R$ on $A$ by $aRb$, $bRc$, and $dRd$. The quotient set $A/R$ is:
  • $A/R = \{[a], [d]\}$, where $[a] = \{a, b, c\}$ and $[d] = \{d\}$
  • The equivalence classes $[a]$ and $[d]$ form the elements of the quotient set $A/R$

Applications of Partitions and Quotient Sets

Group Theory and Quotient Groups

• In group theory, the concept of quotient groups relies on partitions and equivalence relations
  • Let $G$ be a group and $H$ be a normal subgroup of $G$. The cosets of $H$ form a partition of $G$
  • The left cosets of $H$ are defined as $aH = \{ah \mid h \in H\}$ for each $a \in G$
  • The right cosets of $H$ are defined as $Ha = \{ha \mid h \in H\}$ for each $a \in G$
  • The left and right cosets of a normal subgroup coincide, forming a partition of $G$
• The quotient group, denoted $G/H$, is constructed using these cosets as elements
  • The elements of the quotient group are the cosets themselves, not the individual elements of $G$
  • The group operation in $G/H$ is defined by $(aH)(bH) = (ab)H$ for any $a, b \in G$
  • The quotient group $G/H$ captures the structure of $G$ with respect to the normal subgroup $H$

Ring Theory and Quotient Rings

• In ring theory, the concept of quotient rings uses partitions and equivalence relations
  • Let $R$ be a ring and $I$ be an ideal of $R$. The ideal $I$ induces an equivalence relation on $R$ defined by $a \sim b$ if and only if $a - b \in I$
  • The equivalence classes under this relation are the cosets of $I$, defined as $a + I = \{a + i \mid i \in I\}$ for each $a \in R$
• The quotient ring, denoted $R/I$, is constructed using the equivalence classes as elements
  • The elements of the quotient ring are the cosets of $I$, not the individual elements of $R$
  • The ring operations in $R/I$ are defined by $(a + I) + (b + I) = (a + b) + I$ and $(a + I)(b + I) = (ab) + I$ for any $a, b \in R$
  • The quotient ring $R/I$ captures the structure of $R$ with respect to the ideal $I$

Topology and Quotient Spaces

• In topology, the concept of quotient spaces uses partitions and equivalence relations
  • Let $X$ be a topological space and $\sim$ be an equivalence relation on $X$
  • The equivalence relation $\sim$ induces a partition of $X$ into equivalence classes
• The quotient space, denoted $X/\sim$, is constructed by identifying equivalent points
  • The elements of the quotient space are the equivalence classes themselves, not the individual points of $X$
  • The quotient space $X/\sim$ is endowed with the quotient topology, where a subset $U$ of $X/\sim$ is open if and only if its preimage under the canonical projection map is open in $X$
  • The quotient space $X/\sim$ captures the essential topological structure of $X$ with respect to the equivalence relation $\sim$

Simplification and Abstraction of Mathematical Structures

• Partitions and quotient sets can be used to study the structure and properties of mathematical objects by identifying and grouping elements with similar characteristics or behaviors
  • By forming equivalence classes, elements that share certain properties or exhibit similar behaviors are treated as a single entity
  • This allows for the simplification and abstraction of complex mathematical structures, focusing on their essential features and relationships
• The use of partitions and quotient sets enables the study of mathematical objects at a higher level of abstraction
  • Quotient structures, such as quotient groups, quotient rings, and quotient spaces, capture the essential properties and behaviors of the original structures
  • By working with quotient structures, mathematicians can uncover hidden patterns, symmetries, and relationships that may not be apparent in the original structures
• Examples of simplification and abstraction using partitions and quotient sets:
  • In group theory, the quotient group $\mathbb{Z}/n\mathbb{Z}$ (the integers modulo $n$) simplifies the structure of the integers by identifying numbers that differ by a multiple of $n$
  • In topology, the quotient space $\mathbb{R}/\mathbb{Z}$ (the real numbers modulo the integers) represents the circle, abstracting away the linear structure of the real numbers and focusing on the circular topology
  • In algebraic geometry, the quotient of a polynomial ring by an ideal allows for the study of algebraic varieties, abstracting the geometric properties of the zero set of the polynomials