Search arXivSearch

arXiv · 2210.09720

Some remarks on orthogonally additive operators on Riesz spaces

Abstract

We study orthogonally additive operators between Riesz spaces without the Dedekind completeness assumption on the range space. Our first result gives necessary and sufficient conditions on a pair of Riesz spaces $(E,F)$ for which every orthogonally additive operator from $E$ to $F$ is laterally-to-order bounded. Second result provides sufficient conditions on a pair of orthogonally additive operators $S$ and $T$ to have $S \vee T$, as well as to have $S \wedge T$, and consequently, for an orthogonally additive operator $T$ to have $T^+$, $T^-$ or $|T|$ without any assumption on the domain and range spaces. Finally we prove an analogue of Meyer's theorem on the existence of modules of disjointness preserving operator for the setting of orthogonally additive operators.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Olena Fotiy, Vladimir Kadets, Mikhail Popov. 2022-10-18. Some remarks on orthogonally additive operators on Riesz spaces. https://arxiv.org/abs/2210.09720

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

KEEP EXPLORING

Related papers

Sharp embeddings between quasi-Banach Besov spaces and shallow ReLU variation spaces

Let $\mathcal D$ be the normalized ridge dictionary generated by $\operatorname{ReLU}^k$ on a bounded Lipschitz domain $Ω\subset\mathbb R^d$. We establish sharp embeddings between isotropic Besov spaces and the associated variation space $\mathcal L_1(\mathcal D)$ in the quasi-Banach range $0 k+d/p$ for $1<q\le\infty$. A rescaled-bump construction shows that this smoothness threshold is sharp. Conversely, for $0<p<1$, \[ \mathcal L_1(\mathcal D)\hookrightarrow B^{k+1}_{p,2}(Ω), \] and both the smoothness $k+1$ and the fine index $2$ are optimal. The forward embedding converts known Besov regularity, in particular for solutions of partial differential equations, into controlled approximation error bounds and convergence of greedy algorithms based on shallow $\text{ReLU}^k$ neural networks. The proofs combine Littlewood--Paley localization, Fourier--Radon representations, measure-valued derivatives, and vector-valued singular-integral estimates.

math.FA

Polynomial Growth of Complex Polynomial Hardy--Littlewood Constants

We prove polynomial growth bounds for the optimal constants in the complex polynomial Hardy--Littlewood inequality whenever $p\geq c m^2/\log m$, for every fixed $c>0$. This extends the recently established polynomial growth of the complex polynomial Bohnenblust--Hille constants at $p=\infty$ to finite values of $p$. Moreover, when $p/m^2\to\infty$, the Hardy--Littlewood constants are bounded by $(1+o(1))$ times the corresponding Bohnenblust--Hille constants. For real scalars, whenever $p_m/m\to\infty$, the optimal constants satisfy $H^{\rm pol}_{m,p_m}(\mathbb R)=2^{m+o(m)}$.

math.FA

Componentwise and Measure-Sensitive Bounds for One-Dimensional Time-Frequency Localization

We prove explicit upper bounds for the number of eigenvalues of a one-dimensional time-frequency localization operator in an open transition window. An abstract residual-energy principle combines a rank-N approximant with the Hilbert-Schmidt energy of its remainder and retains the strict integer correction imposed by the open threshold. For the Fourier kernel, centered least-squares polynomials, optimized moments, and Chebyshev-Bessel truncations improve or match the diameter-Taylor certificate; on interval blocks the moment envelope gains the exact factor 1/(2N+1). Finite measurable partitions yield best-polynomial matrix and residual-energy bounds, together with two-level threshold allocations that exploit spatial or Fourier-side orthogonality and remain stable under large empty gaps. A complementary defect channel gives a componentwise variational Schatten envelope for finite interval unions. For arbitrary finite-measure hard windows, exact cross-boundary and symmetric-difference formulas give strict transition counting and a certified near-one cluster that can be subtracted from direct counts. We also treat integrable soft masks, a root-sum-square core-tail decomposition, and unbounded windows controlled by moments. An explicit unbounded finite-measure set has all polynomial moments and infinite fractional translation perimeter for every order in (0,1], yet admits an O(log(1/epsilon)/log log(1/epsilon)) certificate. Finally, kernels with finitely many bounded separated phase interactions and finite separated amplitude rank admit factorial, least-squares, Chebyshev-Bessel, span-compressed, and anisotropic-degree bounds. For bounded hard Fourier windows, the final hybrid is no larger than the corresponding earlier certificates proved here; no universal comparison with all regular-domain estimates is asserted.

math.FA