zbMATH — the first resource for mathematics

Geometry Search for the term Geometry in any field. Queries are case-independent.
Funct* Wildcard queries are specified by * (e.g. functions, functorial, etc.). Otherwise the search is exact.
"Topological group" Phrases (multi-words) should be set in "straight quotation marks".
au: Bourbaki & ti: Algebra Search for author and title. The and-operator & is default and can be omitted.
Chebyshev | Tschebyscheff The or-operator | allows to search for Chebyshev or Tschebyscheff.
"Quasi* map*" py: 1989 The resulting documents have publication year 1989.
so: Eur* J* Mat* Soc* cc: 14 Search for publications in a particular source with a Mathematics Subject Classification code (cc) in 14.
"Partial diff* eq*" ! elliptic The not-operator ! eliminates all results containing the word elliptic.
dt: b & au: Hilbert The document type is set to books; alternatively: j for journal articles, a for book articles.
py: 2000-2015 cc: (94A | 11T) Number ranges are accepted. Terms can be grouped within (parentheses).
la: chinese Find documents in a given language. ISO 639-1 language codes can also be used.

a & b logic and
a | b logic or
!ab logic not
abc* right wildcard
"ab c" phrase
(ab c) parentheses
any anywhere an internal document identifier
au author, editor ai internal author identifier
ti title la language
so source ab review, abstract
py publication year rv reviewer
cc MSC code ut uncontrolled term
dt document type (j: journal article; b: book; a: book article)
Solving symmetric matrix word equations via symmetric space machinery. (English) Zbl 1105.15013

For a non-empty alphabet 𝒜={A 1 ,A 2 ,} the authors consider a semigroup with identity of generalized words of the form W:=W(A 1 ,,A k )=A 1 p 1 A k p k , where p j are real numbers. The word W is symmetric if it is equal to A k p k A 1 p 1 . A symmetric word equation for 𝐀=𝒜{X,B} is an equation of the form W(X,A 1 ,,A k )=B, where W(X,A 1 ,,A k ) is a symmetric word in X,A 1 ,,A k , all exponents of X are positive, and all exponents of A j are non-negative. Symmetric word equations arised naturally in matrix theory as equations over the cone of positive definite matrices. A symmetric word equation W(X,A)=B is called (uniquely) solvable if there exists a (unique) positive definite solution X of W(X,A)=B for any pair of n×n positive definite matrices A and B. It was proved [see C. J. Hillar and C. R. Johnson, Proc. Am. Math. Soc. 132, 945–953 (2004; Zbl 1038.15005)], that every positive definite word equation is solvable.

The authors investigate the uniqueness conjecture and the continuity of solutions as a function on the variables A and B over positive definite matrices. The main goal of the paper is threefold.

1. The authors demonstrate how the geometric mean of two matrices and its generalizations to weighted means can be used to give explicit solutions to certain classes of equations.

2. It is shown how the geometry of the positive definite matrices equipped with a symmetric structure and a convex Riemannian metric allows to deduce solution for other classes of symmetric equations via the application of the Banach fixed point theorem.

3. It is shown that equations through degree 5 are uniquely solvable and the solution is continuous in A and B. It is noted that the degree 5 is the best possible since it was already shown that there are degree 6 equations possessing with multiple solutions.

15A24Matrix equations and identities