You are currently browsing the monthly archive for April 2017.

A sequence of complex numbers is said to be quasiperiodic if it is of the form

for some real numbers and continuous function . For instance, linear phases such as (where ) are examples of quasiperiodic sequences; the top order coefficient (modulo ) can be viewed as a “frequency” of the integers, and an element of the Pontryagin dual of the integers. Any periodic sequence is also quasiperiodic (taking and to be the reciprocal of the period). A sequence is said to be almost periodic if it is the uniform limit of quasiperiodic sequences. For instance any Fourier series of the form

with real numbers and an absolutely summable sequence of complex coefficients, will be almost periodic.

These sequences arise in various “complexity one” problems in arithmetic combinatorics and ergodic theory. For instance, if is a measure-preserving system – a probability space equipped with a measure-preserving shift, and are bounded measurable functions, then the correlation sequence

can be shown to be an almost periodic sequence, plus an error term which is “null” in the sense that it has vanishing uniform density:

This can be established in a number of ways, for instance by writing as the Fourier coefficients of the spectral measure of the shift with respect to the functions , and then decomposing that measure into pure point and continuous components.

In the last two decades or so, it has become clear that there are natural higher order versions of these concepts, in which linear polynomials such as are replaced with higher degree counterparts. The most obvious candidates for these counterparts would be the polynomials , but this turns out to not be a complete set of higher degree objects needed for the theory. Instead, the higher order versions of quasiperiodic and almost periodic sequences are now known as *basic nilsequences* and *nilsequences* respectively, while the higher order version of a linear phase is a *nilcharacter*; each nilcharacter then has a *symbol* that is a higher order generalisation of the concept of a frequency (and the collection of all symbols forms a group that can be viewed as a higher order version of the Pontryagin dual of ). The theory of these objects is spread out in the literature across a number of papers; in particular, the theory of nilcharacters is mostly developed in Appendix E of this 116-page paper of Ben Green, Tamar Ziegler, and myself, and is furthermore written using nonstandard analysis and treating the more general setting of higher dimensional sequences. I therefore decided to rewrite some of that material in this blog post, in the simpler context of the qualitative asymptotic theory of one-dimensional nilsequences and nilcharacters rather than the quantitative single-scale theory that is needed for combinatorial applications (and which necessitated the use of nonstandard analysis in the previous paper).

For technical reasons (having to do with the non-trivial topological structure on nilmanifolds), it will be convenient to work with vector-valued sequences, that take values in a finite-dimensional complex vector space rather than in . By doing the space of sequences is now, technically, no longer a ring, as the operations of addition and multiplication on vector-valued sequences become ill-defined. However, we can still take complex conjugates of a sequence, and add sequences taking values in the same vector space , and for sequences taking values in different vector spaces , , we may utilise the tensor product , which we will normalise by defining

This product is associative and bilinear, and also commutative up to permutation of the indices. It also interacts well with the Hermitian norm

since we have .

The traditional definition of a basic nilsequence (as defined for instance by Bergelson, Host, and Kra) is as follows:

Definition 1 (Basic nilsequence, first definition)Anilmanifold of step at mostis a quotient , where is a connected, simply connected nilpotent Lie group of step at most (thus, all -fold commutators vanish) and is a discrete cocompact lattice in . Abasic nilsequence of degree at mostis a sequence of the form , where , , and is a continuous function.

For instance, it is not difficult using this definition to show that a sequence is a basic nilsequence of degree at most if and only if it is quasiperiodic. The requirement that be simply connected can be easily removed if desired by passing to a universal cover, but it is technically convenient to assume it (among other things, it allows for a well-defined logarithm map that obeys the Baker-Campbell-Hausdorff formula). When one wishes to perform a more quantitative analysis of nilsequences (particularly when working on a “single scale”. sich as on a single long interval ), it is common to impose additional regularity conditions on the function , such as Lipschitz continuity or smoothness, but ordinary continuity will suffice for the qualitative discussion in this blog post.

Nowadays, and particularly when one needs to understand the “single-scale” equidistribution properties of nilsequences, it is more convenient (as is for instance done in this ICM paper of Green) to use an alternate definition of a nilsequence as follows.

