The Strong Naor--Schechtman Convolution Inequality on the Product of Cyclic Groups

arXiv:2609.15768 · math.FA · Submitted 2026-09-14 · Read on arXiv

Listen

Radio episode about this paper

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: "The Strong Naor--Schechtman Convolution Inequality on the Product of Cyclic Groups".

Emmy: Here's the gist of the paper. The paper uses martingale methods to resolve the convolution inequality problem posed by Naor and Schechtman in

8, Question 6.1: (see also

7: ).

Ada: For each 1 < p < ∞ and every n, m ∈ N we have a strong convolution inequality on products of finite cyclic groups.

Emmy: Specifically, for every 1 < p < ∞ and every n, m ∈ N we have the inequality EE∈−1,1nXx∈ZnmE

1,…,n: f(x + ε) − E

1,…,n: f(x − ε) ≤ (p∗ − 1)p Xε∈−1,1nXx∈Znmεj.

Ada: The study of metric property determined only by the distance of Banach spaces forms a central theme in the Ribe program.

Title and authors: Ada: So, this paper is diving into resolving a problem that Naor and Schechtman posed in reference eight, question six point one. It's about the metric inequality they introduced, which is a nonlinear version of the Rosenthal inequality and acts as an obstacle to saying that Lq spaces can be bi-Lipschitz embedded into Lp spaces when q is less than p for two less than q less than p for infinity.

Emmy: Exactly. What this paper does is use martingale methods to tackle that convolution inequality problem they set up in eight Question six point one <ref:2609.15768#pg1,in 8, Question 6.1>. It's trying to establish a strong version of this inequality on products of finite cyclic groups, which is a very specific geometric setting we're dealing with here.

Kolya: So the core idea seems to be using these martingale tools to get a bound that controls the behavior of functions on these product spaces, specifically looking at how much their values change under certain shifts. What does this mean for us probabilists?

Ada: It means they establish a strong convolution inequality. For every exponent p between one and infinity, and for any sizes n and m, they get an inequality that relates the expectation of the difference of function values at shifted points to a term involving p star minus one times p times some scaling factor related to epsilon.

Emmy: It's interesting because they are focusing on products of cyclic groups. This isn't just a standard Lp space; it has this specific structure related to those groups, which seems crucial for their geometric arguments about metric properties.

Kolya: So when you look at the setup described in the paper, what is the main structural decomposition they use to make sense of these product spaces? Does that decomposition reveal any hidden symmetries?

Ada: They define some expectation operators Ej and derivative operators Dj based on cyclic group operations. These family of operators commute with each other, which simplifies things a lot because they can be combined into an expectation operator EA for any subset A of n, and the whole thing is expressed in terms of the set Omega n.

Emmy: It's about how they decompose the expectation operator. They show that for every function f on that product space, they can write its expectation in a very specific way involving a sum over those sets A and epsilon values. It's like breaking down a complex operation into simpler pieces based on which parts of the group we look at.

Kolya: And then they define this test function sf, which is just the average of f(x plus epsilon) and f(x minus epsilon). How does that relate to the overall goal of bounding these expectations? What's the next step in their proof strategy?

Ada: They use a lemma, lemma two point one, to represent Sb b j f. This representation shows that you can calculate this expectation conditionally over filtrations F j minus one i, which means they are building up the structure step by step.

Title and authors: Emmy: The strategy is to apply this lemma to decompose Hf, which is one of those key ingredients they need for their main result. They then relate the overall term involving the expectation of gHf to a martingale difference term and a sum over random variables.

Kolya: So what does that final step actually yield in terms of the bound? What's the concrete inequality they end up with concerning p star minus one times p times the scaling factor?

Ada: The final result, theorem one point three, states that for every exponent p between one and infinity, and for any sizes n and m, they get this strong convolution inequality. The norm of Hf in Lp over the product space is bounded by that term involving p star minus one times p times the sum over j from one to n of epsilon j b j f in Lp.

