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
Polar decomposition
(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!
==Unbounded operators== If ''A'' is a closed, densely defined [[unbounded operator]] between complex Hilbert spaces then it still has a (unique) '''polar decomposition''' <math display="block"> A = U |A|, </math> where |''A''| is a (possibly unbounded) non-negative self-adjoint operator with the same domain as ''A'', and ''U'' is a partial isometry vanishing on the orthogonal complement of the range ran(|''A''|). The proof uses the same lemma as above, which goes through for unbounded operators in general. If dom(''A''{{sup|*}}''A'') = dom(''B{{sup|*}}B''), and ''A''{{sup|*}}''Ah'' = ''B''{{sup|*}}''Bh'' for all ''h'' β dom(''A''{{sup|*}}''A''), then there exists a partial isometry ''U'' such that ''A'' = ''UB''. ''U'' is unique if ran(''B'')<sup>β₯</sup> β ker(''U''). The operator ''A'' being closed and densely defined ensures that the operator ''A''{{sup|*}}''A'' is self-adjoint (with dense domain) and therefore allows one to define (''A''{{sup|*}}''A'')<sup>1/2</sup>. Applying the lemma gives polar decomposition. If an unbounded operator ''A'' is [[affiliated operator|affiliated]] to a von Neumann algebra '''M''', and ''A'' = ''UP'' is its polar decomposition, then ''U'' is in '''M''' and so is the spectral projection of ''P'', 1<sub>''B''</sub>(''P''), for any Borel set ''B'' in {{closed-open|0, β}}.
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)