This is a variation of group|Find other variations of group | Read a survey article on varying group
QUICK PHRASES: group-like structure with n-ary instead of binary operation for multiplication
A multiary group or polyadic group is a -ary group for some . Note that the case corresponds to the usual notion of group.
A -ary group is defined as a set with a -ary operation, i.e., a map such that:
- It is a multiary semigroup: All different ways of associating expressions involving the -ary operation yield equivalent results. Note that this boils down to checking that all the distinct possible ways of associating an expression of length give the same answer.
- It is a multiary quasigroup: The equation has a unique solution with any as the unknown and all other quantities known.
Note that we do not assume separate axioms on identity and inverses. Rather, we bundle both into the unique solution condition (part (2) of the definition). To see why gives a group, refer associative quasigroup implies group.
- Multiary semigroup: This only requires condition (1), the associativity condition.
- Multiary quasigroup: This only requires condition (2), the unique solutions condition.
- Hypergroup: A different type of variation, where the multiplication operation is still binary, but can now give multiple outputs.
A group gives a -ary group for all
Further information: Group is n-ary group for all n
The structure of a group on a set also equips with the structure of a -ary group for any . For this, we define the -ary product to simply be the product of the elements (in that particular sequence) in the group. Briefly:
- The product is well-defined independent of parenthesization because of the associativity of the group multiplication.
- The associativity condition for the -ary group follow from those for a group.
- The unique solution condition follows from the fact that these conditions hold in groups. Further information: Group implies quasigroup, manipulating equations in groups
Reducibility and irreducibility
Not every -ary group arises from a group in this way. A -ary group that arises from a group is termed reducible, and a -ary group that does not arise from a group in this way is termed irreducible. It turns out that a -ary group is reducible if and only if its set of neutral elements is non-empty.