Mathematical Physics
Magnetic Hardy inequalities with singular integral weights
Hynek Kovarik and Pier Cristoforo Rossaro
In this paper we present Hardy type inequalities for
magnetic Dirichlet forms with singular integral weights. We analyze the local and global optimality of the integral weight and discuss several examples in details. An application of our results to spectral estimates for
magnetic Schrödinger operators is provided as well.
Read the full abstract ▾
Differential Geometry
On the long time behavior of ancient homogeneous Ricci flows
Anusha M. Krishnan and Francesco Pediconi
We prove a precompactness
theorem for invariant metrics on compact homogeneous spaces without injectivity radius bounds, assuming uniform bounds on the diameter and on all derivatives of the
curvature tensor. As a consequence, we prove that every ancient homogeneous
Ricci flow on a compact
manifold admits a blow-down sequence that converges to a gradient shrinking
Ricci soliton.
Read the full abstract ▾
Analysis of PDEs
On the Robin problem for the Laplace equation in multiply connected domains
Alberto Cialdea and Vita Leonessa
This paper complements the existing theory developed in [5] for the Dirichlet and Neumann problems for the Laplace equation, in multiply connected domains. Within the framework of layer potential methods, we study the Laplace equation under Robin boundary conditions, representing the solutions by means of a double layer potential. We observe that the classical approach searches the solutions in terms of a single layer potential.
Read the full abstract ▾
Optimization and Control
Reinforcement Learning in Real Option Models
Jodi Dianetti, Giorgio Ferrari and Renyuan Xu
We investigate an
entropy-regularized reinforcement learning (RL) approach to optimal stopping problems motivated by real option models. Classical stopping rules are strict and non-randomized, limiting natural exploration in RL settings. To address this, we introduce
entropy regularization, allowing randomized stopping policies that balance exploitation and exploration. We derive an explicit analytical solution to the regularized problem and prove convergence of the associated free boundary to the classical stopping threshold as the
entropy vanishes. The regularized problem admits a natural formulation as a singular
stochastic control problem. Building on this structure, we propose both model-based and model-free policy iteration
algorithms to learn the optimal boundary. The model-free method operates without knowledge of system dynamics, using only trajectories from the
stochastic environment. We establish convergence guarantees and illustrate strong numerical performance. This framework provides a principled and tractable approach for data-driven stopping problems under uncertainty.
Read the full abstract ▾
Number Theory
On the discriminant and index of a certain class of polynomials
Rupam Barman, Anuj Narode and Vinay Wagh
Let $f(x) = (x^{2}+1)^{n} - a x^{n} \in \mathbb{Z}[x]$ and assume $f(x)$ is irreducible. Let $\theta$ be a root of $f(x)$, set $K= \mathbb{Q}(\theta)$, and denote by $\mathbb{Z}_{K}$ the ring of integers of $K$. The index of $f$, denoted $\operatorname{ind}(f)$, is the index of $\mathbb{Z}[\theta]$ in $\mathbb{Z}_{K}$. A
polynomial $f(x)$ is said to be monogenic if $\operatorname{ind}(f) = 1$. In this article, we explicitly compute the discriminant of the
polynomial $f(x)$, and then derive necessary and sufficient conditions on the parameters $a$ and $n$ for $f(x)$ to be monogenic. Furthermore, we provide a complete description of the
primes that divide $\operatorname{ind}(f)$.
Read the full abstract ▾
Geometric Topology
Cubical structures and the large-scale geometry of graph braid groups
Byung Hee An and Sangrok Oh
We study the large-scale geometry of graph braid groups through the cubical structure of their unordered discrete configuration spaces, focusing on quasi-isometry to right-angled Artin groups (RAAGs). We first give a complete classification of graph braid groups quasi-isometric to free groups. For the $2$-braid group on a graph $\Gamma$, we study the union $UP_2(\Gamma)$ of maximal product subcomplexes of the associated unordered discrete configuration space. We introduce a hierarchy recording
geometric and algebraic properties of this inclusion and identify conditions under which the quasi-isometry type of its fundamental group is determined by that of the ambient braid group. For normal bunches of grapes, a class of graphs obtained by attaching cycles to trees, this fundamental group is a one-ended free factor, and the quasi-isometry classification of the braid groups reduces to that of these factors. Using the combinatorics of the underlying trees and the associated intersection complexes, we obtain a graph-theoretic sufficient condition and new obstructions for quasi-isometry to RAAGs, yielding infinite families of non-
hyperbolic examples and nonexamples. We also construct infinitely many graph $2$-braid groups
hyperbolic relative to a thick proper subgroup not isomorphic to any braid group with at most two particles on a subgraph of the underlying graph.
Read the full abstract ▾
Numerical Analysis · Cross-listed from physics.comp-ph
Neural-POD: A Plug-and-Play Neural Operator Framework for Infinite-Dimensional Functional Nonlinear Proper Orthogonal Decomposition
Changhong Mou, Binghang Lu and Guang Lin
AI for science (AI4Science) models often suffer from discretization: learned representations remain tied to the training grid, limiting transfer across resolutions, solvers and applications. We introduce Neural Proper Orthogonal Decomposition (Neural-POD), a plug-and-play neural operator that learns nonlinear, orthogonal basis functions directly in function space and can be integrated in both projection-based reduced order models and operator-learning frameworks such as DeepONet. Neural-POD replaces SVD-derived, resolution-dependent linear modes with continuous, resolution-invariant bases learned via sequential residual minimization, analogous to Gram-Schmidt orthogonalization. The framework supports training under task-specific norms (e.g., $L^2$, $L^1$), improves out-of-distribution generalization to unseen parameter regimes, and captures nonlinear structure in complex systems. Because the learned bases are interpretable and reusable, Neural-POD serves as a general representation module for AI4Science workflows. We demonstrate Neural-POD on Burgers' and Navier-Stokes equations.
Read the full abstract ▾
Algebraic Geometry
Steenrod operations and symplectic arithmetic duality
Tony Feng
This expository article elaborates upon my talk at the 2025 AMS Summer Institute on Algebraic Geometry. It gives an introduction to a
conjecture from Tate's 1966 Séminaire Bourbaki report, predicting the existence of a
symplectic form on Brauer groups of surfaces over finite fields, and then an informal tour of the proof in \cite{Feng20} and \cite{CF}.
Read the full abstract ▾
Mathematical Physics · Cross-listed from eess.SP
Passive Imaging with Ambient Noise Under Wave Speed Mismatch: Mathematical Analysis and Wave Speed Estimation
Zetao Fei and Josselin Garnier
It is known that waves generated by ambient noise sources and recorded by passive receivers can be used to image the reflectivities of an unknown medium. However, reconstructing the reflectivity of the medium from partial boundary measurements remains a challenging problem, particularly when the background wave speed is unknown. In this paper, we investigate passive correlation-based imaging in the daylight configuration, where uncontrolled noise sources illuminate the medium and only ambient fields are recorded by a sensor array. We first analyze daylight migration for a point reflector embedded in a homogeneous background. By introducing a searching wave speed into the migration functional, we derive an explicit characterization of the deterministic shift and defocusing effects induced by wave-speed mismatch. We show that the maximum of the envelope of the resulting functional provides a reliable
estimator of the true wave speed. We then extend the analysis to a random medium with correlation length smaller than the wavelength. Leveraging the shift formula obtained in the homogeneous case, we introduce a virtual guide
star that remains fixed under migration with different searching speeds. This property enables an effective wave-speed estimation strategy based on spatial averaging around the virtual guide
star. For both homogeneous and random media, we establish resolution analyses for the proposed wave-speed
estimators. Numerical experiments are conducted to validate the theoretical result.
Read the full abstract ▾
Combinatorics
Integral and arithmetic structures of alternating (zigzag) numbers $A_n$
Jean-Christophe Pain
The alternating (zigzag) numbers $A_n$, counting the ascending alternating permutations of $\left\{1,\cdots,n\right\}$ and defined by the exponential generating function $\tan x+\sec x$, admit several classical combinatorial and analytic representations. In this work we unify and extend three complementary structures of $A_n$. First, starting from the Stirling number expansion of zigzag numbers, we derive a contour integral representation, as well as a positive Laplace-type integral representation $$ A_n = 2^n \int_0^\infty e^{-y} f_n(y)\, dy, \qquad f_n(y) := \sum_{k=0}^{n} (-1)^k S(n,k) \left(\frac{y}{2}\right)^k, $$ where the kernel $f_n(y)$ is the
polynomial generating function of Stirling numbers. A continuous interpolation of the discrete product (falling factorial) is introduced subsequently. This provides a direct analytic bridge between set partitions and Laplace asymptotics. Second, using the partial fraction expansion of $\tan$, we obtain the well-known
hyperbolic integral representation $$ A_{2n+1}=\frac{1}{\pi}\int_0^\infty\frac{y^{2n+1}}{\sinh(y/2)}\,dy, $$ equivalently expressed in classical $\cosh$ form for $A_{2n}$. This representation interprets zigzag numbers as spectral moments associated with half-integer poles. The connection with
Fourier analysis and Mellin transforms is also outlined. Finally, combining spectral expansions with Stirling identities, we derive congruence relations modulo
primes for $A_n$. These results exhibit a dual analytic-combinatorial structure of zigzag numbers, linking partition expansions, trigonometric spectra, and arithmetic properties.
Read the full abstract ▾
Analysis of PDEs
Completeness theorems on the boundary for a parabolic equation
Alberto Cialdea and Carmine Sebastiano Mare
Let $\{v_{\alpha}\}$ be a system of
polynomial solutions of the
parabolic equation $a_{hk}\partial_{x_{h}x_{k}}u - \partial_t u =0$ in a bounded $C^1$-cylinder $\Omega_{T}$ contained in $\mathbb{R}^{n+1}$. Here $a_{hk}\partial_{x_{h}x_{k}}$ is an
elliptic operator with real constant coefficients. We prove that $\{v_{\alpha}\}$ is complete in $L^{p}(\Sigma')$, where $\Sigma'$ is the
parabolic boundary of $\Omega_{T}$. Similar results are proved for the adjoint equation $a_{hk}\partial_{x_{h}x_{k}} u+ \partial_t u =0$.
Read the full abstract ▾
Algebraic Geometry
Partial desingularization up to normal-crossings in characteristic 0 and 2
Dan Abramovich and Michael Temkin
We address the question of normal-crossings-preserving resolution of singularities (NC-preserving resolution), and compare the cases of characteristic 0 and characteristic 2. In characteristic 0, it is shown by Belotto da Silva and Bierstone arxiv:2602.09114 and Włodarczyk arxiv:2602.14266 that, if one allows to introduce stack theoretic weighted blowups, any variety over a field of characteristic 0 admits a normal crossings resolution. We provide a principle that makes such results possible,
Theorem 3.1.4. We further show that the coarse
moduli space can be restricted to have higher pinch points (Definition 1.3.2), see
Theorem 1.3.3. In contrast, in characteristic 2 we classify pinch points, and show that weighted blowups cannot lead to NC-preserving resolution of pinch points, although a pinch point is always the coarse
moduli space of a NC stack (
Theorem 1.4.1).
Read the full abstract ▾
Optimization and Control · Cross-listed from cs.LG
Symbolic recovery of PDEs from measurement data
Erion Morina, Philipp Scholl and Martin Holler
Models based on partial differential equations (PDEs) are powerful for describing a wide range of complex phenomena in the natural sciences. Accurately identifying the PDE model, which represents the underlying physical law, is essential for a proper understanding of the problem. This reconstruction typically relies on indirect and noisy measurements of the system's state and, without specifically tailored methods, rarely yields symbolic expressions, thereby limiting interpretability. In this work, we address this limitation by considering neural network architectures based on rational functions for the symbolic representation of physical laws. These networks combine the approximation power of rational functions with the flexibility to represent arithmetic operations, and generalize ParFam and EQL-type architectures used in symbolic regression for physical law learning. We further establish regularity results for these symbolic networks. Our main contribution is a reconstruction result showing that, if there exists an admissible physical law that is expressible within the symbolic network architecture, then in the limit of noiseless and complete measurements, symbolic networks recover a physical law within the PDE model that is representable by the architecture. Moreover, the recovered law corresponds to a regularization-minimizing parameterization, promoting interpretability and sparsity in case of $L^1$-regularization. Under an additional identifiability condition, the unique true physical law is recovered. These reconstruction and regularity results are derived at the continuous level prior to discretization due to a formulation in function space. Empirical results using the ParFam architecture are consistent with the theoretical findings and suggest the feasibility of reconstructing interpretable physical laws in practice.
Read the full abstract ▾
Analysis of PDEs
Uniqueness and Zeroth-Order Analysis of Weak Solutions to the Non-cutoff Boltzmann equation
Dingqun Deng and Shota Sakamoto
We establish the uniqueness of large solutions to the non-cutoff Boltzmann equation with moderate soft potentials. Specifically, the weak solution $F=\mu+\mu^{\frac{1}{2}}f$ is unique as long as it has finite energy, in the sense that the norm $\|f\|_{L^\infty_t L^{r}_{x,v}}+\|f\|_{L^\infty_t L^2_{x,v}}$ remains bounded for some sufficiently large $r>0$. As a byproduct, we establish $L^2_{t,x,v}$ stability for initial data $f_0\in L^r_{x,v}\cap L^2_{x,v}$. Our approach employs dilated dyadic decompositions in phase space $(v,\xi,\eta)$ to capture hypoellipticity and to reduce the fractional derivative structure $(-\Delta_v)^{s}$ of the Boltzmann collision operator to zeroth order. The difficulties posed by the large solution are overcome through the negative-order hypoelliptic estimate that gains integrability in $(t,x)$.
Read the full abstract ▾
Algebraic Geometry
Hyperbolicity of Fermat-type curves and their complements
Anh Tuan Nguyen
In this paper, by using the generalized Borel
theorems in $\mathbb{CP}^2$, we show the hyperbolicity of Fermat type curves and their complement in $\mathbb{CP}^2$. This improves Noguchi-Shirosaki's and Demailly-El Goul's degree bounds.
Optimization and Control
BORWin: Exact algorithm based on a Bi-Objective Relaxation for Window-constrained problems
Christian Artigues, Pascale Bendotti, Alexandre Heintzmann et al. (+2 more)
A mixed integer maximization problem involving several additional constraints defined with both a lower and an upper bound is considered. It is assumed that one of such constraints is more restrictive than the others. As it can be seen as a resource window constraint, it defines the so-called window-constrained problem. From a bi-objective perspective, a 2-phase
algorithm, called BORWin, is devised. It stands for Bi-Objective Relaxation for Window-constrained problems. The first phase is generic for any window-constrained problem and provides a family of upper bounds based on a bi-objective relaxation of the additional constraints. It is shown that the latter bounds strongly relate to the Lagrangian dual bounds. The second phase is derived for a variant involving a graph structure, namely the window-constrained longest-path problem on an acyclic graph. The aim is to take advantage of the upper bounds to devise an efficient label extension
algorithm. It is shown that complementary upper bounds could be derived to further improve performance in some special cases. A typical example is when the additional constraints have special knapsack structures. This is the case for the Hydro-Unit Commitment problem with a single plant (1-HUC). From numerical experiments for the 1-HUC, BOR-Win appears to be very efficient compared to state-of-the-art approaches.
Read the full abstract ▾
All authors Christian Artigues, Pascale Bendotti, Alexandre Heintzmann, Sandra Ulrich Ngueveu, Cécile Rottner
Statistics Theory
Adjusted Scores for Discrete Langevin Algorithms
Armand Gissler, Saeed Saremi and Francis Bach
Sampling from discrete distributions is a ubiquitous task in machine learning, recently revisited by the emergence of discrete
diffusion models. While Langevin
algorithms constitute the state of the art for continuous spaces, discrete versions lack similar theoretical guarantees when the step-size becomes small. In this paper, we address this limitation by interpreting discrete sampling
algorithms as discretizations of continuous-time dynamics on the hypercube. In particular, we describe several score functions for discrete
algorithms which result in approximations of Glauber dynamics for the correct target distribution. We also compute upper bounds for the contraction of these
algorithms, with or without Metropolis adjustment.
Read the full abstract ▾
Statistics Theory
Optimal detection of planted stars via a random energy model
Ijay Narang, Will Perkins and Timothy L. H. Wee
We study the problem of detecting a planted
star in the Erdős–Rényi random graph $G(n,m)$, formulated as a hypothesis test. We determine the scaling window for critical detection in $m$ in terms of the
star size, and characterize the asymptotic total variation distance between the null and alternative hypotheses in this window. In the course of the proofs we show a condensation phase transition in the likelihood ratio that closely resembles that of the random energy model from
spin glass theory.
Read the full abstract ▾
General Topology
The lattice of smooth sublocales as a Bruns-Lakser completion
Igor Arrieta and Anna Laura Suarez
We characterise the frame morphisms $f:L\to M$ that lift to frame maps $\overline{f}:\mathsf{S}_b(L)\to \mathsf{S}_b(M)$, where $\mathsf{S}_b(L)$ is the collection of joins of complemented sublocales of a frame $L$, or equivalently the Booleanization of the collection $\mathsf{S}(L)$ of all its sublocales. We do so by proving that $\mathsf{S}_b(L)$ is isomorphic to the Bruns–Lakser completion of the meet-semilattice formed by the locally closed sublocales, i.e. the sublocales of the form $\mathfrak{c}(a)\cap \mathfrak{o}(b)$ for $a,b\in L$.
Read the full abstract ▾
Rings and Algebras
Semisimplifying Frank Lie algebras
Michiel Smet
The Frank Lie
algebras are simple Lie
algebras that only occur over fields of characteristic 3. These come equipped with distinguished inner derivations that make them
algebras in the category $\textbf{Rep}(\alpha_3)$. We apply the semisimplification functor to these Frank Lie
algebras and obtain modular contact Lie superalgebras. We also obtain a class of simple $J$-ternary
algebras whose associated Jordan
algebras are not simple.
Read the full abstract ▾
Metric Geometry
Urysohn Width and Surgeries
Aleksandr Berdnikov and Brendan Isley
We analyze the behavior of Urysohn width of
manifolds under a connected sum operation, specifically, bounding widths of summands in terms of widths of the sum and vice versa. Our methods also apply to the universal covers of these spaces, and to more general type of surgeries. Lastly, we provide examples that show the optimality of constants in our estimates.
Read the full abstract ▾
Statistics Theory · Cross-listed from stat.ME
Fixed-Horizon Self-Normalized Inference for Adaptive Experiments via Martingale AIPW/DML with Logged Propensities
Gabriel Saco
Adaptive randomized experiments update treatment probabilities as data accrue, but still require an end-of-study interval for the average treatment effect (ATE) at a prespecified horizon. Under adaptive assignment, propensities can keep changing, so the predictable quadratic variation of AIPW/DML score increments may remain random. When no deterministic variance limit exists, Wald statistics normalized by a single long-run variance target can be conditionally miscalibrated given the realized variance regime. We assume no interference, sequential randomization, i.i.d. arrivals, and executed overlap on a prespecified scored set, and we require two auditable pipeline conditions: the platform logs the executed randomization probability for each unit, and the nuisance regressions used to score unit $t$ are constructed predictably from past data only. These conditions make the centered AIPW/DML scores an exact martingale difference sequence. Using self-normalized martingale limit theory, we show that the Studentized statistic, with variance estimated by realized quadratic variation, is asymptotically N(0,1) at the prespecified horizon, even without variance stabilization. Simulations validate the theory and highlight when standard fixed-variance Wald reporting fails.
Read the full abstract ▾
Optimization and Control
Stochastic Games on Large Sparse Graphs
Eyal Neuman and Sturmius Tuschmann
We introduce a framework for
stochastic games on large sparse graphs, covering continuous-time and discrete-time dynamic games as well as static games. Players are indexed by the vertices of simple, locally finite graphs, allowing both finite and countably infinite populations, with asymptotics described through local weak convergence of marked graphs. The framework allows path-dependent utility functionals that may be heterogeneous across players. Under a contraction condition, we prove existence and uniqueness of Nash
equilibria and establish exponential decay of correlations with graph distance. We further show that global
equilibria can be approximated by truncated local games, and can even be reconstructed exactly on subgraphs given information on their boundary. Finally, we prove convergence of Nash
equilibria along locally weakly convergent graph sequences, including sequences sampled from hyperfinite unimodular random graphs.
Read the full abstract ▾
Classical Analysis and ODEs
A Counterexample to Matkowski's Conjecture for Quasi Graph-Additive Functions
Tibor Kiss
In this paper we investigate a
conjecture of Janusz Matkowski concerning the continuous solutions of the functional equation \[ f\big(f(-x)+x\big)=f\big(-f(x)\big)+f(x),\qquad x\in\mathbb{R}. \] Matkowski conjectured that all continuous solutions must necessarily be linear on both the negative and the positive half-line. We show, however, that the family of continuous solutions to the equation in question is far richer than anticipated: there exist continuous solutions that admit an arbitrary part. In addition, we provide a sufficient condition which, in the continuous setting, enforces the conclusion predicted by Matkowski's
Conjecture.
Read the full abstract ▾
General Topology
Homeomorphisms between compact subsets of real numbers
Sławomir Kusiński and Szymon Plewik
We first present a reduction of properties of compact sets of real numbers to properties of countable orders. Then discuss a variant of homogeneity of compact subsets of real numbers, focusing on the family of $t$-sets. Finally, we prove that there are exactly $\omega_1$ many non-homeomorphic $t$-sets.
Read the full abstract ▾
Classical Analysis and ODEs
Improved regularity for a composite functional equation stemming from the theory of means
Tibor Kiss and Péter Tóth
In this paper we describe the solutions of the functional equation \begin{equation*} F\Big(\frac{x+y}2\Big)+f_1(x)+f_2(y)=G \big(g_1(x)+g_2(y)) \end{equation*} defined on an open subinterval of $ \mathbb{R} $. Improving previous results we assume differentiability on each involved function, eliminate a former condition on $ g'_1 $ and $ g'_2$, moreover we determine a brand new family of solutions. We also present a particular member of this class as an example. In order to achieve this, we strengthen known results about certain auxiliary functional equations as well.
Read the full abstract ▾
Optimization and Control · Cross-listed from stat.ML
Functional Central Limit Theorem for Stochastic Gradient Descent
Kessang Flamand and Victor-Emmanuel Brunel
We study the asymptotic shape of the trajectory of the
stochastic gradient descent
algorithm applied to a convex objective function. Under mild regularity assumptions, we prove a functional central limit
theorem for the properly rescaled trajectory. Our result characterizes the long-term fluctuations of the
algorithm around the minimizer by providing a
diffusion limit for the trajectory. In contrast with classical central limit
theorems for the last iterate or Polyak-Ruppert averages, this functional result captures the temporal structure of the fluctuations and applies to non-smooth settings such as robust location estimation, including the
geometric median.
Read the full abstract ▾
Metric Geometry · Cross-listed from physics.flu-dyn
Novel distance-based masking and adaptive alpha-shape methods for CNN-ready reconstruction of arbitrary 2D CFD flow domains
Mehran Sharifi, Gorka S. Larraona and Alejandro Rivas
Interpolating scattered CFD
datasets onto a uniform Cartesian grid can distort the true geometry, producing a convex-hull type envelope and activating nonphysical regions. This work presents a reconstruction framework that recovers physically consistent masks before exporting CNN-ready fields. It introduces two novel strategies, distance-based masking and an adaptive alpha-shape formulation that normalizes alpha using local data resolution, and evaluates them against classical alpha-shape boundary recovery. A quantitative,
topology-aware metric suite is introduced to assess retention, suppression of unsupported regions, overlap consistency, and connectivity. The novel distance-based method is robust across the geometries considered under the same threshold rule, with tau set to the minimum CFD grid spacing, and achieves 500-800 times speedups over classical alpha-shapes. The adaptive alpha-shape remains stable when its control parameter is set to 1 and is 1.7-2.6 times faster than the classical variant, which requires geometry-specific alpha tuning. A lightweight boundary inflation post-process using a minimal dilation further improves retention by up to 2.96% with negligible unsupported activation (less than 0.08%). Overall, the distance-based method is recommended as the default due to its accuracy, stability, minimal tuning, and low cost, while the adaptive alpha-shape is a strong alternative when grid-spacing information for threshold selection is unavailable. A companion web application operationalizes the workflow end to end, enabling 2D ASCII
dataset upload, parameter tuning, mask and boundary generation, and export of CNN-ready outputs.
Read the full abstract ▾
Classical Analysis and ODEs
A lower bound for a variation norm operator associated with circular means
David Beltran, Anthony Carbery, Luz Roncal et al. (+1 more)
We prove that a local $L^p(V_2)$ variation norm estimate fails for circular means in two dimensions, and quantify this failure by proving lower bounds for functions of exponential type. This is related to lower bounds for
Fourier multipliers supported on annuli, of the type considered by Córdoba.
Read the full abstract ▾
All authors David Beltran, Anthony Carbery, Luz Roncal, Andreas Seeger
Metric Geometry
Mazur-Ulam Theorem With Gromov-Hausdorff Distance
S.A. Bogaty and A.A. Tuzhilin
It is shown that two
Banach spaces are linearly isometric if and only if the Gromov–Hausdorff distance between them is finite, in particular, zero. The proof is compilative and relies on results obtained by many researchers on the approximability of almost-surjective almost-isometries by linear surjective isometries. In the finite-dimensional case, previously obtained by I.~Mikhailov, a simpler proof under weaker assumptions is given. In the finite-dimensional case, a criterion for isometry in terms of finite (compact) subsets is also given.
Read the full abstract ▾