Bourbaki

Lemma 3

Tag 07WP, permanent. Cite it as [Bourbaki, Tag 07WP].

Topological Vector Spaces, chapter IV, Appendix 0. Fixed points of groups of affine transformations

Let G be a group of continuous (for T\mathscr{T}) affine transformations on K. Suppose that K is non-empty and that ∥gx−gy∥=∥x−y∥\|gx - gy\| = \|x - y\| for all x, y in K and all g in G. Then there exists a point in K which is invariant under G.

Let J\mathfrak{J} be the family of non-empty subsets of K which are closed convex and stable for G. If (Lα)α∈I(L_\alpha)_{\alpha \in I} is a family of elements of J\mathfrak{J} which is totally ordered by inclusion, then the set L=⋂α∈ILαL = \bigcap_{\alpha \in I} L_\alpha belongs to J\mathfrak{J}. Consequently (S, III, § 3, No. 4, th. 2), there exists an element L in J\mathfrak{J} which is minimal for the relation of inclusion. We shall prove that L reduces to a point.

We argue by reductio ad absurdum, assuming that L contains at least two distinct points x1x_1 and x2x_2, put x=(x1+x2)/2x = (x_1 + x_2)/2 and ε=∥x1−x2∥/2\varepsilon = \|x_1 - x_2\|/2. The convex and compact set L satisfies the first axiom of countability for the distance defined by the norm (GT, IX, § 2, No. 8). Hence we can apply lemma 2 and find a compact and convex subset L1L_1 of L, distinct from ∅\varnothing and from L, having the following property :

(A) For every y1y_1 and y2y_2 in L−L1L - L_1, we have ∥y1−y2∥<ε\|y_1 - y_2\| < \varepsilon.

We shall prove by reductio ad absurdum that gx∈L1gx \in L_1 for all g∈Gg \in G. Let g∈Gg \in G be such that gx∈L−L1gx \in L - L_1 then we have

∥gxi−gx∥=∥xi−x∥=∥x1−x2∥/2=ε, \|gx_i - gx\| = \|x_i - x\| = \|x_1 - x_2\|/2 = \varepsilon ,

for i=1,2i = 1, 2. By property (A), we have gxi∈L1gx_i \in L_1. Since L1L_1 is convex, we conclude that gx=(gx1+gx2)/2gx = (gx_1 + gx_2)/2 belongs to L1L_1, which contradicts the assumption.

Let L′L' be the closed convex envelope of the orbit GxGx of x. The set L′L' belongs to J\mathfrak{J}. By the preceding argument, we have L′⊂L1L' \subset L_1, hence L′⊂L,L′≠LL' \subset L, L' \neq L. This contradicts the minimal character of L and the proof is complete.

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

Cited by

Nothing.

Cites

Transcribed from the printed volume. Not translated.