We continue with the study of greedy-type bases in quasi-Banach spaces started in [3]. In this paper, we study partially-greedy bases focusing our attention in two main results:
-Characterization of partially-greedy bases in quasi-Banach spaces in terms of quasi-greediness and different conservative-like properties.
-Given a $C$-partially-greedy basis in a quasi-Banach space, there exists a "renorming" such that the basis is $1$-partially-greedy.
The aim of this paper is to show that almost greedy bases induce tighter embeddings in superreflexive Banach spaces than in general Banach spaces. More specifically, we show that an almost greedy basis in a superreflexive Banach space $\mathbb{X}$ induces embeddings that allow squeezing $\mathbb{X}$ between two superreflexive Lorentz sequence spaces that are close to each other in the sense that they have the same fundamental function.
Our aim is to investigate the properties of existence and uniqueness of greedy bases in Banach spaces. We show the non-existence of greedy basis in some Nakano spaces and Orlicz sequence spaces and produce the first-known examples of non-trivial spaces (i.e., different from $c_0$, $\ell_1$, and $\ell_2$) with a unique greedy basis.
We shall present a new characterization of greedy bases and 1-greedy bases in terms of certain functionals defined using distances to one dimensional subspaces generated by the basis. We also introduce a new property that unifies the notions of unconditionality and democracy and allows us to recover a better dependence on the constants.
We obtain Lebesgue-type inequalities for the greedy algorithm for arbitrary complete seminormalized biorthogonal systems in Banach spaces. The bounds are given only in terms of the upper democracy functions of the basis and its dual. We also show that these estimates are equivalent to embeddings between the given Banach space and certain discrete weighted Lorentz spaces. Finally, the asymptotic optimality of these inequalities is illustrated in various examples of non necessarily quasi-greedy bases.
The general problem addressed in this work is the development of a systematic study of the thresholding greedy algorithm for general biorthogonal systems (also known as Markushevich bases) in quasi-Banach spaces from a functional-analytic point of view. We revisit the concepts of greedy, quasi-greedy, and almost greedy bases in this comprehensive framework and provide the (nontrivial) extensions of the corresponding characterizations of those types of bases. As a by-product of our work, new properties arise, and the relations amongst them are carefully discussed.
It is known that for a conditional quasi-greedy basis $\mathcal{B}$ in a Banach space $\mathbb{X}$, the associated sequence $(k_{m}[\mathcal{B}])_{m=1}^{\infty}$ of its conditionality constants verifies the estimate $k_{m}[\mathcal{B}]=\mathcal{O}(\log m)$ and that if the reverse inequality $\log m =\mathcal{O}(k_m[\mathcal{B}])$ holds then $\mathbb{X}$ is non-superreflexive. Indeed, it is known that a quasi-greedy basis in a superreflexive quasi-Banach space fulfils the estimate $k_{m}[\mathcal{B}]=\mathcal{O}(\log m)^{1-ε}$ for some $ε>0$. However, in the existing literature one finds very f…
In [3] it was proved that almost-greedy and semi-greedy bases are equivalent in the context of Banach spaces with finite cotype. In this paper we show this equivalence for general Banach spaces.
It is known that for a conditional quasi-greedy basis $\mathcal{B}$ in a Banach space $\mathbb{X}$, the associated sequence $(k_{m}[\mathcal{B}])_{m=1}^{\infty}$ of its conditionality constants verifies the estimate $k_{m}[\mathcal{B}]=\mathcal{O}(\log m)$ and that if the reverse inequality $\log m =\mathcal{O}(k_m[\mathcal{B}])$ holds then $\mathbb{X}$ is non-superreflexive. However, in the existing literature one finds very few instances of non-superreflexive spaces possessing quasi-greedy basis with conditionality constants as large as possible. Our goal in this article is to fill this gap.…
We use new methods, specific of non-locally convex quasi-Banach spaces, to investigate when the quasi-greedy bases of a $p$-Banach space for $0<p<1$ are democratic. The novel techniques we obtain permit to show in particular that all quasi-greedy bases of the Hardy space $H_p(\mathbb{D})$ for $0<p<1$ are democratic while, in contrast, no quasi-greedy basis of $H_p(\mathbb{D}^d)$ for $d\ge 2$ is, solving thus a problem that was raised in [F. Albiac, J. L. Ansorena, and P. Wojtaszczyk, \textit{Quasi-greedy bases in $\ell_p$ ($0<p<1$) are democratic}, J. Funct. Anal. \textbf{280} (2021), no. 7, 1…
In this paper we study greedy approximation in Banach spaces. We discuss a modification of the Weak Chebyshev Greedy Algorithm, in which steps of the algorithm can be executed imprecisely. Such inaccuracies are represented by both absolute and relative errors, which provides more flexibility for numerical applications. We obtain the conditions on the error parameters that guarantee convergence of the algorithm in all uniformly smooth Banach spaces and prove that these conditions are sharp. Additionally, we discuss the conditions that need to be imposed on a Banach space to guarantee convergenc…
For a conditional quasi-greedy basis $\mathcal{B}$ in a Banach space the associated conditionality constants $k_{m}[\mathcal{B}]$ verify the estimate $k_{m}[\mathcal{B}]=\mathcal{O}(\log m)$. Answering a question raised by Temlyakov, Yang, and Ye, several authors have studied whether this bound can be improved when we consider quasi-greedy bases in some special class of spaces. It is known that every quasi-greedy basis in a superreflexive Banach space verifies $k_{m}[\mathcal{B}]=(\log m)^{1-ε}$ for some $0<ε<1$, and this is optimal. Our first goal in this paper will be to fill the gap in betw…
We shall present new characterizations of partially greedy and almost greedy bases. A new class of basis (which we call reverse partially greedy basis) arises naturally from these characterizations of partially greedy bases. We also give characterizations for $1$-partially greedy and $1$-reverse partially greedy bases.
We construct for each $0<p\le 1$ an infinite collection of subspaces of $\ell_p$ that extend the example from [J. Lindenstrauss, On a certain subspace of $\ell_{1}$, Bull. Acad. Polon. Sci. Sér. Sci. Math. Astronom. Phys. 12 (1964), 539-542] of a subspace of $\ell_{1}$ with no unconditional basis. The structure of this new class of $p$-Banach spaces is analyzed and some applications to the general theory of $\mathcal{L}_{p}$-spaces for $0<p<1$ are provided. The introduction of these spaces serves the purpose to develop the theory of conditional quasi-greedy bases in $p$-Banach spaces for $p<1$…
Given a Banach space X and one of its compact sets F, we consider the problem of finding a good n dimensional space X_n \subset X which can be used to approximate the elements of F. The best possible error we can achieve for such an approximation is given by the Kolmogorov width d_n(F)_X. However, finding the space which gives this performance is typically numerically intractable. Recently, a new greedy strategy for obtaining good spaces was given in the context of the reduced basis method for solving a parametric family of PDEs. The performance of this greedy algorithm was initially analyzed …
We introduce the notion of a \textit{weight-almost greedy} basis and show that a basis for a real Banach space is $w$-almost greedy if and only if it is both quasi-greedy and $w$-democratic. We also introduce the notion of \textit{weight-semi-greedy} basis and show that a $w$-almost greedy basis is $w$-semi-greedy and that the converse holds if the Banach space has finite cotype.
In this paper, motivated by the notion of $w$-Property $(A)$ defined in [2], we introduce the notions of $w$-left Property $(A)$ and $w$-right Property $(A)$. We also introduce the notions of $w$-partially greedy basis (using a characterization of partially greedy basis from [4]) and $w$-reverse partially greedy basis. The main aim of this paper is to study $(i)$ some characterizations of $w$-partially greedy and $w$-reverse partially greedy basis $(ii)$ conditions on the weight sequences when $w$-left Property $(A)$ and (or) $w$-right Property $(A)$ implies $w$-Property $(A)$.
In 2003, S. J. Dilworth et al. ([8]) introduced the notion of almost-greedy (resp. partially-greedy) bases. These bases were characterized in terms of quasi-greediness and democracy (resp. conservativeness). In this paper we will show a new functional characterization of these type of bases in general Banach spaces following the spirit of the characterization of greediness proved in [5].
We show that, for quasi-greedy bases in Hilbert spaces, the associated conditionality constants grow at most as $O(\log N)^{1-ε}$, for some $ε>0$, answering a question by Temlyakov. We show the optimality of this bound with an explicit construction, based on a refinement of the method of Olevskii. This construction leads to other examples of quasi-greedy bases with large $k_N$ in Banach spaces, which are of independent interest.
The goal of this paper is to study the performance of the Thresholding Greedy Algorithm (TGA) when we increase the size of greedy sums by a constant factor $λ\geqslant 1$. We introduce the so-called $λ$-almost greedy and $λ$-partially greedy bases. The case when $λ= 1$ gives us the classical definitions of almost greedy and (strong) partially greedy bases. We show that a basis is almost greedy if and only if it is $λ$-almost greedy for all (some) $λ\geqslant 1$. However, for each $λ> 1$, there exists an unconditional basis that is $λ$-partially greedy but is not $1$-partially greedy. Furthermo…
We study sparse approximation by greedy algorithms. We prove the Lebesgue-type inequalities for the Weak Chebyshev Greedy Algorithm (WCGA), a generalization of the Weak Orthogonal Matching Pursuit to the case of a Banach space. The main novelty of these results is a Banach space setting instead of a Hilbert space setting. The results are proved for redundant dictionaries satisfying certain conditions. Then we apply these general results to the case of bases. In particular, we prove that the WCGA provides almost optimal sparse approximation for the trigonometric system in $L_p$, $2\le p<\infty$…
In this paper, we study the connections between the normality, regularity, full regularity, and chain-complete property in partially ordered Banach spaces. Then, by applying these properties, we prove some fixed point theorems on partially ordered Banach spaces. As applications of these fixed point theorems, we prove the existence of solutions of some integral equations, such as Hammerstein integral equations, in Banach spaces.
In this paper we continue the study of Lebesgue-type inequalities for greedy algorithms. We introduce the notion of strong partially greedy Markushevich bases and study the Lebesgue-type parameters associated with them. We prove that this property is equivalent to that of being conservative and quasi-greedy, extending a similar result given in [9] for Schauder bases. We also give a characterization of 1-strong partial greediness, following the study started in [1,3].
Let $X$ be a Banach space and $\mathcal{K}$ be a compact subset in $X$. We consider a greedy algorithm for finding an $n$-dimensional subspace $V_n\subset X$ which can be used to approximate the elements of $\mathcal{K}$. We are interested in how well the space $V_n$ approximates the elements of $\mathcal{K}$. For this purpose we compare the performance of greedy algorithm measured by $σ_n(\mathcal{K})_X:=\text{dist}(\mathcal{K},V_n)_X$ with the Kolmogorov width $d_n(\mathcal{K})_X$ which is the best possible error one can achieve when approximating $\mathcal{K}$ by $n$-dimensional subspaces. …
We prove thatthe Banach space $(\oplus_{n=1}^\infty \ell_p^n)_{\ell_q}$, which is isomorphic to certain Besov spaces, has a greedy basis whenever $1\leq p \leq\infty$ and $1<q<\infty$. Furthermore, the Banach spaces $(\oplus_{n=1}^\infty \ell_p^n)_{\ell_1}$, with $1<p\le \infty$, and $(\oplus_{n=1}^\infty \ell_p^n)_{c_0}$, with $1\le p<\infty$ do not have a greedy bases. We prove as well that the space $(\oplus_{n=1}^\infty \ell_p^n)_{\ell_q}$ has a 1-greedy basis if and only if $1\leq p=q\le \infty$.
This article closes the cycle of characterizations of greedy-like bases in the isometric case initiated in [F. Albiac and P. Wojtaszczyk, Characterization of $1$-greedy bases, J. Approx. Theory 138 (2006)] with the characterization of $1$-greedy bases and continued in [F. Albiac and J. L. Ansorena, Characterization of $1$-quasi-greedy bases, arXiv:1504.04368v1 [math.FA] (2015)] with the characterization of $1$-quasi-greedy bases. Here we settle the problem of providing a characterization of $1$-almost greedy bases in Banach spaces. We show that a (semi-normalized) basis in a Banach space is al…
We show that a (semi-normalized) basis in a Banach space is quasi-greedy with quasi-greedy constant equal to 1 if and only if it is unconditional with suppression-unconditional constant equal to 1.
In this paper we are concerned with existence results for a coupled system of quadratic functional differential equations. This system is reduced to a fixed point problem for a block operator matrix with nonlinear inputs. To prove the existence we are established some fixed point theorem of Dhage's type for the block matrix operator acting in partially ordered Banach algebras.
The purpose of this paper is to quantify the size of the Lebesgue constants $(L_m)_{m=1}^{\infty}$ associated with the thresholding greedy algorithm in terms of a new generation of parameters that modulate accurately some features of a general basis. This fine-tuning of constants allows us to provide an answer to the question raised by Temlyakov in 2011 to find a natural sequence of greedy-type parameters for arbitrary bases in Banach (or quasi-Banach) spaces which combined linearly with the sequence of unconditionality parameters $(k_m)_{m=1}^{\infty}$ determines the growth of $(L_m)_{m=1}^{\…
We show that for quasi-greedy bases in real Banach spaces the error of the thresholding greedy algorithm of order N is bounded by the best N-term error of approximation times a constant which depends on the democracy functions and the quasi-greedy constant of the basis.
We study the problem of improving the greedy constant or the democracy constant of a basis of a Banach space by renorming. We prove that every Banach space with a greedy basis can be renormed, for a given $\vare>0$, so that the basis becomes $(1+\vare)$-democratic, and hence $(2+\vare)$-greedy, with respect to the new norm. If in addition the basis is bidemocratic, then there is a renorming so that in the new norm the basis is $(1+\vare)$-greedy. We also prove that in the latter result the additional assumption of the basis being bidemocratic can be removed for a large class of bases. Applicat…
This paper is devoted to theoretical aspects on optimality of sparse approximation. We undertake a quantitative study of new types of greedy-like bases that have recently arisen in the context of nonlinear $m$-term approximation in Banach spaces as a generalization of the properties that characterize almost greedy bases, i.e., quasi-greediness and democracy. As a means to compare the efficiency of these new bases with already existing ones in regards to the implementation of the Thresholding Greedy Algorithm, we place emphasis on obtaining estimates for their sequence of unconditionality param…
One classical result in greedy approximation theory is that almost-greedy and semi-greedy bases are equivalent in the context of Schauder bases in Banach spaces with finite cotype. This result was proved by S. J. Dilworth, N. J. Kalton and D. Kutzarova in [7] and, recently, the first author in [2] proved that the condition of finite cotype can be removed in this result. In [11], the authors extend the notion of semi-greediness to the context of weights and proved the following: if w is a weight and $\mathcal B$ is a Schauder basis in a Banach space $\mathbb X$ with finite cotype, then w-semi-g…
We present various estimates for the Lebesgue constants of the thresholding greedy algorithm, in the case of general bases in Banach spaces. We show the optimality of these estimates in some situations. Our results recover and slightly improve various estimates appearing earlier in the literature.
We prove that the sequence spaces $\ell_p\oplus\ell_q$ and the spaces of infinite matrices $\ell_p(\ell_q)$, $\ell_q(\ell_p)$ and $(\bigoplus_{n=1}^\infty \ell_p^n)_{\ell_q}$, which are isomorphic to certain Besov spaces, have an almost greedy basis whenever $0<p<1<q<\infty$. More precisely, we custom-build almost greedy bases in such a way that the Lebesgue parameters grow in a prescribed manner. Our arguments critically depend on the extension of the Dilworth-Kalton-Kutzarova method from [S. J. Dilworth, N. J. Kalton, and D. Kutzarova, On the existence of almost greedy bases in Banach spaces…
Tsirelson's space $\mathcal{T}$ made its appearance in Banach space theory in 1974 soon to become one of the most significant counterexamples in the theory. Its structure broke the ideal pattern that analysts had conceived for a generic Banach space, thus giving rise to the era of pathological examples. Since then, many authors have contributed to the study of different aspects of this special space with an eye on better understanding its idiosyncrasies. In this paper we are concerned with the greedy-type basis structure of $\mathcal{T}$, a subject that had not been previously explored in the …
The list of known Banach spaces whose linear geometry determines the (nonlinear) democracy functions of their quasi-greedy bases to the extent that they end up being democratic, reduces to $c_0$, $\ell_2$, and all separable $\mathcal{L}_1$-spaces. Oddly enough, these are the only Banach spaces that, when they have an unconditional basis, it is unique. Our aim in this paper is to study the connection between quasi-greediness and democracy of bases in nonlocally convex spaces. We prove that all quasi-greedy bases in $\ell_p$ for $0<p<1$ (which also has a unique unconditional basis) are democrati…
We show that for quasi-greedy bases in real or complex Banach spaces the error of the thresholding greedy algorithm of order N is bounded by the best N- term error of approximation times a function of N which depends on the democracy functions and the quasi-greedy constant of the basis. If the basis is democratic this function is bounded by C logN. We show with two examples that this bound is attained for quasi-greedy democratic bases.
Partially greedy bases in Banach spaces were introduced by Dilworth et al. as a strictly weaker notion than the (almost) greedy bases. In this paper, we study two natural ways to strengthen the definition of partial greediness. The first way produces what we call the consecutive almost greedy property, which turns out to be equivalent to the almost greedy property. Meanwhile, the second way reproduces the PG property for Schauder bases but a strictly stronger property for general bases.
The purpose of this paper is to introduce $ω$-Chebyshev-greedy and $ω$-partially greedy approximation classes and to study their relation with $ω$-approximation spaces, where the latter are a generalization of the classical approximation spaces. The relation gives us sufficient conditions of when certain continuous embeddings imply different greedy-type properties. Along the way, we generalize a result by P. Wojtaszczyk as well as characterize semi-greedy Schauder bases in quasi-Banach spaces, generalizing a previous result by the first author.
In this paper, we prove several fixed point theorems on both of normal partially ordered Banach spaces and regular partially ordered Banach spaces by using the normality, regularity, full regularity, and chain -complete property. Then, by applying these theorems, we provide some existence and uniqueness of solutions to some integral equations. We also prove the solvability of some equilibrium problems in Banach spaces.
Garling sequence spaces admit a renorming with respect to which their standard unit vector basis is 1-greedy. We also discuss some additional properties of these Banach spaces related to uniform convexity and superreflexivity. In particular, our approach to the study of the superreflexivity of Garling sequence space provides an example of how essentially non-linear tools from greedy approximation can be used to shed light into the linear structure of the spaces.
In this effort we introduce and analyze a novel reduced basis approach, used to construct an approximating subspace for a given set of data. Our technique, which we call the Natural Greedy Algorithm (NGA), is based on a recursive approach for iteratively constructing such subspaces, and coincides with the standard, and the extensively studied, Orthogonal Greedy Algorithm (OGA) in a Hilbert space. However, for a given set of data in a general Banach space, the NGA is straightforward to implement and overcomes the explosion in computational effort introduced by the OGA, as we utilize an entirely…
In 1999, S. V. Konyagin and V. N. Temlyakov introduced the so-called Thresholding Greedy Algorithm. Since then, there have been many interesting and useful characterizations of greedy-type bases in Banach spaces. In this article, we study and extend several characterizations of greedy and almost greedy bases in the literature. Along the way, we give various examples to complement our main results. Furthermore, we propose a new version of the so-called Weak Thresholding Greedy Algorithm (WTGA) and show that the convergence of this new algorithm is equivalent to the convergence of the WTGA.
We present new results regarding Lebesgue-type inequalities for the Weak Chebyshev Greedy Algorithm (WCGA) in uniformly smooth Banach spaces. We improve earlier bounds in Temlyakov (Forum Math Sigma 2014), for dictionaries satisfying a new property introduced here. We apply these results to derive optimal bounds in two natural examples of sequence spaces. In particular, optimality is obtained in the case of the multivariate Haar system in Lp with 1<p<2, under the Littlewood-Paley norm.
We consider the $X$-Greedy Algorithm and the Dual Greedy Algorithm in a finite-dimensional Banach space with a strictly monotone basis as the dictionary. We show that when the dictionary is an initial segment of the Haar basis in $L_p[0,1]$ ($1 < p < \infty$) then the algorithms terminate after finitely many iterations and that the number of iterations is bounded by a function of the length of the initial segment. We also prove a more general result for a class of strictly monotone bases.