Emmy: This bound is derived by applying theorem two point four, which bounds a specific term involving delta d j g. That particular application yields a sharp inequality that involves the p star minus one constant. It shows how tightly linked the metric structure is to this scaling factor p star minus one.

Kolya: So for someone just listening who doesn't know all these groups, what's the big picture here? What does this mean for how we understand these Lp spaces?

Ada: It means they have established a strong convolution inequality that settles the problem posed by Naor and Schechtman. They are showing that this geometric property holds robustly on products of finite cyclic groups, which is a significant step in understanding nonlinear geometry in Banach spaces.

Emmy: The paper also points out that the scaling factor appearing in the original metric inequality is actually necessary for it to hold, which leads them to conjecture something about Lp spaces being Xp metric spaces with optimal scaling.

Kolya: And what about their limitations? What's one thing they admit they haven't fully settled or what this method doesn't cover?

Ada: They note that the constant cp they obtain in this way might be worse than the sharp inequality we know from Burkholder. That suggests that while it’s a strong result, it might not yet be the absolute best possible constant.

Emmy: It seems like they've made real progress by resolving the question posed by Efraim and Lust-Piquard through their work with martingale methods and exponential lifting techniques.

Kolya: So to wrap up this segment, we have established this strong convolution inequality for the product of cyclic groups in the paper The Strong Naor--Schechtman Convolution Inequality on the Product of Cyclic Groups. Next time, we'll look at how they might be improving other types of metric inequalities or perhaps exploring those related to type three factors.

The paper's summary: Ada: So, we're looking at the summary of this paper now on "The Strong Naor--Schechtman Convolution Inequality on the Product of Cyclic Groups." Essentially, they use martingale methods to solve a specific convolution problem that Naor and Schechtman set up years ago.

Emmy: Exactly. They are taking that original metric inequality—which is a kind of obstruction to embedding spaces—and proving a much stronger version for these products of finite cyclic groups. It's not just a weak statement; it's a strong one, Theorem one point three, which gives them this powerful bound on the function norms.

Kolya: So what does this strong inequality actually tell us about the geometry of these spaces? Does it give us any new tools for how we understand Banach spaces?

Ada: It establishes that for every exponent p between one and infinity, and for any sizes n and m, you get this inequality where the norm of the function Hf in Lp over that product space is controlled by a term involving p star minus one times p times some sum related to epsilon.

Emmy: The structure they use—the decomposition of expectation operators into these specific families Ej and Dj based on group operations—is key here. It shows that the whole complexity of the function's behavior can be broken down into manageable pieces governed by those commuting operators.

Kolya: And this decomposition leads to relating the expectation term to martingale differences. So, what does that mean for someone who just wants to know what this bound actually governs? What kind of tail is it controlling?

Ada: It says the error term in that product space is bounded by something related to p star minus one times p times a sum over j from one to n of epsilon j b j f in Lp. That's the core result, showing how tightly linked this metric structure is to that scaling factor, p star minus one.

Emmy: And it's interesting because they used Theorem two point four, which is related to Burkholder’s work on martingale transforms. They use that to show this sharp inequality involving p star minus one. It's a very precise connection between the metric and the underlying probability structure of the function space.

Kolya: So what's the caveat here? They mentioned something about their constant cp potentially being worse than what we know from Burkholder. What does that imply about how good this method is in practice?

Ada: It implies that while they got a strong result, the specific constant they found might not be the absolute best possible one, which is what Burkholder's inequality gives. They settled the Naor and Schechtman question by getting a sharp inequality, but maybe not yet the sharpest constant.

Emmy: But the real structural insight is that this method helps us see how metric properties on these product spaces are governed by these specific martingale transformations. It’s about uncovering the structure hidden in those operators.

Kolya: So, to sum it up for a listener, what does this paper actually change for someone who only cares about the behavior of functions on these complicated product spaces?

