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
Reflexive operator algebra
(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!
== Examples == [[Nest algebra]]s are examples of reflexive operator algebras. In finite dimensions, these are simply algebras of all matrices of a given size whose nonzero entries lie in an upper-triangular pattern. In fact if we fix any pattern of entries in an ''n'' by ''n'' matrix containing the diagonal, then the set of all ''n'' by ''n'' matrices whose nonzero entries lie in this pattern forms a reflexive algebra. An example of an algebra which is ''not'' reflexive is the set of 2 Γ 2 matrices :<math>\left\{ \begin{pmatrix} a&b\\ 0 & a \end{pmatrix} \ :\ a,b\in\mathbb{C}\right\}.</math> This algebra is smaller than the Nest algebra :<math>\left\{ \begin{pmatrix} a&b\\ 0 & c \end{pmatrix} \ :\ a,b,c\in\mathbb{C}\right\}</math> but has the same invariant subspaces, so it is not reflexive. If ''T'' is a fixed ''n'' by ''n'' matrix then the set of all polynomials in ''T'' and the identity operator forms a unital operator algebra. A theorem of Deddens and Fillmore states that this algebra is reflexive if and only if the largest two blocks in the [[Jordan normal form]] of ''T'' differ in size by at most one. For example, the algebra :<math>\left\{ \begin{pmatrix} a & b & 0\\ 0 & a & 0\\ 0 & 0 & a \end{pmatrix} \ :\ a,b\in\mathbb{C}\right\}</math> which is equal to the set of all polynomials in :<math> T=\begin{pmatrix} 0 & 1 & 0\\ 0 & 0 & 0\\ 0 & 0 & 0 \end{pmatrix} </math> and the identity is reflexive.
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)