Generalized Right Core Inverse in *-Banach Algebras

Preprint

Article

Generalized Right Core Inverse in *-Banach Algebras

Altmetrics

Downloads

Views

Comments

Huanyin Chen^*,Marjan Sheibani

This version is not peer-reviewed

Submitted:

18 June 2024

Posted:

18 June 2024

You are already at the latest version

Alerts

Abstract

We introduce a new generalized inverse which is a natural generalization of (pseudo) right core inverse in a Banach *-algebra. We characterize this generalized inverse by using right core and quasi-nilpotent decomposition. We then present its polar-like characterization and investigate related algebraic properties. Finally, the right core-EP inverse is characterized by certain new ways.

Keywords:

Subject: Computer Science and Mathematics - Algebra and Number Theory

MSC: 15A09, 16U90, 46H05

1. Introduction

A Banach algebra

A

is called a Banach *-algebra if there exists an involution

* : x \to x^{*}

satisfying

{(x + y)}^{*} = x^{*} + y^{*}, {(λ x)}^{*} = \bar{λ} x^{*}, {(x y)}^{*} = y^{*} x^{*}, {(x^{*})}^{*} = x

. An element a in a Banach *-algebra

A

has core inverse if and only if there exist

x \in A

such that

a x^{2} = x, {(a x)}^{*} = a x, x a^{2} = a .

If such x exists, it is unique, and denote it by