Definition 2Let . Afiltered group of degree at mostis a group together with a sequence of subgroups with and for . Apolynomial sequenceinto a filtered group is a function such that for all and , where is the difference operator. Afiltered nilmanifold of degree at mostis a quotient , where is a filtered group of degree at most such that and all of the subgroups are connected, simply connected nilpotent filtered Lie group, and is a discrete cocompact subgroup of such that is a discrete cocompact subgroup of . Abasic nilsequence of degree at mostis a sequence of the form , where is a polynomial sequence, is a filtered nilmanifold of degree at most , and is a continuous function which is -automorphic, in the sense that for all and .

One can easily identify a -automorphic function on with a function on , but there are some (very minor) advantages to working on the group instead of the quotient , as it becomes slightly easier to modify the automorphy group when needed. (But because the action of on is free, one can pass from -automorphic functions on to functions on with very little difficulty.) The main reason to work with polynomial sequences rather than geometric progressions is that they form a group, a fact essentially established by by Lazard and Leibman; see Corollary B.4 of this paper of Green, Ziegler, and myself for a proof in the filtered group setting.

It is easy to see that any sequence that is a basic nilsequence of degree at most in the sense of the first definition, is also a basic nilsequence of degree at most in the second definition, since a nilmanifold of degree at most can be filtered using the lower central series, and any linear sequence will be a polynomial sequence with respect to that filtration. The converse implication is a little trickier, but still not too hard to show: see Appendix C of this paper of Ben Green, Tamar Ziegler, and myself. There are two key examples of basic nilsequences to keep in mind. The first are the polynomially quasiperiodic sequences

where are polynomials of degree at most , and is a -automorphic (i.e., -periodic) continuous function. The map defined by is a polynomial map of degree at most , if one filters by defining to equal when , and for . The torus then becomes a filtered nilmanifold of degree at most , and is thus a basic nilsequence of degree at most as per the second definition. It is also possible explicitly describe as a basic nilsequence of degree at most as per the first definition, for instance (in the case) by taking to be the space of upper triangular unipotent real matrices, and the subgroup with integer coefficients; we leave the details to the interested reader.

The other key example is a sequence of the form

where are real numbers, denotes the fractional part of , and and is a -automorphic continuous function that vanishes in a neighbourhood of . To describe this as a nilsequence, we use the nilpotent connected, simply connected degree , Heisenberg group

with the lower central series filtration , , and for , to be the discrete compact subgroup

to be the polynomial sequence

and to be the -automorphic function

one easily verifies that this function is indeed -automorphic, and it is continuous thanks to the vanishing properties of . Also we have , so is a basic nilsequence of degree at most . One can concoct similar examples with replaced by other “bracket polynomials” of ; for instance

will be a basic nilsequence if now vanishes in a neighbourhood of rather than . See this paper of Bergelson and Leibman for more discussion of bracket polynomials (also known as generalised polynomials) and their relationship to nilsequences.

A *nilsequence of degree at most * is defined to be a sequence that is the uniform limit of basic nilsequences of degree at most . Thus for instance a sequence is a nilsequence of degree at most if and only if it is almost periodic, while a sequence is a nilsequence of degree at most if and only if it is constant. Such objects arise in higher order recurrence: for instance, if are integers, is a measure-preserving system, and , then it was shown by Leibman that the sequence

is equal to a nilsequence of degree at most , plus a null sequence. (The special case when the measure-preserving system was ergodic and for was previously established by Bergelson, Host, and Kra.) Nilsequences also arise in the inverse theory of the Gowers uniformity norms, as discussed for instance in this previous post.

It is easy to see that a sequence is a basic nilsequence of degree at most if and only if each of its components are. The scalar basic nilsequences of degree are easily seen to form a -algebra (that is to say, they are a complex vector space closed under pointwise multiplication and complex conjugation), which implies similarly that vector-valued basic nilsequences of degree at most form a complex vector space closed under complex conjugation for each , and that the tensor product of any two basic nilsequences of degree at most is another basic nilsequence of degree at most . Similarly with “basic nilsequence” replaced by “nilsequence” throughout.

Now we turn to the notion of a nilcharacter, as defined in this paper of Ben Green, Tamar Ziegler, and myself:

Definition 3 (Nilcharacters)Let . Asub-nilcharacter of degreeis a basic nilsequence of degree at most , such that obeys the additional modulation propertyfor all and , where is a continuous homomorphism . (Note from (1) and -automorphy that unless vanishes identically, must map to , thus without loss of generality one can view as an element of the Pontryagial dual of the torus .) If in addition one has for all , we call a

