Ma · Mathematics

Does an Invertible Adjoint Imply an Invertible Operator?

Published By the 9to5Science editorial team

At a glance

  1. 1. State the setting

    Let T be a bounded operator on a Hilbert space, with adjoint T*.

  2. 2. Name the inverse

    Set B equal to the inverse of T*.

  3. 3. Take adjoints

    Adjoint the identities T*B = I and BT* = I.

  4. 4. Identify the inverse

    The resulting identities show that B* is a two-sided inverse of T.

Suppose TT is a bounded linear operator on a Hilbert space HH. The question is whether invertibility of its adjoint T∗T^* forces TT itself to be invertible.

Yes. In fact,

T is invertible⟺T∗ is invertible,T \text{ is invertible} \quad\Longleftrightarrow\quad T^* \text{ is invertible},

and the inverses satisfy

T−1=(T∗)−1∗=((T∗)−1)∗.T^{-1} = (T^*)^{-1*} = \bigl((T^*)^{-1}\bigr)^*.

Here, “invertible” means that the operator has a bounded two-sided inverse.

Direct proof on a Hilbert space

Assume that T∗T^* is invertible and write

B=(T∗)−1.B=(T^*)^{-1}.

Since BB is the inverse of T∗T^*, it satisfies both inverse identities

T∗B=IandBT∗=I,T^*B=I \qquad\text{and}\qquad BT^*=I,

where II is the identity operator on HH.

Take adjoints. Using (AB)∗=B∗A∗(AB)^*=B^*A^* and I∗=II^*=I, the first identity gives

(T∗B)∗=B∗T=I.(T^*B)^*=B^*T=I.

The second gives

(BT∗)∗=TB∗=I.(BT^*)^*=TB^*=I.

Thus B∗B^* is both a left and a right inverse of TT:

B∗T=IandTB∗=I.B^*T=I \qquad\text{and}\qquad TB^*=I.

Therefore TT is invertible, and

T−1=B∗=((T∗)−1)∗.T^{-1}=B^*=\bigl((T^*)^{-1}\bigr)^*.

This argument works in finite- and infinite-dimensional Hilbert spaces. No finite-dimensional determinant argument is needed.

The converse

The converse follows by exactly the same reasoning. If TT is invertible, then

T−1T=IandTT−1=I.T^{-1}T=I \qquad\text{and}\qquad TT^{-1}=I.

Taking adjoints gives

T∗(T−1)∗=Iand(T−1)∗T∗=I.T^*(T^{-1})^*=I \qquad\text{and}\qquad (T^{-1})^*T^*=I.

Hence T∗T^* is invertible and

(T∗)−1=(T−1)∗.(T^*)^{-1}=(T^{-1})^*.

Combining both directions produces the useful equivalence

T invertible⟺T∗ invertible.T\text{ invertible}\quad\Longleftrightarrow\quad T^*\text{ invertible}.

Worked matrix example

Consider the real matrix

A=(1203).A=\begin{pmatrix} 1&2\\ 0&3 \end{pmatrix}.

For a real matrix, the adjoint is the transpose, so

A∗=AT=(1023).A^*=A^{\mathsf T}=\begin{pmatrix} 1&0\\ 2&3 \end{pmatrix}.

The inverse of AA is

A−1=(1−23013).A^{-1}=\begin{pmatrix} 1&-\frac23\\ 0&\frac13 \end{pmatrix}.

The theorem predicts that

(A∗)−1=(A−1)∗.(A^*)^{-1}=(A^{-1})^*.

Indeed,

(A∗)−1=(10−2313)=(A−1)T.(A^*)^{-1}=\begin{pmatrix} 1&0\\ -\frac23&\frac13 \end{pmatrix} =(A^{-1})^{\mathsf T}.

For complex matrices, replace the transpose by the conjugate transpose: A∗=A‾TA^*=\overline{A}^{\mathsf T}.

Banach-space version

The same invertibility equivalence is also true for a bounded operator T:X→YT:X\to Y between Banach spaces, where

T∗:Y∗→X∗,(T∗g)(x)=g(Tx).T^*:Y^*\to X^*, \qquad (T^*g)(x)=g(Tx).

The simple adjoint-taking proof above needs care because (T∗)∗(T^*)^* acts between bidual spaces, not necessarily directly between YY and XX. Nevertheless, the result remains true.

Assume T∗T^* is invertible. Let C=∥(T∗)−1∥C=\|(T^*)^{-1}\|. For any x∈Xx\in X and any f∈X∗f\in X^*, choose g∈Y∗g\in Y^* such that T∗g=fT^*g=f. Then

∥g∥≤C∥f∥,\|g\|\le C\|f\|,

and therefore

∣f(x)∣=∣g(Tx)∣≤∥g∥ ∥Tx∥≤C∥f∥ ∥Tx∥.|f(x)|=|g(Tx)|\le \|g\|\,\|Tx\|\le C\|f\|\,\|Tx\|.

Taking the supremum over all ff with ∥f∥≤1\|f\|\le 1 gives

∥x∥≤C∥Tx∥.\|x\|\le C\|Tx\|.

Thus TT is bounded below. It is consequently injective and has closed range.

Also, because T∗T^* is injective, the range of TT is dense in YY: if a nonzero functional in Y∗Y^* vanished on the range of TT, it would belong to the kernel of T∗T^*. The range is both dense and closed, so it equals YY. Hence TT is bijective, and the bounded inverse theorem shows that T−1T^{-1} is bounded.

Common mistakes

Confusing an adjoint with an inverse

The adjoint T∗T^* is generally not the inverse of TT. For example, a matrix can have an invertible transpose without the transpose equaling the matrix inverse. The correct relationship is

(T∗)−1=(T−1)∗.(T^*)^{-1}=(T^{-1})^*.

Only special operators, such as unitary operators, satisfy T−1=T∗T^{-1}=T^*.

Checking only one inverse identity

For operators on an infinite-dimensional space, having a left inverse or a right inverse alone does not automatically mean that the operator is invertible. The proof above uses both identities for (T∗)−1(T^*)^{-1}, which yield both identities for TT.

Ignoring boundedness

The statement is standard for bounded operators on Hilbert or Banach spaces. Unbounded operators require specifying domains carefully; taking adjoints and manipulating inverse identities is then subject to additional domain conditions. The bounded-operator theorem should not be transferred to unbounded operators without those hypotheses.

References

  1. Walter Rudin, Functional Analysis
  2. John B. Conway, A Course in Functional Analysis

Spotted an error? Send a correction. Read how we write and check articles in our editorial policy.