betaFeedback

WorksMathematics

Phase factors and optimal seminorms for polynomial averages of commuting transformations

Abstract

For invertible commuting measure-preserving transformations T1,…,TℓT_1, \ldots, T_\ell on a standard probability space, we study polynomial averages along both integers and primes. We provide a rank-based criterion ensuring that, even when the polynomials are linearly dependent, finite-order phase factors are characteristic factors. For polynomials with integer coefficients and zero constant terms, it suffices that the dimension of the space spanned (over Q\mathbb{Q}) by any nonempty subfamily of kk polynomials exceeds k/2k/2. These phase factors are generated by polynomial phases associated with positive integer powers of the individual transformations and may be strictly smaller than the corresponding Host-Kra factors of the same order. The required order depends only on the number of polynomials and their maximum degree. A four-term example involving a totally ergodic Heisenberg nilsystem shows that this criterion may fail if the equality k/2k/2 is permitted. For a family of three polynomials, this criterion is equivalent to the condition that the polynomials are pairwise linearly independent. Consequently, it applies to the family t,t2,t2+tt, t^2, t^2+t, where the third polynomial is the sum of the first two. For this specific family, we prove that the optimal orders for the phase factors and the Host-Kra factors are 4,2,24, 2, 2, respectively–a result that holds for both integers and primes. The corresponding optimal seminorms are U5(T1)U^5(T_1), U3(T2)U^3(T_2), and U3(T3)U^3(T_3), which provides an answer to a question posed by Kuca.

Introduction

Background and main questions

The study of polynomial ergodic averages originated from the connection between multiple recurrence and arithmetic configurations. Furstenberg’s ergodic proof of Szemerédi’s theorem [14] connected multiple recurrence with arithmetic progressions. The polynomial recurrence theorem of Bergelson and Leibman [2] extended this connection to polynomial configurations and commuting transformations. A central problem is to characterize the parts of a dynamical system that determine the limits of these averages.

Let ℓ≥3\ell\ge3, [ℓ]:={1,…,ℓ}[\ell] := \{1,\ldots,\ell\}, and let T1,…,TℓT_1,\ldots,T_\ell be invertible commuting measure-preserving transformations of a standard probability space (X,X,μ)(X,\mathcal{X},\mu). For integer polynomials p=(p1,…,pℓ)\mathbf{p}=(p_1,\ldots,p_\ell) with pi(0)=0p_i(0)=0, write

ANp(f1,…,fℓ)=1N∑n=1N∏i=1ℓTipi(n)fi,fi∈L∞(μ),(1)A_N^{\mathbf{p}}(f_1,\ldots,f_\ell)=\frac{1}{N}\sum_{n=1}^{N}\prod_{i=1}^{\ell}T_i^{p_i(n)}f_i,\qquad f_i\in L^\infty(\mu), \tag*{(1)}

where Tf=f∘TTf=f\circ T. For linear and polynomial iterations, Tao [24] and Walsh [25] proved norm convergence, respectively. To describe limits more precisely, one seeks a collection of factors (Ai)i=1ℓ(\mathcal{A}_i)_{i=1}^{\ell} such that, upon replacing each fif_i with E(fi∣Ai)\mathbb{E}(f_i\mid\mathcal{A}_i), the difference in the average tends to zero in L2(μ)L^2(\mu). Such a collection of factors is called a system of characteristic factors.

For a single transformation, the Host–Kra–Ziegler structure theory [16, 27], combined with the theory of equidistribution of polynomials on nilmanifolds, provides the characteristic factors for polynomial averages [17, 22].

For several commuting transformations, people wish to use the factors corresponding to each TiT_i separately. Chu, Frantzikinakis, and Host established Host–Kra factor control for various transformations, applicable to polynomials with distinct degrees [5]. Following the estimates on the seminorm in [6, 7], Frantzikinakis and Kuca proved that for any family of pairwise linearly independent polynomials, the finite-order Host–Kra factors of the individual transformations form a system of characteristic factors [13 Theorem 2.8]. This theorem does not require ergodicity, and the necessary order depends only on the number of polynomials and their maximum degree. Section 2.4 of the same paper also discusses a version of this result for prime numbers. For a family of linearly independent polynomials, Frantzikinakis and Kra proved that the rational Kronecker factors are characteristic for averages taken over integers for a single ergodic transformation [12 Theorem 1.1]. Frantzikinakis and Kuca extended this result to commuting transformations, covering both averages over integers and averages over prime numbers [13 Theorems 2.10 and 2.13].