nilcharacterof degree .

In the degree one case , the only sub-nilcharacters are of the form for some vector and , and this is a nilcharacter if is a unit vector. Similarly, in higher degree, any sequence of the form , where is a vector and is a polynomial of degree at most , is a sub-nilcharacter of degree , and a character if is a unit vector. A nilsequence of degree at most is automatically a sub-nilcharacter of degree , and a nilcharacter if it is of magnitude . A further example of a nilcharacter is provided by the two-dimensional sequence defined by

where are continuous, -automorphic functions that vanish on a neighbourhood of and respectively, and which form a partition of unity in the sense that

for all . Note that one needs both and to be not identically zero in order for all these conditions to be satisfied; it turns out (for topological reasons) that there is no scalar nilcharacter that is “equivalent” to this nilcharacter in a sense to be defined shortly. In some literature, one works exclusively with sub-nilcharacters rather than nilcharacters, however the former space contains zero-divisors, which is a little annoying technically. Nevertheless, both nilcharacters and sub-nilcharacters generate the same set of “symbols” as we shall see later.

We claim that every degree sub-nilcharacter can be expressed in the form , where is a degree nilcharacter, and is a linear transformation. Indeed, by scaling we may assume where uniformly. Using partitions of unity, one can find further functions also obeying (1) for the same character such that is non-zero; by dividing out the by the square root of this quantity, and then multiplying by , we may assume that

and then

becomes a degree nilcharacter that contains amongst its components, giving the claim.

As we shall show below, nilsequences can be approximated uniformly by linear combinations of nilcharacters, in much the same way that quasiperiodic or almost periodic sequences can be approximated uniformly by linear combinations of linear phases. In particular, nilcharacters can be used as “obstructions to uniformity” in the sense of the inverse theory of the Gowers uniformity norms.

The space of degree nilcharacters forms a semigroup under tensor product, with the constant sequence as the identity. One can upgrade this semigroup to an abelian group by quotienting nilcharacters out by equivalence:

Definition 4Let . We say that two degree nilcharacters , areequivalentif is equal (as a sequence) to a basic nilsequence of degree at most . (We will later show that this is indeed an equivalence relation.) The equivalence class of such a nilcharacter will be called thesymbolof that nilcharacter (in analogy to the symbol of a differential or pseudodifferential operator), and the collection of such symbols will be denoted .

As we shall see below the fold, has the structure of an abelian group, and enjoys some nice “symbol calculus” properties; also, one can view symbols as precisely describing the obstruction to equidistribution for nilsequences. For , the group is isomorphic to the Ponytragin dual of the integers, and for should be viewed as higher order generalisations of this Pontryagin dual. In principle, this group can be explicitly described for all , but the theory rapidly gets complicated as increases (much as the classification of nilpotent Lie groups or Lie algebras of step rapidly gets complicated even for medium-sized such as or ). We will give an explicit description of the case here. There is however one nice (and non-trivial) feature of for – it is not just an abelian group, but is in fact a vector space over the rationals !

How many groups of order four are there? Technically, there are an enormous number, so much so, in fact, that the class of groups of order four is not even a set, but merely a proper class. This is because *any* four objects can be turned into a group by designating one of the four objects, say , to be the group identity, and imposing a suitable multiplication table (and inversion law) on the four elements in a manner that obeys the usual group axioms. Since all sets are themselves objects, the class of four-element groups is thus at least as large as the class of all sets, which by Russell’s paradox is known not to itself be a set (assuming the usual ZFC axioms of set theory).

A much better question is to ask how many groups of order four there are *up to isomorphism*, counting each isomorphism class of groups exactly once. Now, as one learns in undergraduate group theory classes, the answer is just “two”: the cyclic group and the Klein four-group .

More generally, given a class of objects and some equivalence relation on (which one should interpret as describing the property of two objects in being “isomorphic”), one can consider the number of objects in “up to isomorphism”, which is simply the cardinality of the collection of equivalence classes of . In the case where is finite, one can express this cardinality by the formula

thus one counts elements in , weighted by the reciprocal of the number of objects they are isomorphic to.

Example 1Let be the five-element set of integers between and . Let us say that two elements of are isomorphic if they have the same magnitude: . Then the quotient space consists of just three equivalence classes: , , and . Thus there are three objects in up to isomorphism, and the identity (1) is then justThus, to count elements in up to equivalence, the elements are given a weight of because they are each isomorphic to two elements in , while the element is given a weight of because it is isomorphic to just one element in (namely, itself).

