Conjugate the Whole Eigenvalue Equation
Complex eigenvalue calculations often involve a short step that is easy to mishandle: taking the complex conjugate of an equation. Conjugation applies to every scalar and every matrix entry in that equation. In particular, it changes \(\lambda\) to \(\overline{\lambda}\), and it changes a complex matrix \(\mathbf{A}\) to its entrywise conjugate \(\overline{\mathbf{A}}\). It does not, by itself, transpose a matrix.
Throughout this tutorial, vectors are columns in \(\mathbb{C}^n\). A complex number \(a+bi\), with \(a,b\in\mathbb{R}\), has conjugate \(a-bi\). For a vector or matrix, the overline means that conjugation is applied entry by entry. An eigenvalue and eigenvector of \(\mathbf{A}\in\mathbb{C}^{n\times n}\) satisfy \(\mathbf{A}\mathbf{v}=\lambda\mathbf{v}\), where \(\mathbf{v}\ne\mathbf{0}\).
Proof. Write the \(j\)th entry of \(\mathbf{A}\mathbf{v}\) as \(\sum_{k=1}^{n}a_{jk}v_k\). Conjugating the \(j\)th component of the given equation gives \(\overline{\sum_{k=1}^{n}a_{jk}v_k}=\overline{\lambda v_j}\). Conjugation of a sum and a product gives \(\sum_{k=1}^{n}\overline{a_{jk}}\,\overline{v_k}=\overline{\lambda}\,\overline{v_j}\). This holds for every row \(j\), so it is exactly \(\overline{\mathbf{A}}\,\overline{\mathbf{v}}=\overline{\lambda}\,\overline{\mathbf{v}}\). Since \(\mathbf{v}\ne\mathbf{0}\), at least one entry of \(\mathbf{v}\) is nonzero, and its conjugate is nonzero; hence \(\overline{\mathbf{v}}\ne\mathbf{0}\). If \(\mathbf{A}\) is real, then \(\overline{\mathbf{A}}=\mathbf{A}\), giving the stated eigenpair of the same matrix. \(\square\)
The hypothesis that \(\mathbf{A}\) is real matters. For a complex matrix, conjugating an eigenpair generally gives an eigenpair of \(\overline{\mathbf{A}}\), not necessarily of \(\mathbf{A}\). For a real matrix, by contrast, a nonreal eigenvalue \(\lambda\) is accompanied by \(\overline{\lambda}\). This conclusion concerns eigenvalues and their corresponding eigenvectors together; it does not say that \(\overline{\lambda}\) can be paired with the original vector \(\mathbf{v}\).
Worked Examples of Correct Conjugation
Worked Example: Conjugate Pair for a Real Rotation Matrix
Let \(\mathbf{A}=\begin{bmatrix}0&-1\\1&0\end{bmatrix}\). Verify an eigenpair with eigenvalue \(i\), then obtain its conjugate eigenpair.
Take \(\mathbf{v}=\begin{bmatrix}1\\-i\end{bmatrix}\), which is nonzero. Direct multiplication gives
Thus \((i,\mathbf{v})\) is an eigenpair. Since \(\mathbf{A}\) is real, the theorem gives the conjugate eigenpair \((-i,\overline{\mathbf{v}})\), where \(\overline{\mathbf{v}}=\begin{bmatrix}1\\i\end{bmatrix}\). Check it in the original matrix:
Check: the first product is \(i\mathbf{v}=\begin{bmatrix}i\\1\end{bmatrix}\), and the second is \((-i)\overline{\mathbf{v}}=\begin{bmatrix}-i\\1\end{bmatrix}\), agreeing with the matrix multiplications.
Worked Example: A Complex Matrix Changes Under Conjugation
Let \(\mathbf{B}=\begin{bmatrix}i&0\\0&2\end{bmatrix}\) and \(\mathbf{v}=\begin{bmatrix}1\\0\end{bmatrix}\). Find the eigenpair produced by conjugating this equation, and check which matrix it belongs to.
First, the original equation is
Conjugating the matrix, vector, and eigenvalue gives \(\overline{\mathbf{B}}=\begin{bmatrix}-i&0\\0&2\end{bmatrix}\), \(\overline{\mathbf{v}}=\begin{bmatrix}1\\0\end{bmatrix}\), and \(\overline{i}=-i\). Indeed,
This does not produce an eigenpair of \(\mathbf{B}\) with eigenvalue \(-i\): multiplication by the original matrix gives \(\mathbf{B}\overline{\mathbf{v}}=\begin{bmatrix}i\\0\end{bmatrix}\ne\begin{bmatrix}-i\\0\end{bmatrix}\). The matrix has changed under conjugation, so the theorem's general conclusion is about \(\overline{\mathbf{B}}\).
Check: both equations follow from multiplying a diagonal matrix by \(\begin{bmatrix}1\\0\end{bmatrix}\), which selects its first column. That column is \(\begin{bmatrix}i\\0\end{bmatrix}\) for \(\mathbf{B}\) and \(\begin{bmatrix}-i\\0\end{bmatrix}\) for \(\overline{\mathbf{B}}\).
Transpose Is Not Conjugation
For a complex matrix, the transpose \(\mathbf{A}^{\top}\) swaps rows and columns without changing entries. The conjugate transpose \(\mathbf{A}^{*}=\overline{\mathbf{A}}^{\top}\) first conjugates entries and also swaps rows and columns. These operations are distinct. In particular, the step from \(\mathbf{A}\mathbf{v}=\lambda\mathbf{v}\) to \(\overline{\mathbf{A}}\,\overline{\mathbf{v}}=\overline{\lambda}\,\overline{\mathbf{v}}\) uses entrywise conjugation, not a transpose.
Worked Example: Transpose and Conjugate Transpose Give Different Matrices
Let \(\mathbf{C}=\begin{bmatrix}1&i\\0&2\end{bmatrix}\). Compute its transpose and conjugate transpose.
Transposing swaps the off-diagonal entries but leaves \(i\) unchanged:
For the conjugate transpose, conjugate first and then transpose. Since \(\overline{i}=-i\), this gives
For example, with \(\mathbf{x}=\begin{bmatrix}1\\i\end{bmatrix}\), the two products are
Check: multiplying the second row of \(\mathbf{C}^{\top}\) by \(\mathbf{x}\) gives \(i+2i=3i\); multiplying the second row of \(\mathbf{C}^{*}\) by \(\mathbf{x}\) gives \(-i+2i=i\). The different results confirm that the two operations cannot be interchanged here.
For a real matrix, \(\overline{\mathbf{A}}=\mathbf{A}\), and therefore \(\mathbf{A}^{*}=\mathbf{A}^{\top}\). Even in that case, taking the transpose is not the operation used to conjugate an eigenvalue equation. The operations may happen to coincide in one comparison, but their definitions and roles remain different.
Complex Eigenvectors Are Not Automatically Real Eigenvectors
A vector in \(\mathbb{C}^n\) can be written uniquely as \(\mathbf{x}=\mathbf{u}+i\mathbf{w}\), where \(\mathbf{u},\mathbf{w}\in\mathbb{R}^n\) are its real and imaginary parts. If a real matrix acts on this vector, it acts on both parts. That does not mean either part separately is an eigenvector for the original complex eigenvalue.
Proof. Since \(\mathbf{A}\) is real, multiplication distributes over the real and imaginary parts: \(\mathbf{A}\mathbf{x}=\mathbf{A}\mathbf{u}+i\mathbf{A}\mathbf{w}\). Also, \((a+bi)(\mathbf{u}+i\mathbf{w})=(a\mathbf{u}-b\mathbf{w})+i(b\mathbf{u}+a\mathbf{w})\), using \(i^2=-1\). Two complex vectors are equal exactly when their real parts are equal and their imaginary parts are equal. Thus \(\mathbf{A}\mathbf{x}=\lambda\mathbf{x}\) holds exactly when both displayed real-vector equations hold. \(\square\)
Worked Example: The Real and Imaginary Parts Are Coupled
Use the eigenpair \(\mathbf{A}\mathbf{x}=i\mathbf{x}\) from the rotation matrix example to check what the real and imaginary parts do.
Here \(\mathbf{x}=\begin{bmatrix}1\\-i\end{bmatrix}=\mathbf{u}+i\mathbf{w}\), where \(\mathbf{u}=\begin{bmatrix}1\\0\end{bmatrix}\) and \(\mathbf{w}=\begin{bmatrix}0\\-1\end{bmatrix}\). The eigenvalue \(i=0+1i\) has \(a=0\) and \(b=1\). Multiply each real vector by \(\mathbf{A}\):
These are exactly \(\mathbf{A}\mathbf{u}=a\mathbf{u}-b\mathbf{w}=-\mathbf{w}\) and \(\mathbf{A}\mathbf{w}=b\mathbf{u}+a\mathbf{w}=\mathbf{u}\). Neither real vector is an eigenvector with eigenvalue \(i\): \(\mathbf{A}\mathbf{u}=\begin{bmatrix}0\\1\end{bmatrix}\) is not \(i\mathbf{u}=\begin{bmatrix}i\\0\end{bmatrix}\), and \(\mathbf{A}\mathbf{w}=\begin{bmatrix}1\\0\end{bmatrix}\) is not \(i\mathbf{w}=\begin{bmatrix}0\\-i\end{bmatrix}\).
Check: combining the two products gives \(\mathbf{A}(\mathbf{u}+i\mathbf{w})=\begin{bmatrix}0\\1\end{bmatrix}+i\begin{bmatrix}1\\0\end{bmatrix}=\begin{bmatrix}i\\1\end{bmatrix}=i\begin{bmatrix}1\\-i\end{bmatrix}\). The complex vector is the eigenvector, even though its real and imaginary parts are not eigenvectors for \(i\).
There is also a direct reason a real vector cannot be an eigenvector of a real matrix for a nonreal eigenvalue. If \(\mathbf{r}\in\mathbb{R}^n\) is nonzero and \(\mathbf{A}\mathbf{r}=\lambda\mathbf{r}\), then both \(\mathbf{A}\mathbf{r}\) and \(\mathbf{r}\) are real. Choose an index \(j\) with \(r_j\ne0\). The \(j\)th coordinate gives \(\lambda=(\mathbf{A}\mathbf{r})_j/r_j\), a real number. Hence \(\lambda\) must be real. This argument requires \(\mathbf{A}\) and \(\mathbf{r}\) to be real.
Common Conjugation Errors
Error: change the eigenvalue but keep the eigenvector. Starting from \(\mathbf{A}\mathbf{v}=\lambda\mathbf{v}\), one might write \(\mathbf{A}\mathbf{v}=\overline{\lambda}\mathbf{v}\) for a real matrix. In the rotation example, this would claim \(\mathbf{A}\begin{bmatrix}1\\-i\end{bmatrix}=-i\begin{bmatrix}1\\-i\end{bmatrix}\). The left side is \(\begin{bmatrix}i\\1\end{bmatrix}\), while the right side is \(\begin{bmatrix}-i\\-1\end{bmatrix}\); they are not equal. The correction is to conjugate the vector as well: the valid equation is \(\mathbf{A}\begin{bmatrix}1\\i\end{bmatrix}=-i\begin{bmatrix}1\\i\end{bmatrix}\).
Error: use the real and imaginary parts as separate eigenvectors. For \(\mathbf{x}=\mathbf{u}+i\mathbf{w}\), the eigenvector equation is equivalent to the coupled equations in the theorem, not to \(\mathbf{A}\mathbf{u}=\lambda\mathbf{u}\) and \(\mathbf{A}\mathbf{w}=\lambda\mathbf{w}\). In particular, those latter equations would equate real vectors with generally nonreal vectors when \(\lambda\) is nonreal.
Error: replace conjugation by transpose. A transpose swaps matrix entries across the diagonal; it does not conjugate \(i\) to \(-i\). When conjugating an eigenvalue equation, conjugate every entry and scalar, and do not transpose unless a separate argument calls for a transpose or conjugate transpose.
| Situation | Correct conclusion | Common mistake |
|---|---|---|
| \(\mathbf{A}\mathbf{v}=\lambda\mathbf{v}\), with complex \(\mathbf{A}\) | \(\overline{\mathbf{A}}\,\overline{\mathbf{v}}=\overline{\lambda}\,\overline{\mathbf{v}}\) | Assuming the new pair belongs to \(\mathbf{A}\) |
| \(\mathbf{A}\) is real | \(\overline{\mathbf{v}}\) is an eigenvector for \(\overline{\lambda}\) | Changing \(\lambda\) but retaining \(\mathbf{v}\) |
| \(\mathbf{A}\) is complex | \(\mathbf{A}^{*}=\overline{\mathbf{A}}^{\top}\) | Treating \(\mathbf{A}^{*}\) as just \(\mathbf{A}^{\top}\) |
| \(\mathbf{x}=\mathbf{u}+i\mathbf{w}\) for a real matrix | Real and imaginary parts satisfy coupled equations | Assuming each part is an eigenvector |
A reliable check is to return to the defining equation and multiply the proposed matrix by the proposed vector. For a conjugate pair of a real matrix, check both \(\mathbf{A}\mathbf{v}=\lambda\mathbf{v}\) and \(\mathbf{A}\overline{\mathbf{v}}=\overline{\lambda}\,\overline{\mathbf{v}}\). For a complex matrix, record whether the equation involves \(\mathbf{A}\), \(\overline{\mathbf{A}}\), \(\mathbf{A}^{\top}\), or \(\mathbf{A}^{*}\); these are not interchangeable.
Check Your Understanding
For each question, identify the matrix in the equation and check any proposed eigenpair by multiplication.
- If \(\mathbf{A}\mathbf{v}=\lambda\mathbf{v}\), what equation follows after conjugating every entry and scalar?
- What additional condition allows the conjugated eigenpair to belong to the original matrix \(\mathbf{A}\)?
- For \(\mathbf{A}=\begin{bmatrix}0&-1\\1&0\end{bmatrix}\), verify the eigenpair with eigenvalue \(-i\) and vector \(\begin{bmatrix}1\\i\end{bmatrix}\).
- For a real matrix and \(\mathbf{x}=\mathbf{u}+i\mathbf{w}\) with eigenvalue \(a+bi\), write the two real-vector equations that follow.
- For \(\mathbf{C}=\begin{bmatrix}1&i\\0&2\end{bmatrix}\), compute \(\mathbf{C}^{\top}\) and \(\mathbf{C}^{*}\), and state how they differ.