Bourbaki

Proposition 11

Tag 06X7, permanent. Cite it as [Bourbaki, Tag 06X7].

Algebra, chapter VI, § 1. Ordered groups. Divisibility

If (xi),(yj)(x_i), (y_j) are two finite families of positive elements of a lattice ordered group, then

inf⁡(∑ixi,∑jyj)≤∑i,jinf⁡(xi,yj) \inf \left( \sum_i x_i, \sum_j y_j \right) \leq \sum_{i,j} \inf(x_i, y_j)

Arguing by induction on the number of elements in the families (xi)(x_i) and (yj)(y_j), it is enough to prove that, if x, y and z are positive elements, then

inf⁡(x,y+z)≤inf⁡(x,y)+inf⁡(x,z). \inf(x, y + z) \leq \inf(x, y) + \inf(x, z).

Indeed, put t=inf⁡(x,y+z)t = \inf(x, y + z); by VI, p. 12, Cor., we can write t=t1+t2t = t_1 + t_2 with 0≤t1≤y0 \leq t_1 \leq y and 0≤t2≤z0 \leq t_2 \leq z; since t1t_1 and t2t_2 are positive, we also have t1≤xt_1 \leq x and t2≤xt_2 \leq x, whence t1≤inf⁡(x,y)t_1 \leq \inf(x, y) and t2≤inf⁡(x,z)t_2 \leq \inf(x, z).

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 edition, 2003, Springer. Not translated.