Next Article in Journal
The Extremal Cacti on Multiplicative Degree-Kirchhoff Index
Previous Article in Journal
Exact Solution for the Heat Transfer of Two Immiscible PTT Fluids Flowing in Concentric Layers through a Pipe
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

The Structure of Moduloid on a Nexus

1
Department of Mathematics, University of Surrey, Guildford, Surrey Gu2 7XH, UK
2
Department of Mathematics, Islamic Azad university, Kerman Branch, Kerman 1477893855, Iran
*
Author to whom correspondence should be addressed.
Submission received: 20 November 2018 / Revised: 31 December 2018 / Accepted: 3 January 2019 / Published: 14 January 2019

Abstract

:
In this paper, the notion of moduloid on a nexus is introduced. Moreover, the concept of submoduloid is defined and some different submoduloids are introdused. Also, several interesting facts about submoduloids are proved. Finally, a homomorphism between two moduloids is defined and some related results are investigated.

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.
Q = < [ 7 , 1 , 0 ] , < > , < 5 , 3 , < 2 , F A L S E > , 0 > >
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 ( i , j , k ) 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 ( 3 , 4 ) , 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
A = { ( 1 ) , ( 2 ) , ( 3 ) , ( 3 , 1 ) , ( 3 , 2 ) , ( 3 , 3 ) , ( 3 , 4 ) , ( 3 , 3 , 1 ) , ( 3 , 3 , 2 ) }
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 f ( a ) = c then f ( b ) = c 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,
( a b ) c = a ( b c )
for all a , b , c G .
A monoid G is a semigroup containing an identity element. A semiring is a set R with two operations + and, such that ( R , + ) is a commutative monoid and ( R , ) is a semigroup. The operationis distributive with respect to +, that is,
a ( b + c ) = a b + a c
( b + c ) a = b a + c a
for all a , b , c R . Also, for any a R , a 0 = 0 a = 0 , where 0 is the identity element of the monoid ( R , + ) .
Definition 2.
A moduloid N over the semiring R consists of a commutative groupoid ( M , + ) with the identity element and the scalar multiplication : R × M M , which maps ( r , a ) r a . Also, for all r and s in R, and a in M, the following equations are valid,
(i) 
( r + s ) a = r a + s a
(ii) 
r ( a + b ) = r a + r b
(iii) 
( r s ) a = r ( s a )
(iv) 
0 a = r 0 = 0 .
Definition 3
([9]).
(i) 
Let N be the set of non-negative integers. Then, an address is a sequence whose elements belong to N . Also, a k = 0 implies that a i = 0 , for all i k . The sequence of zero is called the empty address and is denoted by ( ) . In other words, every nonempty address is of the form ( a 1 , a 2 , , a n , 0 , 0 , ) , where a i and n belong to N . Hereafter, this address will be denoted by ( a 1 , a 2 , , a n ) .
(ii) 
A nexus N is a nonempty set of address with the following properties:
( a 1 , a 2 , , a n 1 , a n ) N ( a 1 , a 2 , , a n 1 , t ) N , 0 t a n ,
and for an infinite nexus
{ a i } i = 1 N , a i N n N , 0 t a n , ( a 1 , a 2 , , a n t ) N .
Note 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 A N . Then the smallest subnexus of N containing A is called the subnexus of N generated by A and is denoted by < A > . If A = { a 1 , a 2 , , a n } , then instead of < A > one may write < a 1 , a 2 , , a n > . If A has only one element a, then the subnexus < a > 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 a N . The level of a is said to be:
(i) 
n, if a = ( a 1 , a 2 , , a n ) , for some a n N .
(ii) 
∞, if a is an infinite sequence of N.
(iii) 
0, if a = ( ) .
The level of a is denoted by l ( a ) .
Definition 7
([9]). The highest level of the elements of M is referred to as the rise of M and is denoted by r i s e ( M ) . 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 r i s e ( N ) .
Example 1.
The set N = { ( ) , ( 1 ) , ( 2 ) , ( 1 , 1 ) , ( 1 , 2 ) , ( 2 , 1 ) , ( 2 , 2 ) , ( 2 , 3 ) , ( 2 , 4 ) , ( 1 , 2 , 1 ) } is a nexus and S = { ( ) , ( 1 ) , ( 2 ) , ( 2 , 1 ) , ( 2 , 2 ) , ( 2 , 3 ) } is a subnexus of N. Also, < ( 2 , 3 ) > = S , l ( 2 , 1 ) = 2 and r i s e ( N ) = 3 .
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 ( a ) 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 O r d ( N ) .
Example 2.
Consider the nexus N = { ( ) , ( 1 ) , ( 2 ) , ( 1 , 1 ) , ( 1 , 2 ) } . The addresses ( 1 ) and ( 2 ) are the principal addresses of N.
Definition 10
([9]). Let N be a nexus and let a = ( a 1 , a 2 , , a n ) be an address of N. The first term a 1 is said to be the stem of a and is denoted by s t e m ( a ) .
Example 3.
Consider the nexus M = { ( ) , ( 1 ) , ( 2 ) , ( 3 ) , ( 1 , 1 ) , ( 1 , 2 ) , ( 3 , 1 ) , ( 3 , 2 ) , ( 3 , 2 , 1 ) } . The number of principal addresses of M is three, and hence, O r d ( N ) = 3 . The stem of the address ( ) is zero. Moreover, the stem of the addresses ( 3 ) , ( 3 , 1 ) , ( 3 , 2 ) and ( 3 , 2 , 1 ) is 3.
Definition 11
([9]). Let a = { a i } and b = { b i } , i N , be two addresses. Then, a b if l ( a ) = 0 or if one of the following cases is satisfied:
Case 1.
If l ( a ) = 1 , that is a = ( a 1 ) , for some a 1 N and a 1 b 1 .
Case 2.
If 1 < l ( a ) < , then l ( a ) l ( b ) and a l ( a ) b l ( b ) and for any 1 i < l ( a ) , a i = b i .
Case 3.
If l ( a ) = , then a = b .
Definition 12
([9]). Let N be a nexus and let a = ( a 1 , a 2 , , a k ) be an address of N. The set
{ ( a 1 , a 2 , , a k , a k + 1 , , a n ) N : a k + i N f o r i = 1 , 2 , , n k }
is called the ‘panel’ of a and is denoted by q a . In other words, if a = ( a 1 , a 2 , , a k ) , then every address b of N is an address in q a 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, q ( ) 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 { b N : a b } is called the quasi panel of a and is denoted by Q a .
Example 4.
Consider the nexus
N = { ( ) , ( 1 ) , ( 2 ) , ( 1 , 1 ) , ( 1 , 2 ) , ( 2 , 1 ) , ( 2 , 2 ) , ( 2 , 3 ) , ( 2 , 2 , 1 ) , ( 2 , 2 , 2 ) , ( 2 , 3 , 1 ) , ( 2 , 3 , 2 ) } .
Now, consider the address a = ( 2 , 2 ) , of N. Then q a = { ( 2 , 2 , 1 ) , ( 2 , 2 , 2 ) } and
Q a = { ( 2 , 2 ) , ( 2 , 2 , 1 ) , ( 2 , 2 , 2 ) , ( 2 , 3 ) , ( 2 , 3 , 1 ) , ( 2 , 3 , 2 ) } .

