advanced34 min studyLesson 789 in Mathematics

Schauder bases and unconditionality

Distinguish ordered norm expansions from rearrangement-stable expansions and compute the conditional behavior of the summing basis.

On this page

What you’ll understand

  • Define a Schauder basis and its bounded partial-sum projections.
  • Use uniform finite-coordinate projection bounds to test unconditionality.
  • Compute coefficients and tail errors for the summing basis of c₀.

A Schauder basis represents each vector by a unique norm-convergent series in a fixed order. This is different from a Hamel basis, which uses only finite sums, and from an orthonormal Hilbert basis, which enjoys extra geometric identities. The order can matter: some Banach-space bases cease to behave correctly when terms are rearranged or selected in arbitrary subsets. Unconditionality records precisely that additional stability. Concrete sequence-space calculations reveal both the usefulness of ordered expansions and the danger of treating every convergent expansion as if it were absolutely convergent.

Basis coordinates produce bounded projections

A sequence of nonzero vectors is a Schauder basis of a Banach space X when every x has a unique scalar expansion whose partial sums converge to x in norm. The associated coefficient functionals are continuous, and the partial-sum operators P_N are bounded projections onto the first N basis vectors. Uniform boundedness gives a common bound on their operator norms, because P_Nx converges for every fixed x. These projections need not be orthogonal, and their norms need not equal one. The supremum of their norms is the basis constant.

Having a Schauder basis forces separability, since finite rational combinations of basis vectors are dense, using rational real and imaginary parts in the complex case. The converse fails: separable Banach spaces without the approximation property cannot have a Schauder basis. Indeed, the uniformly bounded partial-sum projections converge strongly to the identity, and a finite-net argument upgrades this to uniform convergence on each compact set. Thus a basis gives the bounded approximation property, connecting coordinate expansions to the previous lesson without claiming operator-norm convergence on the entire unit ball.

x=lim⁡N→∞PNx,PNx=∑n=1Nen∗(x)en,sup⁡N∥PN∥<∞x=\lim_{N\to\infty}P_Nx,\qquad P_Nx=\sum_{n=1}^Ne_n^*(x)e_n,\qquad\sup_N\|P_N\|<\infty
These are ordered norm expansions with continuous coefficient functionals. Uniformly bounded partial sums do not imply that ∥P_N−I∥ tends to zero.↔ Scroll wide equations horizontally.

Unconditionality controls all finite selections

A Schauder basis is unconditional when every permutation of each vector’s expansion converges in norm to the same vector. An equivalent criterion is a uniform bound on the operators selecting arbitrary finite subsets of basis coordinates. Such bounds prevent a collection of far-out terms from becoming large merely because other terms that cancel them were omitted. Sign-change formulations give another equivalent test. Unconditional convergence of vector series does not generally imply summability of the term norms; the finite-dimensional scalar absolute-convergence intuition does not transfer unchanged.

The canonical coordinate bases of ℓᵖ for 1≤p<∞ and of c₀ are unconditional with finite-selection projection norm at most one. The same coordinate vectors do not form a Schauder basis of ℓ∞, since their partial sums cannot uniformly approximate the constant-one sequence. A basis can also be Schauder but conditional, even on c₀, because a different ordered coordinate system can build cancellation into its representation. Thus unconditionality is a property of the chosen basis, not merely of the Banach space’s underlying set or its completeness.

PAx=∑n∈Aen∗(x)en,unconditional basis  ⟺  sup⁡A⊂N, A finite∥PA∥<∞P_Ax=\sum_{n\in A}e_n^*(x)e_n,\qquad\text{unconditional basis}\iff\sup_{A\subset\mathbb N,\ A\text{ finite}}\|P_A\|<\infty
The supremum ranges over every finite coordinate subset, not just initial segments. Its finiteness is an equivalent unconditionality criterion for a Schauder basis.↔ Scroll wide equations horizontally.

The summing basis makes ordered cancellation visible

In c₀, let s_n be one on the first n coordinates and zero afterward. For x tending to zero, define coefficients a_n=x_n−x_(n+1). The first N terms of the resulting expansion equal x_j−x_(N+1) in coordinates j≤N and zero afterward. The error is exactly the tail supremum beyond N, so it tends to zero. Comparing successive coordinates also proves uniqueness of the coefficients. This establishes a Schauder basis directly, without appealing to an abstract existence theorem.

