Bourbaki

§ 1. Riesz spaces and fully lattice-ordered spaces

1. Definition of Riesz spaces

Recall that, on a set E, a vector space structure over the field R\mathbf{R} and an order structure are said to be compatible if they satisfy the following two axioms:

(OVS_I) The relation x≤yx \leq y implies x+z≤y+zx + z \leq y + z for all z∈Ez \in E.

(OVS_{II}) The relation x≥0x \geq 0 implies λx≥0\lambda x \geq 0 for every scalar λ>0\lambda > 0.

The space E, equipped with these two structures, is called an ordered vector space (TVS, II, §2, No. 5).

Axiom (OVS_I) signifies that the order structure and the additive group structure on E are compatible, in other words that E, equipped with these two structures, is an ordered group (A, VI, §1, No. 1).

Axiom (OVS_I) implies that the relations x≤yx \leq y and x+z≤y+zx + z \leq y + z are equivalent. Similarly, it follows from (OVS_{II}) that, for every scalar λ>0\lambda > 0, the relations x≤yx \leq y and λx≤λy\lambda x \leq \lambda y are equivalent, because λ−1>0\lambda^{-1} > 0 and so the relation λx≤λy\lambda x \leq \lambda y implies λ−1(λx)≤λ−1(λy)\lambda^{-1}(\lambda x) \leq \lambda^{-1}(\lambda y). One can therefore say that, in an ordered vector space, the translations and the homotheties of ratio >0> 0 are automorphisms of the order structure; this fact is also expressed by saying that the order is invariant under every translation and every homothety of ratio >0> 0. Moreover, the symmetry x↦−xx \mapsto -x is an isomorphism of the order structure of E onto the opposite order structure.

Definition 1

An ordered vector space is said to be a Riesz space (or lattice-ordered vector space)*1^1 if its order structure is a lattice-ordering (that is, if every pair of elements x,yx, y of E has a supremum sup⁡(x,y)\sup(x, y) and an infimum inf⁡(x,y)\inf(x, y) ).2^2

(1) Also called a "vector lattice".

(2) Borne supérieure (supremum) is also translated as "least upper bound" (S, R, §6, 7). Similarly borne inférieure (infimum) is also translated as "greatest lower bound".

Example

The space RA\mathbf{R}^A of all real-valued functions defined on any set AA is a Riesz space (for the order relation ⟨x(t)≤y(t) for all t∈A⟩\langle x(t) \leq y(t) \text{ for all } t \in A \rangle); for, any two real-valued functions x,yx, y defined on AA have a supremum (resp. an infimum) equal to the mapping t↦sup⁡(x(t),y(t))t \mapsto \sup(x(t), y(t)) (resp. t↦inf⁡(x(t),y(t))t \mapsto \inf(x(t), y(t))).

One can also say that a Riesz space is a vector space EE equipped with an order structure such that, on the one hand, this structure and the additive group structure of EE define a lattice-ordered group structure on EE (A, VI, §1, No. 9), and on the other hand that the axiom (OVSII_{\mathrm{II}}) 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_{\mathrm{II}}).

We recall first that one writes x+=sup⁡(x,0)x^+ = \sup(x, 0) (the positive part of xx), x−=(−x)+=sup⁡(−x,0)x^- = (-x)^+ = \sup(-x, 0) (the negative part of xx), ∣x∣=sup⁡(x,−x)|x| = \sup(x, -x) (the absolute value of xx); then x=x+−x−x = x^+ - x^- and ∣x∣=x++x−|x| = x^+ + x^-; here, these two relations are equivalent to

x+=12(∣x∣+x),x−=12(∣x∣−x). x^+ = \frac{1}{2}(|x| + x), \quad x^- = \frac{1}{2}(|x| - x).

The relation x≤yx \leq y is equivalent to ⟨x+≤y+ and x−≥y−⟩\langle x^+ \leq y^+ \text{ and } x^- \geq y^- \rangle. For any xx and yy, the triangle inequality holds:

(1)

∣x+y∣≤∣x∣+∣y∣. |x + y| \leq |x| + |y|.

By the invariance of order under every homothety of ratio >0> 0,

(2)

sup⁡(λx,λy)=λsup⁡(x,y)for all λ≥0. \sup(\lambda x, \lambda y) = \lambda \sup(x, y) \quad \text{for all } \lambda \geq 0.