Ada: It provides a strong convolution inequality that settles that original problem posed by Naor and Schechtman. It gives a concrete way to bound the function norms using these specific group structures.

Emmy: And it also suggests something about conjecture one point two, which hints that Lp spaces might have optimal scaling in this metric sense. It opens up a path for exploring those deeper metric properties of Lq spaces.

The paper's improvements: Ada: So, we're talking about how this paper suggests improvements to what they just proved on "The Strong Naor--Schechtman Convolution Inequality on the Product of Cyclic Groups." It’s not just a static result; it points toward a better way to think about these inequalities.

Emmy: They're suggesting that the scaling factor itself, that p star minus one term, is actually necessary for the inequality to hold. This isn't just an artifact of the proof; it’s part of the required geometric structure of those Lp spaces.

Kolya: So what’s this about? Is it suggesting we can get a better constant than they found, or is it pointing out a deeper structural truth about these metric spaces?

Ada: It suggests that there might be an optimal scaling parameter. They bring up conjecture one point two from Naor and Schechtman, which hints that Lp spaces might actually be Xp metric spaces with the best possible scaling.

Emmy: That’s the algebraic view of it. They see the structure in those product groups, and they think there’s a fundamental relationship between the topology of those groups and how well they can embed these function spaces into one another.

Kolya: If Lp spaces have optimal scaling, what does that mean for someone who just cares about applying these tools to other problems? Does it make the whole field more predictable?

Ada: It means that if you’re working with a metric space defined by distance alone, you can expect the best possible scaling behavior. It gives a target. If you can prove something holds at this optimal scaling, then you’ve really understood the space's geometry.

Emmy: They are looking at how the operators Ej and Dj behave in these contexts, and they think that this leads to a clearer picture of the underlying algebraic symmetries of those product groups.

Kolya: So they aren't just proving a bound; they’re trying to define the right conditions for when that bound is tightest. That feels like moving from just calculating numbers to defining the rules of the game for these spaces.

Ada: Exactly. They are shifting focus from just getting *a* sharp inequality to finding the *best* scaling law, which is what conjecture one point two proposes. It's about identifying the necessary and sufficient conditions for that optimal behavior.

Emmy: And this line connects back to how they decomposed the operators earlier, showing that those specific algebraic manipulations reveal this underlying scaling property of the space itself.

Kolya: So what’s the next thing on their radar? Are they going to try and prove that conjecture, or are they looking at something else entirely?

Ada: They are definitely looking at conjecture one point two. It's a challenge for the field. If you can show that the optimal scaling is achieved, it validates a lot of the machinery they built with those martingale methods.

Conclusion: Ada: So we’re wrapping up the discussion on "The Strong Naor--Schechtman Convolution Inequality on the Product of Cyclic Groups." To recap, this paper uses martingale methods to establish a strong convolution inequality for products of finite cyclic groups, settling a problem posed by Naor and Schechtman.

Emmy: And they’ve shown that this inequality holds with a sharp scaling factor involving p star minus one times p times that sum over epsilon j b j f in Lp. It’s really about the structure of those operators Ej and Dj.

Kolya: What does this whole thing mean for the probabilistic side? Does this bound survive when you try to apply it to some more complex, random settings?

Ada: It shows that the error term in that product space is bounded by something very specific, related to p star minus one times p times that sum. It’s a concrete way to control the size of the function's norm in Lp.

Emmy: I think it points toward conjecture one point two being true, meaning Lp spaces have optimal scaling in this sense. They are using algebraic geometry to see that structure clearly.

Kolya: If those spaces actually have optimal scaling, does that give you a better handle on the entire metric space? Does it simplify the analysis for things like convergence?

Ada: It gives you a target for how well the space behaves geometrically. It tells you what the best possible scaling looks like for that particular structure.

Emmy: And it’s also showing how to use those martingale transforms effectively to decompose functions on these product spaces step by step. That decomposition is pretty elegant when you see it through an algebraic lens.

