TheoremBase

Eigenvalues: the Determinant Criterion, Diagonal Matrices, Orthogonal Similarity and Orthogonality of Eigenvectors of Symmetric Matrices

A real number is an eigenvalue of a square real matrix A exactly when A minus it times the identity is singular, equivalently has determinant zero; diagonal matrices obey the expected algebra and have exactly their diagonal entries as eigenvalues; conjugating by an orthogonal matrix moves eigenvectors and keeps eigenvalues; and eigenvectors of a symmetric matrix with distinct eigenvalues are orthogonal.

Statement

In the setting of Routine Facts Used Without Citation: Arithmetic, Maps, Predicativity and Indices, let n∈Nn\in\mathbb{N}, A∈Mn(R)A\in\mathcal{M}_{n}(\mathbb{R}), λ∈R\lambda\in\mathbb{R} and μ,ν,x∈Rn\mu,\nu,x\in\mathbb{R}^{n}, with square real matrices, their entries and entrywise operations, the transpose, the matrix product, the matrix-vector product, the identity matrix InI_{n}, the standard basis vectors eke_{k}, invertible matrices, the determinant det⁡\det, the components of points of Rn\mathbb{R}^{n} as in Euclidean Space Rn\mathbb{R}^n: n-Tuples of Real Numbers with Their Componentwise Operations §membership, the dot product, the diagonal matrices diag⁡(μ)\operatorname{diag}(\mu), eigenvectors and eigenvalues, the set O(n)\mathrm{O}(n) of orthogonal matrices and the set S(n)\mathcal{S}(n) of symmetric matrices.

The following are equivalent: λ\lambda is an eigenvalue of AA; A−λInA-\lambda I_{n} is not invertible; det⁡(A−λIn)=0\det(A-\lambda I_{n})=0.

diag⁡(μ)⊤=diag⁡(μ)\operatorname{diag}(\mu)^{\top}=\operatorname{diag}(\mu); diag⁡(μ)diag⁡(ν)=diag⁡(μν)\operatorname{diag}(\mu)\operatorname{diag}(\nu)=\operatorname{diag}(\mu\nu), where μν∈Rn\mu\nu\in\mathbb{R}^{n} is the pointwise product, (μν)k=μkνk(\mu\nu)_{k}=\mu_{k}\nu_{k}; (diag⁡(μ)x)k=μkxk(\operatorname{diag}(\mu)x)_{k}=\mu_{k}x_{k} for every k∈[n]k\in[n]; x⋅(diag⁡(μ)x)=∑k=1nμkxk2x\cdot(\operatorname{diag}(\mu)x)=\sum_{k=1}^{n}\mu_{k}x_{k}^{2}; and diag⁡(1)=In\operatorname{diag}(1)=I_{n}, where 1=(1,…,1)∈Rn1=(1,\dots,1)\in\mathbb{R}^{n} is the constant map with value 11.

For every k∈[n]k\in[n], eke_{k} is an eigenvector of diag⁡(μ)\operatorname{diag}(\mu) with eigenvalue μk\mu_{k}; and every eigenvalue of diag⁡(μ)\operatorname{diag}(\mu) equals μk\mu_{k} for some k∈[n]k\in[n].

Let Q∈O(n)Q\in\mathrm{O}(n), and write QAQ⊤QAQ^{\top} for (QA)Q⊤(QA)Q^{\top}. Then xx is an eigenvector of AA with eigenvalue λ\lambda if and only if QxQx is an eigenvector of QAQ⊤QAQ^{\top} with eigenvalue λ\lambda; and λ\lambda is an eigenvalue of AA if and only if λ\lambda is an eigenvalue of QAQ⊤QAQ^{\top}.

If A∈S(n)A\in\mathcal{S}(n), λ′∈R\lambda'\in\mathbb{R}, λ′≠λ\lambda'\neq\lambda, xx is an eigenvector of AA with eigenvalue λ\lambda, and y∈Rny\in\mathbb{R}^{n} is an eigenvector of AA with eigenvalue λ′\lambda', then x⋅y=0x\cdot y=0.

Proofs

Log in to submit a proof.

Loading...

Citations

Loading…

Dependencies

Loading…

Related

0 relations

Curated associations between results. These are editable and subjective — they do not replace the dependency graph, which is derived from the references in the text.

No relations recorded yet.

Comments

Log in to comment.

Loading…