In particular,

(3)

(λx)+=λx+,(λx)−=λx−for all λ≥0. (\lambda x)^+ = \lambda x^+, \quad (\lambda x)^- = \lambda x^- \quad \text{for all } \lambda \geq 0.

On the other hand, for λ<0\lambda < 0 we have (λx)+=(−λx)−=∣λ∣x−(\lambda x)^+ = (-\lambda x)^- = |\lambda| x^- and (λx)−=(−λx)+=∣λ∣x+(\lambda x)^- = (-\lambda x)^+ = |\lambda| x^+; it follows that, for every λ∈R\lambda \in \mathbf{R} and every x∈Ex \in E,

(4)

∣λx∣=∣λ∣⋅∣x∣. |\lambda x| = |\lambda| \cdot |x|.

The invariance of order under translation shows that for all z∈Ez \in E,

(5)

sup⁡(x+z,y+z)=z+sup⁡(x,y), \sup(x + z, y + z) = z + \sup(x, y),
whence, in particular,

(6)

sup⁡(x,y)=x+(y−x)+=12(x+y+∣x−y∣). \sup(x, y) = x + (y - x)^+ = \frac{1}{2}(x + y + |x - y|).

We have the relations

(7) inf⁡(x,y)=−sup⁡(−x,−y),\inf(x, y) = -\sup(-x, -y) ,

(8) sup⁡(x,y)+inf⁡(x,y)=x+y.\sup(x, y) + \inf(x, y) = x + y .

If x,y,zx, y, z are ≥0\geq 0 then (A, VI, §1, No. 12, Prop. 11)

(9) inf⁡(x+y,z)≤inf⁡(x,z)+inf⁡(y,z).\inf(x + y, z) \leq \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)=sup⁡A+sup⁡B.\sup(A + B) = \sup A + \sup B .

Two elements x,yx, y of E are said to be alien3^3 (to each other) if inf⁡(∣x∣,∣y∣)=0\inf(|x|, |y|) = 0; by (8), this relation is equivalent to sup⁡(∣x∣,∣y∣)=∣x∣+∣y∣\sup(|x|, |y|) = |x| + |y|, and also, by (6), to ∣∣x∣−∣y∣∣=∣x∣+∣y∣||x| - |y|| = |x| + |y|; 0 is the only element alien to itself; for every x∈Ex \in E, x+x^+ and x−x^- are alien and may be characterized as the only alien elements y≥0,z≥0y \geq 0, z \geq 0 such that x=y−zx = y - z. If yy is alien to xx, then every z∈Ez \in E such that ∣z∣≤∣y∣|z| \leq |y| is also alien to xx. If yy and zz are alien to xx, then so is ∣y∣+∣z∣|y| + |z|, by the inequality (9); in particular, n∣y∣n|y| is alien to xx for every integer n>0n > 0, from which it follows that λy\lambda y is alien to xx for every scalar λ\lambda, since there exists an integer nn such that ∣λ∣≤n|\lambda| \leq n, whence ∣λy∣≤n∣y∣|\lambda y| \leq n|y|. If a subset A of E consists of elements alien to xx and if A has a supremum, then that supremum is also alien to xx (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(x_i)_{i \in I}, (y_j)_{j \in J} are two finite sequences of elements ≥0\geq 0 of E such that ∑i∈Ixi=∑j∈Jyj\sum_{i \in I} x_i = \sum_{j \in J} y_j, then there exists a finite sequence (zij)(i,j)∈I×J(z_{ij})_{(i,j) \in I \times J} of elements ≥0\geq 0 of E such that xi=∑j∈Jzijx_i = \sum_{j \in J} z_{ij} for all i∈Ii \in I, and yj=∑i∈Izijy_j = \sum_{i \in I} z_{ij} for all j∈Jj \in J.

Cites 3

Cites VI § 1. Integration of vector-valued functions, Proposition 11, VI § 1, Theorem 1, VI § 1

2. Generation of a Riesz space by its positive elements

Let E be an ordered vector space; the set P of elements ≥0\geq 0 of E is a convex cone with vertex 0, that is (TVS, II, §2, No. 4), a set such that

3^3 The original is étrangers, also translated as "coprime" (A, VI, §1, No. 12); the terms "orthogonal", "disjoint" and "mutually singular" are also used.

P + P ⊂ P and λP ⊂ P for all λ > 0. Conversely, if, in a vector space E over R\mathbf{R}, P is a convex cone with vertex 0, such that P∩(−P)={0}P \cap (-P) = \{0\} (in other words, a pointed and proper convex cone), one knows (loc. cit.) that the relation y−x∈Py - x \in P is an order relation (denoted x≤yx \leq y) compatible with the vector space structure of E. For this order structure to define a Riesz space structure on E, it is necessary and sufficient that:

1∘1^\circ P generates E, that is, every z∈Ez \in E is of the form y−xy - x, where x and y belong to P;

2∘2^\circ P satisfies one of the following two conditions: a) every pair of elements of P has a supremum in P; b) every pair of elements of P has an infimum in P (A, VI, §1, No. 9, Prop. 8).

