Model theory and metric convergence II: Averages of unitary polynomial actions
Eduardo Due\~nez, Jos\'e N. Iovino

TL;DR
This paper proves pointwise convergence of averages of polynomial sequences of unitary transformations in Hilbert spaces using model theory, extending to general abelian group actions and including a case study of the lamplighter group.
Contribution
It introduces a model-theoretic approach to establish convergence of polynomial unitary actions, covering Leibman sequences and generalizations to abelian groups.
Findings
Proves pointwise convergence with uniform metastability rate for polynomial unitary averages.
Extends convergence results to arbitrary Leibman sequences and actions of any abelian group.
Demonstrates realization of the lamplighter group as a quadratic Leibman sequence.
Abstract
We use model theory of metric structures to prove the pointwise convergence, with a uniform metastability rate, of averages of a polynomial sequence (in Leibman's sense) of unitary transformations of a Hilbert space. As a special case, this applies to unitary sequences where is a polynomial and a fixed unitary operator; however, our convergence results hold for arbitrary Leibman sequences. As a case study, we show that the non-nilpotent "lamplighter group" is realized as the range of a suitable quadratic Leibman sequence. We also indicate how these convergence results generalize to arbitrary Folner averages of unitary polynomial actions of any abelian group in place of .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
MnLargeSymbols’164 MnLargeSymbols’171
Model theory and metric convergence II:
Averages of unitary polynomial actions
Eduardo Dueñez and José N. Iovino
Department of Mathematics
The University of Texas at San Antonio
One UTSA Circle
San Antonio, TX 78249-0664
U.S.A.
(Date: March 2, 2024)
Abstract.
We use model theory of metric structures to prove the pointwise convergence, with a uniform metastability rate, of averages of a polynomial sequence (in Leibman’s sense) of unitary transformations of a Hilbert space. As a special case, this applies to unitary sequences where is a polynomial and a fixed unitary operator; however, our convergence results hold for arbitrary Leibman sequences. As a case study, we show that the non-nilpotent “lamplighter group” is realized as the range of a suitable quadratic Leibman sequence. We also indicate how these convergence results generalize to arbitrary Følner averages of unitary polynomial actions of any abelian group in place of .
Key words and phrases:
Mean Ergodic Theorem, PET induction, Leibman sequences, Henson structures
2010 Mathematics Subject Classification:
Primary: 37A30; Secondary: 03C98, 46Bxx, 28-xx
We thank Xavier Caicedo, Christopher Eagle and Franklin Tall for their encouragement and feedback, as well as the Banff International Research Station for hosting the June 2016 FRG “Topological Methods in Model Theory” where many ideas in the Appendix to this manuscript were first conceived.
This research was funded by NSF grant DMS-1500615
Introduction
The first result on “mean” convergence of averages was von Neumann’s 1932 Mean Ergodic Theorem [vN32]:
Mean Ergodic Theorem (MET)****.
For any unitary operator on a Hilbert space and any , the sequence of pointwise averages
[TABLE]
converges as . The limit is equal to the orthogonal projection of on the space of vectors fixed by .
Historically, generalizations of von Neumann’s theorem have largely followed a path influenced by a measure-theoretic viewpoint that is completely absent from the formulation above as a statement about convergence in Hilbert spaces. We provide further historical background below. Leaving history and measure theory aside for the moment, one may suggest the following different possible directions of generalization for MET:
- (1)
Replace the sequence with a “higher-degree” sequence where is a fixed polynomial. 2. (2)
The sequence above necessarily satisfies the commutativity condition for all . To what extent can such commutativity requirement be removed? 3. (3)
What conditions on a family of unitary operators indexed by a semigroup other than ensure the pointwise convergence of suitable averages?
Theorem 4 in this manuscript is arguably the most natural generalization of von Neumann’s result simultaneously in all three directions above. (For technical reasons, Theorem 4 is proved in the context of (polynomial) actions of groups rather than semigroups.) Theorem 1, stated below, is a very particular case of more general results (Theorems 2, 3 and 4). However, it is easiest to formulate and already generalizes MET all the way in direction (1) and beyond.
Theorem 1** (MET for abelian unitary polynomial actions of ).**
Fix . Let be a Hilbert space, and let be pairwise-commuting unitary operators on . For every , the sequence of averages111Here, is the -th binomial coefficient.
[TABLE]
converges as .
In particular, if is a polynomial of degree at most and is a unitary operator on , then converges.
Furthermore, there exists a universal metastability rate (depending only on ) that applies uniformly to all sequences of averages of arbitrary in the unit ball of an arbitrary Hilbert space under arbitrary unitary operators on .
The notion of uniformly metastable convergence above was first introduced in ergodic theory by Tao. It is a main theme of our prior manuscript, but shall presently play a minor role [DnI17, Tao08, Tao12].
Taking a step in direction (2), pairwise commutativity is not a necessary assumption; the sequence of averages under a family converges provided is a Leibman polynomial sequence in the group of unitary operators on (Theorems 2 and 3), but the range of this sequence need not generate an abelian group. The definition of Leibman polynomial sequence (Definition 2.1) is motivated by the familiar fact that degree- polynomials are characterized as those functions having -iterated finite differences equal to zero. The same essential definition gives the notion of Leibman polynomial mapping from an arbitrary group into [Lei02]. Theorem 4 generalizes von Neumann’s result in direction (3) for Leibman polynomials on abelian groups endowed with a notion of averaging provided by a countable Følner net.
Continuing our historical remarks, the formulation of von Neumann’s result above hides its conceptual genesis via the study of convergence of averages of square-integrable functions on a probability space under the action of a measure-preserving transformation of . In this setting, MET asserts that the sequence of averages
[TABLE]
converges in (after all, is a unitary transformation of ). This particular case of von Neumann’s result explains why it is called a convergence result “in mean”, i.e., in the mean-square (“”) sense. (By contrast, Birkhoff’s Ergodic Theorem asserts the almost-everywhere pointwise convergence of the averages for any [Bir31].) The setting entails no loss of generality since every Hilbert space is realized as a space of square-integrable functions. However, this viewpoint is artificial for purposes of studying convergence under unitary actions (at least insofar as simple actions are concerned, in contrast to multiple actions mentioned below).
Although generalizations of MET in direction (1) seem very natural, we are not aware of direct proofs of Theorem 1, but only of indirect proofs as byproduct of results on mean convergence of “multiple” ergodic averages. Starting in the 1970’s, Furstenberg pioneered the ergodic study of actions of multiple simultaneous transformations; equivalently, the study of convergence of “multiple averages” of the product of two or more measurable bounded functions on a probability space as acted upon by powers of measure-preserving transformations. As an application of multiple averages, Furstenberg obtained a purely ergodic proof of Szemerédi’s Theorem on the existence of arbitrary long arithmetic progressions in positive-density subsets of the integers [Fur77, Sze75]. However, Furstenberg’s seminal results from the seventies did not extend von Neumann’s theorem in either of the directions (1)–(3). It was Bergelson who, in 1987, first extended some of Furstenberg’s results to multiple ergodic averages of (plus quam linear) polynomial powers of a fixed measure-preserving transformation acting on products of functions [Ber87]. When specialized to simple measure-preserving actions, Bergelson’s results are a step toward generalizing von Neumann’s MET in direction (1). However, there is no purely Hilbert-theoretical formulation of Bergelson’s weak mixing hypothesis: Even the convergence of pointwise averages of stated in Theorem 1 only follows unconditionally from 2005 results for multiple ergodic averages of Host and Kra, and of Leibman (which depend on no mixing assumptions) [HK05, Lei05].
To our knowledge, Walsh’s theorem [Wal12] on mean convergence of nilpotent ergodic averages is the first result in the literature from which Theorem 1 follows as a corollary. (Pointwise convergence of averages of under the assumption is a special case of 2009 results of Austin [Aus15a, Aus15b].) Thus, Walsh’s theorem actually implies the convergence of averages asserted in the more general Theorem 2, but only under the additional explicit hypothesis that generates a nilpotent subgroup of . However, our methods do not require a nilpotence hypothesis, but only the more intrinsic property that be a Leibman sequence in the sense of Definition 2.11 (or in Leibman’s more general sense of polynomial mapping used in Theorem 4). In Section 2.2, we construct a quadratic Leibman sequence whose range generates the non-nilpotent “lamplighter group” .
Generalizations of Walsh’s theorem by Austin and Zorin-Kranich imply steps in direction (3) [Aus16, ZK16]. However, Theorems 2, 3 and 4 appear to be new in the general form stated. Nevertheless, given the close relation of our results to others in the existing literature, the main novelty is our “soft” direct approach to proving pointwise convergence of polynomial averages in Hilbert spaces using the framework of Henson metric structures. Our viewpoint is heavily influenced by Tao’s outline [Tao12] of a nonstandard proof à la Robinson of Walsh’s theorem (although we use only standard real numbers, and none of Robinson’s apparatus as such). A significant part of the manuscript consists of natural definitions and basic results on model-theoretic notions of integration and convergence that parallel classical ones; nevertheless, we capture, refine, and in some cases extend such results in Henson’s framework. Section 1 contains the rather long definition of the Henson class of PET structures over . Section 2 introduces the notion of Leibman polynomial sequence; it also exhibits a quadratic Leibman sequence whose range generates the non-nilpotent group . In Section 3, we state and prove Theorems 2 and 3 on metastable convergence of polynomial unitary averages for Leibman sequences (over ), and also explain how Theorem 1 follows as an immediate corollary. In Section 4, we state and prove the most general of our ergodic convergence results in the form of Theorem 4, which generalizes MET in all three directions (1)–(3). A number of foundational results are contained in the Appendix, which bears a close relation to our prior manuscript [DnI17]. These results pertain to measure theory and integration of real functions, as well as abstract notions of integration of functions taking values in Banach spaces. In this way we obtain a Dominated Convergence Theorem for notions of integration in an ad hoc Henson class of Banach integration frameworks (Theorem 5). We also show that the compactness of Henson’s logic implies a Uniform Metastability Principle for convergence in models of any Henson theory (Proposition A.10). Via this principle, all our results on convergence of averages admit refinements to convergence with metastability rates that are universal. These are gratis refinements thanks to the model-theoretic approach.
1. PET Structures
1.1. Classical PET Structures
Notation 1.1**.**
Below we list a number of formal symbols that will eventually become sort descriptors for a Henson language of metric structures. However, throughout this subsection, these symbols have the following classical interpretations:
- •
shall denote the sets of real numbers, integers and naturals.
- •
shall denote a real Hilbert space.
- •
shall denote the real Banach algebra of bounded operators on .
- •
shall denote the Boolean algebra of all subsets of .
- •
shall denote the real Banach space of signed finite measures on (i.e., on the measure space ).
- •
shall denote the Banach space of bounded real functions on .
- •
shall denote the Banach space of bounded functions .
- •
shall denote the Banach space of bounded functions .
- •
shall denote the Banach space of bounded functions .
- •
shall denote the Banach space of bounded real functions on .
- •
shall denote the Banach space of bounded functions .
- •
shall denote the Banach space of bounded functions .
From a model-theoretic viewpoint, the sets denoted by the formal symbols above are the sorts of a metric Henson structure . (Discrete sorts , , are still viewed as metric spaces endowed with the discrete metric.) In addition, is endowed with a number of distinguished elements (“constants”) and continuous functions between sorts. The distinguished elements include:
- •
All elements of and .
- •
All rational numbers in .
- •
The zero element of each real Banach space above ().
- •
The identity operator .
- •
The zero (empty set ) and unity (improper subset ) of the Boolean algebra .
The distinguished functions between sorts include:
- •
The discrete metric in each the discrete sorts , , .
- •
The operations of addition, subtraction, multiplication, absolute value, and lattice operations (binary minimum and maximum) on .
- •
The order of , identified with its characteristic function .
- •
The membership relation from to , identified with its characteristic function .
- •
The group operations (unary negation, binary addition and subtraction) of .
- •
The operations of union, intersection and complementation on .
- •
The Hilbert space operations (addition, scalar multiplication, and inner product ) on . For convenience, also the norm .
- •
The operations of addition and scalar product, and the Banach norm on each Banach sort .
For , the Banach norm is , where is the norm of as an element of Banach sort . The Banach norm on is . The Banach norm on is “total variation”: Recall that has an atomic decomposition where is the unit mass at and . With this notation, .
(To abbreviate the long list of distinguished functions, above and in what follows we use to denote either of the “domain” discrete sets , of the various sorts , and to denote the “codomain” Banach sorts , , , .)
The list of distinguished functions continues as follows:
- •
The operations induced by (pointwise) application of the inner product of .
- •
The unary operation of pointwise absolute value and the binary lattice operations (pointwise and ) on sorts .
- •
The unary operation of measure of total variation and the binary lattice operations (“pointwise” and ) on (i.e., , , and if and ).
- •
The operation of pointwise magnitude , namely for any .
- •
The unary adjoint operation on , and the corresponding induced operations (pointwise adjoint) on sorts .
- •
The binary operation of composition on , and the corresponding induced operations of pointwise composition on sorts .
- •
The inclusions:
- –
.
- –
where is the characteristic function of the subset .
- –
given by (the unit point mass at ).
- –
, with identified with the constant function in ;
- –
The right inclusion map whereby is identified with ; also, the analogous left inclusion map identifying with .
- •
The function-evaluation maps
- –
from to .
- –
from to ;
Also, the maps induced by pointwise evaluation.
- •
The partial evaluation maps:
- –
Left evaluation , namely where .
- –
Right evaluation , namely where .
(Note that the left evaluation map allows us to identify with the space of all bounded functions —thus making a potential sort superfluous. We also have a different identification of with via right evaluation.)
- •
The Følner-measure map , where
[TABLE]
( is the average of unit point masses at the points .)
- •
The translation action of on . We regard this action as a function (with the latter identification by partial evaluation on the left). The action is denoted where is the function with the function .
- •
The shear transformation , namely where .
- •
The translation action of on , regarded as a mapping and denoted where is the mapping , with the measure shifted by , namely
[TABLE]
which is classically characterized by the property that for all and .
- •
The involutions induced by the involution of .
- •
The integration operations
- –
for .
- –
(Left integral) , where is the function .
- –
(Right integral) , where is the function .
- –
where is the function (i.e., the operation induced by “pointwise integration” when is identified with via left partial evaluation).
For visual convenience, we may use integral notation and write or for , and for (resp., for ).
Remarks 1.2*.*
- •
There are redundancies on the list of functions above. For instance, the -norm on is implicitly defined by its inner product: . As a less trivial example, the action of on is obtained from the right inclusion followed by the shear transformation. However, for reasons of exposition we make no effort to present a minimal list of distinguished functions. The model-theoretic approach fundamentally requires that all sorts, functions and constants that are relevant to the problem at hand be part of the structures under study.
- •
The nonstrict order relations ( and ) of are the only predicate symbols of a Henson language. However, any discrete predicate may be identified with a -valued function (the characteristic function of the truth set of ), so the usual interpretation of (resp., of ) agrees with the interpretation of the Henson formula (resp., of ).
Definition 1.3** (Classical PET structure over ).**
A classical PET structure (over ) is a triple where
[TABLE]
is a collection of sorts, is a collection of distinguished elements (constants), and is a collection of distinguished functions between sorts, provided these sorts, constants and functions are obtained in the manner prescribed by Notation 1.1.
1.2. Abstract PET structures
Definition 1.4** (Henson signature and language for PET structures over ).**
The Henson signature for PET structures over consists of three ingredients:
- •
A collection of formal symbols, called sort descriptors (or sort names) in one-to-one correspondence with the collection of sorts of a classical PET structure. For definiteness, the collection of descriptors is taken to be
[TABLE]
its members regarded as purely formal symbols.
- •
A collection of lexical constant symbols containing a unique symbol for each of the distinguished elements in Definition 1.3, with each such symbol endowed with a sort descriptor naming that sort to which the element named by belongs per Definition 1.3.
- •
A collection of lexical function symbols containing a unique symbol for each of the functions named in Definition 1.3, with each such symbol endowed with a sort-specification of the form where are sort descriptors chosen in accordance with the specification of the domain (Cartesian product of sorts named by ) and codomain (sort named by ) of the function named by the symbol .
The Henson language for PET structures over is the Henson language (of positive bounded formulas) whose signature is the one just described [HI02, Iov14, DnI17].
Definition 1.5** (PET structure over ).**
Let be the Henson language for PET structures. Let be the class of all classical PET structures over per Definition 1.3, and let be the -theory of in Henson’s logic of approximate satisfaction of positive bounded formulas. An (abstract) PET structure over is a model of .
The class of abstract PET structures obviously extends .
Remarks 1.6*.*
- •
In principle, one may provide an explicit axiomatization in positive bounded Henson formulas of the class . However, given the large number of sorts and functions in a PET structure this task is impractical. We refer the reader to our prior manuscript in which we provide explicit Henson axiomatizations of certain classes of structures somewhat more general than [DnI17]. Nevertheless, it should be clear that the Henson theory is uniform in the sense that it imposes bounds on constants as well as local bounds and local moduli of uniform continuity on distinguished functions. Moreover, obviously is identical to the theory of all abstract PET structures.
- •
The Følner map per Notation 1.1 implies a particular choice of a “notion of averaging” over that is built into . Nonequivalent definitions of the PET class over and of are obtained by changing this choice (e.g., letting in classical structures), but Theorems 2 and 3 on PET structures over remain true under such alternate choice (in fact, they are special cases of the more general Theorem 4).
- •
If is a PET structure, then the -named sort of , under the corresponding operations , is (isomorphic to) the standard real numbers; we shall identify with . Correspondingly, the “Hilbert sort” of is a classical real Hilbert space. Typically, the -named sort of is a proper extension of the set of standard natural numbers (when the latter is identified with the set of interpretations of the constant symbols of , one for each standard natural )222The language has constants naming only the standard integers and natural numbers, but no nonstandard elements of the sorts , ., and similarly extends in general. While may be identified (via the evaluation map ) with an algebra of bounded operators on , it need not contain all bounded operators. The sort may be identified (via ) with a Boolean algebra of some, but not necessarily all subsets of , while may be identified (via the evaluation map) with a space of (not necessarily all) bounded functions .
One of the subtlest differences between classical and abstract PET structures is the fact that typically consists of measures that are finitely but not countably additive on (in particular, such measures need not have atomic decompositions as in the classical case). Fortunately, this difference turns out not to be critical, at least if one works in saturated PET structures: In this setting, the interplay between sorts , and comes to the rescue via analogues of Loeb measure and Loeb integration [DnI17]. Appendix A.2 contains a basic discussion of Loeb structures.
2. Leibman sequences
2.1. Classical Leibman sequences
Leibman introduced the notion of polynomial sequences in a group [Lei98]. Leibman’s polynomial sequences in generalize sequences (indexed by ) of the form where is a polynomial and is fixed. Fix such a sequence where . For fixed , the sequence of “step- discrete differences” of is of the form where is a polynomial of degree less than (or possibly the zero polynomial). This motivates Leibman’s recursive definition of polynomial sequence as follows.
Definition 2.1** (Discrete difference and Leibman sequence).**
Let be a multiplicative group with identity . When convenient, the inverse of an element of will be denoted . Let be the group of all -sequences from into under the operation of pointwise multiplication induced from , and endow with the translation action of , namely . For , the discrete-difference operator is the function from to ; it is uniquely characterized by the identity
[TABLE]
(Since , parentheses may be omitted without ambiguity.) We will also omit parentheses when writing iterated discrete differences; thus, means .
Let denote the constant sequence . Given , a Leibman sequence in of degree at most is any all of whose -fold iterated discrete differences are trivial, i.e.,
[TABLE]
A Leibman sequence is a Leibman sequence of any degree ; its degree is the least such . (We define formally .) A Leibman sequence of degree at most [math] is called translation-invariant or constant; it is of the form for some (i.e., for all ).
Remarks 2.2*.*
- •
The definition of Leibman sequence above is indirect and recursive; it involves only the group structures of and , but not the product of as one might otherwise expect from the usual construction of polynomials starting with monomials built from multiplication.
- •
It can be shown (by an application of the usual method of finite differences) that if is a Leibman sequence of degree at most in an abelian group , then there exist such that
[TABLE]
where is the -th binomial coefficient.333See Proposition 2.6 below for the case of sequences in abelian that are at most quadratic. One may regard as the “coefficients” of the Leibman polynomial . In particular, this abelian setting comprises all families where is a polynomial and is fixed. Theorem 1 states the convergence of ergodic averages in the abelian case; nevertheless, Theorems 2, 3 and 4 only assume that is a unitary Leibman sequence per Definition 2.11, but no additional explicit commutativity hypotheses.
- •
Translations commute with inversion and with discrete differences, i.e., and . (The latter equality depends on the commutativity of addition on .) In particular, Leibman degree is invariant under translation. However, the discrete difference operators do not commute with adjoints, so Leibman degree is not invariant under taking adjoints. Correspondingly, need not be a Leibman polynomial if is.
Leibman sequences of degree at most are easily characterized:
Proposition 2.3**.**
Given any fixed choice of , there exists a unique Leibman sequence of degree at most satisfying and , namely .
The straightforward proof of Proposition 2.3 is left to the reader.
2.2. Quadratic Leibman sequences
In this section we characterize classical Leibman sequences that are quadratic, i.e., of degree at most . In particular, we construct a quadratic Leibman sequence whose range generates the non-nilpotent “lamplighter” group (Corollary 2.9). Throughout this section, will denote a multiplicative group with identity ; the inverse of is denoted when convenient.
In what follows, we fix a quadratic Leibman sequence . One may suspect that is uniquely characterized by three constants, say , and ; this is easily shown to be true (See Proposition 2.4 below). However, in contrast to Proposition 2.3, the constants are not arbitrary: The requirement that they correspond to a bona fide Leibman sequence imposes nontrivial relations among and : They must generate a factor of by Propositions 2.4 and 2.8.
Proposition 2.4**.**
Given a quadratic Leibman sequence in a group , the elements and satisfy the commutation relations
[TABLE]
where is the conjugate of by . Conversely, given such that the above relations hold for and , there exists a unique quadratic Leibman sequence satisfying , and .
Note that the commutation relations (2.1) do not involve at all.
2.2.1. Proof of Proposition 2.4
Free variables will denote elements of throughout. The iterated discrete differences of will be denoted , respectively.
First, let be a quadratic Leibman sequence; thus, for all , by definition of Leibman degree. It follows that , i.e., is constant.
Denote by the conjugate of by (). Straightforward algebra shows that the “cocycle identity”
[TABLE]
holds for arbitrary . Under the assumption that is quadratic, all terms in the identity above are constant, so the cocycle identity improves itself to one with an extra free parameter :
[TABLE]
Let be the commutator of . Using the cocycle identity (2.3) to expand in two different ways, we find . Using the relation , this identity may be rewritten
[TABLE]
Let be the subgroup of generated by all elements , and the subgroup of generated by all elements with . It follows from the commutation relations (2.4) that is a subgroup of the centralizer of in . It is easy to see that is a normal subgroup of , and is a homomorphism . Note that , so the following commutation identity follows:
[TABLE]
Putting (with arbitrary) and evaluating at [math], we obtain the commutation relations (2.1).
Conversely, let satisfy the commutation relations (2.1). We claim that a unique exists satisfying
[TABLE]
Let and , so the first two conditions above hold. For , the condition is equivalent to the forward recurrence , while for , it is equivalent to the backward recurrence . Using both recurrences with the initial values , , we obtain a unique satisfying the conditions (2.6).
To prove that is indeed a quadratic Leibman sequence, it remains to show that is constant for all . This is done inductively, starting from (2.6), which implies that is constant. The details follow.
Lemma 2.5**.**
Let and . For , let the naive degree of be the sum of the exponents of all occurrences of when is written as a word in the alphabet , . Then naive degree is invariant under translations: for all . Define
[TABLE]
Let be the subgroup of generated by and . The elements for are constant and commute with each other pairwise. Moreover, depends only on ; in fact, .444The naive degree need not be well defined as an integer, but it is well defined as an integer modulo if is the least positive integer (if any) such that has an expression as a word of naive degree (in addition to its expression as the empty word of naive degree [math]). Thus, naive degree induces a well-defined notion of degree (modulo ) with respect to which the identity holds.
Proof.
Let denote a word in four formal symbols . If are such that the word evaluates to (using the group operation of ) under the substitutions , , , , we write . For an arbitrary such word , let . The equalities and imply
[TABLE]
for a new word555To be precise, is a word where is obtained from performing the substitutions , , where powers , (for ) are interpreted as the -words and , respectively. using exactly as many of each of the symbols , as (but possibly more of , ). It follows that naive degree is invariant under translations.
We have since . Because of the translation invariance of naive degree, once the identity is proved, it shall follow that is constant, since .
By identity (2.7), proving for all reduces to showing . Abusing notation, define for . The remainder of the proof thus reduces to proving
- (1)
depends only on the naive degree of —defined as the sum of the exponents of in an expression of as a word on , and —in fact, where , and 2. (2)
the elements for in the subgroup generated by and commute pairwise.
Since commutes with iff commutes with , property (2) follows from
- (2’)
commutes with if .
Note that satisfies properties (1) and (2’) iff either one of does.
For , let be the set of elements of that are words using no more than symbols . By induction on , we prove assertions (1) and (2’) for . (This will prove the assertions for all .) First, consists of powers having naive degree zero. Since commutes with , it follows that ; thus, assertions (1) and (2’) hold for . Next, assume both assertions hold for some fixed . Let be arbitrary. Without loss of generality (possibly multiplying by powers of or on the left) we may assume that with . If , then , and it follows from the inductive hypothesis that . Note that commutes with by the hypothesis of Proposition 2.4; hence, so does . This shows that assertions (1) and (2’) hold for , completing the proof of Lemma 2.5. ∎
Continuing the proof of Proposition 2.4, let and as above, and let be the subgroup of generated by elements with . By Lemma 2.5, is an abelian group of constants. By induction, one shows first that for all we have , and subsequently that (using Lemma 2.5 and the cocycle identity (2.2) to induct on , then the identity to induct on , plus simple manipulations to extend to negative ). Thus, is constant for all . This implies that for all , showing that is a quadratic Leibman sequence and concluding the proof of Proposition 2.4.
2.2.2. Some consequences of Proposition 2.4
First, we give some definitions. Given a sequence in any multiplicative group , there is a natural notion of product of the terms “as ranges from to ”; it is characterized by the properties
- (1)
(the identity of ), and 2. (2)
for all .
Informally, terms are multiplied left-to-right in succession. For fixed , one obtains the familiar definitions
[TABLE]
but also the less familiar
[TABLE]
There is a corresponding notion of product evaluated in the opposite group of : iterated products are computed right-to-left instead, namely
- (1)
, and 2. (2)
for all .666One may alternatively define \operatorname{\prescript{\mathrm{op}}{}{\prod}}_{i=k}^{l}x_{i}:=\bigl{(}\prod_{i=k}^{l}x_{i}^{-1}\bigr{)}^{-1}.
Proposition 2.6**.**
If are elements of a group satisfying the commutation relations (2.1), the unique quadratic Leibman sequence satisfying , and is given by the expression
[TABLE]
In particular, if and commute, then where for all .
Proof.
From the identities and , we obtain . Thus, . Equation (2.8) follows evaluating the latter identity at [math].
If and commute, then , where . (For , the sum is understood in the obvious sense analogous to the definition of above.) ∎
Definition 2.7**.**
The restricted wreath product of with itself is called the lamplighter group. It is realized as a group on generators and subject to the relations
[TABLE]
The subgroups and of are abelian. Together, they generate , and it is easy to show that each is its own centralizer in ; therefore, has trivial center. In particular, is not nilpotent. It is, however, solvable, being a semidirect product of the two abelian groups , .
Proposition 2.8**.**
Given a quadratic Leibman sequence in a group , its discrete differences () generate a subgroup of isomorphic to a factor of . Actually, the group is already generated by and . The values () of these discrete differences generate a subgroup of also isomorphic to a factor of . In fact, and already generate . Furthermore, there exists a quadratic Leibman sequence such that both and are isomorphic to itself.
Proof.
The proof of Proposition 2.4 shows that is generated by and . A fortiori, is generated by and for (since ). The special case (with arbitrary) of equation (2.5) gives the commutation relations
[TABLE]
whence the following relations are easily proved using induction and the definition of :
[TABLE]
In general, further relations between and may hold; nevertheless, we see that the generators () and of satisfy the defining relations (2.9), (2.10) of , so is isomorphic to a factor of . Evaluation at zero is a homomorphism that restricts to a surjection , so is isomorphic to a factor of , and thus of , generated by and .
Reciprocally, let and be the canonical generators of , i.e., these elements obey only relations implied by (2.9) and (2.10). It follows from Proposition 2.4 that there is a unique quadratic Leibman sequence in satisfying , and . For this sequence we have , and hence also. ∎
Corollary 2.9**.**
There exists a quadratic Leibman sequence with whose range generates a non-nilpotent group.
Proof.
The quadratic Leibman sequence constructed in the proof of Proposition 2.8 has , and its range generates , which is not nilpotent. ∎
Remark 2.10*.*
Bergelson and Leibman used the lamplighter group to construct counterexamples showing that multiple recurrence and multiple convergence results that hold for ergodic actions generating nilpotent groups do fail for non-nilpotent groups [BL04]. In contrast to the case of multiple ergodic averages, all (simple) ergodic convergence results in the present manuscript—including Theorems 2 and 4—hold under the sole hypothesis that the family is a Leibman sequence, which already in the quadratic setting includes cases in which the range of is non-nilpotent, per Corollary 2.9 above.
2.3. Leibman sequences in PET structures
Definition 2.11** (Discrete difference and abstract Leibman sequence).**
Let be a PET structure over . The discrete-difference operator is the function uniquely characterized by the identity
[TABLE]
Alternatively, for , the left evaluation at of is .
Let denote the constant family in . Given , a unitary Leibman sequence of degree at most is any satisfying
[TABLE]
that takes values in , i.e., also satisfying . A Leibman sequence is a Leibman sequence of any degree ; its degree is the least such . (We define formally .)
Remarks 2.12*.*
- •
Note that abstract Leibman sequences per Definition 2.11 are “internal”, i.e., obtained from elements of —that are otherwise only incidentally regarded as functions via evaluation; they may be regarded as taking values in the group
[TABLE]
of (internal) unitary transformations of the Hilbert space . (For this reason, we sometimes refer to these Leibman sequences as unitary.) Accordingly, the defining property of a Leibman sequence amounts to the requirement that discrete-difference operations, possibly involving nonstandard elements , always transform into , i.e., the constant function for all , not merely for all . The proofs of Theorems 2 and 3 below crucially depend on the richer structure of in saturated PET structures—even if ultimately the results are valid in all PET structures, including classical ones whose Leibman sequences are bona fide functions .
- •
We have ; hence, discrete differentiation is obtained from the -action on , the right inclusion , plus the pointwise operations of composition and taking adjoint; thus, may as well be regarded as a distinguished function of any PET structure .
- •
The predicate “ is a unitary Leibman sequence of degree at most ” is captured by a single Henson formula , namely777Expressions of the type such as those in (2.11) are not Henson formulas sensu stricti, but may be regarded as abbreviations of formulas (or in Banach sorts).
[TABLE]
- •
Since any group is realized as a subgroup of a suitable unitary group ,888One may identify with its faithful homomorphic image under the translation action , which realizes as a group of unitary transformations of . it follows that any classical Leibman sequence is realized as a Leibman sequence in a classical PET structure. In view of Proposition 2.8 and Corollary 2.9, we have instances of pointwise ergodic convergence per Theorem 2 in the setting of quadratic Leibman sequences of unitary operators generating a non-nilpotent group of unitary transformations. To our knowledge, this is the first explicit example of pointwise convergence of averages of a non-nilpotent (in fact, not even virtually nilpotent999A group is virtually nilpotent if it has a finite-index nilpotent subgroup.) family of unitary transformations.
3. An ergodic theorem for unitary polynomial actions of
Throughout the end of this section, will be the Henson language for PET structures over . All structures will be in the class of abstract PET structures over .
3.1. The sequence of ergodic averages
Convention 3.1**.**
Henceforth, the standalone symbols shall denote the usual sets of real, integer and natural numbers. If is a PET structure over , we shall use interpretation of constants (and the density of in ) to identify with the sort , and also and with subsets of and , respectively.101010The identification of with a subset of is neither necessary nor beneficial. Theorem 4 below considers ergodic averages relative to Følner nets indexed by any countable directed set (in place of ) over an arbitrary abelian group (in place of ). By an abuse of notation, when the structure is clear from context, we may omit the superscript and write , , , … to denote the sorts , , , , … of .
Definition 3.2** (Ergodic averages).**
Let be a PET structure over and let . Via the evaluation , one may regard as a function . For , the -th average of is
[TABLE]
The sequence of averages of is .
Similarly, for , the -th average of under is . The sequence of averages of under is .
We remark that ensures the validity of the identities
[TABLE]
for (standard) ; however, averages as defined above are non-classical if . On the other hand, the sequence has classical terms, and the study of its convergence is purely classical a priori.
Theorem 2** (Poly-MET/: Mean Ergodic Theorem for unitary polynomial actions of ).**
Let be a PET structure over , and let be a Leibman sequence of unitary operators on the Hilbert space . For every , the sequence of averages of under converges in the norm topology of .
Theorem 2 admits the following uniformly metastable strengthening.
Theorem 3** (Metastable Poly-MET/).**
Fix . There exists a universal metastability rate , depending only on , that applies uniformly to all sequences of averages of arbitrary in the unit ball of the Hilbert-space sort under any Leibman sequence in of degree at most in any PET structure over .
The rest of this section is devoted to proving Theorems 2 and 3.
3.2. Proof preliminaries
Lemma 3.3** (Dominated Convergence Theorem in PET structures).**
Let be the language of PET structures. Let be any saturated PET structure. Let be a bounded sequence in . For all assume that the sequence in is convergent. Then, for arbitrary , the sequence \langle{\varphi_{\bullet}},{\mu}\rangle=\big{(}\langle{\varphi_{n}},{\mu}\rangle:n\in\mathbb{N}) in is convergent.
(We will only require the special case of Lemma 3.3 in which is of the form with .)
Proof.
A saturated PET structure is a Banach integration framework (with Banach sort and measure-space sort ) as defined in Appendix A.4. Thus, Lemma 3.3 follows from Theorem 5 whose statement and proof are in Appendix A.5. ∎
To state the next lemma we need a definition. Let the reverse difference operator be the mapping characterized by the property that evaluates to the function . We write to denote the left evaluation of , i.e., evaluates to the mapping . Note that is the translate by of the (forward) difference of with step , i.e., holds for all . Just like the forward difference operator , the reverse difference operator is explicitly definable in any PET structure since it is obtained by composing functions of the structure (the -action , the shear map on , the pointwise adjoint operation , the left inclusion , and the pointwise composition ); thus, may as well be considered a distinguished function of any PET structure.
Lemma 3.4**.**
Let be a PET structure such that contains a nonstandard natural number . For every standard natural and :
[TABLE]
In less cryptic notation, the equation above reads:
[TABLE]
Every step of the proof below is justified by an axiom of . We prefer to use informal integral notation to make the argument transparent.
Proof.
Note that (in fact, for all ). For we have:
[TABLE]
where is the translation of by . Since for all :
[TABLE]
Given fixed and , let be the smallest natural number satisfying . Clearly, for . (For large and small, this inequality captures the “approximate invariance” of the long interval of under small translations, i.e., the Følner property of the collection of such intervals.) Then we have
[TABLE]
Since satisfies for all and , the assertion in Lemma 3.4 follows. ∎
We offer some remarks on the proof of Lemma 3.4 above, which is the crux of our approach to proving Theorem 2. Despite its rather short length, it sheds light on the various sorts and distinguished functions in PET structures. There are no double integrals as such but rather iterated integrals and —the order of the integration (first on the left and then on the right variable, or vice versa) is immaterial as ensured by the PET axiom
[TABLE]
The validity of the substitution in the inner integral is justified by the compatibility of the shear transformation on and the action of on :
[TABLE]
Other steps in the proof admit similar formal justifications by axioms of PET structures.
Lemma 3.5**.**
Let be a saturated Henson structure with an ordered sort extending , and let be a sequence explicitly defined by a -term of sort (i.e., is the sequence in , where is a variable of sort and is some set of parameters of the universe of ). Then every sub-sequential limit of is of the form for some . If for all , then the sequence converges. In such case, the common value is the limit .
The proof of Lemma 3.5 is a routine application of saturation left to the reader.
Lemma 3.6**.**
Let , be metric spaces, and let be a function from to such that is -Lipschitz for each (i.e., for ). Let be a dense subset of such that converges for all . Then converges for all .
We omit the straightforward proof of Lemma 3.6.
3.3. Proof of Theorem 2
For each fixed Leibman degree , we first prove Theorem 2 for unitary Leibman sequences of degree at most in any saturated PET structure . The descent argument on the degree is characteristic of Bergelson’s PET induction [Ber87].
The assertion is trivial for . If (is pointwise unitary and) has Leibman degree , we have , hence for all , so is constant. Thus, the sequences and are also constant (all terms are equal to and , respectively), so Theorem 2 follows for Leibman polynomials of degree [math].
Assume now that the assertion in Theorem 2 is proved for all having Leibman degree less than some positive integer . Fix with .
Lemma 3.7**.**
If for some and , then converges.
Proof.
Note that is bounded by . By Lemma 3.4, we have for . For we have . By the invariance of Leibman degree under translation and the assumption , we have , and hence is convergent for all by the inductive hypothesis. An application of Lemma 3.3 concludes the proof. ∎
The space of structured elements of (relative to ) is the closure of the linear span of all elements of the form for and . By linearity and Lemmas 3.6 & 3.7, converges for all structured elements . (The -Lipschitz condition follows from the inequalities and .)
The space of pseudorandom elements of (relative to ) is the orthogonal complement of in . By the fundamental theorem of linear algebra and the definition of structured elements, an element is pseudorandom precisely when for all . By Lemma 3.5, converges to zero in this case.
Combining the pseudorandom and structured cases using linearity, we deduce that all averages converge. This concludes the inductive step of the proof of Theorem 2 in any saturated PET structure .
To conclude the proof for any PET structure over , let be any (not necessarily saturated) PET structure, and let be a saturated elementary -extension of in Henson’s logic. For fixed degree and , the property that is a unitary Leibman sequence of degree at most is -axiomatizable, hence it is true in when is regarded as an element of . For we have proved that converges since . A fortiori, converges for . This concludes the proof of Theorem 2 in full generality.
3.4. Proof of Theorem 3
Let expand the language of PET structures with new constants , with of sort , and and all of sort . For fixed , consider the -theory
[TABLE]
where is formula (2.11) stating that the interpretation of is Leibman of degree at most . Note that is a uniform theory: implies , hence also . Every model of is an expansion of a PET structure having the form . By Theorem 2, all sequences are convergent. An application of Proposition A.10 finishes the proof of Theorem 3.
3.5. Proof of Theorem 1
A classical Leibman sequence with in an abelian subgroup of the group of unitary operators on a Hilbert space is easily shown to have the form where and are binomial coefficients for . Since the functions () are a -basis for polynomial mappings of degree at most , Theorem 1 is an immediate corollary of Theorems 2 and 3.
4. A Mean Ergodic Theorem for unitary polynomial actions of abelian groups
To formulate our most general result on convergence of averages, we replace with an arbitrary countable directed set and with an arbitrary abelian group endowed with a countable Følner -net of nonempty finite subsets of . These assumptions are sufficient to ensure that the proofs of natural generalizations of Theorems 2 and 3 carry through in this more general context, mutatis mutandis, from those given in Section 3.
Theorem 4** (Poly-MET: Mean Ergodic Theorem for unitary polynomial actions of an abelian group).**
Fix an abelian group and a Følner net of subsets of , indexed by a countable directed set . Let be a Hilbert space. Let be a polynomial mapping, in Leibman’s sense, into the group of unitary transformations of . For every , the -net in , of averages relative to :
[TABLE]
of under , converges in the norm topology of .
In fact, given fixed choices of , , and , there exists a rate of metastability
[TABLE]
(with for each ) that applies universally to all sequences for any element in the unit ball of any Hilbert space and any Leibman polynomial of degree at most .
Remark 4.1*.*
The definition of Leibman polynomial mapping is a straightforward generalization of that of Leibman sequence [Lei02]. The discrete difference of with step is the mapping . Define if (where is the constant mapping ). Recursively, let mean that for all . Then is a Leibman mapping if for some ; the least such is , although we adopt the convention .
We only provide an outline of the proof of Theorem 4 since it is formally identical to the arguments in Sections 3.2–3.4. The definition of classical PET structure over is completely analogous to that of PET structure over in section 1.1—simply replace all instances of by and those of by . The Følner sequence is captured indirectly via the Følner measure map , where
[TABLE]
The Henson language for the class of classical PET structures over is clear. Any model of the theory of such classical structures is an (abstract) PET structure over . (Note that the language depends on both and ; the theory further depends on the choice of the Følner net .)
Analogues of Theorems 2 and 3 hold in the class of all PET structures over . The scheme of proof is exactly the same. The countability hypothesis on is an essential hypothesis in Theorem 5, which enters the proof via an analogue of Lemma 3.3.
Lemma 3.4 uses the exact same definition of reverse difference . Its proof is adapted using the definition of Følner net as we now indicate: By definition, given and there is such that the symmetric difference has cardinality at most for all . Thus, letting , we have for all provided . Whence follows the proof of an analog of Lemma 3.4 stating that holds whenever and satisfies for all .
Lemma 3.5 continues to hold provided one replaces the nonstandard natural numbers with nonstandard elements of that satisfy for all standard elements .
The arguments in Sections 3.3 and 3.4 apply verbatim once the lemmas in Section 3.2 have been adapted, completing the proof of Theorem 4.
Appendix A A Dominated Convergence Theorem for notions of integration in Banach spaces
This appendix bears a close connection to our prior manuscript on measure, integration and metastable convergence in Henson structures [DnI17]. Our main goal is proving Lemma 3.3. Rather than doing so in the specific context of PET structures, we prove a more general result (Theorem 5) about sequences of integrals of functions on a finite measure space taking values in a Banach space. This requires a number of preliminary steps.
A.1. Integration structures
We recall the class of integration structures (with underlying finite positive measure) introduced in our earlier manuscript, to which we refer the reader for details [DnI17]. These are saturated models of the Henson theory of integration with respect to a positive finite measure on structures with (classical) sorts , , , where is the set of real numbers, is a -algebra of subsets of , and is the set of bounded -measurable (everywhere-defined) real functions on . (Here , are discrete while , are real Banach spaces.) This theory contains all Henson formulas involving the functions and distinguished constants below that are valid in such structures:
- •
Constants: Rational numbers , zero vector in the Banach sort , an arbitrary point (“anchor”) , the empty set , and the improper subset .
- •
Functions:
- –
Arithmetic operations (addition and multiplication), absolute value and lattice operations (binary min and max) on ;
- –
The characteristic function of the membership relation on ;
- –
Banach operations (addition, scalar multiplication) and norm on (namely, for —note that an almost-everywhere null function has positive norm per this definition unless everywhere);
- –
The evaluation map ;
- –
The Banach lattice operations (binary min and max) on ;
- –
The unary operation of pointwise absolute value on where is the function ;
- –
The Boolean algebra operations of union, intersection and relative complement on ;
- –
The characteristic-function map ;
- –
A positive finite measure on ;
- –
The integration operator .
Let be any Henson language including sort symbols as well as constant and function symbols matching the lists above, and let be the -theory of such structures , where is the list of sorts, the collection of distinguished functions, and the set of distinguished elements of . An (abstract) pre-integration structure is a model of . An integration structure is a saturated model of . If is any pre-integration structure (whether saturated or not), then via interpretation of constants, the membership relation , and the evaluation map, we may identify with , with a Boolean algebra of subsets of , and with a set of functions . However, need not be a -algebra. Accordingly, is typically just a finitely (not countably) additive measure on , while elements are identified with uniformly bounded functions on that may only be approximately -measurable.111111A function on is approximately -measurable if for all rational there exists such that —a property axiomatizable by countably many Henson formulas in the logic of approximate satisfaction ([DnI17], Proposition 4.4). Nevertheless, in earlier work we have shown how the classical (i.e., -additive) theory of integration of bounded measurable functions over a finite measure space and the corresponding version of the Dominated Convergence Theorem are recovered essentially verbatim in saturated Henson integration structures via an analogous construction to that of Loeb measure in nonstandard analysis [DnI17].
A.2. Loeb structures
Definition A.1** (Loeb structure).**
Let be the reduct of the -theory of integration structures with a positive measure to the language obtained by removing from the symbol for sort as well as all functions and constants involving (such as the symbol for the integral). A model of is a pre-Loeb structure. (Note that may be an -structure for a language properly extending the language of Loeb structures, and thus have other sorts, functions and constants prescribed by but not by .)
A Loeb structure is a saturated pre-Loeb structure.
Note that, for the present discussion, we are requiring the measure in a pre-Loeb structure to be positive.
If is any pre-Loeb structure, the set underlying a given is
[TABLE]
We may (externally) identify with since
[TABLE]
is a sentence in .121212Although Henson’s languages have no conditional connective “”, when is a discrete predicate (i.e., a term taking only the values ), a non-Henson formula such as can be semantically identified with the Henson formula . (By contrast, the converse is not semantically equivalent to a Henson formula in general.) When both are discrete, a biconditional can similarly be rewritten as a Henson formula. The assertion “ is discrete” is captured by the Henson formula , where “” is itself an abbreviation for “”.
Definition A.2** (Loeb measure and Loeb-measurable sets).**
Let be a pre-Loeb structure with positive measure .
A set is -measurable (or just measurable) if for some (i.e., if “”—modulo the identification of with itself).
A set is -measurable (or Loeb-measurable (modulo )) if for every there exist measurable such that and .
The Loeb measure of a Loeb-measurable set is
[TABLE]
The Loeb algebra of is the collection of all Loeb-measurable subsets of .
Note that is an external collection of subsets of . It depends on and has no intrinsic definition otherwise. It is easy to check that is an algebra of sets (i.e., closed under finite unions and intersections as well as complements). In fact, as soon as is at least -saturated (i.e., types over a countable set of parameters are realized), is a -algebra that is complete for in the sense that any subset of a -null set is itself -null ([DnI17], Proposition 3.4). On the other hand, no degree of saturation ensures that is closed under unions of subfamilies of size or more.
A.3. Integration frameworks
We need to introduce the notion of (real) integration framework, which generalizes integration structures as presented in section A.1. Roughly speaking, an integration framework is a saturated model of the theory of the operations of integration with respect to arbitrary finite (positive or signed) measures on a measure space.
Consider the reduct of a classical pre-integration structure , obtained by removing from the distinguished measure and all the functions involving (including the integration operator ). Now expand to a structure with a new Banach sort containing all finite (signed, real-valued) measures on plus the following distinguished functions and constants:
- •
Constants: The zero measure ;
- •
Functions:
- –
Vector space operations of addition and scalar multiplication on .
- –
Banach norm of total variation on :
;
- –
The inclusion maps:
,
- *
(the unit point mass at );
- –
The evaluation map (which is 1-Lipschitz by definition of the norm on );
- –
The total variation map : where is the (positive) measure of total variation of : ;
- –
The integration operator .
Given a language for pre-integration structures, let be obtained from by removing the symbols for the distinguished measure and integral operator, and adding a new sort symbol as well as new constant and function symbols per the list above.
Definition A.3** (Real integration framework).**
A classical (real) pre-integration framework is any -structure as described above. An (abstract) real pre-integration framework is any model of the Henson theory of classical real pre-integration frameworks.131313It is straightforward to verify that is a uniform theory.
More generally, any structure in a language expanding such that the -reduct of is a pre-integration framework in the above sense will be called a pre-integration framework.
A (real) integration framework is a saturated real pre-integration framework.
A.4. Banach integration frameworks
There is no completely general notion of integration of functions taking values in an arbitrary Banach space —not even for bounded functions on a finite measure space . However, it is very natural to require that any such notion of Banach integration should build upon the classical integral of real-valued functions. Our viewpoint is that any reasonable notion of Banach integration must expand a (pre-)integration framework to a Banach (pre-)integration framework per Definition A.4 below.
Consider expansions of real integration frameworks where contains two new sorts and , while and contain new functions and symbols as follows:
- •
Addition, scalar product and norm on making it a real Banach space.
- •
Addition, scalar product and norm on making it a Banach space.
- •
The zero elements of and .
- •
An evaluation map such that . (Thus, elements of may be identified with functions .)
- •
The operation of multiplication (such that for all ) under which is an -module.
- •
The inclusion map where is identified via evaluation with the constant function .
- •
The pointwise-norm map satisfying for all , .
- •
An operation of Banach integration, namely a pairing satisfying the following properties:
- (1)
is bilinear; 2. (2)
is compatible with the integration of real functions:
- (a)
For all and : . 2. (b)
For all : .
Definition A.4** (Banach integration framework).**
A language expanding the language of real pre-integration frameworks with the new sort symbols plus symbols for the functions and constants above is called a language for Banach integration frameworks.
Let be the Henson -theory of real pre-integration frameworks, and let extend with further Henson -axioms capturing the properties of new sorts, functions and constants stated above (in semantically equivalent terms, let be the Henson -theory of those expansions of real pre-integration frameworks having the properties above).141414The verification that is a uniform theory is routine.
A Banach pre-integration framework is a model of . More generally, if is a language extending and is an -structure whose reduct is a model of , we shall still call a Banach pre-integration framework.
A Banach integration framework is a saturated model of .
Remark A.5*.*
The question whether a real pre-integration framework admits an expansion to a Banach pre-integration framework is very delicate. In general, the answer may be negative. However, when is a finite set the answer is affirmative: It suffices to let be the set of all functions , and also let . The remaining ingredients of the expansion are defined in the obvious manner. Similarly, an expansion also exists if the Banach sort has finite dimension (using a basis for , real-valued integration extends to -valued integration in the straightforward classical fashion).
A.5. A Dominated Convergence Theorem for nets of functions in Banach integration frameworks
In order to formulate a version of the Dominated Convergence Theorem 5 for integration frameworks below, we fix a directed set so we can eventually discuss convergence of nets on it.151515I.e., is a nonstrict partial order on such that any two have an upper bound . Classical sequences indexed by the directed set of natural numbers are of particular interest. Only infinite directed sets are useful as tools to define and study notions of convergence in analysis and topology; on the other hand, critical results such as Theorem 5 depend on the countability of the directed set, so we may as well fix an infinite countable directed set for the remainder of the manuscript (this hypothesis will be made explicit whenever needed).
Definition A.6**.**
Fix a directed set . For , the final segment of starting at is (i.e., the set of elements equal to or greater than in ). A -net in a metric space is any function . The spread of from is
[TABLE]
The oscillation of is
[TABLE]
The net converges if .
Theorem 5** (Dominated Convergence Theorem in Banach integration frameworks).**
Fix a countable directed set . Let be any (saturated) Banach integration framework. Let be a bounded -net in . For every and , let denote the net and the net \big{(}\llangle{\varphi_{j}},{\mu}\rrangle:j\in\mathbb{D}) in . Then we have
[TABLE]
In particular, if the net is convergent for all , then is convergent.
The proof of Theorem 5 below is an adaptation of our earlier one for real-valued notions of integration ([DnI17], Proposition 5.3).
Recall that a collection of subsets of a set is a (proper) filter on if (i) , (ii) is closed under finite intersections, and (iii) is upward closed: if and , then . A proper filter is an ultrafilter if or for all .
For an introduction to ultrafilters, ultralimits and ultraproduct constructions in model theory, the reader is referred to Bell and Slomson’s monograph [BS06].
Definition A.7**.**
If is any nonempty set, let be the family of finite nonempty subsets of . We call a filter on greedy if it contains all the sets for all .
Note that the collection is a filter base on since . (This means that the collection of subsets of that are supersets of for some is a filter on .)161616Recall that a filter base on a set is a collection of subsets of such that and is downward directed by inclusion in the sense that if then for some . The filter with base is the collection of all subsets of that are supersets of some . By a routine application of the axiom of choice, greedy ultrafilters on exist whenever is nonempty. Observe that the principal ultrafilter generated by a fixed is greedy precisely when ; thus, if is infinite, greedy ultrafilters on are nonprincipal.
Lemma A.8**.**
Let be bounded and (externally) -measurable. Then there exists such that for -almost all and .
Proof.
Let be a -measurable bounded external function on , and let , . The assertion is trivial if or if —just take a constant in . Otherwise, we have and, replacing with , we may assume to be a positive measure without loss of generality. By definition of Loeb measurability, for rational and integer there exist such that , , and , . For fixed , the sequences , may be constructed recursively to ensure and for . We may also assume if , and if .
Let and . Let be the set of rational numbers in . The construction of and implies that for all and . For of cardinality , let , . Observe that if , and . Since by assumption, is infinite countable. Let be a greedy ultrafilter on . By saturation, there are realizing the -ultralimit of the types over the set of parameters . From the construction of as a greedy ultrafilter, the definition of ultralimit, and the meaning of realization of a type, it is easy to verify that
[TABLE]
It follows that for fixed we have . On the other hand, by construction of we have and . Thus, and ; hence, is -almost included in . By a completely analogous argument, -almost includes . These almost-inclusions for every (rational) are easily shown to imply the -a.e. inequalities . However, , so in fact (-a.e.) ∎
Lemma A.9**.**
Fix and let be a sequence of external -measurable functions . Then there exist such that and for -almost all .
If the (external) sequence consists of internal functions, i.e., it is a sequence in , then may be chosen so and .
Proof.
It is routine to show that and are -measurable, so the first assertion follows from Lemma A.8.
When is a sequence of internal functions, let be any nonprincipal ultrafilter on and let realize the -ultralimit of the types over the set of parameters , where . (Recall that is endowed with the binary lattice operation , which trivially defines -ary maximum operations for all .) The verification that has the required properties is routine. The construction of is identical upon replacing “max” by “min”. ∎
Proof of Theorem 5.
The asserted inequality evidently holds if . Otherwise, using a Jordan decomposition where and are positive, the proof is easily reduced to the case in which is a probability measure, which we assume henceforth.
Choose such that for all . For let . Since is countable, Lemma A.9 implies that for each there is with such that is -a.e. equal to . Similarly, is -a.e. equal to , hence to some with .
Let and fix . Since is empty (by choice of and ) and for -a.e. , the set is -null. Since (-a.e.), we have . Thus, for arbitrary fixed we have for some . (This depends crucially on the hypothesis that is countable.) It follows that for :
[TABLE]
This proves that . As and are arbitrary, . ∎
A.6. A Uniform Metastability Principle for nets in Henson structures
Proposition A.10** (Uniform Metastability Principle (UMP)).**
Fix a directed set . Fix a Henson language including constants all of a common sort . Let be a uniform -theory such that for every model of the net is convergent. Then there exists a metastability rate depending only on that applies uniformly to all sequences in all models of .
Proof.
([DnI17], Proposition 2.4.) Assume no such rate of metastability exists. Then there exist and a sampling such that for every there is a model of such that satisfies for all . By the compactness theorem for Henson logic, there is a model of such that satisfies for all , and hence , contradicting the hypothesis that converges. ∎
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[Aus 15a] Tim Austin, Pleasant extensions retaining algebraic structure, I , J. Anal. Math. 125 (2015), 1–36. MR 3317896
- 2[Aus 15b] by same author, Pleasant extensions retaining algebraic structure, II , J. Anal. Math. 126 (2015), 1–111. MR 3358029
- 3[Aus 16] by same author, Non-conventional ergodic averages for several commuting actions of an amenable group , J. Anal. Math. 130 (2016), 243–274. MR 3574655
- 4[Ber 87] V. Bergelson, Weakly mixing PET , Ergodic Theory Dynam. Systems 7 (1987), no. 3, 337–349. MR 912373 (89g:28022)
- 5[Bir 31] G. D. Birkhoff, Proof of the ergodic theorem , Proc. Nat. Acad. Sci. U. S. A. 17 (1931), 656–660.
- 6[BL 04] V. Bergelson and A. Leibman, Failure of the Roth theorem for solvable groups of exponential growth , Ergodic Theory and Dynamical Systems 24 (2004), no. 1, 45–53.
- 7[BS 06] John Lane Bell and Alan B. Slomson, Models and ultraproducts: An introduction , Dover Books on Mathematics, Dover Publications, 2006.
- 8[Dn I 17] Eduardo Dueñez and José Iovino, Model theory and metric convergence I: Metastability and dominated convergence , Beyond first order model theory, CRC Press, Boca Raton, FL, 2017, pp. 131–187. MR 3729326
