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.
A real normal endomorphism is orthogonally block-diagonalisable with 1x1 real blocks and 2x2 rotation-scaling blocks
Statement
Let be a finite-dimensional real inner product space and let be normal. Then has an orthonormal basis in which the matrix of is block diagonal with blocks of the two forms
where .
Facts & Assumptions
Given: A finite-dimensional real inner product space and a normal endomorphism .
In an orthonormal basis, a real operator is normal exactly when its matrix commutes with its transpose (In an orthonormal basis, self-adjoint means conjugate-transpose symmetry and normal means commuting with the conjugate transpose).
Over a complex inner product space, a normal operator has an orthonormal eigenbasis (Complex spectral theorem: a normal endomorphism of a finite-dimensional complex inner product space has an orthonormal eigenbasis, and conversely).
The standard pairings on and are inner products (The standard formulas on and on are inner products).
Complex conjugation satisfies the usual algebraic laws (Conjugation is an involutive real-field automorphism, , and modulus is definite, multiplicative, and subadditive).
Proof
Choose an orthonormal basis of and let be the matrix of . By [L1], . Because has real entries, its conjugate transpose over is still , so is a normal complex matrix on with the standard Hermitian inner product from [L3]. Therefore [L2] gives an orthonormal eigenbasis of for .
If is an eigenvalue and is a corresponding complex eigenvector, then , so and ; hence one of is a nonzero real eigenvector, and repeating inside each real eigenspace yields orthonormal real eigenvectors for the real eigenvalues.
If with and is a unit eigenvector, then because is real; since , the vectors and are orthogonal in the orthonormal eigenbasis from step 1.1, so writing out and using [L4] gives , hence and . Also , so and ; after normalising and , the matrix of on is .
The orthonormal complex eigenbasis from step 1.1 splits into real eigenvectors and conjugate pairs. Step 1.2 replaces each real eigenvector by a real one, and step 2.1 replaces each conjugate pair by an orthonormal real pair spanning the same real invariant plane. Collecting these mutually orthogonal pieces yields an orthonormal real basis with the stated block-diagonal matrix.
Depends on
- Self-adjoint and normal endomorphisms of a finite-dimensional real or complex inner product space
- In an orthonormal basis, self-adjoint means conjugate-transpose symmetry and normal means commuting with the conjugate transpose
- Complex spectral theorem: a normal endomorphism of a finite-dimensional complex inner product space has an orthonormal eigenbasis, and conversely
- The standard formulas $\langle x,y\rangle=\sum_{k<n}x_k y_k$ on $\mathbb R^n$ and $\sum_{k<n}x_k\overline{y_k}$ on $\mathbb C^n$ are inner products
- Conjugation is an involutive real-field automorphism, $z\overline z=|z|^2$, and modulus is definite, multiplicative, and subadditive
Used by
- Real spectral theorem: a self-adjoint endomorphism of a finite-dimensional real inner product space has an orthonormal eigenbasis Corollary
- The real quarter-turn is normal and appears as a single 2x2 block in the real normal classification Example
- FALSE: Every normal operator is diagonalisable over its base field False statement
Dependency tree · two levels
20 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
- Nicholas Hu, The Schur decomposition (standard reference, not scraped)