3. Fully lattice-ordered spaces

Definition 2

A Riesz space E is said to be fully lattice-ordered if every nonempty subset of E that is bounded above has a supremum in E.

It is immediate that in a fully lattice-ordered space E, every nonempty subset that is bounded below has an infimum in E.

Example

— 1) If A is any set, the space RA\mathbf{R}^A of real-valued functions defined on A is fully lattice-ordered, the supremum in RA\mathbf{R}^A of a family that is bounded above being its upper envelope (GT, IV, §5, No. 5).

2) Let F be any set; the space B(F)\mathscr{B}(F) of bounded real-valued functions on F, equipped with the order structure induced by that of RF\mathbf{R}^F, is fully lattice-ordered. However, if F is a topological space, the space C(F)\mathscr{C}(F) of continuous real-valued functions on F (equipped with the order structure induced by that of RF\mathbf{R}^F) is a Riesz space that is not in general fully lattice-ordered (cf. Exer. 13). Consider for example the case that F=RF = \mathbf{R}; let I be the interval ]0, 1[, φI\varphi_I the characteristic function of I, and let H be the set of continuous functions x(t)x(t) such that x≤φIx \leq \varphi_I; it is clear that H is bounded above in C(F)\mathscr{C}(F). The function φI\varphi_I is the upper envelope of the x∈Hx \in H, but it is not their supremum in C(F)\mathscr{C}(F), since φI\varphi_I is lower semi-continuous but not continuous. Let us show that, in fact, H has no supremum in C(F)\mathscr{C}(F); it suffices to prove that if uu is a continuous function such that u≥φIu \geq \varphi_I, then there exists a continuous function v≠uv \neq u such that u≥v≥φIu \geq v \geq \varphi_I. Now, u(0)≥1u(0) \geq 1, therefore there exists a number α>0\alpha > 0 such that u(t)>0u(t) > 0 for −α≤t≤0-\alpha \leq t \leq 0; if w is a continuous function that is zero outside of the interval ]−α,0-\alpha, 0 and is such that 0<w(t)<u(t)0 < w(t) < u(t) on this interval, then the function v=u−wv = u - w meets the requirements.

Cites 1

Cites IV § 5. Measurable functions and sets

Proposition 1

For an ordered vector space E to be fully lattice-ordered, it is necessary and sufficient that E be a Riesz space and that it satisfy one of the following two conditions:

Cited by 1

Cited by Corollary 2, IV § 3

a) every nonempty subset A, consisting of elements ≥0\geq 0 of E, that is bounded above and directed for the relation ≤\leq, has a supremum in E;

b) every nonempty subset AA, consisting of elements ⩾0\geqslant 0 of EE and directed for the relation ⩾\geqslant, has an infimum in EE.

The conditions are obviously necessary. Conversely, suppose that EE is a Riesz space satisfying the condition a). Let BB be a nonempty subset of EE that is bounded above; the set CC consisting of the suprema of the finite subsets of BB is directed for the relation ⩽\leqslant; let aa be one its elements and CaC_a the set of x∈Cx \in C that are ⩾a\geqslant a; if we prove that CaC_a has a supremum then it will also be the supremum of BB. Now, Ca−aC_a - a is a set of elements ⩾0\geqslant 0, bounded above and directed for the relation ⩽\leqslant; it therefore has a supremum bb, consequently a+ba + b is the supremum of CaC_a.

