In functional analysis, a reflexive operator algebra A is an operator algebra that has enough invariant subspaces to characterize it. Formally, A is reflexive if it is equal to the algebra of bounded operators which leave invariant each subspace left invariant by every operator in A. This should not be confused with a reflexive space.
Examples Nest algebras 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
{ ( a b 0 a ) : a , b ∈ C } . {\displaystyle \left\{{\begin{pmatrix}a&b\\0&a\end{pmatrix}}\ :\ a,b\in \mathbb {C} \right\}.}
This algebra is smaller than the Nest algebra
{ ( a b 0 c ) : a , b , c ∈ C } {\displaystyle \left\{{\begin{pmatrix}a&b\\0&c\end{pmatrix}}\ :\ a,b,c\in \mathbb {C} \right\}}
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
{ ( a b 0 0 a 0 0 0 a ) : a , b ∈ C } {\displaystyle \left\{{\begin{pmatrix}a&b&0\\0&a&0\\0&0&a\end{pmatrix}}\ :\ a,b\in \mathbb {C} \right\}}
which is equal to the set of all polynomials in
T = ( 0 1 0 0 0 0 0 0 0 ) {\displaystyle T={\begin{pmatrix}0&1&0\\0&0&0\\0&0&0\end{pmatrix}}}
and the identity is reflexive.
Hyper-reflexivity Let A {\displaystyle {\mathcal {A}}} be a weak*-closed operator algebra contained in B(H), the set of all bounded operators on a Hilbert space H and for T any operator in B(H), let
β ( T , A ) = sup { ‖ P ⊥ T P ‖ : P is a projection and P ⊥ A P = ( 0 ) } . {\displaystyle \beta (T,{\mathcal {A}})=\sup \left\{\left\|P^{\perp }TP\right\|\ :\ P{\mbox{ is a projection and }}P^{\perp }{\mathcal {A}}P=(0)\right\}.}
… excerpt ends here. Continue reading the full article.