Kolya: I think the main thing for me is seeing how they used theorem two point four, which relates this back to Burkholder’s work on martingale transforms. It connects the abstract inequality to something concrete in probability theory.

Ada: Exactly. It bridges the gap between group theory and stochastic processes quite neatly there. This result is a significant piece in understanding nonlinear geometry on these structured spaces.

Emmy: So we’ve seen how they decompose those operators, how they use martingale transforms, and how this leads to a sharp convolution inequality for the product of cyclic groups in their paper "The Strong Naor--Schechtman Convolution Inequality on the Product of Cyclic Groups."

Kolya: It's a strong result with a very specific constant that might not be the absolute best, but it’s still very useful for applying these tools.

Ada: That’s right. It sets a high bar for what we can expect from these kinds of inequalities on structured spaces. We’ll keep an eye on whether they nail that optimal scaling conjecture next.

National Natural Science Foundation of China · Natural Science Foundation of Hunan Province · Scientific Research Fund of Hunan Provincial Education Department

math.FA

Submitted: 2026-09-14

Updated: 2026-11-12

License: http://creativecommons.org/licenses/by/4.0/

Importance score: 89/100

The gist: The paper uses martingale methods to resolve the convolution inequality problem posed by Naor and Schechtman in [8, Question 6.1] (see also [7]).

Key concepts

Metric Xp Inequality
This is a nonlinear counterpart to the Rosenthal inequality that obstructs bi-Lipschitz embeddability of $L^q$ into $L^p$. It's a central concept in studying metric properties determined solely by the distance between Banach spaces, specifically relating to how functions behave under certain scaling operations.
Convolution Inequality
The paper establishes a strong version of this inequality on products of finite cyclic groups. This inequality bounds the expected value of a specific expression involving function values at shifted points, providing a key tool for analyzing the behavior of functions in these group structures.
Martingale Transforms
The proof strategy relies on applying martingale transforms to decompose complex functions, like $H f$. These transforms help break down the function into simpler components based on conditional expectations over filtrations, which is crucial for deriving the final sharp bounds.

Terminology

Summary