For a family of polynomials that are pairwise linearly independent but collectively satisfy a linear relation, the above results leave two questions open: what is the required degree for each coordinate, and which parts of the corresponding Host–Kra factor determine the limit of the average? The first of these questions already arises in the following average:

AN(f1,f2,f3)=1N∑n=1NT1nf1 T2n2f2 T3n2+nf3.(2)A_N(f_1,f_2,f_3)=\frac{1}{N}\sum_{n=1}^{N}T_1^n f_1\,T_2^{n^2} f_2\,T_3^{n^2+n} f_3. \tag*{(2)}

The family of polynomials t,t2,t2+tt,t^2,t^2+t are pairwise linearly independent, but the third polynomial is the sum of the first two. When T1=T2=T3=TT_1=T_2=T_3=T is ergodic, the Kronecker factor Z1(T)\mathcal{Z}_1(T) coincides with the characteristic factor [10 Theorem B]. For general commuting transformations, the existence of a control by a factor of finite order has been established [13 Theorem 2.8]. In [21 Section 6.3, Problem 36], Kuca asks about the optimal order, noting that it is not even clear whether Z1(T1),Z1(T2),Z1(T3)\mathcal{Z}_1(T_1),\mathcal{Z}_1(T_2),\mathcal{Z}_1(T_3) are sufficient. This problem examines whether the low-order description in a single transformation case can be extended to several commuting transformations.

The second question is inspired by existing work on the single-transformation case, which reduces the problem to affine systems and factors generated by quasi-eigenfunctions [10]. The study of Weyl systems and polynomial complexity [3, 20] relates characteristic orders to affine models and polynomial identities. Even if the Host–Kra complexity is equal to the Weyl complexity, it cannot be concluded that, in a given commutative system, each Host–Kra factor can be replaced with a subfactor generated by polynomial phases for positive powers of the corresponding transformation. We investigate when this substitution holds and allow for linear relationships within a family of polynomials.

In this paper, we answer the first question for (2): for all commuting systems, the optimal coordinatewise Host–Kra factor orders are 4, 2, 2. Therefore, the first-order conclusion for a single transformation no longer holds in general commuting systems. For a pair of commuting affine transformations on T5\mathbb{T}^5, one obtains three matching lower bounds simultaneously, with the possibility of setting T2=T3T_2=T_3.

The upper bound comes from a more general reduction result, namely, reduction to a factor generated by polynomial phases for positive powers of the corresponding transformation. We prove that as long as the dimension of the space spanned by each nonempty subfamily of polynomials over the rational number field is greater than half its size, these smaller factors constitute a set of characteristic factors. This criterion covers all triples of pairwise linearly independent polynomials and also applies to longer families of polynomials with linear relationships. This reduction and the order 4, 2, 2 hold true for both integer and prime averages. Furthermore, the orders of the phase factors for this three-term polynomial family are optimal.

Phase factors and a rank criterion

Now we define the phase factor and state the result precisely. Let P\mathbb{P} be the primes and π(N)=∣P∩[1,N]∣\pi(N)=|\mathbb{P}\cap[1,N]|. For N≥2N\ge2, put

AN,PP(f1,…,fℓ)=1π(N)∑p≤Np∈P∏i=1ℓTipi(p)fi.(3)A^{\mathbb{P}}_{N,\mathbb{P}}(f_1,\ldots,f_\ell)=\frac{1}{\pi(N)}\sum_{\substack{p\le N\\p\in\mathbb{P}}}\prod_{i=1}^{\ell}T_i^{p_i(p)}f_i. \tag*{(3)}

Let AN,PA_{N,\mathbb{P}} denote the prime-number version of (1.2). For averages over primes, the definition of the characteristic factor tuple remains the same. By Walsh’s theorem and the comparison results in [11], these averages over primes converge.

We adopt the following conventions: ∥f∥Ud+1(T)=0\|f\|_{U^{d+1}(T)}=0 if and only if E(f∣Zd(T))=0\mathbb{E}(f\mid\mathcal{Z}_d(T))=0; see [16, 18]. For a function ϕ\phi of modulus one, let ΔTϕ=(Tϕ)ϕ‾\Delta_T\phi=(T\phi)\overline{\phi}, and define its iterates recursively. For d≥1d\ge1, let

