4. Construction of Semiheaps and Associative Ternary Algebras
In this section, we address the question of constructing associative ternary algebras. A ternary multiplication can be constructed from binary ones, that is, by successive application of binary multiplications. However, we are interested in those ternary multiplications that cannot be reduced to a combination of binary multiplications. In this section we propose a general structure that can be used to construct various associative of the first or second kind ternary algebras.
Let
be a set, and let
be a mapping that assigns to each ordered pair
of elements in
a transformation
of the set
. Since the set of all transformations of
forms a semigroup under composition, we may regard
as a mapping from the direct product
into the semigroup of transformations of
. Define a ternary multiplication on the set
by
where
,
and the transformation
maps the element
w to the element
. Leaving some freedom of expression, the ternary multiplication process (
15) can be described as follows: From the first two elements, we construct an operator and then apply this operator to the third element. All ternary multiplications that we will use in the sequel possess this structure.
We will determine the conditions that the mapping
must satisfy for the ternary multiplication (
15) to be associative of the first or second kind. Note that identity
must hold in both cases, that is, first-kind and second-kind associativity. The second identity takes the form
in the case of first-kind associativity, and the form
in the case of second-kind associativity. For the mapping
, we introduce the transposed mapping defined by
.
Proposition 2.
The necessary and sufficient conditions for (16), (17), and (18) are the following:
Proof.
It follows from this that (
19) holds. Similarly, () and () are proved. □
Thus, it follows from the proven proposition that the set
with the ternary multiplication (
15), where the mapping
satisfies conditions (
19) and (), is a semiheap.
The most well-known example of a semiheap is the set
of all binary relations between the elements of sets
A and
B. Recall that for two binary relations
and
, their composition is defined by the formula
By its very definition, composition is not a closed binary operation. However, it is possible to construct a closed ternary multiplication of binary relations by combining the composition of relations with their inversion. Recall that
We now show that the ternary multiplication of binary relations admits the structure of the ternary multiplication (
15). Let
be binary relations between elements of the sets
A and
B. Define a mapping
where
denotes the set of all binary relations on the set
A, by the formula
A binary relation on the set
A, via composition of relations, defines a transformation of the set
, that is,
where
. Following formula (
15), we define the ternary multiplication of binary relations between elements of the sets
A and
B by
The mapping
satisfies conditions (
19) and (), which follows directly from the associativity of the composition of binary relations and the properties of relational inversion.
Since we are interested in associative trilinear ternary operations on sets equipped with the structure of a vector space, that is, in associative ternary algebras, we apply the approach of (
15) in the case where
is an additive abelian group,
, where
is a unital associative ring, and
is a representation of the ring
in the group
. Multiplication in the ring
will be denoted by the juxtaposition of elements and the endomorphism of the group
corresponding to an element
a of the ring
will be denoted by
. It is clear that
is a left
-module if the left action of the ring
is defined by the formula
, where
,
. Note that
is called a representation module of the ring
. We assume that
is an
-valued 2-form, additive in each argument. Thus, we have the sequence of mappings
This sequence may serve as a basis for constructing a ternary multiplication (
15) on the
-module
. The structure of this ternary multiplication can be described as follows: Given three elements
of the module
, we first associate with the pair
an element of the ring
; then, using the representation
of the ring
, we map the element of the ring
to the endomorphism
, and apply this endomorphism to the third element
w, obtaining the result of the ternary product. If we denote this ternary product by
then
Obviously, the ternary product (
23) is additive in each argument.
Conditions (
19), (), and () now take the form
It is easy to show that a statement analogous to Proposition 2 holds, namely, that from conditions (
24), there follow first-kind or second-kind ternary associativity of the ternary multiplication (
23). These conditions are sufficient for the associativity of the ternary multiplication (
23) in the case where the left
-module
is exact, that is, its annihilator consists only of the zero element of the ring, and
.
In the case of a right module, a ternary multiplication can be defined by a formula analogous to formula (
23). Let
be a right
-module, where
is a unital associative ring, and let
be an additive
-valued 2-form. The ternary multiplication on
is defined by
In this case, the conditions for ternary associativity take the form
The described construction of ternary multiplication extends naturally to the case where
is a unital associative algebra,
is a left module over the algebra
, and
is a bilinear
-valued form. All vector spaces are assumed to be over the field of complex numbers, and the module structure is assumed to be linear in both arguments. Analogously, the case of a right module over an algebra can be considered. Since
now has the structure of a complex vector space, equipping it with ternary multiplication yields a ternary algebra. This ternary algebra will be denoted
in the case of a left module, and
in the case of a right module. Thus, in the ternary algebra
, the multiplication is given by formula (24), and in the ternary algebra
, by formula (28). The associativity conditions for these ternary multiplications are given in (
24) and (
26).
We now present important examples of ternary algebras constructed in the spirit of the ternary algebra
. These are ternary algebras of rectangular matrices, which have been studied in [
9,
12]. Let
be the vector space of complex
matrices, and let
be the algebra of complex square matrices of order
m. It is clear that
is a left module over the algebra
, where the left action of
on
is given by the standard matrix multiplication of an
matrix on the left with an
matrix. A ternary multiplication on
is defined either by the
-valued bilinear form
, or by the
-valued conjugate-linear form
, where
and
. In the right-hand sides of these formulas, matrix multiplication, matrix transposition, and complex conjugation are understood. Thus, on the vector space of rectangular matrices
, we have two ternary algebras, denoted
and
. In the first algebra, the multiplication is given by the formula
and is trilinear, while in the second algebra the multiplication is given by
and is conjugate-linear in the second factor. Both ternary algebras are associative of the second kind, which is readily verified by checking conditions (
24) corresponding to second-kind associativity.
A second important example of ternary algebras of the form
is constructed using ternary multiplications of cubic matrices. By a cubic matrix, we mean a collection of complex numbers indexed by three natural numbers ranging from 1 to
n. A cubic matrix will be denoted by
, where the indices
run from 1 to
n. We refer to
X as a cubic matrix of order
n because it is often convenient to visualize it as a spatial lattice whose nodes are occupied by the complex numbers
. The theory of cubic matrices, and more generally, the theory of
n-dimensional matrices, is not widely known. Fundamental structures of this theory, such as rank, trace, and determinant, can be found in [
11,
18]. It is clear that the set of cubic matrices of order
n forms a vector space over the field of complex numbers under entrywise addition and scalar multiplication. We denote the vector space of cubic matrices of order
n by
.
For cubic matrices, ternary multiplication is a more natural structure than binary multiplication. Ternary multiplications of cubic matrices, by analogy with the binary multiplication of flat square matrices, can be described as a three-stage composition of linear maps. Let
be the vector space of
n-dimensional complex vectors, and let
be the vector space of complex square matrices of order
n. Then a cubic matrix
of order
n defines a linear map which maps a vector
to a matrix
via the rule
. The next cubic matrix
maps the square matrix
to a vector
. Thus, at this stage, we obtain a linear map which maps a vector to a vector. To complete this chain and obtain a linear map which maps a vector to a square matrix, we require a third cubic matrix, which, analogously to the first step, maps a vector to a square matrix, i.e.,
. This process can be represented as a sequence of transformations
Note that at the center of this sequence, that is, in the linear map which maps a matrix to a vector defined by the cubic matrix
Y, we have an alternative form given by
. Thus, we obtain the following ternary multiplications of cubic matrices
where
stands for complex-conjugate of
. Obviously, the ternary products (
28) are
-linear and the ternary products () are their conjugate-linear counterparts. Now our goal is to show that the ternary products (
28),() are associative of the second kind and define ternary algebras of the type
.
A cubic matrix can be conveniently represented as a collection of square matrices of order n. Indeed, by fixing one of the three indices in the cubic matrix , for example, the last index k, we obtain a square matrix of order n whose entries are indexed by i and j. Denote the resulting square matrix by . The cubic matrix X can then be identified with the ordered set of n square matrices , which we denote by . Thus, can be viewed as the analogue of an n-dimensional vector whose coordinates are square matrices of order n. Analogously . We will refer to a cubic matrix written in the form as a matrix vector. It is worth noting that the vector space of cubic matrices is a right module over the algebra of square matrices . Indeed, given a matrix vector , the right action of a square matrix A on is denoted by and is defined as the matrix vector whose rth coordinate is the square matrix ((with summation over k understood)).
Let
be cubic matrices, written in vector form as
. We now construct a square matrix as follows: at the intersection of the
pth row and the
kth column of this matrix stands the trace of the product of the matrices
and
. The resulting square matrix is denoted by
. Thus, we have a bilinear mapping
, where
. Now the ternary multiplications in () can be written in the form
On the right-hand side of these formulas, the second factor is a matrix. We can compute the trace of this matrix, obtaining a complex number. In this way, we obtain two additional ternary multiplications of cubic matrices, which take the form
In this case, the bilinear form
or
is a
-valued form, and in the right-hand sides of formulas (
31), it is understood that the cubic matrix
X is multiplied by the corresponding scalar. Note that the first form is symmetric and bilinear, while the second is conjugate-linear in the first argument and linear in the second.
Having clarified the structure of the ternary products of cubic matrices, we can readily prove their second-kind associativity. We will do this for the first ternary multiplication given in formula (
30); the proof for the second is analogous. To establish second-kind associativity, we show that the bilinear form
satisfies conditions (
26) for the case of second-kind associativity. Thus, we must verify that for arbitrary cubic matrices
, the following identities hold:
and
The first identity follows immediately from the fact that the trace is a linear function. Indeed, on the left hand side of (
32) in the second argument of the form
, we have the matrix vector
, which undergoes a linear transformation by the square matrix
. By the linearity of the trace, the transformation matrix can be factored out to the right of the form
, preserving the order of matrix multiplication and thereby proving identity (
32). The second identity follows from the linearity of the trace and the elementary identity
. This identity implies that permuting the matrix vectors in
results in transposing the resulting matrix, that is,
This means that, by factoring the linear transformation
out of the form
to the left, thanks to the linearity of the trace, and simultaneously interchanging the matrix vectors
, we obtain the matrix product on the right-hand side of identity (
33). The proof of these properties for the forms
appearing on the right-hand sides of formulas (
31) is even simpler, since in this case we are dealing with the multiplication of a cubic matrix by a complex scalar. Therefore, properties (
32) and (
33) follow directly from the linearity and conjugate-linearity of the forms.