Each initial-segment projection has norm at most two, and suitable vectors attain two. Arbitrary coordinate selections behave differently. For a finite alternating vector with entries one, minus one, one, minus one, the odd summing coefficients are all two; selecting just those coefficients accumulates a large first coordinate. Their omitted even companions supplied the cancellation that kept the original vector bounded. The resulting unbounded selection norms prove conditionality. This mechanism explains why stable ordered truncation does not authorize arbitrary pruning or rearrangement of a Banach-space expansion.

An ordered expansion with an exact tail

For the summing basis s_n in c₀ and x_j=1/j, compute its coefficients, first N-term expansion and exact supremum-norm error. Find the basis constant.

  1. The coefficient difference is a_n=1/n−1/(n+1)=1/(n(n+1)). In coordinate j≤N, telescoping gives the partial sum 1/j−1/(N+1).

  2. The first N coordinate errors are all 1/(N+1), while the remaining errors are 1/j for j>N. Hence the exact supremum error is 1/(N+1), which tends to zero.

  3. For general x, the projection formula bounds ∥P_Nx∥∞ by 2∥x∥∞. Taking x₁=1,x_(N+1)=−1 and other entries zero gives norm one input and first projected coordinate two, so ∥P_N∥=2.

The result

The harmonic sequence has the stated unique convergent expansion and exact error 1/(N+1). The summing basis constant is two, despite the canonical c₀ basis having constant one.

Explore the model

Interactive lab

Interactive lab · spectral

Ordered finite sums and an absolutely summable example

Pause and Reset, then set mode count N=1,coefficient decay p=2 and remain at time zero. Predict the readout at x=π/2 is one. For a fresh comparison Reset and set N=4,p=2, still paused; predict the sum 1−1/9=8/9 and highest-mode coefficient 1/16. Playback changes the phase t, not the cutoff N. The infinite p=2 series is uniformly convergent by summable norm bounds, but this does not make the displayed sine family a Schauder basis for every continuous function or demonstrate the conditional summing basis.

Ordered finite sums and an absolutely summable exampleA finite sum of sin(nx − t)/nᵖ. Playback changes t; increasing the cutoff includes finer spatial scales. This is not a proof about a continuum limit or renormalization. Current readings: Sum at x = π/2: 0.867; Smallest wavelength: 2π / 5; Highest-mode coefficient: 0.2. All parameters are adjustable with the labeled controls below.01.573.144.716.28−2.56−1.2801.282.56x · radiansFinite sine sum
Finite sumHighest included mode
Sum at x = π/2
0.867
Smallest wavelength
2π / 5
Highest-mode coefficient
0.2
t = 0 s

A finite sum of sin(nx − t)/nᵖ. Playback changes t; increasing the cutoff includes finer spatial scales. This is not a proof about a continuum limit or renormalization. Parameter changes pause playback and recompute the model at the current elapsed time. Reset restores both parameters and returns time to zero. Playback starts paused. Adjust either parameter, then choose Play or Step.

Look forA convergent expansion and a basis for an entire Banach space are different assertions; order and admissible selections require their own estimates.

Check your understanding

Which property distinguishes unconditionality from the ordinary Schauder basis requirement?

Try it yourself

Let x have first 2m coordinates 1,−1,1,−1,... and zero afterward. In its summing-basis expansion, select only the odd indices 1,3,...,2m−1. Find the first coordinate of the selected sum and deduce that the basis is conditional.

Take a moment to make a prediction or work it out on paper. Open a hint when you need one.

Give me a hint

For every selected odd n, compute x_n−x_(n+1), and remember every s_n has first coordinate one.

Compare with the solution

The original vector has supremum norm one. Each selected odd coefficient is 1−(−1)=2, and there are m such coefficients. Since each selected s_n contributes one in the first coordinate, the selected sum has first coordinate 2m, so its norm is at least 2m. The corresponding finite-selection operator therefore has norm at least 2m. These norms are unbounded as m increases, violating the unconditionality criterion while leaving the bounded initial-segment projections and Schauder property intact.

Take it with you

  • Schauder bases give unique ordered norm expansions and bounded initial-segment projections.
  • Unconditionality requires uniform control over arbitrary finite coordinate selections.
  • The summing basis of c₀ is Schauder with basis constant two but is conditional.

Read further

Original sources and deeper explanations to follow at your own pace.

Optional progress, saved in this browser when available. Revisit any lesson at any time.

Lesson not marked complete.