Solvability of certain quadratic operator equations and representations of Drazin inverses (Q2637152)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 6259542
Language Label Description Also known as
default for all languages
No label defined
    English
    Solvability of certain quadratic operator equations and representations of Drazin inverses
    scientific article; zbMATH DE number 6259542

      Statements

      Solvability of certain quadratic operator equations and representations of Drazin inverses (English)
      0 references
      0 references
      0 references
      0 references
      19 February 2014
      0 references
      Let \(E\) be a Banach space and \(B(E)\) be the space of all bounded linear operators on \(E\). An operator \(A\in B(E)\) is said to be Drazin invertible (with finite index) if there exist \(B \in B(E)\) and \(k \in\{0\}\cup\mathbb{N}\) such that \(AB = BA\), \(BAB = B\) and \(A^k = A^{k+1}B\). The authors prove that, if \(A \in B(E)\) is invertible, \(B \in B(E)\) is nilpotent, \(AB=BA\) or \(E=\mathbb{C}^n\) for \(n=2,3\) and \(B^2=0\), then the equation \(AX + X^2 = B\) is solvable. They also construct a counterexample to show that the equation \(XA + I = XBX\) is unsolvable for some invertible operator \(A \in B(E)\) and nilpotent operator \(B \in B(E)\). When \(A, B\in B(E)\) are Drazin invertible and \(AB = BA\), without using binomial coefficients, they provide a new formula for the Drazin inverse of the \(2\times 2\) matrix \((A,B;I,0)\), see also [\textit{C.-J. Bu} et al., Linear Multilinear Algebra 59, No. 8, 863--877 (2011; Zbl 1227.15002)].
      0 references
      quadratic operator equation
      0 references
      nilpotent
      0 references
      Drazin inverse
      0 references
      solvability
      0 references
      0 references
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references