1. Introduction
The concept of a direct product plays a crucial role in algebraic structures in the study of their internal constitution and their representation in terms of better known/simpler structures (see, e.g., [
1,
2]). For instance, in elementary particle physics, the decomposition of a gauge symmetry group of the model to the direct product gives its particle content [
3,
4]. Furthermore, the concept of semisimplicity in representation theory is totally based on the direct product (see, e.g., [
5,
6]).
The general method of the construction of the external direct product is to take the Cartesian product of the underlying sets and endow it with the operations from the algebraic structures under consideration. Usually this is an identical repetition of the initial multipliers’ operations componentwise [
7]. In the case of polyadic algebraic structures, their arity comes into the game, such that endowing the product with operations becomes nontrivial in two aspects: the arities of all structures can be different (but “quantized” and not unique) and the elements from different multipliers can be “entangled” meaning that the product is not componentwise. The direct (componentwise) product of
n-ary groups was considered in [
8,
9]. We propose two corresponding polyadic analogs (changing arity and “entangling”) of the external direct product which preserve its associativity, and therefore allow us to analyze polyadic semigroups, groups, rings and fields.
From a mathematical viewpoint, the direct product is also important, especially because it plays the role of a product in a corresponding category (see, e.g., [
10,
11]). For instance, the class of all polyadic groups for objects and polyadic group homomorphisms for morphisms form a category which is well-defined, because it has the polyadic direct product [
12,
13] as a product.
Here we also consider polyadic rings and fields in the same way. Since there exist zeroless polyadic fields [
14], the well-known statement (see, e.g., [
2]) of the absence of binary fields that are a direct product of fields does not hold in the polyadic case. We construct polyadic fields which are products of zeroless fields, which can lead to a new category (which does not exist for binary fields): the category of polyadic fields.
The proposed constructions are accompanied by concrete illustrative examples.
2. Preliminaries
In this section we briefly introduce the usual notation; for details see [
15]. For a non-empty (underlying) set
G the
n-tuple (or
polyad [
16]) of elements is denoted by
,
,
, and the Cartesian product is denoted by
and consists of all such
n-tuples. For all elements equal to
, we denote
n-tuple (polyad) by a power
. To avoid unneeded indices we denote with one bold letter
a polyad for which the number of elements in the
n-tuple is clear from the context, and sometimes we will write
. On the Cartesian product
we define a polyadic (or
n-ary) operation
such that
, where
. The operations with
are called
unary, binary and ternary.
Recall the definitions of some algebraic structures and their special elements (in the notation of [
15]). A (one-set)
polyadic algebraic structure is a set that is
G-closedwith respect to polyadic operations. In the case of one
n-ary operation
, it is called
polyadic multiplication (or
n-ary multiplication). A one-set
n-ary algebraic structure or
polyadic magma (
n-
ary magma) is a set that is
G-closed with respect to one
n-ary operation
and without any other additional structure. In the binary case
was also called a groupoid by Hausmann and Ore [
17] (and [
18]). Since the term “groupoid” was widely used in category theory for a different construction, the so-called Brandt groupoid [
19,
20], Bourbaki [
21] later introduced the term “magma”.
Denote the number of iterating multiplications by
, and call the resulting composition an
iterated product , such that
where the arities are connected by
which gives the length of an iterated polyad
in our notation
.
A
polyadic zero of a polyadic algebraic structure
is a distinguished element
(and the corresponding 0-ary operation
) such that for any
-tuple (polyad)
we have
where
z can be in any place on the l.h.s. of (3). If its place is not fixed it can be a single zero. As in the binary case, an analog of positive powers of an element [
16] should coincide with the number of multiplications
in the iteration (1).
A (positive)
polyadic power of an element is
We define associativity as the invariance of the composition of two
n-ary multiplications. An element of a polyadic algebraic structure
g is called
-
nilpotent (or simply
nilpotent for
), if there exist
such that
A
polyadic (n-
ary) identity (or neutral element) of a polyadic algebraic structure is a distinguished element
e (and the corresponding 0-ary operation
) such that for any element
we have
where
g can be in any place on the l.h.s. of (6).
In polyadic algebraic structures, there exist
neutral polyads satisfying
where
g can be in any of
n places on the l.h.s. of (7). Obviously, the sequence of polyadic identities
is a neutral polyad (6).
A one-set polyadic algebraic structure
is called
totally associative if
with respect to the placement of the internal multiplication
on the r.h.s. on any of
n places, with a fixed order of elements in the any fixed polyad of
elements
.
A
polyadic semigroup is a one-set
S one-operation
algebraic structure in which the
n-ary multiplication is associative,
. A polyadic algebraic structure
is
-
commutative, if
, or
where
is a permutated polyad and
is a fixed element of
, the permutation group on
n elements. If (9) holds for all
, then a polyadic algebraic structure is
commutative. A special type of the
-commutativity
where
is any fixed
-polyad, is referred to as
semicommutativity. If an
n-ary semigroup
is iterated from a commutative binary semigroup with identity, then
is semicommutative. A polyadic algebraic structure is called (uniquely)
i-
solvable, if for all polyads
t,
u and element
h, one can (uniquely) resolve the equation (with respect to
h) for the fundamental operation
where
h can be on any place, and
are polyads of the needed length.
A polyadic algebraic structure which is uniquely
i-solvable for all places
is called a
n-
ary (or
polyadic)
quasigroup . An associative polyadic quasigroup is called an
n-
ary (or
polyadic)
group. In an
n-ary group
the only solution of (11) is called a
querelement of
g and is denoted by
[
22], such that
where
can be on any place. Any idempotent
g coincides with its querelement
. The unique solvability relation (12) in an
n-ary group can be treated as a definition of the unary (multiplicative)
queroperation
We observe from (12) and (7) that the polyad
is neutral for any element of a polyadic group, where
can be on any place. If this
i-th place is important, then we write
. In a polyadic group the
Dörnte relations [
22]
hold true for any allowable
. In the case of a binary group, the relations (15) become
.
Using the queroperation (13) one can give a
diagrammatic definition of a polyadic group [
23]: an
n-
ary group is a one-set algebraic structure (universal algebra)
where
is an
n-ary associative multiplication and
is the queroperation (13).
3. Polyadic Products of Semigroups and Groups
We start from the standard external direct product construction for semigroups. Then we show that consistent “polyadization” of the semigroup direct product, which preserves associativity, can lead to additional properties:
- (1)
The arities of the polyadic direct product and power can differ from that of the initial semigroups.
- (2)
The components of the polyadic power can contain elements from different multipliers.
We use here a vector-like notation for clarity and convenience in passing to higher arity generalizations. Begin from the direct product of two (binary) semigroups
, where
are underlying sets, whereas
are multiplications in
. On the Cartesian product of the underlying sets
we define a
direct product of the semigroups
via the componentwise multiplication of the doubles
(being the Kronecker product of doubles in our notation), as
and in the “polyadic” notation
Obviously, the associativity of follows immediately from that of , because of the componentwise multiplication in (18). If are groups with the identities , then the identity of the direct product is the double , such that .
3.1. Full Polyadic External Product
The “polyadization” of (18) is straightforward
Definition 1. An-ary full direct product semigroupconsists of (two or k) n-ary semigroups (of the same arity)where the (total) polyadic associativity (8) ofis governed by those of the constituent semigroupsand(or) and the componentwise construction (19). If
are
n-ary groups (where
are the unary multiplicative queroperations (13)), then the queroperation
of the full direct product group
(
) is defined componentwise as follows:
which satisfies
with
on any place (cf. (12)).
Definition 2. A full polyadic direct productis called derived if its constituentsandare derived, such that the operationsare compositions of the binary operations, correspondingly.
In the derived case, all the operations in (19) have the form (see (1) and (2))
The operations of the derived polyadic semigroup can be written as (cf., the binary direct product (17) and (18))
We will be more interested in nonderived polyadic analogs of the direct product.
Example 1. Let us have two ternary groups: the unitless nonderived group, where,is a triple product in, the querelement is, andwith, the querelement. Then, the ternary nonderived full direct product group becomes, wherewhich contains no identity, becauseis unitless and nonderived. 3.2. Mixed-Arity Iterated Product
In the polyadic case, the following question arises, which cannot even be stated in the binary case: is it possible to build a version of the associative direct product such that it can be nonderived and have different arity than the constituent semigroup arities? The answer is yes, which leads to two arity-changing constructions: componentwise and noncomponentwise.
- (1)
Iterated direct product(⊛). In each of the constituent polyadic semigroups we use the iterating (1) componentwise, but with different numbers of compositions, because the same number of compositions evidently leads to the iterated polyadic direct product. In this case the arity of the direct product is greater than or equal to the arities of the constituents .
- (2)
Hetero product(⊠). The polyadic product of
k copies of the same
n-ary semigroup is constructed using the associativity quiver technique, which
mixes (“
entangles”)
elements from different multipliers, it is
noncomponentwise (by analogy with heteromorphisms in [
15]), and so it can be called a
hetero product or
hetero power (for coinciding multipliers, i.e., constituent polyadic semigroups or groups). This gives the arity of the hetero product which is less than or equal to the arities of the equal multipliers
.
In the first componentwise case (
1), the constituent multiplications (19) are composed from the lower-arity ones in the componentwise manner, but the initial arities of up and down components can be different (as opposed to the binary derived case (21))
where we exclude the limits: the derived case
(21) and the undecomposed case
(19). Since the total size of the up and down polyads is the same and coincides with the arity of the double
G multiplication
, using (2) we obtain the
arity compatibility relations
Definition 3. A mixed-arity polyadic iterated direct product semigroup consists of (two) polyadic semigroups and of the different arity shapes and and the arity compatibility relations (25) hold. Observe that it is not the case that any two polyadic semigroups can be composed in the mixed-arity polyadic direct product.
Assertion 1. If the arity shapes of two polyadic semigroupsandsatisfy the compatibility conditionthen they can form a mixed-arity direct product, where(25). Example 2. In the case of 4-ary and 5-ary semigroups and the direct product arity of is “quantized” , such thatand only the first mixed-arity 13-ary direct product semigroup is nonderived. If and are polyadic groups with the queroperations and correspondingly, then the iterated direct is a polyadic group with the queroperation given in (20). In the same way one can consider the iterated direct product of any number of polyadic semigroups.
3.3. Polyadic Hetero Product
In the second noncomponentwise case (2) we allow multiplying elements from different components, and therefore we should consider the Cartesian k-power of sets and endow the corresponding k-tuple with a polyadic operation in such a way that the associativity of will govern the associativity of the product . In other words we construct a k-power of the polyadic semigroup such that the result is an -ary semigroup.
The general structure of the hetero product formally coincides “reversely” with the main heteromorphism equation [
15]. The additional parameter which determines the arity
of the hetero power of the initial
n-ary semigroup is the number of intact elements
. Thus, we arrive at
Definition 4. The hetero (“entangled”) k-power of the n-ary semigroup is the -ary semigroup defined on the k-th Cartesian power , such that ,and the -ary multiplication of k-tuples is given (informally) bywhere is the number of intact elements on the r.h.s., and is the number of multiplications in the resulting k-tuple of the direct product. The hetero power parameters are connected by the arity-changing formula [15]with the integer . The concrete placement of elements and multiplications in (32) to obtain the associative
is governed by the associativity quiver technique [
15].
There exist important general numerical relations between the parameters of the twisted direct power
, which follow from (32) and (33). First, there are non-strict inequalities for them
Second, the initial and final arities
n and
are not arbitrary, but “quantized” such that the fraction in (33) has to be an integer (see
Table 1).
Assertion 2. The hetero power is not unique in both directions, if we do not fix the initial n and finalarities ofand.
Proof. This follows from (32) and the hetero power “quantization” shown in
Table 1. □
The classification of the hetero powers consists of two limiting cases.
- (1)
Intactless power: there are no intact elements . The arity of the hetero power reaches its maximum and coincides with the arity of the initial semigroup (see Example 5).
- (2)
Binary power: the final semigroup is of lowest arity, i.e., binary
. The number of intact elements is (see
Example 4)
Example 3. Consider the cubic power of a 4-ary semigroup with the identity e, then the ternary identity triple in is , and therefore this cubic power is a ternary semigroup with identity.
Proposition 1. If the initial n-ary semigroup contains an identity, then the hetero power can contain an identity in the intactless case and the Post-like quiver [15]. For the binary power only the one-sided identity is possible. Let us consider some concrete examples.
Example 4. Let be a ternary semigroup, then we can construct its power (square) of the doubles in two ways to obtain the associative hetero powerThis means that the Cartesian square can be endowed with the associative multiplication , and therefore is a binary semigroup, being the hetero product . If has a ternary identity , then has only the left (right) identity , since (), but not the right (left) identity. Thus, can be a semigroup only, even if is a ternary group. Example 5. Take a ternary semigroup, then the multiplication on the doubleis ternary and noncomponentwiseand is associative (and described by the Post-like associative quiver [15]), and therefore the cubic hetero power is the ternary semigroup , such that . In this case, as opposed to the previous example, the existence of a ternary identity in implies the ternary identity in the direct cube by . If is a ternary group with the unary queroperation , then the cubic hetero power is also a ternary group of the special class [24]: all querelements coincide (cf., (20)), such that , where , . This is because in (12) the querelement can be foundon any place. Theorem 1. If is an n-ary group, then the hetero k-power can contain queroperations in the intactless case only.
Corollary 1. If the power multiplication (32) contains no intact elements and does not change arity , a hetero power can be a polyadic group which has only one querelement.
Next we consider more complicated hetero power (“entangled”) constructions with and without intact elements, as well as Post-like and non-Post associative quivers [
15].
Example 6. Letbe a 4-ary semigroup, then we can construct its 4-ary associative cubic hetero powerusing the Post-like and non-Post-associative quivers without intact elements. Taking in (32), , , we obtain two possibilities for the multiplication of the triples
- (1)
Post-like associative quiver. The multiplication of the hetero cubic power case takes the formand it can be shown thatis totally associative; therefore,is a 4-ary semigroup. - (2)
Non-Post associative quiver. The multiplication of the hetero cubic power differs from (40)and it can be shown thatis totally associative; therefore,is a 4-ary semigroup.
The following is valid for both the above cases. Ifhas the 4-ary identity satisfyingthen the hetero powerhas the 4-ary identityIn the case whereis a ternary group with the unary queroperation, then the cubic hetero poweris also a ternary group with one querelement (cf., Example 5)where,. A more nontrivial example is a cubic hetero power which has different arity to the initial semigroup.
Example 7. Letbe a 4-ary semigroup, then we can construct its ternary associative cubic hetero powerusing the associative quivers with one intact element and two multiplications [15]. Taking in (32) the parameters,,,(see third line of Table 1), we obtain for the ternary multiplicationfor the triplesof the hetero cubic power case the formwhich is totally associative, and therefore the hetero cubic power of 4-ary semigroupis a ternary semigroup, such that. If the initial 4-ary semigrouphas the identity satisfying (42), then the ternary hetero powerhas only the right ternary identity (43) satisfying one relationand thereforeis a ternary semigroup with a right identity. Ifis a 4-ary group with the queroperation, then the hetero powercan only be a ternary semigroup, because inwe cannot define the standard queroperation [16]. 4. Polyadic Products of Rings and Fields
Now we show that the thorough “polyadization” of operations can lead to some unexpected new properties of ring and field external direct products. Recall that in the binary case the external direct product of fields does not exist at all (see, e.g., [
2]). The main new peculiarities of the polyadic case are:
- (1)
The arity shape of the external product ring and its constituent rings can be different.
- (2)
The external product of polyadic fields can be a polyadic field.
4.1. External Direct Product of Binary Rings
First, we recall the ordinary (binary) direct product of rings in notation which would be convenient to generalize to higher-arity structures [
14]. Let us have two binary rings
, where
are underlying sets, whereas
and
are additions and multiplications (satisfying distributivity) in
, correspondingly. On the Cartesian product of the underlying sets
one defines the
external direct product ring by the componentwise operations (addition and multiplication) on the doubles
as follows:
or in the polyadic notation (with manifest operations)
The associativity and distributivity of the binary direct product operations and are obviously governed by those of the constituent binary rings and , because of the componentwise construction on the r.h.s. of (49) and (50). In the polyadic case, the construction of the direct product is not so straightforward and can have additional unusual peculiarities.
4.2. Polyadic Rings
Here we recall definitions of polyadic rings [
25,
26,
27] in our notation [
14,
15]. Consider a polyadic structure
with two operations on the same set
R: the
m-ary addition
and the
n-ary multiplication
. The “interaction” between operations can be defined using the polyadic analog of distributivity.
Definition 5. The polyadic distributivity for and consists of n relationswhere . The operations
and
are totally
associative, if (in the invariance definition [
14,
15])
where the internal products can be on any place, and
,
, and the polyads
x,
t,
u,
w are of the needed lengths. In this way both algebraic structures
and
are
polyadic semigroups and
.
Definition 6. A polyadic-ringis a set R with two operationsand, such that:
- (1)
they are distributive (51)–(53);
- (2)
is a polyadic semigroup;
- (3)
is a commutative polyadic group.
In case the multiplicative semigroup of is commutative, , for all , then is called a commutative polyadic ring, and if it contains the identity, then is a -semiring. A polyadic ring is called derived, if and are repetitions of the binary addition and multiplication , whereas and are commutative (binary) group and semigroup, respectively.
4.3. Full Polyadic External Direct Product of -Rings
Let us consider the following task: for a given polyadic -ring to construct a product of all possible (in arity shape) constituent rings and . The first-hand “polyadization” of (49) and (50) leads to
Definition 7. A full polyadic direct product ring consists of (two) polyadic rings of the same arity shape, such thatwhere the polyadic associativity (8) and polyadic distributivity (51)–(53) of the direct product operations and follow from those of the constituent rings and the componentwise operations in (56) and (57). Example 8. Consider two -rings and , where and are operations in , then their polyadic direct product on the doubles is defined by The polyadic associativity and distributivity of the direct product operations and are evident, and therefore is a -ring .
Definition 8. A polyadic direct product is called derived if both constituent rings and are derived, such that the operations and are compositions of the binary operations and , correspondingly.
So, in the derived case (see (1) all the operations in (56) and (57) have the form (cf., (21))
Thus, the operations of the derived polyadic ring can be written as (cf., the binary direct product (47) and (48))
The external direct product -ring from Example 8 is not derived, because both multiplications and there are nonderived.
4.4. Mixed-Arity Iterated Product of -Rings
Recall that some polyadic multiplications can be iterated, i.e., composed (1) from those of lower arity (2), as well as those larger than 2, and so being nonderived, in general. The nontrivial “polyadization” of (49) and (50) can arise, when the composition of the separate (up and down) components on the r.h.s. of (56) and (57) will be different, and therefore the external product operations on the doubles cannot be presented in the iterated form (1).
Let the constituent operations in (56) and (57) be composed from lower-arity corresponding operations, but in different ways for the up and down components, such that
where we exclude the limits: the derived case
(60) and (61) and the uncomposed case
,
(56) and (57). Since the total size of the up and down polyads is the same and coincides with the arities of the double addition
m and multiplication
n, using (2) we obtain the
arity compatibility relations
Definition 9. A mixed-arity polyadic direct product ring consists of two polyadic rings of the different arity shape, such thatand the arity compatibility relations (66) and (67) hold valid. Thus, two polyadic rings cannot always be composed in the mixed-arity polyadic direct product.
Assertion 3. If the arity shapes of two polyadic ringsandsatisfy the compatibility conditionsthen they can form a mixed-arity direct product. The limiting cases, undecomposed (56) and (57) and derived (62) and (63), satisfy the compatibility conditions (70) and (71) as well.
Example 9. Let us consider two (nonderived) polyadic ringswhereand and are the ordinary sum and product of 5 matrices. Using (66) and (67) we obtain , , if we choose the smallest “numbers of multiplications” , , , , and therefore the mixed-arity direct product nonderived -ring becomeswhere the doubles are and the nonderived direct product operations arewhere, in the first line, , is a cumbersome integer function of , , and in the second line are cumbersome integer functions of , , . Therefore, the polyadic ring (75) is the nonderived mixed arity polyadic external product (see Definition 9). Theorem 2. The category of polyadic rings PolRing can exist (having the class of all polyadic rings for objects and ring homomorphisms for morphisms) and can be well-defined, because it has a product as the polyadic external product of rings.
In the same way one can construct the iterated full and mixed-arity products of any number k of polyadic rings, merely by passing from the doubles X to k-tuples .
4.5. Polyadic Hetero Product of -Fields
The most crucial difference between the binary direct products and the polyadic ones arises for fields, because a direct product’s two binary fields are not a field [
2].The reason for this lies in the fact that each binary field
necessarily contains 0 and 1, by definition. As follows from (48), a binary direct product contains nonzero idempotent doubles
and
which are noninvertible, and therefore the external direct product of fields
can never be a field. In the opposite case, polyadic fields (see Definition 10) can be zeroless (we denote them by
), and the above arguments do not hold for them.
Recall the definitions of
-fields (see [
27,
28]). Denote
, if the zero
z exists (3). Observe that (in distinction to binary rings)
is not a polyadic group, in general. If
is the
n-ary group, then
is called a
-
divisionring.
Definition 10. A (totally) commutative -division ring is called a -field .
In n-ary groups there exists an “intermediate” commutativity, known as semicommutativity (10).
Definition 11. A semicommutative -division ring is called a semicommutative -field .
The definition of a polyadic field can be expressed in a diagrammatic form, analogous to (16). We introduce the
double Dörnte relations: for
n-ary multiplication
(15) and for
m-ary addition
, as follows
where the (additive) neutral sequence is
, and
is the additive querelement for
(see (14)). In distinction with (15), we have only one (additive) Dörnte relation (78) and one diagram from (16) only, because of the commutativity of
.
By analogy with the multiplicative queroperation
(13), introduce the
additive unary queroperation by
where
is the additive querelement (13). Thus, we have
Definition 12. (Diagrammatic definition of-field). A (polyadic)-field is a one-set algebraic structure with 4 operations and 3 relationswhereandare commutative associative m-ary addition and n-ary associative multiplication connected by polyadic distributivity (51)–(53),andare unary additive queroperation (79) and multiplicative queroperation (13). There is no initial relation between and ; nevertheless the possibility of their “interaction” can lead to further thorough classification of polyadic fields.
Definition 13. A polyadic field is called quer-symmetric if its unary queroperations commute in the other case is called quer-nonsymmetric.
Example 10. Consider the nonunital zeroless (denoted by ) polyadic field , , . The ternary addition and the ternary multiplication are nonderived, ternary associative and distributive (operations are in ). For each () the additive querelement is , and the multiplicative querelement is (see (12)). Therefore, both and are ternary groups, but they both contain no neutral elements (no unit, no zero). The nonunital zeroless -field is quer-symmetric, because (see (82)) Finding quer-nonsymmetric polyadic fields is not a simple task.
Example 11. Consider the set of real matrices over the fractions , , of the form The set is closed with respect to the ordinary addition of matrices, because the sum of fewer of the fractions does not give a fraction of the same form [14], and with respect to the ordinary multiplication of matrices, since the product of fewer matrices (84) does not have the same shape [29]. The polyadic associativity and polyadic distributivity follow from the binary ones of the ordinary matrices over , and the product of 5 matrices is semicommutative (see 10). Taking the minimal values , , we define the semicommutative zeroless -field (see (11))where and are the ordinary sum and product of 5 matrices, whereas and are additive and multiplicative queroperations The division ring is zeroless, because the fraction , is never zero for , and it is unital with the unit Using (84) and (86), we obtainorand therefore the additive and multiplicative queroperations do not commute independently of the field parameters. Thus, the matrix -division ring (85) is a quer-nonsymmetric division ring. Definition 14. The polyadic zeroless direct product field consists of (two) zeroless polyadic fields and of the same arity shape, whereas the componentwise operations on the doubles in (56) and (57) still remain valid, and , , are n-ary groups.
Following Definition 11, we have
Corollary 2. If at least one of the constituent fields is semicommutative, and another one is totally commutative, then the polyadic product will be a semicommutative -field.
The additive and multiplicative unary queroperations (13) and (79) for the direct product field
are defined componentwise on the doubles
X as follows
Definition 15. A polyadic direct product field is called quer-symmetric if its unary queroperations (91) and (92) commute in the other case, is called a quer-nonsymmetric direct product -field.
Example 12. Consider two nonunital zeroless -fieldswhere ternary additions and ternary multiplications are the sum and product in , correspondingly, and the unary additive and multiplicative queroperations are and (see Example 10). Using (56) and (57) we build the operations of the polyadic nonderived nonunital zeroless product -field on the doubles as followsand the unary additive and multiplicative queroperations (91) and (92) of the direct product are Therefore, both and are commutative ternary groups, which means that the polyadic direct product is the nonunital zeroless polyadic field. Moreover, is quer-symmetric, because (93) and (94) remain valid Example 13. Let us consider the polyadic direct product of two zeroless fields, one of them being the semicommutative -field from (85), and the other one being the nonderived nonunital zeroless -field of fractions , , . The double is , where M is in (84). The polyadic nonunital zeroless direct product field is nonderived and semicommutative, and is defined by , where its addition and multiplication arewhere are cumbersome integer functions of , , and are cumbersome integer functions of , , (see (84)). The unary queroperations (91) and (92) of the direct product arewhere M is in (84). Therefore, is a commutative 5-ary group, and is a semicommutative 5-ary group, which means that the polyadic direct product is the nonunital zeroless polyadic semicommutative -field. Using (90) we obtain and therefore the direct product -field is quer-nonsymmetric (see (81)).
Thus, we arrive at
Theorem 3. The category of zeroless polyadic fields zlessPolField can exist (having the class of all zeroless polyadic fields for objects and field homomorphisms for morphisms) and can be well-defined, because it has a product as the polyadic field product.