Simple Problem concerning tensor products

  • Context: MHB 
  • Thread starter Thread starter Math Amateur
  • Start date Start date
  • Tags Tags
    Tensor
Click For Summary
SUMMARY

The discussion focuses on the tensor product $$ \mathbb{Z} / m \mathbb{Z} \otimes \mathbb{Z} / n \mathbb{Z}$$ and its relationship with greatest common divisors (gcd). Specifically, it addresses the proof that if $$ m(1 \otimes 1) = 0 $$ and $$ n(1 \otimes 1) = 0 $$, then $$ d(1 \otimes 1) = 0 $$, where $$ d $$ is the gcd of integers $$ m $$ and $$ n $$. The conclusion is that since $$ d $$ can be expressed as a linear combination of $$ m $$ and $$ n $$, it follows that $$ dx = 0 $$ holds true.

PREREQUISITES
  • Understanding of tensor products in algebra
  • Knowledge of greatest common divisors (gcd)
  • Familiarity with modular arithmetic
  • Basic linear algebra concepts
NEXT STEPS
  • Study the properties of tensor products in abstract algebra
  • Learn about linear combinations and their applications in number theory
  • Explore examples of gcd in modular arithmetic contexts
  • Investigate the implications of tensor products in homological algebra
USEFUL FOR

This discussion is beneficial for mathematicians, particularly those specializing in abstract algebra, number theory, and anyone interested in the properties of tensor products and gcd.

Math Amateur
Gold Member
MHB
Messages
3,920
Reaction score
48
Actually this problem really only concerns greatest common denominators.

In Section 10.4, Example 3 (see attachment) , Dummit and Foote where we are dealing with the tensor product $$ \mathbb{Z} / m \mathbb{Z} \otimes \mathbb{Z} / n \mathbb{Z}$$ we find the following statement: (NOTE: d is the gcd of integers m and n)

"Since $$ m(1 \otimes 1) = m \otimes 1 = 0 \otimes 1 = 0 $$

and similarly

$$ n(1 \otimes 1) = 1 \otimes n = 1 \otimes 0 = 0 $$

we have

$$ d(1 \otimes 1) = 0 $$ ... ... "

Basically we have

mx = 0 and nx = 0 and have to show dx = 0

It must be simple but I cannot see it!

Can someone please help?

Peter
 
Physics news on Phys.org
This comes from the fact that the gcd of two numbers can always be written as a linear combination of them. If $d = \text{gcd}(m,n)$ then there are integers $s,t$ such that $d=sm+tn.$ Then $dx = (sm+tn)x = s(mx) + t(nx) = 0.$
 

Similar threads

  • · Replies 16 ·
Replies
16
Views
3K
  • · Replies 18 ·
Replies
18
Views
3K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 7 ·
Replies
7
Views
3K
  • · Replies 1 ·
Replies
1
Views
1K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 7 ·
Replies
7
Views
2K
  • · Replies 8 ·
Replies
8
Views
3K