Wd(T)=σμ({ϕ∈L∞(μ):∣ϕ∣=1, ΔTqd+1ϕ=1 for some q≥1}),\mathcal{W}_d(T)=\sigma_\mu\left(\left\{\phi\in L^\infty(\mu):|\phi|=1,\ \Delta_{T^q}^{d+1}\phi=1\text{ for some }q\ge1\right\}\right),

where σμ\sigma_\mu denotes the completed sigma-algebra generated by the indicated functions. We call Wd(T)\mathcal{W}_d(T) the phase factor of order dd.

The functions satisfying ΔTqd+1ϕ=1\Delta_{T^q}^{d+1}\phi=1 are classical quasi-eigenfunctions for positive integer powers of TT. Abramov established a structural theory for totally ergodic systems with quasi-discrete spectrum [1]; see also [15]. For a fixed qq, following the convention in [15 Section 2.3], these generating functions are of order at most dd with respect to TqT^q. Equivalently, adopting the notation from [4 Definition 1.13], Wd(T)=⋁q≥1Abr⁡<d+1(Tq)\mathcal{W}_d(T)=\bigvee_{q\ge1}\operatorname{Abr}_{<d+1}(T^q), where the completion is taken. The equivalence of different definitions of quasi-eigenfunction will be reviewed in § 2. It is important to consider positive integer powers here because, even if a transformation is ergodic, the space of higher-order quasi-eigenfunctions may change upon taking powers [9 Theorem 1.4(i)].

Lemma 2.4 establishes that Wd(T)⊆Zd(T)\mathcal{W}_d(T)\subseteq\mathcal{Z}_d(T), and this inclusion can be strict, even when considering all positive integer powers. For an ergodic translation on the standard Heisenberg nilmanifold, W2(T)=Z1(T)⊊Z2(T)\mathcal{W}_2(T)=\mathcal{Z}_1(T)\subsetneq\mathcal{Z}_2(T); see [10 Propositions 2.1(i), 2.4 and Theorem 2.2] and § 7.2. Therefore, even if the corresponding Host–Kra seminorm is not zero, the phase factor theorem may still deduce that the average tends to zero.

For J⊆[ℓ]J\subseteq[\ell], put rp(J)=dim⁡Qspan⁡Q{pj:j∈J}r_p(J)=\dim_{\mathbb{Q}}\operatorname{span}_{\mathbb{Q}}\{p_j:j\in J\}. The following criterion can be verified using the coefficient matrices of the respective families of polynomials.

Theorem A. Let D≥1D\ge1 and ℓ≥3\ell\ge3. There exists an integer s=s(D,ℓ)≥1s=s(D,\ell)\ge1 with the following property. Let p1,…,pℓ∈Z[t]p_1,\ldots,p_\ell\in\mathbb{Z}[t] have degree at most DD and satisfy pi(0)=0p_i(0)=0. Assume that

∣J∣<2rp(J)(∅≠J⊆[ℓ]).(4)|J|<2r_p(J)\qquad(\varnothing\ne J\subseteq[\ell]). \tag*{(4)}

For every system of invertible commuting measure-preserving transformations T1,…,TℓT_1,\ldots,T_\ell, the factors Ws(T1),…,Ws(Tℓ)\mathcal{W}_s(T_1),\ldots,\mathcal{W}_s(T_\ell) are characteristic for both (1.1) and (1.3). More precisely, if fi∈L∞(μ)f_i\in L^\infty(\mu) and E(fj∣Ws(Tj))=0\mathbb{E}(f_j\mid\mathcal{W}_s(T_j))=0 for some j∈[ℓ]j\in[\ell], then

∥ANP(f1,…,fℓ)∥2⟶0,∥AN,P(f1,…,fℓ)∥2⟶0.\|A_N^{\mathbb{P}}(f_1,\ldots,f_\ell)\|_2\longrightarrow0,\qquad \|A_{N,\mathbb{P}}(f_1,\ldots,f_\ell)\|_2\longrightarrow0.

The rank condition excludes the zero polynomial and implies pairwise linear independence. For three polynomials, it is exactly equivalent to each being pairwise linearly independent. The order s(D,ℓ)s(D,\ell) is independent of the coefficients, the system, and the functions involved.

