To save content items to your account,
please confirm that you agree to abide by our usage policies.
If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account.
Find out more about saving content to .
To save content items to your Kindle, first ensure no-reply@cambridge.org
is added to your Approved Personal Document E-mail List under your Personal Document Settings
on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part
of your Kindle email address below.
Find out more about saving to your Kindle.
Note you can select to save to either the @free.kindle.com or @kindle.com variations.
‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi.
‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.
These notes axe based on lectures given in 1994 by the first author at a Summer School in Tuczno (Poland) and at the University of Metz.
The purpose is to give a quick introduction to ergodic theory, to study interesting examples as illustration and to present some recent and spectacular developments in topological dynamics of group actions. More precisely, the focus will be on the following two types of systems of a geometrical–algebraic nature:
The geodesic flow on the unit tangent bundle of a locally symmetric space and unipotent actions on homogeneous spaces. Classical examples are the geodesic flow and the horocyclic flow on the unit tangent bundle of a compact Riemann surface of constant negative curvature. These flows are among the most studied dynamical systems. Of particular interest are their ergodic (or mixing) properties and the asymptotic behaviour of their orbits.
Unipotent actions on homogeneous spaces enjoy remarkable regularity properties. A striking illustration of this regularity is Hedlund's minimality theorem: for any lattice Γ in G = SL(2,ℝ), any orbit in the homogeneous space Γ\ G under a unipotent subgroup of SL(2,ℝ) is either periodic or dense. Such actions have close connections to problems in Number Theory. For instance, one of the most spectacular application of unipotent actions is the solution in 1987 by Margulis of Oppenheim's conjecture which was open for more than 40 years (see [Ma3]).
Let G be a locally compact group acting on a probability space X, and let π be the associated unitary representation. Recall that the action of G is strongly mixing if every matrix coefficient of π vanishes at infinity on G (see Chap. I, Definition 2.10).
The Vanishing Theorem of Howe and Moore states that matrix coefficients of arbitrary (non trivial) unitary representations of a simple Lie group vanish at infinity. This is a powerful theorem showing that many interesting flows are ergodic (and even strongly mixing). A typical application is as follows. Let G be a simple Lie group. Let Γ be a lattice and let H be a non-compact closed subgroup of G. Then the action of H on Γ \ G by right translations is ergodic. As we saw in the previous chapter, the geodesic flow of a locally symmetric space is related to flows of this type.
A more general application is Moore's ergodicity theorem which gives optimal conditions under which the action of a subgroup of a semisimple Lie group is ergodic or even strongly mixing (see Theorems 2.1, 2.5).
The theorem of Howe and Moore is first proved for SL(2, ℝ). The proof we present, due to R. Howe, is remarkable in that it essentially uses no representation theory. Again, a crucial rôle is played by Mautner's lemma (Chap. II, 3.6)
The extension to general semisimple Lie groups is a technical matter: one has to use sufficienly many copies of SL(2,ℝ) inside the given group. Here we follow [Vel].
Ergodic theory may be viewed as the study of measure (or, more generally, measure class) preserving actions of groups (or semigroups) on measure spaces.
The main examples to be treated throughout these notes arise as follows. Let G be a locally compact group, and let H, L be closed subgroups of G. The homogeneous space G/H carries a unique G-invariant measure class. Now, L acts on G/H by left translations. An interesting and important problem is to study, for specific G, H, L this action of L on G/H from a measure theoretic point of view. Usually, H is a lattice in G (see Chap. II, §2) so that G/H carries a G-invariant probability measure. So, we shall almost always deal with measure preserving actions on a probability space.
This chapter is a quick introduction to ergodic theory. We discuss mainly material which is relevant for later chapters.
Our exposition is incomplete as several important topics, such as entropy, have been omitted. Section 1 contains some standard examples of ergodic actions. In Section 2, ergodicity is formulated in terms of unitary group representations (the so-called Koopmanism). The classical ergodic theorem of von Neumann is proved and M. Keane's elegant proof of Birkhoff's ergodic theorem is reproduced. Moreover, strong mixing and weak mixing are introduced and discussed from the point of view of unitary representations. In Section 3, we state the theorem about the decomposition of general measure preserving group actions into ergodic pieces.
Using classification theorems ofsimple groups, we give a proof of a conjecture on factorized finite groups which is an extension of awell known theorem due to P. Hall.
For a C1function f:ℝ^n →ℝ\;(n \ge 2), we consider the least numberk of distinct critical points that f must possess whenrestricted to the sphere S=\{x\in ℝ^n: \Vert x\Vert =1\}. Clearly k\ge 2 (for f attains its absolute minimum and maximum onS), and a result of Lusternik and Schnirelmann establishes thatk=n if f is even. Here we prove that k=n if,for a given orthonormal system (e_i), \max\limits_{S \capV_i}\,f<\min\limits_{S \cap V_i^\bot}\,f, for all i=1, …n-1,where V_i is the subspace spanned by e_1, …, e_i andV_i^\bot its orthogonal complement. It is shown that this criterion is satisfied bysuitably restricted perturbations of quadratic forms having n distincteigenvalues.
Elements\alpha\in A\otimes E of the tensor product of a Banach algebra Aand a Banach space E induce systems \{\psi(\alpha):\psi\in E^*\}of elements of A indexed by the dual space E^*, whose jointspectrum belongs to the second dual E^{**}. In this note we investigate when thespectrum actually lies in E\subseteq E^{**}, and extend the spectral mappingtheorem P\sigma_A(\alpha)=\sigma_AP(\alpha) to polynomial mappings P:E\toF between Banach spaces. When the algebra A is commutative and the Banachspace E=B is another algebra we also reach a sort of vector-valued Gelfandtheory.
In its originalformulation Lang's theorem referred to a semilinear map on an n-dimensional vectorspace over the algebraic closure of GF(p): it fixes the vectors of a copy ofV(n, p^h). In other words, every semilinear map defined over a finite field isequivalent by change of coordinates to a map induced by a field automorphism. We provide an elementaryproof of the theorem independent of the theory of algebraic groups and, as a by-product of ourinvestigation, obtain a convenient normal form for semilinear maps. We apply our theorem to classicalgroups and to projective geometry. In the latter application we uncover three simple yet surprisingresults.
This paper describes methods for counting the number of nonnegative integer solutions of the system Ax = b when A is a nonnegative totally unimodular matrix and b an integral vector of fixed dimension. The complexity (under a unit cost arithmetic model) is strong in the sense that it depends only on the dimensions of A and not on the size of the entries of b. For the special case of ‘contingency tables’ the run-time is 2O(√dlogd) (where d is the dimension of the polytope). The method is complementary to Barvinok's in that our algorithm is effective on problems of high dimension with a fixed number of (non-sign) constraints, whereas Barvinok's algorithms are effective on problems of low dimension and an arbitrary number of constraints.
Given a graph G = (V, E) and a set of κ pairs of vertices in V, we are interested in finding, for each pair (ai, bi), a path connecting ai to bi such that the set of κ paths so found is edge-disjoint. (For arbitrary graphs the problem is [Nscr][Pscr]-complete, although it is in [Pscr] if κ is fixed.)
We present a polynomial time randomized algorithm for finding edge-disjoint paths in the random regular graph Gn,r, for sufficiently large r. (The graph is chosen first, then an adversary chooses the pairs of end-points.) We show that almost every Gn,r is such that all sets of κ = Ω(n/log n) pairs of vertices can be joined. This is within a constant factor of the optimum.
The problem considered is thedetermination of “lower bounds” of matrix operators on the spaces\ell_p(w) or d(w,p). Under fairly general conditions, thesolution is the same for both spaces and is given by the infimum of a certain sequence. Specific casesare considered, with the weighting sequence defined by w_n = 1/n^\alpha . The exactsolution is found for the Hilbert operator. For the averaging operator, two different upper bounds aregiven, and for certain values of p and \alpha it is shown thatthe smaller of these two bounds is the exact solution.