A linear map between finite-dimensional inner product spaces sends an input to an output , and a fixed vector in reads that output as the number . Is there one vector in that gives the same reading directly from the input, for every at once? For each there is exactly one such vector, and the rule that assigns it to is the adjoint . This lesson builds the adjoint from the Riesz representation theorem, finds its matrix in bases that are not orthonormal, and shows that its kernel and image are the orthogonal complements of the image and kernel of . Throughout, is or , inner products are conjugate-linear in the first argument and linear in the second, and a tuple such as stands for a column vector.
Key terms
Adjoint of a linear map
Definition Let and be finite-dimensional inner product spaces over and let be linear. The adjoint of is the unique map that satisfies the adjoint identity
Such a map exists, is unique and is linear. Fix . The rule is a linear functional on , because and the second slot are linear, so the Riesz representation theorem gives exactly one with for every . Set . Conjugating both sides gives the adjoint identity, and any map that satisfies the identity must send to this same representing vector, which proves uniqueness. For linearity, conjugate-linearity of the first slot gives
so uniqueness of the representing vector gives . The adjoint depends on the inner products of both spaces. It is not the dual map , , which needs no inner product, and in general it is not an inverse. On and with the standard inner products, the adjoint of is , because .
In plain words The adjoint moves a measurement from the output side to the input side. Reading the output against gives the same number as reading the input against .
Example In with the standard inner product, let
Take and . Then , and conjugating its entries gives
On the other side and , as the identity requires. The plain transpose gives and the reading , so without conjugation the identity fails. The product has rows and . It is not , so this adjoint is not the inverse of .
Adjoint of a composition
Definition Let , and be finite-dimensional inner product spaces over , and let and be linear. Then
For and , two uses of the adjoint identity give
so satisfies the defining identity of , and uniqueness of the adjoint gives equality. The same uniqueness argument proves the other rules. For linear maps and a scalar ,
The first rule follows by conjugating the adjoint identity, which gives . The scalar rule holds because a scalar comes out of the first slot conjugated, so .
In plain words Adjoints reverse the order of a composition, as transposes and inverses do. Sums pass through unchanged, and a scalar comes out conjugated.
Example In with the standard inner product, take
The product has rows and , so
while has rows and . Keeping the original order gives the wrong matrix. Also has rows and , which is and not .
Matrix of the adjoint in a general basis
Definition Let and be finite-dimensional inner product spaces over , let be linear, let be a basis of and a basis of , and let the Gram matrices be
In coordinates , and likewise in . The Gram matrix of a basis is invertible. If , then , and this number is the squared norm of , so that vector is and . If , then
To derive it, write , and . The two sides of the adjoint identity become
They agree for all columns and , and standard basis columns pick out single entries, so . In orthonormal bases both Gram matrices are identity matrices and the matrix of the adjoint is , which is when . In other bases the bare conjugate transpose is generally wrong.
In plain words Coordinates forget the inner product, and the Gram matrices put it back. In orthonormal bases the adjoint’s matrix is the conjugate transpose, and in other bases it generally is not.
Example Give the dot product and the basis , , give the basis , and let . Then and , so and , while
The formula gives the coordinate column , which is the vector . That is right, since and so . The bare transpose column would stand for , and it fails the identity at , where but .
Orthogonal complement
Definition Let be a subspace of an inner product space over . Its orthogonal complement is
It is a subspace, and by conjugate symmetry the order of the two slots does not matter. It meets only in , because a vector orthogonal to itself has squared norm . If span , then exactly when for each . Now let and . Extend a basis of to a basis of and apply Gram-Schmidt in that order. Gram-Schmidt keeps the span of each initial segment, so the result is an orthonormal basis of whose first vectors form a basis of . Every equals , and it lies in exactly when its first coefficients vanish. Hence
In plain words The orthogonal complement collects every vector perpendicular to all of . In a finite-dimensional space it has exactly as many dimensions as lacks, and together with it spans the whole space.
Example In with the standard inner product, let . A vector lies in when
so , of dimension . Indeed . Dropping the conjugation would suggest the vector instead, but .
Double orthogonal complement
Definition Let be a subspace of a finite-dimensional inner product space over . Then
The inclusion holds in every inner product space, since each is orthogonal to every vector of . For the reverse inclusion, take the orthonormal basis from the previous card, with and . A vector is orthogonal to exactly when for every , which says that lies in . Counting dimensions gives the same conclusion, because contains and has dimension . For any subset of the identity becomes . Finite dimension is a real hypothesis here. In infinite-dimensional inner product spaces the identity can fail.
In plain words Taking the perpendicular directions twice brings you back to the subspace you started with, provided the space is finite-dimensional.
Example Give the inner product and let . A vector lies in when , so . A vector is orthogonal to when , so . The complement itself depends on the inner product. For the dot product it would be the span of , but in this inner product .
Kernel and image of the adjoint
Definition Let and be finite-dimensional inner product spaces over and let be linear. Then
The first equality is between subspaces of , the second between subspaces of . For the first, means for every , that is for every . Choosing gives , so . Conversely, makes every such pairing zero. Applying the first identity to , whose adjoint is , gives , and taking orthogonal complements with the double complement identity gives the second. Consequently
and .
In plain words The vectors the adjoint sends to zero are exactly those perpendicular to everything can reach. What the adjoint can reach is exactly what is perpendicular to the kernel of .
Example In with the standard inner product, let
The second column of is times the first, so and . Also , so and . Both identities check out, since
The plain transpose has image instead, and , so that image is not .
Check yourself
- Give and their standard inner products and let . Find .
Show the answer
In the standard bases, which are orthonormal, the matrix of is the row . Its conjugate transpose is the column , so . Check the identity directly. Since ,
The answer forgets the conjugation and fails this check.
- Let be a linear map between inner product spaces with , and . Find the dimensions of and , and say which space each one lies in.
Show the answer
The kernel is a subspace of of dimension . By rank-nullity, , so the image is a subspace of of dimension . The ranks agree, while the kernels of and have different dimensions, and .
- Give the inner product , give the ordinary product, and let . Find and check the adjoint identity at and . Why is the wrong answer?
Show the answer
The standard basis of has Gram matrix , and the matrix of is the row , so
At the given vectors and . On the other side and . The column is the adjoint for the dot product, not for this inner product. It would give and the reading , which does not match. As a further check, is spanned by , and , as the identity requires.