Matrices diagonally similar to a symmetric matrix

Let $\text{F}$ be field, and let A and B be n × n matrices with elements in $\text{F}$. Suppose that A is completely reducible and that B is symmetric. If the principal minors of A determined by the 1- and 2-circuits of the graph of B and by the chordless circuits of the graph of A are equal to the corresponding principal minors of B, then A is diagonally similar to B; and conversely.     

Semisimilarity for matrices over a division ring

Two square matrices A and B over a ring R are semisimilar, written A$\text{?}$B, if YAX=B and XBY=A for some (possibly rectangular) matrices X, Y over R. We show that if A and B have the same dimension, and if the ring is a division ring $\text{D}$, then A$\text{?}$B if and only if A² is similar to B² and rank(A^k)=rank(B^k), k=1,2,…     

On D-Paracompact spaces

Following Pareek a topological space X is called D-paracompact if for every open cover $\text{A}$ of X there exists a continuous mapping f from X onto a developable T₁-space Y and an open cover $\text{B}$ of Y such that { f^-1[B]|B ∈ $\text{B}$ } refines $\text{A}$. It is shown that a space is D-paracompact if and only if it is subparacompact and D-expandable. Moreover, it is proved that D-paracompactness coincides with a covering property, called dissectability, which was introduced by the author in order to obtain a base characterization of developable spaces.     

Répartition des densités des sous-suites d'une suite d'entiers

Let $\text{A}$ denote a strictly increasing sequence of integers; for any integer n, define A(n) to be the number of positive elements of $\text{A}$ not exceeding n. The upper and lower asymptotic densities of $\text{A}$ are defined by

We describe the set of pairs (d$\text{B}$, $\text{d}$$\text{B}$), where $\text{B}$ runs over all subsequences of $\text{A}$, as being a closed convex region of the plane. The converse statement is also proved.     

On the convergence of powers of interval matrices

We give a necessary and sufficient condition for the sequence {$\text{A}$^k}of the powers of an interval matrix $\text{A}$ to converge to the null matrix $\text{O}$. We construct a point matrix $\text{B}$ which has spectral radius ? ($\text{B}$) less than one if {$\text{A}$^k}converges.     

The Lyapunov matrix equation SA+A1S=S1B1BS

The matrix equation $\text{SA+A}{}^1\text{S=S}{}^1\text{B}{}^1\text{BS}$ is studied, under the assumption that (A, B¹) is controllable, but allowing nonhermitian S. An inequality is given relating the dimensions of the eigenspaces of A and of the null space of S. In particular, if B has rank 1 and S is nonsingular, then S is hermitian, and the inertias of A and S are equal. Other inertial results are obtained, the role of the controllability of (A¹, B¹S¹) is studied, and a class of D-stable matrices is determined.     

More bounds for elgenvalues using traces

Let the n × n complex matrix A have complex eigenvalues λ₁,λ₂,…λ_n. Upper and lower bounds for Σ(Reλ_i)² are obtained, extending similar bounds for Σ|λ_i|² obtained by Eberlein (1965), Henrici (1962), and Kress, de Vries, and Wegmann (1974). These bounds involve the traces of A¹A, B², C², and D², where $\text{B}\text{=}\text{1}\text{2}\text{(}\text{A}\text{+}\text{A}{}^1\text{)}$, $\text{C}\text{=}\text{1}\text{2}\text{(}\text{A}\text{?}\text{A}{}^1\text{) /i}$, and $\text{D}\text{=}\text{AA}{}^1\text{?}\text{A}{}^1\text{A}$, and strengthen some of the results in our earlier paper “Bounds for eigenvalues using traces” in Linear Algebra and Appl. [12].     

Nonnegative factorization of completely positive matrices

Let A be a real symmetric n × n matrix of rank k, and suppose that A = BB′ for some real n × m matrix B with nonnegative entries (for some m). (Such an A is called completely positive.) It is shown that such a B exists with $\text{m?}\text{1}\text{2}\text{k(k+1)?N}$, where 2N is the maximal number of (off-diagonal) entries which equal zero in a nonsingular principal submatrix of A. An example is given where the least m which works is $\text{(k+1)}{}^2\text{4}$ (k odd),$\text{k(k+2)}\text{4}$ (k even).     

A generalization of Lavoie's inequality concerning the sum of idempotent matrices

Let a complex pxn matrix A be partitioned as A′=(A′₁,A′₂,…,A′_k). Denote by ?(A), A′, and A^? respectively the rank of A, the transpose of A, and an inner inverse (or a g-inverse) of A. Let A⁽¹⁴⁾ be an inner inverse of A such that A⁽¹⁴⁾A is a Hermitian matrix. Let B=(A⁽¹⁴⁾₁,A⁽¹⁴⁾₂,…,A_k⁽¹⁴⁾) and $\text{ρ(A)=}\text{∑}\text{i=1}\text{k}\text{ρ(A}{}_{\mathrm{i}}\text{)}$.Then the product of nonzero eigenvalues of BA (or AB) cannot exceed one, and the product of nonzero eigenvalues of BA is equal to one if and only if either B=A⁽¹⁴⁾ or $\text{A}{}_{\mathrm{i>}}\text{A}{}_{\mathrm{<mtext>j</mtext>}}{}^1\text{=0}$ for all i ≠ j,i, j=1,2,…,k . The results of Lavoie (1980) and Styan (1981) are obtained as particular cases. A result is obtained for k=2 when the condition $\text{ρ(A)=}\text{∑}\text{i=1}\text{k}\text{ρ(A}{}_{\mathrm{i}}\text{)}$ is no longer true.     