On the other hand, the condition b) implies a): for, if FF is a nonempty set of elements ⩾0\geqslant 0 of EE, bounded above and directed for ⩽\leqslant, and if cc is an upper bound for FF, then c−Fc - F is a set of elements ⩾0\geqslant 0 that is directed for ⩾\geqslant; if it has an infimum mm, then c−mc - m is the supremum of FF.

Proposition 2

— Let EE be a Riesz space equipped with a Hausdorff topology that is compatible with its ordered vector space structure (TVS, II, §2, No. 7). If, for every set H⊂EH \subset E that is bounded above and directed for the relation ⩽\leqslant, the section filter of HH is convergent, then EE is fully lattice-ordered.

Cites 1

Cites II § 2. Linear forms on a Riesz space

Indeed, one knows that the limit of the section filter of HH is the supremum of HH in EE (TVS, II, §2, No. 7, Prop. 18).

4. Subspaces and product spaces of fully lattice-ordered spaces

Let EE be a fully lattice-ordered space, HH a linear subspace of EE. The order structure induced on HH by that of EE is compatible with the vector space structure of HH, but the ordered vector space HH so defined is not necessarily a fully lattice-ordered space.

More precisely, it can happen that HH is not a Riesz space (Exer. 2), or that HH is a Riesz space but is not fully lattice-ordered: the latter is the case for the subspace C(R)\mathscr{C}(\mathbf{R}) of the space B(R)\mathscr{B}(\mathbf{R}) (No. 3, Example 2).

Moreover, if HH is a Riesz space (fully lattice-ordered or not) it can happen that the supremum in HH of two elements of HH is different from their supremum in EE (Exer. 3 b). Finally, it can happen that HH is fully lattice-ordered, that the supremum of each finite subset of HH is the same in EE and in HH, but that there exist infinite subsets of HH, bounded above in HH, for which the suprema in EE and HH are different (Exer. 13 f)).

Let (Eι)ι∈I(E_\iota)_{\iota \in I} be any family of ordered vector spaces. Recall that, in the product space E=∏ι∈IEιE = \prod_{\iota \in I} E_\iota, the product order relation of the order relations of the factor spaces is the relation «xι⩽yι for all ι∈I»« x_\iota \leqslant y_\iota \text{ for all } \iota \in I » (S, III, §1, No. 4). One verifies immediately that this relation is compatible with the vector space structure of E; E, equipped with this structure, is called the product space of the ordered spaces EιE_\iota.

Proposition 3

Let (Eι)ι∈I(E_\iota)_{\iota \in I} be a family of ordered vector spaces. For the product space E=∏ι∈IEιE = \prod_{\iota \in I} E_\iota to be a Riesz space (resp. a fully lattice-ordered space), it is necessary and sufficient that each of the spaces EιE_\iota be a Riesz space (resp. a fully lattice-ordered space).

Cited by 1

Cited by Proposition 12, VI § 1

Let us restrict ourselves to examining the case of fully lattice-ordered spaces. Suppose that all of the EιE_\iota are fully lattice-ordered; let AA be a nonempty subset of EE that is bounded above and let a=(aι)a = (a_\iota) be an upper bound for AA. For every ι∈I\iota \in I, pr⁡ιA\operatorname{pr}_\iota A is bounded above by aιa_\iota, hence has a supremum bιb_\iota in EιE_\iota; it is clear that b=(bι)b = (b_\iota) is the supremum of AA in EE.

Conversely, suppose EE is fully lattice-ordered. Let AκA_\kappa be a subset of EκE_\kappa that is bounded above, Aκ′A'_\kappa the subset of EE formed by the x=(xι)x = (x_\iota) such that xκ∈Aκx_\kappa \in A_\kappa and xι=0x_\iota = 0 for ι≠κ\iota \neq \kappa. It is immediate that Aκ′A'_\kappa is bounded above in EE, hence has a supremum b=(bι)b = (b_\iota); by the definition of the product order relation, necessarily bι=0b_\iota = 0 for ι≠κ\iota \neq \kappa, and bκb_\kappa is the supremum of AκA_\kappa, which completes the proof.

Definition 3

Let EE be an ordered vector space, VV and WW two supplementary linear subspaces of EE. One says that EE is the ordered direct sum of VV and WW if the canonical mapping (x,y)↦x+y(x, y) \mapsto x + y of the ordered vector space V×WV \times W onto the ordered vector space EE is an isomorphism.

