Greedy Algorithm with Regard to Faber - Schauder System
In the paper is investigated the question of Faber - Schauder subsystems to be quasi-greedy in C[0,1]. It is obtained a necessary condition for Faber - Schauder subsystems to be quazi greedy in C[0,1]. Subsystem with density 0 is constructed, which is not quazi-greedy in C[0,1].