What is a Quotient Set: Practical Terms & Euler's Phi Function

In summary, a quotient set is the set of equivalence classes created by an equivalence relation on a given set. It is a way of making equivalent things equal by replacing everything with its equivalence class. In set theory, the "standard" quotient set is the set of equivalence classes, or the "standard" way of making equivalent things equal. Quotient sets are also related to surjective functions, equivalence relations, and partitions of a set. In number theory, the congruence module can also create a partition of the integers and a quotient set.
  • #1
lordy12
36
0
what exactly is a quotient set? I know it "partitions" a large group of numbers into discrete subsets but I still don't know what exactly it is in practical terms. Like, does it relate somehow to Euler's phi function?
 
Mathematics news on Phys.org
  • #2
lordy12 said:
what exactly is a quotient set? I know it "partitions" a large group of numbers into discrete subsets but I still don't know what exactly it is in practical terms. Like, does it relate somehow to Euler's phi function?
Suppose you have a set and an equivalence relation on it. Intuitively, a quotient set is what you get when you make equivalent things equal.

In set theory, the "standard" quotient set is the set of equivalence classes. In other words, the "standard" way to make equivalent things equal is to replace everything with its equivalence class.
 
Last edited:
  • #3
surjective functions defined on S are equivlent to equivalence relations on S and equivalent to partitions of S and equivalent to quotient sets of S.
 
  • #4
A not empty.
Any (total) map f:A->B determines a partition of its domain in an obvious way. If R is the associated equivalence relation on A, then the partition is the quotient set A/R. The members of A/R are equivalence classes.

I know next to nothing about phi, but it looks like
dom(phi) = Z+.
Is the partition of Z+ (induced by phi) used anywhere in the rather lengthy analysis of phi properties?
 
  • #5
quotient set is the set of the equivalence class of a set X. You can think of it like if we can't distinguish between equivalent members and the quotient set is the set in which the whole set of equivalent members of a class is represented by an abstract member [a]. In Math is important the concept that:

quotient set<-> equivalence relations<-> partitions

The proof is standard.

About the phi functions there is no equivalence between co-primes in general, but like co-primes are defined using modules then the concept of equivalence is related. In number theory the congruence module something can be show to form a partition in the integers and also a quotient set.
 
  • #6
...he said, three years later ;)
 
  • #7
LOL

better late than never.
 

Related to What is a Quotient Set: Practical Terms & Euler's Phi Function

What is a Quotient Set?

A quotient set is a set of all possible remainders when dividing a set of numbers by a given number. It is denoted as Z/nZ, where n is the number being divided.

What are some practical applications of Quotient Sets?

Quotient sets have various practical applications, such as in modular arithmetic, cryptography, and computer science. They are also used in the study of number theory and abstract algebra.

What is Euler's Phi Function?

Euler's Phi function, also known as Euler's totient function, is an arithmetic function that counts the positive integers less than or equal to a given number n that are relatively prime to n. It is denoted as φ(n).

How is Euler's Phi Function related to Quotient Sets?

Euler's Phi function is closely related to quotient sets as it is used to calculate the number of elements in a quotient set. If n is a positive integer, then the number of elements in the quotient set Z/nZ is equal to φ(n).

What are some properties of Quotient Sets and Euler's Phi Function?

Some properties of quotient sets and Euler's Phi function include: commutativity, associativity, distributivity, and multiplicative identity. Additionally, Euler's Phi function has the property that if n is a prime number, then φ(n) = n-1.

Similar threads

  • General Math
Replies
8
Views
2K
  • Topology and Analysis
Replies
8
Views
2K
Replies
2
Views
1K
Replies
3
Views
3K
  • Differential Equations
Replies
1
Views
2K
Replies
1
Views
932
Replies
12
Views
2K
Replies
8
Views
1K
  • General Math
Replies
3
Views
791
Back
Top