Multiple ergodic averages for commuting multiplicative actions
summary
The gist
The paper studies the convergence of multiple ergodic averages involving several commuting multiplicative actions and proves that for finitely generated systems, these averages converge in norm.
In short
The paper proves that multiple ergodic averages involving several commuting multiplicative actions converge in norm for finitely generated systems. This is achieved by creating a novel way to control averages using box seminorms, combined with an iterative complexity reduction procedure based on magic extensions and a complexity vector. This method systematically simplifies complex recurrence problems until they reduce to known convergent cases.
Key concepts
- Multiple Ergodic Averages
- These are mathematical averages applied across multiple functions or transformations simultaneously. The paper studies how these averages behave when you have several commuting multiplicative actions, which is a specific type of transformation where the actions interact in a predictable way.
- Complexity Vector (c1, c2, c3)
- This vector is a tool used to measure the structural complexity of the collection of transformations involved. It quantifies aspects like how many positions exist, the minimum number of non-identity transformations at any spot, and how often those transformations appear together.
- Magic Extensions
- These are mathematical tools used to simplify problems by ensuring that certain factors derived from the system have a very simple description. By applying magic extensions, the authors can reduce the complexity of a problem involving many actions to one involving fewer or simpler actions.
- Box Seminorm Control
- This is a method used to bound the size or magnitude of an ergodic average. The paper introduces a new generalization of Kátai's criterion to achieve this control, which is crucial for proving that the averages converge in norm.
Terminology used across episodes
This episode discusses
- Multiple ergodic averages for commuting multiplicative actions · Paper Radio
- Seminorm estimates and joint ergodicity for pairwise independent Hardy sequences
- Decomposition results for multiplicative actions and applications
- Partition regularity of homogeneous quadratics: Current trends and challenges
- Partition regularity of generalized Pythagorean pairs
- Ergodic averages for sparse corners
- Recurrence for pretentious systems along generalized Pythagorean triples
- Joint ergodicity - 40 years on
- Multiplicative recurrence of M"obius transformations
The paper
Multiple ergodic averages for commuting multiplicative actions · Read on arXiv
Dimitrios Charamaras, Andreas Koutsogiannis, Konstantinos Tsinas
Swiss National Science Foundation · CRM-ISM Postdoctoral Fellowship
We study the convergence of multiple ergodic averages involving several commuting multiplicative actions. We prove that for finitely generated systems, the averages 1 over N sum from n=1 to N S 1,nF 1 times times S,nF converge in norm, settling a conjecture of Frantzikinakis. Our proofs feature tools from ergodic theory and probabilistic number theory. We exploit some stability properties of additive functions to establish a novel variant of 's orthogonality criterion, which leads to box seminorm control for our averages. Using the theory of magic extensions introduced by Host and a delicate complexity reduction argument, we eventually reduce our problem to known convergence results.
Transcript
Introduction to the show: ident: Mathematics. The day in mathematics: new theorems, new proofs, and what they open.
Ada: I'm Ada.
Emmy: And I'm Emmy, here with Kolya.
Ada: We're looking at the paper: "Multiple ergodic averages for commuting multiplicative actions".
Emmy: Here's the gist of the paper. The paper studies the convergence of multiple ergodic averages involving several commuting multiplicative actions and proves that for finitely generated systems, these averages converge in norm.
Ada: Multiple Ergodic Averages in the Multiplicative Setting The work investigates the convergence of multiple ergodic averages involving several commuting multiplicative actions, proving that for finitely generated systems, these averages converge in norm.
Emmy: The authors study the convergence of averages like 1/N X N n=1 S1,nF1 ·...
Ada: · Sl,nFl and prove it settles a conjecture of Frantzikinakis.
Title and authors: Ada: So we're looking at this paper now, "Multiple ergodic averages for commuting multiplicative actions". It looks like they're tackling how several different multiplicative actions behave when you take multiple ergodic averages.
Emmy: Yeah, it’s about those specific sequences of functions and transformations where the actions commute. They are proving that these averages settle a conjecture by Frantzikinakis.
Ada: Exactly, and the big deal here is they prove this convergence in norm for finitely generated systems. That’s a strong statement because norm convergence is much stronger than just almost sure convergence, which we see in some other areas.
Kolya: For me, what's interesting is the machinery they use to get that control over the averages, because typically proving these kinds of bounds involves very delicate tail estimates.
Ada: Right. They introduce a new way to control those averages by generalizing Kátai’s orthogonality criterion, which gives them this box seminorm control. And then they bring in magic extensions from Host’s work to help simplify things.
Emmy: That whole setup is really clever because it allows them to use an induction on complexity of the initial averages, which ultimately reduces the problem down to those well-known mean convergence results.
Ada: So, if I'm thinking about what this means for us, it suggests a systematic way to handle these complicated recurrence problems in multiplicative settings without needing a completely new proof from scratch every time.
Kolya: What I see is that the complexity reduction procedure they develop is quite algorithmic, and it systematically eliminates actions with identity transformations in certain positions until the system is reduced to something simpler.
Emmy: That iterative process, using that complexity vector c equals c1, c2, c3 to quantify the action structure, seems like a very structured way to manage the problem.
Ada: Right. And they show that this reduction can be done by repeatedly applying Theorem four point eight and passing to extensions until you get down to a system where convergence is already known by Theorem A.
Kolya: I wonder about the limitations here, because they mention that the complexity vector itself helps quantify the structure, but it doesn't tell us much about whether this reduction process is always guaranteed to terminate in a finite number of steps for every system.
Emmy: That’s a valid point. The paper establishes that any complexity vector can be reduced to one where convergence is known, which implies the procedure works, but the paper doesn't explicitly state if there are any pathological cases where it might loop or take an infinite amount of time.
Ada: Right. So, to sum up the main improvement they propose is this combination: using the box seminorm control from Kátai's criterion with magic extensions to systematically reduce the problem based on a complexity vector.
Kolya: And that reduction leads to bounding the average by a box seminorm of the initial function, which turns out to be equivalent to a power of that seminorm, which is what guarantees convergence when you have measurability properties.
Emmy: It’s neat how they connect this back to Theorem A for multiplicative systems, showing that any complexity vector can eventually be reduced to one where the average converges in the L2(mu) space.
Ada: So, we've seen how they tackle these multiple ergodic averages involving commuting multiplicative actions and what tools they use to get norm convergence. Now let's look at what they suggest for next steps and open questions.
Emmy: They definitely leave some interesting avenues open, like conjecture one point three about multiplicative actions that might not commute but generate a nilpotent group, which is a big structural question for them <ref:2609.00405#pg2>.
Kolya: And I think the question they ask about joint ergodicity involving polynomial sequences, specifically when the averages of the form En in N F T omega times G in N T2 omega converges for every function F and G, is important because it connects multiplicative actions with additive ones.
Ada: That interaction between additive and multiplicative systems is a key area they are exploring further, and they introduce joint pretentious ergodicity to study those mixed averages.
Emmy: It seems like the next step for this kind of work is to really explore these interactions between the two types of systems, especially how polynomial sequences behave under these combined actions.
Ada: So, to wrap up on this paper, they successfully proved norm convergence for multiple ergodic averages of commuting finitely generated multiplicative systems using a complexity reduction strategy based on Kátai's criterion and magic extensions.
Kolya: And the main caveat is that while the procedure works for reducing complexity, we still need more information about whether this reduction always terminates in a finite number of steps across all possible initial systems.
Emmy: That’s right. The paper shows a powerful framework, but those open questions about non-commuting actions and joint ergodicity show where the next line of research needs to go.
Ada: So, that's our take on "Multiple ergodic averages for commuting multiplicative actions" and how it sets up the next set of problems in this area.
The paper's summary: Ada: So, to recap, this paper is about proving that when you have several different multiplicative actions that all commute—meaning they don't interfere with each other—the multiple ergodic averages still settle down and converge in norm.
Emmy: Yeah, it’s about those sequences of functions and transformations where the actions commute. They are proving that these averages settle a conjecture by Frantzikinakis.
Ada: Exactly, and the big deal here is they prove this convergence in norm for finitely generated systems. That’s a strong statement because norm convergence is much stronger than just almost sure convergence, which we see in some other areas.
Kolya: For me, what's interesting is the machinery they use to get that control over the averages, because typically proving these kinds of bounds involves very delicate tail estimates.
Ada: Right. They introduce a new way to control those averages by generalizing Kátai’s orthogonality criterion, which gives them this box seminorm control. And then they bring in magic extensions from Host’s work to help simplify things.
Emmy: That whole setup is really clever because it allows them to use an induction on complexity of the initial averages, which ultimately reduces the problem down to those well-known mean convergence results.
Ada: So, if I'm thinking about what this means for us, it suggests a systematic way to handle these complicated recurrence problems in multiplicative settings without needing a completely new proof from scratch every time.
Kolya: What I see is that the complexity reduction procedure they develop is quite algorithmic, and it systematically eliminates actions with identity transformations in certain positions until the system is reduced to something simpler.
Emmy: That iterative process, using that complexity vector c equals c1, c2, c3 to quantify the action structure, seems like a very structured way to manage the problem.
Ada: Right. And they show that this reduction can be done by repeatedly applying Theorem four point eight and passing to extensions until you get down to a system where convergence is already known by Theorem A.
Kolya: I wonder about the limitations here, because they mention that the complexity vector itself helps quantify the structure, but it doesn't tell us much about whether this reduction process is always guaranteed to terminate in a finite number of steps for every system.
Emmy: That’s a valid point. The paper establishes that any complexity vector can be reduced to one where convergence is known, which implies the procedure works, but the paper doesn't explicitly state if there are any pathological cases where it might loop or take an infinite amount of time.
Ada: Right. So, to sum up the main improvement they propose is this combination: using the box seminorm control from Kátai's criterion with magic extensions to systematically reduce the problem based on a complexity vector.
Kolya: And that reduction leads to bounding the average by a box seminorm of the initial function, which turns out to be equivalent to a power of that seminorm, which is what guarantees convergence when you have measurability properties.
Emmy: It’s neat how they connect this back to Theorem A for multiplicative systems, showing that any complexity vector can eventually be reduced to one where the average converges in the L2 mu space.
Ada: So, we've seen how they tackle these multiple ergodic averages involving commuting multiplicative actions and what tools they use to get norm convergence. Now let's look at what they suggest for next steps and open questions.
Emmy: They definitely leave some interesting avenues open, like conjecture one point three about multiplicative actions that might not commute but generate a nilpotent group, which is a big structural question for them.
Kolya: And I think the question they ask about joint ergodicity involving polynomial sequences, specifically when the averages of the form En in N F T omega times G in N T2 omega converges for every function F and G, is important because it connects multiplicative actions with additive ones.
Ada: That interaction between additive and multiplicative systems is a key area they are exploring further, and they introduce joint pretentious ergodicity to study those mixed averages.
Emmy: It seems like the next step for this kind of work is to really explore these interactions between the two types of systems, especially how polynomial sequences behave under these combined actions.
Ada: So, that's our take on this paper and how it sets up the next set of problems in this area.
The paper's improvements: Ada: So, to recap, they didn't just prove convergence; they showed how to systematically reduce any complex collection of commuting multiplicative actions down to a simpler one where we already know the answer.
Emmy: Yeah, it’s about that complexity vector c equals c1, c2, c3. It’s like a structural map for the set of transformations S.
Ada: Exactly. They use that vector to guide an iterative construction that eliminates actions with identity transformations in specific positions until all actions are eliminated or reduced to a known convergent case like the average of the form En in N SnF which converges by Theorem A.
Kolya: I mean, from a probabilistic standpoint, it’s interesting because we usually worry about tail probabilities, but this procedure gives us control over those tails by linking them to box seminorms.
Emmy: That’s right. The gains come from bounding the original averages by box seminorms using a variant of Kátai's orthogonality criterion, and then refining those bounds using magic extensions to reduce the problem to simpler averages through an induction on complexity.
Ada: It means we can take a really complicated set of commuting actions and turn it into something manageable just by following that reduction algorithm, which is very useful when you’re dealing with systems that are hard to analyze directly.
Kolya: I wonder if there are any cases where this reduction takes an infinite number of steps, because if it does, the whole method doesn't give us a definitive answer for those systems.
Emmy: That’s the caveat. The paper establishes that any complexity vector can be reduced to one where convergence is known, which implies the procedure works for reducing complexity, but they don't explicitly state if there are any pathological cases where it might loop or take an infinite amount of time.
Ada: So, the improvement here is really the robustness of the method; you get a systematic framework that takes any system and forces it down to a known convergent state through this structured reduction process.
Kolya: And I think what this means for us is that we can tackle recurrence problems in multiplicative systems by using tools from complexity theory and measure theory in a way that’s much more organized than just looking at the raw averages.
Emmy: Exactly. It gives us an algebraic structure to understand how these different multiplicative actions interact, which was something the Host-Kra factors haven't fully adapted to in the general case before.
Ada: So, we’ve seen how they tackle multiple ergodic averages involving commuting multiplicative actions and what tools they use to get norm convergence. Now let's look at what they suggest for next steps and open questions.
Conclusion: Tom: So, to wrap up, this paper proves that we can use these complexity reduction tools to get norm convergence for multiple ergodic averages involving commuting multiplicative actions of finitely generated systems.
Ada: That's right. It’s a big step because it shows we have a reliable way to handle the interplay between additive and multiplicative dynamics when they are well-behaved and commute.
Emmy: Yeah, it settles that conjecture by Frantzikinakis by showing the structure behind these averages is constrained enough for this kind of algorithmic reduction to work.
Kolya: From my side, the main thing is that this method gives us a way to connect recurrence problems in multiplicative systems back to those cleaner L2 convergence results we already have established for simpler cases.
Ada: Exactly. It’s not just about getting a yes or no on convergence; it’s about giving us a systematic procedure that works across different types of commuting actions.
Emmy: The implication is that we can now use the complexity vector to categorize these systems and predict how complex they are before we even start computing anything.
Kolya: I just hope this complexity reduction doesn't have any hidden traps where the number of steps required grows too fast for practical application on larger systems.
Ada: That’s a fair concern. The paper does flag that the procedure reduces complexity, but it doesn't guarantee a finite number of steps for every possible initial system we can imagine.
Emmy: It’s an open question whether this termination is always guaranteed, which brings us right back to those other hard questions about non-commuting actions and joint ergodicity.
Kolya: Yeah, that’s the next big thing for researchers—finding out if these ideas extend when the actions don't commute or when you mix them with polynomial sequences.
Ada: Indeed. The paper on multiple ergodic averages for commuting multiplicative actions gives us a solid foundation before we tackle those more challenging interactions between different types of dynamics.
More episodes
- 2509.05860-Concentration Inequalities for Branching Random Walks
- 2509.19309-Small Prime Primitive Roots in Arithmetic Progressions
- 2509.21830-Noncollapsing for Curvature Flows with Inhomogeneous Speeds
- 2510.08346-Separability and Submetrizability in Locally Convex Spaces
- 2510.27290-Borel Combinatorics of Schreier Graphs of Z-actions
- 2511.13500-Sampling Density for Gabor Phase Retrieval
- 2511.19161-Linear dynamics of random products of weighted shifts
- 2511.21548-Metastability of diffusion processes in narrow tubes
- 2512.01536-Abelian approximations for bicrossed products
- 2601.02524-Lagrangian slice disks with symplectomorphic exteriors