Exercise 1.19

Define the least common multiple of two integers a and b to be an integer m such that a ∣ m , b ∣ m , and m divides every common multiple of a and b . Show that such an m exists. It is determined up to sign. We shall denote it by [ a , b ] .

Answers

Proof. As aℤ ∩ bℤ is an ideal of ℤ , and ℤ is a principal ideal domain, there exists an unique m ≥ 0 such that aℤ ∩ bℤ = mℤ . So by definition,

m = [ a , b ] ⟺ aℤ ∩ bℤ = mℤ and m ≥ 0 .

We may note also [ a , b ] = a ∨ b .

Characterization of lcm :

m = a ∨ b ⟺ ( i ) m ≥ 0 ( ii ) a ∣ m , b ∣ m ( iii ) ∀ ⁡ μ ∈ ℤ , ( a ∣ μ , b ∣ μ ) ⇒ m ∣ μ

(⇒) By definition, m ≥ 0 . m ∈ mℤ = aℤ ∩ bℤ , so a ∣ m and b ∣ m : (ii) is verified. If μ ∈ ℤ is such that a ∣ μ , b ∣ μ , then μ ∈ aℤ ∩ bℤ = mℤ , so m ∣ μ : (iii) is true.

(⇐) Suppose that m verifies (i),(ii),(iii). Let m ′ such that aℤ ∩ bℤ = m ′ ℤ , m ′ ≥ 0 . We show that m = m ′ .

As m ′ ∈ aℤ ∩ bℤ , a ∣ m ′ , b ∣ m ′ , so we see from (iii) that m ∣ m ′ . From (ii), we obtain that m ∈ aℤ ∩ bℤ = m ′ ℤ , thus m ′ ∣ m , m ≥ 0 , m ′ ≥ 0 . The conclusion is m = m ′ and aℤ ∩ bℤ = mℤ , m ≥ 0 , so m = a ∨ b . □

User profile picture
2022-07-19 00:00
Comments