What is the Equivalence Class for a Fixed Integer in Hurricane Lane's Aftermath?

  • Context: MHB 
  • Thread starter Thread starter karush
  • Start date Start date
  • Tags Tags
    Proofs Set
Click For Summary
SUMMARY

The discussion focuses on the concept of equivalence classes in the context of a fixed integer, specifically in relation to the equivalence relation defined by $a \sim b$ if $b - a \in \mathbb{Z}$. The equivalence class containing a fixed integer $a$ is described as $[a] = \{a + n : n \in \mathbb{Z}\}$. The relation is confirmed to be reflexive, symmetric, and transitive, thus qualifying as an equivalence relation. The discussion also touches on the implications of partitions in set theory.

PREREQUISITES
  • Understanding of equivalence relations
  • Familiarity with integer sets and notation
  • Basic knowledge of set theory and partitions
  • Concept of reflexivity, symmetry, and transitivity in relations
NEXT STEPS
  • Study the properties of equivalence relations in depth
  • Explore examples of equivalence classes in different mathematical contexts
  • Learn about partitions of sets and their applications
  • Investigate the role of equivalence relations in abstract algebra
USEFUL FOR

Mathematicians, students studying abstract algebra, and anyone interested in the foundational concepts of equivalence relations and set theory.

karush
Gold Member
MHB
Messages
3,240
Reaction score
5
View attachment 8332
ok need help with these 3 questions

I know its fairly easy but its new to me, so

we have had hurricane Lane here this week
but mahalo much
 
Physics news on Phys.org
13. Showing that the given relation is an equivalence relation is straightforward. I suppose you are stuck at describing the equivalence classes. Let $a$ be a fixed integer. What is the equivalence class containing $a$, i.e. $[a]$? Well, $b\in[a]$ $\iff$ $b\sim a$ $\iff$ $b-a=n\in\mathbb Z$ $\iff$ $b=a+n$ $\iff$ $b\in\{a+n:n\in\mathbb Z\}$. Hence $[a]=\{a+n:n\in\mathbb Z\}$.

14. Is this relation transitive? Hint: $1\cdot0\ge0$ and $0\cdot(-1)\ge0$.

15: Suppose $\frak P$ is a partition of a set $S$; then the relation is $a\sim b$ iff $a$ and $b$ belong to the same subset of $S$ in $\frak P$. By the definition of a partition, every member of $S$ belongs to some subset of $S$ in $\frak P$; hence ~ is reflexive. It is clearly symmetric. I’ll leave you to show that it is transitive, hence an equivalence relation.
 
Olinguito said:
13. Showing that the given relation is an equivalence relation is straightforward. I suppose you are stuck at describing the equivalence classes. Let $a$ be a fixed integer. What is the equivalence class containing $a$, i.e. $[a]$? Well, $b\in[a]$ $\iff$ $b\sim a$ $\iff$ $b-a=n\in\mathbb Z$ $\iff$ $b=a+n$ $\iff$ $b\in\{a+n:n\in\mathbb Z\}$. Hence $[a]=\{a+n:n\in\mathbb Z\}$.

14. Is this relation transitive? Hint: $1\cdot0\ge0$ and $0\cdot(-1)\ge0$.

15: Suppose $\frak P$ is a partition of a set $S$; then the relation is $a\sim b$ iff $a$ and $b$ belong to the same subset of $S$ in $\frak P$. By the definition of a partition, every member of $S$ belongs to some subset of $S$ in $\frak P$; hence ~ is reflexive. It is clearly symmetric. I’ll leave you to show that it is transitive, hence an equivalence relation.


that was very helpful ;)
 

Similar threads

Replies
5
Views
2K
Replies
4
Views
2K
  • · Replies 14 ·
Replies
14
Views
5K
Replies
2
Views
2K
  • · Replies 4 ·
Replies
4
Views
2K
Replies
8
Views
3K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 5 ·
Replies
5
Views
2K
Replies
3
Views
2K