How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
Schauder basis and coordinate functionals
Definition
Let be a real or complex Banach space. A positively indexed sequence in means a function from to . Such a sequence is a Schauder basis of if for every there is a unique scalar family , written , such that
in the fixed displayed order. This notation denotes the zero-indexed series from Series and absolute convergence in a normed space whose term at is ; equivalently, in norm. The uniqueness is part of the definition.
For each , the algebraically defined map
is the th coordinate functional. It is linear: uniqueness applied to the expansions of and gives and . No continuity is included in this definition; boundedness will be proved later.
Remarks
- A Schauder basis is ordered. Rearranging a conditional basis expansion can destroy convergence.
- Every basis vector is nonzero, since otherwise the zero vector would have two coefficient sequences.
Depends on
Used by
- A Banach space with a Schauder basis is separable Corollary
- The standard unit vectors are not a Schauder basis of ell-infinity Counterexample
- Partial-sum projections and basis constant Definition
- Unconditional and conditional Schauder bases Definition
- The Schauder coefficient space is Banach Lemma
- A Schauder basis implies the bounded approximation property Theorem
- James space is complete and separable Theorem
Dependency tree · two levels
7 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- Thomas Schlumprecht, Course Notes in Functional Analysis, Math 655 (standard reference, not scraped)