Symmetric Word Equations in Two Positive Definite Letters

Simple item page
dc.creatorHillar, Christopher J.
dc.creatorJohnson, Charles R.
dc.date2002-09-29
dc.date.accessioned2026-07-07T04:51:21Z
dc.date.available2026-07-07T04:51:21Z
dc.descriptionA generalized word in two positive definite matrices A and B is a finite product of nonzero real powers of A and B. Symmetric words in positive definite A and B are positive definite, and so for fxed B, we can view a symmetric word, S(A,B), as a map from the set of positive definite matrices into itself. Given positive definite P, B, and a symmetric word, S(A,B), with positive powers of A, we defne a symmetric word equation as an equation of the form S(A,B) = P. Such an equation is solvable if there is always a positive definite solution A for any given B and P. We prove that all symmetric word equations are solvable. Applications of this fact, methods for solution, questions about unique solvability (injectivity), and generalizations are also discussed.
dc.description9 pages
dc.identifierhttps://arxiv.org/abs/math/0209399
dc.identifierhttp://arxiv.org/abs/math/0209399
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/65115
dc.subjectRings and Algebras
dc.subjectOperator Algebras
dc.subject15A24; 15A57; 15A18; 15A90
dc.titleSymmetric Word Equations in Two Positive Definite Letters
dc.typetext

Files

Collections

arXiv