a^{◯ #}

( see[1,9,16]).

Wang et al. generalized the core inverse to the right core inverse (see [14]). An element

a \in A

has right core inverse if there exist

x \in A

such that

a x^{2} = x, {(a x)}^{*} = a x, a x a = a .

If such x exists, it is unique, and denote it by

a_{r}^{◯ #}

. Let

A_{r}^{◯ #}

denote the set of all right core invertible elements in

A

. Here we list some characterizations of right core inverse.

Theorem 1.(see [14]) Let

A

be a Banach *-algebra, and let

a \in A

. Then the following are equivalent:

(1): $a \in A_{r}^{◯ #}$ .
(2): There exists some $x \in A$ such that

$a x a = a, x = x a x, a x^{2} = x, {(a x)}^{*} = a x .$
(3): $a \in A^{(1, 3)}$ and $a A = a^{2} A$ .
(4): $a \in A$ is right $(a, a^{*})$ -invertible.
(5): $A a = A {(a^{*})}^{2} a$ .
(6): There exists unique an idempotent $p \in A$ such that

$p a = 0, a + p \in A i s r i g h t i n v e r t i b l e .$

In [6], Gao and Chen extended the concept of the core inverse and introduced the notion of core-EP inverse (i.e., pseudo core inverse). An element

a \in A

has core-EP inverse if there exist

x \in A

and

k \in N

such that

a x^{2} = x, {(a x)}^{*} = a x, x a^{k + 1} = a^{k} .

If such x exists, it is unique, and denote it by

a^{Ⓓ}

. Many authors have investigated core-EP inverses from many different views, e.g., [6,7,10,11,12,13].

The motivation of this paper is to introduce and study a new kind of generalized inverse as a natural generalization of generalized inverses mentioned above. Let

A^{q n i l} = {x \in A ∣ lim_{n \to \infty} ‖ x^{n} ‖^{\frac{1}{n}} = 0} .

Evidently,

x \in A^{q n i l}

if and only if

1 + λ x \in A

is invertible for any

λ \in C

Definition 1.

An element

a \in A

has generalized right core decomposition if there exist

x, y \in A

such that

a = x + y, x^{*} y = y x = 0, x \in A_{r}^{◯ #}, y \in A^{q n i l} .

In Section 2, we prove that

a \in A

has generalized right core decomposition if and only if there exist unique a

x \in A

such that

x = a x^{2}, {(a x)}^{*} = a x, lim_{n \to \infty} | | a^{n} - a x a^{n} {| |}^{\frac{1}{n}} = 0 .

The preceding x is called generalized right core inverse of a and we denote it by

a_{r}^{ⓓ}

Recall that

a \in A

has generalized Drazin inverse if there exists

x \in A

such that

a x = x a, a x^{2} = x, a - a^{2} x \in A^{q n i l} .

Such x is unique, if it exists, and denote it by

a^{d}

. As it is well known, a has generalized Drazin inverse if and only if it has quasi-polar property, i.e., there exists an idempotent

p \in A

such that

a + p \in A^{- 1}

and

a p = p a \in A^{q n i l}

(see [2, Theorem 6.4.8]). In Section 3, we characterize generalized right core inverse by using a polar-like property. We prove that

a \in A

has generalized right core inverse if and only if there exists a projection

p \in A

(i.e.,

p^{2} = p = p^{*}

)such that

a + p \in A i s r i g h t i n v e r t i b l e, a p \in A^{q n i l}, (1 - p) A = a (1 - p) A .

Related equivalent characterizations are given.

In Section 4, we are concerned with algebraic properties of generalized right core inverse. The necessary and sufficient conditions under which the sum of two generalized right core invertible elements has generalized right core inverse are established.

Following Wang et al.(see [14]), an element a in

A

has right core-EP (i.e., right pseudo core) inverse if there exists

x \in A

such that

x = a x^{2}, {(a x)}^{*} = a x, a^{n} = a x a^{n} .

Such x is unique, if exists, and denote it by

a_{r}^{Ⓓ}

. Finally, in Section 5, the right core-EP inverse is characterized by certain new ways.

Throughout the paper, all Banach *-algebras are complex with an identity. We use

A_{r}^{- 1}, A_{r}^{ⓓ}, A^{Ⓓ}

and

A_{r}^{Ⓓ}

to denote the sets of all right invertible, generalized right core invertible, core-EP invertible and right core-EP invertible elements in

A

, respectively. Let

A^{n i l}

denote the set of all nilpotents in

A

. If a and x satisfy the equations

a = a x a

and

{(a x)}^{*} = e a x

, then x is called

(1, 3)

-inverse of a and is denoted by

a^{(1, 3)}

. We use

A^{(1, 3)}

to stand for the set of all

(1, 3)

-invertible elements in

A

2. generalized right core inverse

In this section, we introduce generalized right core inverse by using a kind of right core and quasi-nilpotent decomposition. We begin with

Theorem 2.

Let

a \in A

. Then the following are equivalent:

(1): $a \in A$ has generalized right core decomposition.
(2): There exist $x \in A$ such that

$x = a x^{2}, {(a x)}^{*} = a x, lim_{n \to \infty} | | a^{n} - a x a^{n} {| |}^{\frac{1}{n}} = 0 .$

Proof.

(1) \Rightarrow (2)

By hypothesis, there exist

z, y \in A

such that

a = z + y, z^{*} y = y z = 0, z \in A_{r}^{◯ #}, y \in A^{q n i l} .

Set

x = z_{r}^{◯ #}

. Then we check that

\begin{matrix} a x & = & (z + y) z_{r}^{◯ #} = z z_{r}^{◯ #}, \\ a x^{2} & = & (a x) x = z {(z_{r}^{◯ #})}^{2} = z_{r}^{◯ #} = x, \\ {(a x)}^{*} & = & {(z z_{r}^{◯ #})}^{*} = z z_{r}^{◯ #} = a x, \\ a - a x a & = & a - z z_{r}^{◯ #} (z + y) = a - z = y \in A^{q n i l} . \end{matrix}

By using Cline’s formula (see [2, Theorem 6.4.11]), we have

a - x a^{2} \in A^{q n i l} .

Moreover, we see that

(1 - a x) a^{n} = (a - a x a) a^{n - 1} = y (z + y) a^{n - 2} = y^{2} a^{n - 2} = \dots = y^{n},

and therefore

lim_{n \to \infty} | | a^{n} - a x a^{n} {| |}^{\frac{1}{n}} = lim_{n \to \infty} | | y^{n} {| |}^{\frac{1}{n}} = 0 .

(2) \Rightarrow (1)

By hypotheses, there exist

t \in A

such that

t = a t^{2}, {(a t)}^{*} = a t, lim_{n \to \infty} | | a^{n} - a t a^{n} {| |}^{\frac{1}{n}} = 0 .

For any

n \in N

, we have

\begin{matrix} a t & = & a (a t^{2}) = a^{2} t^{2} = a^{2} (a t^{2}) z = a^{3} t^{3} \\ = & \dots = a^{n} t^{n} = \dots = a^{n + 1} t^{n + 1} . \end{matrix}

Let

z = t a t

. One directly verifies that

\begin{matrix} | | a t - a z | | & = & | | a^{n} t^{n} - a t a^{n} t^{n} | | = | | [a^{n} - a t a^{n}] t^{n} | | \\ \leq & | | a^{n} - a t a^{n} | | | | t^{n} | |, \end{matrix}

Then

lim_{n \to \infty} | | a t - {a z | |}^{\frac{1}{n}} = 0;

hence,

a z = a t

, and so

{(a z)}^{*} = {(a t)}^{*} = a t = a z

\begin{matrix} z - a z^{2} & = & t a t - (a t) z = t a t - a t^{2} a t \\ = & (t a t - a t^{2}) + a t (1 - t a) t \\ = & (t a - 1) t + a t (1 - t a) t \\ = & (a t - 1) (1 - t a) t = (a t - 1) [1 - a^{n} t^{n + 1} a] t . \end{matrix}

Since

t = a t^{2}

, by induction, we have

t = a^{n} t^{n + 1}

, and so

z - a z^{2} = (a t - 1) [1 - a^{n} t^{n + 1} a] a^{n} t^{n + 1}

; hence,

| | z - a z^{2} | | \leq | | a^{n} - a t a^{n} | | | | 1 - t^{n + 1} a^{n + 1} {| | | | t | |}^{n + 1} .

Since

{lim}_{n \to \infty} | | a^{n} - a t a^{n} {| |}^{\frac{1}{n}} = 0,

we deduce that

lim_{n \to \infty} | | z - a z^{2} {| |}^{\frac{1}{n}} = 0 .

This implies that

a z^{2} = z

Moreover, we have

z a z = z (a t) = (t a t) a t = t (a t a) a^{n - 1} t^{n} = t (a t a^{n}) t^{n};

hence,

\begin{matrix} | | z - z a z | | & = & | | t a^{n} t^{n} - t (a t a^{n}) t^{n} | | \\ \leq & | | t | | | a^{n} - a t a^{n} | | | | t^{n} | | \end{matrix}

This implies that

lim_{n \to \infty} | | z a z - {z | |}^{\frac{1}{n}} = 0;

whence,

z = z a z

Since

a t = a z

, we see that

| | a^{n} - a z a^{n} {| |}^{\frac{1}{n}} = | | a^{n} - a t a^{n} {| |}^{\frac{1}{n}},

and so

lim_{n \to \infty} | | a^{n} - a z a^{n} {| |}^{\frac{1}{n}} = 0 .

Set

x = a z a

and

y = a - a z a .

Then

a = x + y

. We check that

\begin{matrix} (1 - a x) a (a x) & = & (a - a x a) a^{n - 1} x^{n - 1} \\ = & (a^{n} - a x a^{n}) x^{n - 1} . \end{matrix}

Therefore

{| | (1 - a x) a (a x) | |}^{\frac{1}{n}} \leq | | a^{n} - a x a^{n} |^{\frac{1}{n}} | | | x^{n - 1} {| |}^{\frac{1}{n}} .

Since

lim_{n \to \infty} | | a^{n} - a x a^{n} {| |}^{\frac{1}{n}} = 0,

we prove that

lim_{n \to \infty} {| | (1 - a x) a (a x) | |}^{\frac{1}{n}} = 0 .

This implies that

(1 - a x) a (a x) = 0

We claim that x has right core inverse. Evidently, we verify that

\begin{matrix} x z & = & a z a z = a z, \\ x z^{2} & = & (x z) z = a z^{2} = z, \\ x z x & = & (x z) x = a z a z a = a z a = x, \\ {(x z)}^{*} & = & {(a z)}^{*} = a z = x z . \end{matrix}

Therefore

x \in A_{r}^{◯ #}

and

z = x_{r}^{◯ #}

We verify that

\begin{matrix} | | {(a - x a^{2})}^{n + 2} {| |}^{\frac{1}{n + 2}} & = & | | (1 - x a) a {(a - x a^{2})}^{n} (a - x a^{2}) {| |}^{\frac{1}{n + 2}} \\ = & | | (1 - x a) a {(a - x a^{2})}^{n - 1} (a - x a^{2}) a {| |}^{\frac{1}{n + 2}} \\ = & | | (1 - x a) a {(a - x a^{2})}^{n - 1} a^{2} {| |}^{\frac{1}{n + 2}} \\ ⋮ \\ = & | | (1 - x a) a (a - x a^{2}) a^{n} {| |}^{\frac{1}{n + 2}} \\ \leq & | | 1 - {x a | |}^{\frac{1}{n + 2}} {[| | a^{n} - a x a^{n} {| |}^{\frac{1}{n}}]}^{\frac{n}{n + 2}} {| | a | |}^{\frac{1}{n + 2}} . \end{matrix}

Accordingly,

lim_{n \to \infty} | | {(a - x a^{2})}^{n + 2} {| |}^{\frac{1}{n + 2}} = 0 .

This implies that

a - x a^{2} \in A^{q n i l}

. By using Cline’s formula,

y = a - a z a \in A^{q n i l}

Moreover, we see that

\begin{matrix} x^{*} y & = & {(a x a)}^{*} (1 - a x) a = a^{*} {(a x)}^{*} (1 - a x) a \\ = & a^{*} (a x) (1 - a x) a = 0, \\ y x & = & (a - a x a) a x a = (1 - a x) a (a x) a = 0 . \end{matrix}

Then we have a generalized right core decomposition

a = x + y

, as required. □

Corollary 1.

Let

a \in A

. Then the following are equivalent:

(1): $a \in A$ has generalized right core decomposition.
(2): There exists unique $x \in A$ such that

$x = a x^{2}, {(a x)}^{*} = a x, lim_{n \to \infty} | | a^{n} - a x a^{n} {| |}^{\frac{1}{n}} = 0 .$

Proof.

(2) \Rightarrow (1)

This is obvious by Theorem 2.1.

(1) \Rightarrow (2)

In light of Theorem 2.1, there exists

x \in A

such that

x = a x^{2}, {(a x)}^{*} = a x, lim_{n \to \infty} | | a^{n} - a x a^{n} {| |}^{\frac{1}{n}} = 0 .

Assume that there exists

z \in A

such that

z = a z^{2}, {(a z)}^{*} = a z, lim_{n \to \infty} | | a^{n} - a z a^{n} {| |}^{\frac{1}{n}} = 0 .

Let

a_{1} = a x a, a_{2} = a - a_{1}

and

b_{1} = a z a, b_{2} = a - b_{1}

. As in the proof of Theorem 2.1, we prove that

\begin{matrix} a_{1}^{*} a_{2} = a_{2} a_{1} = 0, a_{2} \in A^{q n i l}, \\ b_{1}^{*} b_{2} = b_{2} b_{1} = 0, b_{2} \in A^{q n i l} . \end{matrix}

For every

n \in N

a^{n} = \sum_{i = 0}^{n} b_{1}^{i} b_{2}^{n - i}

, and then

{(a^{n})}^{*} b_{2} = {(b_{2}^{n})}^{*} b_{2}

. Since

b_{2} b_{1} = 0

, we have

a^{n} b_{1} {(b_{1}^{n})}^{#} = {(b_{1})}^{n} b_{1} {(b_{1}^{n})}^{#} = b_{1}

. Since

a x^{2} = x

, we have

a^{n} x^{n} = a x

. Then

\begin{matrix} | | b_{1} - a_{1} {| |}^{2} & = & | | b_{1} - a x a {| |}^{2} \\ = & | | b_{1} - a x b_{1} - a x b_{2} {| |}^{2} \\ = & | | b_{1} - a x b_{1} - {(a x)}^{*} b_{2} {| |}^{2} \\ = & | | b_{1} - a^{n} x^{n} b_{1} - {(a^{n} x^{n})}^{*} b_{2} {| |}^{2} \\ = & | | b_{1} - a^{n} x^{n} b_{1} - {(x^{n})}^{*} {(a^{n})}^{*} b_{2} {| |}^{2} \\ = & | | b_{1} - a^{n} x^{n} a^{n} b_{1} {(b_{1}^{n})}^{#} - {(x^{n})}^{*} {(a^{n})}^{*} b_{2} {| |}^{2} \\ = & | | (a^{n} - a x a^{n}) b_{1} {(b_{1}^{n})}^{#} - {(x^{n})}^{*} {(b_{2}^{*})}^{n} b_{2} {| |}^{2} \\ \leq & | | a^{n} - a x a^{n} {| |}^{2} | | b_{1} {(b_{1}^{n})}^{#} {| |}^{2} + | | {(x^{n})}^{*} {| |}^{2} | | b_{2} {| |}^{2} | | {(b_{2}^{*})}^{n} {| |}^{2} \\ + & 2 | | a^{n} - a x a^{n} | | | | {(b_{2}^{*})}^{n} | | | | b_{1} {(b_{1}^{n})}^{#} | | | | {(x^{n})}^{*} | | | | b_{2} | | . \end{matrix}

Therefore

\begin{matrix} | | b_{1} - a_{1} {| |}^{\frac{2}{n}} \\ \leq & | | a^{n} - a x a^{n} {| |}^{\frac{2}{n}} | | b_{1} {(b_{1}^{n})}^{#} {| |}^{\frac{2}{n}} + | | {(x^{n})}^{*} {| |}^{\frac{2}{n}} | | b_{2} {| |}^{\frac{2}{n}} | | {(b_{2}^{*})}^{n} {| |}^{\frac{2}{n}} \\ + & 2 | | a^{n} - a x a^{n} {| |}^{\frac{1}{n}} | | {(b_{2}^{*})}^{n} {| |}^{\frac{1}{n}} | | b_{1} {(b_{1}^{n})}^{#} {| |}^{\frac{2}{n}} | | e^{- 1} {(x^{n})}^{*} {| |}^{\frac{2}{n}} | | b_{2} {| |}^{\frac{2}{n}} \\ \leq & | | 1 - {a x | |}^{\frac{2}{n}} {| | | | a | |}^{2} | | b_{1} {(b_{1})}^{#} {| |}^{\frac{2}{n}} + | | x^{*} {| |}^{2} | | b_{2} {| |}^{\frac{2}{n}} | | {(b_{2}^{*})}^{n} {| |}^{\frac{2}{n}} \\ + & 2 | | 1 - {a x | |}^{\frac{1}{n}} {| | a | |}^{2} | | {(b_{2}^{*})}^{n} {| |}^{\frac{2}{n}} | | b_{1} {(b_{1})}^{#} {| |}^{\frac{2}{n}} | | x^{*} {| |}^{2} | | b_{2} {| |}^{\frac{2}{n}} . \end{matrix}

Since

b_{2} \in A^{q n i l}

, then

1 - \bar{λ} b_{2} \in A^{- 1}

; whence,

1 - λ b_{2}^{*} \in A^{- 1}

. Then

b_{2}^{*} \in A^{q n i l}

, and so

lim_{n \to \infty} | | {(b_{2}^{*})}^{n} {| |}^{\frac{1}{n}} = 0 .

Accordingly,

lim_{n \to \infty} | | b_{1} - a_{1} {| |}^{\frac{2}{n}} = 0 .

Therefore

a_{1} = b_{1}

As in the proof of Theorem 2.1, we check that

x = {(a x a)}_{r}^{◯ #} = {(a_{1})}_{r}^{◯ #} = {(b_{1})}_{r}^{◯ #} = {(a z a)}_{r}^{◯ #} = z

. Therefore

x = z

, as required. □

We denote such a x in Corollary 2.2 by

a_{r}^{ⓓ}

, and call it the generalized right core inverse of a. Let

A_{r}^{ⓓ}

denote the sets of all generalized right core invertible elements in

A

Corollary 2.

Let

a \in A_{r}^{ⓓ}

. Then the following hold:

(1): $a_{r}^{ⓓ} = a_{r}^{ⓓ} a a_{r}^{ⓓ}$ .
(2): $a a_{r}^{ⓓ} = a^{m} {(a_{r}^{ⓓ})}^{m}$ for any $m \in N$ .

Proof.

(1)

By hypothesis, there exist

z, y \in A

such that

a = z + y, z^{*} y = y z = 0, z \in A_{r}^{◯ #}, y \in A^{q n i l} .

As in the proof of Theorem 2.1, we have

a_{r}^{ⓓ} = z_{r}^{◯ #}

. We directly verify that

x a x = z_{r}^{◯ #} z z_{r}^{◯ #} = z_{r}^{◯ #} = x,

as required.

(2)

This is obvious by the proof of Theorem 2.1. □

An element

a \in A

has generalized core inverse if there exist

x \in A

such that

a x^{2} = x, {(a x)}^{*} = a x, lim_{n \to \infty} | | a^{n} - x a^{n + 1} {| |}^{\frac{1}{n}} = 0 .

If such x exists, it is unique, and denote it by

a^{ⓓ}

Corollary 3.

Let

a \in A

. Then

a \in A^{ⓓ}

if and only if

(1): $a \in A^{ⓓ}$ ;
(2): $a \in A_{r}^{ⓓ}$ .

Proof.

This is obvious by Theorem 2.1 and [3, Theorem 2.5]. □

Corollary 4.

Let

a \in A

. Then

a \in A^{D}

if and only if

(1): $a \in A^{D}$ ;
(2): $a \in A_{r}^{ⓓ}$ .

Proof.

This is obvious by Corollary 2.4 and [3, Corollary 3.4]. □

Recently, Zhu et al. extended right core inverse and introduced right w-core inverse (see [18]). An element

a \in A

has right w-core inverse if there exist

x \in A

such that

a w x^{2} = x, {(a w x)}^{*} = a w x, a w x a = a .

If such x exists, it is unique, and denote it by

a_{r, w}^{◯ #}

. Let

A_{r, w}^{◯ #}

denote the set of all right w-core invertible elements in

A

Theorem 3.

Let

a, w \in A

. Then the following are equivalent:

(1): $a w \in A_{r}^{ⓓ}$ .
(2): There exist $x, y \in A$ such that

$a = x + y, x^{*} y = y w x = 0, x \in A_{r, w}^{◯ #}, y w \in A^{q n i l} .$

Proof.

(1) \Rightarrow (2)

By hypotheses, there exist

t \in A

such that

t = (a w) t^{2}, {[(a w) t]}^{*} = (a w) t, lim_{n \to \infty} {| | (a w)}^{n} - (a w) t {(a w)}^{n} {| |}^{\frac{1}{n}} = 0 .

Let

z = t (a w) t, x = a w z a

and

y = a - a w z a .

. As in the proof of Theorem 2.1, we prove that

\begin{matrix} {(a w z)}^{*} = a w z, a w z^{2} = z, z = z a w z; \\ lim_{n \to \infty} {| | (a w)}^{n} - (a w) z {(a w)}^{n} {| |}^{\frac{1}{n}} = 0; \\ a = x + y, y w = (a - a w z a) w = a w - (a w) z (a w) \in A^{q n i l} . \end{matrix}

We claim that x has right w-core inverse. Evidently, we verify that

\begin{matrix} x w z & = & (a w z a) w z = a w z, \\ x w z^{2} & = & (x w z) z = a w z^{2} = z, \\ x w z x & = & (x w z) x = (a w z) a w z a = {(a w z)}^{2} a = (a w z) a = x, \\ {(x w z)}^{*} & = & {(a w z)}^{*} = a w z = x w z . \end{matrix}

Therefore

x \in A_{r, w}^{◯ #}

and

z = x_{r, w}^{◯ #}

Moreover, we see that

\begin{matrix} x^{*} y & = & {(a w z a)}^{*} (1 - a w z) a = a^{*} {(a w z)}^{*} (1 - a w z) a \\ = & a^{*} (a w z) (1 - a w z) a = 0 . \end{matrix}

Since

z = a w z^{2}

, we see that

z = {(a w)}^{n - 1} z^{n}

. Then

\begin{matrix} | | y w x | | & = & | | (a - a w z a) w (a w z a) | | \\ = & | | [(a w) - (a w) z (a w)] a w z a | | \\ = & {| | [(a w) - (a w) z (a w)] (a w)}^{n - 1} z^{n} a | | \\ = & | | [{(a w)}^{n} - (a w) z {(a w)}^{n}] z^{n} a | | . \end{matrix}

Hence,

{| | y w x | |}^{\frac{1}{n}} \leq {| | (a w)}^{n} - (a w) z {(a w)}^{n} {| |}^{\frac{1}{n}} | | z^{n} a {| |}^{\frac{1}{n}} .

This implies that

lim_{n \to \infty} {| | y w x | |}^{\frac{1}{n}} = 0 .

Thus

y w x = 0

, as required.

(2) \Rightarrow (1)

By hypothesis, there exist

x, y \in A

such that

a = x + y, x^{*} y = y w x = 0, x \in A_{r, w}^{◯ #}, y w \in A^{q n i l} .

Hence,

a w = x w + y w, {(x w)}^{*} (y w) = w^{*} (x^{*} y) w = 0, (y w) (x w) = (y w x) w = 0

and

y w \in A^{q n i l}

. Since

x \in A_{r, w}^{#}

, we have

x w z^{2} = z, {(x w z)}^{*} = x w z, x w z x = x .

Hence,

x w z x w = x w

, and so

x w \in A_{r, w}^{◯ #}

. Therefore

a w \in A_{r}^{ⓓ}

, as asserted. □

3. equivalent characterizations

In this section, we present a polar-like property for generalized right core inverse in a Banach *-algebra. The related characterizations of generalized right core inverse are established.

Theorem 4.

Let

a \in A

. Then the following are equivalent:

(1): $a \in A_{r}^{ⓓ}$ .
(2): There exists a projection $p \in A$ such that

$a + p \in A_{r}^{- 1}, a p \in A^{q n i l}, (1 - p) A = a (1 - p) A .$

Proof.

(1) \Rightarrow (2)

Since

a \in A_{r}^{ⓓ}

, there exist

x, y \in A

such that

a = x + y, x^{*} y = y x = 0, x \in A_{r}^{#}, y \in A_{r}^{q n i l} .

In view of [5, Lemma 4.3], we have

x_{r}^{◯ #} = x {(x_{r}^{◯ #})}^{2} = x_{r}^{◯ #} x x_{r}^{◯ #}, {(x x_{r}^{◯ #})}^{*} = x x_{r}^{◯ #}, x = x x_{r}^{◯ #} x .

Let

p = 1 - x x_{r}^{◯ #}

. Then

p^{2} = p = p^{*}

and

p x = 0

. We directly check that

(x + 1 - x x_{r}^{◯ #}) (x_{r}^{◯ #} + 1 - x x_{r}^{◯ #}) = 1 + x (1 - x x_{r}^{◯ #}) .

Let

q = [x_{r}^{◯ #} + 1 - x x_{r}^{◯ #}] {[1 + x (1 - x x_{r}^{◯ #})]}^{- 1}

. Then

(x + p) q = 1

\begin{matrix} 1 + y q & = & 1 + (y x_{r}^{◯ #} + y - y x x_{r}^{◯ #}) {[1 + x (1 - x x_{r}^{◯ #})]}^{- 1} \\ = & 1 + [y - y x x_{r}^{◯ #}] [1 + x (1 - x x_{r}^{◯ #})] . \end{matrix}

We check that

\begin{matrix} 1 + [1 - x x_{r}^{◯ #}] [1 + x (1 - x x_{r}^{◯ #})] y \\ = & 1 + [1 - x x_{r}^{◯ #}] [y + x y] \\ = & 1 + y + [1 - x x_{r}^{◯ #}] x y \\ = & 1 + y \in A^{- 1} . \end{matrix}

Hence,

1 + q y \in A^{- 1}

. Therefore we check that

\begin{matrix} p a & = & p (x + y) = p y = (1 - x x_{r}^{◯ #}) y = y \in A^{q n i l}, \\ p a (1 - p) & = & y x x_{r}^{◯ #} = 0, \\ a + p & = & x + y + p = (x + p) [1 + q y] \in A i s r i g h t i n v e r t i b l e . \end{matrix}

Moreover, we see that

1 - p = x x_{r}^{◯ #} = [(x + y) x x_{r}^{◯ #}] x_{r}^{◯ #} \in a (1 - p) A

. On the other hand,

a (1 - p) = (1 - p) a (1 - p) \in (1 - p) A

. Then

(1 - p) A = a (1 - p) A .

(2) \Rightarrow (1)

By hypothesis, there exists a projection

p \in A

such that

a + p \in A_{r}^{- 1}, a p \in A^{q n i l}, (1 - p) A = a (1 - p) A .

Set

x = (1 - p) a

and

y = p a

. Then

\begin{matrix} x^{*} y & = & [a^{*} {(1 - p)}^{*}] p a = 0, \\ y x & = & p a (1 - p) a = 0, \\ y & = & p a \in A^{q n i l} . \end{matrix}

Write

(a + p) q = 1

for some

q \in A

. Then

(1 - p) a q = (1 - p) (a + p) q = 1 - p

, and so

(1 - p) a q (1 - p) a = (1 - p) a

and

{[(1 - p) a q]}^{*} = (1 - p) a q

. Hence,

(1 - p) a \in A^{(1, 3)}

Since

(1 - p) A = a (1 - p) A

, we have

p a (1 - p) = 0

. Write

1 - p = a (1 - p) r

for some

r \in A

. Then

1 - p = (1 - p) a (1 - p) r

; hence,

\begin{matrix} 1 - p & = & (1 - p) [a (1 - p) r] = (1 - p) a [(1 - p) r] \\ = & [(1 - p) a] [(1 - p) a (1 - p) r] r \\ \in & {[(1 - p) a]}^{2} A . \end{matrix}

Then we have

(1 - p) a A = {[(1 - p) a]}^{2} A

. According to [14, Theorem 3.1],

(1 - p) a \in A_{r}^{#}

. That is,

x \in A_{r}^{#}

. Therefore

a \in A_{r}^{ⓓ}

. □

Corollary 5.

Every generalized right core invertible element in a Banach *-algebra is the sum of two invertible and a right invertible elements.

Proof.

Let

a \in A_{r}^{ⓓ}

. In view of Theorem 3.1, we have

p^{2} = p = p^{*} \in A

such that

u : = a + p \in A_{r}^{- 1}

. Then

a = u - p

. Clearly,

- p = \frac{1 - 2 p}{2} - \frac{1}{2}

. We easily check that

{(\frac{1 - 2 p}{2})}^{2} = \frac{1}{4},

and so

{(\frac{1 - 2 p}{2})}^{- 1} = 2 (1 - 2 p) .

Accordingly,

a = u + \frac{1 - 2 p}{2} - \frac{1}{2}

, as required. □

We are ready to prove:

Theorem 5.

Let

a \in A

. Then the following are equivalent:

(1): $a \in A_{r}^{ⓓ}$ .
(2): There exists $b \in A$ such that

$b a b = b, {(a b)}^{*} = a b, a b a A = a^{2} b a A, a - a^{2} b \in A^{q n i l} .$

Proof.

(1) \Rightarrow (2)

By hypothesis, there exist

x, y \in A

such that

a = x + y, x^{*} y = y x = 0, x \in A_{r}^{◯ #}, y \in A^{q n i l} .

It is easy to verify that

\begin{matrix} x_{r}^{◯ #} y & = & x_{r}^{◯ #} x x_{r}^{◯ #} y \\ = & [x_{r}^{◯ #}] [x x_{r}^{◯ #}] y \\ = & [x_{r}^{◯ #}] {(x x_{r}^{◯ #})}^{*} y \\ = & [x_{r}^{◯ #}] {(x_{r}^{◯ #})}^{*} (x^{*} y) \\ = & 0 . \end{matrix}

Set

b = x_{r}^{◯ #}

. Then

a b = (x + y) x_{r}^{◯ #} = x x_{r}^{◯ #} + y x {(x_{r}^{◯ #})}^{2} = x x_{r}^{◯ #}

. Hence,

{(a b)}^{*} = {(x x_{r}^{◯ #})}^{*} = x x_{r}^{◯ #} = a b

. We easily verify that

\begin{matrix} a b^{2} & = & (a b) b = (x x_{r}^{◯ #}) x_{r}^{◯ #} = x_{r}^{◯ #} = b, \\ b (1 - a b) & = & x_{r}^{◯ #} [1 - x x_{r}^{◯ #}] = 0, \\ a - a^{2} b & = & a (1 - a b) = a (1 - x x^{◯ #}) . \end{matrix}

Thus

b = b a b

, and so

a b^{2} = b a b

Moreover, we see that

\begin{matrix} a b a & = & (x x_{r}^{◯ #}) (x + y) \\ = & x x_{r}^{◯ #} x = x; \\ a^{2} b a & = & a (a b a) = (x + y) x = x^{2} . \end{matrix}

Since

x \in A_{r}^{◯ #}

, it follows by [14, Theorem 3.1] that

x A = x^{2} A

. Thus,

a b a A = a^{2} b a A

. Since

(1 - x x^{◯ #}) a = (1 - x x^{◯ #}) (x + y) = y \in A^{q n i l}

, by using Cline’s formula,

a - a^{2} b = a (1 - x x^{◯ #}) \in A^{q n i l} .

(2) \Rightarrow (1)

By hypothesis, there exists

b \in A

such that

b a b = b, {(a b)}^{*} = a b, a b a A = a^{2} b a A, a - a^{2} b \in A^{q n i l} .

Let

x = a b a

and

y = a - a b a

. Then

\begin{matrix} a & = & x + y, \\ x^{*} y & = & {(a b a)}^{*} (a - a b a) = a^{*} {(a b)}^{*} (1 - a b) a = 0, \\ y x & = & (a - a b a) a b a = (1 - a b) a^{2} b a = (1 - a b) a b a r = 0 f o r a r \in A . \end{matrix}

Since

a - a^{2} b \in A^{q n i l}

. By using Cline’s formula, we have

y = (1 - a b) a \in A^{q n i l}

. Clearly, we have

x b = (a b a) b = a (b a b) = a b

, and so

x b x = a b (a b a) = a (b a b) a = a b a = x

and

{(x b)}^{*} = {(a b)}^{*} = a b = x b

. That is,

x \in A^{(1, 3)}

. Moreover, we check that

a b a = a b a b a \in a b a^{2} b a A = {(a b a)}^{2} A .

Hence,

a b a A = {(a b a)}^{2} A

. By virtue of [14],

x \in A_{r}^{#}

. This completes the proof by Theorem 2.1. □

Corollary 6.

Let

a \in A

. Then the following are equivalent:

(1): $a \in A_{r}^{ⓓ}$ .
(2): Tere exists $b \in A$ such that

$b a b = b = a b^{2}, {(a b)}^{*} = a b, a b a A = a^{2} b a A, a - a^{2} b \in A^{q n i l} .$

Proof.

(1) \Rightarrow (2)

By hypothesis, there exist

x, y \in A

such that

a = x + y, x^{*} y = y x = 0, x \in A_{r}^{#}, y \in A^{q n i l} .

Set

b = x_{r}^{◯ #}

. As in the proof of Theorem 3.3, we check that

b a b = b, {(a b)}^{*} = a b, a b a A = a^{2} b a A, a - a^{2} b \in A^{q n i l} .

Moreover, we verify that

\begin{matrix} a b & = & (x + y) x_{r}^{◯ #} = x x_{r}^{◯ #} + y x {(x_{r}^{◯ #})}^{2} = x x_{r}^{◯ #}, \\ a b^{2} & = & (a b) b = (x x_{r}^{◯ #}) x_{r}^{◯ #} = x_{r}^{◯ #} = b, \end{matrix}

as required.

(2) \Rightarrow (1)

This is obvious by Theorem 3.3. □

Let

a \in A

. Set

{a_{r}^{d}} = {x \in A | a x^{2} = x, a - x a^{2} \in A^{q n i l}} .

We now derive the following.

Theorem 6.

Let

a \in A

. Then the following are equivalent:

(1): $a \in A_{r}^{ⓓ}$ .
(2): ${a_{r}^{d}} ⋂ A_{r}^{◯ #} \neq \emptyset$ .

In this case,

a_{r}^{ⓓ} = z^{2} z_{r}^{◯ #}

for

z \in {a_{r}^{d}} ⋂ A_{r}^{#} .

Proof.

(1) \Rightarrow (2)

In view of Theorem 2.1, there exist

x, y \in A

such that

a = x + y, x^{*} y = y x = 0, x \in A_{r}^{◯ #}, y \in A^{q n i l} .

Let

z = x_{r}^{◯ #}

. Then

Claim 1.

z \in {a_{r}^{d}}

. We directly verify that

\begin{matrix} a z & = & (x + y) x_{r}^{◯ #} = (x + y) x {(x_{r}^{◯ #})}^{2} = x x_{r}^{◯ #}, \\ a z^{2} & = & [x x_{r}^{◯ #}] x_{r}^{◯ #} = x {(x_{r}^{◯ #})}^{2} = x_{r}^{◯ #} = z, \\ a z a & = & x x_{r}^{◯ #} (x + y) = x x_{r}^{◯ #} x + {(x_{r}^{◯ #})}^{*} (x^{*} y) = x, \\ a - a z a & = & a - x = y \in A^{q n i l} . \end{matrix}

By using Cline’s formula, we have

a - z a^{2} \in A^{q n i l}

. Therefore

z \in {a_{r}^{d}}

Claim 2.

z \in A_{r}^{◯ #}

. We verify that

\begin{matrix} z [x^{2} z] & = & x_{r}^{◯ #} [x^{2} x_{r}^{◯ #}] = x x_{r}^{◯ #}, \\ z {[x^{2} z]}^{2} & = & [x x_{r}^{◯ #}] (x^{2} z) = x^{2} z, \\ {(z (x^{2} z))}^{*} & = & {(x x_{r}^{◯ #})}^{*} = x x_{r}^{◯ #} = z (x^{2} z), \\ z (x^{2} z) z & = & [x x_{r}^{◯ #}] x_{r}^{◯ #} = x_{r}^{#} = z . \end{matrix}

Accordingly,

z \in A_{r}^{◯ #}

and

z_{r}^{◯ #} = x^{2} z

. Therefore

{a_{r}^{d}} ⋂ A_{r}^{◯ #} \neq \emptyset

(2) \Rightarrow (1)

Let

z \in {a_{r}^{d}} ⋂ A_{r}^{◯ #}

. Then

a z^{2} = z, a - z a^{2} \in A^{q n i l} .

Set

x = z^{2} z_{r}^{◯ #}

. Then we check that

(z z_{r}^{◯ #} a) x = z z_{r}^{◯ #} (a z^{2}) z_{r}^{◯ #} = {[z z_{r}^{◯ #}]}^{2} = z z_{r}^{◯ #},

hence, we see that

\begin{matrix} {[(z z_{r}^{◯ #} a) x]}^{*} & = & {[z z_{r}^{◯ #}]}^{*} = z z_{r}^{◯ #} = (z z_{r}^{◯ #} a) x, \\ z z_{r}^{◯ #} a x^{2} & = & [z z_{r}^{◯ #}] [z^{2} z_{r}^{◯ #}] = z^{2} z_{r}^{◯ #} = x, \\ (z z_{r}^{#} a) x (z z_{r}^{◯ #} a) & = & (z z_{r}^{◯ #}) (z z_{r}^{◯ #} a) = z z_{r}^{◯ #} a . \end{matrix}

Then

z z_{r}^{◯ #} a \in A_{r}^{◯ #}

and

{[z z_{r}^{◯ #} a]}_{r}^{◯ #} = z^{2} z_{r}^{◯ #}

Write

a = a_{1} + a_{2}

, where

a_{1} = z z_{r}^{#} a

and

a_{2} = a - z z_{r}^{◯ #} a

. It is easy to verify that

\begin{matrix} a_{2} a_{1} & = & [a - z z_{r}^{◯ #} a] z z_{r}^{◯ #} a \\ = & a z z_{r}^{◯ #} a - z z^{◯ #} a z z_{r}^{◯ #} a \\ = & a z z_{r}^{◯ #} a - z z^{◯ #} (a z^{2}) {(z_{r}^{◯ #})}^{2} a \\ = & a z z_{r}^{◯ #} a - z z^{◯ #} z {(z_{r}^{◯ #})}^{2} a \\ = & (a z^{2}) {(z_{r}^{◯ #})}^{2} a - z {(z^{◯ #})}^{2} a \\ = & 0, \\ a_{1}^{*} a_{2} & = & a^{*} {(z z_{r}^{◯ #})}^{*} [a - z z_{r}^{◯ #} a] \\ = & a^{*} (z z_{r}^{◯ #}) [a - z z_{r}^{◯ #} a] \\ = & a^{*} z z_{r}^{◯ #} [1 - z z_{r}^{◯ #}] a = 0 . \end{matrix}

Moreover, we check that

\begin{matrix} [1 - z z_{r}^{◯ #}] a & = & [1 - z z_{r}^{◯ #}] a - [1 - z z_{r}^{◯ #}] z a^{2} \\ = & [1 - z z_{r}^{◯ #}] (a - z a^{2}) . \end{matrix}

Clearly,

a z = a z z_{r}^{◯ #} z = a z^{2} {(z_{r}^{◯ #})}^{2} z = z {(z_{r}^{◯ #})}^{2} z = z_{r}^{◯ #} z .

It is easy to verify that

\begin{matrix} (a - z a^{2}) [1 - z z_{r}^{◯ #}] & = & a - z a^{2} - (1 - z a) (a z) z_{r}^{◯ #} \\ = & a - z a^{2} - (1 - z a) (z_{r}^{◯ #} z) z_{r}^{◯ #} \\ = & a - z a^{2} - (1 - z a) z_{r}^{◯ #} \\ = & a - z a^{2} - (1 - z a) z^{2} {(z_{r}^{◯ #})}^{3} \\ = & a - z a^{2} - [z_{r}^{◯ #} - z (a z^{2}) {(z_{r}^{◯ #})}^{3}] \\ = & a - z a^{2} - [z_{r}^{◯ #} - z^{2} {(z_{r}^{◯ #})}^{3}] \\ = & a - z a^{2} \in A^{q n i l} . \end{matrix}

By using Cline’s formula again,

a_{2} = [1 - z z_{r}^{◯ #}] a = [1 - z z_{r}^{◯ #}] (a - z a^{2}) \in A^{q n i l} .

Therefore

a = a_{1} + a_{2}

is the generalized right core decomposition of a. Therefore

a_{r}^{d} = {(a_{1})}_{r}^{◯ #} = z^{2} z_{r}^{◯ #},

as asserted. □

4. algebraic properties

In this section, we are concerned with algebraic properties of generalized right core inverse. Let

a, p^{2} = p \in A

. Then a has the Pierce decomposition relative to p, and we denote it by

{(\begin{matrix} a_{11} & a_{12} \\ a_{21} & a_{22} \end{matrix})}_{p}

. Let

a \in A_{r}^{ⓓ}

. We use

a_{r}^{π}

to stands for

1 - a a_{r}^{ⓓ}

. For further use, we now derive

Lemma 1.

Let p be a projection,

a \in {(p A p)}_{r}^{ⓓ}, d \in {((1 - p) A (1 - p))}_{r}^{ⓓ}

and

x = {(\begin{matrix} a & b \\ 0 & d \end{matrix})}_{p} .

a_{r}^{π} b = 0

, then

x \in A_{r}^{ⓓ}

. In this case,

x_{r}^{ⓓ} = a_{r}^{ⓓ} + d_{r}^{ⓓ} - a_{r}^{ⓓ} b d_{r}^{ⓓ} .

Proof.

Set

y = {(\begin{matrix} a_{r}^{ⓓ} & z \\ 0 & d_{r}^{ⓓ} \end{matrix})}_{p},

where

z = - a_{r}^{ⓓ} b d_{r}^{ⓓ} .

Then we directly check that

x y = {(\begin{matrix} a & b \\ 0 & d \end{matrix})}_{p} {(\begin{matrix} a_{r}^{ⓓ} & z \\ 0 & d_{r}^{ⓓ} \end{matrix})}_{p} = {(\begin{matrix} a a_{r}^{ⓓ} & a z + b d_{r}^{ⓓ} \\ 0 & d d_{r}^{ⓓ} \end{matrix})}_{p} .

We see that

\begin{matrix} a z + b d_{r}^{ⓓ} & = & - a a_{r}^{ⓓ} b d_{r}^{ⓓ} + b d_{r}^{ⓓ} \\ = & a_{r}^{π} b d_{r}^{d} = 0 . \end{matrix}

Then

\begin{matrix} {(x y)}^{*} & = & x y, \\ x y^{2} & = & {(\begin{matrix} a a_{r}^{ⓓ} & 0 \\ 0 & d d_{r}^{ⓓ} \end{matrix})}_{p} {(\begin{matrix} a_{r}^{ⓓ} & z \\ 0 & d_{r}^{ⓓ} \end{matrix})}_{p} = y, \\ y x y & = & {(\begin{matrix} a_{r}^{ⓓ} & z \\ 0 & d_{r}^{ⓓ} \end{matrix})}_{p} {(\begin{matrix} a a_{r}^{ⓓ} & 0 \\ 0 & d d_{r}^{ⓓ} \end{matrix})}_{p} = y . \end{matrix}

Moreover, we have

1 - x y = {(\begin{matrix} p - a a_{r}^{ⓓ} & 0 \\ 0 & p^{π} - d d_{r}^{ⓓ} \end{matrix})}_{p} .

Then

(1 - x y) x^{n} = {(\begin{matrix} p (1 - a a_{r}^{ⓓ}) a^{n} & 0 \\ 0 & p^{π} (1 - d d_{r}^{ⓓ}) d^{n} \end{matrix})}_{p} .

Therefore

lim_{n \to \infty} | | x^{n} - x y x^{n} {| |}^{\frac{1}{n}} = 0,

and then

x_{r}^{ⓓ} = y = a_{r}^{ⓓ} + d_{r}^{ⓓ} - a_{r}^{ⓓ} b d_{r}^{ⓓ} .

□

We come now to the demonstration of the additive property of generalized right core inverse.

Theorem 7.

Let

a, b, a_{r}^{π} b, (a + b) a a_{r}^{ⓓ} \in A_{r}^{ⓓ}

. If

a_{r}^{π} a b = 0, a_{r}^{π} b a = 0

and

{[(a + b) a a_{r}^{d}]}_{r}^{π} a a_{r}^{ⓓ} b a_{r}^{π} = 0

, then

a + b \in A_{r}^{ⓓ}

. In this case,

{(a + b)}_{r}^{ⓓ} = {[(a + b) a a_{r}^{ⓓ}]}_{r}^{d} + {[a_{r}^{π} b]}_{r}^{ⓓ} - {[(a + b) a a_{r}^{ⓓ}]}_{r}^{d} b {[a_{r}^{π} b]}_{r}^{ⓓ} .

Proof.

Let

p = a a_{r}^{ⓓ}

. By hypothesis,

p^{π} b p = (1 - a a_{r}^{ⓓ}) b a a_{r}^{ⓓ} = (a_{r}^{π} b a) a_{r}^{ⓓ} = 0

p^{π} a p = (1 - a a_{r}^{ⓓ}) a^{2} a_{r}^{ⓓ} = 0

and

p a p^{π} = a a_{r}^{ⓓ} a (1 - a a_{r}^{ⓓ}) = a a_{r}^{ⓓ} [a - a a_{r}^{ⓓ} a] a a_{r}^{ⓓ} = 0 .

Then we have

a = {(\begin{matrix} a_{1} & 0 \\ 0 & a_{4} \end{matrix})}_{p}, b = {(\begin{matrix} b_{1} & b_{2} \\ 0 & b_{4} \end{matrix})}_{p} .

Hence

a + b = {(\begin{matrix} a_{1} + b_{1} & b_{2} \\ 0 & a_{4} + b_{4} \end{matrix})}_{p} .

Here,

a_{1} = a a_{r}^{ⓓ} a a a_{r}^{ⓓ} = a^{2} a_{r}^{ⓓ}

and

b_{1} = a a_{r}^{ⓓ} b a a_{r}^{ⓓ} = b a a_{r}^{ⓓ}

. Then

a_{1} + b_{1} = (a + b) a a_{r}^{ⓓ} \in A_{r}^{ⓓ} .

Also we have

a_{4} = a_{r}^{π} a a_{r}^{π} = a_{r}^{π} a - a_{r}^{π} a^{2} a_{r}^{d} = a_{r}^{π} a

and

b_{4} = a_{r}^{π} b a_{r}^{π} = a_{r}^{π} b

, and so

a_{4} + b_{4} = a_{r}^{π} (a + b) .

We claim that

{(a_{4})}_{r}^{ⓓ} = {(a_{r}^{π} b)}_{r}^{ⓓ} .

One easily verifies that

\begin{matrix} a_{r}^{π} (a + b) {(a_{r}^{π} b)}_{r}^{ⓓ} & = & a_{r}^{π} a {(a_{r}^{π} b)}_{r}^{ⓓ} + a_{r}^{π} b {(a_{r}^{π} b)}_{r}^{ⓓ} = a_{r}^{π} b {(a_{r}^{π} b)}_{r}^{ⓓ}, \\ {(a_{r}^{π} (a + b) {(a_{r}^{π} b)}_{r}^{ⓓ})}^{*} & = & a_{r}^{π} (a + b) {(a_{r}^{π} b)}_{r}^{ⓓ}, \\ a_{r}^{π} (a + b) {[{(a_{r}^{π} b)}_{r}^{ⓓ}]}^{2} & = & a_{r}^{π} {[b {(a_{r}^{π} b)}_{r}^{ⓓ}]}^{2} = {(a_{r}^{π} b)}_{r}^{ⓓ}, \\ {(a_{r}^{π} b)}_{r}^{ⓓ} a_{r}^{π} (a + b) {(a_{r}^{π} b)}_{r}^{ⓓ} & = & {(a_{r}^{π} b)}_{r}^{ⓓ} a_{r}^{π} b {(a_{r}^{π} b)}_{r}^{ⓓ} = {(a_{r}^{π} b)}_{r}^{ⓓ}, \\ 1 - a_{r}^{π} (a + b) {(a_{r}^{π} b)}_{r}^{ⓓ} & = & 1 - a_{r}^{π} b {(a_{r}^{π} b)}_{r}^{ⓓ} . \end{matrix}

Then

\begin{matrix} [1 - a_{r}^{π} (a + b) {(a_{r}^{π} b)}_{r}^{ⓓ}] {[a_{r}^{π} (a + b)]}^{n} \\ = & [1 - a_{r}^{π} b {(a_{r}^{π} b)}_{r}^{ⓓ}] [{(a_{r}^{π} a)}^{n} + {(a_{r}^{π} b)}^{n}] \\ = & [1 - a_{r}^{π} b {(a_{r}^{π} b)}_{r}^{ⓓ}] {[a_{r}^{π} a)}^{n}] + [1 - a_{r}^{π} b {(a_{r}^{π} b)}_{r}^{ⓓ}] [{(a_{r}^{π} b)}^{n}] . \end{matrix}

Hence,

\begin{matrix} | | [1 - a_{r}^{π} (a + b) {(a_{r}^{π} b)}_{r}^{ⓓ}] {[a_{r}^{π} (a + b)]}^{n} {| |}^{\frac{1}{n}} \\ \leq & | | 1 - a_{r}^{π} b {(a_{r}^{π} b)}_{r}^{ⓓ} {| |}^{\frac{1}{n}} | | a_{r}^{π} {a)}^{n} {| |}^{\frac{1}{n}} + | | [1 - a_{r}^{π} b {(a_{r}^{π} b)}_{r}^{ⓓ}] [{(a_{r}^{π} b)}^{n}] {| |}^{\frac{1}{n}} . \end{matrix}

We infer that

lim_{n \to \infty} | | [1 - a_{r}^{π} (a + b) {(a_{r}^{π} b)}_{r}^{ⓓ}] {[a_{r}^{π} (a + b)]}^{n} {| |}^{\frac{1}{n}} = 0 .

Therefore

a_{4} + b_{4} \in A_{r}^{ⓓ}

and

{(a_{4} + b_{4})}_{r}^{ⓓ} = {(a_{r}^{π} b)}_{r}^{ⓓ}

Since

{[(a + b) a a_{r}^{ⓓ}]}_{r}^{π} a a_{r}^{ⓓ} b a_{r}^{π} = 0

, we have

{(a_{1} + b_{1})}_{r}^{π} b_{2} = 0

. By using Lemma 4.1, we have

\begin{matrix} {(a + b)}_{r}^{ⓓ} & = & {(a_{1} + b_{1})}_{r}^{ⓓ} + {(a_{4} + b_{4})}_{r}^{ⓓ} \\ - & {(a_{1} + b_{1})}_{r}^{ⓓ} b_{2} {(a_{4} + b_{4})}_{r}^{ⓓ} \\ = & {[(a + b) a a_{r}^{ⓓ}]}_{r}^{ⓓ} + {[a_{r}^{π} b]}_{r}^{ⓓ} \\ - & {[(a + b) a a_{r}^{ⓓ}]}_{r}^{ⓓ} b {[a_{r}^{π} b]}_{r}^{ⓓ}, \end{matrix}

as asserted. □

Corollary 7.

Let

a, b, a_{r}^{π} b, (a + b) a a_{r}^{ⓓ} \in A_{r}^{ⓓ}

. If

a_{r}^{π} a b = 0, a_{r}^{π} b a = 0

and

a_{r}^{π} b^{*} a = 0

, then

a + b \in A_{r}^{ⓓ}

. In this case,

{(a + b)}_{r}^{ⓓ} = {[(a + b) a a_{r}^{ⓓ}]}_{r}^{ⓓ} + {[a_{r}^{π} b]}_{r}^{ⓓ} - {[(a + b) a a_{r}^{ⓓ}]}_{r}^{ⓓ} b {[a_{r}^{π} b]}_{r}^{ⓓ} .

Proof.

Since

a_{r}^{π} b^{*} a = 0

, we see that

\begin{matrix} a a_{r}^{d} b a_{r}^{π} & = & a a_{r}^{d} b (1 - a a_{r}^{d}) \\ = & {(a a_{r}^{d})}^{*} b {(1 - a a_{r}^{d})}^{*} \\ = & {(a_{r}^{d})}^{*} a^{*} b {(1 - a a_{r}^{d})}^{*} \\ = & {(a_{r}^{d})}^{*} {[a_{r}^{π} b^{*} a]}^{*} = 0 . \end{matrix}

Therefore the proof is true by Theorem 4.2. □

Corollary 8.

Let

a, b \in A_{r}^{ⓓ}

. If

a b = b a = a^{*} b = 0

, then

a + b \in A_{r}^{d}

. In this case,

{(a + b)}_{r}^{ⓓ} = a_{r}^{ⓓ} + b_{r}^{ⓓ} .

Proof.

Since

a^{*} b = 0

, we have

b^{*} a = {(a^{*} b)}^{*} = 0

. Hence,

a_{r}^{π} a b = 0, a_{r}^{π} b a = 0

and

a_{r}^{π} b^{*} a = 0

. According to Corollary 4.3, the result follows. □

We now establish the power property of generalized right core inverse.

Theorem 8.

Let

a \in A

and

n \in N

. Then the following are equivalent:

(1): $a \in A_{r}^{ⓓ}$ .
(2): $a^{n} \in A_{r}^{ⓓ}$ .

In this case,

a_{r}^{ⓓ} = a^{n - 1} {(a^{n})}_{r}^{ⓓ} .

Proof.

(1) \Rightarrow (2)

Let

x = a_{r}^{ⓓ}

. Then we verify that

a x = a (a x^{2}) = a^{2} x^{2} = \dots = a^{n} x^{n} .

Hence,

\begin{matrix} a^{n} {(x^{n})}^{2} & = & (a^{n} x^{n}) x^{n} = a x^{n + 1} = (a x^{2}) x^{n - 1} = x^{n}, \\ {(a^{n} x^{n})}^{*} & = & {(a x)}^{*} = a x = a^{n} x^{n}, \\ {(a^{n})}^{m} - a^{n} x^{n} {(a^{n})}^{m} & = & a^{n m} - a x a^{n m} . \end{matrix}

Hence,

lim_{m \to \infty} | | {(a^{n})}^{m} - a^{n} x^{n} {(a^{n})}^{m} {| |}^{\frac{1}{m}} = 0 .

Therefore

{(a^{n})}_{r}^{ⓓ} = x^{n}

, as required.

(2) \Rightarrow (1)

Let

x = a^{n - 1} {(a^{n})}_{r}^{ⓓ}

. Then

a x = a^{n} {(a^{n})}_{r}^{ⓓ} .

Hence we check that

\begin{matrix} a x^{2} & = & a^{n} {(a^{n})}_{r}^{ⓓ} a^{n - 1} {(a^{n})}_{r}^{ⓓ} = x, \\ {(a x)}^{*} & = & {(a^{n} {(a^{n})}_{r}^{ⓓ})}^{*} = a^{n} {(a^{n})}_{r}^{ⓓ} = a x, \\ a^{m} - a x a^{m} & = & a^{m} - a^{n} {(a^{n})}_{r}^{ⓓ} a^{m} \\ = & (a^{n} - a^{n} {(a^{n})}_{r}^{ⓓ} a^{n}) a^{m - n} (m \geq n) . \end{matrix}

This implies that

lim_{m \to \infty} | | a^{m} - a x a^{m} {| |}^{\frac{1}{m}} = 0 .

Accordingly,

{(a^{n})}_{r}^{ⓓ} = x

, as asserted. □

The next theorem provides a criteria for a triangular matrix has generalized right core inverse.

Theorem 9.

Let

α = (\begin{matrix} a & b \\ 0 & d \end{matrix}) \in M_{2} (A)

with

a, d \in A_{r}^{d}

. If

a_{r}^{π} b d_{r}^{d} = 0,

then

α \in M_{2} {(A)}_{r}^{d}

and

α_{r}^{ⓓ} = (\begin{matrix} a_{r}^{ⓓ} & - a_{r}^{ⓓ} b d_{r}^{ⓓ} \\ 0 & d_{r}^{ⓓ} \end{matrix}) .

Proof.

Since

a, d \in A_{r}^{ⓓ}

, we have generalized right core decompositions:

a = x + y, d = s + t,

where

x, s \in A_{r}^{◯ #}, y, t \in A^{q n i l}

and

x^{*} y = 0, y x = 0; s^{*} t = 0, t s = 0 .

Then we have

α = β + γ,

where

β = (\begin{matrix} x & x x_{r}^{◯ #} b \\ 0 & s \end{matrix}), γ = (\begin{matrix} y & (1 - x x_{r}^{◯ #}) b \\ 0 & t \end{matrix}) .

By hypothesis, we have

x_{r}^{π} (x x_{r}^{◯ #} b) = 0 .

Then

β \in M_{2} {(A)}_{r}^{◯ #} .

Since,

y, t \in A^{q n i l}

, we see that

γ \in M_{2} {(A)}^{q n i l} .

We directly check that

\begin{matrix} β^{*} γ & = & (\begin{matrix} x^{*} & 0 \\ b^{*} x x_{r}^{◯ #} & s^{*} \end{matrix}) (\begin{matrix} y & (1 - x x_{r}^{◯ #}) b \\ 0 & t \end{matrix}) \\ = & (\begin{matrix} 0 & x_{r}^{*} (1 - x x_{r}^{◯ #}) \\ b^{*} x x_{r}^{◯ #} y & b^{*} x x_{r}^{◯ #} (1 - x x_{r}^{◯ #}) b \end{matrix}) = 0, \\ γ β & = & (\begin{matrix} y & (1 - x x_{r}^{◯ #}) b \\ 0 & t \end{matrix}) (\begin{matrix} x & x x_{r}^{◯ #} b \\ 0 & s \end{matrix}) \\ = & (\begin{matrix} 0 & y x x_{r}^{◯ #} b + (1 - x x_{r}^{◯ #}) b s \\ 0 & 0 \end{matrix}) = 0 . \end{matrix}

Then

α \in M_{2} {(A)}_{r}^{d}

. In light of Theorem 2.1, we have

\begin{matrix} α_{r}^{d} & = & β_{r}^{◯ #} \\ = & (\begin{matrix} x_{r}^{◯ #} & z \\ 0 & s_{r}^{◯ #} \end{matrix}) \\ = & (\begin{matrix} a_{r}^{d} & z \\ 0 & d_{r}^{d} \end{matrix}) . \end{matrix}

where

z = - x_{r}^{◯ #} [x x_{r}^{◯ #} b] s_{r}^{◯ #} = - a_{r}^{d} b d_{r}^{d} .

This completes the proof. □

5. right core-EP inverses

In this section, we apply our main results and characterize right core-EP inverse by certain new ways. The following lemma is crucial.

Lemma 2.

Let

a \in A

. Then

a \in A_{r}^{D}

if and only if

(1): $a \in A_{r}^{ⓓ}$ ;
(2): there exists some $k \in N$ such that $a^{k} A = a^{k + 1} A$ .

In this case,

a_{r}^{Ⓓ} = a_{r}^{ⓓ}

Proof.

⟹ Obviously,

a \in A_{r}^{ⓓ}

. In view of [14, Theorem 4.9], there exists some

k \in N

such that

a^{k} A = a^{k + 1} A

⟸ Let

x = a_{r}^{d}

. Then

x a x = x = a x^{2}, {(a x)}^{*} = a x, lim_{n \to \infty} | | a^{n} - a x a^{n} {| |}^{\frac{1}{n}} = 0 .

Write

a^{k} = a^{k + 1} y

for a

y \in A

. Set

z = a^{k} y x^{k}

. Then we verify that

a z = (a^{k + 1} y) x^{k} = a^{k} x^{k} = a x,

and so

{(a z)}^{*} = {(a x)}^{*} = a x = a z

. We observe that

\begin{matrix} a z^{2} & = & (a z) z = a x a^{k} y x^{k} = a x a^{k + n} y^{n + 1} x^{k} \\ = & a^{k + n} y^{n + 1} x^{k} - [a^{k + n} - a x a^{k + n}] y^{n + 1} x^{k} \\ = & a^{k} y x^{k} - [a^{k + n} - a x a^{k + n}] y^{n + 1} x^{k} \\ = & z - [a^{k + n} - a x a^{k + n}] y^{n + 1} x^{k}, \end{matrix}

and then

lim_{n \to \infty} | | a z^{2} - z {| |}^{\frac{1}{n}} = 0

. This implies that

a z^{2} = z

. Moreover, we have

a^{k} - a z a^{k} = a^{k} - a x a^{k} = a^{k + n} y^{n + 1} - a x a^{k + n} y^{n + 1} = [a^{k + 1} - a x a^{k + n}] y^{n + 1} .

Hence,

| | a^{k} - a z a^{k} | | \leq | | a^{k + 1} - a x a^{k + n} | | | | y^{n + 1} | | .

Since

lim_{n \to \infty} | | a^{k + 1} - a x a^{k + n} {| |}^{\frac{1}{n}} = lim_{n \to \infty} [| | a^{k + 1} - a x a^{k + n} {| |}^{\frac{1}{k + n}}]^{1 + \frac{k}{n}} = 0

, we deduce that

lim_{n \to \infty} | | a^{k} - a z a^{k} {| |}^{\frac{1}{n}} = 0

; and then

a^{k} = a z a^{k}

. Therefore

a \in A_{r}^{Ⓓ}

. By using the uniqueness of generalized right core inverse, we have

z = x

, as required. □

We are ready to prove:

Theorem 10.

Let

a \in A

. Then the following are equivalent:

(1): $a \in A_{r}^{Ⓓ} .$
(2): $a^{k} \in A_{r}^{◯ #}$ for some $k \in N$ .
(3): There exist $x, y \in A$ such that

$a = x + y, x^{*} y = y x = 0, x \in A_{r}^{◯ #}, y \in A^{n i l} .$

Proof.

(1) \Leftrightarrow (2)

See [14, Theorem 4.8].

(1) \Rightarrow (3)

By virtue of Lemma 5.1,

a \in A_{r}^{ⓓ}

and

a_{r}^{ⓓ} = a_{r}^{Ⓓ}

. In view of Theorem 2.1, we can find

x, y \in A

such that

a = x + y, x^{*} y = y x = 0, x \in A_{r}^{◯ #}, y \in A^{q n i l} .

Explicitly, we have

y = a - a a_{r}^{ⓓ} a = a - a a_{r}^{Ⓓ} a

. Set

z = a_{r}^{Ⓓ}

. Then

a z^{2} = z, {(a z)}^{*} = a z

and

a^{k} = a z a^{k}

for some

k \in N

. It is easy to see that

(1 - a z) a (a z) = (1 - a z) a (a^{k - 1} z^{k - 1}) = (1 - a z) a^{k} z^{k - 1} = 0 .

Moreover, we verify that

\begin{matrix} {(a - z a^{2})}^{k + 2} & = & (1 - z a) a {(a - z a^{2})}^{k} (a - z a^{2}) \\ = & (1 - z a) a {(a - z a^{2})}^{k - 1} (a - z a^{2}) a \\ = & (1 - z a) a {(a - z a^{2})}^{k - 1} a^{2} \\ ⋮ \\ = & (1 - z a) a (a - z a^{2}) a^{k} \\ = & (1 - z a) (a^{k} - a z a^{k}) a \\ = & 0 . \end{matrix}

This implies that

a - z a^{2} \in A^{n i l}

. Therefore

y = a - a z a \in A^{n i l}

, as desired.

(3) \Rightarrow (1)

By hypothesis, there exist

x, y \in A

such that

a = x + y, x^{*} y = y x = 0, x \in A_{r}^{◯ #}, y \in A^{n i l} .

Since

A^{n i l} \subseteq A^{q n i l}

. In view of Theorem 2.1,

a \in A_{r}^{ⓓ}

and

z : = a_{r}^{ⓓ} = x^{◯ #}

. Hence,

a z^{2} = z

and

{(a z)}^{*} = a z

. Write

y^{k} = 0 (k \in N)

. Then

a^{k} = \sum_{i = 0}^{k} x^{i} y^{n - i} = y^{k} + x y^{k - 1} + \dots + x^{k - 1} y + x^{k} = x y^{k - 1} + \dots + x^{k - 1} y + x^{k} .

Then

a z a^{k} = (x + y) x_{r}^{◯ #} x [y^{k - 1} + \dots + x^{k - 2} y + 1] = x [y^{k - 1} + \dots + x^{k - 2} y + 1] = a^{k} .

Therefore

a \in A_{r}^{Ⓓ},

as asserted. □

Corollary 9.

Let

a \in A

. Then

a \in A^{Ⓓ}

if and only if

(1): $a \in A^{D};$
(2): there exist $x, y \in A$ such that

$a = x + y, x^{*} y = y x = 0, x \in A_{r}^{◯ #}, y \in A^{n i l} .$

Proof.

⟹ This is obvious by [6, Theorem 2.9].

⟸ In view of Theorem 5.2,

a \in A_{r}^{Ⓓ}

. Therefore we complete the proof by Corollary 2.5. □

We are ready to prove:

Theorem 11.

Let

a \in A

. Then the following are equivalent:

(1): $a \in A_{r}^{Ⓓ}$ .
(2): There exists a projection $p \in A$ such that

$a + p \in A_{r}^{- 1}, a p \in A^{n i l}, (1 - p) A = a (1 - p) A .$

Proof.

(1) \Rightarrow (2)

In light of Theorem 3.1, there exists a projection

p \in A

such that

a + p \in A_{r}^{- 1}, a p \in A^{q n i l}, (1 - p) A = a (1 - p) A .

Explicitly,

p = 1 - a a_{r}^{Ⓓ}

. As in the proof of Theorem 3.1, we check that

a p = a (1 - a a_{r}^{Ⓓ}) \in A^{n i l}

, as desired.

(2) \Rightarrow (1)

By hypothesis, there exists a projection

p \in A

such that

u : = a + p \in A_{r}^{- 1}, a p \in A^{n i l}, (1 - p) A = a (1 - p) A .

Then

a = (1 - p) a + p a

. Obviously,

{[(1 - p) a]}^{*} p a = a^{*} (1 - p) p a = 0, p a (1 - p) a = p [a (1 - p)] a = 0

and

p a \in A^{n i l}

Write

u v = 1

for a

v \in A

. Then we check that

\begin{matrix} (1 - p) a v (1 - p) a & = & (1 - p) u v (1 - p) a = (1 - p) a, \\ {((1 - p) a v)}^{*} & = & 1 - p = (1 - p) a v . \end{matrix}

Hence,

(1 - p) a \in A^{(1, 3)}

. Moreover, we see that

a (1 - p) = a (1 - p) u v = a (1 - p) a v = (1 - p) a (1 - p) a v = {[(1 - p) a]}^{2} v,

and then

(1 - p) a A = {[(1 - p) a]}^{2} A

. In light of [14, Theorem 3.1],

(1 - p) a \in A_{r}^{◯ #}

. According to Theorem 5.2,

a \in A_{r}^{Ⓓ}

. □

Corollary 10.

Let

a \in A

. Then

a \in A^{D}

if and only if

(1): $a \in A^{D}$ ;
(2): there exists a projection $p \in A$ such that

$a + p \in A_{r}^{- 1}, a p \in A^{n i l}, (1 - p) A = a (1 - p) A .$

Proof.

This is obvious by Theorem 5.4 and Corollary 2.5. □

Theorem 12.

Let

a \in A

. Then the following are equivalent:

(1): $a \in A_{r}^{Ⓓ}$ .
(2): There exists $b \in A$ such that

$b a b = b, {(a b)}^{*} = a b, a b a A = a^{2} b a A, a - a^{2} b \in A^{n i l} .$

Proof.

(1) \Rightarrow (2)

In view of Theorem 5.2, there exist

x, y \in A

such that

a = x + y, x^{*} y = y x = 0, x \in A_{r}^{◯ #}, y \in A^{n i l} .

Set

b = x_{r}^{◯ #}

. As in the proof of Theorem 3.3, we verify that

b a b = b, {(a b)}^{*} = a b, a b a A = a^{2} b a A .

Similarly to Theorem 3.3, we check that

a - a^{2} b \in A^{n i l}

, as desired.

(2) \Rightarrow (1)

In view of Theorem 3.3, we see that

a \in A_{r}^{ⓓ}

. Since

a - a^{2} b \in A

, we can find some

k \in N

such that

{(a - a b a)}^{k} = 0

. As

a b a A = a^{2} b a A

, by induction, we see that

a b a \in a^{m} b a A

for all

m \in N

. Then

a^{k} \in a^{k + 1} A

; hence,

a^{k} A = a^{k + 1} A

. Therefore we complete the proof by Lemma 5.1. □

Corollary 11.

Let

a \in A

. Then

a \in A^{D}

if and only if

(1): $a \in A^{D}$ ;
(2): There exists $b \in A$ such that

$b a b = b, {(a b)}^{*} = a b, a b a A = a^{2} b a A, a - a^{2} b \in A^{n i l} .$

Proof.

This is proof by Theorem 5.6 and Corollary 2.5. □

References

O.M. Baksalary and G. Trenkler, Core inverse of matrices, Linear Multilinear Algebra, 58(2010), 681–697.
H. Chen and M. Sheibani, Theory of Clean Rings and Matrices, World Scientific, Hackensack, NJ, 2023. [CrossRef]
H. Chen and M. Sheibani, Generalized weighted core inverse in Banach *-algebras, Filomat, 38(2024), 3691–3706.
J. Chen, H. Zhu, P. Patricio and Y. Zhang, Characterizations and representations of core and dual core inverses Canad. Math. Bull., 60(2017), 269–282.
X. Chen and J. Chen, Right core inverses of a product and a companion matrix, Linear Multilinear Algebra, 69(2021), 2245–2263.
Y. Gao and J. Chen, Pseudo core inverses in rings with involution, Commun. Algebra, 46(2018), 38–50.
Y. Gao and J. Chen, The pseudo core inverse of a lower triangular matrix, Rev. R. Acad. Cienc. Exactas Fis. Nat., Ser. A Mat., 113(2019), 423–434.
Y. Ke; L. Wang and J. Chen, The core inverse of a product and 2×2 matrices, Bull. Malays. Math. Sci. Soc., 42(2019), 51–66.
N. Mihajlović, Group inverse and core inverse in Banach and C^*-algebras, Commun. Algebra, 48(2020), 1803–1818.
D. Mosić, Core-EP pre-order of Hilbert space operators, Quaest. Math., 41(2018), 585–600.
D. Mosić, Core-EP inverse in ring with involution, Publ. Math. Debrecen, 96(2020), 427–443.
D. Mosić, Core-EP inverses in Banach algebras, Linear Multilinear Algebra, 69(2021), 2976–2989.
D. Mosić; G. Dolinar and J. Marovt, EP-quasinilpotent decomposition and its applications, Rev. R. Acad. Cienc. Exactas Fis. Nat., Ser. A Mat., 115(2021), No. 4, Paper No. 188, 25 p.
L. Wang; D. Mosić and Y. Gao, Right core inverse and the related generalized inverses, Commun. Algebra, 47(2019), 4749–4762.
L. Wang and D. Mosić, The one-sided inverse along two elements in rings, Linear Multilinear Algebra, 69(2021), 2410-2422.
S. Xu, Core invertibility of triangular matrices over a ring, Indian J. Pure Appl. Math., 50(2019), 837-847.
K. Yan, One-sided Drazin inverses in Banach algebras and perturbations of B-Fredholm spectra, preprint, arXiv:2312.107042402.13574v1 [math.RA] 21 Feb 2024.
H. Zhu; L. Wu and D. Mosić, One-sided w-core inverses in rings with an involution, Commun. Algebra, 71(2023), 528–544.

Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

© 2024 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (http://creativecommons.org/licenses/by/4.0/).

Copyright: This open access article is published under a Creative Commons CC BY 4.0 license, which permit the free download, distribution, and reuse, provided that the author and preprint are cited in any reuse.

MDPI Initiatives

Important Links

Choose an area of interest and we will send you notifications of new preprints at your preferred frequency.

Disclaimer

Generalized Right Core Inverse in *-Banach Algebras

Abstract

1. Introduction

2. generalized right core inverse

3. equivalent characterizations

4. algebraic properties

5. right core-EP inverses

References

MDPI Initiatives

Important Links

Subscribe