2019
DOI: 10.1142/s0219498819501743
|View full text |Cite
|
Sign up to set email alerts
|

Ring extensions of length two

Abstract: We characterize extensions of commutative rings R ⊂ S such that R ⊂ T is minimal for each R-subalgebra T of S with T = R, S. This property is equivalent to R ⊂ S has length 2. Such extensions are either pointwise minimal or simple. We are able to compute the number of subextensions of R ⊂ S. Besides commutative algebra considerations, our main result is a consequence of the recently introduced by van Hoeij et al. concept of principal subfields of a finite separable field extension. As a corollary of this paper… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
5

Citation Types

0
19
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
4
1

Relationship

3
2

Authors

Journals

citations
Cited by 12 publications
(19 citation statements)
references
References 19 publications
0
19
0
Order By: Relevance
“…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], (k u [X] is the set of monic polynomials of k[X]).…”
Section: Boolean Fcp Extensionsmentioning
confidence: 99%
See 3 more Smart Citations
“…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], (k u [X] is the set of monic polynomials of k[X]).…”
Section: Boolean Fcp Extensionsmentioning
confidence: 99%
“…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]…”
Section: Boolean Fcp Extensionsmentioning
confidence: 99%
See 2 more Smart Citations
“…Since [42,Proposition 4.18(2)] asserts that M ′ ∈ MSupp(R(X)/R(X)) = MSupp(R(X)/R(X)), this gives that M ∈ MSupp(R/R), which entails that M ∈ MSupp(S/R). By [43,Lemma 1.8], there exists…”
Section: Nagata Extensionsmentioning
confidence: 99%