On majorization and Schur products

Suppose A, D₁,…,D_m are n × n matrices where A is self-adjoint, and let $\text{X = Σ}{}^{\mathrm{m}}{}_{\mathrm{k\; =\; 1}}\text{D}{}_{\mathrm{k}}\text{AD}{}^1{}_{\mathrm{k}}$. It is shown that if $\text{ΣD}{}_{\mathrm{k}}\text{D}{}^1{}_{\mathrm{k}}\text{= ΣD}{}^1{}_{\mathrm{k}}\text{D}{}_{\mathrm{k}}\text{= I}$, then the spectrum of X is majorized by the spectrum of A. In general, without assuming any condition on D₁,…,D_m, a result is obtained in terms of weak majorization. If each D_k is a diagonal matrix, then X is equal to the Schur (entrywise) product of A with a positive semidefinite matrix. Thus the results are applicable to spectra of Schur products of positive semidefinite matrices. If A, B are self-adjoint with B positive semidefinite and if b_ii = 1 for each i, it follows that the spectrum of the Schur product of A and B is majorized by that of A. A stronger version of a conjecture due to Marshall and Olkin is also proved.     

On the semi-definiteness of the real pencil of two Hermitian matrices

Let A and B be two n×n real symmetric matrices. A theorem of Calabi and Greub-Milnor states that if n?3 and A and B satisfy the condition

$\text{(uAu′)}{}^2\text{+ (uBu′)}{}^2\text{≠ 0}$

for all nonzero vectors u, then there is a linear combination of A and B that is definite. In this note, the author proves two theorems of the semi-definiteness of a nontrivial linear combination of A and B by replacing the condition (¹) by another condition. One of these theorems is a generalization of the theorem of Greub-Milnor and Calabi.     

On the Schur multiplier norm of matrices

The Schur product of two n×n complex matrices A=(a_ij), B=(b_ij) is defined by A°B=(a_ijb_ij. By a result of Schur [2], the algebra of n×n matrices with Schur product and the usual addition is a commutative Banach algebra under the operator norm (the norm of the operator defined on $\text{C}$ⁿ by the matrix). For a fixed matrix A, the norm of the operator B?A°B on this Banach algebra is called the Schur multiplier norm of A, and is denoted by ∥A∥^m. It is proved here that $\text{∥A∥=∥U}{}^1\text{AU∥}{}_{\mathrm{m}}$ for all unitary U (where ∥·∥ denotes the operator norm) iff A is a scalar multiple of a unitary matrix; and that ∥A∥_m=∥A∥ iff there exist two permutations P, Q, a p×p (1?p?n) unitary U, an (n?p)×(n?p)1 contraction C, and a nonnegative number λ such that

$\text{A=λP}\text{U}\text{0}\text{0}\text{C}\text{Q;}$

and this is so iff $\text{∥A°}\text{A}\text{?}\text{∥=∥A∥}{}^2$, where ā is the matrix obtained by taking entrywise conjugates of A.     

On maximizing det (ATA)

Let A be an n × p matrix of ± 1's, n ? p. The problem considered is the destination of the maximal value of det(A^TA). The complete solution is given for p ? 4, and for $\text{p = 5, n}\text{x}\text{?}\text{2}$ (mod 4) if the Hadamard conjecture is true. For p > 5, the maximum value is determined for n sufficiently large compared to p and provided certain Hadamard matrices exist.     

When the positivity of the leading principal minors implies the positivity of all principal minors of a matrix

An n-by-n real matrix A enjoys the “leading implies all” (LIA) property, if, whenever D   is a diagonal matrix such that A+D$A+D$ has positive leading principal minors (PMs), all PMs of A are positive. Symmetric and Z-matrices are known to have this property. We give a new class of matrices (“mixed matrices”) that both unifies and generalizes these two classes and their special diagonal equivalences by also having the LIA property. “Nested implies all” (NIA) is also enjoyed by this new class.     

On ranges of Lyapunov transformations

A Lyapunov transformation is a linear transformation on the set $\text{H}$_n of hermitian matrices H ? $\text{C}$^n,n of the form $\text{L}$_A(H) = A¹H + HA, where A ?$\text{C}$^n,n. Given a positive stable A ?$\text{C}$^n,n, the Stein-Pfeffer Theorem characterizes those K ? $\text{H}$_n for which K = $\text{L}$_B(H), where B is similar to A and H is positive definite. We give a new proof of this result, and extend it in several directions. The proofs involve the idea of a controllability subspace, employed previously in this context by Snyders and Zakai.     

Sur l'η-expansion infinieOn infinite η-expansion

We give two characterizations of the ordering on Böhm trees induced by the D_∞ model, one of which formalizes a continuity property of infinite η-expansion: $\text{A}\text{?}{}_{\mathrm{\infty }}\text{B}$ if for any finite approximant A of $\text{A}$ there exists a finite approximant B of $\text{B}$ such that A is a sub-tree of B, modulo finitely many η-equalities and finitely many infinite η-expansions of variables. To cite this article: P.-L. Curien, C. R. Acad. Sci. Paris, Ser. I 334 (2002) 77–82