The paper uses martingale methods to resolve the convolution inequality problem posed by Naor and Schechtman in [8, Question 6. p. 0

Where the paper says it

THE STRONG NAOR–SCHECHTMAN CONVOLUTION INEQUALITY ON THE PRODUCT OF CYCLIC GROUPS YONG JIAO, SIJIE LUO, DMITRIY ZANIN, AND DEJIAN ZHOU Abstract. In this paper, we use martingale methods to resolve the convolution inequality problem posed by Naor and Schechtman in [8, Question 6.

1] (see also [7]). p. 0
Where the paper says it

In this paper, we use martingale methods to resolve the convolution inequality problem posed by Naor and Schechtman in [8, Question 6. 1] (see also [7]).

For each 1 < p < ∞ and every n, m ∈ N we have a strong convolution inequality on products of finite cyclic groups. p. 0

Where the paper says it

More precisely, we establish the following strong convolution inequality on products of finite cyclic groups. For each 1 < p < ∞ and every n, m ∈ N we have X ε∈{−1,1}n X x∈Znm E{1,··· ,n}f(x + ε) − E{1,··· ,n}f(x − ε) p ≤(p ∗ − 1)p X ε∈{−1,1}n X x∈Znm εj E{1,··· ,n}\{j}f(x + ej ) − E{1,··· ,n}\{j}f(x − ej ) p , where p ∗ = max{p, p/(p−1)} and EAf(x) = 1 2n P δ∈{−1,1}n f x + P j∈A δj ej for every A ⊆ {1, · · · , n}.

Specifically, for every 1 < p < ∞ and every n, m ∈ N we have the inequality EE∈−1,1nXx∈ZnmE[1,…,n]f(x + ε) − E[1,…,n]f(x − ε) ≤ (p∗ − 1)p Xε∈−1,1nXx∈Znmεj. p. 0
Where the paper says it

More precisely, we establish the following strong convolution inequality on products of finite cyclic groups. For each 1 < p < ∞ and every n, m ∈ N we have X ε∈{−1,1}n X x∈Znm E{1,··· ,n}f(x + ε) − E{1,··· ,n}f(x − ε) p ≤(p ∗ − 1)p X ε∈{−1,1}n X x∈Znm εj E{1,··· ,n}\{j}f(x + ej ) − E{1,··· ,n}\{j}f(x − ej ) p , where p ∗ = max{p, p/(p−1)} and EAf(x) = 1 2n P δ∈{−1,1}n f x + P j∈A δj ej for every A ⊆ {1, · · · , n}.

Introduction to the Metric Inequality

The study of metric property determined only by the distance of Banach spaces forms a central theme in the Ribe program. The metric Xp inequality introduced by Naor and Schechtman [8] is a nonlinear counterpart of the Rosenthal inequality, which serves as an obstruction to certify the failure of bi-Lipschitz embeddability of Lq into Lp for 2 < q < p < ∞. p. 0

Where the paper says it

Introduction The study of metric property determined only by the distance of Banach spaces forms a central theme in the Ribe program. The metric Xp inequality introduced by Naor and Schechtman [8] is a nonlinear counterpart of the Rosenthal inequality, which serves as an obstruction to certify the failure of bi-Lipschitz emebddability of Lq into Lp for 2 < q < p < ∞.

To make statements precisely, necessary notations are introduced for Znm and Omega n, and translation operators Tj and inverse operators T−1j are defined based on the cyclic group Znm. p. 0
Where the paper says it

To make statements precisely, we introduce necessary notations that will be used throughly. For a given n, let Z n m be the n-folds Cartesian product of the cyclic group Zm.

Decomposition of Operators

The j-th expectation operator Ej and the j-th derivative operator Dj are defined as Ej:= Tj + T−1j2 and Dj = Tj − T−1j2. It is clear that the family of operators EEj commute with each other. p. 1

Where the paper says it

2 JIAO, LUO, ZANIN, AND ZHOU It is clear that the family {Ej} n j=1 commute with each other. For each A ⊆ [n], let EA := Q j∈A Ej and E∅ = Id.

For A ⊆ [n], EA:= Qj∈A Ej and E∅ = Id. The expectation operator is then expressed as EAf(x) = 1/2AXδ∈−1,1n f(x + Xj∈A δj ej) = 1/2n Xδ∈omegan f(x + Xj∈A δj ej) for every f: Znm → R. p. 0
Where the paper says it

More precisely, we establish the following strong convolution inequality on products of finite cyclic groups. For each 1 < p < ∞ and every n, m ∈ N we have X ε∈{−1,1}n X x∈Znm E{1,··· ,n}f(x + ε) − E{1,··· ,n}f(x − ε) p ≤(p ∗ − 1)p X ε∈{−1,1}n X x∈Znm εj E{1,··· ,n}\{j}f(x + ej ) − E{1,··· ,n}\{j}f(x − ej ) p , where p ∗ = max{p, p/(p−1)} and EAf(x) = 1 2n P δ∈{−1,1}n f x + P j∈A δj ej for every A ⊆ {1, · · · , n}.

Decomposition of the Test Function

The function Sf(x, ε) is defined as Sf(x, ε):= f(x + ε) + f(x − ε)/2 = Tε[n]f(x) + T−ε[n]f(x)/2. The operators SεA are defined as SεA:= TεA + T−εA2. p. 0

Where the paper says it

It is clear that the linear operator Tj is an isometry on Lp(Z n m) for all p ∈ [1,∞] with its inverse given by T −1 j f(x) = f(x − ej ), f : Z n m → R. The j-th expectation operator Ej and the j-th derivative operator Dj are defined as follows Ej := Tj + T −1 j 2 and Dj = Tj − T −1 j 2 .

Lemma 2.1 provides a representation of Sb(j)f via the conditional expectation E[h]Sb(j)fFj−1i(x, ε) = E[n][j−1]Sε[j−1]b(j)f(x), (x, ε) ∈ Znm × omegan. p. 3
Where the paper says it

Then, F0 ⊆ F1 ⊆ · · · ⊆ Fn forms a filtration on the probability space Z n m × Ωn. The following lemma provides a representation of S(b (j) f ) via the conditional expectation.

Proof Strategy via Martingale Transforms

The proof of Theorem 1.3 proceeds by applying Lemma 2. p. 3

Where the paper says it

1) yields that E h Sb (j) f Fj−1 i (x, ε) = E[n]\[j−1]S ε [j−1]b (j) f (x), where we used the fact that all operators are commute with each other and the fact that b (j) f = 2DjE[n]\{j}f. □ Applying Lemma 2.

