Multiplication Properties of Equivalence Classes

Click For Summary
SUMMARY

The discussion centers on the properties of equivalence classes in modular arithmetic, specifically addressing the statement: for [a], [b] ∈ Zn, if [a]·[b]=[0], then either [a]=[0] or [b]=[0]. This statement is disproven using the example of n=6, [a]=3, and [b]=4, where [3]·[4]=[0] despite neither [3] nor [4] being zero. The revised statement proposed is that if [a]·[b]=[0], then ab ≡ 0 (mod n), which aligns with the definition of multiplication in modular arithmetic.

PREREQUISITES
  • Understanding of modular arithmetic and equivalence classes
  • Familiarity with the notation Zn and its properties
  • Basic knowledge of prime integers and their implications in modular systems
  • Ability to perform modular multiplication and equivalence proofs
NEXT STEPS
  • Study the properties of equivalence classes in modular arithmetic
  • Learn about the implications of prime integers in modular systems
  • Explore proofs related to modular multiplication and zero divisors
  • Investigate the concept of zero divisors in rings and fields
USEFUL FOR

Students of abstract algebra, mathematicians exploring modular arithmetic, and educators teaching equivalence classes and their properties.

jcfaul01
Messages
2
Reaction score
0

Homework Statement



Prove or disprove and salvage if possible: for [a], ∈ Zn for a positive integer n, if [a]·=[0], then either [a]=[0] or =[0].

The Attempt at a Solution



I've managed to disprove the statement:
Let n=6,[a]=3,and=[4]. The[a]·=[ab]=[3·4]=[12]. Since12≡0(modn), 12 ∈ [0] so[12] = [0]. Thus [3] · [4] = [0] and this statement is false.

However, my problem is with salvaging it. I've been able to come up with what I believe to be the correct statement:

For [a], ∈ Zn for a positive integer n, if [a] · = [0], then ab ≡ 0 (mod n).

But I have no idea how to prove it, I don't even know where to start. I would really appreciate any help on this,

thanks.
 
Physics news on Phys.org
What you have, [m][n]= 0 implies mn= 0 (mod n) is just the definition of [m][n]= 0.

Let n be a prime integer, then ...
 
Thanks! I think I've got it now!
 

Similar threads

Replies
9
Views
2K
  • · Replies 5 ·
Replies
5
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 2 ·
Replies
2
Views
1K
  • · Replies 5 ·
Replies
5
Views
2K
  • · Replies 9 ·
Replies
9
Views
2K
  • · Replies 3 ·
Replies
3
Views
1K
  • · Replies 6 ·
Replies
6
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 4 ·
Replies
4
Views
2K