Proving that lcm(a,b)gcd(a,b)=ab

  • Thread starter Thread starter Mr Davis 97
  • Start date Start date
Click For Summary

Homework Help Overview

The discussion revolves around proving the identity involving the greatest common divisor (gcd) and least common multiple (lcm) of two integers, specifically that gcd(a,b) * lcm(a,b) = ab. The context is set within the framework of ideals in the integers, particularly focusing on the ideals generated by the integers a and b.

Discussion Character

  • Mixed

Approaches and Questions Raised

  • Participants explore various mathematical frameworks, including isomorphism theorems and prime factorization, to approach the proof. Some suggest using basic set theory and prime factorization to express gcd and lcm in terms of their prime factors. Others question the necessity of certain theorems and consider alternative representations of ideals.

Discussion Status

The discussion is ongoing, with participants sharing different perspectives and approaches. Some express confusion about the implications of their considerations, while others are attempting to clarify their thoughts on the use of ideals and quotients in relation to the proof.

Contextual Notes

There is a noted emphasis on the properties of ideals in the integers, with participants discussing the necessity of principal ideals and the implications of using quotients in their reasoning. Some participants express uncertainty about how their current approaches lead to the desired result.

Mr Davis 97
Messages
1,461
Reaction score
44

Homework Statement


Let ##a\neq 0, b\neq 0## be integers and let ##(a),(b)## be the ideals they generate in ##\mathbb{Z}##. Show that ##\operatorname{gcd}(a,b)\operatorname{lcm}(a,b) =ab##

Homework Equations

The Attempt at a Solution


Suppose that I already know from the second isomorphism theorem that
$$\frac{(a)}{(\gcd(a,b))} \cong \frac{(\rm{lcm}(a,b))}{(b)}.$$ How can I get from this the result ##\operatorname{gcd}(a,b)\operatorname{lcm}(a,b) =ab##?
 
Physics news on Phys.org
There's no need to use isomorphism theorems. Basic set theory will suffice.

Let the prime factors of ##ab## be ##p_1,...,p_n## and let ##a=\prod_{k=1}^n p_k{}^{r_k}## and ##b=\prod_{k=1}^n p_k{}^{s_k}##.

Now write each of gcd(##a,b##), lcm(##a,b##) and ##ab## in that prime-factorised product form (you'll need to use min and max functions). It should be easy to prove the required identity from there, given that ##p^{\min(\alpha,\beta)}p^{\max(\alpha,\beta)} = p^{\alpha+\beta}##.
 
  • Like
Likes   Reactions: Delta2
andrewkirk said:
There's no need to use isomorphism theorems.
... but I sounds as an elegant idea.
Mr Davis 97 said:
Suppose that I already know from the second isomorphism theorem ...
Consideration of ##\mathbb{Z}_a\; , \;\mathbb{Z}_b\; , \;\mathbb{Z}_a + \mathbb{Z}_b\; , \;\mathbb{Z}_a \cap \mathbb{Z}_b## should do.
 
  • Like
Likes   Reactions: Mr Davis 97
fresh_42 said:
... but I sounds as an elegant idea.

Consideration of ##\mathbb{Z}_a\; , \;\mathbb{Z}_b\; , \;\mathbb{Z}_a + \mathbb{Z}_b\; , \;\mathbb{Z}_a \cap \mathbb{Z}_b## should do.
How can I consider these rings such as ##\mathbb{Z}_a## and ##\mathbb{Z}_b## if they are not principal ideals of ##\mathbb{Z}##, which they must be by hypothesis?
 
Mr Davis 97 said:
How can I consider these rings such as ##\mathbb{Z}_a## and ##\mathbb{Z }_b## if they are not principal ideals of ##\mathbb{Z}##, which they must be by hypothesis?
Sorry, my fault. I meant ##a\mathbb{Z}\; , \;b\mathbb{Z}\; , \;(a+b)\mathbb{Z}## or ##(ab)\mathbb{Z}## and ##a\mathbb{Z} \cap b\mathbb{Z}## of course, the ideals, not the quotients.
 
  • Like
Likes   Reactions: Mr Davis 97
fresh_42 said:
Sorry, my fault. I meant ##a\mathbb{Z}\; , \;b\mathbb{Z}\; , \;(a+b)\mathbb{Z}## or ##(ab)\mathbb{Z}## and ##a\mathbb{Z} \cap b\mathbb{Z}## of course, the ideals, not the quotients.
I'm not seeing how consideration of these implies the result though
 
Mr Davis 97 said:
I'm not seeing how consideration of these implies the result though
Yes, you completely confused me, as we need the quotients for the finite number of elements to represent the formula.
... guess, I should do it first on my own ...
 
  • Like
Likes   Reactions: Mr Davis 97
fresh_42 said:
Yes, you completely confused me, as we need the quotients for the finite number of elements to represent the formula.
... guess, I should do it first on my own ...
I think maybe we just look at subgroup indices
 
I must admit, that I haven't found a nice way, although I still think there is one. But my attempts all ended up in diagram chasing. To use isomorphism theorems, one probably needs to show that ##(a\mathbb{Z}\cap b\mathbb{Z})/ ab\mathbb{Z} \cong \mathbb{Z}/(a\mathbb{Z}+b\mathbb{Z})##. Maybe you have an idea how to show that fast. I even tried to use the four, five and nine lemmas.
 

Similar threads

Replies
2
Views
2K
  • · Replies 11 ·
Replies
11
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 5 ·
Replies
5
Views
2K
  • · Replies 9 ·
Replies
9
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K
Replies
20
Views
3K
Replies
5
Views
2K
  • · Replies 4 ·
Replies
4
Views
3K
  • · Replies 6 ·
Replies
6
Views
2K