--- title: Semi-Greedy Bases in Banach Spaces url: https://www.emergentmind.com/topics/semi-greedy-bases type: topic --- # Semi-Greedy Bases in Banach Spaces Searching arXiv for recent and foundational papers on semi-greedy bases, almost-greedy bases, and Schreier-refined greedy notions. Semi-greedy bases are bases for which the greedy choice of support, followed by optimal recomputation of coefficients on that support, yields approximants comparable with best \(m\)-term approximation. In the standard Banach-space setting of a semi-normalized Schauder basis \(\mathcal B=(e_n)\), if \(A_m(x)\) is a greedy set of size \(m\) for \(x\), then a Chebyshev-greedy sum \(\mathcal C\mathcal G_m(x)\) is any best approximant in \(\operatorname{span}\{e_n:n\in A_m(x)\}\), and \(\mathcal B\) is semi-greedy when there exists \(C_{sg}>0\) such that \[ \|x-\mathcal C\mathcal G_m(x)\|\le C_{sg}\,\sigma_m(x),\qquad \forall x,\ \forall m, \] where \(\sigma_m(x)\) is the best unrestricted \(m\)-term approximation error [1902.10986]. A central conclusion of the modern theory is that, for Schauder bases in arbitrary Banach spaces, semi-greediness is equivalent to almost-greediness; weighted and Markushevich-basis extensions preserve this equivalence under the hypotheses stated in the corresponding papers [1804.05730][1902.10986][2111.00693]. ## 1. Definition and algorithmic framework Let \(X\) be a Banach space and \(\mathcal B=(e_n)\) a semi-normalized Schauder basis with biorthogonal functionals \((e_n^*)\). For \(x\in X\), a set \(A_m(x)\subset\mathbb N\) is a greedy set of order \(m\) if \[ |A_m(x)|=m,\qquad \min_{n\in A_m(x)}|e_n^*(x)|\ge \max_{n\notin A_m(x)}|e_n^*(x)|. \] The associated thresholding greedy approximant is \[ G_m(x)=\sum_{n\in A_m(x)} e_n^*(x)e_n. \] Two standard error functionals are \[ \sigma_m(x)=\inf\Bigl\{\Bigl\|x-\sum_{n\in A} a_n e_n\Bigr\|: |A|\le m,\ (a_n)\subset\mathbb F\Bigr\}, \] the best unrestricted \(m\)-term error, and \[ \widetilde{\sigma}_m(x)=\inf\{\|x-P_A(x)\|: |A|=m\}, \] the best coordinate-projection error, where \(P_A(x)=\sum_{n\in A}e_n^*(x)e_n\) [1902.10986]. The Chebyshev version of greedy approximation fixes the greedy support \(A_m(x)\) but reoptimizes the coefficients. A Chebyshev-greedy sum \(\mathcal C\mathcal G_m(x)\) satisfies \[ \|x-\mathcal C\mathcal G_m(x)\| = \min\Bigl\{\Bigl\|x-\sum_{n\in A_m(x)} a_n e_n\Bigr\|:(a_n)_{n\in A_m(x)}\subset\mathbb F\Bigr\}. \] Semi-greediness therefore measures the quality of the greedy support itself, rather than the raw projection \(G_m(x)\). This places the notion between pure support selection and best \(m\)-term approximation in a precise algorithmic sense [1902.10986]. The surrounding classes are defined by progressively weaker comparison principles. A basis is quasi-greedy if greedy sums are uniformly bounded, for instance by \[ \|x-G_m(x)\|\le C_q\|x\|,\qquad \forall x,\ \forall m. \] It is almost greedy if \[ \|x-G_m(x)\|\le C_{ag}\,\widetilde{\sigma}_m(x),\qquad \forall x,\ \forall m. \] It is greedy if the same comparison is made with \(\sigma_m(x)\) rather than \(\widetilde{\sigma}_m(x)\) [1804.05730][1902.10986]. ## 2. Characterizations and equivalence with almost-greedy bases The decisive structural theorem is that semi-greedy and almost-greedy bases coincide for Schauder bases in arbitrary Banach spaces. In the formulation with basis constant \(K_b=\sup_N\|S_N\|\), if \(\mathcal B\) is \(C_q\)-quasi-greedy and \(C_{sd}\)-super-democratic, then \(\mathcal B\) is \(C_s\)-semi-greedy with \[ C_s \le C_q + 4 C_q C_{sd}. \] Conversely, if \(\mathcal B\) is \(C_s\)-semi-greedy, then it is \(C_{sd}\)-super-democratic and \(C_q\)-quasi-greedy, with \[ C_{sd}\le 2(C_sK_b)^2,\qquad C_q\le K_b\bigl(2+3(K_bC_s)^2\bigr). \] Together with the characterization of almost-greedy bases as quasi-greedy plus super-democratic, this yields \[ \text{semi-greedy}\iff \text{almost-greedy} \] for Schauder bases in Banach spaces [1804.05730]. This result removes an earlier finite-cotype hypothesis. The classical theorem stated that almost-greedy and semi-greedy bases were equivalent for Schauder bases in Banach spaces with finite cotype; the later theorem established the equivalence in general Banach spaces [1902.10986][1804.05730]. In particular, semi-greediness is not a genuinely distinct intermediate class in the Banach-space Schauder setting once the full characterization is taken into account. The almost-greedy side of the equivalence is itself structural. A basis is almost-greedy if and only if it is quasi-greedy and democratic; equivalently, quasi-greedy and super-democratic, or quasi-greedy and disjoint-super-democratic [2207.10136]. Combining this with the semi-greedy equivalence produces the standard synthesis: \[ \text{semi-greedy} \iff \text{almost-greedy} \iff \text{quasi-greedy + democratic}. \] This identification is one of the central organizing principles of greedy approximation theory [1804.05730][2207.10136]. ## 3. Weighted and Markushevich extensions Weighted versions replace cardinality by a weight \(w=(w_n)\), with \(w(A)=\sum_{n\in A} w_n\). The weighted best errors are \[ \widetilde{\sigma}_w^\delta(x)=\inf\{\|x-P_A(x)\|: w(A)\le \delta\}, \qquad \sigma_w^\delta(x)=\inf\Bigl\{\Bigl\|x-\sum_{n\in A} a_n e_n\Bigr\|: w(A)\le \delta\Bigr\}. \] A basis is \(w\)-almost-greedy if \[ \|x-\mathcal G_m(x)\|\le C_a\,\widetilde{\sigma}_w^{\,w(A_m(x))}(x), \] and \(w\)-semi-greedy if \[ \|x-\mathcal C\mathcal G_m(x)\|\le C_{sg}\,\sigma_w^{\,w(A_m(x))}(x). \] For Schauder bases in arbitrary Banach spaces, the weighted theory parallels the unweighted one: \(w\)-semi-greediness is equivalent to \(w\)-almost-greediness, and both are equivalent to quasi-greediness plus \(w\)-super-democracy, or quasi-greediness plus \(w\)-disjoint-super-democracy [1902.10986]. More precisely, if \(\mathcal B\) is \(C_{sg}\)-\(w\)-semi-greedy, then it is \(C_q\)-quasi-greedy and \(C_s\)-\(w\)-super-democratic, with \[ C_q \le C_{sg} A_b\bigl(1+(1+A_b)C_{sg}+c_2\bigr), \qquad C_s \le A_b C_{sg}\bigl((1+A_b)C_{sg}+c_2\bigr), \] where \(A_b=\sup_m\|P_m\|\) and \(c_2=\sup_n\{\|e_n\|,\|e_n^*\|\}\). Conversely, quasi-greediness plus \(w\)-super-democracy yields \(w\)-semi-greediness with \[ C_{sg}\le C_q+4C_qC_s, \] and quasi-greediness plus \(w\)-disjoint-super-democracy yields \(w\)-semi-greediness with \[ C_{sg}\le C_q+4C_q^2C_{sd}. \] Thus the weighted equivalence is quantitative as well as qualitative [1902.10986]. The theory also extends beyond Schauder bases to Markushevich bases. In that setting an M-basis is a fundamental minimal system whose biorthogonal functionals are total. Weak \(t\)-greedy sets are defined by \[ |A|=m,\qquad \min_{j\in A}|x_j^*(x)|\ge t\max_{j\notin A}|x_j^*(x)|, \] and this leads to weak weight-semi-greedy and weak weight-almost-greedy notions. The weak weight-almost-greedy property is equivalent to weight almost-greediness, and Theorems 3.22 and 3.23 give conditions under which weak weight semi-greedy Markushevich bases are weight almost greedy. The same work shows that weight semi-greedy Markushevich bases are truncation quasi-greedy and \(w\)-superdemocratic, hence have the \(w\)-Property (A) [2111.00693]. ## 4. Position within the greedy-type hierarchy Semi-greedy bases sit inside a broader hierarchy of greedy-type conditions. Greedy bases compare the raw greedy projection \(G_m(x)\) with \(\sigma_m(x)\). Almost-greedy bases compare \(G_m(x)\) with \(\widetilde{\sigma}_m(x)\). Semi-greedy bases instead compare the Chebyshev improvement on the greedy support with \(\sigma_m(x)\). Quasi-greedy bases ask only for boundedness or convergence of the thresholding greedy approximants [1804.05730][2207.10136]. A useful clarification comes from the theory of partially greedy bases. A basis is partially greedy if \[ \|x-G_m(x)\| \le C\|x-S_m(x)\|, \] and strongly partially greedy if \[ \|x-G_m(x)\| \le C\min_{0\le n\le m}\|x-S_n(x)\|. \] The paper on strengthened partial greediness introduces consecutive almost greedy (CAG) bases by replacing initial segments with arbitrary intervals, and proves that CAG is equivalent to almost-greediness. It also defines super-strong partially greedy bases; for Schauder bases, partially greedy, strong partially greedy, and super-strong partially greedy coincide, but for general bases super-strong partially greedy is strictly stronger than strong partially greedy [2207.10136]. These results sharply separate the various intermediate notions. In particular, the modern equivalence theorems show that semi-greedy is not merely adjacent to almost-greedy; in the Banach-space Schauder setting, and in the Markushevich settings cited above, it is the same class. A common misconception is therefore to treat semi-greedy as permanently distinct from almost-greedy. The earlier finite-cotype theorem and the later general equivalence theorem show that this distinction disappears under the standard hypotheses of the subject [1804.05730][1902.10986]. ## 5. Restricted admissibility, Schreier families, and lower-order refinements A different direction restricts the competitor supports rather than the greedy support. If \(\mathcal F\subset[\mathbb N]^{<\infty}\) is hereditary, a basis is \(\mathcal F\)-greedy when \[ \|x-G_m(x)\| \le C\inf\Bigl\{\Bigl\|x-\sum_{n\in A} a_ne_n\Bigr\|: |A|\le m,\ A\in\mathcal F\Bigr\}, \] and \(\mathcal F\)-almost-greedy when \[ \|x-G_m(x)\| \le C\inf\{\|x-P_A(x)\|: |A|\le m,\ A\in\mathcal F\}. \] These notions are characterized by \(\mathcal F\)-unconditionality together with \(\mathcal F\)-disjoint democracy in the greedy case, and by quasi-greediness together with \(\mathcal F\)-disjoint democracy in the almost-greedy case [2211.01030]. For Schreier families \(\mathcal S_\alpha\), this yields a strict hierarchy: \[ \text{quasi-greedy}\ \Longleftarrow\ \mathcal S_\alpha\text{-greedy}\ \Longleftarrow\ \mathcal S_\beta\text{-greedy}\ \Longleftarrow\ \text{greedy}, \qquad \alpha<\beta, \] and none of these implications can be reversed. Moreover, for each countable ordinal \(\alpha\), there exists a basis that is \(\mathcal S_\alpha\)-greedy but not \(\mathcal S_{\alpha+1}\)-greedy [2211.01030]. This restricted-family formalism is directly relevant to semi-greedy ideas, because it isolates how much admissible-support structure is needed for greedy approximation to remain effective. The 2025 paper on lower-order refinements pushes this further by separating unconditionality and democracy levels. A basis is \((\alpha,\beta)\)-quasi-greedy if it is quasi-greedy, \(\mathcal S_\alpha\)-unconditional but not \(\mathcal S_{\alpha+1}\)-unconditional, and \(\mathcal S_\beta\)-democratic but not \(\mathcal S_{\beta+1}\)-democratic. It constructs \((\alpha,\beta)\)-quasi-greedy bases for all \(\beta\le \alpha+1\), except the previously solved \((0,0)\) case [2504.05533]. That paper explicitly states that it does not define or mention semi-greedy bases, but it places semi-greedy behaviour in a natural broader framework. A plausible implication is that semi-greedy phenomena can be refined by replacing global democracy or unconditionality with Schreier-level analogues, thereby producing ordinally graded versions of the approximation properties usually associated with semi-greedy bases [2504.05533]. ## 6. Quantitative behavior, examples, and open directions Because almost-greedy and semi-greedy coincide in the Banach-space Schauder setting, quantitative constructions of almost-greedy bases automatically supply semi-greedy examples. In particular, the paper on highly conditional almost-greedy and quasi-greedy bases constructs almost-greedy, hence semi-greedy, bases with extremal conditionality behaviour: in non-superreflexive classical spaces it produces examples with \[ k_m[\mathcal B]\approx \log m, \] while in superreflexive spaces it produces, for every \(\varepsilon>0\), almost-greedy bases with \[ k_m[\mathcal B]\sim (\log m)^{1-\varepsilon}. \] These examples show that semi-greedy bases can be highly conditional, up to the sharp logarithmic constraints imposed by quasi-greediness [1803.08351]. Weighted semi-greedy bases also interact strongly with the geometry of the weight. When \(w\in c_0\), the weighted theory can force \(c_0\)-type behaviour. The weighted almost-greedy paper proves, for example, that if \(w\in c_0\) and a basis is \(w\)-almost greedy, then every tail subsequence is uniformly equivalent to the canonical basis of \(c_0\), and every subsequence has a further subsequence equivalent to \(c_0\). Since \(w\)-almost-greedy and \(w\)-semi-greedy coincide under finite cotype and, in the Schauder setting, \(w\)-semi-greedy and \(w\)-almost-greedy are equivalent in arbitrary Banach spaces, these phenomena are part of the weighted semi-greedy landscape as well [1803.02932][1902.10986]. Not every nearby structural condition implies semi-greediness. Bidemocratic bases, for example, retain a strong unconditionality flavor, but they need not be quasi-greedy; for each \(1