Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicablePipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-22
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.

Orthonormal families, complete orthonormal systems and Hilbert bases

Definition

Let H be a real or complex inner-product space (Real and complex inner-product spaces and their induced length), with inner product linear in the first argument and conjugate-linear in the second, and with the induced length v=v,v. The definitions below do not require completeness. When the term Hilbert basis is used, H is additionally assumed complete (Hilbert space).

Orthonormal indexed family. Let I be any set. An indexed family (ei)iI of vectors of H is orthonormal when

ei,ej=δij:={1,i=j,0,ij,for all i,jI.Because 10 in the scalar field, the family contains no zero vector: ei2=ei,ei=1, so ei=1 for every i (Real and complex inner-product spaces and their induced length); and the index map is injective, since ei=ej with ij would give 0=ei,ej=1. Thus an orthonormal family is the same thing as an orthonormal set together with a labelling of it, and in the sequel no choice is hidden in passing between the two descriptions. Orthonormal set. A subset SH is orthonormal when every sS has s=1 and s,t=0 for all distinct s,tS. For such an S the family (es)sS with es:=s is orthonormal in the indexed sense, and the image of an orthonormal indexed family is an orthonormal set. Orthogonal means s,t=0 (Orthogonality and the orthogonal complement). Independence and unique coefficients. Let (ei)iI be orthonormal, let FI be finite, and let scalars ci satisfy iFciei=0. For each fixed jF, linearity in the first argument gives0=iFciei,  ej=iFciei,ej=cj,

so every finite subfamily of an orthonormal family is linearly independent. In particular the coefficients in a finite expansion are unique: if iFciei=iFdiei, then applying the computation to cd gives ci=di for every iF.

Closed linear span and completeness. The span of an indexed family is the set of all finite linear combinations iFciei with FI finite and scalars ci; it is the smallest linear subspace of H containing every ei (Linear subspace of a vector space). Its closure in the induced norm is the closed linear span of the family, the smallest closed linear subspace of H containing every ei. The family is complete, or is a complete orthonormal system, when its closed linear span is all of H. A Hilbert basis, or orthonormal basis, of H is a complete orthonormal family in H.

The empty family. The span of the empty family is {0}, which is already closed, so the empty family is complete exactly when H={0}. Thus the zero Hilbert space always has a Hilbert basis, namely the empty one.

Not a Hamel basis, and no order is assumed. A Hilbert basis is a basis only in the sense of closed linear span: for an infinite-dimensional H the vectors of H are in general not finite linear combinations of a Hilbert basis, and the expansion of an arbitrary vector is a norm limit of finite partial sums, not a finite sum. No enumeration, ordering or countability of the index set is part of the definition; the partial sums are indexed by the finite subsets of I, ordered by inclusion, and that is the convention used on this page.

Coefficient notation. For orthonormal (ei)iI and xH the scalars x,ei are the coefficients of x with respect to the family. They are well defined for every x, without any assumption that the family is complete.

Depends on

Used by

…and 5 more results.

Dependency tree · two levels

14 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