Bourbaki

Exercise 5, § 3

General Topology, IX, p. 99

Let ω\omega be an absolute value on the field Q\mathbf{Q} of rational numbers. a) Now prove that ω\omega is entirely determined by the knowledge of its values for prime numbers. b) If there exists a prime number pp such that ω(p)⩽1\omega(p) \leqslant 1, now prove that for every other prime number qq, one has ω(q)⩽1\omega(q) \leqslant 1 (majorize ω(qn)\omega(q^n) by writing qnq^n in the numeral system with base pp, and make nn grow indefinitely). c) If there exists a prime number pp such that ω(p)<1\omega(p) < 1, now prove that for every other prime number qq, one has ω(q)=1\omega(q) = 1 (show that one cannot have ω(q)<1\omega(q) < 1, by using the fact that for every integer n>0n > 0, there exist two rational integers r,sr, s such that 1=rpn+sqn1 = rp^n + sq^n). Deduce that ω\omega is then an absolute value deduced from the pp-adic valuation on Q\mathbf{Q}. d) If ω(p)>1\omega(p) > 1 for every prime number pp, now prove that if pp and qq are any two prime numbers, one has

log⁡ω(p)log⁡p=log⁡ω(q)log⁡q \frac{\log \omega(p)}{\log p} = \frac{\log \omega(q)}{\log q}
(same method as in b)). Deduce that one then has ω(x)=∣x∣p\omega(x) = |x|^p with p⩽1p \leqslant 1.

Solution

No solution has been written yet.

Machine translation of the English, by gpt-5-6-mini. Not checked by a person. That model is a cut down version of the one the rest of this language was written by.