Given a finite probability set , there is also a natural probability distribution on , namely the *uniform distribution*, according to which a random variable is set equal to any given element of with probability :

Given a notion of isomorphism on , one can then define the random equivalence class that the random element belongs to. But if the isomorphism classes are unequal in size, we now encounter a biasing effect: even if was drawn uniformly from , the equivalence class need not be uniformly distributed in . For instance, in the above example, if was drawn uniformly from , then the equivalence class will not be uniformly distributed in the three-element space , because it has a probability of being equal to the class or to the class , and only a probability of being equal to the class .

However, it is possible to remove this bias by changing the weighting in (1), and thus changing the notion of what cardinality means. To do this, we generalise the previous situation. Instead of considering sets with an equivalence relation to capture the notion of isomorphism, we instead consider groupoids, which are sets in which there are allowed to be *multiple* isomorphisms between elements in (and in particular, there are allowed to be multiple *automorphisms* from an element to itself). More precisely:

Definition 2A groupoid is a set (or proper class) , together with a (possibly empty) collection of “isomorphisms” between any pair of elements of , and a composition map from isomorphisms , to isomorphisms in for every , obeying the following group-like axioms:

- (Identity) For every , there is an identity isomorphism , such that for all and .
- (Associativity) If , , and for some , then .
- (Inverse) If for some , then there exists an inverse isomorphism such that and .
We say that two elements of a groupoid are

isomorphic, and write , if there is at least one isomorphism from to .

Example 3Any category gives a groupoid by taking to be the set (or class) of objects, and to be the collection of invertible morphisms from to . For instance, in the category of sets, would be the collection of bijections from to ; in the category of linear vector spaces over some given base field , would be the collection of invertible linear transformations from to ; and so forth.

Every set equipped with an equivalence relation can be turned into a groupoid by assigning precisely one isomorphism from to for any pair with , and no isomorphisms from to when , with the groupoid operations of identity, composition, and inverse defined in the only way possible consistent with the axioms. We will call this the *simply connected groupoid* associated with this equivalence relation. For instance, with as above, if we turn into a simply connected groupoid, there will be precisely one isomorphism from to , and also precisely one isomorphism from to , but no isomorphisms from to , , or .

However, one can also form multiply-connected groupoids in which there can be multiple isomorphisms from one element of to another. For instance, one can view as a space that is acted on by multiplication by the two-element group . This gives rise to two types of isomorphisms, an identity isomorphism from to for each , and a negation isomorphism from to for each ; in particular, there are *two* automorphisms of (i.e., isomorphisms from to itself), namely and , whereas the other four elements of only have a single automorphism (the identity isomorphism). One defines composition, identity, and inverse in this groupoid in the obvious fashion (using the group law of the two-element group ); for instance, we have .

For a finite multiply-connected groupoid, it turns out that the natural notion of “cardinality” (or as I prefer to call it, “cardinality up to isomorphism”) is given by the variant

of (1). That is to say, in the multiply connected case, the denominator is no longer the number of objects isomorphic to , but rather the number of *isomorphisms* from to other objects . Grouping together all summands coming from a single equivalence class in , we can also write this expression as

