On an Element-by-Element Description of the Monoid of all Endomorphisms of an Arbitrary Groupoid and One Classification of Endomorphisms of a Groupoid

The problem of element-by-element description of the monoid of all endomorphisms of an arbitrary groupoid is considered. It is established that this monoid is decomposed into a union of pairwise disjoint classes of endomorphisms; these classes are called basic sets of endomorphisms. Such sets of endomorphisms of a groupoid 𝐺\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$G$$\end{document} are parameterized by mappings :𝛾→𝐺12\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\gamma:G\to\{1,2\}$$\end{document}, which in this paper are called bipolar types (hereinafter, simply types). If some endomorphism belongs to a basic set of type 𝛾\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\gamma$$\end{document}, then we say that it has type 𝛾\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\gamma$$\end{document}. Thus, we obtain a classification of all endomorphisms of a fixed groupoid (a bipolar classification of endomorphisms). A connection between the types of endomorphisms of two isomorphic groupoids is revealed. The basic set of endomorphisms need not be closed under composition. Groupoids are constructed in which some basic sets are closed. For each basic set, an endomorphism semigroup contained in this basic set is constructed. These semigroups in some cases degenerate into empty sets. Examples of groupoids are given in which the constructed endomorphism semigroups are nonempty. The constructed semigroups can be used to study the problem of element-by-element description of the monoid of all endomorphisms and to study the structure of the monoid of all endomorphisms.