3.1. Finite and Connected Partially Ordered Sets
In this subsection, we assume that the poset is finite and connected. A poset is defined as connected if, for any in , there exists a sequence such that . According to this condition, a chain in connects p and q, with all pairs in the chain comparable, even if p and q are not directly comparable. Based on the partially ordered set, comparisons can be conducted in either direction (increasing or decreasing), allowing traversal from p to q within the structure of the partially ordered set. This implies that has a connected Hasse diagram. In a Hasse diagram, the process of navigating between comparable elements in a partially ordered set by following the edges of the diagram is called traversal.
In short, a finite and connected partially ordered sets allows movement between elements using order relations, and its Hasse diagram visually represents this connectivity. Understanding these structures is essential for both theoretical insights and practical applications across various domains.
In this subsection, we demonstrate how viewing as a directed graph facilitates the formulation of a condition under which an additive derivation of is inner.
Let
be a directed graph, where
represents the set of vertices and
A the set of edges. The edge
whenever
q covers
p, i.e.,
and
, which is used to define the partially ordered set
. Below, we provide a restatement of key definitions relevant to directed graphs. For further results and definitions from graph theory, see [
10].
Definition 4. Let be a directed graph, where V constitutes a collection of vertices and A comprises ordered pairs known as arcs between vertices in V. For , let represent a sequence of vertices such that , , and for vertices . Let represent this sequence. A sequence is called a walk from v to w in G if for every , either or belongs to A. If , the walk is closed at v. A semipath is a walk where each vertex is distinct. If G has a unique semipath for every pair , then G is classified as a tree. As noted in [11], a path in is a sequence of distinct vertices such that for , with forward arcs. A semipath from v to w is a path (or counter-path) if or . Let
be a directed graph, and let
and
be paths in
G. Each path induces a subgraph of
G; we denote their vertex sets by
and
, and their edge sets by
and
, respectively. The intersection of the paths
and
is defined as the subgraph
of
G, where
This subgraph, denoted
, consists precisely of the vertices and edges common to both paths.
Let
be a directed graph and
T a set. A weight function on
G is a mapping
, and the graph
G equipped with
w is termed a weighted directed graph. Now, let
be a weighted directed graph with a weight function
. We define the set of reverse edges of
A as
. The weight function
w then induces a function
given by
Let
be an additive element of
. We can transform
into a weighted directed graph with weights in
M as follows: for each edge
in
A, the weight of the edge
is
. Observe that if
is a path in
, then
. When there are two distinct semipaths connecting
p to
q in
, the sum of the directed edge weights may differ. For instance, consider the poset
related to the Hasse diagram below:
![Axioms 14 00876 i003 Axioms 14 00876 i003]()
If is an additive element, then . The next theorem shows that this equation gives a complete characterization of inner derivations .
Let
be a walk from
p to
q. For an additive element
, we define the sum of directed edge weights along
as
The following lemma holds:
Lemma 1. Let be a partially ordered set, and let M be an R-bimodule. Suppose that represents a walk connecting p to q in , and let be additive. The function is a map from the set of walks in to , which assigns a value in the bimodule to each walk.
- (a)
If is a path, then . If is a counter-path, then .
- (b)
If and , where , then the composition of the walks satisfies Specifically, if is a closed walk (i.e., ), then - (c)
If is the inverse walk of , then is a walk connecting q to p in , andwhere represents the additive inverse of in the bimodule . If is a semipath, then so is its inverse .
Theorem 1. Let be a partially ordered set, M an R-bimodule, and α in an additive element. Then additive derivation is inner if and only if, for every pair of distinct elements and any semipaths connecting p to q, the following holds: Proof. First, assume that
is inner. According to [
2] (Theorem 7.1.6), since
is a potential, there exists a function
satisfying
, for
in
. Consider
in
,
, and suppose that
is a semipath joining
p to
q. We will demonstrate this by induction on
k. Let
. If
, then
. If
, then
. Let
, and assume result holds for
. Let
be the semipath joining
p to
q, where
joins
to
, and
joins
to
. Then,
Therefore, for every semipath
connecting
p to
q,
. Now, assume that for any distinct
and for any semipaths
and
connecting
p to
q, the equality
holds. Let
be defined as follows: Choose a maximal element
and set
. For each other element
, define
, where
is a semipath from
z to
p. By assumption, the function
g is well-defined, meaning it does not depend on the choice of
. We will use Lemma 1 to show that
for any
. First, observe that for all
, we have
, which immediately yields
. Now, for
, let
be a path from
p to
q. Given the maximality of
z, it follows that
. In the case where
, we obtain
Assume that
, and let
represent a semipath connecting
z to
p. Let
n be the smallest index for which
, with
. Note that
, as this would imply
, which contradicts the assumption that
is a path. Now assume
. Then
by distinctness of the vertices
. If
, consider the semipaths
,
, and
. Then
connects
z to
q, and
connects
z to
p. By Lemma 1,
If
, then
suffices. For
,
since
. If
, then
, which leads to a contradiction since the vertices
are pairwise distinct. Therefore, we must have
. In this case,
and
, so the preceding argument holds without the need for
. Thus, we conclude that
for any
. According to [
2] (Proposition 7.1.6), it follows that
is inner. □
Corollary 1. Let be a tree (as a partially ordered set), and let M be an R-bimodule. Then every additive derivation is inner.
Proof. Given that for every distinct pair p and , there exists exactly one semipath connecting p to q, we can conclude that the proof of the statement is straightforward and follows directly from Theorem 1. □
Corollary 2. Let be a partially ordered set whose Hasse diagram is a tree, and let M be an R-bimodule. Then every derivation is inner.
Proof. This follows from [
2] (Theorem 7.1.4) and Corollary 4. □
Example 1. Consider the partially ordered set from Section 2, a tree. Since every additive derivation of is inner, it follows from the previous corollary that all derivations are inner. Example 2. Consider the partially ordered set from Section 2, with , which is additive. Let the semipaths and connect a to d. Since and , it follows from Theorem 1 that is not an inner additive derivation. Definition 5. Let be a directed graph. A cycle is a closed walk with , , and distinct vertices for .
Remark 1. (a) For a directed graph , if constitutes a cycle based at vertex , then necessarily . This follows from the property that the corresponding Hasse diagram excludes triangular configurations.
(b) A poset possesses a tree structure precisely when its associated graph contains no cycles.
Corollary 3. Let M be an R-bimodule and an additive element. The additive derivation induced by α is an inner derivation if and only if, for every vertex and every cycle based at p, the cycle evaluation map satisfies .
Proof. Consider a cycle
at vertex
p, assuming
is an inner derivation. Decompose this cycle into two segments
, where
and
. In this decomposition, both the inverse path
and the path
connect the vertex
to
x. By Theorem 1, it follows that
. Consequently, according to Lemma 1, we have
Conversely, consider two distinct vertices
p and
q in
, and let
and
be two distinct semipaths from
p to
q. We first analyze the scenario where these semipaths share no vertices other than their endpoints
p and
q. Assume that the closed walk
wherein the vertices
are all distinct. If
does not constitute a cycle based at
p, then by Definition 5 and Remark 1, it follows that
. On the other hand,
has no triangles, thus
and so
Thus,
and, in this case,
. However, if
is a cycle, then by hypothesis,
. Consequently,
, and it then follows from Lemma 1.
It is necessary to examine the case when has vertices other than the extremities of . Assume that denote pairwise distinct vertices of , where , , however it is not requried that .
By abusing notation, we will indicate the sum when we have as a semipath of by . Even if , specifically when , we will denote by , focussing on the opposites in this case.
Claim
. For
, it’s obvious. For
, we assume
and proceed by induction on
n, so we have
according to Lemma 1(b). Now, if
, then
because
.
Now, for
, the inductive hypothesis assumes the equality for
. We have
By induction hypothesis,
and, by applying the result established for the base case
,
Let
, with
,
and
(note that not necessarily
). Then
The second equality is justified by the property that the corresponding subsemipaths of and connecting to intersect only at their endpoints, while the first and final equalities are direct consequences of the aforementioned claim. □
One can apply Corollary 3 to demonstrate that proving an additive derivation is inner is more straightforward than using Theorem 1, particularly in the case of small partially ordered sets. This is exemplified by the partially ordered set , shown below. Specifically, consists of six elements that are not vertices of any cycle.
![Axioms 14 00876 i004 Axioms 14 00876 i004]()
Additionally, Corollary 3 need not be checked for every cycle of the partially ordered set, as will be shown subsequently. Let
be a cycle represent in
. Define
i such that
and assume the semipaths
and
. Consequently,
are likewise cycles in
, but
and
are cycles in
. All four cycles
,
and
, have identical edges with
. According to Lemma 1 (b) and (c), we have
Let
represent the collection of all cycles in the structure
. A binary relation ∼ is defined on
according to the following: for
,
where
represents a certain characteristic of the cycle
. The characteristic of a cycle
, denoted
, is the sum of the weights of all edges in the cycle:
It is evident that ∼ constitutes an equivalence relation. The equivalence class of a cycle
will be denoted by
. Now, suppose
is a cycle based at
p and
is a cycle based at
q, with the property that
. As a consequence of Equation (1), we derive the following relation:
Theorem 2. Let be a locally finite partially ordered set, M be an R-bimodule, and an additive element. Let represent a transversal of ξ for the equivalence relation defined in Lemma 1, where each is a cycle corresponding to for . Then, the additive derivation is inner if and only if Proof. This is an immediately consequence of Theorem 1 and Corollary 3. □
In order to make an additive derivation inner, we now attempt to weaken the requirements stated in Theorems 1 and 2.
Lemma 2. Let M be an R-bimodule and an additive element. Let be a semipath such that every vertices is comparable with . Then
(a) (resp. ) (resp. ), for all .
(b) The function is given by: Proof. (a) This result corresponds precisely to part (a) of [
12] (Lemma 11).
(b) Let
. By induction on
k, we show that
is the minimum of
, which is given by condition (a). For
,
. Let
and assume that the result is true for
. If we write
, where
, then
If
covers
, then
. Thus,
However, if
covers
, then
; consequently,
since
. The case when
is analogous. □
Definition 6. Consider a cycle within the structure . Let and be comparable, with or . In both cases, a path (or counter-path) connects q to v.. Suppose we have a counter-path with and . This counter-path may intersect at a vertex preceding v; that is, there might exist an index j with such that . Define . The resulting sequence forms a counter-path joining q to a vertex on , satisfying the condition that either holds for all with , or holds for all with . Such a counter-path is called a v-tail from q to v. (It is important to note that this v-tail may not necessarily reach v itself.) We adopt the convention that the tail originates at q and terminates at . To illustrate, let . In the accompanying Hasse diagram, the -tail from q to is given by the counter-path .
![Axioms 14 00876 i005 Axioms 14 00876 i005]()
(See ([
12], page 732) for a definition of
v-tail.)
Lemma 3. Let M be an R-bimodule and an additive element. Consider a vertex and a cycle contaning p. If there exists an element that is comparable to every vertex in , then .
Proof. Let p in , and suppose forms a cycle based at p as per the hypothesis. Assume . Since p and q are comparable, let be an p-tail connecting q to p, and suppose for some index i.
Now, consider an index i satisfying , and analyze the two semipaths and that both connect to p. It follows that the concatenated paths and represent two distinct semipaths from q to p. Furthermore, every vertex along these composite semipaths is comparable with the element q.
By applying the result of the previous lemma in conjunction with Lemma 1(b), we obtain the following:
Canceling
from both sides, we obtain
Since
, we have
In the special case where or , we examine the semipaths and . In this case, and are distinct semipaths from q to such that every vertex on them is comparable to q. Likewise, we obtain . If (say ), the previous arguments hold without .
Therefore, in all cases, we conclude that . □
Corollary 4. Let M be an R-bimodule and a partially ordered set such that for every cycle contained in , there exists an element that is comparable to each vertex of . Then the incidence module possesses the property that all of its derivations are inner.
Proof. Let
be additive. Consider any vertex
p in
and an arbitrary cycle
based at
p. By Lemma 3, it follows immediately that
. This condition, by virtue of Corollary 3, implies that the associated additive derivation
is inner. Since
was chosen arbitrarily, and invoking the general characterization provided in [
2] (Theorem 7.1.4), we conclude that all derivations of
are inner. □
Example 3. Suppose that the partially ordered set below. According to Corollary 4, all derivations of are inner.
Example 4. Suppose that the partially ordered set is as shown below. Although no single element exists within that is comparable to every vertex comprising the cycle , the incidence module nevertheless possesses the property that all its derivations are inner. In fact, let α be an additive element of , and assume that the transversal of ξ with respect to the equivalence relation defined in (2), where the representative cycles are given by and .
According to Lemma 3, . It follows that Thus, by Theorem 2, the derivation is inner.
Definition 7. A subset of a partially ordered set is an antichain if no two distinct elements of are comparable. That is, for any in where , we have neither nor . An antichain is an all-comparable subset if every element of is comparable to some element of . In other words, for each , there exists such that or . For finite , all-comparable subsets exist. Examples include ’s maximal and minimal elements. By Proposition 1 shows that if an all-comparable subset consists of a single element (i.e., ), then all additive derivations on are inner.
Theorem 3. Let M be an R-bimodule and α be an additive element of the incidence module . Assume there exists an all-comparable subset such that, for any distinct elements and for any and semipaths joining to , we have . Therefore, is an inner additive derivation.
Proof. Let denote a cycle in . By Corollary 4, it suffices to prove that . The preceding lemma implies that there exists an element of are comparable with the same . Therefore, no is comparable to every elements of . Consequently, there exists successive vertices and elements such that is comparable to and is comparable to and not comparable to .
Now, suppose that , and consider a -tail joining to and a -tail joining to . There are now two situations to take into account: when and when . We will first show that Case 1 leads to a contradiction, and is therefore impossible.
Case 1: When , we assert that either and or and .
Indeed, assume that and , and consider . Thus, and , which implies that . This contradicts the assumption that is not comparable with .
Analogously, it can be shown that neither nor occurs. We will assume, without loss of generality, that and . If , then and . Hence, we have . However, this is impossible because and are distinct elements of the antichain , and are therefore incomparable.
Case 2: When
. We now examine the case where
. Assume the tail
ends at
and
at
. If
, define the paths
,
, and
. Consequently,
and
constitute two semipaths joining
to
. According to the hypothesis,
From Lemma 1, it follows that
Hence,
In the special cases where , the argument omits ; for , it omits . The case is impossible, as .
Finally, by considering semipaths without the tails or , the reasoning holds if or .
We have thus shown that in all cases. By Corollary 3, it follows that the additive derivation is inner, which completes the proof. □
Example 5. The incidence module of the partially ordered set below does not satisfy the condition that all additive derivations are inner. However, by applying our previous result, we can construct an additive derivation that is inner, as demonstrated below.
In this example, is the all comparable subset of that satisfies Theorem 3. Although there are seven semipaths joining to , the direct weights sum for each of these seven semipaths is the same.
3.2. P Locally Finite
In this subsection, we address the situation in which
denotes an arbitrary locally finite poset, meaning that every interval
in
is finite. Consider the decomposition
of
into connected components, with each
being a maximal connected subset. It is easy to show that the map
, defined by
for every
, is an isomorphism of modules. Intuitively,
restricts a function
to each connected component
. Since the connected components
form a partition of
, this map
is well-defined and making it an isomorphism of module.
Lemma 4. Let be the decomposition of into its connected components, and let , where M is an R-bimodule. Then, α is potential (additive) if and only if is a potential (additive) element of for all .
Proof. Suppose
is potential. Then, there exists a function
such that
for all
. For each
, let
be the restriction of
g to
. Since
is connected, for all
, we have
Thus, For each
,
is a potential element of
.
Conversely, suppose that
is a potential element of
for every
j in
J. Thus, for each
, there exists a function
such that
Define
by
if
. This is well-defined since
forms a disjoint partition of
. Therefore, if
in
satisfy
, then both
p and
q belong to the same connected component
of
for some
. Hence,
Thus,
is a potential element of
.
It follows directly that is additive if and only if is additive for every . To see this, note that if in , then p, q, and z must all lie in the same connected component . Hence, the additivity of on each implies the additivity of on . □
Combining the preceding lemma with ([
2], Proposition 7.1.6), we obtain the following result.
Theorem 4. Let be the decomposition of into connected components, and let M be an R-bimodule. The additive derivation of is inner if and only if, for each , is inner.
Corollary 5. Let be the decomposition of into connected components, and M an R-bimodule. If each has an element comparable to all others in , then every derivation of is inner.
Proof. This follows from Theorem 4 and Proposition 1. □
Combining the preceding lemma with [
2] (Proposition 7.1.6) yields the following result.
Example 6. The poset below has only inner derivations on , by Theorem 4, Corollary 2, and Example 4.
Example 7. Let be the decomposition of the locally finite poset into its connected components as shown below.
As a result of Theorem 4 and Corollary 4, it follows that all derivations of are inner.