C OMPOSITIO M ATHEMATICA
S. G LASNER
D. M AON
On absolutely extremal points
Compositio Mathematica, tome 59, n
o1 (1986), p. 51-56
<http://www.numdam.org/item?id=CM_1986__59_1_51_0>
© Foundation Compositio Mathematica, 1986, tous droits réservés.
L’accès aux archives de la revue « Compositio Mathematica » (http:
//http://www.compositio.nl/) implique l’accord avec les conditions gé- nérales d’utilisation (http://www.numdam.org/conditions). Toute utilisa- tion commerciale ou impression systématique est constitutive d’une in- fraction pénale. Toute copie ou impression de ce fichier doit conte- nir la présente mention de copyright.
Article numérisé dans le cadre du programme Numérisation de documents anciens mathématiques
http://www.numdam.org/
51
ON ABSOLUTELY EXTREMAL POINTS
S. Glasner and D. Maon
Abstract
Given three doubly asymptotic points x, y, z in a minimal flow X, we construct an affine embedding ~ : X ~ Q such that
~(x) = 1 2(~(y) + ~(z)).
Thus x is not absolutely extremal.We produce an example of a metric minimal flow X with the property that for every x E X
a triple x, y, z as above exists, thereby showing that
no point
of X is absolutely extremal.O Martinus Nijhoff Publishers, Dordrecht - Printed in the Netherlands
Introduction
We recall the definitions of affine
embedding
and absoluteextremality
for
flows,
introduced in[1].
If(T, X)
is a flow(T
is a self homeomor-phism
of thecompact
spaceX)
and(T, Q)
an affine flow(i.e., Q
is acompact
convex set and T an affinehomeomorphism)
then anequiv-
ariant continuous map ç:
X ~ Q
is called anaffine embedding
ifco
~(X) = Q.
Apoint
x E X is calledabsolutely
extremal if for every affineembedding
~: X-Q ~(x)
is ina Q,
the set of extremepoints
ofQ.
Suppose (T, X)
is metric and minimal(i.e.,
every orbit isdense)
thenfor every affine
embedding
T:X - Q
the set{x ~ X:~(x)~~Q}
is adense
Gs.
It was shown in[1]
that if(T, X)
is metric and minimal then every distalpoint
of X isabsolutely
extremal.Again
under our assump- tions on(T, X)
the set of distalpoints
is eitherempty
or a denseG8.
These facts led the first author to ask in
[1]
whether every minimal metric flow must haveabsolutely
extremalpoints.
The easiest
examples
wherenon-absolutely
extremalpoints
exist aregiven by
certain almostautomorphic
flows where the flow X ispresented
as a set of sequences in
l~(Z)
and theidentity
map of Xinto Q
=co(X)
c
l~(Z) gives
a natural affineembedding [1].
Somedoubly asymptotic points
of X turns out to be non-extreme inQ.
In this note, we show that in any minimal flow apoint
with twodoubly asymptotic points
is notabsolutely
extremal.(x, y
aredoubly asymptotic
if limd( T nx, Tny)
= 0).
We construct a minimal metricflow,
everypoint
of which has a52
continuum of
doubly asymptotic points;
thusproviding
anexample
of ametric minimal flow no
point
of which isabsolutely
extremal.The
principle
of construction is due toGrillenberger (see
e.g.[4]),
whofirst showed how to define a minimal set with some desired
property
asan intersection of a
family
of subshifts of finitetype.
A continuous version ofGrillenberger’s
construction andapplications
of this methodare described in
[3]
and[2].
Thepresent
paper can be considered as asequel
to[1] and
we refer the reader to[1] for
further motivation.Section 1. An af f ine
embedding
associated withdoubly asymptotic points
1.1 PROPOSITION: Let
(X, T)
be aninfinite
metric minimalflow,
xo, yo,
zo E X, doubly asymptotic points.
Then there exists anaffine embedding T: X ~ Q
such that~(x0) = 1 2(~(y0) + ~(z0)).
PROOF: In
C*(X)
we let Tl be the weak * closed linear spacespanned by
the set
We let
03C0: C*(X) ~ E = C*(X)/V
be thequotient
map and define qp : X-Eby ~(x)=03C0(03B4x)=03B4x +
V. PutQ = co(~(X))
and letWe claim that V =
W;
to see this letL |an|
oc begiven.
PutnEZ
and let q be the infinite sum. For every
f E C(X)
we haveHence 11N
~ ~and 11 E
V. Thus W ~V ;
sinceho
c W it isenough
toshow that W is weak * closed.
By Krein-Smulyan’s
theorem it suffices toshow that
W n Br
is weak *closed,
whereBr = {v ~ C*(X): ~v~ r}.
Since, B,
is metrizable we can deal with sequences. So letbe a sequence in W
n B,
with~k ~ ~ ~
V. We haveUsing
adiagonal
process we can choose asubsequence q k,
such that for each nan - bn.
For convenience we denote thissubsequence
alsoby ~k,
thus we now
assume akn ~ bn
for every n.Using
Fatou’s lemma(in l1(Z))
we have
Put
and let
f E C(X)
and e > 0 begiven.
Choose 8 > 0 such thatd(x, y )
8~ | f(x) - f(y)| ~
and N withThen
It follows that
~k ~ so that = ~
is in W and = W.Clearly
99 is continuous andequivariant
from X into the affine flowQ.
If~(x) = ~(y)
then03B4x-03B4y ~ V.
But asV = W,
every non-zero54
measure in V is
supported by
at least threepoints.
Thus x = y and ~ isone to one.
Finally
This
completes
theproof.
DSection 2. A metric minimal flow every
point
of which has a continuum ofasymptotic points
Let
Q = [0, 1]Z
denote thecompact
metric space of two sided[0, 1] ]
valued sequences with the metric
d(x, y) =
sup2-|n||xn-yn|.
For anEZ
closed W c
[0, 1]n
and i E Z we letn
and
C(W) = U Ci(W).
We defineinductively
a sequence nk and closed setsWk C Wnkk-1
1 as follows. LetWo = [0, 1].
GivenWk -1
1 we choose anarbitrary
but fixed2-k-net {u1, u2,...,ulk}
ofW2k-1,
where the metricon a finite dimensional cube
[0,1]"
isd( w, v) = Sup |wl-vl|.
Letn k =
1001k
and define00
We call the
set ( ii , i2,...,ilk} a
u-setfor
w. Put X =n C(Wk).
k=1
2.1 PROPOSITION: Let T be the
shift on X,
then(X, T)
is a minimalflow.
PROOF: Follows
directly
from theway X
was defined.2.2 PROPOSITION: For every
k, Wk
ispathwise
connected.PROOF: Assume
Wk _
1 is connected.Let w, w’ E Wk,
W = wlw2 ...Wnk’
W’
WW2 1
...wnk,
wl,wl
EWk-1.
Assume first that there exists a u-setA = {i1, i2,...,ilk}
common to w and w’. We letw(t) = w1(t)
w2(t) ... wnk(t)
be definedby W, (t)wlj +1(t) ~ M if ij
E A and where for all other i ’swl(t)
is apath
inWk -1
1connecting wl
andw,’. Clearly
w( t ) E Wk
for every t E[0, 1].
For thegeneral
case let A= {i1, i2,...,ilk}
and
A’ = (i’1, i’2,...,i’lk}
be u-sets for w and w’respectively.
ChooseA" = {i"1, i"2,..., i"lk} ~ {1, 2,..., nk} a
set of odd indicesdisjoint
fromA U A’ and def ine v = v1v2
...vnk, v’ = v’1v’2
...v’nk
as followsClearly
v, v’eWk.
Now as A is a common u-set for w and v, A" a common u-set for v and v’ and A’ a common u-set for v’ andw",
we concludeby
the firstpart
of theproof,
that there exists apath
inWk connecting
w and w’. DDEFINITION: Let K be a natural number
1 r, s lk,
ru. A chainfrom ur to us is a set
f jo, j1,..., jl}
of indices such thatjo = r, 7/
= sand d(ujn, ujn+1) 2-k, 0 n l.
For
every r and s
asabove,
the existence of a chain from ur to u, follows from the fact thatWk
ispathwise
connected.DEFINITION: For x ~X there exists
by
definition a sequence ofintegers {tk}
suchthat tk
0 tk+ m k (where
mk is thelength
of sequences inWk )
and such that forevery k x E Ctk(Wk).
It is easy to see that one canchoose
{tk}
so that Vktk-1 = tk (mod mk-1).
Such a sequence{tk}
willbe called a block
partition for
x.2.3 PROPOSITION: Let x
e X, ( tk 1 a
blockpartition for
x and wo EWk,, for
someko.
Then there exists y E X such that(1) Yltko, tko
+mko - 1]
= Wo(2) y is doubly asymptotic
to x.PROOF: We define
y[tk, tk
+ mk -1] by
induction on k. Puty[tk0, tko
+mk0-1]=w0.
Letx[tk, tk + mk - 1] = w1w2 ... wnk = w, wl ~ Wk-1,
i =1,...,
nk, and supposex[tk-1,
tk-1 + mk-1 -1] is
wn. Let A be a u-set for w. Ifn, n - 1 ~ A
definey[i] = x[i ]
fortk i tk + mk -1,
i ~[tk-1,
tk-1 +mk-l - 1]
and thenclearly y[tk, tk
+ mk -1]
EWk.
If
n = ir ~ A,
let m,1 m nk-1
be an oddinteger
such thatm e A. There exists an s, 1 s
lk
such thatd(us, wmwm+1) 2 k.
Letjo, j1,...,jl be a
chain from Ur to us,jo = r, il = s;
thusfor iJt
~ Aw, w,
Jt +1= uJt, t
=1,..., l.
Put w’ =w’1w’2 ... wnk
where for an odd i56
Since for
every t, d(uJt-1, uJt) 2-k
and alsodeus, wmwm + 1 ) 2-k
wehave
d(w, w’) 2-k.
Lety[tk, tk + mk -1] = w’1w’2...w’n-1y[tk-1, tk-1
+ mk-1 - 1]w’n+1...w’nk, then clearly y[tk, tk + mk - 1] ~ Wk. If n - 1 = ir ~
A the construction is similar.There are now three
possibilities :
(1) tk
~oo, tk + mk ~
00, in which case y is nowfully
defined.(2)
There existsko
such that for kko, tk
=tko.
In this case definey[ - 00, tk0- 1]=x[-~, tk0-1].
(3)
There existsko
such thatfor k ko, tk
+ mk =tko + mko.
In this case define
y[tk0
+mko
+1, ~]
=x[tk0
+mko
+1, ~]. By
defi-nition
of y
we have fori tk
andi > tk
+mk, |y[i] - x[i]| 2 - k.
Thusy and x are
asymptotic.
DRéférences
[1] S. GLASNER: Absolutely extremal points in minimal flows. Compositio Math. 55 (1985)
263-268.
[2] S. GLASNER and D. MAON: An inverted tower of almost 1-1 extensions. Journal
d’Analyse Math. Vol 44 (1984/85) 67-75.
[3] D. MAON: On the relation N, the obstruction to uniform rigidity. Tel Aviv University.
[4] M. DENKER, C. GRILLENBERGER and K. SIGMUND: Ergodic theory on compact spaces, Lecture Notes in Mathematics 527. Springer Verlag (1976).
(Oblatum 14-XI-1984 & 6-11-1985) Department of Mathematics University of Washington Seattle, WA 98195 USA
and
Department of Mathematics Tel Aviv University
Tel Aviv Israel