An example of an almost greedy uniformly bounded orthonormal basis for Lp(0,1)

被引：15

作者：

Nielsen, Morten ^{[1
,2
]}

机构：

[1] Washington Univ, Dept Math, St Louis, MO 63130 USA

[2] Univ Aalborg, Dept Math Sci, DK-9220 Aalborg, Denmark

来源：

JOURNAL OF APPROXIMATION THEORY | 2007年 / 149卷 / 02期

关键词：

bounded orthonormal systems; Schauder basis; Quasi-greedy basis; almost greedy basis; decreasing rearrangements;

D O I：

10.1016/j.jat.2007.04.011

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

We construct a uniformly bounded orthonormal almost greedy basis for L-p(0.1), 1 < p <infinity. The example shows that it is not possible to extend Orlicz's theorem, stating that there are no uniformly bounded orthonormal unconditional bases for L-p(0.1), p not equal 2, to the class of almost greedy bases. (c) 2007 Elsevier Inc. All rights reserved.

引用

页码：188 / 192

页数：5

共 9 条

[1] Convergence and divergence of decreasing rearranged Fourier series [J].

Cordoba, A ;

Fernandez, P .

SIAM JOURNAL ON MATHEMATICAL ANALYSIS, 1998, 29 (05) :1129-1139

[2] The thresholding greedy algorithm, greedy bases, and duality [J].

Dilworth, SJ ;

Kalton, NJ ;

Kutzarova, D ;

Temlyakov, VN .

CONSTRUCTIVE APPROXIMATION, 2003, 19 (04) :575-597

[3]

KASHIN BS, 1989, TRANSLATIONS MATH MO, V75

[4]

Konyagin S. V., 1999, East J. Approx, V5, P365

[5]

Kostyukovsky S., 1997, J APPL ANAL, V3, P137

[6]

Olevskii A. M., 1975, Results in Mathematics and Related Areas, V86

[7] The best m-term approximation and greedy algorithms [J].

Temlyakov, VN .

ADVANCES IN COMPUTATIONAL MATHEMATICS, 1998, 8 (03) :249-265

[8] Greedy algorithm and m-term trigonometric approximation [J].

Temlyakov, VN .

CONSTRUCTIVE APPROXIMATION, 1998, 14 (04) :569-587

[9] Greedy algorithm for general biorthogonal systems [J].

Wojtaszczyk, P .

JOURNAL OF APPROXIMATION THEORY, 2000, 107 (02) :293-314

← 1 →