Additive Hermitian idempotent preservers between operator algebras

Let L be an additive map between (real or complex) matrix algebras sending $n\times n$ Hermitian idempotent matrices to $m\times m$ Hermitian idempotent matrices. We show that there are nonnegative integers $p,q$ with $n(p+q)=r\le m$ and an $m\times m$ unitary matrix U such that$L(A)=U[(I_p?A)\oplus (I_q?A^t)\oplus 0_{m?r}]U^{?},\text{for any}n\times n\text{Hermitian}A\text{with rational trace}.$ We also extend this result to the (complex) von Neumann algebra setting, and provide a supplement to the Dye-Bunce-Wright Theorem asserting that every additive map of Hermitian idempotents extends to a Jordan ?-homomorphism.     

非负定阵元素的扰动和正定完备化

在保持非负定性不变的前提下,本文对矩阵每一元素容许多大的扰动作了进一步的研究, 将本文的结论和C．R．Johnson提出的部分正定阵的正定完备化进行比较,容易发现对已知的正定矩阵求扰动,本文的结论比用C．R.Johnson的正定完备化计算扰动形式上更简单,同时也给出了不同于C．R．Johnson的部分正定阵的正定完备化表示的另外一个公式,推出了这些正定完备化矩阵应具有的若干性质．     

Matrix extensions and eigenvalue completions, the generic case

In this paper we provide new necessary and sufficient conditions for the so-called eigenvalue completion problem.

     

A note on strongly π-regular rings

Let R be an associative ring with unit and let N(R) denote the set of nilpotent elements of R. R is said to be stronglyπ-regular if for each x∈R, there exist a positive integer n and an element y∈R such that x ⁿ=x ^{n +1} y and xy=yx. R is said to be periodic if for each x∈R there are integers m,n≥ 1 such that m≠n and x ^m=x ⁿ. Assume that the idempotents in R are central. It is shown in this paper that R is a strongly π-regular ring if and only if N(R) coincides with the Jacobson radical of R and R/N(R) is regular. Some similar conditions for periodic rings are also obtained. This revised version was published online in June 2006 with corrections to the Cover Date.     

Idempotency of Extensions via the Bicompletion

Let Top ₀ be the category of topological T ₀-spaces, QU ₀ the category of quasi-uniform T ₀-spaces, T : QU ₀ → Top ₀ the usual forgetful functor and K : QU ₀ → QU ₀ the bicompletion reflector with unit k : 1 → K. Any T-section F : Top ₀ → QU ₀ is called K-true if KF = FTKF, and upper (lower) K-true if KF is finer (coarser) than FTKF. The literature considers important T-sections F that enjoy all three, or just one, or none of these properties. It is known that T(K,k)F is well-pointed if and only if F is upper K-true. We prove the surprising fact that T(K,k)F is the reflection to Fix(TkF) whenever it is idempotent. We also prove a new characterization of upper K-trueness. We construct examples to set apart some natural cases. In particular we present an upper K-true F for which T(K,k)F is not idempotent, and a K-true F for which the coarsest associated T-preserving coreflector in QU ₀ is not stable under K. We dedicate this paper to the memory of Sérgio de Ornelas Salbany (1941–2005).     

Distributive lattices of numberings

We study into a semilattice of numberings generated by a given fixed numbering via operations of completion and taking least upper bounds. It is proved that, except for the trivial cases, this semilattice is an infinite distributive lattice every principal ideal in which is finite. The least upper and the greatest lower bounds in the semilattice are invariant under extensions in the semilattice of all numberings. Isomorphism types for the semilattices in question are in one-to-one correspondence with pairs of cardinals the first component of which is equal to the cardinality of a set of non-special elements, and the second — to the cardinality of a set of special elements, of the initial numbering. Supported by INTAS grant No. 00-429. __________ Translated from Algebra i Logika, Vol. 46, No. 1, pp. 83–102, January–February, 2007.     

半群K(n,r)中的幂等生成元

设Singn是由一个n元集上的所有奇异变换所构成的奇异变换半群，I是由Singn中一些亏数为1的幂等元组成的集合，Howie利用有向图证明了：I是Singn的一个生成集当且仅当与其相应的有向图D（I）是强连通的完全图，本文利用多重有向图将这一结果推广到Singn的每个理想K（,r)上。     

Identifying phylogenetic trees

A central problem that arises in evolutionary biology is that of displaying partitions of subsets of a finite set X on a tree whose vertices are partially labelled with the elements of X. Such a tree is called an X-tree and, for a collection of partitions of subsets of X, characterisations for the existence and uniqueness of an X-tree that displays have been previously given in terms of chordal graphs. In this paper, we obtain two closely related characterisations also in terms of chordal graphs. The first describes when identifies an X-tree, and the second describes when a compatible subset of is of maximum size.     

The completely positive and doubly nonnegative completion problems

We prove the following. Let G be an undirected graph. Every partially specified symmetric matrix, the graph of whose specified entries is G and each of whose fully specified submatrices is completely positive (equal to BB^T for some entrywise nonnegative matrix B), may be completed to a completely positive matrix if and only if G is a block-clique graph (a chordal graph in which distinct maximal cliques overlap in at most one vertex). The same result holds for matrices that are doubly nonnegative (entrywise nonnegative and positive semidefinite).