Search arXivSearch

arXiv · 2601.09015

Relative uniform completion of a vector lattice

Abstract

In the paper, we revisit several approaches to the concept of uniform completion $X^{\mathrm{ru}}$ of a vector lattice $X$. We show that many of these approaches yield the same result. In particular, if $X$ is a sublattice of a uniformly complete vector lattice $Z$ then $X^{\mathrm{ru}}$ may be viewed as the intersection of all uniformly complete sublattices of $Z$ containing $X$. $X^{\mathrm{ru}}$ may also be constructed via a transfinite process of taking uniform adherences in $Z$ with regulators coming from the previous adherences. If, in addition, $X$ is majorizing in $Z$ then $X^{\mathrm{ru}}$ may be viewed as the uniform closure of $X$ in $Z$. We show that $X^{\mathrm{ru}}$ may also be characterized via a universal property: every positive operator from $X$ to a uniformly complete vector lattice extends uniquely to $X^{\mathrm{ru}}$. Moreover, the class of positive operators here may be replaced with several other important classes of operators (e.g., lattice homomorphisms). We also discuss conditions when the uniform adherence of a sublattice equals its uniform closure, and present an example (based on a construction by R.N. Ball and A.W. Hager) where this fails.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Eugene Bilokopytov, Vladimir G. Troitsky. 2026-06-19. Relative uniform completion of a vector lattice. https://arxiv.org/abs/2601.09015

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

KEEP EXPLORING

Related papers

Metric Poincaré type inequalities and lower bounds on the infimum of the spectrum for graphs

We study metric Poincaré type inequalities on general graphs. We characterize graphs satisfying such inequalities and then turn to the best constants in these inequalities. Invoking suitable metrics we can interpret these constants geometrically as diameters and inradii. Moreover, we can relate them to spectral theory of Laplacians once a probability measure on the graph is chosen. More specifically, we obtain a variational characterization of these constants as infimum over spectral gaps of all Laplacians on the graphs associated to probability measures

math.FA

Natural methods of unsupervised topological alignment

In this paper, we consider methods for the diagonal multi-omics integration of heterogeneous datasets. Several approaches to the nature of biological heterogeneity are analyzed and developed to comprehend more clearly the generated differences. Specifically, the extremal trace problems for the coupled Laplacian on sets homeomorphic to the Stiefel manifold embedded in the complex Euclidean space are investigated. The gradient ascent method for the maximization problem is elaborated in the classical terms of functional analysis, which is of significant interest in itself. On this basis, we introduce a novel characteristic of dataset heterogeneity by employing the norm of the difference between the maximum and minimum points.

math.FA

On Toeplitz operators on compact Abelian groups and discrete Wiener--Hopf operators

This paper introduces the concept of a rotation number for a continuous, non-degenerate two-dimensional vector field (a zero-free complex-valued function) on a compact connected Abelian group. This concept generalizes the notion of a finite rotation number for such groups, previously introduced by the author. Using this concept, a Gohberg-Krein index formula is derived for semi-Fredholm Toeplitz operators with continuous symbols defined on such groups. Criteria for these operators to be semi-Fredholm are established, and their essential spectra are described. As a by-product for the continuous symbol case, conditions for Fredholmness and semi-Fredholmness are established, and the Fredholm index of Wiener-Hopf operators over a linearly ordered discrete Abelian group is calculated in terms of their symbols. Spectral properties-including the spectra and essential spectra-of the Wiener-Hopf operators under consideration are also described.

math.FA