Closedness question about adjoint image

  • Thread starter Thread starter jostpuur
  • Start date Start date
  • Tags Tags
    Image
jostpuur
Messages
2,112
Reaction score
19
If X and Y are norm spaces, T:X->Y is a continuous linear mapping, and T(X) is closed in Y, is T*(Y*) always closed in X*? Here X* and Y* are dual spaces, and T*:Y*->X* is the adjoint of T.
 
Physics news on Phys.org
This question is interesting to me, not because I can answer it, which I can't, but because it's by far the most abstract definition I've seen of the adjoint.

The second most, from "Geometric Algebra for Physicists" was the following (roughly). For a linear transformation F : V -> V, in a product space that can produce a scalar component, the adjoint:

\bar{F}

is defined implicitly by:

<br /> \langle A F(B) \rangle = \langle \bar{F}(A) B \rangle<br />

where \langle \cdots \rangle selects the scalar component of the product.

From that definition, for a real vector space and the scalar component defined by an inner product, I can see how this is consistent with the matrix transpose, if one introduces a basis and reciprocal frame vectors, and expand the linear transformation in terms of components for this basis.

However, it appears to me that your adjoint definition is formulated in a way that allows for it to apply to infinite dimensional spaces. If that's the case, to calculate the adjoint from this definition couldn't use the basis method above (at least I'm not sure how one would calculate the reciprocal frame vectors).

From your definition how one would calculate an adjoint for a given linear mapping. Would you mind giving an example of a mapping T and it's adjoint that fits your definition?
 
I have in fact encountered two somewhat different definition for the adjoint. This is the other one. When X and Y are norm spaces, we set

<br /> X^* := \{x^*:X\to\mathbb{C}\;|\; x^*\;\textrm{is continuous and linear}\}<br />

and similarly Y*. When T:X->Y is continuous linear mapping, we set

<br /> (T^* y^*)x = y^*(Tx),\quad\forall y^*\in Y^*,\; x\in X.<br />

Notice that this formula defines a linear mapping

<br /> (T^* y^*): X\to\mathbb{C},\quad (T^* y^*)\in X^*,<br />

and thus also a mapping

<br /> T^*: Y^*\to X^*.<br />

If we have a Hilbert space H, and a linear mapping T:H->H, then strictly according to the previous definition, we have T*:H*->H*. However, the dual of a Hilbert space is isometric to the space itself, so we can identify all vectors of H* as vectors of H, and let the action of x^*\in H^* be given with the inner product. So x^*(z) becomes replaced by (x|z), if the x^*\in X^* and x\in X assumed to be identified in the isometry. The previous condition then becomes

<br /> (T^* y|x) = (y|Tx),<br />

so the old formula, that you knew for matrices already, is obtained as a special case.

Then there is another definition, which deals with unbounded operators. If we have T:D(T)->H, with D(T)\subset H being some subspace, it is possible to give some definitions T^*:D(T^*)\to H so that the same inner product formula is still valid for some vectors, but this time the domain issue gets more difficult.
 
I found a theorem that says that T*(Y*) is closed if T(X) is closed, assuming that X and Y are Banach spaces and that T is continuous.
 
Thread 'Determine whether ##125## is a unit in ##\mathbb{Z_471}##'
This is the question, I understand the concept, in ##\mathbb{Z_n}## an element is a is a unit if and only if gcd( a,n) =1. My understanding of backwards substitution, ... i have using Euclidean algorithm, ##471 = 3⋅121 + 108## ##121 = 1⋅108 + 13## ##108 =8⋅13+4## ##13=3⋅4+1## ##4=4⋅1+0## using back-substitution, ##1=13-3⋅4## ##=(121-1⋅108)-3(108-8⋅13)## ... ##= 121-(471-3⋅121)-3⋅471+9⋅121+24⋅121-24(471-3⋅121## ##=121-471+3⋅121-3⋅471+9⋅121+24⋅121-24⋅471+72⋅121##...
##\textbf{Exercise 10}:## I came across the following solution online: Questions: 1. When the author states in "that ring (not sure if he is referring to ##R## or ##R/\mathfrak{p}##, but I am guessing the later) ##x_n x_{n+1}=0## for all odd $n$ and ##x_{n+1}## is invertible, so that ##x_n=0##" 2. How does ##x_nx_{n+1}=0## implies that ##x_{n+1}## is invertible and ##x_n=0##. I mean if the quotient ring ##R/\mathfrak{p}## is an integral domain, and ##x_{n+1}## is invertible then...
The following are taken from the two sources, 1) from this online page and the book An Introduction to Module Theory by: Ibrahim Assem, Flavio U. Coelho. In the Abelian Categories chapter in the module theory text on page 157, right after presenting IV.2.21 Definition, the authors states "Image and coimage may or may not exist, but if they do, then they are unique up to isomorphism (because so are kernels and cokernels). Also in the reference url page above, the authors present two...

Similar threads

Replies
3
Views
3K
Replies
1
Views
3K
Replies
2
Views
2K
Replies
6
Views
4K
Replies
20
Views
4K
Replies
2
Views
2K
Replies
3
Views
2K
Back
Top