Displaying similar documents to “The decomposability of operators relative to two subspaces”

Operators in finite distributive subspace lattices II

N. Spanoudakis (1994)

Studia Mathematica

Similarity:

In a previous paper we gave an example of a finite distributive subspace lattice ℒ on a Hilbert space and a rank two operator of Algℒ that cannot be written as a finite sum of rank one operators from Algℒ. The lattice ℒ was a specific realization of the free distributive lattice on three generators. In the present paper, which is a sequel to the aforementioned one, we study Algℒ for the general free distributive lattice with three generators (on a normed space). Necessary and sufficient...

Quasireducible operators.

Kubrusly, C. S. (2003)

International Journal of Mathematics and Mathematical Sciences

Similarity:

On λ-commuting operators

John B. Conway, Gabriel Prǎjiturǎ (2005)

Studia Mathematica

Similarity:

For a scalar λ, two operators T and S are said to λ-commute if TS = λST. In this note we explore the pervasiveness of the operators that λ-commute with a compact operator by characterizing the closure and the interior of the set of operators with this property.

Trace and determinant in Banach algebras

Bernard Aupetit, H. Mouton (1996)

Studia Mathematica

Similarity:

We show that the trace and the determinant on a semisimple Banach algebra can be defined in a purely spectral and analytic way and then we obtain many consequences from these new definitions.

Compact AC-operators

Ian Doust, Byron Walden (1996)

Studia Mathematica

Similarity:

We prove that compact AC-operators have a representation as a combination of disjoint projections which mirrors that for compact normal operators. We also show that unlike arbitrary AC-operators, compact AC-operators admit a unique splitting into real and imaginary parts, and that these parts must necessarily be compact.

Zero-term rank preservers of integer matrices

Seok-Zun Song, Young-Bae Jun (2006)

Discussiones Mathematicae - General Algebra and Applications

Similarity:

The zero-term rank of a matrix is the minimum number of lines (row or columns) needed to cover all the zero entries of the given matrix. We characterize the linear operators that preserve the zero-term rank of the m × n integer matrices. That is, a linear operator T preserves the zero-term rank if and only if it has the form T(A)=P(A ∘ B)Q, where P, Q are permutation matrices and A ∘ B is the Schur product with B whose entries are all nonzero integers.