Displaying similar documents to “Rank α operators on the space C(T,X)”

Finite-rank perturbations of positive operators and isometries

Man-Duen Choi, Pei Yuan Wu (2006)

Studia Mathematica

Similarity:

We completely characterize the ranks of A - B and A 1 / 2 - B 1 / 2 for operators A and B on a Hilbert space satisfying A ≥ B ≥ 0. Namely, let l and m be nonnegative integers or infinity. Then l = rank(A - B) and m = r a n k ( A 1 / 2 - B 1 / 2 ) for some operators A and B with A ≥ B ≥ 0 on a Hilbert space of dimension n (1 ≤ n ≤ ∞) if and only if l = m = 0 or 0 < l ≤ m ≤ n. In particular, this answers in the negative the question posed by C. Benhida whether for positive operators A and B the finiteness of rank(A - B) implies that...

Rank and perimeter preserver of rank-1 matrices over max algebra

Seok-Zun Song, Kyung-Tae Kang (2003)

Discussiones Mathematicae - General Algebra and Applications

Similarity:

For a rank-1 matrix A = a b t over max algebra, we define the perimeter of A as the number of nonzero entries in both a and b. We characterize the linear operators which preserve the rank and perimeter of rank-1 matrices over max algebra. That is, a linear operator T preserves the rank and perimeter of rank-1 matrices if and only if it has the form T(A) = U ⊗ A ⊗ V, or T ( A ) = U A t V with some monomial matrices U and V.

Finite rank operators in Jacobson radical 𝒩

Zhe Dong (2006)

Czechoslovak Mathematical Journal

Similarity:

In this paper we investigate finite rank operators in the Jacobson radical 𝒩 of A l g ( 𝒩 ) , where 𝒩 , are nests. Based on the concrete characterizations of rank one operators in A l g ( 𝒩 ) and 𝒩 , we obtain that each finite rank operator in 𝒩 can be written as a finite sum of rank one operators in 𝒩 and the weak closure of 𝒩 equals A l g ( 𝒩 ) if and only if at least one of 𝒩 , is continuous.

Rational realization of the minimum ranks of nonnegative sign pattern matrices

Wei Fang, Wei Gao, Yubin Gao, Fei Gong, Guangming Jing, Zhongshan Li, Yan Ling Shao, Lihua Zhang (2016)

Czechoslovak Mathematical Journal

Similarity:

A sign pattern matrix (or nonnegative sign pattern matrix) is a matrix whose entries are from the set { + , - , 0 } ( { + , 0 } , respectively). The minimum rank (or rational minimum rank) of a sign pattern matrix 𝒜 is the minimum of the ranks of the matrices (rational matrices, respectively) whose entries have signs equal to the corresponding entries of 𝒜 . Using a correspondence between sign patterns with minimum rank r 2 and point-hyperplane configurations in r - 1 and Steinitz’s theorem on the rational realizability...

A new rank formula for idempotent matrices with applications

Yong Ge Tian, George P. H. Styan (2002)

Commentationes Mathematicae Universitatis Carolinae

Similarity:

It is shown that rank ( P * A Q ) = rank ( P * A ) + rank ( A Q ) - rank ( A ) , where A is idempotent, [ P , Q ] has full row rank and P * Q = 0 . Some applications of the rank formula to generalized inverses of matrices are also presented.

Infinite rank of elliptic curves over a b

Bo-Hae Im, Michael Larsen (2013)

Acta Arithmetica

Similarity:

If E is an elliptic curve defined over a quadratic field K, and the j-invariant of E is not 0 or 1728, then E ( a b ) has infinite rank. If E is an elliptic curve in Legendre form, y² = x(x-1)(x-λ), where ℚ(λ) is a cubic field, then E ( K a b ) has infinite rank. If λ ∈ K has a minimal polynomial P(x) of degree 4 and v² = P(u) is an elliptic curve of positive rank over ℚ, we prove that y² = x(x-1)(x-λ) has infinite rank over K a b .

Perimeter preserver of matrices over semifields

Seok-Zun Song, Kyung-Tae Kang, Young Bae Jun (2006)

Czechoslovak Mathematical Journal

Similarity:

For a rank- 1 matrix A = 𝐚 𝐛 t , we define the perimeter of A as the number of nonzero entries in both 𝐚 and 𝐛 . We characterize the linear operators which preserve the rank and perimeter of rank- 1 matrices over semifields. That is, a linear operator T preserves the rank and perimeter of rank- 1 matrices over semifields if and only if it has the form T ( A ) = U A V , or T ( A ) = U A t V with some invertible matrices U and V.