Abstract:In this article the pseudo-amenability and pseudo-contractibility of restricted semigroup algebra
$l_r^1(S)$
and semigroup algebra, l1(Sr) on restricted semigroup, Sr are investigated for different classes of inverse semi-groups such as Brandt semigroup, and Clifford semigroup. We particularly show the equivalence between pseudo-amenability and character amenability of restricted semigroup algebra on a Clifford semigroup and semigroup algebra on a restricted semigroup. Moreover, we show that when S = M0(… Show more
“…In light of the above discussion, [11,Propositon 4.10] can not be valid. In other words, when 1 (S) is pseudo-amenable, then by [11,Proposition 3.5], S is amenable (not finite) and in general case, amenability of S does not imply amenability or character amenability of 1 (S). This happen when, S is an abelian or left (right) cancellative unital semigroup.…”
Section: Examplementioning
confidence: 99%
“…Since N ∧ and N ∨ are inverse semigroups, by Theorem 3, N ∧ and N ∨ must be finite which is impossible. It is shown in the proof of [11,Proposition 3.5] that every amenable inverse semigroup is finite which is not true. For instance, every bicyclic inverse semigroup is amenable but not finite and hence one side of the mentioned proposition is not true.…”
Section: Examplementioning
confidence: 99%
“…Recently [11] come to our attention. The paper is devoted to study the pseudoamenability of some semigroup algebras related to inverse and restricted semigroups.…”
In this short note, we give some counter examples which show that [11, Proposition 3.5] is not true. As a consequence, the arguments in [11, Proposition 4.10] are not valid.
“…In light of the above discussion, [11,Propositon 4.10] can not be valid. In other words, when 1 (S) is pseudo-amenable, then by [11,Proposition 3.5], S is amenable (not finite) and in general case, amenability of S does not imply amenability or character amenability of 1 (S). This happen when, S is an abelian or left (right) cancellative unital semigroup.…”
Section: Examplementioning
confidence: 99%
“…Since N ∧ and N ∨ are inverse semigroups, by Theorem 3, N ∧ and N ∨ must be finite which is impossible. It is shown in the proof of [11,Proposition 3.5] that every amenable inverse semigroup is finite which is not true. For instance, every bicyclic inverse semigroup is amenable but not finite and hence one side of the mentioned proposition is not true.…”
Section: Examplementioning
confidence: 99%
“…Recently [11] come to our attention. The paper is devoted to study the pseudoamenability of some semigroup algebras related to inverse and restricted semigroups.…”
In this short note, we give some counter examples which show that [11, Proposition 3.5] is not true. As a consequence, the arguments in [11, Proposition 4.10] are not valid.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.