SearcharxivSearch

arXiv subjects

Mikhail I. Ostrovskii

Publications and source records attributed to Mikhail I. Ostrovskii.

At least 19 recordsLinked to original sources

Dvoretzky-type theorem for locally finite subsets of a Hilbert space

The main result of the paper: Given any $\varepsilon>0$, every locally finite subset of $\ell_2$ admits a $(1+\varepsilon)$-bilipschitz embedding into an arbitrary infinite-dimensional Banach space. The result is based on two results which are of independent interest: (1) A direct sum of two finite-dimensional Euclidean spaces contains a sub-sum of a controlled dimension which is $\varepsilon$-close to a direct sum with respect to a $1$-unconditional basis in a two-dimensional space. (2) For any finite-dimensional Banach space $Y$ and its direct sum $X$ with itself with respect to a $1$-unconditional basis in a two-dimensional space, there exists a $(1+\varepsilon)$-bilipschitz embedding of $Y$ into $X$ which on a small ball coincides with the identity map onto the first summand and on a complement of a large ball coincides with the identity map onto the second summand.

math.FA

Finite determination for embeddings into Banach spaces: new proof, low distortion

The main goal of this paper is to improve the result of Ostrovskii (2012) on the finite determination of bilipschitz and coarse embeddability of locally finite metric spaces into Banach spaces. There are two directions of the improvement: (1) Substantial decrease of distortion (from about $3000$ to $3+\ep$) is achieved by replacing the barycentric gluing by the logarithmic spiral gluing. This decrease in the distortion is particularly important when the finite determination is applied to construction of embeddings. (2) Simplification of the proof: a collection of tricks employed in Ostrovskii (2012) is no longer needed, in addition to the logarithmic spiral gluing we use only the Brunel-Sucheston result on existence of spreading models.

math.FA

Cycle spaces: invariant projections and applications to transportation cost

The paper starts with discussion of applications of cycle spaces to transportation cost. After a short survey of the known results on cycle spaces, we turn to the study of minimal projections onto cycle spaces in the corresponding $\ell_1$-spaces. This study is naturally related to the study of invariant projections on the cycle space, which, in turn, are determined by the properties of representations of the automorphism group of the corresponding graph. The main focus is on discrete tori and Hamming graphs.

math.FA

Complementability of isometric copies of $\ell_1$ in transportation cost spaces

This work aims to establish new results pertaining to the structure of transportation cost spaces. Due to the fact that those spaces were studied and applied in various contexts, they have also become known under different names such as Arens-Eells spaces, Lipschitz-free spaces, and Wasserstein spaces. The main outcome of this paper states that if a metric space $X$ is such that the transportation cost space on $X$ contains an isometric copy of $\ell_1$, then it contains a $1$-complemented isometric copy of $\ell_1$.

math.FA

Weak$^*$ closures and derived sets for convex sets in dual Banach spaces

The paper is devoted to the convex-set counterpart of the theory of weak$^*$ derived sets initiated by Banach and Mazurkiewicz for subspaces. The main result is the following: For every nonreflexive Banach space $X$ and every countable successor ordinal $α$, there exists a convex subset $A$ in $X^*$ such that $α$ is the least ordinal for which the weak$^*$ derived set of order $α$ coincides with the weak$^*$ closure of $A$. This result extends the previously known results on weak$^*$ derived sets by Ostrovskii (2011) and Silber (2021).

math.FA

Isometric structure of transportation cost spaces on finite metric spaces

The paper is devoted to isometric Banach-space-theoretical structure of transportation cost (TC) spaces on finite metric spaces. The TC spaces are also known as Arens-Eells, Lipschitz-free, or Wasserstein spaces. A new notion of a roadmap pertinent to a transportation problem on a finite metric space has been introduced and used to simplify proofs for the results on representation of TC spaces as quotients of $\ell_1$ spaces on the edge set over the cycle space. A Tolstoi-type theorem for roadmaps is proved, and directed subgraphs of the canonical graphs, which are supports of maximal optimal roadmaps, are characterized. Possible obstacles for a TC space on a finite metric space $X$ preventing them from containing subspaces isometric to $\ell_\infty^n$ have been found in terms of the canonical graph of $X$. The fact that TC spaces on diamond graphs do not contain $\ell_\infty^4$ isometrically has been derived. In addition, a short overview of known results on the isometric structure of TC spaces on finite metric spaces is presented.