2 to decompose Hf, which is one of the key ingredients in the proof of our main result. p. 3
Where the paper says it

□ Applying Lemma 2. 1, we obtain the following decomposition of Hf , which is one of the key ingredients in the proof of our main result.

The final bound is achieved by relating Eν⊗µ [gHf] to a term involving martingale differences dj(g) and a sum over random variables. p. 6
Where the paper says it

11) yields |Eν⊗µ [gHf ] | = Eν⊗µ⊗µ′     Xn j=1 δjdj (g)   ·   Xn j=1 δj εjSb (j) f     ≤ Xn j=1 δjdj (g) Lp′ (Znm×Ωn×Ω) · Xn j=1 δj εjSb (j) f Lp(Znm×Ωn×Ω) (2. 13) Note that for each j ∈ [n] the random variable δj εj has the same distribution of εj , then it follows that (2.

This leads to the conclusion that Eν⊗µ [gHf] ≤ (p∗ − 1) Xn j=1 εj b(j)f Lp(Znm×omegan). p. 6
Where the paper says it

11) yields |Eν⊗µ [gHf ] | = Eν⊗µ⊗µ′     Xn j=1 δjdj (g)   ·   Xn j=1 δj εjSb (j) f     ≤ Xn j=1 δjdj (g) Lp′ (Znm×Ωn×Ω) · Xn j=1 δj εjSb (j) f Lp(Znm×Ωn×Ω) (2. 13) Note that for each j ∈ [n] the random variable δj εj has the same distribution of εj , then it follows that (2.

Key Results and Bounds

The main result establishes the strong convolution inequality, Theorem 1.3, which states that for every 1 < p < ∞ and every n, m ∈ N, the inequality E∥Hf∥Lp(Znm×omegan) ≤ (p∗ − 1) Xn j=1 εj b(j)f Lp(Znm×omegan) holds for every f: Znm → R. p. 2

Where the paper says it

1 of [8] asks whether there exists a constant cp > 0 such that for any n, m ∈ N the following inequality holds for every f : Z n m → R (1. 1) ∥Hf ∥Lp(Znm×Ωn) ≤ cp   Xn j=1 εj b (j) f Lp(Znm×Ωn) + Xn j=1 ∥Tjf − f∥Lp(Znm×Ωn)   .

This result is derived by applying Theorem 2. p. 3
Where the paper says it

□ Applying Lemma 2. 1, we obtain the following decomposition of Hf , which is one of the key ingredients in the proof of our main result.

4 to bound the term Pnj=1 δjdj (g) Lp′ (Znm×omegan×omega), which yields a sharp inequality involving p∗ − 1. p. 6
Where the paper says it

To bound the term Pn j=1 δjdj (g) Lp′ (Znm×Ωn×Ω) , we may use the Burkholder-Gundy inequality directly. However, the constant cp we obtain in this way will be worse than the sharp inequality of Burkholder as we shown as above.

Acknowledgments and References

This work was supported by the National Natural Science Foundation of China (Grant Nos. 12125109 & W2411005 & 12671165); the Natural Science Foundation of Hunan Province (Grant Nos: 2025ZYJ002, 2024JJ1010 & 2024RC3040); the Scientific Research Fund of Hunan Provincial Education Department (Grant Nos. p. 7

Where the paper says it

8 JIAO, LUO, ZANIN, AND ZHOU Acknowledgment This work was supported by the National Natural Science Foundation of China (Grant Nos. 12125109 & W2411005 & 12671165); the Natural Science Foundation of Hunan Province (Grant Nos: 2025ZYJ002, 2024JJ1010 & 2024RC3040); the Scientific Research Fund of Hunan Provincial Education Department (Grant Nos.

25A0009 & 25B1683). p. 7
Where the paper says it

12125109 & W2411005 & 12671165); the Natural Science Foundation of Hunan Province (Grant Nos: 2025ZYJ002, 2024JJ1010 & 2024RC3040); the Scientific Research Fund of Hunan Provincial Education Department (Grant Nos. 25A0009 & 25B0008).

The authors used GPT-5. p. 7
Where the paper says it

25A0009 & 25B0008). During the preparation of this work, the authors used GPT-5.

