Basic sequence Created 2026-09-24 Updated 2026-09-24
Basis constant Created 2026-09-24 Updated 2026-09-24
The basis constant of a Schauder basis is , where are its basis projections. Uniform boundedness makes this supremum finite.
Basis projection Created 2026-09-24 Updated 2026-10-14
The nth basis projection associated with a Schauder basis is
Block basic sequence 2026-10-14
Relative to a Schauder basis , a block basic sequence consists of nonzero finite combinations supported on successive disjoint coordinate intervals. In the l-p sequence space, disjointly supported vectors of norm one satisfy . Their closed span is consequently isometric to the l-p sequence space.
Block sequence 2026-10-14
Relative to a Schauder basis, a block sequence consists of nonzero finitely supported vectors with successive disjoint supports: . It is a basic sequence, with basis constant at most that of the original basis.
Coordinate functional of a Schauder basis Created 2026-09-24 Updated 2026-09-24
The nth coordinate functional of a Schauder basis is the bounded linear functional .
The norm comparison in bounded distortion of a Banach space is understood up to a positive rescaling of the new norm. Thus, after replacing by if one's convention uses symmetric comparison constants, we may use the following form: for every equivalent norm on a block subspace, a further block subspace and a number satisfy
The number may depend on the norm and the subspace; is fixed. Without this rescaling convention the premise would be impossible, since arbitrarily large scalar multiples of the original norm are equivalent norms. We prove the substantive, scale-invariant assertion for an infinite Schauder basis.
Let be the basis constant of the original basis. Every block sequence has basis constant at most , so its initial, tail and finite interval projections have norms at most , and , respectively. We shall construct increasingly complicated finite unconditional configurations while keeping their unconditional constant fixed at .
First construct the Maurey hierarchy of finite sets. Write , and define
where prepending to the empty set is permitted. For each nonzero countable limit ordinal , fix positive ordinals and put
Induction shows that every family is hereditary and spreading: subsets remain in the family, and increasing any of the coordinates preserves membership. Every nonzero stage contains all singletons. These families are also well-founded as extension trees. At a successor stage, an infinite branch would yield an infinite branch at the previous stage after deleting its first integer. At a limit stage, a hypothetical branch with first integer has every initial segment in the finite union . One family then contains arbitrarily long initial segments, and heredity would give it an infinite branch.
For every infinite set , the extension tree has empty-root rank of a well-founded tree at least . Here is the induction proving this lower bound. At a successor stage fix ; the tree above the node contains a copy of restricted to the infinite tail of after , and hence has rank at least . The root therefore has rank at least . At a limit stage, for every the restriction of to a sufficiently late infinite tail of is contained in . The root rank is consequently at least .
The crucial elementary estimate concerns signed interval projection norms. Given a hereditary family containing all singletons and a basis , define on finitely supported vectors
Choosing one interval containing the support gives . Whenever this supremum is bounded by a multiple of , it extends to a norm on the closed span giving equivalent norms with the original norm.
If is one of the admitted signed interval projections, then
To prove this, test with another admitted operator . The composition is the signed sum of projections onto the nonempty intervals . Colour each intersection according to which of supplies its left endpoint, breaking ties in favour of . In the first colour the list of minima is a subset of , with no repetitions; in the second it is a subset of . Both lists belong to by heredity. Each colour therefore contributes an admitted signed interval projection, and the triangle inequality gives . Taking the supremum over proves the estimate.
Now suppose is an equivalent norm on a block subspace . Apply bounded distortion to obtain a further block basis spanning , with . A signed interval projection relative to , with an admissible list of minima, is the restriction of an admitted signed interval projection relative to . Indeed, replace each interval of block indices by the interval from the first to the last original coordinate of its blocks; its minimum only increases, so the spreading property preserves admissibility. The elementary estimate and the norm comparison therefore give
In particular , with the same for every family to which we apply this procedure.
We prove by transfinite induction that, in every block subspace and for every , there is a normalized block basis for which
For only one interval is permitted, so the initial signed interval projection norm is bounded by . Apply the preceding renorming procedure.
For a successor stage, first choose satisfying the induction hypothesis for . Delete the first interval from any -admissible family. The remaining minima lie in , so
This is an equivalent norm. The renorming procedure produces a further block basis with the constant reset to .
At a limit stage , choose decreasing block subspaces , each with a block basis satisfying the induction hypothesis for . Choose successive normalized . Make each sufficiently far out that its first coordinate in the basis of every , , is at least ; only finitely many restrictions are imposed at each choice. An admissible interval family for belongs to for some . All blocks on which it acts lie in the tail . Transferring its intervals to the basis of increases their minima, so the induction hypothesis gives
Thus is again an equivalent norm, and one more application of bounded distortion resets its bound to . This completes the transfinite induction. The tail-projection factor in this step is important; the diagonal tail need not have the same norm as the original vector.
Finally let be the tree of finite normalized sequences satisfying
for all scalars and all signs. Each finite level is closed in the corresponding power of the unit sphere, since the norm inequalities are closed conditions. The unit sphere of the separable Banach space is a Polish space. An infinite branch is an unconditional basic sequence: sign changes give coordinate projections with norm at most , imply linear independence, and give uniformly bounded initial projections, hence the basis property on the closed span. These projection bounds also give unconditional convergence, including over complex scalars.
For each countable , the block basis constructed above maps the extension tree into by . To check the sign inequality, use the admissible singleton intervals on the vector . Thus the unconditional tree index is at least for every countable ordinal. If were well-founded, the closed-tree result would give it countable height, contradicting these lower bounds. It has an infinite branch. Therefore contains an unconditional basic sequence.
A Schauder basis of a real Banach space is a sequence for which every has a unique norm-convergent expansion . Its basis projection is
and its basis constant is .
For the sequence space in the question, define
Convergence in the definition of makes well defined, and uniqueness of basis coefficients makes it a linear bijection. Moreover,
whereas
Thus is an isomorphism and, in particular, the displayed supremum really is a complete norm on .
The coordinate functional of a Schauder basis is
It is bounded because . On finite linear combinations of the , the nth partial-sum operator is the restriction of , since
The operators have norms at most , so the standard basis criterion shows that the dual sequence of a Schauder basis is a basic sequence in . For every and ,
which is precisely in the weak-star topology.
Suppose now that is a reflexive Banach space. If did not tend to zero, approximation by finite basis blocks would give a bounded block sequence and an such that . Reflexivity gives a weakly convergent subsequence. Every fixed coordinate functional is eventually zero on a block sequence, so its weak limit has every basis coordinate zero and is therefore zero. This contradicts . Hence in norm for every , so the basis is shrinking and is a basis of .
The converse fails. The standard basis of is shrinking because its dual sequence is the standard basis of , but is not reflexive.
Finally assume is a basis of . Map to
For ,
so . Conversely, if and , define
The limit exists: for ,
because is a basis. Also , so and . These two constructions are inverse and satisfy
Thus and are isomorphic.
Relative to a Schauder basis, take the supremum over successive finite intervals whose minima belong to a specified hereditary family , and signs . If this supremum is bounded above by a multiple of the original norm and the family contains all singletons, it gives an equivalent norm. Composing two admitted signed interval projections costs at most a factor of two in this norm: split their nonempty intersections according to which interval supplies the later left endpoint. In each of the two resulting families the minima form a subset of one original list, so heredity preserves admissibility. This estimate lets bounded distortion of a Banach space give a uniform bound independent of the complexity of .
An unconditional basic sequence is a Schauder basis for its closed span whose expansions converge after arbitrary permutations or coordinate suppressions. Equivalently, the finite coordinate projections are uniformly bounded. Failure of this property gives pairs of disjointly supported unit vectors at arbitrarily small distance, obtained by separating a finite combination with a large coordinate projection.