On bilinear maps determined by rank one matrices with some applications

Let M_n be the algebra of all n×n matrix over a field F, A a rank one matrix in M_n. In this article it is shown that if a bilinear map ? from M_n×M_n to M_n satisfies the condition that ?(u,v)=?(I,A) whenever u·v=A, then there exists a linear map φ from M_n to M_n such that . If ? is further assumed to be symmetric then there exists a matrix B such that ?(x,y)=tr(xy)B for all x,y∈M_n. Applying the main result we prove that if a linear map on M_n is desirable at a rank one matrix then it is a derivation, and if an invertible linear map on M_n is automorphisable at a rank one matrix then it is an automorphism. In other words, each rank one matrix in M_n is an all-desirable point and an all-automorphisable point, respectively.     

On classical adjoint-commuting mappings between matrix algebras

Let F be a field and let m and n be integers with m,n?3. Let M_n denote the algebra of n×n matrices over F. In this note, we characterize mappings ψ:M_n→M_m that satisfy one of the following conditions:

1.

|F|=2 or |F|>n+1, and ψ(adj(A+αB))=adj(ψ(A)+αψ(B)) for all A,B∈M_n and α∈F with ψ(I_n)≠0.

2.

ψ is surjective and ψ(adj(A-B))=adj(ψ(A)-ψ(B)) for every A,B∈M_n.

Here, adjA denotes the classical adjoint of the matrix A, and I_n is the identity matrix of order n. We give examples showing the indispensability of the assumption ψ(I_n)≠0 in our results.     

Matrix multiplication is determined by orthogonality and trace

Any associative bilinear multiplication on the set of n-by-n matrices over some field of characteristic not two, that makes the same vectors orthogonal and has the same trace as ordinary matrix multiplication, must be ordinary matrix multiplication or its opposite.     

Idempotent structure of Clifford algebras

Spinor spaces can be represented as minimal left ideals of Clifford algebras and they are generated by primitive idempotents. Primitive idempotents of the Clifford algebras R _{p, q} are shown to be products of mutually nonannihilating commuting idempotent % MathType!MTEF!2!1!+-% feaafeart1ev1aaatCvAUfeBSjuyZL2yd9gzLbvyNv2CaerbuLwBLn% hiov2DGi1BTfMBaeXafv3ySLgzGmvETj2BSbqefm0B1jxALjhiov2D% aebbfv3ySLgzGueE0jxyaibaiGc9yrFr0xXdbba91rFfpec8Eeeu0x% Xdbba9frFj0-OqFfea0dXdd9vqaq-JfrVkFHe9pgea0dXdar-Jb9hs% 0dXdbPYxe9vr0-vr0-vqpWqaaeaabaGaaiaacaqabeaadaqaaqGaaO% qaamaaleaaleaacaaIXaaabaGaaGOmaaaaaaa!3DBD!\[{\textstyle{1 \over 2}}\]2}}\](1+e _T ), where the k=q–r _q–p basis elements e _T satisfy e _T ²=1. The lattice generated by a set of mutually annihilating primitive idempotents is examined. The final result characterizes all Clifford algebras R _{p, q} with an anti-involution such that each symmetric elements is either a nilpotent or then some right multiple of it is a nonzero symmetric idempotent. This happens when p+q<-3 and (p, q)(2, 1).     

Similarity preserving linear maps on upper triangular matrix algebras

In this note we consider similarity preserving linear maps on the algebra of all n × n complex upper triangular matrices T_n. We give characterizations of similarity invariant subspaces in T_n and similarity preserving linear injections on T_n. Furthermore, we considered linear injections on T_n preserving similarity in M_n as well.     

Nonrepresentable relation algebras generated by functional elements

There are nonrepresentable relation algebras generated by their functional elements. This solves a problem posed many years ago. The number of generating functional elements can be as low as 2. This leaves open the problem whether there is a nonrepresentable relation algebra generated by a single functional element.In Celebration of the Sixtieth Birthday of Ralph N. McKenzieReceived November 2, 2001; accepted in final form September 30, 2003.     

Bijective linear maps on semimodules spanned by Boolean matrices of fixed rank

Let M_m,n(B) be the semimodule of all m×n Boolean matrices where B is the Boolean algebra with two elements. Let k be a positive integer such that 2?k?min(m,n). Let B(m,n,k) denote the subsemimodule of M_m,n(B) spanned by the set of all rank k matrices. We show that if T is a bijective linear mapping on B(m,n,k), then there exist permutation matrices P and Q such that T(A)=PAQ for all A∈B(m,n,k) or m=n and T(A)=PA^tQ for all A∈B(m,n,k). This result follows from a more general theorem we prove concerning the structure of linear mappings on B(m,n,k) that preserve both the weight of each matrix and rank one matrices of weight k². Here the weight of a Boolean matrix is the number of its nonzero entries.     

ACI-matrices all of whose completions have the same rank

We characterize the ACI-matrices all of whose completions have the same rank, determine the largest number of indeterminates in such partial matrices of a given size, and determine the partial matrices that attain this largest number.     

Incidence algebras that are uniquely determined by their zero-nonzero matrix pattern

To what extent is the isomorphism type of an incidence algebra determined by the zero-nonzero pattern of a matrix representation? We settle the question in a natural framework where the matrices are subdivided into four blocks: The lower left is zero, the diagonal blocks are fixed, and the upper right is variable.     

On the span of Hadamard products of vectors

Let A₁, … , A_k be positive semidefinite matrices and B₁, … , B_k arbitrary complex matrices of order n. We show that

span{(A₁x)°(A₂x)°?°(A_kx)|x∈Cⁿ}=range(A₁°A₂°?°A_k)     

Rank one preservers between spaces of Boolean matrices

In this paper, we characterize (i) linear transformations from one space of Boolean matrices to another that send pairs of distinct rank one elements to pairs of distinct rank one elements and (ii) surjective mappings from one space of Boolean matrices to another that send rank one matrices to rank one matrices and preserve order relation in both directions. Both results are proved in a more general setting of tensor products of two Boolean vector spaces of arbitrary dimension.     

Additive mappings on symmetric matrices

Additive mappings, which do not increase the minimal rank of symmetric matrices are classified in characteristic two or three.     

Preservers of pairs of bivectors with bounded distance

We extend Liu’s fundamental theorem of the geometry of alternate matrices to the second exterior power of an infinite dimensional vector space and also use her theorem to characterize surjective mappings T from the vector space V of all n×n alternate matrices over a field with at least three elements onto itself such that for any pair A, B in V, rank(A-B)?2k if and only if rank(T(A)-T(B))?2k, where k is a fixed positive integer such that n?2k+2 and k?2.     

Determinant of a matrix that commutes with a Jordan matrix

Given a Jordan matrix J, we obtain an explicit formula for the determinant of any matrix T that commutes with it.     

Jordan forms for mutually annihilating nilpotent pairs

In this paper we completely characterize all possible pairs of Jordan canonical forms for mutually annihilating nilpotent pairs, i.e. pairs (A,B) of nilpotent matrices such that AB=BA=0.     

Invariance properties of a triple matrix product involving generalized inverses

Given complex-valued matrices A, B and C of appropriate dimensions, this paper investigates certain invariance properties of the product AXC with respect to the choice of X, where X is a generalized inverse of B. Different types of generalized inverses are taken into account. The purpose of the paper is three-fold: First, to review known results scattered in the literature, second, to demonstrate the connection between invariance properties and the concept of extremal ranks of matrices, and third, to add new results related to the topic.