Nilsequence

In mathematics, a nilsequence is a type of numerical sequence playing a role in ergodic theory and additive combinatorics. ^[1] The concept is related to nilpotent Lie groups and almost periodicity. The name arises from the part played in the theory by compact nilmanifolds of the type ${\displaystyle G/\Gamma }$ where ${\displaystyle G}$ is a nilpotent Lie group and ${\displaystyle \Gamma }$ a lattice in it.

The idea of a basic nilsequence defined by an element ${\displaystyle g}$ of ${\displaystyle G}$ and continuous function ${\displaystyle f}$ on ${\displaystyle G/\Gamma }$ is to take ${\displaystyle b(n)}$, for ${\displaystyle n}$ an integer, as ${\displaystyle f(g^{n}\Gamma )}$. General nilsequences are then uniform limits of basic nilsequences. ^[2] For the statement of conjectures and theorems, technical side conditions and quantifications of complexity are introduced. Much of the combinatorial importance of nilsequences reflects their close connection with the Gowers norm. ^[3] As explained by Host and Kra, nilsequences originate in evaluating functions on orbits in a "nilsystem"; and nilsystems are "characteristic for multiple correlations". ^[4]

Case of the circle group

The circle group arises as the special case of the real line and its subgroup of the integers. It has nilpotency class equal to 1, being abelian, and the requirements of the general theory are to generalise to nilpotency class ${\displaystyle s>1.}$ The semi-open unit interval [0,1) is a fundamental domain, and for that reason the fractional part function is involved in the theory. Functions involving the fractional part ${\displaystyle \{\{x\}\}}$ of the variable in the circle group occur, under the name "bracket polynomials". Since the theory is in the setting of Lipschitz functions, which are a fortiori continuous, the discontinuity of the fractional part at 0 has to be managed.

That said, the sequences ${\displaystyle \{\{\alpha n\}\}}$, where ${\displaystyle \alpha }$ is a given irrational real number, and ${\displaystyle n}$ an integer, and studied in diophantine approximation, are simple examples for the theory. Their construction can be thought of in terms of the skew product construction in ergodic theory, adding one dimension. ^{[5] [6]}

Polynomial sequences