2. A Nexus as a Moduloid

We denoted the max { m , n } and the min { m , n } by m n and m n , respectively, where m , n N . Now, consider N with the two operations ∨ and ∧, as mentioned above. Then ( N , ) is a commutative monoid with number 0, as the identity element and ( N , ) is a semigroup. Furthermore, for all a , b , c N , a ( b c ) = ( a b ) ( a c ) and a ( b c ) = ( a b ) ( a c ) .
Also, x 0 = 0 , for all x N . Therefore, ( N , , , 0 ) is a commutative semiring.
Definition 14.
Let N be a nexus and let a = ( a 1 , a 2 , ) and b = ( b 1 , b 2 , ) be two addresses of N. Now, the operation + is defined on N as follows:
Suppose that there exists a k such that
( a 1 b 1 , a 2 b 2 , , a k b k ) N
and
( a 1 b 1 , a 2 b 2 , , a k + 1 b k + 1 ) N ,
then
a + b : = ( a 1 b 1 , a 2 b 2 , , a k b k ) .
In this case one may write i n d e x N ( a , b ) = k . On the other hand, if there is no such a k, then
a + b : = ( a 1 b 1 , a 2 b 2 , ) ,
and we write i n d e x N ( a , b ) = . Note that always ( a 1 b 1 ) N .
Example 5.
Consider the nexus
N = { ( ) , ( 1 ) , ( 2 ) , ( 1 , 1 ) , ( 1 , 2 ) , ( 2 , 1 ) , ( 2 , 2 ) , ( 2 , 3 ) , ( 1 , 2 , 1 ) , ( 1 , 2 , 2 ) , ( 1 , 2 , 3 ) , ( 1 , 2 , 4 ) , ( 2 , 3 , 1 ) , ( 2 , 3 , 2 ) } .
The dendrogram of N is shown in Figure 2.
Suppose that a = ( 1 , 2 , 4 ) and b = ( 2 , 3 , 1 ) then a + b = ( 1 , 2 , 4 ) + ( 2 , 3 , 1 ) = ( 1 2 , 2 3 , 4 1 ) = ( 2 , 3 , 4 ) . As one can see, ( 2 , 3 , 4 ) N , so, by definition of summation of two addresses of a nexus N, the last component, that is 4, must be eliminated. Since, ( 2 , 3 ) N , then one may consider ( 2 , 3 ) as the summation of the addresses a and b. In this case, i n d e x N ( a , b ) = 2 . As another example, suppose that a = ( 1 ) and b = ( 2 , 3 , 1 ) . Since l ( a ) = 1 and l ( b ) = 3 , one may write a = ( 1 , 0 , 0 ) . Therefore, a + b = ( 1 , 0 , 0 ) + ( 2 , 3 , 1 ) = ( 1 2 , 0 3 , 0 1 ) = ( 2 , 3 , 1 ) = b .
Remark 1.
For any non-empty address a N , we have:
(i) 
a + b = b + a ,
(ii) 
a + 0 = a ,
(iii) 
a + ( 1 ) = a .
Lemma 1.
(i) 
Suppose that N is a nexus, and a and b are two addresses in N. If a b then a + b = b .
(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 a = ( a 1 , a 2 , , a n ) . Since a b , so b can be considered as b = ( a 1 , a 2 , , a n + k , b 1 , b 2 , , b m ) for some k N . Therefore a + b = b .
(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 a b but a + c b + c , for some a , b and c in a nexus.
Example 6.
Suppose that,
N = { ( ) , ( 1 ) , ( 2 ) , ( 3 ) , ( 1 , 1 ) ( 1 , 2 ) , ( 2 , 1 ) , ( 3 , 1 ) } .
Now, consider the addresses
a = ( 1 , 2 ) , b = ( 2 , 1 ) , c = ( 3 , 1 )
then
( a + b ) + c = ( ( 1 , 2 ) + ( 2 , 1 ) ) + ( 3 , 1 ) = ( 2 , 2 ) + ( 3 , 1 ) ,
since ( 2 , 2 ) N , so a + b = ( 2 ) . Therefore,
( a + b ) + c = ( 2 ) + ( 3 , 1 ) = ( 3 , 1 )
but
a + ( b + c ) = ( 1 , 2 ) + ( 3 , 1 ) = ( 3 , 2 ) ,
since ( 3 , 2 ) N ,
a + ( b + c ) = ( 3 ) .
Example 7.
Consider the nexus N whose generators are the addresses ( 1 , 2 , 3 , 9 ) and ( 2 , 3 , 4 , 8 ) , namely:
N = < ( 1 , 2 , 3 , 9 ) , ( 2 , 3 , 4 , 8 ) > .
Suppose that,
a = ( 1 , 2 , 3 , 8 ) b = ( 1 , 2 , 3 , 9 ) c = ( 2 , 3 , 4 , 7 )
As one can see a b but,
a + c = ( 2 , 3 , 4 , 8 ) a n d b + c = ( 2 , 3 , 4 ) .
Therefore,
a + c b + c .
Remark 3.
( N , + , 0 ) is a commutative groupoid with the identity.
Definition 15.
Let N = N { 0 , } , N be a nexus and the scalar multiplication
: N × N N
is defined on N as follows: r w = ( a 1 , a 2 , , a r ) , i f l ( w ) > r , r > 0 ( a 1 , a 2 , , a n ) , i f l ( w ) r , r > 0 0 i f r = 0 w i f r =
for all, r N and w = ( a 1 , a 2 , , a n ) N . In other words, r w = { a i } i = 1 l ( w ) r . From now on, operation ∘ is called dot product.
Theorem 1.
Let N be a nexus. Then ( N , + , 0 ) is a moduloid over ( N , , , 0 ) together with scalar multiplication. For simplicity N is called an N -moduloid.
Proof. 
We show that, the following properties are valid.
(i)
( r s ) a = r ( s a ) ,
(ii)
r ( a + b ) = r a + r b ,
(iii)
( r s ) a = r a + s a ,
(iv)
0 a = r 0 = 0 ,
for all r , s N and a , b N .
(i) Let r , s N and a = { a i } i N . Then
r ( s a ) = { a i } i = 1 l ( a ) r s = ( r s ) { a i } i N = ( r s ) a .
(ii) Let a = { a i } i N and b = { b i } i N be two elements of N. Without loss of generality, suppose that l ( a ) l ( b ) . If i n d e x N ( a , b ) = k < then
r ( a + b ) = ( a 1 b 1 , a 2 b 2 , , a r k b r k ) .
On the other hand
r a = { a i } i = 1 l ( a ) r
and
r b = { a i } i = 1 l ( b ) r .
Now, consider the two following cases:
Case 1: Let r l ( a ) l ( b ) . If r k , then there exists s N such that r + s = k . In this case,
c = ( a 1 b 1 , a 2 b 2 , , a r b r ) ( a 1 b 1 , a 2 b 2 , , a r + s b r + s ) ,
since i n d e x N ( a , b ) = k , so,
( a 1 b 1 , a 2 b 2 , , a r + s b r + s ) N .
However, N is a nexus therefore, c N . So,
r a + r b = ( a 1 , a 2 , , a r ) + ( b 1 , b 2 , , b r ) = ( a 1 b 1 , a 2 b 2 , , a r b r ) = ( a 1 b 1 , a 2 b 2 , , a r k b r k ) .
The last equality is valid, because r k . By (3) and (4)
r ( a + b ) = r a + r b .
Now, if r > k , then
r a + r b = ( a 1 , a 2 , , a k , a k + 1 , , a r ) + ( b 1 , b 2 , , b k , b k + 1 , , b r ) = ( a 1 b 1 , a 2 b 2 , , a k b k ) ,
since i n d e x N ( a , b ) = k , the last equality is valid. Also, since r > k then,
( a 1 b 1 , a 2 b 2 , , a k b k ) = ( a 1 b 1 , a 2 b 2 , , a r k b r k ) .
Therefore, r a + r b = r ( a + b ) .
Case 2: Let l ( a ) < r l ( b ) , then r a = ( a 1 , a 2 , , a n ) and r b = ( b 1 , b 2 , . , b r ) . where l ( a ) = n N . If r k , that is, n < r k and since i n d e x N ( a , b ) = k , then
r a + r b = ( a 1 , a 2 , , a n ) + ( b 1 , b 2 , . , b r ) = ( a 1 b 1 , a 2 b 2 , , a r b r ) = ( a 1 b 1 , a 2 b 2 , , a n b n , b n + 1 , , b r ) .
On the other hand
a + b = ( a 1 , a 2 , , a n ) + ( b 1 , b 2 , . , b l ( b ) ) = ( a 1 b 1 , a 2 b 2 , , a n b n , b n + 1 , , b l ( b ) )
and
r ( a + b ) = ( a 1 b 1 , a 2 b 2 , , a n b n , b n + 1 , , b r ) .
Therefore r a + r b = r ( a + b ) .
Now, if r > k , then r a = ( a 1 , a 2 , , a n ) and since r l ( b ) , then r b = ( b 1 , b 2 , . , b n , , b k , , b r ) or r b = ( b 1 , b 2 , . , b k , , b n , , b r ) . Therefore,
r a + r b = ( a 1 b 1 , a 2 b 2 , , a k b k ) = ( a 1 b 1 , a 2 b 2 , , a r k b r k ) = r ( a + b )
if i n d e x N ( a , b ) = , that is, a + b = { a i b i } i = 1 , then,
r ( a + b ) = { a i b i } i = 1 r .
On the other hand, r a = { a i } i = 1 r , r b = { a i } i = 1 r and hence
r a + r b = { a i b i } i = 1 r = r ( a + b ) .
(iii) Let r , s N , s < r , a = { a i } i = 1 N , then,
( r s ) a = r a = { a i } i = 1 l ( a ) r
on the other hand
r a = { a i } i = 1 l ( a ) r , s a = { a i } i = 1 l ( a ) s ,
since, l ( a ) s l ( a ) r . Therefore r a + s a = { a i } i = 1 l ( a ) r = ( r s ) a .
(iv) The proof is straight forward.  □
Definition 16.
Let ( N , + , 0 ) be an N -moduloid. If r i s e ( N ) = m < , then m a = a for all a N . In this case, ( N , + , 0 ) is called a unitary N -moduloid.

3. N -Submoduloid

Definition 17.
Let N be an N -moduloid, S be a non-empty subset of N and 0 S . Then S is called a submoduloid of N, if ( S , + , 0 ) is a moduloid over ( N , , , 0 ) . The set of all N -submoduloid of N is denoted by S U B M ( N ) .
Theorem 2.
Let S be a nonempty subset of a nexus N. Then,
(i) 
S S U B M ( N ) if and only if
(a) 
r a S , r N , a S
(b) 
a + b S , a , b S .
(ii) 
If N is a unitary moduloid over ( N , , , 0 ) and S S U B M ( N ) , then S is a unitary moduloid over ( N , , , 0 ) .
Proof. 
(i)
If S S U B M ( N ) , then, by the definition of N -submoduloid, ( a ) and ( b ) are valid. Conversely, since S is closed under operation + and dot product ∘, the conditions (i) to (iii) of Theorem 1 hold. By ( a ) assume that r = 0 , so, 0 a = 0 S . Thus ( S , + , 0 ) is a commutative groupoid with identity.
(ii)
Since, r i s e ( S ) r i s e ( N ) = m < , we have m a = a for all a S . This implies that ( S , + , 0 ) is a unitary N -moduloid.
 □
Remark 4.
(i) 
In general, a subnexus of a nexuse is not an N -submoduloid.
(ii) 
In general, an N -submoduloid of a nexus is not a subnexus.
Example 8.
Consider
N = { ( ) , ( 1 ) , ( 2 ) , ( 1 , 1 ) , ( 1 , 2 ) , ( 1 , 3 ) , ( 2 , 1 ) , ( 2 , 2 ) } , S = { ( ) , ( 1 ) , ( 2 ) , ( 1 , 1 ) , ( 1 , 2 ) }
S is a subnexus of N. But if one considers N as an N moduloid, then S is not an N -submoduloid of N, because ( 1 , 2 ) and ( 2 ) belong to S but
( 1 , 2 ) + ( 2 ) = ( 2 , 2 ) S .
Clearly, each subnexus S of N is closed under dot product, that is,
r w S , r N , s S .
Example 9.
Consider the nexus
N = < ( 3 , 2 ) , ( 2 , 2 ) >
and the subset
S = { ( ) , ( 1 ) , ( 2 ) , ( 3 ) , ( 3 , 2 ) }
of N. It is easy to check that S is an N -submoduloid of N (closed under addition and dot product), but it is not a subnexus of N because S does not contain the address ( 3 , 1 ) .
Corollary 1.
Let N be a nexus and a N . Then the cyclic subnexus < a > 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 a b then a + b = b . Now, the rest of proof follows from Theorem 2.  □
Remark 5.
In general, an N -submoduloid of a cyclic nexus N is not a subnexus of N.
Example 10.
Consider the cyclic nexus
< ( 2 , 3 , 2 ) > = { ( ) , ( 1 ) , ( 2 ) , ( 2 , 1 ) , ( 2 , 2 ) , ( 2 , 3 ) , ( 2 , 3 , 1 ) , ( 2 , 3 , 2 ) }
and the subset
{ ( 2 ) , ( 2 , 3 ) , ( 2 , 3 , 2 ) }
is an N -submoduloid of < ( 2 , 3 , 2 ) > but it is not a subnexus.
Theorem 3.
Let N be an N -moduloid and n N . Consider the subset
L ( n ) = { a N : l ( a ) n }
of N. Then L ( n ) is an N -moduloid of N.
Proof. 
Suppose that a , b L ( n ) . So l ( a ) and l ( b ) are less then or equal to n. By definition of + operation, l ( a + b ) m a x { l ( a ) , l ( b ) } n . Therefore a + b L ( n ) . Thus L ( n ) is closed under + operation. Now, suppose that, a L ( n ) and k N . Then l ( k a ) n . This means that L ( n ) is closed under dot product. Therefore, L ( n ) is an N -submoduloid of N.  □
Remark 6.
If N is a nexus and k is a non-negative integer, then by definition of dot product,
k N = { k a : a N } = { a N : l ( a ) k } = L ( k ) .
Therefore, by Theorem 3, one can prove that k N is an N -submoduloid of N for every k N , and it is called k-cut of N.
Example 11.
Suppose that the nexus
N = { ( ) , ( 1 ) , ( 2 ) , ( 3 ) , ( 1 , 1 ) , ( 1 , 2 ) , ( 1 , 3 ) , ( 3 , 1 ) , ( 3 , 2 ) , ( 1 , 2 , 1 ) , ( 1 , 2 , 2 ) , ( 3 , 1 , 1 ) , ( 3 , 1 , 2 ) , ( 3 , 1 , 3 ) , ( 3 , 1 , 3 , 1 ) , ( 3 , 1 , 3 , 2 ) } ,
and k = 2 , then
2 N = { ( ) , ( 1 ) , ( 2 ) , ( 3 ) , ( 1 , 1 ) , ( 1 , 2 ) , ( 1 , 3 ) , ( 3 , 1 ) , ( 3 , 2 ) } .
The dendrograms of N and 2 N are shown in Figure 3. By Theorem 3, 2 N is an N -submoduloid of N.
Theorem 4.
Let N be an N -moduloid, and let M be an N -submoduloid of N. Then for every k N , k M is an N -submoduloid of N.
Proof. 
Suppose that a and b are two addresses in k M . So, there exist m 1 and m 2 in M such that a = k m 1 and b = k m 2 . Now consider the summation of a and b, that is,
a + b = k m 1 + k m 2 = k ( m 1 + m 2 )
by Theorem 1 (ii), the last equation is held. Since M is an N -submoduloid of N, m 1 + m 2 M . Therefore, k ( m 1 + m 2 ) k M . This means that k M is closed under + operation. Now suppose that a k M and k N then a = k m and
r ( k M ) = ( r k ) m = ( k r ) m = k ( r m ) .
By Theorem 1 (i), the first and the last equations are held. Since M is an N -submoduloid of N, r m M . Therefore, k ( r m ) M then k m is closed under dot product. Consequently k M is an N -submoduloid of N.  □
Theorem 5.
Let N be an N -moduloid. Consider the subset
N k = { a N : s t e m ( a ) = k } { ( ) } = { ( a 1 , a 2 , , a n ) N : a 1 = k } { ( ) } .
Then the subset N k is an N -submoduloid of N and it is called k-stem.
Proof. 
Let a , b N k . So that a = ( k , a 2 , , a n ) and b = ( k , b 2 , , b n ) . By the definition of N -moduloid summation, the first term of a + b is k k = k . Therefore a + b N k . Now suppose that a N k and r N then by definition of dot product, r a = K for r 0 and r a = 0 = ( ) N k for r = 0 . Thus r a N k . Therefore N k is an N -moduloid of N.  □
Example 12.
Suppose that,
N = { ( ) , ( 1 ) , ( 2 ) , ( 3 ) , ( 1 , 1 ) , ( 1 , 2 ) , ( 1 , 3 ) , ( 2 , 1 ) , ( 2 , 2 ) , ( 2 , 3 ) , ( 3 , 1 ) , ( 3 , 2 ) , ( 1 , 3 , 1 ) , ( 1 , 3 , 2 ) , ( 2 , 2 , 1 ) , ( 2 , 2 , 2 ) , ( 3 , 2 , 1 ) , ( 3 , 2 , 2 ) , ( 2 , 2 , 1 , 1 ) , ( 2 , 2 , 1 , 2 ) }
and k = 2 . Then,
N 2 = { ( ) , ( 2 ) , ( 2 , 1 ) , ( 2 , 2 ) , ( 2 , 3 ) , ( 2 , 2 , 1 ) , ( 2 , 2 , 2 ) , ( 2 , 2 , 1 , 1 ) , ( 2 , 2 , 1 , 2 ) } .
The dendrogram of N is shown in Figure 4. By Theorem 5, N 2 is an N -moduloid of N.
Theorem 6.
Let N be an N -moduloid and let o r d ( N ) = n . Now, consider the set S = { N k : f o r k = 0 , 1 , , n } , where N k is an N-submoduloid of N. Then any union of the elements of S is an N-submoduloid of N.
Proof. 
Suppose that N k denotes the set of arbitrary union of the elements of S. Now, let a , b N k . So there exist 0 p , q n , such that a N p and b N q . This means that a = ( p , a 2 , , a n ) and b = ( q , b 2 , , b m ) . Without loss of generality, suppose that p q then the first term of a + b is p q = q . Therefore, a + b N k ( N k ) . Thus N k is closed under + operation. Now, suppose that a ( N k ) and n N . Therefore there exists 0 p n , such that a N p . By Theorem 5, N p is an N -submoduloid. Therefore, n a N p ( N k ) . Consequently, N k is closed under dot product. So, by Therorem 2 N k is an N -submoduloid of N.  □

4. N -Moduloid Homomorphism

In this section a nexus considerd as the N -moduloid and a homomorphism between two N -moduloids are investigated. For simplicity we show that r a by r a for all r N , a N .
Definition 18.
Let N and M be two N -moduloids, and let f : N M be a function. Then f is called an N -moduloid homomorphism if
(i) 
f ( a + b ) = f ( a ) + f ( b ) a , b N ,
(ii) 
f ( r a ) = r f ( a ) a N , r N .
The kernel of f is defined by f 1 ( { 0 } ) and denoted by Kerf.
Example 13.
Consider two N -moduloids
N = { 0 , ( 1 ) , ( 2 ) , ( 2 , 1 ) , ( 2 , 2 ) } , M = { 0 , ( 1 ) , ( 2 ) , ( 1 , 1 ) , ( 1 , 2 ) } .
Suppose that, f : N M is defined by f ( 0 ) = 0 , f ( 1 ) = f ( 2 ) = ( 1 ) , f ( 2 , 1 ) = f ( 2 , 2 ) = ( 1 , 1 ) . We see that f is an N -moduloid homomorphism and K e r f = { 0 } , but f is not injective. Moreover, the domain of f is N and the rang of f is { 0 , ( 1 ) , ( 1 , 1 ) } . So, f is not surjective. The dendrograms of N and M are shown in Figure 5. In this figure, the N -moduloid homomorphism between domain and rang of the function f are shown by doted lines.
Theorem 7.
Let f : N M be an N -moduloid homomorphism. Then
(i) 
f ( 0 ) = 0 ,
(ii) 
if B S U B M ( M ) , then f 1 ( B ) S U B M ( N ) , in particular, K e r f S U B M ( N ) ,
(iii) 
if A S U B M ( N ) , then f ( A ) S U B M ( M ) , in particular, I m f S U B M ( M ) .
Proof. 
(i)
f ( 0 ) = f ( 0 a ) = 0 f ( a ) = 0 , a N .
(ii)
Let a , b f 1 ( B ) , r N . Then f ( a ) , f ( b ) B , and f ( a + b ) = f ( a ) + f ( b ) B . Hence, a + b f 1 ( B ) . Moreover, f ( r a ) = r f ( a ) B , which implies that r a f 1 ( B ) .
(iii)
Let c , d f ( A ) and r N . Hence, there exist a , b A such that f ( a ) = c , f ( b ) = d . Now, c + d = f ( a ) + f ( b ) = f ( a + b ) f ( A ) . Also, r c = r f ( a ) = f ( r a ) f ( A ) .
 □
Theorem 8.
Let f : N M be an N -moduloid homomorphism. Then
(i) 
if a , b N , a b , then f ( a ) + f ( b ) = f ( b ) ,
(ii) 
if a N , l ( a ) = n < , then l ( f ( a ) ) n . In particular, every principal element is going to 0 or a principal element by f,
(iii) 
if l ( f ( a ) ) l ( a ) = n and a = ( a 1 , a 2 , , a n ) , then
f ( ( a 1 , a 2 , , a k ) ) = f ( a ) , l ( f ( a ) ) k n ,
(iv) 
if l ( f ( a ) ) = l ( a ) 1 , and a = { a i } i N , f ( a ) = { b i } i N , then
f ( ( a 1 , a 2 , , a k ) ) = ( b 1 , b 2 , , b k ) ) , 1 k l ( a ) .
Proof. 
(i)
By Lemma 1, if a b , then a + b = b . Therefore, f ( a + b ) = f ( a ) + f ( b ) = f ( b ) .
(ii)
If f ( a ) = 0 , we have the result. Let a = ( ( a 1 , a 2 , , a n ) and let b = f ( a ) = { b i } i N 0 . Since f ( n a ) = n f ( a ) , therefore,
n b = n f ( a ) = n f ( ( a 1 , a 2 , , a n ) ) = f ( n ( a 1 , a 2 , , a n ) ) = f ( ( a 1 , a 2 , , a n ) ) = b = n b = ( ( b 1 , b 2 , , b n ) ,
it implies that 0 = b n + 1 = b n + 2 = . Hence, l ( f ( a ) ) l ( b ) .
(iii)
Let f ( a ) = f ( ( a 1 , a 2 , , a n ) ) = b = ( b 1 , b 2 , , b m ) , where, m n .
Then, for all m k n ,
f ( k a ) = f ( k ( a 1 , a 2 , , a n ) ) = f ( ( a 1 , a 2 , , a k ) ) .
On the other hand
k f ( a ) = k ( b 1 , b 2 , , b m ) = ( b 1 , b 2 , , b m ) .
Since f is an N -moduloid homomorphism, then for every k the Equations (5) and (6) are equal. Consequently,
f ( ( a 1 , a 2 , , a n ) ) = ( b 1 , b 2 , , b m ) = f ( a ) , m k < n .
(iv)
Let a = ( a 1 , a 2 , , a n ) be an address in N and let f ( ( a 1 , a 2 , , a n ) ) = ( b 1 , b 2 , , b n ) . Now, consider the equation f ( k a ) = k f ( a ) . The left side of the equation is equal to
f ( k a ) = f ( k ( a 1 , a 2 , , a n ) ) = f ( ( a 1 , a 2 , , a k ) ) 1 k l ( a ) ,
and the right side of the equation is equal to
k f ( a ) = k f ( ( a 1 , a 2 , , a n ) ) = k ( b 1 , b 2 , , b n ) = ( b 1 , b 2 , , b k ) , 1 k l ( a ) .
Therefore, f ( ( a 1 , a 2 , , a k ) ) = ( b 1 , b 2 , , b k ) 1 k l ( a ) .  □
Theorem 9.
Let N and M be two N -moduloids, and let f : N M be an N -moduloid homomorphism. Suppose that a = ( a 1 , a 2 , , a n ) is an address in N and f ( a ) = c = ( c 1 , c 2 , , c m ) , where n > m . Then f ( b ) = c , for all b in q a .
Proof. 
Let b be an address in q a . Then b is of the form
b = ( a 1 , a 2 , , a m , , a n , b 1 , b 2 , , b p ) ,
where t is a non-negative integer. Now, suppose that
f ( ( a 1 , a 2 , , a m , , a n , b 1 , b 2 , , b p ) ) = ( c 1 , c 2 , , c m , d 1 , d 2 , d q ) .
Since f is an N -moduloid homomorphism, so,
f ( ( m + 1 ) b ) = ( m + 1 ) f ( b ) f ( ( a 1 , a 2 , , a m , a m + 1 ) ) = ( c 1 , c 2 , , c m , d 1 ) .
But by hypotheses,
f ( ( a 1 , a 2 , , a n ) ) = ( c 1 , c 2 , , c m ) ,
where n > m by Theorem 8 (iii),
f ( ( a 1 , a 2 , , a n ) ) = ( c 1 , c 2 , , c m ) , m k n .
Thus,
( a 1 , a 2 , , a m , a m + 1 ) = ( c 1 , c 2 , , c m ) .
Since f is a function, then (7) and (8) implies that
( c 1 , c 2 , , c m , d 1 ) = ( c 1 , c 2 , , c m ) ,
so, d 1 = 0 . Now, consider the address ( c 1 , c 2 , , c m , d 1 , d 2 , , d q ) , by definition of an address, since d 1 = 0 , then d i = 0 for all i = 1 , 2 , , q . Consequently, f ( b ) = c for all b in q a .  □
Remark 7.
Note that, in the above theorem if q a replaces by Q a the theorem is not true.
Example 14.
Consider, the nexuses
N = { 0 , ( 1 ) , ( 2 ) , ( 2 , 1 ) , ( 2 , 2 ) } , M = { 0 . ( 1 ) , ( 2 ) , ( 2 , 1 ) } .
Put a = ( 2 , 1 ) , b = ( 2 , 2 ) , c = ( 2 ) and we defined, f : N M , where f ( 0 ) = 0 , f ( 1 ) = f ( 2 ) = ( 1 ) , f ( 2 , 1 ) = ( 2 ) , f ( 2 , 2 ) = ( 2 , 1 ) . It is easy to show that f is 3-homomorphism and b Q a , but f ( b ) c .
Theorem 10.
Let N and M be two N -moduloids, and let f : N M be an N -moduloid homomorphism. Then f is monotone map, that is, a b implies that f ( a ) f ( b ) .
Proof. 
Let a and b be two addresses in N, and let a b . Suppose that, a = ( a 1 , a 2 , , a n ) , then b is of the form
b = ( a 1 , a 2 , , a n + k , b 1 , b 2 , , b p ) ,
where k is a nonnegative integer. Suppose that,
f ( ( a 1 , a 2 , , a n ) ) = c = ( c 1 , c 2 , , c m ) ,
where n m . Now, consider the two following cases:
Case one: n > m , by Theorem 9, f ( b ) = c . Therefore, a b implies that f ( a ) = f ( b ) .
Case two: n = m . That is, f ( ( a 1 , a 2 , , a n ) ) = c = ( c 1 , c 2 , , c n ) and f ( ( a 1 , a 2 , , a n 1 , a n + k , b 1 , b 2 , , b p ) ) = ( c 1 , c 2 , , c n 1 , d 1 , d 2 , , d q ) , where p q . Since f is an N -moduloid homomorphism, f ( r b ) = r f ( b ) . Thus,
f ( ( a 1 , a 2 , , a n 1 , a n + k ) ) = ( c 1 , c 2 , , c n 1 , d 1 ) .
Also, f ( ( a 1 , a 2 , , a n 1 , a n ) ) = ( c 1 , c 2 , , c n 1 , c n ) . Since f is an N -moduloid homomorphism,
f ( ( a 1 , a 2 , , a n 1 , a n + k ) + ( a 1 , a 2 , , a n 1 , a n ) ) = f ( ( a 1 , a 2 , , a n 1 , a n + k ) ) + f ( ( a 1 , a 2 , , a n 1 , a n ) ) .
Therefore,
f ( ( a 1 , a 2 , , a n 1 , a n + k ) ) = ( c 1 , c 2 , , c n 1 , d 1 c n ) .
Also,
f ( ( a 1 , a 2 , , a n 1 , a n + k ) ) = ( c 1 , c 2 , , c n 1 , d 1 ) .
Since f is a function,
( c 1 , c 2 , , c n 1 , d 1 ) = ( c 1 , c 2 , , c n 1 , d 1 c n ) ,
this implies that d 1 c n = d 1 . So, c n d 1 . This means that
( c 1 , c 2 , , c n 1 , c n ) ( c 1 , c 2 , , c n 1 , d 1 ) ( c 1 , c 2 , , c n 1 , d 1 , d 2 , , d q ) .
Thus,
f ( ( a 1 , a 2 , , a n ) ) f ( ( a 1 , a 2 , , a n 1 , a n + k ) ) f ( ( a 1 , a 2 , , a n 1 , a n + k , b 1 , b 2 , , b q ) ) .
Consequently, f ( a ) f ( b ) .  □

5. Conclusions

In this paper, the notions of N -moduloid nexuses, N -submoduloid, N -moduloid homomorphisms, are defined and the relationship between them are investigated. In particular, it was shown that: (i) Every cyclic subnexus < a > of N is an N -submoduloid of N. Moreover, if N is a cyclic nexus, then every subnexus of N is an N -submoduloid; (ii) Every k-cut and k-stem of any N -moduloid is N -submoduloid; (iii) If f is an N -moduloid homomorphim and f ( a ) = c then, f ( b ) = c for every b in panel of a (Theorem 9); (iv) Every N -moduloid homomorphism is monotone (Theorem 10).

Author Contributions

The authors contributed equally to this work.

Funding

This research received no external funding.

Acknowledgments

The authors are grateful to the referees for their comments and suggestions.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Nooshin, H. Algebraic Representation and Processing of Structural Configurations. Int. J. Comput. Struct. 1975, 5, 119–130. [Google Scholar] [CrossRef]
  2. Nooshin, H. Formex Configuration Processing in Structural Engineering; Elsevier Applied Science Publishers: London, UK, 1984. [Google Scholar]
  3. Nooshin, H.; Disney, P. Formex configuration processing I. Int. J. Space Struct. 2000, 15, 1–52. [Google Scholar] [CrossRef]
  4. Nooshin, H.; Disney, P. Formex configuration processing II. Int. J. Space Struct. 2001, 16, 1–56. [Google Scholar] [CrossRef]
  5. Nooshin, H.; Disney, P. Formex configuration processing III. Int. J. Space Struct. 2002, 17, 1–50. [Google Scholar] [CrossRef]
  6. Nooshin, H.; Disney, P.; Yamamoto, C. Formian; Multi-Science Publishing Company: Brentwood, UK, 1993. [Google Scholar]
  7. Haristchain, M. Formex and Plenix Structural Analysis. Ph.D. Thesis, University of Surrey, Guildford, UK, 1980. [Google Scholar]
  8. Hee, I. Plenix Structural Analysis. Ph.D. Thesis, University of Surrey, Guildford, UK, 1985. [Google Scholar]
  9. Bolourian, M. Theory of Plenices. Ph.D.Thesis, University of Surrey, Guildford, UK, 2009. [Google Scholar]
  10. Bolourian, M.; Nooshin, H. Element of theory of plenices. Int. J. Space Struct. 2004, 19, 203–244. [Google Scholar] [CrossRef]
  11. Afkhami Taba, D.; Hasankhani, A.; Bolourian, M. Soft nexuses. Comput. Math. Appl. 2012, 64, 1812–1821. [Google Scholar] [CrossRef] [Green Version]
  12. Afkhami Taba, D.; Ahmadkhah, N.; Hasankhani, A. A fraction of nexuses. Int. J. Algebra 2011, 5, 883–896. [Google Scholar]
  13. Estaji, A.A.; Estaji, A.A. Nexus over an ordinal. J. Uncertain Syst. 2015, 9, 183–197. [Google Scholar]
  14. Estaji, A.A.; Haghdadi, T.; Farokhi, J. Fuzzy nexus over an ordinal. J. Algebraic Syst. 2015, 3, 65–82. [Google Scholar]
  15. Hedayati, H.; Asadi, A. Normal, maximal and product fuzzy subnexuses of nexuses. J. Intell. Fuzzy Syst. 2014, 26, 1341–1348. [Google Scholar]
  16. Saeidi Rashkolia, A.; Hasankhani, A. Fuzzy subnexuses. Ital. J. Pure Appl. Math. 2011, 28, 229–242. [Google Scholar]
  17. Saeidi Rashkolia, A. Prime fuzzy subnexuses. In Proceeding of the 20th Seminar on Algebra, Tarbiat Moallem University, Tehran, Iran, 22–23 April 2009; pp. 190–193. [Google Scholar]
Figure 1. Dendrogram of Q.
Figure 1. Dendrogram of Q.
Mathematics 07 00082 g001
Figure 2. Dendrogram of N.
Figure 2. Dendrogram of N.
Mathematics 07 00082 g002
Figure 3. Dendrograms of N and 2 N .
Figure 3. Dendrograms of N and 2 N .
Mathematics 07 00082 g003
Figure 4. Dendrograms of N. The N -submoduloid N 2 of N is shown by thick lines.
Figure 4. Dendrograms of N. The N -submoduloid N 2 of N is shown by thick lines.
Mathematics 07 00082 g004
Figure 5. The relationships between domain and range of f are shown by dotted lines.
Figure 5. The relationships between domain and range of f are shown by dotted lines.
Mathematics 07 00082 g005
Table 1. Addresses of plenix of Q.
Table 1. Addresses of plenix of Q.
PanelAddress
[7, 1, 0](1)
< > (2)
< 5 , 3 , < 2 , F A L S E > , 0 > (3)
5(3, 1)
3(3, 2)
< 2 , F A L S E > (3, 3)
0(3, 4)
2(3, 3, 1)
F A L S E (3, 3, 2)

Share and Cite

MDPI and ACS Style

Bolourian, M.; Kamrani, R.; Hasankhani, A. The Structure of Moduloid on a Nexus. Mathematics 2019, 7, 82. https://0-doi-org.brum.beds.ac.uk/10.3390/math7010082

AMA Style

Bolourian M, Kamrani R, Hasankhani A. The Structure of Moduloid on a Nexus. Mathematics. 2019; 7(1):82. https://0-doi-org.brum.beds.ac.uk/10.3390/math7010082

Chicago/Turabian Style

Bolourian, Masoud, Reza Kamrani, and Abbas Hasankhani. 2019. "The Structure of Moduloid on a Nexus" Mathematics 7, no. 1: 82. https://0-doi-org.brum.beds.ac.uk/10.3390/math7010082

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop