Boolean FIP ring extensions
Abstract
We characterize extensions of commutative rings R ⊂eq S whose sets of subextensions [R,S] are finite ( i.e. R⊂eq 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 ⊂eq S is a simple pair).
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.