Abstract
Pairs (G, Γ) are considered, where G is a vector space over an arbitrary fixed field and Γ is a group for which there is defined a representation with respect to G. A class of such pairs is called a prevariety if it is saturated and closed under the operations of forming subpairs and Cartesian products. A prevariety is called bounded if the variety generated by it differs from the class of all pairs. A prevariety is called small if it is generated by a single pair. The following theorems are proved. Theorem 1. Over any field the semigroup of bounded prevarieties of pairs is free. Theorem 2. The small prevarieties of pairs are indecomposable and generate a free semigroup of prevarieties.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