where is the automorphism group of , that is to say the group of isomorphisms from to itself. (Note that if belong to the same equivalence class , then the two groups and will be isomorphic and thus have the same cardinality, and so the above expression is well-defined.

For instance, if we take to be the simply connected groupoid on , then the number of elements of up to isomorphism is

exactly as before. If however we take the multiply connected groupoid on , in which has two automorphisms, the number of elements of up to isomorphism is now the smaller quantity

the equivalence class is now counted with weight rather than due to the two automorphisms on . Geometrically, one can think of this groupoid as being formed by taking the five-element set , and “folding it in half” around the fixed point , giving rise to two “full” quotient points and one “half” point . More generally, given a finite group acting on a finite set , and forming the associated multiply connected groupoid, the cardinality up to isomorphism of this groupoid will be , since each element of will have isomorphisms on it (whether they be to the same element , or to other elements of ).

The definition (2) can also make sense for some infinite groupoids; to my knowledge this was first explicitly done in this paper of Baez and Dolan. Consider for instance the category of finite sets, with isomorphisms given by bijections as in Example 3. Every finite set is isomorphic to for some natural number , so the equivalence classes of may be indexed by the natural numbers. The automorphism group of has order , so the cardinality of up to isomorphism is

(This fact is sometimes loosely stated as “the number of finite sets is “, but I view this statement as somewhat misleading if the qualifier “up to isomorphism” is not added.) Similarly, when one allows for multiple isomorphisms from a group to itself, the number of groups of order four up to isomorphism is now

because the cyclic group has two automorphisms, whereas the Klein four-group has six.

In the case that the cardinality of a groupoid up to isomorphism is finite and non-empty, one can now define the notion of a random isomorphism class in drawn “uniformly up to isomorphism”, by requiring the probability of attaining any given isomorphism class to be

thus the probability of being isomorphic to a given element will be inversely proportional to the number of automorphisms that has. For instance, if we take to be the set with the simply connected groupoid, will be drawn uniformly from the three available equivalence classes , with a probability of attaining each; but if instead one uses the multiply connected groupoid coming from the action of , and draws uniformly up to isomorphism, then and will now be selected with probability each, and will be selected with probability . Thus this distribution has accounted for the bias mentioned previously: if a finite group acts on a finite space , and is drawn uniformly from , then now still be drawn uniformly up to isomorphism from , if we use the multiply connected groupoid coming from the action, rather than the simply connected groupoid coming from just the -orbit structure on .

Using the groupoid of finite sets, we see that a finite set chosen uniformly up to isomorphism will have a cardinality that is distributed according to the Poisson distribution of parameter , that is to say it will be of cardinality with probability .

One important source of groupoids are the fundamental groupoids of a manifold (one can also consider more general topological spaces than manifolds, but for simplicity we will restrict this discussion to the manifold case), in which the underlying space is simply , and the isomorphisms from to are the equivalence classes of paths from to up to homotopy; in particular, the automorphism group of any given point is just the fundamental group of at that base point. The equivalence class of a point in is then the connected component of in . The cardinality up to isomorphism of the fundamental groupoid is then

where is the collection of connected components of , and is the order of the fundamental group of . Thus, simply connected components of count for a full unit of cardinality, whereas multiply connected components (which can be viewed as quotients of their simply connected cover by their fundamental group) will count for a fractional unit of cardinality, inversely to the order of their fundamental group.

This notion of cardinality up to isomorphism of a groupoid behaves well with respect to various basic notions. For instance, suppose one has an -fold covering map of one finite groupoid by another . This means that is a functor that is surjective, with all preimages of cardinality , with the property that given any pair in the base space and any in the preimage of , every isomorphism has a unique lift from the given initial point (and some in the preimage of ). Then one can check that the cardinality up to isomorphism of is times the cardinality up to isomorphism of , which fits well with the geometric picture of as the -fold cover of . (For instance, if one covers a manifold with finite fundamental group by its universal cover, this is a -fold cover, the base has cardinality up to isomorphism, and the universal cover has cardinality one up to isomorphism.) Related to this, if one draws an equivalence class of uniformly up to isomorphism, then will be an equivalence class of drawn uniformly up to isomorphism also.

Indeed, one can show that this notion of cardinality up to isomorphism for groupoids is uniquely determined by a small number of axioms such as these (similar to the axioms that determine Euler characteristic); see this blog post of Qiaochu Yuan for details.

The probability distributions on isomorphism classes described by the above recipe seem to arise naturally in many applications. For instance, if one draws a profinite abelian group up to isomorphism at random in this fashion (so that each isomorphism class of a profinite abelian group occurs with probability inversely proportional to the number of automorphisms of this group), then the resulting distribution is known as the *Cohen-Lenstra distribution*, and seems to emerge as the natural asymptotic distribution of many randomly generated profinite abelian groups in number theory and combinatorics, such as the class groups of random quadratic fields; see this previous blog post for more discussion. For a simple combinatorial example, the set of fixed points of a random permutation on elements will have a cardinality that converges in distribution to the Poisson distribution of rate (as discussed in this previous post), thus we see that the fixed points of a large random permutation asymptotically are distributed uniformly up to isomorphism. I’ve been told that this notion of cardinality up to isomorphism is also particularly compatible with stacks (which are a good framework to describe such objects as moduli spaces of algebraic varieties up to isomorphism), though I am not sufficiently acquainted with this theory to say much more than this.

## Recent Comments