Proposition 4

For an ordered vector space EE to be the ordered direct sum of two supplementary linear subspaces V,WV, W, it is necessary and sufficient that the relations x∈V,y∈W,x+y≥0x \in V, y \in W, x + y \geq 0 imply x≥0x \geq 0 and y≥0y \geq 0.

Cited by 1

Cited by Theorem 1 (F. Riesz)

Since x≥0x \geq 0 and y≥0y \geq 0 imply x+y≥0x + y \geq 0 in EE, the condition in the statement says that (x,y)↦x+y(x, y) \mapsto x + y transforms the set of elements ≥0\geq 0 of V×WV \times W into the set of elements ≥0\geq 0 of EE.

5. Bands in a fully lattice-ordered space

Definition 4

In a fully lattice-ordered space EE, a linear subspace BB of EE is said to be a band if it satisfies the following conditions: 1) the relations x∈B,y∈Ex \in B, y \in E and ∣y∣≤∣x∣|y| \leq |x| imply y∈By \in B; 2) for every nonempty subset XX of BB that is bounded above in EE, the supremum sup⁡X\sup X of XX in EE belongs to BB.

Cited by 1

Cited by Remark

Example

In the space RA\mathbf{R}^A of real-valued functions defined on a set AA, the set of functions that are zero at all the points of a subset MM of AA is a band.

Remark

In the space RA\mathbf{R}^A, the subspace B(A)\mathscr{B}(A) of bounded real-valued functions on AA satisfies condition 1) of Def. 4; moreover, for every subset XX of B(A)\mathscr{B}(A) that is bounded above in B(A)\mathscr{B}(A), the upper envelope of XX belongs to B(A)\mathscr{B}(A). However, if AA is infinite, a subset of B(A)\mathscr{B}(A) may be bounded above in RA\mathbf{R}^A without being bounded above in B(A)\mathscr{B}(A), in which case B(A)\mathscr{B}(A) is not a band in RA\mathbf{R}^A.

It follows at once from Def. 4 that if BB is a band in EE then, for every nonempty subset XX of BB that is bounded below in EE, inf⁡X\inf X belongs to BB. Every band BB in EE, equipped with the ordered vector space structure induced by that of EE, is a fully lattice-ordered space and, for every subset X⊂BX \subset B that is bounded above in BB, the supremum of XX in BB is identical with its supremum in EE.

The intersection of any family of bands in a fully lattice-ordered space EE is also a band. For every subset M⊂EM \subset E, there exists a smallest band containing MM (since EE itself is a band); this band will be called the band generated by MM.

The properties of bands in a fully lattice-ordered space rest on the following proposition:

Cites 1

Cites Definition 4

Proposition 5

— *Let EE be a fully lattice-ordered space, AA a non-empty subset of EE consisting of elements ⩾0\geqslant 0, such that: 1) A+A⊂AA + A \subset A, and 2) the relations x∈A, 0⩽y⩽xx \in A,\ 0 \leqslant y \leqslant x imply y∈Ay \in A. Let MM be the set of suprema in EE of those subsets of AA that are bounded above in EE. Under these conditions, every element x⩾0x \geqslant 0 of EE may be written in the form y+zy + z, where y∈My \in M is the supremum of the elements v∈Av \in A such that v⩽xv \leqslant x, and where zz is an element ⩾0\geqslant 0 that is alien to every element of MM.

Cited by 3

Cited by Corollary, Proposition 6, Theorem 1 (F. Riesz)

At any rate y⩽xy \leqslant x, so it all comes down to showing that z=x−yz = x - y is alien to every element t∈At \in A (No. 1), in other words that u=inf⁡(z,t)u = \inf(z, t) is zero. By hypothesis, u∈Au \in A and u⩽x−yu \leqslant x - y, thus u+y⩽xu + y \leqslant x; for every v∈Av \in A such that v⩽xv \leqslant x, by definition v⩽yv \leqslant y, thus u+v⩽u+y⩽xu + v \leqslant u + y \leqslant x; since u+v∈Au + v \in A by hypothesis, also u+v⩽yu + v \leqslant y by the definition of yy; finally, since u+yu + y is the supremum in EE of the elements u+vu + v such that v∈Av \in A and v⩽xv \leqslant x, we have u+y⩽yu + y \leqslant y, whence u⩽0u \leqslant 0, which completes the proof.

Theorem 1 (F. Riesz)

— *Let AA be a subset of a fully lattice-ordered space EE. The set A′A' of elements that are alien to every element of AA is a band; the band A′′A'' of elements that are alien to every element of A′A' is identical to the band generated by AA, and EE is the ordered direct sum of the bands A′A' and A′′A''.

Cites 2 · Cited by 6

Cites Proposition 4, Proposition 5

Cited by Corollary, Proposition 6, Proposition 5, II § 2, V § 5. Measures defined by numerical densities, Example, V § 5, Theorem 3 (Lebesgue), V § 5

The properties of alien elements, reviewed in No. 1, and the definition of a band, show at once that A′A' is a band, hence so is A′′A''. By Proposition 5 and the definition of a band, every element x⩾0x \geqslant 0 of EE may be written x=y+zx = y + z, with y∈A′y \in A' and z∈A′′z \in A'', yy and zz being ⩾0\geqslant 0; since every element of EE is the difference of two elements ⩾0\geqslant 0, we have E=A′+A′′E = A' + A''; on the other hand, since 00 is the only element alien to itself, we have A′∩A′′={0}A' \cap A'' = \{0\}, which proves that EE is the direct sum of A′A' and A′′A''; finally, since the components in A′A' and A′′A'' of an element ⩾0\geqslant 0 of EE are ⩾0\geqslant 0, EE is the ordered direct sum of A′A' and A′′A'' (No. 4, Prop. 4).

It remains to show that A′′A'' is identical to the band BB generated by AA. Now, EE is the direct sum of BB and the band B′B' formed by the elements alien to all the elements of BB; since A⊂BA \subset B, we have B′⊂A′B' \subset A'; on the other hand B⊂A′′B \subset A'' and EE is also the direct sum of A′A' and A′′A''; therefore necessarily B=A′′B = A'', B′=A′B' = A'.

Theorem 1 and Proposition 5 make it possible to give another definition of the band generated by a set of elements of EE:

Proposition 6

— *Let EE be a fully lattice-ordered space, MM a subset of EE, and BB the band generated by MM. Let M1M_1 be the set of elements ⩾0\geqslant 0 of EE each of which is ⩽\leqslant some element of the form ∑i∣xi∣\sum_i |x_i|, where xi∈Mx_i \in M; let M2M_2 be the set of suprema of those subsets of M1M_1 that are bounded above; then the set M2M_2 is identical with the set of elements ⩾0\geqslant 0 of BB.

Cites 2 · Cited by 1

Cites Proposition 5, Theorem 1 (F. Riesz)

Cited by Corollary

Clearly M2⊂BM_2 \subset B by the definition of a band; on the other hand, if B′B' is the band of elements that are alien to every element of M1M_1, Theorem 1 shows that EE is the ordered direct sum of BB and B′B'. But Proposition 5 shows that every element ⩾0\geqslant 0 of EE is the sum of an element of M2M_2 and an element of B′B', whence the proposition.

Corollary

— *Let aa be an element of a fully lattice-ordered space EE, BaB_a the band generated by aa, Ba′B'_a the band of elements alien to aa. For every element x⩾0x \geqslant 0 of EE, the component of xx in BaB_a (for the decomposition of EE as the ordered direct sum of BaB_a and Ba′B'_a) is equal to sup⁡n∈N(inf⁡(n∣a∣,x))\sup_{n \in \mathbf{N}} (\inf(n|a|, x)).

Cites 3 · Cited by 2

Cites Proposition 5, Proposition 6, Theorem 1 (F. Riesz)

Cited by Proposition 5, II § 2, Corollary 2, V § 5

This follows from Proposition 6, applied to M={a}M = \{a\}, and Proposition 5.

Note that the bands generated by aa and ∣a∣|a| are identical. If aa and bb are two elements of EE that are alien to each other, and if AA and BB are the bands generated by aa and bb, respectively, then every element of AA is alien to every element of BB; for, bb belongs to the band A′A' of elements alien to aa, whence B⊂A′B \subset A', and, by Theorem 1, every element of AA is alien to every element of A′A'.

Exercises

See the exercises for § 1.

Transcribed from the printed volume. Not translated.