Search arXivSearch

arXiv · 2509.11432

Can a small Gaussian perturbation break subadditivity?

Abstract

Given an integer $a\ge 1$, a function $f: \mathbb{R}\to \mathbb{R}$ is said to be $a$-subadditive if $$ f(ax+y) \le af(x)+f(y) \,\,\,\text{ for all }x,y \in \mathbb{R}. $$ Of course, $1$-subadditive functions (which correspond to ordinary subadditive functions) are $2$-subadditive. % and $3$-subadditive. Answering a question of Matkowski, we show that there exists a continuous function $f$ satisfying $f(0)=0$ which is $2$-subadditive but not $1$-subadditive. In addition, the same example is not $3$-subadditive, which shows that the sequence of families of continuous $a$-subadditive functions passing through the origin is not increasing with respect to $a$. The construction relies on a perturbation of a given subadditive function with an even Gaussian ring, which will destroy the original subadditivity while keeping the weaker property. Lastly, given a positive rational cone $H\subseteq (0,\infty)$ which is not finitely generated, we prove that there exists a subadditive bijection $f:H\to H$ such that $\liminf_{x\to 0}f(x)=0$ and $\limsup_{x\to 0}f(x)=1$. This is related an open question of Matkowski and {Ś}wi{\k a}tkowski in [Proc. Amer. Math. Soc. 119 (1993), 187--197].

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Paolo Leonetti. 2025-09-14. Can a small Gaussian perturbation break subadditivity?. https://arxiv.org/abs/2509.11432

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

On the prime field spherical restriction conjecture in four dimensions: breaking the Stein-Tomas exponent and applications

Let $p$ be an odd prime. We prove the extension estimate $R_{S_j}^*(2\to r)\lesssim_r 1$ for every nonzero-radius sphere $S_j\subseteq\mathbb{F}_p^4$ and every $r\geq \, 34/11$, uniformly in $p$ and $j$. This improves the Stein--Tomas exponent $10/3$ established by Iosevich and Koh (2008). We also formulate a localized spherical restriction/extension conjecture that predicts the sharp dependence of the restriction norm on the size of the physical support. This conjecture implies the spherical extension estimates $R_{S_j}^*(2\to r)\lesssim_r 1$ for every $r>3$, and yields almost-every-pin distance estimates at the conjectured Erdős--Falconer exponent in four dimensions, up to an arbitrarily small power loss in the set-size hypothesis. Using the same method, we improve the bounds supplied by Fourier decay and Plancherel at intermediate support scales and derive new almost-every-pin distance estimates in $\mathbb{F}_p^4$.

math.CA

Dimension-free estimates for discrete maximal functions over cubes in $\mathbb Z^d$

In this short note, we establish dimension-free $\ell^p(\mathbb Z^d)$ bounds, for all $p\in(1,\infty]$, for the discrete Hardy--Littlewood maximal functions associated with cubes in $\mathbb Z^d$, answering a question that had been open for a while. The key idea is to prove dimension-free bounds for the $\ell^p(\mathbb Z^d)$ norms of the differences of the corresponding averages. This follows from an ad hoc interpretation of the associated discrete multipliers as a special continuous family of multipliers to which basic fractional integration and complex interpolation can be applied. The same method also yields an elementary proof of Bourgain's dimension-free $L^p(\mathbb R^d)$ bounds for the Hardy--Littlewood maximal function associated with cubes in $\mathbb R^d$.

math.CA

Establishing the Polynomial Wolff Axioms for $δ$-Separated $δ$-Tubes With #o-minimality

We establish the full version of a conjecture of Guth and Zahl, giving a lower bound for the volume of a semialgebraic set that has a large intersection with a collection of $δ$-separated $δ$-tubes. Our proof uses o-minimal methods to simplify the proof of Katz and Rogers, who proved the conjecture up to a small factor. We also establish that the constants depend polynomially on the complexity of the semialgebraic set, and more generally in the #o-minimal setting.

math.CA