Bourbaki

Proposition 1

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

Commutative Algebra, chapter VI, § 3. Valuations

Let vv be a valuation on a (not necessarily commutative) ring CC. For any elements xi∈Cx_i \in C (1≤i≤n1 \leq i \leq n),

v(∑i=1nxi)≥inf⁡1≤i≤nv(xi) v \left( \sum_{i=1}^n x_i \right) \geq \inf_{1 \leq i \leq n} v(x_i)

Moreover, if there exists a single index kk such that v(xk)=inf⁡1≤i≤nv(xi)v(x_k) = \inf_{1 \leq i \leq n} v(x_i), the two sides of (1) are equal. In particular, if v(x)≠v(y)v(x) \neq v(y), then v(x+y)=inf⁡(v(x),v(y))v(x + y) = \inf(v(x), v(y)).

Relation (1) follows from axiom (VL_{II}) by induction on nn. If there exists a single index kk such that v(xk)=inf⁡1≤i≤nv(xi)v(x_k) = \inf_{1 \leq i \leq n} v(x_i), then, writing y=∑i≠kxiy = \sum_{i \neq k} x_i and z=∑i=1nxiz = \sum_{i=1}^n x_i, v(y)>v(xk)v(y) > v(x_k) and v(z)≥v(xk)v(z) \geq v(x_k) by (1); if v(z)>v(xk)v(z) > v(x_k), the relation xk=z−yx_k = z - y would give v(xk)≥inf⁡(v(z),v(y))>v(xk)v(x_k) \geq \inf(v(z), v(y)) > v(x_k), which is absurd; whence v(z)=v(xk)v(z) = v(x_k), which proves the second assertion.

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

Cited by

Cites

Nothing.

Transcribed from the printed volume. Not translated.