Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Unbounded operator
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
== Transpose == {{See also|Transpose of a linear map}} Let <math>T : B_1 \to B_2</math> be an operator between Banach spaces. Then the ''[[transpose]]'' (or ''dual'') <math>{}^t T: {B_2}^* \to {B_1}^*</math> of <math>T</math> is the linear operator satisfying: <math display=block>\langle T x, y' \rangle = \langle x, \left({}^t T\right) y' \rangle</math> for all <math>x \in B_1</math> and <math>y \in B_2^*.</math> Here, we used the notation: <math>\langle x, x' \rangle = x'(x).</math><ref>{{harvnb | Yoshida|1980 | p= 193}}</ref> The necessary and sufficient condition for the transpose of <math>T</math> to exist is that <math>T</math> is densely defined (for essentially the same reason as to adjoints, as discussed above.) For any Hilbert space <math>H,</math> there is the anti-linear isomorphism: <math display=block>J: H^* \to H</math> given by <math>J f = y</math> where <math>f(x) = \langle x \mid y \rangle_H, (x \in H).</math> Through this isomorphism, the transpose <math>{}^t T</math> relates to the adjoint <math>T^*</math> in the following way:<ref>{{harvnb | Yoshida | 1980 | p = 196}}</ref> <math display=block>T^* = J_1 \left({}^t T\right) J_2^{-1},</math> where <math>J_j: H_j^* \to H_j</math>. (For the finite-dimensional case, this corresponds to the fact that the adjoint of a matrix is its conjugate transpose.) Note that this gives the definition of adjoint in terms of a transpose.
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)