6 Sol to assist with language editing and refinement of mathematical arguments. p. 7
Where the paper says it

During the preparation of this work, the authors used GPT-5. 6 Sol to assist with language editing and refinement of mathematical arguments.

p. 7
Where the paper says it

During the preparation of this work, the authors used GPT-5. 6 Sol to assist with language editing and refinement of mathematical arguments.

References include [1], [2], [3], [4], [5], [6], and [7]. p. 7
Where the paper says it

The author takes full responsibility for the content of this paper. References [1] N.

Key Phrases

The authors establish the following strong convolution inequality. The metric Xp inequality of Naor and Schechtman is stated as follows, which is one of the essential result in [8]. p. 1

Where the paper says it

For A ⊆ [n] and ε ∈ Ωn, we let T ε A := Y j∈A T εj j . The metric Xp inequality of Naor and Schechtman is stated as follows, which is one of the essential result in [8].

The scaling appears in the metric Xp inequality is necessary (see [8, Propostion 1. p. 1
Where the paper says it

For 2 ≤ p < ∞, and k, m ∈ N with k ∈ [n] and m ≥ n 3/2 log(p) √ k + pn, then there exists a constant cp > 0 depending only on p such that the following inequality holds for every f : Z n 4m → Lp (p log(p))−1 n k X S⊆[n] |S|=k E h ∥f(x + 2mεS) − f(x)∥ p Lp i mp ≤cp   k n Xn j=1 E ∥Tjf(x) − f(x)∥ p Lp + k n p/2 E T ε [n] f(x) − f(x) p Lp   , where the expectation is with respect to (x, ε) ∈ Z n 4m × {−1, 1} n chosen unifromly at random. In the same paper, Naor and Schechtman showed that the scaling appears in the metric Xp inequality is necessary (see [8, Propostion 1.

4]). The authors settle the problem of Naor and Schechtman [8, Question 6. p. 2
Where the paper says it

1) ∥Hf ∥Lp(Znm×Ωn) ≤ cp   Xn j=1 εj b (j) f Lp(Znm×Ωn) + Xn j=1 ∥Tjf − f∥Lp(Znm×Ωn)   . In this paper, we settle the problem of Naor and Schechtman [8, Question 6.

1] by establishing the following strong convolution inequality. p. 2
Where the paper says it

In this paper, we settle the problem of Naor and Schechtman [8, Question 6. 1] by establishing the following strong convolution inequality.

The rest of the paper is devoted to providing a proof of Theorem 1. p. 2
Where the paper says it

2) ∥Hf ∥Lp(Znm×Ωn) ≤ (p ∗ − 1) Xn j=1 εj b (j) f Lp(Znm×Ωn) , where p ∗ = max{p, p p−1 }. The rest of the paper is devoted to providing a proof of Theorem 1.

3. The constant cp we obtain in this way will be worse than the sharp inequality of Burkholder as we shown as above. p. 6
Where the paper says it

To bound the term Pn j=1 δjdj (g) Lp′ (Znm×Ωn×Ω) , we may use the Burkholder-Gundy inequality directly. However, the constant cp we obtain in this way will be worse than the sharp inequality of Burkholder as we shown as above.

The authors use GPT-5. p. 7
Where the paper says it

25A0009 & 25B0008). During the preparation of this work, the authors used GPT-5.

