Exercise 2.2

Let p 1 , p 2 , … , p t ∈ ℤ be primes and consider the set of all rational numbers r = a ∕ b , a , b ∈ ℤ , such that ord p i a ≥ ord p i b for i = 1 , 2 , … , t . Show that this set is a ring and that up to taking associates p 1 , p 2 , … , p t are the only primes.

Answers

Proof. Let R the set of such rationals. Simplifying these fractions, we obtain

r ∈ R ⟺ ∃ ⁡ p ∈ ℤ , ∃ ⁡ q ∈ ℤ ∖ { 0 } , r = p q , q ∧ p 1 p 2 ⋯ p t = 1 .

∙ 1 = 1 ∕ 1 ∈ R .

∙ if r , r ′ ∈ R , r = p ∕ q , r ′ = p ′ ∕ q ′ , with q ∧ p 1 p 2 ⋯ p t = 1 , q ′ ∧ p 1 p 2 ⋯ p t = 1 . then q q ′ ∧ p 1 p 2 ⋯ p t = 1 , and r − r ′ = p q ′ − q p ′ q q ′ , r r ′ = p p ′ q q ′ , so r − r ′ , r r ′ ∈ R .

Thus R is a subring of ℚ .

If r = a ∕ b ∈ R is an unit of R , then b ∕ a ∈ R , so ord p i a = ord p i ( b ) , i = 1 , … , t . After simplification, r = p ∕ q , with p ∧ p 1 ⋯ p t = 1 , q ∧ p 1 ⋯ p t = 1 , and such rationals are all units.

Note that p i , 1 ≤ i ≤ t , is a prime: if p i ∣ rs in R , where r = a ∕ b , s = c ∕ d ∈ R , then there exists u = e ∕ f ∈ R such that rs = p i u , with b , d , f relatively prime with p 1 , … , p t . Then acf = p i bde . As p i ∧ f = 1 , p i divides a or c in ℤ , so p i divides r or s in R .

If r = a ∕ b ∈ R , with b ∧ p 1 ⋯ p r = 1 , a = p 1 k 1 ⋯ p t k t v , v ∈ ℤ , k i ≥ 0 , i = 1 , … , t . So r = u p 1 k 1 ⋯ p t k t , where u = v ∕ b is an unit.

Let π be any prime in R . As any element in R , π = u p 1 k 1 ⋯ p t k t , k i ≥ 0 , u = a ∕ b an unit. u − 1 π = p 1 k 1 ⋯ p t k t , so π ∣ p 1 k 1 ⋯ p t k t (in R ). As π is a prime in R , π ∣ p i for an index i = 1 , … , t . Thus p i = qπ , where q ∈ R . Since p i is irreducible, q is a unit, so p i and π are associate.

Conclusion: the primes in R are the associates of p 1 , … , p t . □

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