Use the convention that the inner product is linear in its first argument, as required by the displayed representation of a linear functional. Choose an orthonormal basis , for instance by Gram-Schmidt orthogonalization. DefineFor , conjugate linearity in the second argument givesThusThe representation is unique as well: if two vectors represent the same functional, their difference is orthogonal to every vector and therefore to itself, so it is zero.
The adjoint operator is characterized byFor each fixed , the map is a linear functional. Part (i) gives a representing vector, which we define to be . Hence such a map exists on every vector of . Part (b) proves that this constructed map is linear.
For scalars and vectors , use the adjoint identity and conjugate linearity in the second argument:The difference of the two second-argument vectors is orthogonal to every . Choosing to be that difference shows its squared norm is zero. ThereforeThe two conjugations are why the adjoint is a linear map, despite the conjugate-linear dependence of the representing functional on its second argument.
The finite-dimensional spectral theorem says that a self-adjoint operator on a complex inner-product space has an orthonormal basis of eigenvectors and all its eigenvalues are real. Equivalently, its matrix is unitarily diagonalisable with real diagonal entries.
For , the matrix is equal to its conjugate transpose:Thus it represents a self-adjoint operator for the standard inner product on . The theorem applies directly, proving
Set . Direct multiplication giveswith . If were diagonalisable, then subtracting the identity in the same basis would diagonalise . A diagonal matrix whose cube is zero has every diagonal entry zero and is itself zero. Similarity would then imply , a contradiction. HenceThis proves failure directly; merely observing that it is not self-adjoint would not suffice, because non-self-adjoint matrices can still be diagonalisable.
Articles by others on the same topic
There are currently no matching articles.