Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-08-16
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.

Gram–Schmidt turns every finite independent list into an orthonormal list with the same successive spans

Statement

Let (v0,…,vr−1) be a finite linearly independent list in a real or complex inner product space. There is an orthonormal list (e0,…,er−1) such that, for every k≤r,

span⁡(e0,…,ek−1)=span⁡(v0,…,vk−1).

It is obtained recursively from

uk=vk−∑j<k⟨vk,ej⟩ej,ek=uk∥uk∥.

For r=0, both lists are empty.

Facts & Assumptions

Given: A finite linearly independent list (v0,…,vr−1).

[L1]

An orthonormal list is orthogonal and every listed vector has norm one (Orthogonal vectors and subspaces, orthogonal and orthonormal sets, and orthonormal bases).

[L2]
[L3]

For a nonzero vector u, positive definiteness gives ∥u∥>0, so u/∥u∥ is defined and has norm one (The norm ∥v∥=⟨v,v⟩ induced by a real or complex inner product).

[L4]

Every finite orthogonal list of nonzero vectors is linearly independent (Every finite orthogonal list of nonzero vectors is linearly independent).

Proof

technique · induction
1.1base

For r=0 there is nothing to construct, and the successive-span assertion at k=0 is equality of zero subspaces.

1.2ihL1algebra

Suppose e0,…,ek−1 have been constructed orthonormally with the required span equalities. Define uk by the displayed formula. For i<k, linearity and orthonormality give ⟨uk,ei⟩=⟨vk,ei⟩−⟨vk,ei⟩=0.

2.1step 1.2ihL2L3

If uk=0, then vk lies in span⁡(e0,…,ek−1)=span⁡(v0,…,vk−1), say vk=∑i<kμivi; then the scalars λi=μi for i<k, λk=−1F and λi=0F for i>k satisfy ∑iλivi=0V with λk≠0F, contradicting the independence of v through [L2]. Hence uk≠0, and [L3] makes ek=uk/∥uk∥ a unit vector orthogonal to its predecessors.

3.1step 2.1ihalgebra

The formula for uk shows ek lies in span⁡(v0,…,vk), while its rearrangement shows vk lies in span⁡(e0,…,ek). Together with the induction hypothesis these give both inclusions in the span equality at k+1.

4.1step 1.1step 1.2step 2.1step 3.1L1L4discharge-induction∎

Induction constructs the stated list and proves every successive-span equality. Its vectors are nonzero and orthogonal, so [L4] also confirms their independence; their unit norms make the list orthonormal.

Depends on

Used by

Dependency tree · two levels

15 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