Why we solve the operator equation AX − XB = C ∗ † ‡
نویسنده
چکیده
This work studies how certain problems in quantum theory have motivated some recent reseach in pure Mathematics in matrix and operator theory. The mathematical key is that of a commutator or a generalized commutator, that is, find an operator X ∈ B(H) satisfying the operator equation AX − XB = C. By this we will show how and why to solve the operator equation AX − XB = C. Some problems are studied and some open questions are also given.
منابع مشابه
Consistency and efficient solution of the Sylvester equation for *-congruence
In this paper, the matrix equation AX + XB = C is considered, where the matrices A and B have sizes m × n and n × m, respectively, the size of the unknown X is n × m, and the operator (·) denotes either the transpose or the conjugate transpose of a matrix. In the first part of the paper, necessary and sufficient conditions for the existence and uniqueness of solutions are reviewed. These condit...
متن کاملTHE FUGLEDE–PUTNAM THEOREM AND PUTNAM’S INEQUALITY FOR QUASI-CLASS (A, k) OPERATORS
An operator T ∈ B(H) is called quasi-class (A, k) if T ∗k(|T | − |T |)T k ≥ 0 for a positive integer k, which is a common generalization of class A. The famous Fuglede–Putnam’s theorem is as follows: the operator equation AX = XB implies A∗X = XB∗ when A and B are normal operators. In this paper, firstly we show that if X is a Hilbert-Schmidt operator, A is a quasi-class (A, k) operator and B∗ ...
متن کاملThe solutions to some operator equations in Hilbert $C^*$-module
In this paper, we state some results on product of operators with closed ranges and we solve the operator equation $TXS^*-SX^*T^*= A$ in the general setting of the adjointable operators between Hilbert $C^*$-modules, when $TS = 1$. Furthermore, by using some block operator matrix techniques, we nd explicit solution of the operator equation $TXS^*-SX^*T^*= A$.
متن کاملEla Consistency and Efficient Solution of the Sylvester Equation for ⋆-congruence∗
In this paper, the matrix equation AX + XB = C is considered, where the matrices A and B have sizes m × n and n × m, respectively, the size of the unknown X is n × m, and the operator (·) denotes either the transpose or the conjugate transpose of a matrix. In the first part of the paper, necessary and sufficient conditions for the existence and uniqueness of solutions are reviewed. These condit...
متن کاملOn the solving matrix equations by using the spectral representation
The purpose of this paper is to solve two types of Lyapunov equations and quadratic matrix equations by using the spectral representation. We focus on solving Lyapunov equations $AX+XA^*=C$ and $AX+XA^{T}=-bb^{T}$ for $A, X in mathbb{C}^{n times n}$ and $b in mathbb{C} ^{n times s}$ with $s < n$, which $X$ is unknown matrix. Also, we suggest the new method for solving quadratic matri...
متن کامل