Adjacency-Like Conditions and Induced Ideal Graphs
Abstract.
In this paper we examine some natural ideal conditions and show how graphs can be defined that give a visualization of these conditions. We examine the interplay between the multiplicative ideal theory and the graph theoretic structure of the associated graph. Behavior of these graphs under standard ring extensions are studied, and in conjunction with the theory, some classical results and connections are made.
Key words and phrases:
Noetherian, SFT2010 Mathematics Subject Classification:
Primary: 13C05, 13A15, 13C131. Introduction and Background
Recently there has been much attention paid to various aspects of commutative algebra that lend themselves to a graph-theoretic approach. The origins of some of the aspects of this recent interest in the interplay between graphs and commutative algebra can perhaps be traced (chronologically) to the papers [6] and [2]. The Anderson-Livingston paper defined the notion of a zero divisor graph that is more commonly used today, and it has motivated an industry of work on the interplay between commutative algebra and graph theory. We recall that a zero divisor graph of a commutative ring, , has vertex set defined to be the set of nonzero zero divisors, and it is declared that there is an edge between if and only if . In [2] the following remarkable theorem is proved:
Theorem 1.1.
Let be a commutative ring with identity and its zero divisor graph. Then is connected and has diameter less than or equal to 3.
The authors consider this theorem far from obvious at first blush and find it amazing that any commutative ring with identity must have such a well-behaved structure for its zero divisor graph.
These works have inspired myraid questions and lines of study from numerous authors. For example, the concept of an irreducible divisor graph was introduced by the second author and J. Maney in [9]. Among other things, it is shown that many factorization properties, like unique factorization or the half-factorial property, can be seen in the properties of the irreducible divisor graph(s). Additionally, variants of the zero divisor graph have been studied by numerous authors, for example [9] and [8], and [1]. Of these three, [8] has particular relevance to the theme of this paper, as in this work, subtle variants of atomicity in integral domains are revealed by the connectedness of an associated graph. Other studies have focused on various properties of zero-divisor graphs and their variants (for example, the interested reader can consult [4], [5], [17] among others).
Aside from zero divisor graphs, there has been much other work done in the intersection of commutative algebra and graph theory since the 1990’s. In the influential paper [20], Cohen-Macaulay graphs were studied and (among other things) a strong connection was made between the unmixedness of an ideal of a polynomial ring associated to a complex and the Cohen-Macaulay property of the ring modulo this ideal. In [18] Rees algebras are studied with the aid of (and in parallel to) combinatorial properties of graphs naturally associated to the rings in question, and in [21] edge ideals were developed and explored. A couple of more recent works (among many) that deal with edge ideals are [13] and [14]. In short, combinatorial methods in commutative algebra, and in particular the interplay between graph theory and commutative algebra, has borne much fruit in its relatively short history and continues to be a very fertile area of research.
In this work, we adopt a slightly different approach; the motivation is to gain insight into the ideal structure of a commutative ring by assigning a graph to the set of ideals (sometimes with natural restrictions or slight variants). Three types of graphs are developed: the first types measure adjacency or “closeness” of the ideals in , the second types mimic the structure of the ideal class group and the zero divisor graphs of Anderson/Livingston, and the third types measure finite containment of ideals.
In the third section, the adjacency graphs are given and strong connections are given with respect to the connectedness of the graphs. In particular, a complete classification is given for connectedness for all graphs and strong bounds are given for the diameters.
In the fourth section, graphs are defined that emulate the behavior of the class group of , where is an integral domain. The connected/complete case is resolved and in the case that is a Dedekind domain, the connected components of the graph are studied.
In the fifth section, a graph generalizing the classical zero-divisor graph is introduced and (among other things), we capture Theorem 1.1 as a corollary.
In the sixth and final section, we explore the notion of “finite containment” graphs. As it turns out, these graphs are almost always connected (the exception being the case where is quasilocal with maximal ideal that is not finitely generated). Here the study of the diameter turns out to be a fruitful line of attack and the behavior of diameter with regard to standard extensions (polynomial and power series) as well as homomorphic images are explored. Throughout all sections, a number of examples designed to illuminate are presented.
As a final note, we introduce some notation to be used. If and are vertices of a graph, we will use the notation to indicate an edge between and . The notation will signify that either or that there is an edge between and . This notation will prove convenient in the sequel.
2. Ideal Theoretic Graphs
In this section we define and justify some types of graphs that are determined by ideal theoretic properties. We wish for our graphs to be simple (no loops or multiple edges), and so in the sequel when we say that there is an edge between the vertices and , we default to the condition that and are distinct.
In general we consider, , a collection of ideals of a commutative ring, , as our collection of vertices (in many cases will consist of all ideals or all nonzero ideals of ). To determine an edge set we let be a statement and we say that there is an edge between distinct and if and only if is true.
We now present three definitions that explore variants of the types of ideal graphs that we investigate. The first set of definitions measure “closeness” of the ideals of in a certain sense; they are designed to measure/highlight the density of the ideal structure of .
Definition 2.1 (Adjacency Graphs).
Let be a commutative ring with identity. We define the following graphs associated to . In all cases, the vertex set is the set of proper ideals of , and if the ideals and have an edge between them, then .
-
(0)
In , we say that and have an edge between them if and only if and are adjacent ideals.
-
(1)
In , we say that and have an edge between them if and only if there is a maximal ideal such that .
-
(2)
In , we say that and have an edge between them if and only if is a maximal ideal.
The next definitions are designed to reflect the notions of ideal multiplication and class structure. The graphs and are designed to graphically represent variants of the ideal class group. is an ideal-theoretic analogue of the zero-divisor graph of Anderson-Livingston. with the ideal removed has been considered in [7] where the terminology “annihilating-ideal graph” is used. We will respect this terminology, but will use the notation provided for ease and uniformity of exposition.
Definition 2.2 (Ideal Multiplication/Class Structure Graphs).
Let be a commutative ring with identity. We define the following graphs associated to . For these definitions, the vertex set is the set of nonzero ideals of and in the case of we also demand that the ideals are proper. As above, if the ideals and have an edge between them, then .
-
(1)
Let be an integral domain. For , we say that and have an edge between them if and only if there is a nonzero such that .
-
(2)
Let be an integral domain with quotient field . In , we say that and have an edge between them if and only if there is a nonzero such that .
-
(3)
In we say that and have an edge between them if and only if .
The last set of definitions is concerned with ideals that are finitely generated (resp. principally generated) over some initial ideal. The motivation here is to investigate possible paths between ideals in a commutative ring where the steps can be done “one generator (or a finite number of generators) at a time.” Paths between two vertices (ideals) and of these graphs rely heavily on the interplay between the maximal ideals containing and the maximal ideals containing . As a consequence, we will see that these graphs give insight to the structure of .
Definition 2.3 (Finite Containment Graphs).
Let be a commutative ring with identity. We define the following graphs associated to ; in all cases, the vertex set is the set of proper ideals of .
-
(1)
In we say that and have an edge between them if and only if and is a finitely generated ideal of .
-
(2)
In we say that and have an edge between them if and only if and is a principal ideal of .
Remark 2.4.
For all of the graphs defined above (with the exceptions of , , and ) containment is used or implied in the definition. Hence one could attempt to glean more information by directing the graph, but we will take no notice of this possibility in the present work.
Remark 2.5.
We note that if, in the definition of , is assumed to be irreducible, then this has been investigated by J. Boynton and the second author [8].
3. Adjacency: The Graphs
In this section, we look at the graphs that mirror adjacency; as we will see the concepts of adjacency, maximal conductor, and maximal multiple are intimately related. The metrics here, in a certain sense, strive to measure how “tightly packed” the ideals of are. Additionally, there is a certain measure of discreteness being measured when considering adjacency conditions.
We begin by developing preliminary lemmata that will be essential later. We first note the relationship between the defining concepts of and .
Proposition 3.1.
Let and be ideals of with and a maximal ideal. The following are equivalent.
-
(1)
.
-
(2)
.
Proof.
Assuming condition (1), if then and hence .
On the other hand, if then for all and hence . Since we now have that and that is maximal and , then . ∎
Lemma 3.2.
Let be ideals with . If where is a maximal ideal then , but not necessarily conversely. Hence is a subgraph of .
Proof.
Note that , and hence . Since , we must have equality.
To see that the converse does not hold in general, consider the domain , where is any field, and the ideals and . Note that but . ∎
Lemma 3.3.
If are adjacent, then is maximal, but not necessarily conversely. Hence is a subgraph of .
Proof.
Let be adjacent and let ; we will show that is maximal. Since is strictly contained in , we can find an ; additionally, we note that because of the adjacency of and .
We now choose an arbitrary and note that (indeed, if then the fact that would show that which is a contradition). Hence, it must be the case that , and since , we obtain
for some and . Rearranging the above, we now have
Since conducts to and , . Therefore for all and so is maximal.
To see that the converse does not hold, we revisit the example of the previous result. Letting , . Note that but and are not adjacent as . ∎
Lemma 3.4.
Suppose that are adjacent and . If then is a multiplicatively closed set.
Proof.
Let . Certainly . By way of contradiction, we assume that . Since and are adjacent and , .
Now let be arbitrary. By the previous remark, we can find and such that . Multiplying this by we obtain that . Hence which is the desired contradiction. ∎
Lemma 3.5.
Let be adjacent and an ideal. Then the ideals and are either equal or adjacent.
Proof.
We will assume that and are distinct and suppose that . Since , it must be the case that .
Let be arbitrary. Since , we have that
for some and . We observe further that , and hence, . We conclude that
for any , and so and must be adjacent. ∎
Lemma 3.6.
If are adjacent ideals and , then the ideals and are either equal or adjacent.
Proof.
Suppose that is an ideal with and let . We write with . Since and are adjacent and , . As contains , contains all of ; we conclude that and the proof is complete. ∎
Proposition 3.7.
Let be adjacent ideals and be a multiplicatively closed set (not containing ). Then the ideals are either adjacent or equal.
Proof.
Since are adjacent, there is an such that (in fact, any will do). Suppose that and let . We can assume that and since are adjacent, we can find an and such that . In we have the equation
which shows that is generated over by any element of the form with . Hence and are either equal or adjacent. ∎
The next result is a consequence of the Lattice Isomorphism Theorem and the one after is straightforward; we omit the proofs.
Proposition 3.8.
Let be ideals containing the ideal . Then and are adjacent in if and only if and are adjacent in .
Lemma 3.9.
Let be a ring and be ideals. If is finitely generated and is finitely generated, then is finitely generated.
Proposition 3.10.
Let be a dimensional domain. is Noetherian if and only if is Artinian for each ideal .
Proof.
Suppose first that is Noetherian. If is a nonzero ideal, then is Noetherian of dimension and hence is Artinian.
Now suppose that is Artinian for each nonzero ideal . It suffices to show that every ideal of is finitely generated. Let be an arbitrary nonzero ideal. Let and note that by hypothesis, is Artinian and so is finitely generated. From Lemma 3.9 it follows that is finitely generated and hence is Noetherian. ∎
We now apply these preliminary results to the ideal graphs in question. We begin with the following result that records the stability of for with respect to localization and homomorphic images.
Theorem 3.11.
Let be an ideal and be a multiplicatively closed set. If is connected or complete for , then so are and .
Proof.
For we suppose that are distinct and have an edge between them. Then , with maximal. Note that if then and if not then is maximal. As , we have that and are either equal or have an edge between them. Since all ideals of are of this form, if is either connected or complete, then so if . Additionally, if then and from this the result follows for .
In a similar fashion, if we consider with the ideals/notation in the previous paragraph, we assume that . In this case, it is easy to verify that and . Hence, again, the result follows for . ∎
We remark that the previous result will be an immediate consequence of later structure theorems concerning (see Theorem 3.13 and Theorem 3.16).
The following result is of some independent interest and will be crucial in later work where we show the connection between and the Artinian condition. The result shows that if are ideals and if there is a finite chain of adjacent ideals connecting and , this chain can be refined to a finite increasing chain.
Proposition 3.12.
Let be ideals and ideals with , , and and adjacent for each . Then there exists an increasing chain of ideals
with each successive pair of ideals adjacent and .
Proof.
Using the notation above, we say that the ideal is a hinge ideal if either properly contains both and or is properly contained in them both. We proceed by induction on , the number of hinge ideals between and .
At the outset, we simplify matters by assuming that all of the ideals are contained in by intersecting the collection with and applying Lemma 3.5; we also note that if this chain is increasing, then the conclusion holds. We now describe a reduction process that will greatly simplify the inductive argument.
We first suppose that the first hinge ideal is contained in ; that is, we have the decreasing chain of ideals
Because of the adjacency of successive elements of the chain, we can find such that
We now make a preliminary refinement of the collection by letting for . Applying Lemma 3.6 times to the entire collection of ideals shows that the new collection begins as
and the ideals are successively adjacent (or equal). Additionally if is an ideal in the collection that is not initially a hinge ideal, then can neither be properly contained in, nor properly contain, both the ideals and . So when we identify ideals that are equal, our refined collection has less than or equal to the initial number of ideals and at least one less hinge ideal.
With this in hand, we proceed to argue inductively on the number, , of hinge ideals appearing between and . If then the chain is increasing and the conclusion is immediate, and this, coupled with the above argument, gives the case . We now suppose that the conclusion holds for and consider the case of hinge ideals.
In the first case, we assume that the first hinge ideal is contained in . The previous argument shows that we can refine so that , and as above, the number of ideals in the new collection (after equal ideals are identified) is nonincreasing and the number of hinge ideals in the new collection is less than or equal to . By induction, we are done in this case.
In the second case, we suppose that the first hinge ideal contains . In this case, we consider the collection . Since this collection has hinge ideals with the first being contained in , we apply the first case and extract the increasing chain with with . Combining this increasing chain with (and subtracting for the repetition of ), we obtain our increasing chain with length . ∎
We now characterize some types of rings via their induced adjacency graphs; we begin with .
Theorem 3.13.
Let be a commutative ring with identity and its adjacency graph. The following are equivalent.
-
(1)
is Artinian.
-
(2)
is connected.
Proof.
If is Artinian, then every finitely generated module (in particular, an ideal of ) has a composition series. Since every ideal of is connected to , we have that is connected.
On the other hand, if is connected, then there is a (finite) path between and any ideal of . Proposition 3.12 allows this to be refined to a composition series, and hence is Artinian. ∎
We now produce the following corollary with a slight variant. We define the graph to be the subgraph of with the ideal vertex removed.
Corollary 3.14.
Let be an integral domain that is not a field. is connected if and only if is Noetherian and .
Proof.
Suppose that is dimensional and Noetherian and let be nonzero ideals. To show that is connected, it suffices to show that and can be connected in a finite sequence of steps. To this end, we note that since is nonzero, the ring is dimensional and Noetherian, and hence Artinian. By Theorem 3.13 there is a finite sequence of adjacent ideals (of the displayed form)
connecting to the zero ideal in . By Proposition 3.8 this corresponds to a chain of adjacent ideals
in and hence is connected.
Now we suppose that is connected. Let be an arbitrary nonzero ideal. Proposition 3.8 assures us that adjacency is preserved modulo and so we obtain that is connected. Hence Theorem 3.13 gives us that is Artinian (for any nonzero ideal ). From Proposition 3.10 we obtain that is Noetherian.
To see that is dimensional, we suppose that there is a chain of primes . If we choose the ideal , we would have that and hence is not Artinan. We conclude that is not connected and again Proposition 3.8 gives us that cannot be connected and so . Because of the fact that is a domain that is not a field, then the dimension of is precisely . ∎
Proposition 3.15.
If or is connected, then so is .
We now present a strong characterization of connectedness for the graphs , . Of course this condition is weaker than the Artinian condition.
Theorem 3.16.
Let be a commutative ring with identity. The following conditions are equivalent.
-
(1)
is connected.
-
(2)
is connected.
-
(3)
There is a collection of not necessarily distinct maximal ideals such that .
Proof.
By Proposition 3.15, we have the implication . For the implication , we suppose that is connected and that is a maximal ideal of . By assumption, there is a finite path from to the ideal :
where each denotes either or . In the proof of this implication, we will use the notion of hinge ideals introduced in the proof of Proposition 3.12. Note that there must be an even number of hinge ideals in the path described above, which we will denote . So an abbreviated version of the path described above can be expressed in the form
where we will have the convention that for all . We also declare that and .
Since this is a path in the graph , then successive ideals must have maximal conductor. We will say that if for .
We first note that
and since , we have that
In a similar fashion, we note that
Inductively we obtain
In particular we obtain
and hence there is a collection of maximal ideals with product equal to .
For the implication , we will assume that there is a collection of maximal ideals such that . To show that is connected, it suffices to show that if is an arbitrary ideal, then there is a finite path to the zero ideal. But note that
is such a path of length no more than . ∎
Corollary 3.17.
If is connected then where is the smallest positive integer for which there is a collection of maximal ideals for which .
Proof.
Corollary 3.18.
If is connected for some then is semiquasilocal and dimensional.
Proof.
By Theorem 3.13, is connected if and only if is Artinian, and hence is dimensional, and, in this case, semilocal. If or is connected then Theorem 3.16 gives that for (not necessarily distinct) ideals . If is an arbitrary maximal ideal, then and hence for some which shows that the list of ideals contains . Hence is semiquasilocal.
To see that is dimensional, we appeal once again to the fact that
Recalling that this collection of maximal ideals contains , we suppose that we can find a prime ideal such that . Since , we must have that for some . Hence which is our desired contradiction. ∎
As a companion to Proposition 3.15, we present the following corollary.
Corollary 3.19.
If is connected, then both and are connected.
As a final observation, we consider the following.
Corollary 3.20.
Let be a commutative ring with identity. We consider the following conditions:
-
(1)
is connected.
-
(2)
is connected.
-
(3)
is connected.
If is Noetherian, the above three conditions are equivalent.
Proof.
We know that (2) and (3) are equivalent under any conditions and that condition (1) implies (2) and (3). Suppose that is Noetherian and any one of the conditions hold. By Corollary 3.18, is dimensional. So if we add “Noetherian” as a hypothesis, then is Artinian and all three conditions hold. ∎
We conclude this section with an example of a ring for which is not connected, but is connected for .
Example 3.21.
Consider the ring
This ring is not Noetherian (and hence not Artinian) so is not connected. On the other hand, and are connected. To see this, note that the unique maximal ideal of (generated by the image of the elements ) has the property that . Hence every nonzero ideal of is connected by an edge to in both and .
4. Class Structure: and
For the graphs and we assume that is an integral domain with quotient field unless specified otherwise.
It should be noted that in the case that is an integral domain, is a variant on the so-called divisor graph of an integral domain studied in [8], where the ideals and are assumed to be principal and possess an edge between them if where is irreducible.
For this section, it will also be useful to keep in mind that is a subgraph of .
Theorem 4.1.
The following conditions are equivalent.
-
(1)
is connected.
-
(2)
is complete.
-
(3)
is a PID
Proof.
For this proof, we discard the case where is a field as all of the conditions are satisfied vacuously. Since any complete graph is connected, is immediate. For the implication , we let be an arbitrary ideal and the unit ideal. Since is connected, there is a sequence of ideals connecting and :
Since the edges above are in the graph , we must have, for all , nonzero such that . Note that and hence, is principal.
Finally for the implication , we let and be two arbitrary ideals of (with ). Note that and hence is complete. ∎
Theorem 4.2.
is complete if and only if is a Noetherian valuation domain.
Proof.
In this proof, we will ignore the simple case where is a field. For the forward implication, we will assume that is complete. As is a subgraph of , must also be complete. By Theorem 4.1, must be a PID. It now suffices to show that is local. To this end, suppose that are maximal ideals. Without loss of generality, there is a nonzero such that . If is a unit then and if is a nonunit then ; either gives a contradiction. Hence is a local PID and hence a Noetherian valuation domain.
On the other hand, if is a Noetherian valuation domain then any two nonzero proper ideals are of the form and where is a generator of the maximal ideal and . If we say (without loss of generality) that then and hence is complete. ∎
Theorem 4.3.
is connected if and only if is a PID. In this case, , and if and only if is local.
Proof.
As is a subgraph of , the fact that is connected implies that is connected. Hence, by Theorem 4.1, must be a PID.
On the other hand, if is a PID and and () are arbitrary ideals, then we can connect and as follows:
The above demonstrates the veracity of the remark that . The fact that precisely when is local follows from Theorem 4.2. ∎
Theorem 4.4.
If is a Dedekind domain with quotient field , then the connected components of the graphs and are in one to one correspondence with the elements of the class group . Each connected component of is complete and each connected component of has diameter no more than 2 and the connected components of are complete if and only if is a local PID.
Proof.
If is a Dedekind domain with quotient field , then two ideals, and , are in the same class of if and only if for some nonzero . Hence each connected component of is complete and these components are in one to one correspondence with the elements of .
For the case, we first note that if there is a path from to then there must be some nonzero such that , so it remains to show that if and are in the same ideal class, then there is a path connecting them. To this end, we note that if for some nonzero , we can write and in a similar fashion as before, we can connect and via
and hence there is a path of length no more than 2 connecting and .
For the final statement, we first suppose that is a local PID (and hence a Noetherian valuation domain) with uniformizer . If and are in the same class of then for some nonzero . Since is the quotient field of a Noetherian valuation domain, we can write with up to a unit in . If then or there is an edge between them. If then and again there is an edge between and .
On the other hand, suppose that some connected component of is complete and that there are two maximal ideals . Select and . If is in a complete connected component of , then there is a path from to and hence there must be an edge between them. Hence we have or and in either case, we obtain a contradiction. We conclude that is local and hence a PID (Noetherian valuation domain). ∎
In the spirit of these results, we further restrict the set of vertices to make a more general observation. We define to be the subgraph of with the vertex set restricted to the set of invertible ideals. Recall that if is a domain with quotient field , then is seminormal if for all , implies that (see [19] for a good reference on this topic). The next result shows that if is a seminormal domain then the number of connected components in is stable for polynomial extensions.
Theorem 4.5.
If is a seminormal domain, then the number of connected components of is equal to the number of connected components of
for all .
Proof.
This result follows from the observations that in the integral domain case is isomorphic to and ([11]) and the fact that a polynomial extension of a seminormal domain is seminormal ([19]). With these results in hand, the fact that we are restricting the vertex set to the set of invertible ideals makes the rest of the proof almost identical to the proof of Theorem 4.4. ∎
5. and the classical zero-divisor graph
In this section, our attention will be devoted to the graph and some of its variants. The reason for excluding the zero ideal is precisely the same as the reason that this exception was made in [2]: namely because the use of the zero ideal gives extra structure to this graph with no useful new information. It is easy to see that for any commutative ring with identity (even an integral domain) that the graph is connected with diameter no more than if we allow use of the zero ideal. Indeed, if and are arbitrary ideals, then is a path connecting them. So if is an (infinite) integral domain, the graph would be an infinite star graph with the zero ideal at the center. These extra connections muddy the waters and give no useful insights for our current purposes.
The first variant that we will consider is the graph . For this graph, the set of vertices is the collection of nonzero ideals such that there is a nonzero ideal such that . As before, we say that and have an edge between them if . Of course, if is a domain, this produces the empty graph, so in this situation, must have nontrivial zero divisors for this graph to be of any interest.
We begin with a well-known lemma concerning annihilators that we record here for completeness with proof omitted.
Lemma 5.1.
Let be ideals in .
-
(1)
.
-
(2)
.
-
(3)
.
The next theorem reminiscent of Theorem 1.1 from [2] couched in an ideal-theoretic setting. This theorem can also be found in [7] and may be considered a consequence of [10, Theorem 11]. This will be used to leverage some further insights and to provide an alternate proof of the first statement in [2, Theorem 2.3].
Theorem 5.2.
Let be a commutative ring with 1, then is connected and has diameter no more than 3.
Proof.
Let and be distinct nonzero ideals of such that there are ideals with . As before, we use the notation “” to mean that or that there is an edge between and .
We first note that if then we have the path
and similarly, if we have the path
So the only case to consider is the case where . Note that this implies that and . Since we have the path
∎
We now recover the famous result of D. F. Anderson and P. Livingston.
Corollary 5.3 (D. F. Anderson and P. Livingston,[2]).
If is the zero divisor graph of a commutative ring with identity, then is connected with diameter no more than 3.
Proof.
In the proof of Theorem 5.2, we now restrict to the case where and are principal (and note that principal subideals can be chosen from within each respective annihilator). This shows that the graph of principal ideals that are generated by zero-divisors satisfy the conclusion of the corollary. To see that the slightly different statement formulated by Anderson and Livingston holds, just note that if are distinct nonzero zero-divisors such that , then there is a path among nonzero principal ideals of the form
or
This yields the path or . In the case , we note that there is an element such that giving the path unless (without loss of generality). But in this case, and we are done. ∎
We now return to . Note that if contains a regular element then the ideal is an isolated vertex (and so, in general, one does not expect this graph to be connected). We highlight a case where connection is forced.
Theorem 5.4.
Let be a commutative ring with identity that is not a field. If or is connected, then so is . Additionally .
Proof.
By Theorem 3.16 there is a collection of not necessarily distinct maximal ideals such that . We can also assume that no proper subproduct of these listed ideals is zero.
If then there is a maximal ideal containing . Since , must be for some . We will assume without loss of generality that and . To see that is connected with diameter no more than three consider the path for the case where :
In the case that , we modify our path as follows:
∎
We conclude this section with an example to show that may be connected without , being connected.
Example 5.5.
Let be a field and consider first the domain , let be the ideal , and let (we abuse the notation by now thinking of the elements as elements of ). is quasilocal, with maximal ideal . It is easy to see that is connected. Indeed if then we have the path . But there is no collection of maximal ideals with product since for all .
6. Finite Containment:
In this section we investigate graphs of rings where the edges are defined to highlight finite (or perhaps principal) generation of an ideal over a subideal that it contains. In these graphs, the vertices will be the set of proper ideals and edges between ideals will be defined by finite generation. Specifically, we will declare that the ideals and have an edge between them if and is finitely (resp. principally) generated over ; that is, (resp. ).
The algebraic motivation for this definition is an attempt to measure properties of in a condition that (under certain graphical constraints) mimics the Noetherian condition.
This first lemma is very easy and is presented to connect our definition of finite generation of one ideal over another to what was presented in Definition 2.3. We record it for completeness and omit the proof.
Lemma 6.1.
If be ideals of , then is a finitely generated ideal of if and only if is finitely generated over .
Here are some preliminary containments of note.
Proposition 6.2.
is a subgraph of and is a subgraph of .
Proof.
Only the first statement needs proof. Suppose that are adjacent ideals (so there is an edge between them in ). If then by adjacency and hence and have an edge between them in . ∎
We now present the quasilocal case, which we will see is an exceptional case for these graphs in the sense that they are not always connected. Perhaps surprisingly, outside the quasilocal case, and are always connected.
Theorem 6.3.
Let be quasilocal. (resp. ) is connected if and only if is finitely generated. Additionally, we have the following.
-
(1)
If is connected then and is complete if and only if is a Noetherian chained ring of dimension no more than .
-
(2)
If is connected then where is the minimal number of generators required for and is complete if and only if is a PIR.
Proof.
We first remark that if is a field then the result hold trivially, so we will assume that is not a field. For the initial statement, we first suppose that is finitely generated. To show that is connected, we first note that since is finitely generated, it is certainly finitely generated over . Hence if are any two ideals of , then is a path of length no more than 2 from to . For the proof is similar (with a possibly longer path).
Now we suppose that is connected. By assumption, there is a finite path from to . Since a finite extension of a finite extension is finite, we can assume that this path takes on the form
Note that is finitely generated and for all we can write , and since , we have that
In particular,
and since is maximal, equality holds. Hence is finitely generated. Since each finite extension is a finite sequence of principal extensions, this establishes the statement for as well.
For (1), we have already established that . If is complete, then any two ideals must be comparable and hence is chained. Now note that if is an arbitrary ideal of then there is an edge between and and so must be finitely generated and so is Noetherian. Finally, we note that since is Noetherian and chained, its dimension must be no more than (if has a height nonmaximal prime ideal then there must be infinitely many and hence cannot be chained).
For the converse, note that if is Noetherian and chained then any two ideals are comparable and since they are finitely generated, there must be an edge between them.
For (2) we note that if is generated by then as is quasilocal, there is a path from any ideal to of length no more than . So given ideals , there is a path from to bounded by twice the number of generators of and hence .
Now suppose that is complete and let be an ideal. Since and have an edge between them, must be principal. Conversely if is a PIR and local then is chained. To see this, note that if and then . If and , it is easy to see that and so (without loss of generality) is a unit and . Hence and so there is an edge between and . ∎
We now suppose that is not quasilocal. In this case, and are always connected, but as we will see, the diameter of reveals some subtleties concerning the structure of . With regard to diameter, we will focus on as the large number of steps sometimes required to make a path in clouds the issue a bit. On the other hand, we will make note of when prudent.
We begin with a definition and a useful lemma that will simplify matters.
Definition 6.4.
Let be an ideal. We define to be the collection of maximal ideals of containing and following [12] we define the Jacobson radical of , , to be the intersection of all maximal ideals of containing . If is a ring we use the notation to be the Jacobson radical of .
We remark that it is an easy exercise to verify that and we will use this fact on a number of occasions.
In the following key lemma, we describe paths between ideals in and . The bounds apply to both as principally generated ideals will be used in the proof.
Lemma 6.5.
Let be a commutative ring with identity and consider the graphs and .
-
(1)
If the ideals and are comaximal, then there is a path of length from to .
-
(2)
If and are not comaximal, but there is a maximal ideal that contains but not then there is a path of length no more than from to .
-
(3)
If and , then there is a path of length no more than from to .
Proof.
For (1), we suppose that and are comaximal and find and such that . So if (resp. ) then the equation
demonstrates that the ideal (resp. ) is singly generated by (resp. ) over the ideal . Hence in (as well as ), we have the path of length 2.
For (2), since does not contain and is maximal, we can find , such that . Since we have that is a proper ideal and is clearly principally generated (or less) over . By (1) there is a path between and of length and hence there is a path of length no more than from to .
For the last statement, we will assume that and select . By hypothesis, there is another maximal ideal and we find and such that . In any case, we have the ideals and are equal or have an edge between them. If then and are equal or have an edge between them and since and are comaximal, we have our desired path of length no more than 4. On the other hand, if is not contained in , then and are comaximal (as are and ). From part (1) there is a path of length 2 from to and a path of length 2 from to and this completes the proof. ∎
The following theorem follows directly from Lemma 6.5.
Theorem 6.6.
Let be commutative with 1 with . Then and are connected and .
We now focus on in the case that and examine necessary and sufficient conditions for the diameter to be of prescribed sizes.
Theorem 6.7.
Let be a commutative ring with 1 with .
-
(1)
if and only if every maximal ideal of is finitely generated.
-
(2)
if and only if given with then there is a proper ideal that is finitely generated over both and .
Proof.
If , then given any maximal ideal , there is a path of length or between and . Whether the path is of the form or , is finitely generated.
On the other hand, if are ideals, then there is a path of length between them if and are comaximal by Lemma 6.5. If and are both contained in the maximal ideal then is a path of length no more than between them. Since , we have that is precisely . This establishes the first statement.
For (2), we first suppose that . Let be ideals with and consider cases. If there is an edge between and , then the larger ideal is finitely generated over both.
If there is a path of length between and , say and then is finitely generated over both and . If on the other hand, , then and . Now note that is finitely generated over both and and note that since , is proper.
Finally, we suppose that there is a path of length between and of the form . Without loss of generality we will assume that we have the containments . In a similar fashion to the previous argument, we write and . Note that is a proper ideal as . So the ideal is finitely generated over both and .
Conversely, note that Lemma 6.5 shows that the only unresolved case is the case in which with . But the existence of shows that there is a path between and of length no more than . Hence . ∎
Corollary 6.8.
Let be commutative with identity. Then if and only if for all , is contained in a finitely generated proper ideal.
Proof.
Note first that Theorem 6.3 shows that this result holds in the quasilocal case, and so we will assume that .
We suppose first that and select an arbitrary . Theorem 6.7 assures us that there is an ideal with finitely generated over both and and so is a finitely generated ideal of that contains .
Conversely, suppose that for all we have that is contained in a finitely generated ideal and select ideals with . By assumption is contained in the finitely generated ideal . Note that as , and so we have that contains which in turn contains . Hence is finitely generated. A similar proof establishes that is finitely generated, and so is finitely generated over both and . By Theorem 6.7 we are done. ∎
Example 6.9.
Let be a dimensional nondiscrete valuation domain with maximal ideal and consider the ring . Note that has Jacobson radical and so by Corollary 6.8, has diameter .
Example 6.10.
Consider the ring where is a nonempty index set with at least two elements (the graph is a single vertex in the degenerate case that consists of a single element). Note first that any element of is idempotent and so this is true of any homomorphic image of . So if is a homomorphic image of and then . So if then is a unit in which implies that . Since for all homomorphic images of of , we have that if is infinite and if is finite with at least two elements.
We now wish to show that the family of almost Dedekind domains that are not Dedekind produce examples of domains where in abundance. We first require a couple of preliminary results.
Lemma 6.11.
If is a commutative ring with 1, a multiplicative set, and an ideal with the property that for all , there is an and such that , then .
Proof.
We define given by . We suppose that and . By hypothesis, we can find with . So in we have and hence .
We now observe that and so is onto.
It is easy to see that . For the other containment, note that if , then for some and . Hence there exists such that . Using the assumed property, there is a and such that . From this we obtain that and so . Once again, we use the fact that there is and such that and we now obtain that and hence . By the First Isomorphism Theorem, we have that . ∎
Proposition 6.12.
Let be an ideal and be the collection of maximal ideals of that contain . If , then .
Proof.
Suppose that and note that by the definition of , . Hence we can find with . Observe that cannot be in any maximal ideal containing and so must be in ; we now appeal to Lemma 6.11. ∎
Proposition 6.13.
If be an almost Dedekind domain that is not Dedekind with finitely many maximal ideals that are not finitely generated, then .
We remark that almost Dedekind domains meeting the above conditions are commonplace. In particular, consider the sequence domains defined in [16].
Proof.
For the first case, we suppose that is contained in only finitely many maximal ideals and be the maximal ideals containing . If , then Proposition 6.12 shows that , but as is an almost Dedekind domain with only finitely many maximal ideals, it is Dedekind and hence is finitely generated. Hence by Corollary 6.8, .
Now suppose that is contained in infinitely many maximal ideals. Note that since there are only finitely many maximal ideals that are not finitely generated, there must be infinitely many finitely generated primes (if not then is semiquasilocal and hence Dedekind). So if is a finitely generated maximal ideal containing , then is a finitely generated ideal of containing and so again by Corollary 6.8.
Equality follows from the existence of maximal ideals that are not finitely generated and Theorem 6.7. ∎
We also distinguish behavior in the Noetherian case; we ignore the case of a field as the graph in this case is a single vertex.
Theorem 6.14.
Let be a commutative ring with identity that is not a field. The following conditions are equivalent.
-
(1)
is Noetherian.
-
(2)
The radius of is equal to , and is a center of .
-
(3)
and if then either and have an edge between them or there is a minimal path between them passing through .
Proof.
For we assume that is Noetherian. In this case there is an edge between and an arbitrary nonzero ideal. So is a center and the radius of is precisely .
For , since is a center and has an edge with an arbitrary ideal, every ideal is finitely generated. In particular, each maximal ideal is finitely generated and so by Theorem 6.7. Also note that from the above, if and do not have an edge between them, then we have the path .
Finally, for , we suppose that and consider the pair of ideals and . In either case there is an edge between them, and so is finitely generated. ∎
We now give, in sequence, theorem for the behavior of for polynomial extensions, power series extensions, and homomorphic images. For the statement of these theorems, the case corresponds to the case in which is a field (and the graph being a single vertex).
Theorem 6.15.
Suppose is a commutative ring with 1. If then . If then and the following hold.
-
(1)
If , then .
-
(2)
If is Noetherian, then .
-
(3)
If , then .
Proof.
For the first statement, if then is quasilocal with maximal ideal that is not finitely generated. Now note that . Since is not contained in a finitely generated ideal, we have produced an ideal, namely such that is not contained in a finitely generated ideal and so by Corollary 6.8, .
For the case , we first note that in the case that the fact that is not chained shows by application of Theorem 6.3, that . If , then there is a maximal ideal that is not finitely generated. Since the ideal is not finitely generated, . Finally, if , Corollary 6.8 gives that there is an ideal such that is not contained in a finitely generated ideal. As , Corollary 6.8 again applies and .
For , if then by Theorem 6.3, is Noetherian and chained (this statement also holds in the case where and is a field). Hence is Noetherian but has infinitely many maximal ideals (so is not chained), therefore by Theorem 6.7 .
For , if is Noetherian, then is Noetherian and the result follows as a porism of the proof of .
is now immediate. ∎
Example 6.16.
Let where is a field and let where . is a 2-dimensional discrete valuation domain with principal maximal ideal (and hence has the property that all of its maximal ideals are finitely generated); its prime spectrum is . But if we consider the polynomial ring , it is easy to see that the ideal is maximal, but not finitely generated. Note that the ideal has radical and hence has Jacobson radical but is not finitely generated over . Thus but . These details will also follow from the following.
From a more global perspective (in contrast with the class of almost Dedekind domains discussed in Proposition 6.13), the condition of Corollary 6.8 appears to make the situation where the diameter of is precisely a reasonably rare occurrence. For example, we consider the class of SFT (for strong finite type) rings introduced by J. Arnold in [3] as a generalization of Noetherian rings useful in the study of the dimension of power series rings. An ideal is said to be SFT if there is a finitely generated ideal and a fixed natural number such that for all ; we say the ring, , is SFT if all of its ideals are SFT.
Proposition 6.17.
Let be SFT, or more generally, any ring with the property that each maximal ideal is the radical of a finitely generated ideal. Then .
Proof.
We can assume that there is a maximal ideal that is not finitely generated. By assumption, is the radical of a finitely generated ideal . Note that and is maximal. If is finitely generated, the fact that is finitely generated implies that is finitely generated. Hence is not contained in a finitely generated ideal and so by Corollary 6.8, . ∎
It is worth noting that can occur for SFT rings. Also, Proposition 6.17 is another route to Example 6.16. Indeed, the domain from this example is a dimensional SFT valuation domain and the results of [15] show that is of finite Krull dimension and hence must be SFT. Since the maximal ideal is not finitely generated, .
Theorem 6.18.
If is a commutative ring with 1 and then the following hold.
-
(0)
If , then .
-
(1)
If , then .
-
(2)
If , then .
-
(3)
If , then .
Proof.
For we note that if is a field then is a Noetherian valuation domain.
For , we have by Theorem 6.3 that is Noetherian and quasilocal and hence so is (but not chained if is not a field) and so by Theorem 6.3.
is similar to the previous. Since each maximal ideal is finitely generated and the maximal ideals of are of the form , we have that all maximal ideals of are finitely generated as well.
For , we first consider . Suppose that has the property that for all , is contained in a finitely generated ideal. Now consider an ideal and let . An easy computation shows that is precisely equal to where is the Jacobson radical of in . Note that there is an ideal such that is finitely generated over and (that is, is a finitely generated ideal containing ). We conclude that is finitely generated over and with this in hand, we will show that is finitely generated over . To this end, we let be the generators of over and for each , find such that . Now suppose that , with and . Since is a generator, we can assume, without loss of generality, that . Since , we can write with . Note that where with and . So is generated over by the elements and . Hence by Corollary 6.8 . The multivariable case follows immediately by induction.
If then there is an ideal such that is not contained in a finitely generated ideal. Note that as this property persists in the power series extension. Again, induction completes this.
Finally, if , is quasilocal with maximal ideal that is not finitely generated by Theorem 6.3. Since is quasilocal with maximal ideal the diameter of is also infinite. ∎
We round this out by recording behavior in homomorphic images.
Theorem 6.19.
Let be a commutative ring with 1 and an ideal. If then the following hold.
-
(1)
If , then .
-
(2)
If , then .
-
(3)
If , then or .
Proof.
If it is necessarily true that the maximal ideals of are finitely generated and hence the same is true of .
For the second statement, we suppose that , and so in particular, for all , is contained in a finitely generated ideal. So if is an ideal of then and so has diameter of no more than .
For , if is finite, then the first statement is clear. Note however, that if is a ring with a maximal ideal that is not finitely generated, and has the property that and is not finitely generated, then is quasilocal and hence its graph is not connected by Theorem 6.3. For a concrete example of this, let be a dimensional nondiscrete valuation domain. By Theorem 6.3 and by Theorem 6.15; since we have our example. ∎
Remark 6.20.
As a final remark, we point out that it would be interesting to know if the property that is stable under polynomial extensions. More generally, a more complete understanding of stability properties of the diameter of the graphs under polynomial extensions for would be desirable.
References
- [1] David F. Anderson and John D. LaGrange. Some remarks on the compressed zero-divisor graph. J. Algebra, 447:297–321, 2016.
- [2] David F. Anderson and Philip S. Livingston. The zero-divisor graph of a commutative ring. J. Algebra, 217(2):434–447, 1999.
- [3] J. T. Arnold. Krull dimension in power series rings. Trans. Amer. Math. Soc., 177:299–304, 1973.
- [4] M. Axtell, N. Baeth, and J. Stickles. Cut structures in zero-divisor graphs of commutative rings. J. Commut. Algebra, 8(2):143–171, 2016.
- [5] Michael Axtell, James Coykendall, and Joe Stickles. Zero-divisor graphs of polynomials and power series over commutative rings. Comm. Algebra, 33(6):2043–2050, 2005.
- [6] István Beck. Coloring of commutative rings. J. Algebra, 116(1):208–226, 1988.
- [7] M. Behboodi and Z. Rakeei. The annihilating-ideal graph of commutative rings I. J. Algebra Appl., 10(4):727–739, 2011.
- [8] Jason Greene Boynton and Jim Coykendall. On the graph of divisibility of an integral domain. Canad. Math. Bull., 58(3):449–458, 2015.
- [9] Jim Coykendall and Jack Maney. Irreducible divisor graphs. Comm. Algebra, 35(3):885–895, 2007.
- [10] Frank DeMeyer and Lisa DeMeyer. Zero divisor graphs of semigroups. J. Algebra, 283(1):190–198, 2005.
- [11] Robert Gilmer and Raymond C. Heitmann. On for seminormal. J. Pure Appl. Algebra, 16(3):251–257, 1980.
- [12] Robert W Gilmer. Multiplicative ideal theory. Number 12. Queen’s University Kinston, Ontario, 1968.
- [13] Jürgen Herzog, Somayeh Moradi, and Masoomeh Rahimbeigi. The edge ideal of a graph and its splitting graphs. J. Commut. Algebra, 14(1):27–35, 2022.
- [14] Takayuki Hibi, Kyouko Kimura, Kazunori Matsuda, and Akiyoshi Tsuchiya. Regularity and -invariant of Cameron-Walker graphs. J. Algebra, 584:215–242, 2021.
- [15] B. G. Kang and M. H. Park. Krull dimension of mixed extensions. J. Pure Appl. Algebra, 213(10):1911–1915, 2009.
- [16] K. Alan Loper. Almost Dedekind domains which are not Dedekind. In Multiplicative ideal theory in commutative algebra, pages 279–292. Springer, New York, 2006.
- [17] Thomas G. Lucas. The clique ideal property. J. Commut. Algebra, 10(4):499–546, 2018.
- [18] Aron Simis, Wolmer V. Vasconcelos, and Rafael H. Villarreal. On the ideal theory of graphs. J. Algebra, 167(2):389–416, 1994.
- [19] Richard G. Swan. On seminormality. J. Algebra, 67(1):210–229, 1980.
- [20] Rafael H. Villarreal. Cohen-Macaulay graphs. Manuscripta Math., 66(3):277–293, 1990.
- [21] Rafael H. Villarreal. Rees algebras of edge ideals. Comm. Algebra, 23(9):3513–3524, 1995.