1. Introduction
Menger [
1] in 1944 initiated the studies on the theory of the tri-operational algebras, based on his interest to algebra of functions, that led him to investigate the behavior of the functions under various operations: addition, multiplication, or composition. He observed that these operations on functions have an important role in the algebra of functions. The composition of functions is associative, non-commutative and does not depend on addition and multiplication, but it is connected to them by the one-sided distributive laws:
and
. This was a strong motivation for Menger to define a new algebraic structure, namely a
tri-operational algebra [
2,
3]. Moreover, a tri-operational algebra is a special type of commutative ring, such as the ring of polynomials, the ring of infinitely differentiable functions on
, and so on. This idea was clearly presented by Adler [
4] in 1961, when he defined the
composition rings as commutative rings endowed with an additional operation, called
composition, that is related to the two operations of the rings. Twenty years later, Kaiser and Nöbauer [
5,
6] studied more in depth the composition of polynomials and polynomial functions, especially
k-dimensional
V-composition algebras, where
V is a variety containing subgroups, or near rings, composition rings, and composition lattices, investigated also in [
7]. While in classical algebra these ideas were only sporadically deepened in the 20th century—we may refer here to the papers of Veldsman [
8], or Gallina and Morini [
9]—they opened a new line of research in hypercompositional algebra. This is the theory of algebraic hypercompositional structures (called also hyperstructures), i.e., algebraic structures with one or more hyperoperations, which synthesize elements of the support set of the structure and have the result of a subset of the support set instead of one element only, as the classical operations have. The study in this direction was opened by Cristea and Jancic-Rasovic [
10] by defining the composition hyperrings, which better describe the structure of the hyperrings of polynomials [
11]. This work was then continued in two directions: the study of the
-hyperrings endowed with a composition operation [
12] and the study of the hyperrings endowed with a composition, i.e., an n-ary hyperoperation [
13]. Combining these two directions, one may study the composition
-hyperrings [
14], that are
-hyperrings endowed with a
k-ary composition hyperoperation. The same initial idea of [
10] was applied also for
-hyperstructures [
15], which are hyperstructures constructed from quasi-ordered semigroups.
Inspired by all of these researches, in this manuscript we define composition vector spaces as a proper generalization of the vector spaces, by introducing a new operation, called composition, connected with the operations of the vector spaces. Additionally, we define and study some properties of the left or right foundations, composition subspaces, and residual elements in composition vector spaces. We prove that every subspace of a composition vector space is not generally a composition subspace, while the set of all residual elements of a composition vector space V modulo a subspace W is the largest strong composition subspace of V such that W can be written as the intersection between and the left foundation of V. We also show that the intersection of any maximal composition subspace of V with the left foundation is a maximal subspace in . Moreover, in every composition vector space V, there is no nontrivial left foundation such that V is a group under the composition operation. In the last part of the paper we study properties of the composition vector spaces related to linear operators. We define a family of linear operators associated with a composition vector space. If any operator of this family is a bijection, then the composition vector space is called automorphic. We prove that any vector space may have a composition structure obtained by using bijective linear operators, which lead us to conclude that the image of an automorphic composition vector space under an onto composition linear transformation is automorphic, too. The paper ends with a conclusive section.
2. Foundations of Composition Vector Spaces
In this section we will first introduce the concept of composition vector space and support it using several non-trivial examples.
Definition 1. Let F be a field and a vector space over F, so · is an operation defined as . An algebraic structure is said to be a left composition vector space over F, if is a semigroup and the following conditions hold, for all and :
- (1)
;
- (2)
.
If and hold, then is called a right composition vector space over F.
Moreover, we say that V is left (right) unitary, if there exists such that (), for all . In this case I is called a left (right) identity. As usual, V is called unitary if it is left and right unitary.
We denote the unit in V by I in order to not confuse it with the unit 1 of the field F and the zero vector 0.
In the following, we will illustrate this concept using several examples, including the most well-known vector spaces.
Example 1. Consider a vector space over a field F.
V is a left and right composition vector space, whenever the operation ∗ is defined by , for all . In this case, V is called a null composition vector space. It is clear that it has no identity.
For all , define . Then V is a left (respectively, right) composition vector space over F. Note that V is not left (respectively right) unitary, unless , while every vector of V is a right (left) identity.
Consider to be the vector space of all linear operators on V and define ∗ as the composition of linear operators. Then is a unitary composition vector space.
Example 2. Define the operation ∗ on the space of all functions from a set S to a field F as . Then V is a unitary composition vector space over F, where the function defined by , for any , is the identity.
Example 3. is a unitary composition vector space for any field F, where the composition is defined as , having the unit .
Example 4. The vector space of all matrices over a field F is a unitary composition vector space with the composition being the ordinary multiplication of matrices.
The vector space of all matrices over a field F is a unitary composition vector space, where the composition is defined by .
Example 5. Let P be the space of polynomial functions over a field F.
Define the composition of polynomials as , where and . Then P is a unitary composition vector space over F, where 1 and x are their identities, respectively.
Example 6. The set of all real continuous functions over is a unitary composition vector space with the sum, composition and scalar product of functions.
It is clear that any property of left composition vector spaces holds also for right composition vector spaces. Thus, we will consider only the left ones, unless otherwise specified, and "composition vector space" means "left composition vector space".
Proposition 1. If is a composition vector space, then the space of all operators on V is a composition vector space, too, where is defined by , for all . Moreover, if I is a left (right) identity of V, then , defined by , is a left (right) identity of .
Proof. The conditions in Definition 1 are all fulfilled for the space . □
Definition 2. Let V be a composition vector space. Then an element is called a left (right) constant, if (respectively ), for all . If , then the set of all left (right) constants in W is called the left (right) foundation of W and is denoted by (respectively ). The element x is said to be a constant if it is both left and right constant, while is the set of all constants of W.
Example 7. The zero vector is the only constant in any null composition vector space.
In Example 1(2), if V is a left composition vector space, then and . Similarly, if V is a right composition vector space, then and . It is clear that there is no any constant in both of them.
Continuing with Example 1(3), any constant operator of V is a constant of , given in Example 1(3), as well as constant functions are constants of the composition vector space in Example 2.
Example 8. If x is a constant of a composition vector space V, then the function , defined by for all , is a constant of the composition vector space .
In what follows, it is assumed that V is a composition vector space over F, unless otherwise stated. A subspace W of V is called a composition subspace if it is closed under composition. In this case, we write .
Example 9. Every subspace of a null composition vector space is a composition subspace.
However, generally, not every subspace of a composition vector space is a composition subspace, as we can see below.
Example 10. The set of all functions from to is a composition vector space under the sum, scalar product (i.e., ) and composition of functions. Consider Then W is a subspace of , but it is not a composition subspace, because , while , which is not always 0, for all and .
The next proposition summarizes some elementary properties of a composition vector space. They follow immediately from the definition.
Proposition 2. Let V be a composition vector space. Then:
- (1)
.
- (2)
implies that for all .
- (3)
if and only if .
- (4)
.
- (5)
If , then .
- (6)
For fixed , if for all , then .
The next result provides a characterization of the constants of a composition vector space.
Proposition 3. Let V be a unitary composition vector space with the identity I. Then if and only if there exists , , such that and , for all , .
Proof. Let . Then , for all . Hence and so , for all . Hence , that is . Similarly, we have and therefore .
Conversely, for and we have . Hence , which implies that . Similarly, and thus . □
Definition 3. Let V be a composition vector space and W be a subspace of . We say that is a residual element modulo W if . The set of all residual elements modulo W is denoted by , i.e., .
For instance, consider under the composition defined in Example 1 (2) and the subspace . Then and .
Proposition 4. Let V be a composition vector space and W a subspace of , i.e., . Then the following assertions hold:
- (1)
.
- (2)
If , then .
- (3)
, for all and .
- (4)
.
- (5)
is the largest subspace of V satisfying Conditions and .
Proof. It is easy to see that is closed under the operations of V.
For all we have , since , for all . Hence . Then .
If , then , by Proposition 2 (1) and (3). Now if , then for all , that is, .
Let U be a subspace of V such that and for all and . Then for any and , , which implies that . □
If W is a composition subspace of , then there exists a composition subspace U of V with the left foundation W, where , if . In this way, we can construct a new composition subspace.
Corollary 1. Let V be a composition vector space and . Then Proof. If , then because . Additionally, since and . Thus and so . On the other hand, if , then , by Proposition 4(4). Thus for all . Hence . □
Notice that
for any composition subspace
W of
, i.e.,
W is the smallest composition subspace
U of
V containing
W such that
(see
Figure 1).
Corollary 2. If V is a composition vector space, then is a composition subspace of V such that if and only if .
Proof. By Proposition 2(1), , so is a composition subspace of V. Thus by Proposition 4(1), is a composition subspace of V. Now if , then for all , by Proposition 2(1),(3) and , we have . Moreover for all and , by Proposition 2(2). Hence . □
Proposition 5. Let V be a unitary composition vector space and W be a maximal composition subspace of V. Then is a maximal subspace of .
Proof. Let for some subspace X of . Then there exists such that . Hence , where . Thus, for any there exist , for some , and such that . It follows that . Then and so , i.e., U is a maximal subspace of . □
Definition 4. A composition subspace is called a strong composition subspace of V, denoted , if for all and .
Note that is a strong composition subspace of V by Proposition 4(3). In addition, , since for all and .
Lemma 1. Let V be a unitary composition vector space with the identity I.
- (i)
If and , then .
- (ii)
If any nonzero element has an inverse with respect to ∗, then V has no nontrivial strong composition subspace.
Proof. (i) If , then and clearly .
(ii) Let such that . Then there exists at least one element . Hence there exists such that , which implies that by (i). □
Corollary 3. Let be a unitary composition vector space such that any nonzero has an inverse respect to * and . Then .
Proof. It follows from Lemma 1(ii), since . □
In other words, in every composition vector space V, with the property that V is a group under the composition operation, there is no nontrivial left foundation.
Moreover, it is worth noticing that we cannot generally define a quotient structure on composition vector spaces in a natural way. For doing this, consider W as a strong composition subspace of a left and right composition vector space V. Then the quotient of V by W, i.e., , is constructed together with the natural operations and .
3. Linear Operators on Composition Vector Spaces
The aim of this section is to endow vector spaces V with a nontrivial composition structure by using linear operators. Additionally, some properties of the left foundation and nullifier of V are investigated under linear operators. Moreover, automorphic composition vector spaces are defined and studied.
Consider the composition vector space , i.e., the set of all linear operators on V, defined in Example 1(3). The bijective elements of form a composition subspace of , denoted by . Let be a subgroup of and consider the sets for all , that are called orbits. Clearly, the family is a partition for V and one can study the properties of the composition vector space with equivalence relations under this partition. For more details, in the following we give a characterization for it.
Any orbit is called principal if for all and . Note that is not principal, while if , then every orbit is principal.
Proposition 6. Let Γ be a subgroup of and . Then the orbit is principal if and only if, for all , the mapping defined by is a bijection.
Proof. Let be principal. If and such that , then and so , i.e., , by principality of . Thus f is injective. Clearly f is also surjective.
Conversely, if , and , then . By injectivity of f, we have , which is a contradiction. Hence is principal. □
The following results highlight the correspondence between composition vector spaces and linear operators defined on them.
Proposition 7. Let V be a composition vector space over the field F and the mappings be defined by , for all . Then is a linear operator on V and .
Proof. Consider and . Then , which shows the linearity of T. Moreover, for all , it follows that . □
Proposition 8. Let V be a vector space and be a family of linear operators on V such that , for all . Then V is a composition vector space by defining the composition by , for all .
Proof. Let . Then . Thus is a semigroup. Additionally, and , for all . Hence V is a composition vector space. □
Based on these last two results, we may conclude that the structure of any composition vector space V with identity I is characterized by the monoid of linear operators, where is its identity. The mentioned monoid is called the family of the linear operators associated with V.
Definition 5. A mapping T between two composition vector spaces V and W is said to be a composition linear transformation if , and , for all and .
In the following we will investigate some properties of the left foundation of a composition vector space, by the help of linear operators.
Proposition 9. Let be an onto composition linear transformation. Then .
Proof. Suppose . Then and so . Thus , by Proposition 2(2). Now, if , then , for some and . Thus, . Hence, for all , , where for . Therefore, , and this completes the proof. □
Proposition 10. The mapping defined by , where , is a linear transformation such that .
Proof. For arbitrary
,
and
, we have
and
. □
Definition 6. An element is called a nullifier of V if . The set of nullifiers of V is denoted by .
Proposition 11. Let V be a composition vector space. Then:
- (1)
.
- (2)
If and such that , for all , then .
- (3)
If and , for all , then .
Proof. It is straightforward.
By assumption, , so . Thus .
Since and , then by . Hence and for all , which means that . □
Proposition 12. The mapping defined by , is a linear transformation such that .
Proof. Similar to the proof of Proposition 10. □
Definition 7. A composition vector space V is said to be automorphic if every nonzero linear operator associated with V is a bijection.
Note that if V is an automorphic composition vector space and for the principal orbits , then is nonzero.
Theorem 1. Let be an onto composition linear transformation such that . If V is automorphic, then W is automorphic, too.
Proof. Let be a nonzero linear operator associated with W, meaning that , for some . Note that is a nonzero linear operator associated with V, because if , then for all . Hence , that is, . Hence , which is a contradiction.
Now, consider and for an arbitrary . Then there exists such that . Thus , which means that is onto.
Moreover, if for and with , then . Hence and so , since has an inverse and . It follows that , and thus is injective, thefore W is automorphic. □
The following corollary is an immediate consequence of Theorem 1.
Corollary 4. Let be an onto composition linear transformation such that . If , then , for all .
Finally, the behavior of linear operators associated with composition vector spaces is investigated under composition linear transformations.
Theorem 2. Let be an onto composition linear transformation, and be the set of all bijective linear transformations and associated with V and W, respectively. Then the function defined by is an onto group homomorphism such that .
Proof. Consider for some and . Then , for some . Thus and hence , which implies that , that is . Additionally , by Proposition 7. Thus, is a homomorphism. Clearly, it is onto. Moreover, if and only if , equivalently with for all iff for all , i.e., for all . This completes the proof. □