6 Sol to assist with language editing and refinement of mathematical arguments. The work was supported by the National Natural Science Foundation of China (Grant Nos. p. 7
Where the paper says it

8 JIAO, LUO, ZANIN, AND ZHOU Acknowledgment This work was supported by the National Natural Science Foundation of China (Grant Nos. 12125109 & W2411005 & 12671165); the Natural Science Foundation of Hunan Province (Grant Nos: 2025ZYJ002, 2024JJ1010 & 2024RC3040); the Scientific Research Fund of Hunan Provincial Education Department (Grant Nos.

12125109 & W2411005 & 12671165). p. 7
Where the paper says it

8 JIAO, LUO, ZANIN, AND ZHOU Acknowledgment This work was supported by the National Natural Science Foundation of China (Grant Nos. 12125109 & W2411005 & 12671165); the Natural Science Foundation of Hunan Province (Grant Nos: 2025ZYJ002, 2024JJ1010 & 2024RC3040); the Scientific Research Fund of Hunan Provincial Education Department (Grant Nos.

Green — the paper says it, and the page is printed. Red — no passage carries it, so treat that sentence as unverified. The same check runs on your own text: check a summary against its source, $5.

Improvements for AI systems

  1. Better analysis of metric properties in Banach spaces can be achieved by applying martingale methods to resolve convolution inequality problems, which provides a route to establish strong convolution inequalities on products of finite cyclic groups as shown in Theorem 1.3.

  2. The improved system can rigorously prove the sharp fractional Riesz estimate by combining exponential lifting techniques with martingale methods, resolving the problem posed by Efraim and Lust-Piquard [4].

  3. The system can establish optimal scaling parameters for metric inequalities on Lp spaces by leveraging results like Conjecture 1.2 (Naor–Schechtman [8]), which suggests that Lp space is an Xp metric space with optimal scaling.

  4. The AI can analyze the structure of functions on product spaces Znm x Omega n by using the decomposition derived in Lemma 2.2, stating that Hf (x, epsilon) equals the sum of terms involving conditional expectations over filtrations F j-1 i.

  5. The system can utilize Theorem 2.4 (Burkholder) to bound martingale transforms M = Mj for each j, showing that X infinity j=1 ejdj Lp(Omega) is bounded by (p star minus 1) times the norm of the martingale M in Lp(Omega).

Abstract

In this paper, we resolve the convolution inequality problem posed by Naor and Schechtman in [Question 6.1] N-S2016 (see also). More precisely, we establish the following strong convolution inequality on products of finite cyclic groups: For each 1 at most p< infinity there exists c p>0 such that for every n, m in N the following holds & sum epsilon in-1,1 n sum x in E 1,,nf(x+ epsilon)-E 1,,nf(x-epsilon) p at most& c p p sum epsilon in-1,1 n sum x in epsilon j [E 1,,n jf(x+e j)-E 1,,n jf(x-e j)] p, E Af(x)= 1 over 2 n sum δ in-1,1 nf (x+ sum j in Aδ je j) for every A 1,,n. The growth order we obtain here c p=O(p) as p to infinity. For the endpoint p= infinity, we show by a counterexample that the strong convolution inequality fails for the L infinity, and we prove that the appropriate endpoint for p= infinity is the martingale BMO space.

Sources

Related papers