Using the definition of the Krylov subspace, we form a matrix whose columns are the vectors in the Krylov subspace

We prove that , where is the orthogonal basis from Arnoldi. See also Key idea of iterative methods for eigenvalue computation.

To prove this, we show that is upper triangular. Consider

We define matrix as:

We find that for . So matrix is upper triangular.

is an orthogonal basis of the Krylov subspace and is the QR factorization of .