math.FA

Analysis on Laakso graphs with application to the structure of transportation cost spaces

This article is a continuation of our article in [Canad. J. Math. Vol. 72 (3), (2020), pp. 774--804]. We construct orthogonal bases of the cycle and cut spaces of the Laakso graph $\mathcal{L}_n$. They are used to analyze projections from the edge space onto the cycle space and to obtain reasonably sharp estimates of the projection constant of $\operatorname{Lip}_0(\mathcal{L}_n)$, the space of Lipschitz functions on $\mathcal{L}_n$. We deduce that the Banach-Mazur distance from TC$(\mathcal{L}_n)$, the transportation cost space of $\mathcal{L}_n$, to $\ell_1^N$ of the same dimension is at least $(3n-5)/8$, which is the analogue of a result from [op. cit.] for the diamond graph $D_n$. We calculate the exact projection constants of $\operatorname{Lip}_0(D_{n,k})$, where $D_{n,k}$ is the diamond graph of branching $k$. We also provide simple examples of finite metric spaces, transportation cost spaces on which contain $\ell_\infty^3$ and $\ell_\infty^4$ isometrically.

math.FA

On relations between transportation cost spaces and $\ell_1$

The present paper deals with some structural properties of transportation cost spaces, also known as Arens-Eells spaces, Lipschitz-free spaces and Wasserstein spaces. The main results of this work are: (1) A necessary and sufficient condition on an infinite metric space $M$, under which the transportation cost space on $M$ contains an isometric copy of $\ell_1$. The obtained condition is applied to answer the open questions asked by Cúth and Johanis (2017) concerning several specific metric spaces. (2) The description of the transportation cost space of a weighted finite graph $G$ as the quotient $\ell_1(E(G))/Z(G)$, where $E(G)$ is the edge set and $Z(G)$ is the cycle space of $G$. This is a generalization of the previously known result to the case of any finite metric space.

math.FA

Bourgain discretization using Lebesgue-Bochner spaces

We study the Lebesgue-Bochner discretization property of Banach spaces $Y$, which ensures that the Bourgain's discretization modulus for $Y$ has a good lower estimate. We prove that there exist spaces that do not have the Lebesgue-Bochner discretization property, and we give a class of examples of spaces that enjoy this property.

math.FA

A characterization of superreflexivity through embeddings of lamplighter groups

We prove that finite lamplighter groups $\{\mathbb{Z}_2\wr\mathbb{Z}_n\}_{n\ge 2}$ with a standard set of generators embed with uniformly bounded distortions into any non-superreflexive Banach space, and therefore form a set of test-spaces for superreflexivity. Our proof is inspired by the well known identification of Cayley graphs of infinite lamplighter groups with the horocyclic product of trees. We cover $\mathbb{Z}_2\wr\mathbb{Z}_n$ by three sets with a structure similar to a horocyclic product of trees, which enables us to construct well-controlled embeddings.

math.FA

Lipschitz free spaces on finite metric spaces

Main results of the paper: (1) For any finite metric space $M$ the Lipschitz free space on $M$ contains a large well-complemented subspace which is close to $\ell_1^n$. (2) Lipschitz free spaces on large classes of recursively defined sequences of graphs are not uniformly isomorphic to $\ell_1^n$ of the corresponding dimensions. These classes contain well-known families of diamond graphs and Laakso graphs. Interesting features of our approach are: (a) We consider averages over groups of cycle-preserving bijections of graphs which are not necessarily graph automorphisms; (b) In the case of such recursive families of graphs as Laakso graphs we use the well-known approach of Grünbaum (1960) and Rudin (1962) for estimating projection constants in the case where invariant projections are not unique.

