1. Introduction and Preliminaries
The roots of the concepts of ‘formex’ (plural: formices) and ‘plenix’ (plural: plenices) go back to the nineteen seventies. At that time, an extensive programme of research was led by H. Nooshin in the Space Structures Research Centre of the University of Surrey. The aim of the research was to find convenient ways of generating data for analysis and design of space structures consisting of many thousands of elements. The geometry of such a structural system often involves many types of symmetries that can be used to simplify the generation of information. However, in addition to the geometric information, it is necessary to produce information about the properties of material(s) of the elements, positions and particulars of the supports and the nature and magnitudes of the external loads. Also, the information about the external loads should include the details of dead weights, snow loads, wind effects, earthquake forces, temperature changes and so on.
The starting point was the introduction of the concepts of ‘formex algebra’ [
1,
2]. These concepts are used for the algebraic representation and processing of all types of geometric forms and, in particular, structural configurations [
3,
4,
5]. Subsequently, a software called ‘Formian’ was introduced that provides a convenient medium for the use of formex algebra [
6]. However, The concepts of formex algebra are general and can be used in many different fields.
Several years later, in order to be able to conveniently handle the vast amount of varied data that defines a space structure, a sophisticated form of data base was evolved which was called a ‘plenix’ [
7,
8]. A plenix is capable of containing any type of information either in explicit constant form, or in a ‘generic form’, that is, as a ‘parametric formulation’. The term ‘plenix’ comes from the Latin word ‘plenus’ meaning ‘full’. This choice was a reflection of the intention of a plenix being capable of representing the ‘full spectrum’ of mathematical objects. However, these pioneering works were mainly concerned with plenices as data structures. The generic nature of a plenix as a data base places the concept in a class of its own with capabilities which are far beyond any normal data base.
Fundamantaly, a plenix is a mathematical object consisting of an arrangement of a mathematical object. A plenix is like a tree structure in which every branch is a mathematical object. For instance,
Figure 1 shows a graphic representation of a plenix, consisting of a sequence of elements, each of which consists of a sequence of elements and so on. The graphical representation of plenix
Q in
Figure 1 is referred to as the dendrogram of
Q.
The following construct is another way to represent a plenix
Q.
In this plenix, the first principal panel is a vector and the second principal is an empty plenix, that is, a plenix that without any principal panel. A dendrogram of
Q is shown in
Figure 1.
In the early two thousands, the basic idea of a plenix was further developed as a mathematical object by M. Bolourian [
9,
10]. The aim of the research was to create an algebra based on plenices. That is, to define meaningful relations, operations and functions for plenices and to investigate the properties of the resulting algebra. This work turned the concept of a plenix into a proper mathematical system with the potential for applications in all branches of human knowledge. Cosider the plenix Q, every panel of a plenix may be associated with a sequence of positive integers that indicates the position of a panel in the plenix. This sequence of positive integers is referred to as the address of the panel. For instance, referring to plenix Q,
Figure 1, the panels addresses are given in the following
Table 1.
An address refers to the kth principal panel of the jth principal panel of the ith principal panel of the plenix. For example, the address of 0 is , indicating the 4th principal panel of the 3rd principal panel of the plenix.
The set of addresses for all panels of a plenix is called the ‘address set’ of that plenix. For instance, the set
is the address set of plenix
Q. therefore, the address set represents the constitution of a plenix.
The constitution of a plenix plays an important role in the theory of plenices. As a result, one of the interesting domains for research in plenix theory is the constitution of a plenix, irrespective of the values of its primion panel. The mathematical object that represents the constitution of a plenix is called a nexus. The notion of a nexus is introduced in [
9] and a nexus is defined axiomatically, by using the concept of the address set. Also, an interesting fact about a relationship between plenix and nexus is shown, that is, the concept of plenix is defined via of the concept of nexus.
The idea of ‘nexus algebra’ is another important mathematical structure that has come out of Bolourian’s work [
9].The concept of the nexus, as an abstract algebraic structure, is certainly worthy of attention. In [
9], the properties of nexuses are investigated from the view point of pure mathematics. Many familiar concepts in an abstract algebra such as substructures, cyclic substructures, generators of an algebra, homomorphism of an algebra, direct product and direct sum of an algebra, metric space, prime and maximal substructures, decomposition theorem and so on, are studied deeply in the context of nexus algebra [
9,
11,
12,
13,
14,
15,
16,
17]. This means that nexus algebra has great potential as an algebraic structure.
The main aim of this paper is to create a structure of moduloid on a nexus. This paper is subdivided into four sections.
Section 1 includes an introduction and some basic definitions of the structure of nexus, such as address set, level of the element of the nexus, order of the nexus as well as definitions of subnexuses of the nexus and the cyclic subnexuses. In
Section 2, the main notion of this paper, that is, a moduloid on a nexus, is defined. In
Section 3, the concept of submoduloid is defined and some interesting facts about submoduloid are proven such as every cyclic subnexus of the nexus N is a submoduloid of N. In
Section 4, a homomorphism between two moduloids is defined and some of these results are investigated such as Theorem 9, that is, let f be a moduloid homomorphim and
then
for every
b in panel of
a.
Definition 1. A groupoid is a set that is closed under a binary operation. A semigroup G is a groupoid with a binary operation ∘
, which satisfies the associative property,for all . A monoid G is a semigroup containing an identity element. A semiring is a set R with two operations +
and ∘
, such that is a commutative monoid and is a semigroup. The operation ∘
is distributive with respect to +
, that is,for all . Also, for any , where 0 is the identity element of the monoid . Definition 2. A moduloid N over the semiring R consists of a commutative groupoid with the identity element and the scalar multiplication , which maps . Also, for all r and s in R, and a in M, the following equations are valid,
- (i)
- (ii)
- (iii)
- (iv)
.
Definition 3 - (i)
Let be the set of non-negative integers. Then, an address is a sequence whose elements belong to . Also, implies that , for all . The sequence of zero is called the empty address and is denoted by . In other words, every nonempty address is of the form , where and n belong to . Hereafter, this address will be denoted by .
- (ii)
A nexus N is a nonempty set of address with the following properties:and for an infinite nexusNote that condition (2) does imply condition (1).
Definition 4 ([
9])
. Let N be a nexus. A subset S of N is called a subnexus of N provided that S itself is a nexus. Definition 5 ([
9])
. Let N be a nexus and . Then the smallest subnexus of N containing A is called the subnexus of N generated by A and is denoted by . If , then instead of one may write . If A has only one element a, then the subnexus is called a cyclic subnexus of N. Clearly, and N are trivial subnexuses of the nexus N. Definition 6 ([
9])
. Let N be a nexus and . The level of a is said to be:- (i)
n, if , for some .
- (ii)
∞, if a is an infinite sequence of N.
- (iii)
0, if .
The level of a is denoted by .
Definition 7 ([
9])
. The highest level of the elements of M is referred to as the rise of M and is denoted by . In particular, the highest level of the elements of a nexus N is referred to as the rise of a nexus N and denoted by . Example 1. The set is a nexus and is a subnexus of N. Also, , and .
Definition 8 ([
9])
. Every address of a nexus N containing only one term is called a ‘principal address’ of N. In other words, a principal address is of the form where a is a positive integer. Definition 9 ([
9])
. The number of principal addresses of a nexus N is called the order of the nexus and is denoted by . Example 2. Consider the nexus . The addresses and are the principal addresses of N.
Definition 10 ([
9])
. Let N be a nexus and let be an address of N. The first term is said to be the stem of a and is denoted by . Example 3. Consider the nexus . The number of principal addresses of M is three, and hence, . The stem of the address is zero. Moreover, the stem of the addresses and is 3.
Definition 11 ([
9])
. Let and , , be two addresses. Then, if or if one of the following cases is satisfied:- Case 1.
If , that is , for some and .
- Case 2.
If , then and and for any .
- Case 3.
If , then .
Definition 12 ([
9])
. Let N be a nexus and let be an address of N. The setis called the ‘panel’ of a and is denoted by . In other words, if , then every address b of N is an address in provided that the first k terms of b are the same as the corresponding terms of a. Note that, the ‘panel’ of a does not include a. Also, includes all the addresses of N except for the empty address itself. Definition 13 ([
9])
. Let N be a nexus and let a be an address of N. The set is called the quasi panel of a and is denoted by . Example 4. Now, consider the address , of N. Then and 2. A Nexus as a Moduloid
We denoted the and the by and , respectively, where . Now, consider with the two operations ∨ and ∧, as mentioned above. Then is a commutative monoid with number 0, as the identity element and is a semigroup. Furthermore, for all , and .
Also, , for all . Therefore, is a commutative semiring.
Definition 14. Let N be a nexus and let and be two addresses of N. Now, the operation + is defined on N as follows:
Suppose that there exists a k such thatandthen In this case one may write . On the other hand, if there is no such a k, thenand we write . Note that always . Example 5. The dendrogram of N is shown in Figure 2. Suppose that and then . As one can see, , so, by definition of summation of two addresses of a nexus N, the last component, that is 4, must be eliminated. Since, , then one may consider as the summation of the addresses a and b. In this case, . As another example, suppose that and . Since and , one may write . Therefore, .
Remark 1. For any non-empty address , we have:
- (i)
- (ii)
- (iii)
Lemma 1. - (i)
Suppose that N is a nexus, and a and b are two addresses in N. If then .
- (ii)
In a cyclic nexus N, since every two addresses are comparable, then the sumation of two addresses is equal to the greater summand.
Proof. - (i)
Suppose that . Since , so b can be considered as for some . Therefore .
- (ii)
Since every cyclic nexus is a chain, then all the addresses are comparable. Now, by using part one, the proof is complete.
□
Remark 2. - (i)
Generally, + is not associative.
- (ii)
It is possible that but , for some and c in a nexus.
Example 6. Now, consider the addressesthensince , so . Therefore,butsince , Example 7. Consider the nexus N whose generators are the addresses and , namely: As one can see but, Remark 3. is a commutative groupoid with the identity.
Definition 15. Let , N be a nexus and the scalar multiplicationis defined on N as follows: for all, and . In other words, . From now on, operation ∘ is called dot product.
Theorem 1. Let N be a nexus. Then is a moduloid over together with scalar multiplication ∘. For simplicity N is called an -moduloid.
Proof. We show that, the following properties are valid.
- (i)
,
- (ii)
,
- (iii)
,
- (iv)
,
for all and .
(i) Let
and
. Then
(ii) Let
and
be two elements of N. Without loss of generality, suppose that
. If
then
Now, consider the two following cases:
Case 1: Let
. If
, then there exists
such that
. In this case,
since
, so,
However, N is a nexus therefore,
. So,
The last equality is valid, because
. By (
3) and (
4)
Now, if
, then
since
, the last equality is valid. Also, since
then,
Therefore, .
Case 2: Let
, then
and
. where
. If
, that is,
and since
, then
Therefore .
Now, if
, then
and since
, then
or
. Therefore,
if
, that is,
, then,
On the other hand,
and hence
(iii) Let
,
, then,
on the other hand
since,
. Therefore
(iv) The proof is straight forward. □
Definition 16. Let be an -moduloid. If , then for all . In this case, is called a unitary -moduloid.
3. -Submoduloid
Definition 17. Let N be an -moduloid, S be a non-empty subset of N and . Then S is called a submoduloid of N, if is a moduloid over . The set of all -submoduloid of N is denoted by .
Theorem 2. Let S be a nonempty subset of a nexus N. Then,
- (i)
if and only if
- (a)
- (b)
.
- (ii)
If N is a unitary moduloid over and , then S is a unitary moduloid over .
Proof. - (i)
If , then, by the definition of -submoduloid, and are valid. Conversely, since S is closed under operation + and dot product ∘, the conditions (i) to (iii) of Theorem 1 hold. By assume that , so, . Thus is a commutative groupoid with identity.
- (ii)
Since, , we have for all . This implies that is a unitary -moduloid.
□
Remark 4. - (i)
In general, a subnexus of a nexuse is not an -submoduloid.
- (ii)
In general, an -submoduloid of a nexus is not a subnexus.
Example 8. ConsiderS is a subnexus of N. But if one considers N as an moduloid, then S is not an -submoduloid of N, because and belong to S but Clearly, each subnexus S of N is closed under dot product, that is, Example 9. Consider the nexusand the subsetof N. It is easy to check that S is an -submoduloid of N (closed under addition and dot product), but it is not a subnexus of N because S does not contain the address . Corollary 1. Let N be a nexus and . Then the cyclic subnexus is an submoduloid of N. In particular, if N is a cyclic nexus then every subnexus of N is a submoduloid.
Proof. Each subnexus of a nexus is closed under dot product. Also, by Lemma 1, if then . Now, the rest of proof follows from Theorem 2. □
Remark 5. In general, an -submoduloid of a cyclic nexus N is not a subnexus of N.
Example 10. Consider the cyclic nexusand the subsetis an -submoduloid of but it is not a subnexus. Theorem 3. Let N be an -moduloid and . Consider the subsetof N. Then is an -moduloid of N. Proof. Suppose that . So and are less then or equal to n. By definition of + operation, . Therefore . Thus is closed under + operation. Now, suppose that, and . Then . This means that is closed under dot product. Therefore, is an -submoduloid of N. □
Remark 6. If N is a nexus and k is a non-negative integer, then by definition of dot product, Therefore, by Theorem 3, one can prove that is an -submoduloid of N for every , and it is called k-cut of N.
Example 11. Suppose that the nexusand , then The dendrograms of N and are shown in Figure 3. By Theorem 3, is an -submoduloid of N. Theorem 4. Let N be an -moduloid, and let M be an -submoduloid of N. Then for every , is an -submoduloid of N.
Proof. Suppose that
a and
b are two addresses in
. So, there exist
and
in
M such that
and
. Now consider the summation of
a and
b, that is,
by Theorem 1 (ii), the last equation is held. Since
M is an
-submoduloid of
N,
. Therefore,
. This means that
is closed under + operation. Now suppose that
and
then
and
By Theorem 1 (i), the first and the last equations are held. Since M is an -submoduloid of N, . Therefore, then is closed under dot product. Consequently is an -submoduloid of N. □
Theorem 5. Let N be an -moduloid. Consider the subset Then the subset is an -submoduloid of N and it is called k-stem.
Proof. Let . So that and . By the definition of -moduloid summation, the first term of is . Therefore . Now suppose that and then by definition of dot product, for and for . Thus . Therefore is an -moduloid of N. □
Example 12. Suppose that,
and . Then, The dendrogram of N is shown in Figure 4. By Theorem 5, is an -moduloid of N. Theorem 6. Let N be an -moduloid and let . Now, consider the set , where is an N-submoduloid of N. Then any union of the elements of S is an N-submoduloid of N.
Proof. Suppose that denotes the set of arbitrary union of the elements of S. Now, let . So there exist , such that and . This means that and . Without loss of generality, suppose that then the first term of is . Therefore, . Thus is closed under + operation. Now, suppose that and . Therefore there exists , such that . By Theorem 5, is an -submoduloid. Therefore, . Consequently, is closed under dot product. So, by Therorem 2 is an -submoduloid of N. □
4. -Moduloid Homomorphism
In this section a nexus considerd as the -moduloid and a homomorphism between two -moduloids are investigated. For simplicity we show that by for all .
Definition 18. Let N and M be two -moduloids, and let be a function. Then f is called an -moduloid homomorphism if
- (i)
- (ii)
The kernel of f is defined by and denoted by Kerf.
Example 13. Consider two -moduloids Suppose that, is defined by . We see that f is an -moduloid homomorphism and , but f is not injective. Moreover, the domain of f is N and the rang of f is . So, f is not surjective. The dendrograms of N and M are shown in Figure 5. In this figure, the -moduloid homomorphism between domain and rang of the function f are shown by doted lines. Theorem 7. Let be an -moduloid homomorphism. Then
- (i)
,
- (ii)
if , then , in particular, ,
- (iii)
if , then , in particular, .
Proof. - (i)
, .
- (ii)
Let . Then , and . Hence, . Moreover, , which implies that .
- (iii)
Let and . Hence, there exist such that . Now, . Also, .
□
Theorem 8. Let be an -moduloid homomorphism. Then
- (i)
if , then ,
- (ii)
if , then . In particular, every principal element is going to 0 or a principal element by f,
- (iii)
if and , then - (iv)
if , and , then
Proof. - (i)
By Lemma 1, if , then . Therefore, .
- (ii)
If
, we have the result. Let
and let
. Since
, therefore,
it implies that
. Hence,
.
- (iii)
Let , where, .
Then, for all
,
Since
f is an
-moduloid homomorphism, then for every
k the Equations (
5) and (
6) are equal. Consequently,
- (iv)
Let
be an address in
N and let
. Now, consider the equation
. The left side of the equation is equal to
and the right side of the equation is equal to
Therefore, . □
Theorem 9. Let N and M be two -moduloids, and let be an -moduloid homomorphism. Suppose that is an address in N and , where . Then , for all b in .
Proof. Let
b be an address in
. Then
b is of the form
where
t is a non-negative integer. Now, suppose that
Since
f is an
-moduloid homomorphism, so,
But by hypotheses,
where
by Theorem 8 (iii),
Since
f is a function, then (
7) and (
8) implies that
so,
. Now, consider the address
, by definition of an address, since
, then
for all
. Consequently,
for all
b in
. □
Remark 7. Note that, in the above theorem if replaces by the theorem is not true.
Example 14. Consider, the nexusesPut and we defined, , where . It is easy to show that f is 3-homomorphism and , but . Theorem 10. Let N and M be two -moduloids, and let be an -moduloid homomorphism. Then f is monotone map, that is, implies that .
Proof. Let
a and
b be two addresses in
N, and let
. Suppose that,
, then
b is of the form
where
k is a nonnegative integer. Suppose that,
where
. Now, consider the two following cases:
Case one: , by Theorem 9, . Therefore, implies that .
Case two:
. That is,
and
where
. Since
f is an
-moduloid homomorphism,
. Thus,
Also,
. Since
f is an
-moduloid homomorphism,
Since
f is a function,
this implies that
. So,
. This means that
Consequently, . □