This paper characterizes Boolean FIP ring extensions, where the subextensions form a finite Boolean lattice, and shows that all subextensions are simple, revealing structural properties of such extensions.
Contribution
It provides a characterization of Boolean FIP ring extensions and demonstrates that all subextensions are simple, advancing understanding of their lattice structure.
Findings
01
Subextensions of Boolean FIP extensions are simple.
02
Characterizations involve factorial properties of the subextension poset.
03
Each Boolean FIP extension has a finite Boolean lattice of subextensions.
Abstract
We characterize extensions of commutative rings R⊆S whose sets of subextensions [R,S] are finite ({\it i.e.} R⊆S has the FIP property) and are Boolean lattices, that we call Boolean FIP extensions. Some characterizations involve ``factorial" properties of the poset [R,S]. A non trivial result is that each subextension of a Boolean FIP extension is simple (i.e. R⊆S is a simple pair).
Equations4
R[x]↗↖R[x,y]R↖↗R[y]
R[x]↗↖R[x,y]R↖↗R[y]
k↓U→→L↓UL→→T↓K
k↓U→→L↓UL→→T↓K
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
We characterize extensions of commutative rings R⊆S whose sets of subextensions [R,S] are finite (i.e.R⊆S has the FIP property) and are Boolean lattices, that we call Boolean FIP extensions. Some characterizations involve “factorial” properties of the poset [R,S]. A non trivial result is that each subextension of a Boolean FIP extension is simple (i.e. R⊆S is a simple pair).
Key words and phrases:
FIP, FCP extension, minimal extension, integral extension, support of a module, lattice, Boolean lattice, algebraic field extension, Galois extension
We consider the category of commutative and unital rings, whose epimorphisms will be involved. If R⊆S is a (ring) extension, we denote by [R,S] the set of all R-subalgebras of S and
set ]R,S[:=[R,S]∖{R,S} (with a similar definition for [R,S[ or ]R,S]).
A lattice is a poset L such that every pair a,b∈L has a supremum and an infimum.
For an extension R⊆S, the poset ([R,S],⊆) is a complete lattice where the supremum of any non void subset is the compositum which we call product from now on and denote by Π when necessary, and the infimum of any non void subset is the intersection. We are aiming to study some lattice properties of the poset ([R,S],⊆), mainly the Boolean property. As a general rule, an extension R⊆S is said to have some property of lattices if [R,S] has this property.
The extension R⊆S is said to have FIP (for the “finitely many intermediate algebras property”) or an FIP extension if [R,S] is finite. A chain of R-subalgebras of S is a set of elements of [R,S] that are pairwise comparable with respect to inclusion. When [R,S] is a chain, the extension R⊆S is called a λ-extension by some authors. We will say that R⊆S is chained. We also say that the extension R⊆S has FCP (or is an FCP extension) if each chain in [R,S] is finite. Clearly, each extension that satisfies FIP must also satisfy FCP.
Dobbs and the authors characterized FCP and FIP extensions [11].
Let R⊆S be an FCP extension, then [R,S] is a complete Noetherian Artinian lattice, with R as the least element and S as the largest element. We use lattice definitions and properties described in [24].
Our main tool are the minimal (ring) extensions, a concept that was introduced by Ferrand-Olivier [18]. Recall that an extension R⊂S is called minimal if [R,S]={R,S}.
An extension R⊆S is called a simple extension if S=R[t] for some t∈S and a simple pair if R⊆T is a simple extension for each T∈[R,S]. A minimal extension is simple. The key connection between the above ideas is that if R⊆S has FCP, then any maximal (necessarily finite) chain of R-subalgebras of S, R=R0⊂R1⊂⋯⊂Rn−1⊂Rn=S, with lengthn<∞, results from juxtaposing n minimal extensions Ri⊂Ri+1,0≤i≤n−1.
An FCP extension is finitely generated, and (module) finite if integral.
For any extension R⊆S, the lengthℓ[R,S] of [R,S] is the supremum of the lengths of chains of R-subalgebras of S. Notice that if R⊆S has FCP, then there does exist some maximal chain of R-subalgebras of S with length ℓ[R,S] [12, Theorem 4.11].
1.1. A summary of the main results
Any undefined material
is explained at the end of the section or in the next sections.
Section 2 is devoted to some general properties of lattices [R,S], mainly in the context of FCP and FIP extensions.
Since Boolean extensions are distributive, we have evidently to work on distributive extensions, which is done in this section.
We discuss the decomposition of elements of [R,S] into irreducible elements.
When [R,S] has finitely many atoms and each element of [R,S] is a product of atoms, then Proposition 2.17 shows that R⊆S has FIP and is almost-Prüfer, and Theorem 2.11 shows that R⊆S is a simple pair.
For extensions R⊆S of integral domains, Ayache considered Boolean lattices
(also called Boolean algebras)
([R,S],∩,⋅), that are distributive lattices such that each T∈[R,S] has a (unique) complement [1], [2] and [3]. In particular, [2, Problem 45] asked under which conditions [R,S] is a finite Boolean lattice. This question is completely answered in Sections 3 and 4, where we get in
Theorem 3.29
a characterization of Boolean extensions.
In particular, Theorem 3.1 shows that an FCP Boolean extension R⊆S has FIP, each element of [R,S] has a unique representation by a finite product of atoms, and R⊂S a simple pair.
Section 3 is devoted to the study of arbitrary FIP extensions. The canonical decomposition of a ring extension is crucial. It consists of the tower R⊆S+R⊆StR⊆R⊆S, where S+R (resp. StR) is the seminormalization (resp. t-closure) of R in S (see Section 3).
This decomposition
allows us to only consider special extensions: subintegral, seminormal infra-integral, t-closed and integrally closed. The t-closed case is reduced to the context of field extensions and is the subject of Section 4. In particular, for a field extension k⊂L with separable closure T and radicial closure U such that U,T∈{k,L}, Theorem 4.2 shows that k⊂L is Boolean if and only if k⊂U and T⊂L are minimal, [k,L]=[k,T]∪[U,L],k⊂T and k⊂U are linearly disjoint and [k,T] is a Boolean lattice. Boolean separable field extensions needs a special study. A striking result is Theorem 4.19: A Galois finite extension (hence FIP) k⊂L is Boolean if and only if k⊂L is a cyclic extension whose dimension is square free.
1.2. Some conventions and notation
A local ring is here what is called elsewhere a quasi-local ring. As usual, Spec(R) and Max(R) are the set of prime and maximal ideals of a ring R. The support of an R-module E is SuppR(E):={P∈Spec(R)∣EP=0}, and MSuppR(E):=SuppR(E)∩Max(R). When R⊆S is an extension, we will set SuppR(T/R):=Supp(T/R) and SuppR(S/T):=Supp(S/T) for each T∈[R,S], unless otherwise specified.
If R⊆S is a ring extension and P∈Spec(R), then SP is both the localization SR∖P as a ring and the localization at P of the R-module S.
We denote by κR(P) the residual field RP/PRP at P.
An extension R⊂S is called locally minimal if RP⊂SP is minimal for each P∈Supp(S/R) or equivalently for each P∈MSupp(S/R).
We denote by (R:S) the conductor of R⊆S. The integral closure of R in S is denoted by RS (or by R if no confusion can occur).
Recall that an extension R⊆S is Prüfer (or a normal pair) if R⊆T is a flat epimorphism for each T∈[R,S]. The Prüfer hull of an extension R⊆S is the greatest Prüfer subextension R of [R,S] [28]. An extension R⊆S is called almost-Prüfer if R⊆S is integral, or equivalently, when R⊆S is FIP, if S=RR [30, Theorem 4.6].
A poset (X,≤) is called a tree if x1,x2≤x3 in X implies that x1 and x2 are comparable (with respect to ≤). We also say that (X,≤) is treed. A subset Y of X is called an antichain if no two distinct elements of Y are comparable.
Finally, ∣X∣ is the cardinality of a set X, ⊂ denotes proper inclusion and, for a positive integer n, we set Nn:={1,…,n}.
The characteristic of an integral domain k is denoted by c(k).
For a,b,c in a ring R, if c divides a−b, we write a≡b(c).
2. Lattices properties of the poset [R,S]
2.1. Some definitions on the lattice [R,S]
In the context of a lattice [R,S], some definitions and properties of lattices have the following formulations.
An element T∈[R,S] is called ∩-irreducible (resp.; Π-irreducible) (see [24]) if T=T1∩T2 (resp.; T=T1T2) implies T=T1 or T=T2.
An element T of [R,S] is an atom (resp.; co-atom) if and only if R⊂T (resp.; T⊂S) is a minimal extension.
Therefore, an atom (resp.; co-atom) is Π-irreducible (resp.; ∩-irreducible). We denote by A the set of atoms of [R,S] and by CA the set of co-atoms of [R,S].
Now R⊂S is called:
(a) atomic (resp.; atomistic) if each T∈]R,S] contains some atom (resp.; is the product of atoms (contained in T)) [32, page 80].
(b) co-atomic (resp.; co-atomistic) if each T∈[R,S[ is contained in some co-atom (resp.; is the intersection of co-atoms (containing T)).
(c) distributive if intersection and product are each distributive with respect to the other. Actually, each distributivity implies the other [24, Exercise 5, page 33].
(d) factorial (resp.; co-factorial) if each element of [R,S] has a unique irredundant representation by a finite product of atoms (resp.; a unique irredundant representation by a finite intersection of co-atoms.)
An FCP extension is both atomic and co-atomic.
We introduce a definition reminiscent of arithmetic rings [29].
Definition 2.1**.**
A ring extension R⊆S is called
arithmetic if [RP,SP] is a chain for each P∈Spec(R).
Example 2.2**.**
The extension R⊂S is arithmetic in the following cases ([29, Example 5.13] for (2), (3) and (4)):
(1)
R⊂S is locally minimal.
2. (2)
R⊂S has FCP and is integrally closed.
3. (3)
R⊂S is FIP subintegral and ∣R/M∣=∞ for each M∈MSupp(S/R).
4. (4)
R⊂S is FIP t-closed integral such that RM/MRM⊂SM/MRM is radicial for each M∈MSupp(S/R).
5. (5)
We also have examples in [31, Theorem 6.1] of arithmetic extensions of length 2 R⊂S when ∣[R,S]∣=3.
The following proposition will make easier many proofs.
Proposition 2.4**.**
Let R⊆S be a ring extension. The following statements are equivalent:
(1)
R⊆S* is distributive ;*
2. (2)
RM⊆SM* is distributive for each M∈MSupp(S/R):*
3. (3)
RP⊆SP* is distributive for each P∈Supp(S/R):*
4. (4)
R/I⊆S/I* is distributive for each ideal I shared by R and S.*
5. (5)
R/I⊆S/I* is distributive for some ideal I shared by R and S.*
Proof.
We have obviously (1) ⇒ (3) ⇒ (2) and (1) ⇔ (4)
⇒ (5) ⇒ (1). Conversely, assume that RM⊆SM is distributive for each M∈MSupp(S/R). Then, RM⊆SM is distributive for each M∈Max(R). It follows that the distributivity property holds in [R,S] since it holds in any [RM,SM].
∎
Proposition 2.5**.**
[21, Theorem 1, p. 172]** In a distributive lattice of finite length, all maximal chains between two comparable elements have the same length (the Jordan-Hölder chain condition or condition (JH)).
In [16], Dobbs and Shapiro defined a field extension k⊂L
of finite length
to be catenarian if all maximal chains of fields between k and L have the same length, and get examples of catenarian field extensions. It follows that a distributive field extension is catenarian.
Proposition 2.6**.**
[8, Remarks, page 9 and Theorem 1.7]** A distributive extension R⊂S satisfies the upper covering condition
(UCC),
which means that for each T,U∈[R,S] such that T∩U⊂T is minimal, then U⊂TU is minimal.
2.2. Some distributive extensions are simple
We are going to show that some special subextensions of an FCP distributive extension are simple. Before, next lemma is needed.
Lemma 2.7**.**
If R⊂S is a distributive extension, then R[x,y]=R[x+y] whenever y∈S∖R, x∈S∖R[y] and R⊂R[x] is minimal.
Proof.
Consider the diagram
[TABLE]
Since R[x]R[y]=R[x,y] and
R⊂R[x] is minimal, we get that
R[y]⊂R[x,y] is minimal by
UCC.
There is another diagram
R[x]↗↖R[x,y]R↖↗R[y]∩R[x+y]
where R[x]∩(R[y]∩R[x+y])=R and R⊂R[x] is minimal. Using again
UCC,
we get that R[y]∩R[x+y]⊂R[x](R[y]∩R[x+y]) is minimal. But R[x](R[y]∩R[x+y])=R[x]R[y]∩R[x]R[x+y]=R[x,y] by distributivity, so that R[y]∩R[x+y]⊂R[x,y] is minimal. From R[y]∩R[x+y]⊆R[y]⊂R[x,y], we deduce R[y]=R[y]∩R[x+y], which implies R[y]⊂R[x+y]⊆R[x,y] because x∈R[y], and then R[x+y]=R[x,y].
∎
Proposition 2.8**.**
Let R⊂S be a distributive extension. Let T∈[R,S] be a product of finitely many atoms. Then, R⊂T is simple. More precisely, if T=∏i=1nR[xi], where the R⊂R[xi] are minimal distinct extensions, then, T=R[∑i=1nxi].
Proof.
We prove the two statements by induction on n. There is nothing to prove when n=1. Assume that the induction hypothesis holds for n−1 and set T′:=∏i=1n−1R[xi]=R, so that T′=R[x] with x:=∑i=1n−1xi. Then, T=R[x]R[xn], with x∈R and xn∈S∖R[x]. Deny. Then R[xn]⊆∏i=1n−1R[xi] would imply R[xn]⊆R[xi] for some i∈{1,…,n−1}, a contradiction [32, Theorem 4.30]. Now, use Lemma 2.7 to get the result.
∎
2.3. The
lattice
[R,S] for an FCP or FIP extension
Proposition 2.9**.**
[24, Proposition 1.4.4]** If R⊆S has FCP, then any T∈[R,S] is a finite intersection (resp.; product) of ∩-irreducible (resp.; Π-irreducible) elements of [R,S].
Lemma 2.10**.**
If R⊆S is a
distributive extension and T∈[R,S] has an irredundant representation T=T1⋯Tm
by Π-irreducible elements of [R,S],
(resp.; T=U1∩⋯∩Tr by ∩-irreducible elements of [R,S]) (for example by atoms (resp.; co-atoms)),
the representation is unique.
If in addition R⊆S has FCP, [R,S] has exactly nΠ-irreducible (resp.; ∩-irreducible) elements if and only if ℓ[R,S]=n.
If these conditions hold, R⊆S has FIP.
Proof.
[32, Theorem 4.30], [17, Theorem 147] and [23, Lemma 4, page 486] combine to yield the result. The FIP property is then an easy consequence.
∎
Theorem 2.11**.**
An extension R⊂S is atomistic, distributive and FIP if and only if R⊂S is factorial (respectively, is co-factorial).
If these conditions hold, then R⊂S is a simple pair.
Proof.
If R⊂S is an atomistic distributive FIP extension, then [R,S] has finitely many atoms, and then is factorial by Lemma 2.10.
Conversely, assume that R⊂S is factorial, whence atomistic. Let T,U,V∈[R,S]. Obviously, (T∩U)(T∩V)⊆T∩UV. Since R⊂S is factorial, we can write T=∏α∈IAα,U=∏β∈JAβ and V=∏γ∈KAγ, for finite subsets {Aα∣α∈I},{Aβ∣β∈J} and {Aγ∣γ∈K} of A. Then, UV=∏β∈J∪KAβ, so that T∩UV=(∏α∈IAα)∩(∏β∈J∪KAβ). Write T∩UV=:∏δ∈LAδ=(∏α∈IAα)∩(∏β∈J∪KAβ). Then, for any δ∈L, we have Aδ⊆T and Aδ⊆∏β∈J∪KAβ, so that there exist some α∈I such that Aδ=Aα and some β∈J∪K such that Aδ=Aβ. If β∈J, then Aδ⊆U, so that Aδ⊆T∩U⊆(T∩U)(T∩V). If β∈K, then Aδ⊆V, so that Aδ⊆T∩V⊆(T∩U)(T∩V). In both cases, Aδ⊆(T∩U)(T∩V), which yields T∩UV⊆(T∩U)(T∩V), and then T∩UV=(T∩U)(T∩V). Therefore, R⊂S is distributive. Moreover, R⊂S has FIP since A is finite (S is the product of all elements of A).
Now, let R⊂S be factorial, whence distributive. Set n:=∣A∣, and for Aα∈A, set Bα:=∏β=αAβ. Obviously, CA={Bα∣α∈Nn}. Let T∈[R,S], with T=∏α∈IAα. For J=Nn∖I, an easy calculation shows that T=∩β∈JBβ in a unique way. Hence, R⊂S is co-factorial.
To end, assume that R⊂S is co-factorial. We get that R⊂S is factorial and distributive, mimicking the previous proof. It is enough to exchange product and intersection, and atoms and co-atoms. In fact, we use the fact that R⊂S is co-atomistic.
If these conditions hold, then R⊂S is a simple pair by Proposition 2.8.
∎
The following notions and results are deeply involved in the sequel.
Definition 2.12**.**
[7, Theorem 4.5] An extension R⊂S is called M-crucial if there is some unique M∈Max(R), called the crucial (maximal) idealC(R,S) of R⊂S, such that RP=SP for each P∈Spec(R)∖{M}.
Theorem 2.13**.**
[18, Théorème 2.2]** A minimal extension is crucial and is either integral (finite) or a flat epimorphism.
Lemma 2.14**.**
[11, Corollary 3.2]** If there exists a maximal chain R=R0⊂⋯⊂Ri⊂⋯⊂Rn=S of extensions, where Ri⊂Ri+1 is minimal, then Supp(S/R)={C(Ri,Ri+1)∩R∣i=0,…,n−1}.
Lemma 2.15**.**
[31, Lemma 1.8]** Let R⊂S be an FCP extension. and M∈MSupp(S/R). There is some T∈[R,S] such that R⊂T is minimal and C(R,T)=M.
If R⊆S has FCP, set T:={T∈[R,S]∣MSuppR(T/R)∣=1} and
TM:={T∈T∣MSuppR(T/R)={M}}.
We are able to give dual results with T∗:={T∈[R,S]∣∣MSuppR(S/T)∣=1}, but they do not appear in this paper because they are not used in the sequel.
Proposition 2.16**.**
A subextension R⊂T of an FCP extension R⊂S is M-crucial when T∈TM is such that Supp(T/R)⊆Max(R). Moreover, A is
the set of all minimal elements of T.
In case R⊂S has FIP, TM has a greatest element s(M):=∏T∈TMT.
Proof.
Let T∈TM
be such that Supp(T/R)⊆Max(R).
It follows that SuppR(T/R)=MSupp(T/R)={M} and RP=TP for each P∈Spec(R)∖{M}.
Hence R⊂T is M-crucial.
If U∈[R,S] is an atom, R⊂U is minimal and M:=C(R,U) with MSupp(U/R)={M}, whence U∈T. Since R⊂U is minimal, U is a minimal element of T. Conversely, let U be a minimal element of T. If U is not an atom, there is U′∈[R,S] with R⊂U′⊂U. Then, ∅=MSupp(U′/R)⊆MSupp(U/R)={M} implies MSupp(U′/R)={M} giving U′∈T, contradicting the minimality of U in T. Therefore, U is an atom.
Since s(M):=∏T∈TMT, we get that T⊆s(M) for each T∈TM and R⊂s(M), whence MSupp(s(M)/R)=∅. Since RP=TP for each T∈TM and P∈Spec(R)∖{M}, we get s(M)P=RP, so that MSupp(s(M)/R)={M} and s(M) is the greatest element of TM.
∎
Proposition 2.17**.**
Let R⊂S be an FCP atomistic extension such that ∣A∣<∞, with MSupp(S/R)={M1,…,Mn}. Set AM=A∩TM and, for each k∈Nn, Vk:=∏i=1ks(Mi) and V0:=R.
Then, the following statements hold.
(1)
R⊂S* has FIP.*
2. (2)
For each M∈MSupp(S/R),s(M)=∏A∈AMA.
3. (3)
For each k∈Nn,Supp(Vk/Vk−1)={Mk} and {Vk}k=0n is an increasing chain such that Vn=S.
4. (4)
For each T∈]R,S], there exists Ti∈TMi, for each Mi∈MSupp(T/R), such that T=∏Mi∈MSupp(T/R)Ti.
5. (5)
R⊂S* is almost-Prüfer.*
Proof.
(1) Since ∣A∣<∞ and any element of [R,S] is a product of atoms, then ∣[R,S]∣<∞ and R⊂S has FIP.
(2) Let M∈MSupp(S/R). Any element of TM is a product of atoms, which are necessarily in TM, and then in AM. It follows from Proposition 2.16 that s(M)=∏A∈AMA.
(3) Let Mj∈MSupp(S/R) for some j∈Nn. Assume 1<k<n. Since Vk=∏i=1ks(Mi) and Vk−1=∏i=1k−1s(Mi), we have (Vk−1)Mj=(Vk)Mj=RMj if j>k, so that Mj∈Supp(Vk/Vk−1). If j=k>k−1, then, (Vk−1)Mk=RMk and (Vk)Mk=s(Mk)Mk=RMk, so that Mk∈Supp(Vk/Vk−1). At last, if j<k, then, (Vk−1)Mj=(Vk)Mj=s(Mj)Mj, so that Mj∈Supp(Vk/Vk−1). Hence, Supp(Vk/Vk−1)={Mk}. If k∈{1,n}, the same reasoning holds. The end of (3) is obvious.
(4) Let T∈]R,S]. Let I⊂Nn be such that Supp(T/R)={Mi∣i∈I}. Since T is a product of atoms Aα, for each i∈I, set Ti=∏[Aα∣Aα∈TMi]. Then, Ti∈TMi and T=∏Mi∈MSupp(T/R)Ti.
(5) Since R⊂A is minimal for any A∈A, either R⊂A is integral or R⊂A is integrally closed. Moreover, by [31, Lemma 1.5], for a given M∈MSupp(S/R), minimal extensions R⊂A, for A∈TM, are either all integral, or all integrally closed. Reorder MSupp(S/R) such that for some k∈Nn,R⊂A is integrally closed for all A∈TMi and for any i≤k and R⊂A is integral for all A∈TMi and for any i>k. Then, R⊂Vk is Prüfer and Vk⊂S is integral, so that R⊂S is almost-Prüfer.
∎
Proposition 2.18**.**
Let R⊂S be an FCP extension, such that (T,⊆) is a tree. Then,
(1)
The elements of T are Π-irreducible in [R,S].
2. (2)
For each M∈MSupp(S/R),TM is a chain, whose least element i(M) is the only T∈[R,S] satisfying R⊂T is minimal and M=C(R,T).
3. (3)
Let M∈MSupp(S/R). For each T∈[R,S] such that M∈MSupp(T/R), we have i(M)⊆T.
Proof.
(1) Let T∈T and M∈MSupp(S/R) such that MSupp(T/R)={M}. It follows that RM=TM and RM′=TM′ for each M′∈Max(R)∖{M}. Let T1,T2∈[R,S] be such that T=T1T2. Then we have R⊆Ti⊆T for i∈N2, giving (Ti)M′=RM′=TM′ for each M′∈Max(R)∖{M}, and RM⊆(Ti)M⊆TM for i∈N2, giving, for each i∈N2, either R=Ti (a), or MSupp(Ti/R)={M} (b). Fix i and let j∈N2∖{i}. Case (a) gives T=Tj. Case (b) gives that Ti∈T. In this case, either Tj=R, giving T=Ti, or Tj∈T. Hence Ti and Tj are comparable, because T is a tree. Therefore, T is equal to the greatest element of {T1,T2} and T is Π-irreducible.
(2) Let M∈MSupp(S/R) and T1,T2∈TM. Set U:=T1T2, so that Ti⊆U for i∈N2 and then (Ti)M′=RM′=UM′ for each M′∈Max(R)∖{M}, and RM⊂(Ti)M⊆UM. Then, MSupp(U/R)={M}. Therefore, U∈T, so that T1 and T2 are comparable and TM is a chain.
By Lemma 2.15, there is T∈[R,S] such that R⊂T is minimal with M=C(R,T). Obviously, we have MSupp(T/R)={M}, so that
T∈TM. Since TM is a chain, T is the least element of TM, because any U∈TM is comparable to T, and we cannot have U⊂T. Moreover, since any T′∈[R,S] such that R⊂T′ is minimal with M=C(R,T′) satisfies T′∈TM, we have just proved that there is only one T′∈[R,S] such that R⊂T′ is minimal with M=C(R,T′).
We set i(M):=T′.
(3) Let T∈[R,S] with M∈MSupp(T/R). For each M′∈Max(R)∖{M}, we have RM′=i(M)M′⊆TM′ and a maximal chain R=R0⊂⋯⊂Ri⊂⋯⊂Rn=T, where Ri−1⊂Ri is minimal for each i∈Nn. Since M∈MSupp(T/R), there is some i∈Nn such that M=C(Ri−1,Ri)∩R, by Lemma 2.14. Let k∈Nn be the least i satisfying this property. Assume k=1, so that M∈MSupp(Rk−1/R). Again by Lemma 2.15, there is R1′∈[R,Rk] such that R⊂R1′ is minimal with M=C(R,R1′). From (2), we deduce that R1′=i(M), so that i(M)⊆T. If k=1, then Rk−1=R and Rk=i(M)⊆T.
∎
We will see in Proposition 2.21, that, under some conditions, for an FCP extension R⊂S, any element of [R,S] can be written in a unique way, as a product of elements of T. But Remark 2.24 shows that this property does not always hold.
Now, we look at some properties of arithmetic FCP extensions.
Theorem 2.19**.**
Let R⊂S be an arithmetic FCP extension. Then,
(1)
R⊂S* has FIP and ∣[R,S]∣≤∏M∈MSupp(S/R)(1+ℓ[RM,SM]).*
2. (2)
TM*
is a chain for each M∈MSupp(S/R)
and (T,⊆)
is treed.*
Proof.
Clearly, RM⊂SM has FCP for each M∈MSupp(S/R) ([11, Proposition 3.7(a)]).
(1) Therefore, ∣[RM,SM]∣<∞ follows, since [RM,SM] is a chain and RM⊂SM has FIP for each M∈MSupp(S/R). Hence, R⊂S has FIP [11, Proposition 3.7(b)]. By [11, Theorem 3.6 (a)], we have ∣[R,S]∣≤∏M∈MSupp(S/R)∣[RM,SM]∣. But ∣[RM,SM]∣=1+ℓ[RM,SM] holds since [RM,SM] is la chain, giving the requested inequality.
(2) Let T1,T2∈TM,
so that {M}=MSupp(Ti/R)
for i∈N2. Then, (T1)M′=(T2)M′=RM′
for each M′∈MSupp(S/R)∖{M}. Moreover, (Ti)M∈[RM,SM] for i∈N2, so that
(T1)M and (T2)M are comparable, and so are T1 and T2.
Then, TM is a chain.
Let T1,T2,T∈T be such that Ti⊆T for i∈N2 and M∈MSupp(S/R) such that MSupp(T/R)={M}. We get, for i∈N2, that ∅=MSupp(Ti/R)⊆MSupp(T/R)={M}, so that MSupp(Ti/R)={M}.
It follows that T1,T2∈TM, which is a chain, and then T1 and T2 are comparable. Therefore, T is a tree.
∎
Let R⊂S be an FCP extension and MSupp(S/R):={M1,…,Mn}. We will use the maps φ:[R,S]→∏i=1n[RMi,SMi] defined by φ(T):=(TM1,…,TMn) and φM:[R,S]→[RM,SM] defined by φM(T):=TM, for each M∈MSupp(S/R). Then φ is injective [11, Theorem 3.6]. If φ is bijective, R⊆S is called a B-extension (B stands for bijective).
Proposition 2.20**.**
An FCP extension R⊆S is a B-extension if and only if R/P is local for each P∈Supp(S/R).
The above “local” condition on the factor domains R/P holds in case Supp(S/R)⊆Max(R), and, in particular, if R⊂S is integral.
Proof.
One implication appears in the proof of [11, Theorem 3.6(b)] which uses [11, Lemma 3.5].
Conversely, assume that φ is bijective and that there is some P∈Supp(S/R) contained in two elements M1,M2∈Max(R). Consider a maximal chain C:R=R0⊂⋯⊂Ri⊂⋯⊂Rn=S, where Ri−1⊂Ri is minimal for each i∈Nn. Since P∈Supp(S/R), there exists some i∈Nn such that P=N∩R, where N:=C(Ri−1,Ri) by Lemma 2.14. In particular, P∈Supp(Ri/R), which implies that Mj∈Supp(Ri/R) for j∈N2. Since φ is surjective, there is T∈[R,S] such that TM1=(Ri)M1 and TM=RM for each M∈MSupp(S/R)∖{M1}. In particular, M2∈Supp(T/R). Localizing C at M1, we get that
PM1∈Supp((Ri)M1/RM1)=Supp(TM1/RM1) so that P∈Supp(T/R), Now M2∈Supp(T/R) is absurd. Then, R/P is a local ring for each P∈Supp(S/R).
If Supp(S/R)⊆Max(R), it follows from Lemma 2.14 that each C(Ri−1,Ri) lies over a maximal ideal of R (and so R/P is a field, hence local for each P∈Supp(S/R)). Finally, it is standard that maximal ideals lie over maximal ideals in any integral extension (cf. [22, Theorem 44]).
∎
Under an additional assumption, next proposition gives a converse to Theorem 2.19. Set MSupp(S/R):={M1,…,Mn} for an FCP extension R⊂S. It follows that the elements of MSupp(T/R) are some Mi when T∈]R,S].
Proposition 2.21**.**
Let R⊂S be an FCP B-extension.
(1)
For each M∈MSupp(S/R), we have [RM,SM]=φM(T)∪{RM}=φM(TM)∪{RM}.
2. (2)
Any T∈]R,S] is a product of ∣MSupp(T/R)∣ distinct elements Ei∈T in a unique way such that Ei∈TMi, for each Mi∈MSupp(T/R).
3. (3)
R⊂S* is arithmetic if and only if T
is a tree.*
4. (4)
Assume that R⊂S is arithmetic. Then, T
is the set of Π-irreducible
elements of ]R,S].
Moreover, ∣[R,S]∣=∏M∈MSupp(S/R)(1+ℓ[RM,SM]).
Proof.
(1) The following inclusions are obvious: φM(TM)∪{RM}⊆φM(T)∪{RM}⊆[RM,SM]. Let E∈]RM,SM]. Since φ is a bijection, there exists T∈]R,S] such that TM=E and TM′=RM′ for each M′∈MSupp(S/R)∖{M}. The result follows from E=φM(T) and T∈TM.
(2) Let T∈]R,S].
From MSupp(T/R)=∅, we infer that some Mi∈MSupp(T/R).
Since φ is a bijection,
there exists a unique Ei∈[R,S] such that (Ei)Mi=TMi and (Ei)M=RM for M=Mi. It follows that Ei∈TMi for each Mi∈MSupp(T/R).
Set Ej=R when Mj∈MSupp(T/R) and
E:=E1⋯En. For each j∈Nn, we get that EMj=TMj,
so that E=T is the
product of ∣MSupp(T/R)∣ distinct elements of T. The uniqueness of these elements is obvious.
(3) One implication is Theorem 2.19. Assume that T
is a tree. Let M∈MSupp(S/R). By Proposition 2.18,
TM
is a chain. Since φM preserves order, (1) implies that [RM,SM] is a chain.
(4) Assume that R⊂S is arithmetic. Then, T
is a tree. It results from Proposition 2.18
that the elements of T
are Π-irreducible.
Conversely, let T∈]R,S] be Π-irreducible. In view of (2), T is a product of elements Ei∈TMi, where Mi∈MSupp(T/R), and then, of only one element of T, so that T∈T.
Now ∏M∈MSupp(S/R)∣[RM,SM]∣=∏M∈MSupp(S/R)(1+ℓ[RM,SM])=∣[R,S]∣, since φ is bijective and each RM⊂SM a chain.
∎
For the definition of the Goldie dimension of a
distributive lattice, the reader may look at [24, p. 14 and Exercise 8, p. 33]. We will use the following results.
Proposition 2.22**.**
[24, Theorem 1.5.9]** If R⊆S is an FCP arithmetic extension, its Goldie dimension is the integer n such that R=B1∩⋯∩Bn is an irredundant representation of R by ∩-irreducible elements.
Proposition 2.23**.**
Let R⊂S be an FCP arithmetic B-extension extension. Then, the Goldie dimension of [R,S] is n:=∣MSuppR(S/R)∣.
Proof.
For each Mi∈MSupp(S/R) there exists a unique Ei′∈[R,S] such that (Ei′)Mi=RMi and (Ei′)M=SM for M=Mi.
Set E′:=E1′∩…∩En′. For each i, we get that (Ei′)Mi=RMi, so that E′=R is the intersection of ∣MSupp(S/T)∣ distinct elements of [R,S]. The uniqueness of these elements is obvious.
We claim that the Ei′ are ∩-irreducible. Let T,T′∈[R,S] be such that Ei′=T∩T′. Then we have R⊂Ei′⊆T,T′, giving (Ei′)M=SM=TM=TM′(∗) for each M∈Max(R)∖{Mi}, and RMi=(Ei′)Mi⊆TMi,TMi′. Since R⊂S is arithmetic, TMi and TMi′ are comparable, and so are T and T′ by (∗). It follows that Ei′ is the least element of {T,T′}, and then is ∩-irreducible
so that
n is the Goldie dimension of [R,S] by Proposition 2.22.
∎
Remark 2.24**.**
Using [11, Remark 3.4(b)], we exhibit a non B-extension, for which some statements of Proposition 2.21 do not hold.
We now summarize the context of the above quoted remark.
Let R be a two-dimensional Prüfer domain with exactly two height-2 maximal ideals, N and N′, each of which containing the unique height 1 prime ideal P of R. Set R0:=R,R1:=RN,R1′:=RN′,R2:=RP and R3:=K, the quotient field of R. Since each overring of a Prüfer domain is an intersection of localizations [19, Theorem 26.2], it is easy to check that R0⊂R1,R0⊂R1′,R1⊂R2,R1′⊂R2 and R2⊂R3 are Prüfer minimal extensions.
Moreover, C(R0,R1)=N′,C(R1,R2)=NRN and C(R2,R3)=P, which is an ideal of R2 because P=(R0:R2). It follows that Supp(K/R)={P,N,N′} and MSupp(K/R)={N,N′}. By Proposition 2.20, the map φ is not bijective, since R/P is not local. The poset T={R1,R1′} is a tree. Moreover, [RN,KN]={RN,RP,K}={R1,R2,R3} and [RN′,KN′]={RN′,RP,K}={R1′,R2,R3} are chains. However, φN(T)={R1,R2}, because (RN′)N=RP. Then, Proposition 2.21(1) is not satisfied. In the same way, Proposition 2.21(2) is not satisfied, because K is not a product of elements of T. In particular, some Π-irrreducible element as R3=K of [R,S] is not in T.
The conditions of Proposition 2.21 hold in the following context and provide us a structure of Boolean lattices in Proposition 3.14.
Proposition 2.25**.**
Let R⊂S be an FCP extension. Assume that Supp(T/R)∩Supp(S/T)=∅ for all T∈[R,S]. Then:
(1)
Supp(S/R)⊆Max(R)* and R⊆S is a B-extension.*
2. (2)
T*
is an antichain.*
Proof.
(1) Assume that Supp(T/R)∩Supp(S/T)=∅ for all T∈[R,S]. We use Proposition 2.20 to show that φ is a bijection. Let P∈Supp(S/R). Consider a maximal chain C:R=R0⊂⋯⊂Ri⊂⋯⊂Rn=S, where Ri−1⊂Ri is minimal for each i∈Nn. Since P∈Supp(S/R), there exists some k∈Nn such that P=N∩R, where N:=C(Rk−1,Rk), in view of Lemma 2.14. In particular, P∈Supp(Rk/R), and, more precisely, P∈Supp(Rk/Rk−1)⊆Supp(S/Rk−1). Assume that P is not a maximal ideal, and let M∈Max(R) be such that P⊂M. Then, M∈Supp(Rk/R). Moreover, there is some j<k such that M=N′∩R, where N′:=C(Rj−1,Rj). Indeed, j=k because N∩R=P=M. Therefore M∈Supp(Rj/R)⊆Supp(Rk−1/R), since j≤k−1 and M∈Supp(Rk−1/R)∩Supp(S/Rk−1) is absurd. Hence, Supp(S/R)⊆Max(R), and φ is a bijection by Proposition 2.20.
(2) Let T,T′∈T be such that T′⊂T and M∈Max(R) such that Supp(T/R)={M}.
Since T′⊂T, we get that Supp(T′/R)⊆Supp(T/R), giving Supp(T′/R)={M}. But, ∅=Supp(T/T′)⊆Supp(T/R)={M} implies that {M}=Supp(T/T′)⊆Supp(S/T′). Therefore, M∈Supp(T′/R)∩Supp(S/T′)=∅, a contradiction. Then, two distinct elements of T are incomparable, and T is an antichain.
∎
Let R⊂S be an FCP extension. In the following, we will meet the condition that Supp(T/R)∩Supp(S/T)=∅ for some T∈[R,S]. Here is a theorem which gives a stronger result.
Theorem 2.26**.**
If R⊂S has FCP, then Supp(T/R)∩Supp(S/T)=∅ for all T∈[R,S] if and only if
R⊂S is locally minimal.
In this case, R⊂S is an FIP factorial extension.
Proof.
Assume that Supp(T/R)∩Supp(S/T)=∅ for all T∈[R,S]. By Propositions 2.25 and 2.21, R⊂S is arithmetic. Let T∈[R,S], there is U∈[R,S] such that U∩T=R and UT=S [28, Lemma 3.7], which gives UM∩TM=RM and UMTM=SM for each M∈MSupp(S/R), so that {UM,TM}={RM,SM}, whence, RM⊂SM is minimal.
Conversely, if there exists some N∈MSupp(T/R)∩MSupp(S/T) for some T∈[R,S],
we get that TN=RN,SN, so that ∣[RN,SN]∣≥2. But RN⊂SN is minimal,
a contradiction.
If these conditions hold, then R⊆S has FIP by Theorem 2.19, and is factorial by Propositions 2.21 and 2.16.
∎
3. Boolean FCP extensions
3.1. General properties of Boolean extensions
Let R⊆S be an extension and T∈[R,S]. Then, T′∈[R,S] is called a complement of T if T∩T′=R and TT′=S. If R⊆S is distributive, then T has at most one complement [24, Exercise 9, page 33]. We denote this complement by T∘ when it exists.
We recall that R⊆S is Boolean if and only if R⊆S is distributive and each T∈[R,S] has a (unique) complement T∘ [32, Definition page 129].
In a Boolean FIP extension R⊆S, any T∈]R,S[ is, in a unique way, a product of finitely many atoms and the intersection of finitely many co-atoms. To see this, use Lemma 2.10, [32, Theorems 5.1 and 6.3], and the fact that [R,S] is a complete Boolean lattice. In particular, if A is an atom, then A∘ is a co-atom [32, Theorem 3.43]. Next Theorem characterizes Boolean FCP extensions amid distributive FCP extensions:
Theorem 3.1**.**
Let R⊆S be an FCP distributive extension and set n:=ℓ[R,S]. Then, the following conditions are equivalent:
(1)
R⊆S* is a Boolean extension.*
2. (2)
n=∣A∣, where A is the set of atoms of [R,S].
3. (3)
∣[R,S]∣=2n.
If these conditions hold, then R⊆S is FIP factorial
and a simple pair.
Moreover, for each T,U∈[R,S] with T⊆U, all maximal chains of [T,U] have the same length.
Proof.
To begin with, R⊆S has FIP by Lemma 2.10. Moreover, [R,S] has exactly nΠ-irreducible element by Lemma 2.10. Since any atom is Π-irreducible, the equivalences of (1), (2) and (3) are a translation of the equivalences given in [33, page 292].
If these conditions hold, then R⊆S is factorial and a simple pair by Theorem 2.11.
Since a Boolean lattice is a distributive lattice, the last results comes from Proposition 2.5.
∎
Example 3.2**.**
(1) An extension R⊂S is Boolean and chained if and only if it is minimal. One implication is obvious. Conversely, assume that [R,S] is chained and a Boolean lattice. If there is some T∈]R,S[, it has a complement T′. Then, T∩T′=R and TT′=S implies {T,T′}={R,S} since T and T′ are comparable, a contradiction.
(2) Let R⊂S be a Boolean FCP extension and x∈S∖R. We intend to compute R[x]∘. Let CA:={B1,…,Bn}.
Then R[x]=∩[Bα∈Y] for a unique family Y:={Bα} of co-atoms ([32, Theorem 6.3]), so that x∈Bα for each Bα∈Y. Let Bβ∈CA which does not contain x. Then R[x]⊆Bβ
and Y is the set of co-atoms containing x. Now, (R[x])∘=(∩[Bα∈Y])∘=Π[(Bα)∘∣Bα∈Y], where the (Bα)∘ are atoms. Then, (R[x])∘ is the product of atoms which are complements of the co-atoms containing x. But we also have (R[x])∘=∩[Bβ∈CA∖Y]. Indeed, set T:=∩[Bβ∈CA∖Y]. Obviously, R[x]∩T=R and assume that R[x]T=S, so that R[x]T=∩[Bγ∈X] for some X⊆CA. Let Bγ∈X. Then, R[x]=∩[Bα∈Y]⊆Bγ implies Bα=Bγ for some Bα∈Y. In the same way, Bβ=Bγ for some Bβ∈CA∖Y, a contradiction. Then, R[x]T=S and T=(R[x])∘.
(3) By Theorem 3.1, an FCP Boolean extension R⊂S verifes ∣[R,S]∣=2n, where n=ℓ[R,S]. But an extension R⊆S may be distributive with ∣[R,S]∣=2n for some integer n without being Boolean. It is enough to consider a chained extension of length 2n−1.
The following lemma is needed for the next proposition.
See the close notion of patching due to Dobbs-Shapiro [15].
Lemma 3.3**.**
Let R⊆S be an FCP extension and M∈MSupp(S/R). For any T′∈[RM,SM] such that RM⊂T′ is minimal, there exists T∈[R,S] such that R⊂T is minimal with TM=T′.
Proof.
Let φ:S→SM be the canonical ring morphism and set T′′:=φ−1(T′). Then T′′∈[R,S] is such that T′=TM′′=RM, so that M∈MSupp(T′′/R).
From Lemma 2.15 we deduce the existence of some T∈[R,T′′]⊆[R,S] such that R⊂T is minimal with M=C(R,T). Hence, RM⊂TM⊆TM′′=T′ gives TM=T′.
∎
Proposition 3.4**.**
Let R⊆S be an FCP extension. The following statements are equivalent:
(1)
R⊆S* is Boolean.*
2. (2)
RM⊆SM* is Boolean for each M∈MSupp(S/R).*
3. (3)
RP⊆SP* is Boolean for each P∈Supp(S/R).*
4. (4)
R/I⊆S/I* is Boolean for each ideal I shared by R and S.*
5. (5)
R/I⊆S/I* is Boolean for some ideal I shared by R and S.*
Proof.
We have obviously (1) ⇒ (3) ⇒ (2) and (1) ⇔ (4)
⇒ (5) ⇒ (1).
Conversely, assume that RM⊆SM is Boolean for each M∈MSupp(S/R). Then, RM⊆SM is Boolean for each M∈Max(R). It follows that the distributivity property holds in [R,S] since it holds in any [RM,SM]. It remains to show that any T∈[R,S] has a complement. Let M∈MSupp(S/R). Then, TM has a complement (TM)∘
in [RM,SM] satisfying TM∩(TM)∘=RM(∗) and TM(TM)∘=SM(∗∗). Since [RM,SM] is Boolean, any of its element is a product of its atoms [32, Theorem 5.2]. Then, (TM)∘=∏i∈IMRi,M′, where the Ri,M′ are atoms of [RM,SM], that is RM⊂Ri,M′ is minimal. By Lemma 3.3, for each Ri,M′∈[RM,SM], there is Ri,M∈[R,S] such that R⊂Ri,M is minimal, with Ri,M′=(Ri,M)M. In particular, (Ri,M)M′=RM′ for each M′∈MSupp(S/R)∖{M}. Setting T′:=∏M∈MSupp(S/R)(∏i∈IMRi,M), we get, for each M∈MSupp(S/R) that TM′=∏i∈IMRi,M′=(TM)∘, so that (∗) and (∗∗) give TM∩TM′=RM and TMTM′=SM, and, to end, T∩T′=R and TT′=S showing that T′ is the complement of T. Therefore, R⊆S is Boolean.
∎
Corollary 3.5**.**
Let R⊂S be an FIP extension.
The following statements are equivalent:
(1)
R⊂S* is atomistic and arithmetic;*
2. (2)
R⊂S* is Boolean and arithmetic;*
3. (3)
R⊂S* is locally minimal.*
Assume that these conditions hold and let the
set of atoms be A={A1,…,Aa} where a is some integer. Then, the complement of any T=∏i∈IAi∈[R,S], where I⊆Na, is T∘:=∏j∈JAj where J:=Na∖I. If in addition R⊂S is integral, then ℓ[R,S]=∣MSupp(S/R)∣.
Proof.
(1) ⇒ (2) by Proposition 2.3 and the equivalences given in [33, page 292],
(2) ⇒ (1) by [32, Theorem 5.2] and
(2) ⇔ (3) by Proposition 3.4 and Example 3.2(1).
Assume that these conditions hold.
We observe that S is the product of all atoms.
Let T=∏i∈IAi∈[R,S], where I⊆Na. Since T∘ is a product of atoms, the relations T∩T∘=R and TT∘=S give
T∘:=∏j∈JAj where J:=Na∖I.
In case R⊆S is integral, we use ℓ[R,S]=∑M∈MSupp(S/R)ℓ[RM,SM] [12, Proposition 4.6].
∎
Next proposition uses the notation of [4, Proposition 10, p.52].
Proposition 3.6**.**
Let R⊂S be a ring extension, f:R→R′ a faithfully flat ring morphism and S′:=R′⊗RS. Assume that R′⊂S′ is distributive. Then,
(1)
R⊂S* is distributive.*
2. (2)
Let T∈[R,S] be such that R′T is Π-irreducible (resp. an atom) in [R′,S′]. Then, T is Π-irreducible (resp. an atom) in [R,S].
3. (3)
In case R′T is Π-irreducible for any Π-irreducible T∈[R,S] and R′⊂S′ is an FIP Boolean extension, so is R⊂S.
Proof.
(1) The ring morphism φ:S→S′ defines a map θ:[R′,S′]→[R,S] while there is a map ψ:[R,S]→[R′,S′], defined by ψ(T)=R′⊗RT and such that θ∘ψ is the identity of [R,S] by [4, Proposition 10, p.52] (it is enough to take F=S and to observe that if M is an R-submodule of S, then with the notation of the above reference, R′M identifies to M⊗RR′). In particular, ψ is injective. The same reference shows that ψ(T∩U)=ψ(T)∩ψ(U) for U,T∈[R,S]. It is easy to show that ψ(TU)=ψ(T)ψ(U). If R′⊂S′ is distributive, it follows that for T,U,V∈[R,S], we get ψ[T(U∩V)]=ψ(T)[ψ(U)∩ψ(V)]=[ψ(T)ψ(U)]∩[ψ(T)ψ(V)]=ψ[(TU)∩(TV)], giving T(U∩V)=(TU)∩(TV). Then, R⊂S is distributive.
(2) Let T∈[R,S] be such that R′T is Π-irreducible in [R′,S′] and let U,V∈[R,S] be such that T=UV. Then, R′T=(R′U)(R′V), so that either R′T=R′U, or R′T=R′V, which implies either T=U, or T=V and T is Π-irreducible in [R,S].
Let T∈[R,S] be such that R′T is an atom in [R′,S′]. Assume that T is not an atom in [R,S]. There exists U∈]R,T[ which yields R′⊂R′U⊂R′T, a contradiction. Then, T is an atom in [R,S].
(3) Assume that R′T is Π-irreducible in [R′,S′] for any Π-irreducible T∈[R,S]. This holds if θ (or ψ) is bijective. If R′⊂S′ is an FIP Boolean extension, any Π-irreducible element of [R′,S′] is an atom in [R′,S′] in view of [33, page 292]. Moreover, R⊂S is also an FIP extension since θ is surjective. Let T∈[R,S] be Π-irreducible in [R,S]. Then, R′T is Π-irreducible in [R′,S′]. Then R′T is an atom in [R′,S′], so that T is an atom in [R,S] by (2). Since Π-irreducible elements of [R,S] are atoms, the same reference shows that R⊂S is Boolean.
∎
Proposition 3.7**.**
An FCP extension R⊂S, whose Nagata extension R(X)⊂S(X) has FIP and is Boolean, has FIP and is Boolean.
Proof.
In view of ([12, Corollary 3.5]), R⊂S is an FCP extension implies that S(X)=R(X)⊗RS, so that we can use Proposition 3.6 because R(X)⊂S(X) is distributive. Since R(X)⊂S(X) has FIP, the map ψ:[R,S]→[R(X),S(X)] defined by ψ(T)=T(X) in Proposition 3.6 is an order -isomorphism by [13, Theorem 32]. Let T∈[R,S] be Π-irreducible. Then, ψ(T)=T(X)=TR(X) is Π-irreducible, so that R⊂S is Boolean by Proposition 3.6.
∎
Proposition 3.8**.**
Let R⊂S be a ring extension, f:R→R′ a flat ring epimorphism and S′:=R′⊗RS.
If R⊂S is a distributive extension (resp. a FIP Boolean extension), then so is R′⊂S′.
Proof.
The proof is a consequence of the following facts. Let f:R→R′ be a flat epimorphism and Q∈Spec(R′), lying over P in R, then RP→RQ′ is an isomorphism. Moreover, we have
(R′⊗RS)Q≅RQ′⊗RPSP, so that RP→SP identifies to RQ′→(R′⊗RS)Q=SQ′.
Assume that R⊂S is distributive (resp.: FIP Boolean). Then, so is RP→SP for each P∈Spec(R) by Proposition 2.4 (resp. Proposition 3.4 and [11, Proposition 3.7]). Let Q∈Spec(R′) and P:=f−1(Q)∈Spec(R). Since RP→SP identifies to RQ′→SQ′, we get that RQ′⊂SQ′ is distributive (resp.; FIP Boolean) for each Q∈Spec(R′). It follows that R′⊂S′ is distributive (resp.: FIP Boolean) by the same references. Indeed, in the FIP Boolean case, since R⊂S has FIP, so has R′⊂S′, because Spec(R′)→Spec(R) is injective.
∎
Proposition 3.9**.**
Let R⊂S be an FCP distributive extension. The following statements are equivalent:
(1)
R⊂S* is Boolean;*
2. (2)
Any Π-irreducible element is an atom;
3. (3)
Any ∩-irreducible element is a co-atom.
Proof.
(1) ⇒ (2) and (3). Assume that R⊂S is Boolean. By [32, Theorem 5.2], the Π-irreducible elements of [R,S] are the atoms of
[R,S]. Using complements, we deduce that the ∩-irreducible elements of [R,S] are the co-atoms of
[R,S].
(2) ⇒ (1) by the equivalences given in [33, page 292] since R⊂S has FIP by Lemma 2.10.
(3) ⇒ (2)
It is enough to exchange products and intersections, and atoms and co-atoms.
∎
Theorem 3.10**.**
Let R⊂S be an FCP extension. The following statements are equivalent, each of them implying that R⊂S has FIP:
(1)
R⊂S* is Boolean;*
2. (2)
R⊂S* is factorial;*
3. (3)
R⊂S* is co-factorial.*
Proof.
(1) ⇒ (2)
by Theorem 3.1 and (1) ⇒ (3) because,
by Proposition 2.9, any T∈[R,S] is a finite intersection of ∩-irreducible elements, and then a finite intersection of co-atoms of [R,S] by Proposition 3.9.
(2) ⇒ (1). By Theorem 2.11, R⊂S is an atomistic distributive FIP extension.
Then, use the equivalences given in [33, page 292].
(3) ⇒ (2)
It is enough to exchange products and intersections, and atoms and co-atoms.
∎
Proposition 3.11**.**
[17, Theorems 107 and 158]** Let R⊂S be a Boolean extension. Then, U⊂T is Boolean for any U,T∈[R,S] such that U⊆T and the complement of V∈[U,T] in [U,T] is U(T∩V∘).
We can now generalize Ayache’s result [3, Theorem 7] in case of an arbitrary ring extension.
Proposition 3.12**.**
When R⊂S has a maximal chain of length n from R to S such that ∣Supp(S/R)∣=∣MSupp(S/R)∣=n, then R⊂S is FIP Boolean, any maximal chain of [R,S] has length n and ∣[R,S]∣=2n.
Proof.
Let R0:=R⊂…⊂Ri⊂…⊂Rn:=S be a maximal chain of R-subalgebras of length n. For each i∈Nn, set Mi−1:=C(Ri−1,Ri)∩R. Then, Supp(S/R)={Mi}i=0n−1⊆Max(R) in view of Lemma 2.14. It follows that Mi=Mj for each i=j, so that RMi=(Ri)Mi⊂(Ri+1)Mi=SMi is minimal (and then has FIP), so that R⊂S has FIP by [11, Proposition 3.7]. Now, RMi⊆SMi is Boolean (see Example 3.2(1)), and so is R⊆S by Proposition 3.4. The last results follow from Theorem 3.1.
∎
Let R⊂S be an FCP Boolean extension and let R0:=R⊂…⊂Ri⊂…⊂Rn:=S be a maximal chain of R-subalgebras of S. By Proposition 3.11, R⊂Rn−1 is an Boolean FCP extension and Rn−1⊂S is minimal. Next theorem gives a kind of converse which allows us to check by induction that an FIP extension is Boolean.
Theorem 3.13**.**
An FIP extension R⊂S, which is not minimal, is Boolean if and only if there exist U,T∈]R,S[ such that the conditions (1),(2),(3) and (4) hold, if and only if there exist U,T∈]R,S[ such that the conditions (1),(4) and (5) hold:
(1)
[R,S]=[R,T]∪[U,S].
2. (2)
[U,S]={UL∣L∈[R,T]}.
3. (3)
L⊂UL* is a minimal extension for each L∈[R,T].*
4. (4)
[R,T]* is a Boolean lattice.*
5. (5)
The map φ:[R,T]→[U,S] defined by φ(L)=UL, for L∈[R,T], is bijective.
Moreover, if these conditions hold, U is an atom, T=U∘ is a co-atom. In fact, these conditions hold for any atom U′ and its complement T′, and [R,T′]∩[U′,S]=∅.
Proof.
Assume that R⊂S has FIP
and is not minimal. Set A:={A1,…,An}.
We will prove the Theorem in four steps:
(a) R⊂S is Boolean ⇒ (1)+(2)+(3)+(4).
(b) (1)+(2)+(3)+(4) ⇒ (1)+(4)+(5).
(c) (1)+(4)+(5) ⇒ (1)+(2)+(3)+(4).
(d) (1)+(2)+(3)+(4)+(5) ⇒R⊂S is Boolean.
(a) Assume that R⊂S is Boolean.
Set U:=A1∈[R,S] and T:=U∘∈[R,S], the complement of U, so that U∩T=R and UT=S. Moreover, T=∏i=2nAi [32, Theorems 3.43 and 5.1].
(1) Let L∈[R,S] and assume that L∈[U,S]. We have U⊆L∘, the complement of L [32, Theorem 5.1] and U⊆L∘ implies L⊆T by [32, Theorem 5.1], so that L∈[R,T]. Hence (1) is proved. Moreover, [R,T]∩[U,S]=∅ because U⊆L⊆T, for some L∈[R,T]∩[U,S] leads to the contradiction U∩T=U=R.
(2) Each element of [R,S] is a product of some Ais by Theorem 3.10. Let L′:=∏i∈IAi∈[U,S] for some I⊆Nn. Then, 1∈I because U⊆L′ (if not, U∩L′=R=U is absurd). In particular, L′=UL, where L:=∏i∈I∖{1}Ai⊆T and (2) follows since UL∈[U,S].
(3) Let L:=∏i∈IAi∈[R,T], so that 1∈I by (1). Then, UL=∏i∈I∪{1}Ai. Let L′∈[L,UL]. There exists some J⊆Nn such that L′:=∏i∈JAi. By the uniqueness of this writing, I⊆J⊆I∪{1}, so that we have either I=J or J=I∪{1}, giving either L′=L or L′=UL. It follows that L⊂UL is minimal and (3) holds.
(4) By Proposition 3.11R⊂T is Boolean. Remark that (1), (2), (3) and (4) hold for any atom U′ with complement T′.
In fact, we have the following diagram:
R↓U→→L↓UL→→T↓S
(b)
Assume that (1)+(2)+(3)+(4) holds. Then φ is surjective by (2). Let L,L′∈[R,T] be such that φ(L)=φ(L′), that is UL=UL′. Since L,L′⊆T, we get that LL′∈[R,T]. Moreover, U(LL′)=(UL)(UL′)=UL. Then, L,L′⊆LL′⊆UL=UL′ gives by (3) either LL′=UL=UL′, so that LL′=L=L′ or LL′=UL∈[U,S].
But, in this last case, UL=LL′⊂ULL′=UL is minimal, a contradiction, because LL′∈[R,T].
Then,
φ is bijective and (5) holds.
(c)
Assume that (1)+(4)+(5) holds. Then (2) holds by (5). Let L∈[R,T]. Since UL∈[U,S], we get L=UL.
Deny, so that U⊆L⊆T yields S=UT=T, a contradiction.
Assume that there exists some L′∈]L,UL[. It follows that UL⊂UL′⊂U(UL)=UL, a contradiction. Then,
L⊂UL is minimal, giving (3).
(d) Assume
that
(1)+(2)+(3)+(4)+(5)
holds for some U,T∈[R,S] and that [R,T]∩[U,S]=∅. If L∈[R,T]∩[U,S], then L=UL is a contradiction with (3). So, [R,T]∩[U,S]=∅. We are going to prove that [R,S] is a complemented distributive lattice. We first show that T is the complement of U. We get that R⊂U is minimal by (3), so that R=U∩T, because U∩T=U would imply U⊆T, a contradiction. Indeed, UT=S by (2) because the map [R,T]→[U,S] defined by L↦UL is increasing. Then, T is a complement of U.
Now, conditions (1), (2)
and (5) show that [R,S] is a decomposable lattice, that is for any L∈[R,S], there is a unique pair (L1,L2)∈[R,T]×[R,U] such that L=L1L2 (see [36, p.57]). Set L1:=L and L2:=R when L∈[R,T]. Set L2:=U and take L1∈[R,T] such that L=φ(L1) when L∈[U,S]. The uniqueness of such (L1,L2) is obvious in each case. Then, [R,S] is isomorphic as a lattice to [R,T]×[R,U]. In particular, since [R,T] and [R,U] are each Boolean, and then distributive, so is [R,S] by [36, Proposition 3.5.1].
Let L∈[R,S]=[R,T]∪[U,S]. Assume first that L∈[R,T] with complement L′′ in [R,T] because R⊆T is Boolean, so that L∩L′′=R and LL′′=T. Setting L′:=L′′U, we get LL′=LL′′U=TU=S.
Moreover L∩L′=L∩L′′U=(L∩L′′)(L∩U)=R. Then, L′ is a complement of L in [R,S].
Now, assume that L∈[U,S]. Set L′′=L∩T∈[R,T], and let L′∈[R,T] be its complement in [R,T]. Then, L∩L′=L∩L′∩T=L′′∩L′=R. Moreover, LL′=LUL′⊇UL′′L′=UT=S gives that LL′=S. Then, L has a complement in [R,S].
So, any element of [R,S] has a complement in [R,S], which is unique by distributivity.
To conclude, R⊂S is Boolean.
∎
We are now in position to generalize and improve Ayache’s result [2, Theorem 38] for an arbitrary FIP extension, using a completely different method. We will need next results.
Proposition 3.14**.**
An FCP extension R⊂S, such that Supp(T/R)∩Supp(S/T)=∅ for all T∈[R,S], is a Boolean extension.
Proof.
By Theorem 2.26, RM⊂SM is minimal, whence Boolean for M∈MSupp(S/R), so that R⊂S is Boolean by Proposition 3.4.
∎
Proposition 3.15**.**
Let R⊂S be an FCP extension and let T∈[R,S] such that MSupp(S/T)∩MSupp(T/R)=∅. Then R⊂S is Boolean if and only if R⊂T and T⊂S are Boolean.
Proof.
Assume first that R⊆T and T⊆S are Boolean. Let M∈MSupp(S/R). Then either M∈MSupp(S/T)(∗) or M∈MSupp(T/R)(∗∗). In case (∗), M∈MSupp(T/R), so that TM=RM. Hence, [RM,SM]=[TM,SM] is Boolean by Proposition 3.4. In case (∗∗), M∈MSupp(S/T), so that TM=SM. Then, [RM,SM]=[RM,TM] is Boolean by Proposition 3.4. Therefore, [RM,SM] is Boolean for each M∈MSupp(S/R), and Proposition 3.4 gives that R⊂S is Boolean.
An FIP extension R⊂S is Boolean if and only if (1) and (2) hold, in which case R is the complement of R:
(1)
Supp(R/R)∩Supp(S/R)=∅.
2. (2)
[R,R]* and [R,S] are Boolean lattices.*
Proof.
If [R,S] is Boolean, set T:=(R)∘. Then R∩T=R and RT=S, so that Supp(R/R)∩Supp(S/R)=∅ [28, Proposition 3.6], and (1) holds. The same proposition shows that R=(R)∘.
Now (2) results from Proposition 3.15.
Conversely, assume that (1) and (2) hold. Then, Proposition 3.15 implies that [R,S] is Boolean.
∎
We get a generalization of Ayache’s result [2, Theorem 38] as a corollary thanks to the following lemma.
Lemma 3.17**.**
Let R⊂S be an FCP extension. Set X:={(T′,T′′)∈[R,R]×[R,S]∣SuppT′(R/T′)∩SuppT′(T′′/R)=∅}. There is a bijection φ:[R,S]→X defined by φ(T):=(T∩R,RT) for each T∈[R,S]. In particular, if R⊂S has FIP, then ∣[R,S]∣≤∣[R,R]∣∣[R,S]∣.
Proof.
Let (T′,T′′)∈[R,R]×[R,S]. Then, R is also the integral closure T′ of T′ in T′′ (and in S).
Let T∈[R,S]. Set T′:=T∩R and T′′:=RT. Then (T′,T′′)∈[R,R]×[R,S]. If T′=T′′, then T′=T′′=R implies T=R and SuppT′(R/T′)=SuppT′(T′′/R)=∅. Now assume that T′=T′′, then SuppT′(R/T′)∩SuppT′(T′′/R)=∅ [28, Proposition 3.6]. Hence we can define φ:[R,S]→X by φ(T):=(T∩R,RT) for each T∈[R,S].
Now, let T1,T2∈[R,S] be such that φ(T1)=φ(T2)=(T′,T′′). Assume T′=T′′. Another use of [28, Proposition 3.6] gives that T1=T2. If T′=T′′, then, T′=T′′=R, so that T1=T2=R. It follows that φ is injective. The same reference gives that φ is bijective.
∎
Corollary 3.18**.**
The extension R⊂S is FIP Boolean if and only if the two following conditions hold:
(1)
R⊆R* and R⊆S are FIP Boolean extensions.*
2. (2)
∣[R,S]∣=∣[R,R]∣∣[R,S]∣.
Proof.
If R⊂S is FIP Boolean, Proposition 3.11 implies that so are R⊆R and R⊆S,
giving (1). Since Supp(R/R)∩Supp(S/R)=∅ by Theorem 3.16, we infer that ∣[R,S]∣=∣[R,R]∣∣[R,S]∣ [28, Lemma 3.7].
Conversely, assume that conditions (1) and (2) (which are equivalent to those of Theorem 3.16 because R⊂S has FIP) hold. The map φ defined in Lemma 3.17 being injective, condition (2) shows that φ([R,S])=[R,R]×[R,S]. Therefore, there is T∈[R,S] such that φ(T)=(R,S), inducing by the properties of φ that SuppR(R/R)∩SuppR(S/R)=∅, (actually, the condition of Theorem 3.16(1), asserting that R⊂S is Boolean).
∎
Corollary 3.19**.**
Let R⊂S be an FIP Boolean extension, where R is a local ring. Then, R⊂S is either Prüfer, or integral.
By Corollary 3.19 and Proposition 3.4, the characterization of Boolean FIP extension R⊆S can be reduced to those that are either Prüfer or integral, with R local.
For the Prüfer case, we recover and generalize some Ayache’s results on extensions of integral domains [2, Proposition 35].
Proposition 3.20**.**
An integrally closed extension R⊆S is Boolean and FIP if and only if R⊆S is a Prüfer extension and ∣Supp(S/R)∣=∣MSupp(S/R)∣<∞. If these conditions hold, ∣[R,S]∣=2∣Supp(S/R)∣.
Proof.
Assume first that
∣Supp(S/R)∣=∣MSupp(S/R)∣<∞ and that R⊆S is Prüfer. From [11, Proposition 6.9], we infer that R⊆S has FIP. Moreover, we proved in [11, Proposition 6.12], that, under these conditions, ∣[RM,SM]∣=2 for each M∈Supp(S/R), so that RM⊂SM is Boolean for each M∈Supp(S/R) by Example 3.2(1), and then [R,S] is Boolean by Proposition 3.4. From [11, Proposition 6.12], we deduce that ∣[R,S]∣=2∣Supp(S/R)∣.
Conversely, suppose that R⊆S is Boolean and has FIP. Then, [11, Proposition 6.9] implies that R⊆S is Prüfer and Supp(S/R) is finite. Since R⊆S is Boolean, so is RM⊂SM for each M∈Supp(S/R) by Proposition 3.4. But, [RM,SM] is chained [11, Theorem 6.10]. It follows that RM⊂SM is minimal for each M∈Supp(S/R) by Example 3.2 (1), so that ∣SuppRM(SM/RM)∣=1 for each M∈Supp(S/R) and then Supp(S/R)⊆MSupp(S/R) completes the proof.
∎
Corollary 3.21**.**
An integrally closed FIP extension R⊂S, with MSupp(S/R):={M1,…,Mn}, is Boolean if and only if R⊂S is locally minimal. In this case,
R⊂S is a B-extension.
Proof.
The two properties are equivalent by the proof of the above proposition. Since Supp(S/R)=MSupp(S/R) holds in this case, [11, Theorem 3.6] shows that φ is a bijection.
∎
The following definitions are needed for the sequel.
Definition 3.22**.**
An integral extension R⊆S is called infra-integral [26] (resp.;subintegral [34]) if all its residual extensions κR(P)→κS(Q), (with Q∈Spec(S) and P:=Q∩R) are isomorphisms (resp.;and the natural map Spec(S)→Spec(R) is bijective). An extension R⊆S is called t-closed (cf. [26]) if the relations b∈S,r∈R,b2−rb∈R,b3−rb2∈R imply b∈R. The t-closureStR of R in S is the smallest element B∈[R,S] such that B⊆S is t-closed and the greatest element B′∈[R,S] such that R⊆B′ is infra-integral. An extension R⊆S is called seminormal (cf. [34]) if the relations b∈S,b2∈R,b3∈R imply b∈R. The seminormalizationS+R of R in S is the smallest element B∈[R,S] such that B⊆S is seminormal and the greatest element B′∈[R,S] such that R⊆B′ is subintegral.
The extension R⊆S+R⊆StR⊆R⊆S is called the canonical decomposition of R⊆S.
Three types of minimal integral extensions exist, characterized in the next theorem, (a consequence of the fundamental lemma of Ferrand-Olivier), so that there are four types of minimal extensions.
Theorem 3.23**.**
[11, Theorems 2.2 and 2.3]** Let R⊂T be an extension and M:=(R:T). Then R⊂T is minimal and finite if and only if M∈Max(R) and one of the following three conditions holds:
(a) inert case: M∈Max(T) and R/M→T/M is a minimal field extension.
(b) decomposed case: There exist M1,M2∈Max(T) such that M=M1∩M2 and the natural maps R/M→T/M1 and R/M→T/M2 are both isomorphisms; or, equivalently, there exists q∈T∖R such that T=R[q],q2−q∈M, and Mq⊆M.
(c) ramified case: There exists M′∈Max(T) such that M′2⊆M⊂M′,[T/M:R/M]=2, and the natural map R/M→T/M′ is an isomorphism; or, equivalently, there exists q∈T∖R such that T=R[q],q2∈M, and Mq⊆M.
It remains to solve [2, Problem 45]: under which conditions an integral extension R⊂S is Boolean and has FIP? The study is quite complicated. We are going to use the canonical decomposition of an integral ring extension
and Proposition 3.4 which allows us to only
consider local rings R.
Proposition 3.24**.**
Let R⊂S be an integral FIP Boolean extension where R is local. Then, R⊂S is either infra-integral or t-closed.
Proof.
Let T:=StR be the t-closure of the local ring (R,M) in S, and let T∘∈[R,S] be its complement. Let T′ be the t-closure of R in T∘, so that R⊆T′ is infra-integral, and then T′⊆T. It follows that T′⊆T∘∩T=R. Then T′=R and R⊆T∘ is t-closed. In the same way, let T′′ be the t-closure of T∘ in S, so that T′′⊆S is t-closed and then T⊆T′′. Hence S=T∘T⊆T′′, so that T′′=S and T∘⊆S is infra-integral.
Assume that R⊂S is neither t-closed, nor infra-integral, so that T,T∘=R,S. Then, there are R1∈[R,T] and R1′∈[R,T∘] such that R⊂R1 is minimal infra-integral, and R⊂R1′ is minimal inert, with both the same crucial maximal ideal M. By [14, Propositions 7.1 and 7.4], there are two maximal chains from R to R1R1′ with different lengths, and the same statement holds for R⊂S. This contradicts Condition (JH) of Proposition 2.5 since R⊂S is distributive. Then, R⊂S is either infra-integral, or t-closed.
∎
Remark 3.25**.**
Proposition 3.24 is no longer true if R is not local. Take a ring R with two distinct maximal ideals M1 and M2, and two minimal extensions R⊂T1 ramified and R⊂T2 inert with M1:=C(R,T1) and M2:=C(R,T2). Assume that S:=T1T2 exists, so that RM1⊂SM1=(T1)M1 is minimal ramified, and then Boolean and RM2⊂SM2=(T2)M2 is minimal inert, and then Boolean. It follows from Proposition 3.4 that R⊂S is Boolean although being neither infra-integral nor t-closed. To get such a situation, we may take S:=Z[i],T2:=Z+2S,T1:=Z+3S and R:=T1∩T2=Z+6S. It is well known that 2 is ramified in S and 3 is inert in S. Then, T2⊂S is a minimal ramified extension with conductor 2S and T1⊂S is a minimal inert extension with conductor 3S. Moreover, 2S and 3S are incomparable.
Setting M1:=2S∩R=2T1 and M2:=3S∩R=3T2, [14, Proposition 6.6(a)] shows that R⊂T1 is minimal ramified and R⊂T2 is minimal inert with M1:=C(R,T1),M2:=C(R,T2) and S=T1T2.
We first
consider the infra-integral case for which we need the next lemma.
Lemma 3.26**.**
A subintegral FIP extension (resp. seminormal and infra-integral) R⊂S, where (R,M) is local, is Boolean if and only if R⊂S is minimal ramified (resp. decomposed).
Conversely, assume that [R,S] is a Boolean lattice. The atoms of [R,S] are of the form Ri:=R+Rxi, for i∈I:=Nn,n:=∣A∣, where xi∈S is such that xi2∈M (resp. xi2−xi∈M) and xiM⊆M, because R⊂Ri is minimal ramified (resp.; decomposed), with M=(R:Ri). Then, S=∏i∈IRi by Theorem 3.1. Let Mi:=M+Rxi be the (resp.; one) maximal ideal of Ri. Assume that n>1. Let i,j∈I be such that i=j, so that R=Ri∩Rj, with xixj∈RiRj. But, Ri⊂RiRj and Rj⊂RiRj are minimal Theorem 3.1, so that xi∈Mi=(Ri:RiRj) and xj∈Mj=(Rj:RiRj). In the decomposed case, we may choose xi and xj in order that Mi and Mj are the needed conductors. It follows that Mi and Mj are ideals of RiRj, and so is Mi∩Mj, which contains MiMj. But Mi∩Mj⊆Ri∩Rj=R. This implies that xixj∈Mi∩Mj=Mi∩R∩Mj=M, the maximal ideal of R. Then, xixj∈M, giving S=R+∑i∈IRxi. Set x:=xi+xj∈R and Rx:=R+Rx=Ri,Rj. We get that x2=xi2+xj2+2xixj∈M (resp. x2=xi+xj+m=x+m, where m∈M). Moreover, xM⊆xiM+xjM⊆M, so that R⊂Rx is minimal by Theorem 3.23, and Rx is an atom of [R,S]. But we have Rx⊆RiRj, so that Rx=Rx∩RiRj=(Rx∩Ri)(Rx∩Rj)=R, a contradiction. Then, n=1,S=R1 and R⊂S is minimal.
∎
It may be asked if extensions of Boolean rings and Boolean extensions are linked. Next result shows that they are quite never linked.
Proposition 3.27**.**
Let S be a Boolean ring and R a subring of S such that R⊂S is a finite extension. Then R⊂S is seminormal infra-integral and R⊂S is Boolean if and only if R⊂S is locally minimal.
Proof.
Since S is a Boolean ring, R⊂S is seminormal integral. Because a Boolean local ring is isomorphic to Z/2Z, the residual extensions of R⊂S are isomorphisms, so that R⊂S is infra-integral. Now, R⊂S is finite implies that it has FCP by [11, Theorem 4.2].
Assume that R⊂S is Boolean. Then, R⊂S has FIP by Theorem 3.1 because FCP distributive. Moreover, an appeal to Lemma 3.26 shows that
R⊂S is locally minimal.
Conversely, if R⊂S is locally minimal, then R⊂S is Boolean in view of Corollary 3.5. Indeed, R⊂S has FIP [11, Proposition 3.7].
∎
Next proposition gives a characterization of arbitrary infra-integral Boolean FIP extensions.
Proposition 3.28**.**
An infra-integral FIP extension R⊂S, where (R,M) is local, is Boolean if and only if there exist x,y∈S such that S=R[x,y], where x2,xy,y2−y∈M and xM,yM⊆M.
If these conditions hold, then R[x,y]=R[x+y].
Proof.
If R⊂S is subintegral, we choose y=0, if R⊆S is seminormal, we choose x=0. In both cases, we use Lemma 3.26 to get the equivalence. From now on, we assume that R⊂S is neither subintegral, nor seminormal.
Assume that R⊂S is Boolean and set T:=S+R=R,S. From Proposition 3.11, we deduce that [R,T] and [T,S] are Boolean . Then, R⊂T is minimal ramified, which implies that T is also local. It follows that T⊂S is minimal decomposed by Lemma 3.26, so that ℓ[R,S]=2, because all maximal chains of [R,S] have the same length ([11, Lemma 5.4]). If U:=T∘, then, U=R,S, so that R⊂U and U⊂S are minimal. Since U∩T=R, we get that R⊂U is decomposed, because it cannot be ramified. For the same reason, U⊂S is minimal ramified. Let x,y∈S be such that T=R[x] and U=R[y], so that S=R[x,y], where x2,y2−y∈M and xM,yM⊆M. Set M′:=M+Rx which is the only maximal ideal of T, so that M′=(T:S). Set M′′:=M+Ry∈Max(U). We can assume that M′′=(U:S). Then, xy∈M′∩M′′⊆T∩U∩M′=M.
Conversely, assume that there exist x,y∈S such that S=R[x,y], where x2,xy,y2−y∈M and xM,yM⊆M, so that M=(R:S). Set T:=R[x] and U:=R[y]. Then, R⊂T is minimal ramified and M+Rx is the maximal ideal of T, whereas, R⊂U is minimal decomposed and M+Ry∈Max(U). Moreover, T∩U=R and TU=S.
Since (M+Rx)(M+Ry)⊆M, it follows from [14, Proposition 7.6] that R⊂S is an FCP infra-integral extension of length 2, so that T⊂S is minimal decomposed and U⊂S is minimal ramified.
Hence, [R,S]={R,T,U,S} by [31, Theorem 6.1] and is Boolean by Theorem 3.13.
Assume that the preceding conditions hold, so that R⊂S is Boolean, whence simple by Theorem 3.1. Since R[x+y]=R,T,U,
we have S=R[x+y].
∎
We can now sum up the previous results in order to get a characterization of Boolean FIP extensions.
Theorem 3.29**.**
An FIP extension R⊂S is Boolean if and only if, for each M∈MSupp(S/R), one of the following conditions holds:
(1)
RM⊂SM* is a minimal extension.*
2. (2)
There exist U,T∈[RM,SM] such that RM⊂T is minimal ramified, RM⊂U is minimal decomposed and [RM,SM]={RM,T,U,SM}.
3. (3)
RM⊂SM* is a Boolean t-closed extension
(equivalently, RM⊂SM is t-closed and κR(M)⊂κS(N) is a Boolean field extension, where N is the only maximal ideal of S lying above M).*
Proof.
From Proposition 3.4, we deduce that [R,S] is Boolean if and only if, for each M∈MSupp(S/R),[RM,SM] is Boolean. An appeal to Corollary 3.19 shows that this statement is equivalent to the following: for each M∈MSupp(S/R), either RM⊂SM is Boolean and integrally closed (∗), or RM⊂SM is Boolean integral (∗∗). In case (∗) Corollary 3.21 gives that RM⊂SM is Boolean integrally closed if and only if RM⊂SM is Prüfer minimal. In case (∗∗), when RM⊂SM is integral, Proposition 3.24 says that RM⊂SM is Boolean if and only if either RM⊂SM is infra-integral Boolean (a), or RM⊂SM is t-closed Boolean (b). To sum up, if [R,S] is Boolean, for each M∈MSupp(S/R), either (∗) or (∗∗) (a) or (∗∗) (b) holds. Case (∗) implies (1). Case (∗∗) (a) implies either (1) or (2). Indeed, by Proposition 3.28, there exist x,y∈SM such that SM=RM[x,y], where x2,xy,y2−y∈MRM and xMRM,yMRM⊆MRM. Since M∈MSupp(S/R), we have RM=SM, so that either x∈RM or y∈RM. If both x,y∈RM, setting T:=RM[x] and U:=RM[y], we get (2). If only one of x,y∈RM, we get (1). Case (∗∗) (b) is (3). Conversely, if (1) holds, then RM⊂SM is Boolean by Example 3.2(1). If (2) holds, then RM⊂SM is Boolean by Proposition 3.28, setting T:=RM[x] and U:=RM[y] for some x∈T,y∈U such that x2,xy,y2−y∈MRM and xMRM,yMRM⊆MRM. At last, (3) is (∗∗) (b).
We now show that, for some M∈MSupp(S/R),RM⊆SM is Boolean t-closed is equivalent to RM⊆SM is t-closed and κ(M)⊂κ(N) is a Boolean field extension, where N is the only maximal ideal of S lying above M. Set R′:=RM,M′:=MRM and S′:=SM. Since R′⊂S′ is t-closed, M′=(R′:S′) and (S′,M′) is local, [12, Lemma 3.17].
It follows that there is only one maximal ideal N in S lying over M, so that SM=SN ([5, Proposition 2, page 40]) and κS(N)=S′/M′. Then κR(M)=R′/M′⊆S′/M′=κS(N) is an FIP field extension. Now, R′⊆S′ is Boolean if and only if R′/M′⊆S′/M′ is Boolean by Proposition 3.4.
∎
It follows that the remaining t-closed case can be reduced to the case of FIP field extensions. The case of fields is the subject of the next section, because of its complexity.
Proposition 3.30**.**
A ring extension R⊆S has FIP and is Boolean if and only if R(X)⊆S(X) has FIP and is Boolean.
Proof.
One part of the proof is Proposition 3.7. So, assume that R⊆S has FIP and is Boolean. Then, R(X)⊆S(X) has FIP if and only if
R⊆S+R is arithmetic
[29, Corollary 4.3]. If this conditions holds, the map ψ:[R,S]→[R(X),S(X)] defined by T↦T(X) is an order-isomorphism [13, Theorem 32].
It follows that R(X)⊆S(X) is Boolean since Boolean conditions are preserved through ψ.
To complete the proof, we need only to show that
R(X)⊆S(X) has FIP.
It follows from Proposition 3.11 that [R,S+R] is finite and Boolean. But, under these conditions, Theorem 3.29 yields that either RM=(S+R)M or RM⊂(S+R)M is minimal, for each M∈MSupp(S/R). This means that R⊆S+R is arithmetic, so that R(X)⊆S(X) has FIP.
∎
4. Boolean FIP field extensions
The characterization of a Boolean extension of fields is quite different from those obtained in Theorem 3.13 and needs a special study.
4.1. FIP non separable field extensions
We will call in this paper radicial any purely inseparable field extension. We recall that a minimal field extension is either separable or radicial ([27, p. 371]). We will use the separable closure of a FIP algebraic field extension.
In this subsection, we only consider FIP field extensions. Indeed, a finite algebraic field extension is not necessarily FIP. For instance a radicial extension k⊆L has not FIP, when p:=c(k), L:=k[x,y], with xp,yp∈k and [L:k]=p2.
Lemma 4.1**.**
An FIP radicial field extension k⊆K is chained.
Proof.
Since k⊆K has FIP, there exists α∈K such that K=k[α] by the Primitive Element Theorem. Moreover, c(k)=p is a prime integer because k⊆K is radicial. Then, the monic minimal polynomial of α over k is of the form f(X):=Xpn−a=(X−α)pn, where a:=αpn for some positive integer n.
The map φ:{0,…,n}→[k,K] defined by φ(m):=k[αpm] is strictly
decreasing. Let L∈[k,K] and g(X) be the monic minimal polynomial of α over L. Then, g(X) divides f(X) in K[X] and is of the form g(X)=(X−α)pm for some m∈{0,…,n} because L⊆K=L[α] is radicial and then the degree of g(X) is a power of p. It follows that g(X)=Xpm−αpm=Xpm−β, where β:=αpm∈L. By the proof of the Primitive Element Theorem, L is generated over k by the coefficients of g(x), so that L=k[β]=k[αpm]=φ(m). Then, φ is a bijection and [k,K] is chained.
∎
We here take the opportunity to correct a miswriting in the proof of [29, Proposition 2.3]. The sentence: “It follows that there is only one maximal chain composing K⊆L, and it has length n” has to be replaced with “It follows that any maximal chain composing K⊆L has length n”.
Theorem 4.2**.**
An FIP field extension k⊂K, with separable closure T and radicial closure U such that U,T∈{k,K}, is Boolean if and only if the following conditions hold:
(1)
k⊂U* and T⊂K are minimal.*
2. (2)
[k,K]=[k,T]∪[U,K].
3. (3)
k⊂T* and k⊂U are linearly disjoint.*
4. (4)
[k,T]* is a Boolean lattice.*
If these conditions hold, then [k,T]∩[U,K]=∅ and U=T∘.
Proof.
Since k⊂U is radicial,
c(k)=p
is a prime integer.
Assume that k⊂K is Boolean. If T∘ is the complement of T and T′ the separable closure of k in T∘, then T′⊆T∘∩T=k entails that k⊆T∘ is radicial, so that T∘⊆U. But K=T∘T⊆UT gives UT=K. Moreover, k=U∩T shows that T∘=U.
We claim that k⊂U is minimal. Deny, and let U1∈]k,U[ be such that k⊂U1 is minimal. Since k⊂U is radicial, [k,U] is a chain by Lemma 4.1. Let U1∘∈]T,K[ be the complement of U1 in [k,K]. Then, K=U1U1∘⊆UU1∘ implies K=UU1∘. Moreover, k⊆U∩U1∘⊆U⇒U∩U1∘∈[k,U]. If k=U∩U1∘, then U1⊆U∩U1∘⊆U1∘⇒U1U1∘=U1∘=K is absurd because U1=k. Hence, U∩U1∘=k, so that U1∘ is also the complement of U, which is absurd. It follows that k⊂U is minimal.
Then (1), (2) and (4) hold by Theorem 3.13(3),(1),(4). We get that [U:k]=[K:T]=p since k⊂U and T⊂K are minimal radicial. But, K=TU⇒[TU:T]=[U:k], and then k⊂T and k⊂U are linearly disjoint [6, Proposition 5, A V.13].
Conversely, assume that (1), (2), (3) and (4) hold. Then, the above conditions (2) and (4) on T and U coincide with Theorem 3.13(1),(4), so that we can use the diagram appearing in its proof, where L∈[k,T]:
[TABLE]
Then, L⊆LU and L⊆T are linearly disjoint [6, Proposition 8, A V.14]. In particular, [LU:L]=[K:T]=p shows that L⊂LU is minimal as in Theorem 3.13(3). Let L∈[U,K], and set L′:=L∩T, which is the separable closure of k⊆L. Then, L′⊆L is radicial. But, UL′⊆L is both separable (because so is U⊆K by [6, Proposition 16, page 45]) and radicial, because L′⊆L is radicial, so that L′U=L=U(L∩T). Then, [U,K]={UL′∣L′∈[k,T]} implies Theorem 3.13(2). Finally, [k,K] is Boolean by Theorem 3.13. The missing statement [k,T]∩[U,K]=∅ hold by Theorem 3.13.
∎
Hence, we need only to consider either radicial or separable Boolean field extensions to have a complete answer.
We recall [20] that a finite field extension k⊂L is said to be exceptional if k is the radicial closure and L is not the separable closure. Then, a finite exceptional field extension k⊂L is never Boolean. Deny. Using notation of Theorem 4.2, U=k=T∘ implies T=L, a contradiction.
Proposition 4.3**.**
An FIP radicial field extension k⊂K is Boolean if and only if k⊂K is minimal if and only if c(k)=[K:k].
Proof.
Use Example 3.2 (1) since [k,K] is a chain by Lemma 4.1 for the first equivalence, the second comes from [27, Proposition 2.2].
∎
A Galois extension k⊂K is minimal if and only if [K:k] is a prime integer [27, Proposition 2.2]. But this equivalence does not always hold for an arbitrary finite separable extension.
Theorem 4.5 characterizes minimal separable extensions, independently of Galois Theory, contrary to Philippe’s methods [25]. She proved that a separable extension k⊂k(x) is minimal if and only if the Galois group of the minimal polynomial of x is primitive [27, Proposition 2.2(3)]. See also Cox [9, page 414] for the characterization and links between primitive groups and “primitive” separable polynomials, a non trivial theory.
4.2. Finite separable field extensions
Let k⊂L be a finite separable field extension,
(whence FIP).
Then any T∈[k,L[ is an intersection of finitely many ∩-irreducible elements of [k,L] by Proposition 2.9. We give an upper bound of ∣[k,L]∣ and recall a result from Dobbs-Mullins.
Proposition 4.4**.**
Let k⊂L be a finite separable field extension of degree n.
(1) Then, ∣[k,L]∣≤Bn, where Bn is the nth Bell number.
(2) [10, Theorem 2.7] If k is an infinite field, then, ∣[k,L]∣≤2n−2+1.
Proof.
(1) k⊂L is étale since a finite separable field extension, and then, letting Ω be an algebraic closure of k, [6, Proposition 2, page AV.29] shows that the Ω-algebra Ω⊗kL is diagonalizable, and then isomorphic to Ωn, for some integer n. But ∣[Ω,Ωn]∣=Bn by [12, Proposition 4.15], so that [k,L]≤Bn.
∎
Moreover, if k⊂L is Boolean, any ∩-irreducible element is a co-atom by Proposition 3.9. In fact, Theorem 3.10 says that k⊂L is Boolean if and only if any T∈[k,L[ is an intersection in a unique way of finitely many co-atoms. Thanks to principal subfields introduced in [35] and some of their properties we studied in [31], we are able to characterize co-atoms of a finite separable field extension, and then give a characterization of a finite separable Boolean field extension by using [35],
from
van Hoeij, Klüners and Novocin, that gives an algorithm to compute subextensions of a finite separable field extension.
We recall the notation of [31],
(ku[X] is the set of monic polynomials of k[X]).
From now on, our riding hypotheses for the subsection will be: L:=k[x] is a finite separable (whence FIP) field extension of k with degree n and f(X)∈ku[X] is
the
minimal polynomial of x over k.
If g(X)∈Lu[X] divides f(X), we denote by Kg the k-subalgebra of L generated by the coefficients of g. For any K∈[k,L], we denote by fK(X)∈Ku[X] the minimal polynomial of x over K. The proof of the Primitive Element Theorem shows that K=KfK(∗).
Of course, fK(X) divides f(X) in K[X] (and in L[X]).
If f(X):=(X−x)f1(X)⋯fr(X) is the decomposition of f(X) into irreducible factors of Lu[X], we set F:={f1,…,fr} because the fα′s are different by separability.
For each α∈Nr, we set Lα:={g(x)∈L∣g(X)∈k[X],g(X)≡g(x)(fα(X)) in L[X]}.
The Lα′s are called the principal subfields of k⊂L.
It may be that Lα=Lβ for some α=β (see [31, Example 5.17 (1)]). To get rid of this situation,
we defined in [31] Φ:F→[k,L] by Φ(fα)=Lα. If t:=∣Φ(F)∣, we set Φ(F):={E1,…,Et}:=E. We denote by Eβ the common value of these Lα’s and by E:=Φ(F) the set of all distinct principal subfields of k⊂L.
We set mβ:=fEβ for β∈Nt.
For K∈[k,L[ , we set I(K):={α∈Nr∣fK(X)/fα(X)∈Lu[X]}.
We also set J(K):={β∈Nt∣Φ(fα)=Eβ for all α∈I(K)}.
For each β∈Nt, we set Fβ:={fα∈F∣fα divides mβ in L[X]}.
Theorem 4.5**.**
[31, Theorem 5.5]** Let K∈[k,L[. Then, fK(X)=(X−x)∏α∈I(K)fα(X) and K={g(x)∈L∣g(X)∈k[X],g(X)≡g(x)(fK(X)) in K[X]}=∩β∈J(K)Eβ=∩α∈I(K)Lα. In particular, ∣[k,L]∣≤2t
and k⊂L is minimal if and only if t=1.
Proof.
The inequality comes from that any K∈[k,L] is an intersection of some principal subfields and gives the equivalence.
∎
The inequality in Theorem 4.5 gives a better bound than the one of Proposition 4.4 because 2t≤2n−1≤Bn thanks to the induction formula Bn+1=∑i=0nCniBi. In case k⊂L is not a Galois extension, we get a better bound than the
bound of
[10, Theorem 2.7].
Corollary 4.6**.**
Let k⊂L be a finite separable field extension which is not Galois and of degree n. Then, ∣[k,L]∣≤2n−2.
Proof.
Let f(X) be the minimal polynomial of the extension k⊂L and set f(X):=(X−x)f1(X)⋯fr(X) the decomposition of f(X) into irreducible factors of Lu[X]. Since k⊂L is not Galois, at least one fi is not of degree 1, so that n=1+∑i=1rdeg(fi)≥1+2+(r−1)=r+2. It follows that t≤r≤n−2 implies ∣[k,L]∣≤2t≤2n−2.
∎
In the following, we write Kα:=Kgα, where gα(X):=(X−x)fα(X).
Lemma 4.7**.**
For K,K′∈[k,L], K⊆K′⇔fK′(X)∣fK(X) in L[X].
Proof.
Assume that K⊆K′. Then, fK(X)∈K′[X] satisfies fK(x)=0, so that fK′(X) divides fK(X) in K′[X], and also in L[X].
Conversely, assume that fK′ divides fK in L[X]. Since Theorem 4.5 implies K=∩α∈I(K)Lα,K′=∩α∈I(K′)Lα and fK′ divides fK in L[X],
any fα which divides fK′ divides fK, so that I(K′)⊆I(K) and then
K=∩α∈I(K)Lα⊆∩α∈I(K)Lα=K′.
∎
Proposition 4.8**.**
If K,K′∈[k,L], then lcm(fK,fK′) divides fK∩K′ and fKK′ divides gcd(fK,fK′) in L[X].
We set D:={fK∣K∈[k,L]}.
Then, (D,≤) is a poset for the order ≤ defined as follows: if fK,fK′∈D, then fK≤fK′ if and only if fK∣fK′ in L[X], which is equivalent to K′⊆K by Lemma 4.7. In particular, sup and inf are respectively lcm and gcd in D.
Corollary 4.9**.**
The map φ:[k,L]→D defined by K↦fK is a reversing order bijection such that sup(fK,fK′)=fK∩K′ and fKK′=inf(fK,fK′) for K,K′∈[k,L].
Proof.
φ is obviously surjective and is injective since K=KfK by (∗). It is reversing order by Lemma 4.7. Let K,K′∈[k,L], we deduce from Proposition 4.8 that fKK′≤fK,fK′≤fK∩K′. Let K1∈[k,L] be such that fK1≤fK,fK′. It follows that K,K′⊆K1 so that KK′⊆K1, whence fK1≤fKK′ and then, fKK′=inf(fK,fK′). A similar proof shows that sup(fK,fK′)=fK∩K′.
∎
We denote by CA:={K∈[k,L]∣K⊂Lminimal} the set of co-atoms of [k,L].
Proposition 4.10**.**
Assume that k⊂L is not minimal and let K∈]k,L[. If K∈CA, there is some β∈Nt such that K=Eβ.
Moreover, for any β∈Nt, the following conditions are equivalent:
(1)
Eβ∈CA.
2. (2)
Fβ* is a minimal element in the set {Fγ∣γ∈Nt}.*
3. (3)
φ(Eβ)* is a minimal element in D∖{X−x}.*
Proof.
By [31, Lemma 5.10], K=Eβ for some β∈Nt since K is ∩-irreducible. Moreover, mβ(X)=(X−x)∏fα∈Fβfα(X) by the definition of Fβ.
(1) ⇒ (2) Assume that Eβ⊂L is minimal. We claim that Fβ is minimal in the poset {Fγ∣γ∈Nt}. Deny, then there is some β′∈Nt such that Fβ′⊂Fβ, so that mβ′ divides strictly mβ. We get Eβ⊂Eβ′⊂L, contradicting Eβ⊂L minimal and (2) holds.
(2) ⇒ (3) Let Eβ for some β∈Nt satisfying (2) and assume that φ(Eβ) is not minimal in D∖{X−x}. Then, there is some K∈[k,L] such that fK divides strictly mβ. It follows that Eβ⊂K by Lemma 4.7. But K is an intersection of some Eγ’s by Theorem 4.5. In particular, we have Eβ⊂K⊆Eγ which implies that mγ divides strictly mβ, so that Fγ⊂Fβ, a contradiction with (2).
(3) ⇒ (1) Let Eβ for some β∈Nt satisfying (3). Assume that Eβ⊂L is not minimal, so that there exists some K∈[k,L] such that Eβ⊂K⊂L. Using again Theorem 4.5, we exhibit some Eγ such that K⊆Eγ⊂L, giving Eβ⊂K⊆Eγ. Then, mγ divides strictly mβ, contradicting (3) and then, Eβ∈CA.
∎
In case k⊂L is Galois, we can give a characterization of CA from the Galois group of the extension.
Proposition 4.11**.**
Let k⊂L be a finite Galois extension with n:=[L:k]=∏i∈Nmpiei and Galois group G.
(1)
Let K∈[k,L[. Then K∈CA⇔ there exists some i∈Nm such that [L:K]=pi⇔ there exists some subgroup H of G
of order pi
such that K is the fixed field of H in L.
2. (2)
∣CA∣≥m.
Proof.
(1) An appeal to the Fundamental Theorem of Galois Theory shows that K∈CA⇔ the group H of K-automorphisms of L has no proper subgroup ⇔∣H∣=pi for some i∈Nm since ∣G∣=n⇔ there exists some i∈Nm such that [L:K]=∣H∣=pi because K is the fixed field of H.
(2) For each i∈Nm, there exists a subgroup of G of order pi and therefore an element of CA by (1), which yields ∣CA∣≥m.
∎
Since each element of CA is some Eβ, we can reorder them so that CA={E1,…,Es} with s≤t.
If k⊂L is a finite separable field extension, Theorem 4.5 tells us that any K∈[k,L] is an intersection of some Eβs, that we can suppose ∩-irreducible. In order to have a Boolean extension, any irreducible Eβ must belong to CA.
Remark 4.12**.**
An ∩-irreducible element is not necessarily a co-atom. It is enough to take a Galois cyclic extension k⊂L such that [L:k]=pn,n≥3, where p is a prime integer. Then the Galois group of the extension is a chain, and so is [k,L], with ℓ[k,L]=n. Any K∈[k,L] such that ℓ[k,K]∈{1,…,n−2} is ∩-irreducible but not a co-atom.
We have seen in Lemma 4.7 that for each K∈[k,L], there exists g(X)=(X−x)g′(X), where g′(X)∈L[X] is a product of some of the fα(X), and satisfying g=fK. Let g(X)=(X−x)g′(X), where g′(X)∈L[X] is a product of some of the fα(X). A necessary and sufficient condition in order that there is K∈[k,L] such that g=fK is gotten for k=Q in [35, Remark 6], a result without proof that we supply for an arbitrary field k.
Proposition 4.13**.**
If g(X)∈Lu[X], there exists K∈[k,L] such that g=fK⇔g∈D⇔g(x)=0 and [L:Kg]=deg(g).
Proof.
If g=fK for some K∈[k,L], then, K=Kg by (∗). Obviously, g(x)=0. Moreover, [L:K]=deg(fK)=deg(g)=[L:Kg].
Conversely, if g(x)=0 and [L:Kg]=deg(g) hold, set K:=Kg. Then, fK(X) divides g(X) in K[X] since g(x)=0. Moreover, [L:K]=deg(fK)=[L:Kg]=deg(g), so that g=fK.
If g(X)=X−x, we get that L=K.
∎
This result allows to characterize Boolean and finite separable extensions using only polynomials with the following result.
Theorem 4.14**.**
Let k⊂L:=k[x] be a finite separable field extension. The following conditions are equivalent:
(1)
k⊂L* is a Boolean extension;*
2. (2)
For any K∈[k,L[, there is a unique subset T of CA such that fK=sup{mβ∣Eβ∈T};
3. (3)
For any g∈D∖{X−x}, there is a unique subset I⊆Ns such that g=sup{mβ∣β∈I}.
Proof.
Theorem 3.10,
states that k⊂L is Boolean if and only if each K∈[k,L[ is of the form
K=∩Eβ∈TEβ for some unique T⊆CA.
(1) ⇒ (2) Assume first that k⊂L is Boolean.
Let K∈[k,L[ and T:={Eγ∈CA∣K=∩Eγ∈TEγ}, which is unique. Corollary 4.9 yields that fK=sup{mβ∣Eβ∈T}. Let T′⊆CA be such that fK=sup{mγ∣Eγ∈T′}. Then, K=∩Eγ∈T′Eγ and T=T′ follows from the uniqueness property.
(2) ⇒ (1) Assume that for any K∈[k,L[, there is a unique subset T of CA such that fK=sup{mγ∣Eγ∈T}. This implies that K=∩Eγ∈TEγ by Corollary 4.9.
Assume that there is some T′=T such that K=∩Eγ∈T′Eγ with T′⊆CA. It follows that fK=sup{mγ∣Eγ∈T′} and T=T′ because of the assumption on T. Therefore, k⊂L is Boolean by Theorem 3.10.
(2) ⇔ (3) Use Corollary 4.9 and the bijection φ.
∎
Scholium. Here are the different steps in order to check that a finite separable extension k⊂L, with minimal polynomial f(X), is Boolean according to Theorem 4.14:
(1)
Decompose f(X) into irreducible elements of L[X].
2. (2)
Determine the set E of principal subfields.
3. (3)
(1) Assume that k⊂L is a finite separable Boolean field extension of degree n. Using the previous notation, we have ∣CA∣=s, which is also the value of ∣A∣. Using Theorem 3.1 and Proposition 4.4, we get that 2s≤Bn. It follows that if we want to calculate the elements of CA, it is enough to calculate the E1,…,Et, and to stop as soon as we get r distinct elements of CA such that Bn<2r+1.
(2) Let k⊂L:=k[x] be a finite separable Boolean field extension and let CA={E1,…,Es} be the set of co-atoms of the extension. Let K:=k[z]∈]k,K[. Then Example 3.2 implies that, if K=∩[Eα∈Y], where Y⊆CA, we have Y={Eα∈CA∣z∈Eα}. Moreover, K∘=∩[Eβ∈CA∖Y]. But, since the extension is finite separable, there exists y∈L such that K∘=k[y]. Then, CA∖Y={Eβ∈CA∣y∈Eβ}={Eβ∈CA∣z∈Eβ}. It follows that fK=sup(mα∣Eα∈Y) and fk[y]=sup(mβ∣Eβ∈CA∖Y). We recall that the sup is considered in D, the set of the minimal polynomials of the elements of [R,S].
Proposition 4.16**.**
A finite separable field extension k⊂L:=k[x] such that D={g(X)∈Lu[X]∣g(x)=0,g(X)∣f(X) in L[X]} is Boolean. If, in addition k⊂L is Galois
and k an infinite field, then k⊂L is minimal of degree 2.
Proof.
For α∈Nr, we have gα(X)=(X−x)fα(X)∈D, giving that there exists some K∈[k,L] such that gα=fK with L=K because fL(X)=X−x. It follows that K⊂L is minimal by [31, Lemma 5.7]. Hence, K=Eγ for some γ∈Ns.
Let K′∈[k,L] and set fK′(X):=(X−x)∏α∈Ifα(X) for some I⊆Nr. Moreover, fK′=lcmα∈I({mα}), for a unique I, and then a unique subset T={Lα}α∈I of CA satisfying the hypotheses of Theorem 4.14. (In fact, the Lα are
all
distinct and are the Eβ.) Therefore, k⊂L is Boolean and ℓ[k,L]=r by Theorem 3.1, because ∣CA∣=∣A∣=r.
Now if k⊂L is Galois, any fα has degree 1. Set n:=deg(f), so that r=n−1, with the previous notation.
Then ℓ[k,L]=n−1 and ∣[k,L]∣=2n−1 by Theorem 3.1. But k is infinite, which implies that 2n−1=∣[k,L]∣≤2n−2+1 by Proposition 4.4, which gives n=2.
∎
There exist finite separable Boolean extensions k⊂L such that D={g(X)∈Lu[X]∣g(x)=0,g(X)∣f(X) in L[X]} and k⊂L is not Galois. Take k:=Q and L:=k[x], where x:=\root3\of2. Then k⊂L is finite separable and not Galois, because not normal. Indeed, the minimal polynomial of x is f(X)=X3−2=(X−x)(X2+xX+x2), with X2+xX+x2 irreducible in L[X]. Then, k⊂L is Boolean by Proposition 4.16.
Here is an example of Boolean extension where we show how the irreducible divisors of the minimal polynomial provides the subextensions of a finite separable extension of fields.
Example 4.17**.**
[29, Remark 5.19] Let k:=Q, x:=\root6\of2 and set L:=k[x], which is a finite separable extension of k,
but not Galois.
The monic minimal polynomial of x over k is f(x):=X6−2=(X−x)(X+x)(X2+xX+x2)(X2−xX+x2), which is its decomposition into irreducible polynomials over L. Set f1(X):=X+x,f2(X):=X2+xX+x2,f3(X):=X2−xX+x2 and gα(X):=(X−x)fα(X), for α=1,2,3. Then, g1(X)=X2−x2=X2−\root3\of2,g2(X)=X3−x3=X3−2 and g3(X)=X3−2xX2+2x2X−x3. It follows that K1=k[\root3\of2],K2=k[2] and K3=L. Then, L1=K1 and L2=K2 by [31, Lemma 5.10]. Moreover, no subextension K∈[k,L[ is such that g3=fK since K3=L. Let K∈[k,L] be such that g3 divides strictly fK in L[X]. Then, [L:K]=deg(fK)>3 gives that [L:K]=6, so that K=k=L3 because fL3=f [31, Proposition 5.8]. To end, L1∩L2=k=L3.
Hence, [k,L]={k,L1,L2,K} is a Boolean lattice by Theorem 3.13, and we get the following diagram:
L1↗↖Lk=L3↖↗L2
Remark 4.18**.**
[31, Example 5.17 (2)] Let k:=Q and L=k[x], where x:=2+3. The monic minimal polynomial of x over k is f(X)=X4−10X2+1=(X−x)(X+x)(X−x−1)(X+x−1). Set f1(X):=X+x,f2(X)=X−x−1,f3(X)=X+x−1. We get K1=L1=k[6],K2=L2=k[3] and K3=L3=k[2]. In particular,
Lα=Eα for each α and Lα∩Lβ=k for α=β,α,β∈N3, which shows that [k,L]={k,L1,L2,L3,L} is not Boolean
because ℓ[k,L]=2 and ∣[k,L]∣=5=22, but
k⊂L is Galois. Therefore, although k⊂Lα is Boolean for α∈N2, the product k⊂L1L2=L is not Boolean. We also observe that despite the fact that k⊂Lα and Lα⊂L
are Boolean
for α∈N3,k⊂L is not Boolean.
However, we are able to characterize Boolean Galois extensions.
Theorem 4.19**.**
Let k⊂L be a finite separable extension with normal closure N. If k⊂N is a cyclic extension with a square free degree, then k⊂L is a Boolean extension.
In particular, a finite Galois extension k⊂L with Galois group G is Boolean if and only if k⊂L is cyclic whose degree is square free.
Proof.
We begin to prove the second part of the Theorem. Let G be the set of subgroups of G. For H,H′∈G, we denote by <H,H′> the subgroup of G generated by H and H′. Define φ:[k,L]→G by φ(K):=AutK(L), the group of K-automorphisms of L, for each K∈[k,L] and ψ:G→[k,L] by ψ(H):=Fix(H), the fixed field of H in L, for each H∈G. The Fundamental Theorem of Galois Theory for finite extensions shows that φ and ψ are reversing order isomorphisms of lattices, with φ=ψ−1.
Therefore, [k,L] is a Boolean lattice if and only if G is a Boolean lattice.
To conclude, use
[37, Corollary 2] which says that for a finite group G, the lattice of its subgroups is a Boolean lattice if and only if G is a cyclic group whose order is square free.
Now, if k⊂L is a finite separable extension whose normal closure is N such that k⊂N is a cyclic extension with a square free degree, then k⊂L is Boolean by Proposition 3.11 because k⊂N is Boolean.
∎
Remark 4.20**.**
The last part of the Theorem has no converse, unless adding some new assumptions as in Theorem 3.13. Consider Example 4.17. The normal closure N of the extension k⊂L is generated over k by x and its conjugates, which are the zeroes {±x,±jx,±j2x}, of f(X)=X6−2, where j=(1+i3)/2. Then, N=k[x,jx,j2x]. Moreover, k⊂N is Galois. Assume that k⊂N is Boolean. Then, k⊂N is a cyclic extension by Theorem 4.19. Set K1′:=k[j2x2]⊂N. Since (j2x2)3=2, we get that [K1′:k]=3=[K1:k], and we have two subextensions of k⊂N of degree 3, a contradiction for a cyclic extension (see [6, AV, page 81]). Then, k⊂N is not Boolean.
The two next examples exhibit Galois Boolean field extensions.
Example 4.21**.**
(1) Let n be a positive integer, n≥2. In view of [6, AV.152, Exercice 3)], there exists a cyclic extension of Q of degree n. It is enough to take a square free integer n and to use Theorem 4.19 to get a Boolean extension.
(2) Let k:=F2=Z/2Z be the finite field with two elements, and let Kn be the
cyclic
extension of k of degree n. Set L:=K30. The subfields of L are the Kn, where n divides 30. In view of Theorem 4.19, k⊂L is a Boolean extension, because cyclic of degree a square free integer, and [k,L]={Kn∣n=1,2,3,5,6,10,15,30}.
Proposition 4.22**.**
Let k⊂L be a finite Galois Boolean extension and let T,U∈]R,S[. Then U=T∘ if and only if k⊂Tand k⊂U are linearly disjoint with L=TU.
Proof.
If k⊂T and k⊂U are linearly disjoint, then T∩U=k, so that U=T∘ since TU=L.
Conversely, assume that U=T∘. We are going to show how U is build from T. Since k⊂L is a finite Galois Boolean extension, Theorem 4.19 shows that k⊂L is cyclic, n:=[L:k] is square free, and so is [T:k]. Set n=p1⋯pkpk+1⋯pr where the pi’s are distinct prime integers ordered such that m:=[T:k]=p1⋯pk, and set l:=n/m. Since k⊂L is cyclic, there exists V∈[k,L] such that [V:k]=l. It follows that (m,l)=([T:k],[V:k])=1, so that V∩T=k and TV:=L. Indeed, T,V⊂TV⊆L shows that m,l dividing [TV:k], gives that [L:k]=n=ml divides [TV:k], which leads to TV=L. Then, V=T∘=U. Under these conditions, we have [TU:k]=[L:k]=ml=[T:k][U:k], which shows that k⊂T and k⊂U are linearly disjoint.
∎
We can say more about distributive Galois extension non necessarily Boolean, involving a result from Dobbs-Mullins.
Proposition 4.23**.**
Let k⊂L be a finite Galois extension with degree n(=∏i=1mpiei the factorization into prime integers).
(1) [10, Proposition 2.2] If k⊂L is Abelian, then ℓ[k,L]=∑i=1mei.
(2) If in addition k⊂L is distributive, then k⊂L is cyclic, ℓ[k,L]=∑i=1mei and ∣[k,L]∣=τ(n), where τ(n) is the number of divisors of n.
(3) If in addition k⊂L is Boolean, ℓ[k,L]=m and ∣[k,L]∣=2m.
Proof.
(2) Let G be the Galois group of k⊂L and G be the set of subgroups of G. Since k⊂L is distributive, so is G. Then, G is cyclic by [32, Page 97], and so is the extension k⊂L. The first part of (2) comes from (1) since a cyclic extension is Abelian. Moreover, there is a bijection between the subgroups of a cyclic group of order n and the divisors of n, as there is a bijection between G and [k,L]. This gives the last equality.
(3) Assume that k⊂L is Boolean, then cyclic by Theorem 4.19 and n is square free, so that ei=1 for each i. Hence, ℓ[k,L]=m and ∣[k,L]∣=2m, since k⊂L is Boolean by Theorem 3.1.
∎
In a recent paper [31], we characterized ring extensions R⊂S of length 2 and gave the value of ∣[R,S]∣. It is then easy to characterize an extension of length 2 which is Boolean.
Proposition 4.24**.**
Let R⊂S be an FIP extension of length 2. Then R⊂S is
Boolean if and only if ∣[R,S]∣=4, and, if and only if one of the following condition holds:
(1)
∣Supp(S/R)∣=2* and Supp(S/R)⊆Max(R).*
2. (2)
R⊂S* is infra-integral such that Supp(S/R)={M},S+R=R,S and (R:S)=M.*
3. (3)
R⊂S* is t-closed integral such that Supp(S/R)={M},M=(R:S)∈Max(S), and one of the following conditions holds:*
(a) R/M⊂S/M is neither radicial nor separable, nor exceptional.
(b) R/M⊂S/M is a finite separable field extension and t=2, where t is the number of principal subfields of S/M different from R/M.
Proof.
Assume that R⊂S is Boolean. Then ∣[R,S]∣=4 by Theorem 3.1. Conversely, if ∣[R,S]∣=4, then [R,S]={R,T,U,S} for some U,T∈]R,S[, where T and U are incomparable, so that R⊂S is Boolean by Theorem 3.13. Now the second equivalence comes from [31, Theorem 6.1] which gives the different cases for a length 2 extension R⊂S to satisfy ∣[R,S]∣=4.
∎
Bibliography37
The reference list from the paper itself. Each links out to its DOI / PubMed record.
1[1] A. Ayache, When is the set of intermediate rings a finite boolean algebra?, Inter. Elec. J. Algebra , 8 , (2010), 129–139.
2[2] A. Ayache, A constructive study about the set of intermediate rings, Comm. Algebra , 41 (2013), 4637–4661.
3[3] A. Ayache, The set of intermediate rings as a boolean algebra, Comm. Algebra , 43 (2015), 1377–1386.
4[4] N. Bourbaki; Algèbre Commutative, Chs. 1–2, Hermann, Paris, 1961.
5[5] N. Bourbaki, Algèbre Commutative, Chs. 5–6, Hermann, Paris, 1964.
6[6] N. Bourbaki, Algèbre, Chs. 4–7, Masson, Paris, 1981.
7[7] P.-J. Cahen, D. E. Dobbs and T.G. Lucas, Valuative domains, J. Algebra Appl. , 9 (2010), 43–72.
8[8] G. Calugareanu, Lattice concepts of module theory, Springer, New York, 2000.