math.FA

On embeddings of locally finite metric spaces into $\ell_p$

It is known that if finite subsets of a locally finite metric space $M$ admit $C$-bilipschitz embeddings into $\ell_p$ $(1\le p\le \infty)$, then for every $ε>0$, the space $M$ admits a $(C+ε)$-bilipschitz embedding into $\ell_p$. The goal of this paper is to show that for $p\ne 2,\infty$ this result is sharp in the sense that $ε$ cannot be dropped out of its statement.

math.FA

Distortion in the finite determination result for embeddings of locally finite metric spaces into Banach spaces

Given a Banach space $X$ and a real number $α\ge 1$, we write: (1) $D(X)\leα$ if, for any locally finite metric space $A$, all finite subsets of which admit bilipschitz embeddings into $X$ with distortions $\le C$, the space $A$ itself admits a bilipschitz embedding into $X$ with distortion $\le α\cdot C$; (2) $D(X)=α^+$ if, for every $\varepsilon>0$, the condition $D(X)\leα+\varepsilon$ holds, while $D(X)\leα$ does not; (3) $D(X)\le α^+$ if $D(X)=α^+$ or $D(X)\le α$. It is known that $D(X)$ is bounded by a universal constant, but the available estimates for this constant are rather large. The following results have been proved in this work: (1) $D((\oplus_{n=1}^\infty X_n)_p)\le 1^+$ for every nested family of finite-dimensional Banach spaces $\{X_n\}_{n=1}^\infty$ and every $1\le p\le \infty$. (2) $D((\oplus_{n=1}^\infty \ell^\infty_n)_p)=1^+$ for $1<p<\infty$. (3) $D(X)\le 4^+$ for every Banach space $X$ with no nontrivial cotype. Statement (3) is a strengthening of the Baudier-Lancien result (2008).

math.FA

Images of nowhere differentiable Lipschitz maps of $[0,1]$ into $L_1[0,1]$

The main result: for every sequence $\{ω_m\}_{m=1}^\infty$ of positive numbers ($ω_m>0)$ there exists an isometric embedding $F:[0,1]\to L_1[0,1]$ which is nowhere differentiable, but for each $t\in [0,1]$ the image $F_t$ is infinitely differentiable on $[0,1]$ with bounds $\max_{x\in[0,1]}|F_t^{(m)}(x)|\leω_m$ and has an analytic extension to the complex plane which is an entire function.

math.FA

There is no finitely isometric Krivine's theorem

We prove that for every $p\in(1,\infty)$, $p\ne 2$, there exist a Banach space $X$ isomorphic to $\ell_p$ and a finite subset $U$ in $\ell_p$, such that $U$ is not isometric to a subset of $X$. This result shows that the finite isometric version of the Krivine theorem (which would be a strengthening of the Krivine theorem (1976)) does not hold.

math.FA

A new approach to low-distortion embeddings of finite metric spaces into non-superreflexive Banach spaces

The main goal of this paper is to develop a new embedding method which we use to show that some finite metric spaces admit low-distortion embeddings into all non-superreflexive spaces. This method is based on the theory of equal-signs-additive sequences developed by Brunel and Sucheston (1975-1976). We also show that some of the low-distortion embeddability results obtained using this method cannot be obtained using the method based on the factorization between the summing basis and the unit vector basis of $\ell_1$, which was used by Bourgain (1986) and Johnson and Schechtman (2009).

math.FA

Nonexistence of embeddings with uniformly bounded distortions of Laakso graphs into diamond graphs

Diamond graphs and Laakso graphs are important examples in the theory of metric embeddings. Many results for these families of graphs are similar to each other. In this connection, it is natural to ask whether one of these families admits uniformly bilipschitz embeddings into the other. The well-known fact that Laakso graphs are uniformly doubling but diamond graphs are not, immediately implies that diamond graphs do not admit uniformly bilipschitz embeddings into Laakso graphs. The main goal of this paper is to prove that Laakso graphs do not admit uniformly bilipschitz embeddings into diamond graphs.

math.MG