The imaginary exponential function ${\displaystyle e(x)}$ maps the real numbers to the circle group (see Euler's formula#Topological interpretation). A numerical sequence ${\displaystyle e(P(n))}$ where ${\displaystyle P}$ is a polynomial function with real coefficients, and ${\displaystyle n}$ is an integer variable, is a type of trigonometric polynomial, called a "polynomial sequence" for the purposes of the nilsequence theory. The generalisation to nilpotent groups that are not abelian relies on the Hall–Petresco identity from group theory for a workable theory of polynomials. ^[7] In particular the polynomial sequence comes with a definite degree.

Möbius function and nilsequences

A family of conjectures ${\displaystyle MN(s)}$ was made by Ben Green and Terence Tao, concerning the Möbius function of prime number theory and ${\displaystyle s}$-step nilsequences. Here the underlying Lie group ${\displaystyle G}$ is assumed simply connected and nilpotent with length at most ${\displaystyle s}$. The nilsequences considered are of type ${\displaystyle f(g^{n}x\Gamma )}$ with some fixed ${\displaystyle x}$ in ${\displaystyle G}$, and the function ${\displaystyle f}$ continuous and taking values in [-1,1]. ^[8] The form of the conjecture, which requires a stated metric on the nilmanifold and Lipschitz bound in the implied constant, is that the average of ${\displaystyle \mu (n)f(g^{n}x\Gamma )}$ up to ${\displaystyle N}$ is smaller asymptotically than any fixed inverse power of ${\displaystyle logN.}$ ^[9] As a subsequent paper published in 2012 proving the conjectures put it, The Möbius function is strongly orthogonal to nilsequences. ^[10]

Subsequently Green, Tao and Tamar Ziegler also proved a family ${\displaystyle IG(s)}$ of inverse theorems for the Gowers norm, stated in terms of nilsequences. This completed a program of proving asymptotics for simultaneous prime values of linear forms. ^[11]

Tao has commented in his book Higher Order Fourier Analysis on the role of nilsequences in the inverse theorem proof. The issue being to extend IG results from the finite field case to general finite cyclic groups, the "classical phases"—essentially the exponentials of polynomials natural for the circle group—had proved inadequate. There were options other than nilsequences, in particular direct use of bracket polynomials. But Tao writes that he prefers nilsequences for the underlying Lie theory structure. ^[12]

Equivalent form for averaged Chowla and Sarnak conjectures

Tao has proved that a conjecture on nilsequences is an equivalent of an averaged form of a noted conjecture of Sarvadaman Chowla involving only the Möbius function, and the way it self-correlates. Peter Sarnak made a conjecture on the non-correlation of the Möbius function with more general sequences from ergodic theory, which is a consequence of Chowla's conjecture. Tao's result on averaged forms showed all three conjectures are equivalent. ^[13] The 2018 paper The logarithmic Sarnak conjecture for ergodic weights by Frantzikinakis and Host used this approach to prove unconditional results on the Liouville function. ^[14]

Notes

1. Granville, Andrew; Nathanson, Melvyn Bernard; Solymosi, Jozsef (2007). Additive Combinatorics. American Mathematical Soc. p. 138. ISBN   978-0-8218-7039-6.
2. Ferenczi, Sébastien; Kułaga-Przymus, Joanna; Lemańczyk, Mariusz (15 June 2018). Ergodic Theory and Dynamical Systems in their Interactions with Arithmetics and Combinatorics: CIRM Jean-Morlet Chair, Fall 2016. Springer. p. 194 note 40. ISBN   978-3-319-74908-2.
3. Elsholtz, Christian; Grabner, Peter (26 May 2017). Number Theory – Diophantine Problems, Uniform Distribution and Applications: Festschrift in Honour of Robert F. Tichy's 60th Birthday. Springer. p. 395. ISBN   978-3-319-55357-3.
4. Host, Bernard; Kra, Bryna (12 December 2018). Nilpotent Structures in Ergodic Theory. American Mathematical Soc. p. 7. ISBN   978-1-4704-4780-9.
5. Bunimovich, L. A.; Dani, S. G.; Dobrushin, R. L.; Jakobson, M. V.; Kornfeld, I. P.; Maslova, N. B.; Pesin, Ya B.; Smillie, J.; Sukhov, Yu M.; Vershik, A. M. (5 April 2000). Dynamical Systems, Ergodic Theory and Applications. Springer Science & Business Media. p. 24. ISBN   978-3-540-66316-4.
6. Tao, Terence (2009). Poincare's Legacies, Part I: Pages from Year Two of a Mathematical Blog. American Mathematical Soc. p. 258. ISBN   978-0-8218-4883-8.
7. Tao, Terence (30 December 2012). Higher Order Fourier Analysis. American Mathematical Soc. p. 98. ISBN   978-1-4704-5998-7.
8. Green, Benjamin; Tao, Terence (2010). "Linear equations in primes". Annals of Mathematics. 171 (3): 1783. doi:10.4007/annals.2010.171.1753. ISSN   0003-486X. JSTOR   20752252.
9. Green, Benjamin; Tao, Terence (2010). "Linear equations in primes". Annals of Mathematics. 171 (3): 1788. doi:10.4007/annals.2010.171.1753. ISSN   0003-486X. JSTOR   20752252.
10. Green, Ben; Tao, Terence (2012). "The Möbius function is strongly orthogonal to nilsequences". Annals of Mathematics. 175 (2): 541–566. arXiv: 0807.1736 . doi:10.4007/annals.2012.175.2.3. ISSN   0003-486X. JSTOR   23234622.
11. Grechuk, Bogdan (21 September 2021). Landscape of 21st Century Mathematics: Selected Advances, 2001–2020. Springer Nature. pp. 10–11. ISBN   978-3-030-80627-9.
12. Tao, Terence (4 October 2012). Higher Order Fourier Analysis. American Mathematical Soc. p. 92. ISBN   978-0-8218-8986-2.
13. Ferenczi, Sébastien; Kułaga-Przymus, Joanna; Lemańczyk, Mariusz (15 June 2018). Ergodic Theory and Dynamical Systems in their Interactions with Arithmetics and Combinatorics: CIRM Jean-Morlet Chair, Fall 2016. Springer. p. 188. ISBN   978-3-319-74908-2.
14. Frantzikinakis, Nikos; Host, Bernard (1 May 2018). "The logarithmic Sarnak conjecture for ergodic weights". Annals of Mathematics. 187 (3). arXiv: 1708.00677 . doi:10.4007/annals.2018.187.3.6.