The space RA of all real-valued functions defined on any set A is a Riesz space (for the order relation ⟨x(t)≤y(t) for all t∈A⟩); for, any two real-valued functions x,y defined on A have a supremum (resp. an infimum) equal to the mapping t↦sup(x(t),y(t)) (resp. t↦inf(x(t),y(t))).
One can also say that a Riesz space is a vector space E equipped with an order structure such that, on the one hand, this structure and the additive group structure of E define a lattice-ordered group structure on E (A, VI, §1, No. 9), and on the other hand that the axiom (OVSII) is satisfied.
Thus, all of the properties of lattice-ordered groups are applicable to Riesz spaces; we shall review here the principal ones (cf. A, VI, §1, Nos. 9 to 12), as well as indicating the consequences that flow from the axiom (OVSII).
We recall first that one writes x+=sup(x,0) (the positive part of x), x−=(−x)+=sup(−x,0) (the negative part of x), ∣x∣=sup(x,−x) (the absolute value of x); then x=x+−x− and ∣x∣=x++x−; here, these two relations are equivalent to
x+=21(∣x∣+x),x−=21(∣x∣−x).
The relation x≤y is equivalent to ⟨x+≤y+ and x−≥y−⟩. For any x and y, the triangle inequality holds:
(1)
∣x+y∣≤∣x∣+∣y∣.
By the invariance of order under every homothety of ratio >0,
(2)
sup(λx,λy)=λsup(x,y)for all λ≥0.
In particular,
(3)
(λx)+=λx+,(λx)−=λx−for all λ≥0.
On the other hand, for λ<0 we have (λx)+=(−λx)−=∣λ∣x− and (λx)−=(−λx)+=∣λ∣x+; it follows that, for every λ∈R and every x∈E,
(4)
∣λx∣=∣λ∣⋅∣x∣.
The invariance of order under translation shows that for all z∈E,
(5)
sup(x+z,y+z)=z+sup(x,y), whence, in particular,
(6)
sup(x,y)=x+(y−x)+=21(x+y+∣x−y∣).
We have the relations
(7) inf(x,y)=−sup(−x,−y),
(8) sup(x,y)+inf(x,y)=x+y.
If x,y,z are ≥0 then (A, VI, §1, No. 12, Prop. 11)
(9) inf(x+y,z)≤inf(x,z)+inf(y,z).
If A and B are two subsets of E each of which has a supremum, then A + B also has a supremum and
(10) sup(A+B)=supA+supB.
Two elements x,y of E are said to be alien3 (to each other) if inf(∣x∣,∣y∣)=0; by (8), this relation is equivalent to sup(∣x∣,∣y∣)=∣x∣+∣y∣, and also, by (6), to ∣∣x∣−∣y∣∣=∣x∣+∣y∣; 0 is the only element alien to itself; for every x∈E, x+ and x− are alien and may be characterized as the only alien elements y≥0,z≥0 such that x=y−z. If y is alien to x, then every z∈E such that ∣z∣≤∣y∣ is also alien to x. If y and z are alien to x, then so is ∣y∣+∣z∣, by the inequality (9); in particular, n∣y∣ is alien to x for every integer n>0, from which it follows that λy is alien to x for every scalar λ, since there exists an integer n such that ∣λ∣≤n, whence ∣λy∣≤n∣y∣. If a subset A of E consists of elements alien to x and if A has a supremum, then that supremum is also alien to x (A, VI, §1, No. 12, Cor. of Prop. 13).
Finally, we have the decomposition lemma (A, VI, §1, No. 10, Th. 1):
If (xi)i∈I,(yj)j∈J are two finite sequences of elements ≥0 of E such that ∑i∈Ixi=∑j∈Jyj, then there exists a finite sequence (zij)(i,j)∈I×J of elements ≥0 of E such that xi=∑j∈Jzij for all i∈I, and yj=∑i∈Izij for all j∈J.
Bourbaki puts the proof directly after the statement, so what is above is the statement and its proof together.
Nothing.