Bourbaki

Proposition 4

Tag 04VG, permanent. Cite it as [Bourbaki, Tag 04VG].

Commutative Algebra, chapter VI, § 6. Absolute values

Let ff be a mapping of Q\mathbf{Q} to R+\mathbf{R}_+ belonging to V(Q)\mathscr{V}(\mathbf{Q}). Then:

(i) Either ff is the improper absolute value on Q\mathbf{Q}.

(ii) Or there exists a real number aa and a prime number pp such that 0<a<10 < a < 1 and f=avpf = a^{v_p}, where vpv_p is the pp-adic valuation.

(iii) Or there exists s>0s > 0 such that f(x)=∣x∣sf(x) = |x|^s for all x∈Qx \in \mathbf{Q}.

In care (iii) for ff to be an absolute value on Q\mathbf{Q}, it is necessary and sufficient that 0<s≤10 < s \leq 1.

Suppose first that f(n)≤1f(n) \leq 1 for every integer n>0n > 0. By Proposition 3 of no. 2 there exist a real number bb and a valuation vv on Q\mathbf{Q} such that 0<b<10 < b < 1 and f=bvf = b^v. Now, we know (§ 3, no. 4, Example 4) that the only valuations on Q\mathbf{Q} are (up to equivalence) the improper valuation and the pp-adic valuations vpv_p; we therefore have either case (i) or case (ii).

Suppose from now on that there exists an integer h>0h > 0 such that f(h)>1f(h) > 1; by no. 1, Corollary 2 to Proposition 2, there exists a number ρ>0\rho > 0 such that fρf^\rho is an absolute value; let us write

g(x)=ρlog⁡(f(x))/log⁡∣x∣ g(x) = \rho \log(f(x))/\log|x|

for every rational number x≠0x \neq 0. Let a,ba, b be two integers ≥2\geq 2; for every integer n≥2n \geq 2 let q(n)q(n) denote the integral part of nlog⁡a/log⁡bn \log a/\log b, in other words the least integer mm such that an<bm+1a^n < b^{m+1}; the expansion of ana^n to base bb is therefore

an=c0+c1b+…+cq(n)bq(n) a^n = c_0 + c_1 b + \ldots + c_{q(n)} b^{q(n)}

where 0≤ci<b0 \leq c_i < b for 0≤i≤q(n)0 \leq i \leq q(n). As fρf^\rho is an absolute value, fρ(ci)≤ci≤bf^\rho(c_i) \leq c_i \leq b and we therefore deduce from (2) that

(f(a))nρ=(f(an))ρ≤b(1+(f(b))ρ+…+(f(b))q(n)ρ) (f(a))^{n\rho} = (f(a^n))^\rho \leq b(1 + (f(b))^\rho + \ldots + (f(b))^{q(n)\rho})
≤b(q(n)+1)(sup⁡(1,(f(b))ρ))q(n). \leq b(q(n) + 1)(\sup(1, (f(b))^\rho))^{q(n)}.

Taking logarithms on both sides of this inequality and dividing by nlog⁡an \log a, we obtain

g(a)≤log⁡bnlog⁡a+log⁡(q(n)+1)q(n)⋅q(n)nlog⁡a+sup⁡(0,ρlog⁡f(b))log⁡a⋅q(n)n. g(a) \leq \frac{\log b}{n \log a} + \frac{\log(q(n) + 1)}{q(n)} \cdot \frac{q(n)}{n \log a} + \frac{\sup(0, \rho \log f(b))}{\log a} \cdot \frac{q(n)}{n}.

Note now that as nn tends to +∞+\infty, q(n)/nq(n)/n tends to log⁡a/log⁡b\log a/\log b; therefore q(n)q(n) tends to +∞+\infty and

log⁡(q(n)+1)/q(n) \log(q(n) + 1)/q(n)

tends to 0 (Functions of a Real Variable, Chapter III, § 2, no. 1). Taking the limit in (3), we obtain

(4)

g(a)≤sup⁡(0,ρlog⁡f(b))log⁡b=sup⁡(0,g(b)). g(a) \leq \frac{\sup(0, \rho \log f(b))}{\log b} = \sup(0, g(b)).

But f(h)>1f(h) > 1, whence g(h)>0g(h) > 0; if aa is replaced by hh in (4), we obtain sup⁡(0,g(b))>0\sup(0, g(b)) > 0 and hence

sup⁡(0,g(b))=g(b). \sup(0, g(b)) = g(b).

Then, for any integers a,ba, b at least equal to 2, g(a)≤g(b)g(a) \leq g(b) and therefore g(a)=g(b)g(a) = g(b), exchanging the roles of aa and bb. In other words, there exists a constant λ\lambda such that g(a)=Ag(a) = A for every integer a≥2a \geq 2; if we write s=λ/ρs = \lambda / \rho, then f(a)=∣a∣sf(a) = |a|^s for every integer a≥2a \geq 2. As f(xy)=f(x)f(y)f(xy) = f(x)f(y) and f(−x)=f(x)f(-x) = f(x), f(x)=∣x∣sf(x) = |x|^s for all x∈Qx \in Q. Finally, if 0<s≤10 < s \leq 1, we know that x↦∣x∣sx \mapsto |x|^s is an absolute value (General Topology, Chapter IX, § 3, no. 2); conversely, if ss is such that x↦∣x∣sx \mapsto |x|^s is an absolute value on QQ, then (1+1)s≤1s+1s(1 + 1)^s \leq 1^s + 1^s, that is 2s≤22^s \leq 2, whence s≤1s \leq 1.

Bourbaki puts the proof directly after the statement, so what is above is the statement and its proof together.

Cited by

Cites

Transcribed from the printed volume. Not translated.