mixed group
A mixed group is a partial groupoid such that contains a non-empty subset , called the kernel of , with the following conditions:
- 1.
if , then is defined iff ,
- 2.
if and , then ,
- 3.
if , then ,
- 4.
if and such that , then for all .
Mixed groups are generalizations of groups, as the following proposition
illustrates:
Proposition 1.
If , then is a group.
Proof.
is a groupoid by condition 1, and a semigroup by condition 2.
Now, by condition 3, given , there is such that , so that for all by condition 4. In other words, is a left identity of . Again, by condition 3, for every , there is a such that . So , so, by condition 4, for all . In particular, set , we get . Hence, is a two-sided identity
, and is a monoid.
Finally, by condition 3, for every , there are , such that . So, , showing that has a two-sided inverse. This means that is a group.∎
For a non-trivial example of a mixed group, let be a group and a subgroup of . Define a new multiplication
on as follows: is defined iff , and if is defined, it is defined as , the group multiplication of and . Then is a mixed group. Clearly, associativity of is automatically satisfied. Next, pick any , then, for any , and are both elements of , so that , and condition 3 is also satisfied. Finally, if and such that , then is the multiplicative identity
of , clearly for all .
References
- 1 R. H. Bruck,A Survey of Binary Systems, Springer-Verlag, 1966
- 2 R. Baer,Zur Einordnung der Theorie der Mischgruppen in die Gruppentheorie, S.-B. Heidelberg. Akad. Wiss., Math.-naturwiss. KI. 1928, 4, 13 pp
- 3 R. Baer,Über die Zerlegungen einer Mischgruppe nach einer Untermischgruppe, S.-B. Heidelberg. Akad. Wiss., Math.-naturwiss. KI. 1928, 5, 13 pp
- 4 A. Loewy,Über abstrakt definierte Transmutationssysteme oder Mischgruppen, J. reine angew. Math. 157, pp 239-254, 1927