At the boundary where equality holds, there is a specific obstruction to the strict inequality. Proposition 7.3 examines pj(t)=t+jt2p_j(t)=t+jt^2, 0≤j≤30\le j\le3. Every nonempty subfamily satisfies ∣J∣≤2rp(J)|J|\le2r_p(J), with equality occurring only for the full family of four polynomials. On a totally ergodic Heisenberg nilsystem, the same set of four functions are orthogonal to Ws(T)\mathcal{W}_s(T) for every s≥1s\ge1, while their integer average has a non-zero limit. Here, all four transformations are identical. Therefore, increasing the phase order cannot remove this obstacle. This example excludes the possibility of uniformly replacing << by ≤\le in (1.4).

By Lemma 3.1, (1.4) is equivalent to the following statement: for every ii, there exist two linearly independent subfamilies that cover the whole family of polynomials and intersect only at pip_i. This can be derived from the finite vector form of Edmonds’ matroid partition theorem [8], with a convenient sufficient condition.

Corollary 1.1. Let D≥1D \ge1 and ℓ≥3\ell\ge3, and let s=s(D,ℓ)s=s(D,\ell) be as in Theorem A. If p1,…,pℓ∈Z[t]p_1,\ldots,p_\ell\in\mathbb{Z}[t] have degree at most DD, zero constant terms, and every ⌊ℓ/2⌋+1\lfloor\ell/2 \rfloor+1 of them are linearly independent over Q\mathbb{Q}, then Ws(T1),…,Ws(Tℓ)\mathcal{W}_s(T_1),\ldots,\mathcal{W}_s(T_\ell) are characteristic for both (1.1) and (1.3). In particular, it suffices that every ℓ−1\ell-1 polynomials are linearly independent.

Proof. For each ii, divide [ℓ]∖{i}[\ell]\setminus\{i\} into two sets whose sizes differ by at most one, and add ii to these two sets. The size of each resulting set is at most ⌊ℓ/2⌋+1\lfloor\ell/2 \rfloor+1, so the corresponding subfamilies are linearly independent. Applying Lemma 3.1 and Theorem A yields the conclusion. The last assertion follows from ⌊ℓ/2⌋+1≤ℓ−1\lfloor\ell/2 \rfloor+1\le\ell-1.

Optimal orders for three iterates

For t,t2,t2+tt,t^2,t^2+t, by Theorem A one can reduce the average to phase factors of some finite order. Subsequently, recurrence relations and polynomial identities give the exact order.

References

  1. [1]L. M. Abramov, Metric automorphisms with quasi-discrete spectrum, Izv. Akad. Nauk SSSR Ser. Mat. 26 (1962), no. 4, 513–530 (in Russian). https://www.mathnet.ru/eng/im2331.
  2. [2]V. Bergelson and A. Leibman, Polynomial extensions of van der Waerden’s and Szemerédi’s theorems, J. Amer. Math. Soc. 9 (1996), no. 3, 725–753. doi:10.1090/S0894-0347-96-00194-4.DOI
  3. [3]V. Bergelson, A. Leibman, and E. Lesigne, Complexities of finite families of polynomials, Weyl systems, and constructions in combinatorial number theory, J. Anal. Math. 103 (2007), 47–92. doi:10.1007/s11854-008-0002-z.DOI
  4. [4]V. Bergelson, T. Tao, and T. Ziegler, An inverse theorem for the uniformity seminorms associated with the action of F_p^∞, Geom. Funct. Anal. 19 (2010), no. 6, 1539–1596. doi:10.1007/s00039-010-0051-1.DOI
  5. [5]Q. Chu, N. Frantzikinakis, and B. Host, Ergodic averages of commuting transformations with distinct degree polynomial iterates, Proc. Lond. Math. Soc. (3) 102 (2011), no. 5, 801–842. doi:10.1112/plms/pdq037.DOI
  6. [6]S. Donoso, A. Ferré Moragues, A. Koutsogiannis, and W. Sun, Decomposition of multicorrelation sequences and joint ergodicity, Ergodic Theory Dynam. Systems 44 (2024), no. 2, 432–480. doi:10.1017/etds.2023.30.DOI
  7. [7]S. Donoso, A. Koutsogiannis, and W. Sun, Seminorms for multiple averages along polynomials and applications to joint ergodicity, J. Anal. Math. 146 (2022), 1–64. doi:10.1007/s11854-021-0186-z.DOI
  8. [8]J. Edmonds, Minimum partition of a matroid into independent subsets, J. Res. Nat. Bur. Standards Sect. B 69B (1965), nos. 1–2, 67–72. doi:10.6028/jres.069B.004.DOI
  9. [9]N. Frantzikinakis, Uniformity in the polynomial Wiener–Wintner theorem, Ergodic Theory Dynam. Systems 26 (2006), no. 4, 1061–1071. doi:10.1017/S0143385706000204.DOI
  10. [10]N. Frantzikinakis, Multiple ergodic averages for three polynomials and applications, Trans. Amer. Math. Soc. 360 (2008), no. 10, 5435–5475. doi:10.1090/S0002-9947-08-04591-1.DOI
  11. [11]N. Frantzikinakis, B. Host, and B. Kra, The polynomial multidimensional Szemerédi theorem along shifted primes, Israel J. Math. 194 (2013), no. 1, 331–348. doi:10.1007/s11856-012-0132-y.DOI
  12. [12]N. Frantzikinakis and B. Kra, Ergodic averages for independent polynomials and applications, J. Lond. Math. Soc. (2) 74 (2006), no. 1, 131–142. doi:10.1112/S0024610706023374.DOI
  13. [13]N. Frantzikinakis and B. Kuca, Joint ergodicity for commuting transformations and applications to polynomial sequences, Invent. Math. 239 (2025), 621–706. doi:10.1007/s00222-024-01313-w.DOI
  14. [14]H. Furstenberg, Ergodic behavior of diagonal measures and a theorem of Szemerédi on arithmetic progressions, J. Anal. Math. 31 (1977), 204–256. doi:10.1007/BF02813804.
  15. [15]M. Haase and N. Moriakov, On systems with quasi-discrete spectrum, Studia Math. 241 (2018), no. 2, 173–199. doi:10.4064/sm8756-6-2017.DOI
  16. [16]B. Host and B. Kra, Nonconventional ergodic averages and nilmanifolds, Ann. of Math. (2) 161 (2005), no. 1, 397–488. doi:10.4007/annals.2005.161.397.DOI
  17. [17]B. Host and B. Kra, Convergence of polynomial ergodic averages, Israel J. Math. 149 (2005), 1–19. doi:10.1007/BF02772534.DOI
  18. [18]B. Host and B. Kra, Nilpotent Structures in Ergodic Theory, Mathematical Surveys and Monographs, vol. 236, American Mathematical Society, Providence, RI, 2018. doi:10.1090/surv/236.DOI
  19. [19]A. Jamneshan and S. Machado, The non-ergodic Host–Kra–Ziegler structure theorem for Z^d-actions via measurable selections, preprint, arXiv:2601.09553v3, 2026. https://arxiv.org/abs/2601.09553v3.
  20. [20]B. Kuca, On several notions of complexity of polynomial progressions, Ergodic Theory Dynam. Systems 43 (2023), no. 4, 1269–1323. doi:10.1017/etds.2021.171.DOI
  21. [21]B. Kuca, Joint ergodicity—40 years on, preprint, arXiv:2603.18974v1, 2026. https://arxiv.org/abs/2603.18974v1.
  22. [22]A. Leibman, Convergence of multiple ergodic averages along polynomials of several variables, Israel J. Math. 146 (2005), 303–315. doi:10.1007/BF02775358.
  23. [23]A. Leibman, Pointwise convergence of ergodic averages for polynomial sequences of translations on a nilmanifold, Ergodic Theory Dynam. Systems 25 (2005), no. 1, 201–213. doi:10.1017/S0143385704000215.DOI
  24. [24]T. Tao, Norm convergence of multiple ergodic averages for commuting transformations, Ergodic Theory Dynam. Systems 28 (2008), no. 2, 657–688. doi:10.1017/S0143385708000011.DOI
  25. [25]M. N. Walsh, Norm convergence of nilpotent ergodic averages, Ann. of Math. (2) 175 (2012), no. 3, 1667–1688. doi:10.4007/annals.2012.175.3.15.DOI
  26. [26]H. Weyl, Über die Gleichverteilung von Zahlen mod. Eins, Math. Ann. 77 (1916), 313–352. doi:10.1007/BF01475864.DOI
  27. [27]T. Ziegler, Universal characteristic factors and Furstenberg averages, J. Amer. Math. Soc. 20 (2007), no. 1, 53–97. doi:10.1090/S0894-0347-06-00532-7.DOI

Paper details

vlnc:W_2bgk2ejw
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
CC BY 4.0
Usage

views · 0

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Mathematics

AI-assisted tools

View statement
Looking for related papers…
Contents