A maximal Boolean sublattice that is not the range of a Banaschewski function
Samuel Mokri\v{s}, Pavel R\r{u}\v{z}i\v{c}ka

TL;DR
The paper constructs a specific countable bounded sublattice of a vector space's subspace lattice, demonstrating that not all maximal Boolean sublattices are ranges of Banaschewski functions, thus solving an open problem.
Contribution
It provides a counterexample of a maximal Boolean sublattice not arising from a Banaschewski function, addressing a question posed by Wehrung.
Findings
Constructed a countable bounded sublattice with two non-isomorphic maximal Boolean sublattices.
One sublattice is the range of a Banaschewski function, the other is not.
Resolved an open problem in lattice theory regarding Banaschewski functions.
Abstract
We construct a countable bounded sublattice of the lattice of all subspaces of a vector space with two non-isomorphic maximal Boolean sublattice. We represent one of them as the range of a Banschewski function and we prove that this is not the case of the other. Hereby we solve a problem of F. Wehrung.
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.
Taxonomy
TopicsAdvanced Algebra and Logic · Advanced Topology and Set Theory · Rings, Modules, and Algebras
A maximal Boolean sublattice that is not the range of a Banaschewski function
Samuel Mokriš
and
Pavel Růžička
Department of Algebra
Faculty of mathematics and Physics
Charles University in Prague
Sokolovská 83
186 75, Prague
Czech republic
Dedicated to Jára Cimrman on the occasion of his 50th birthday.
Abstract.
We construct a countable bounded sublattice of the lattice of all subspaces of a vector space with two non-isomorphic maximal Boolean sublattice. We represent one of them as the range of a Banschewski function and we prove that this is not the case of the other. Hereby we solve a problem of F. Wehrung.
Key words and phrases:
lattice, complemented, modular, Boolean, Banaschewski function, Schmidt’s construction, closure operator, adjunction
2010 Mathematics Subject Classification:
06A15, 06C20, 06D75
The first author was partially supported by the project SVV-2015-260227 of Charles University in Prague. The second author was partially supported by the Grant Agency of the Czech Republic under the grant no. GACR 14-15479S
1. Introduction
In [14] Friedrich Wehrung defined a Banaschewski function on a bounded complemented lattice as an antitone (i.e., order-reversing) map sending each element of to its complement, being motivated by the earlier result of Bernhard Banaschewski that such a function exists on the lattice of all subspaces of a vector space [1]. Wehrung extended Banaschewski’s result by proving that every countable complemented modular lattice has a Banaschewski function with a Boolean range and that all the possible ranges of Banaschewski functions on are isomorphic [14, Corollary 4.8].
Still in [14] Wehrung defined a ring-theoretical analogue of Banaschewski function that, for a von Neuman regular ring , is closely connected to the lattice-theoretical Banaschewski function on the lattice of all finitely generated right ideals of . He made use of these ideas to construct a unit-regular ring (in fact of bounded index ) of size with no Banaschewski function [15].
Furthermore in [14] Wehrung defined notions of a Banaschewski measure and a Banaschewski trace on sectionally complemented modular lattices and he proved that a sectionally complemented lattice which is either modular with a large -frame or Arguesian with a large -frame is coordinatizable (i.e. isomorphic to for a possibly non-unital von Neumann regular ring ) if and only if it has a Banaschewski trace. Applying this results, he constructed a non-coordinatizable sectionally complemented modular lattice, of size , with a large -frame [14, Theorem 7.5].
The aim of our paper is to solve the second problem from [14]:
Problem** (Problem 2 from [14]).**
Is every maximal Boolean sublattice of an at most countable complemented modular lattice the range of some Banaschewski function on ? Are any two such Boolean sublattices isomorphic?
We construct a countable complemented modular lattice with two non-isomorphic maximal Boolean sublattices and . We represent as the range of a Banaschewski function on and we prove that is not the range of any Banaschewski function. Finally we represent the lattice as a bounded sublattice of the subspace-lattice of a vector space.
2. Basic concepts
We start with recalling same basic notions as well as the precise definition of the Banaschewski function adopted from [14]. Next we outline the Schmidt’s construction, which we then apply to define the bounded modular lattice containing a pair of non-isomorphic maximal Boolean sublattices.
2.1. Some standard notions, notation, and the Banaschewski function
A lattice is bounded if it has both the least element and the greatest element, denoted by and , respectively. A bounded sublattice of a bounded lattice is its sublattice containing the bounds. Given elements of a lattice with zero, we will use the notation when and . A complement of an element of a bounded lattice is an element of such that . A lattice is said to be complemented provided that it is bounded and each element of has a (not necessarily unique) complement. A lattice is relatively complemented if each of its interval is complemented. Note that a relatively complemented lattice is not necessarily bounded.
We say that a lattice is uniquely complemented if it is bounded and each element of has a unique complement. By a Boolean lattice we mean a lattice reduct of a Boolean algebra, that is, a distributive uniquely complemented lattice. For the clarity, let us recall the formal definition of the Banaschewski function [14, Definition 3.1]:
Definition 2.1**.**
Let be a bounded lattice. A Banaschewski function on is a map such that both
- (1)
implies , for all , and 2. (2)
for all ,
hold true.
2.2. The -construction.
Let be a lattice. We will call a triple balanced, if it satisfies
[TABLE]
and we denote by the set of all balanced triples. It is readily seen that is a meet-subsemilattice of the cartesian product . However, it is not necessarily a join-subsemilattice, for one easily observes that the join of balanced triples may not be balanced. The -construction was introduced by E. T. Schmidt [12, 13] for a bounded distributive lattices . He proved [13, Lemma 1] that in this case is a bounded modular lattice and that it is a congruence-preserving extension of the distributive lattice . This result was later extended by Grätzer and Schmidt in various directions [2, 3]. In particular, in [2] they proved that every lattice with a non-trivial distributive interval has a proper congruence-preserving extension. This was further improved by Grätzer and Wehrung in [7], where they introduced a modification of the -construction, called -construction. Using this new idea they proved that every non-trivial lattice admits a proper congruence-preserving extension.
The lattice constructions and appeared in the series of papers by Grätzer and Wehrung [4, 5, 6, 7, 8, 9, 10] dealing with semilattice tensor product and its related structures, namely the box product and the lattice tensor product [6, Definition 2.1 and definition 3.3]. Indeed, for every lattice and whenever has zero and is a lattice (see [10, Theorem 6.5] and [5, Corollary 6.3]). In particular, the latter is satisfied when the lattice is modular with zero. Note also, that if is a bounded distributive lattice both the constructions and coincide. In our paper we get by with this simple case.
Let be a distributive lattice. Given a triple , we define
[TABLE]
and we set
[TABLE]
Using the distributivity of one easily sees that is the least balanced triple in and that the map determines a closure operator on the lattice (see [14, Lemma 2.3] for a refinement of this observation). It is also clear that
[TABLE]
A triple is closed with respect to the closure operator if and only if it is balanced. Therefore the set of all balanced triples, denoted by , forms a lattice [14, Lemma 2.1], where
[TABLE]
and
[TABLE]
By [5, Lemma 2.9] the lattice is modular if and only if the lattice is distributive. The “if” part of the equivalence is included in the above mentioned [13, Lemma 1].
3. The lattice
Fix an infinite cardinal . As it is customary, we identify with the set of all ordinals of cardinality less than . Let us denote by the Boolean lattice of all subsets of and set
[TABLE]
It is well-known that is a bounded Boolean sublattice of . Next, let us define
[TABLE]
Lemma 3.1**.**
The set forms a bounded join-subsemilattice of .
Proof.
Being a lattice polynomial, the map is monotone. It follows that for all , , the inclusion
[TABLE]
holds, whence also
[TABLE]
Thus if both and are finite, then is finite as well. It follows that is join-subsemilattice of . Finally, it is clear that both and belong to . ∎
Let denote the set of all balanced triples from .
Lemma 3.2**.**
The join-semilattice is closed under the operation.
Proof.
Let . Since is a lattice, we have that all , and belong to . Since the map is monotone, the inclusion holds. It follows that
[TABLE]
which is finite due to being an element of . ∎
Lemma 3.3**.**
The set forms a bounded sublattice of the lattice .
Proof.
Applying Lemmas 3.1 and 3.2, we deduce that is a bounded join-subsemilattice of . Therefore, it suffices to verify that is a meet-subsemilattice of . It is easy to observe that if at least one of is balanced, then
[TABLE]
¿From this we we get that if , then
[TABLE]
so the set is finite. This concludes the proof. ∎
As discussed in Section 2, since the lattice is distributive, the lattice is modular. Observe that the mapping embeds into , from which we deduce that
[TABLE]
Since the size of both and is , we get that . Let us sum up these observations in the following corollary to Lemma 3.3.
Corollary 3.4**.**
For countable infinite, forms a countable bounded modular lattice.
Remark 3.5*.*
Note that unlike , the lattice is not a meet-subsemillatice of . Indeed, both while .
4. A Banaschewski function on
In this section we define a Banaschewski function and describe, element-wise, its range.
Lemma 4.1**.**
The map defined by
[TABLE]
is a Banaschewski function on .
Proof.
First we prove that contains the range of the map . Observe that if we put and , then . Since is a Boolean lattice, the sets and all belong to . Furthermore, we have that
[TABLE]
In particular, , whence .
It is clear from (4.1) that the map is antitone. Finally, we check that
[TABLE]
It follows immediately from the definition of that
[TABLE]
To prove that , let us verify that
[TABLE]
Note that each element of that is not contained in belongs to . Together with , we get that (4.2) holds, which concludes the proof. ∎
Lemma 4.2**.**
Let denote the range of the Banaschewski function . Then
[TABLE]
and the mapping
[TABLE]
determines an isomorphism from onto the Boolean lattice .
Proof.
While proving Lemma 4.1, we have observed that
[TABLE]
A straightforward computation gives that , so the lattice is equal to the right-hand side of (4.4). Finally, it is readily seen that the correspondence (4.3) determines an isomorphism . ∎
It was noted in [14] that if the range of a Banaschewski function on a lattice is Boolean, then it is a maximal Boolean sublattice of . Thus we derive from Theorem 4.2 that is a maximal Boolean sublattice of .
5. The counter-example
In the present section, we construct another maximal Boolean sublattice of the lattice . We show that the lattices and are not isomorphic and we prove directly that the lattice is not the range of any Banaschewski function on .
Lemma 5.1**.**
The assignment defines a bounded lattice embedding . In particular, the range of is a bounded Boolean sublattice of isomorphic to .
Proof.
It is clear from the definition of the map that it is injective and that its range is included in . Further, for any , the equality
[TABLE]
holds by (2.3), while
[TABLE]
can be easily deduced from (2.1) and (2.2). Finally, observe that and , which concludes the proof. ∎
For any , we say that is finite if both and are finite, and we say that is co-finite if both and are finite. Let us write if is either finite or co-finite. Note that there are pairs such that is neither finite nor co-finite; namely, if and only if the symmetric difference is finite.
Lemma 5.2**.**
The set
[TABLE]
form a bounded Boolean sublattice of .
Proof.
Let , be a pair of elements from . If at least one of them is finite, then is clearly finite as well. If both and are co-finite, then so is . In either case, .
If at least one of the pairs is co-finite, then is co-finite, while if both and are finite, then so is . In particular, whenever .
We have shown that is a sublattice of . To complete the proof, observe that is finite and is co-finite and that the unique complement in of each , namely belongs to . ∎
Lemma 5.3**.**
The -image of is a bounded Boolean sublattice of .
Proof.
Due to Lemma 5.1 and Lemma 5.2, is a bounded Boolean sublattice of . Thus in view of Lemma 3.3, it suffices to verify that , that is, that is finite for every . This is clear when is finite. If is co-finite, then is finite and we are done. ∎
Observe that if is a balanced triple then if and only if . It follows that
[TABLE]
Lemma 5.4**.**
Let and let be a complement of in . If , then .
Proof.
Since and , it follows from (5.2) that . Hence exactly one of the two sets is finite. From and being finite we conclude that and are finite. It follows that the set is finite as well.
Suppose now that . Since , we have that , whence the set is finite. A fortiori, the set is also finite due to the assumption that . As is also finite, we conclude that so is . But then
[TABLE]
is a finite set, which contradicts the assumption that . ∎
Corollary 5.5**.**
Every complemented bounded sublattice of such that contains an element with .
Proof.
Let and let be its complement in . Applying Lemma 5.4, we get that either or . ∎
Proposition 5.6**.**
The lattice is a maximal Boolean sublattice of .
Proof.
Let be a complemented bounded sublattice of satisfying . There is with by Corollary 5.5. We can pick a finite nonempty . Since the triple is balanced,
[TABLE]
Now observe that both and are in . Applying (5.1) and (5.3), we get that
[TABLE]
while
[TABLE]
It follows from (5.4) and (5.5) that the lattice is not distributive, a fortiori it is not Boolean. ∎
Proposition 5.7**.**
The sublattice of is not the range of any Banaschewski function on .
Proof.
The range of a Banaschewski function on must contain a complement of each element of . We show that no complement of in belongs to .
Suppose the contrary, that is, that there is satisfying . Then , and by (5.2) also . Then from and , one infers that . It follows that ; indeed, is not finite. Thus , which is a contradiction. ∎
Remark 5.8*.*
Note that for the particular case of , the assertion of Proposition 5.7 follows from Proposition 5.9 together with [14, Corollary 4.8], which states that the ranges of two Boolean Banaschewski functions on a countable complemented modular lattice are isomorphic.
Proposition 5.9**.**
The lattices and are not isomorphic.
Proof.
In , every finite element is a join of a finite set of atoms, namely
[TABLE]
and, dually, every co-finite element is a meet of a finite set of co-atoms. On the other hand, there are elements in that are neither finite joins of atoms nor finite meets of co-atoms. Recall that in Lemma 4.2, we have observed that the lattice is isomorphic to . Therefore the lattices and are not isomorphic. ∎
6. Representing in a subspace-lattice
Although the construction in the three previous sections was performed for an infinite cardinal , the results of the present section on embedding the lattice into (namely Theorem 6.4) work just as well for finite. In particular, Proposition 6.5 (an enhancement of [5, Lemma 2.9]) holds for lattices of any cardinality.
Let be an arbitrary field and let denote the vector space over the field presented by generators , , and relations . For a subset of the vector space we denote by the subspace of generated by . Given subspaces of , say and , we will use the notation . Let denote the lattice of all subspaces of the vector space .
For all we put , , and .
We define a map by the correspondence
[TABLE]
Each of the sets , , and is clearly linearly independent. It follows that for all and, similarly, and for all . A straightforward computation gives the following lemma:
Lemma 6.1**.**
The map is a bounded join-homomorphism.
Proof.
Clearly and . Following the definitions, we compute ∎
Let be a map defined by
[TABLE]
for all .
It is straightforward that is a bounded meet-homomorphism and that it is the right adjoint of (i.e., replacing the lattice with its dual, the maps and form a Galois correspondence [11]). Indeed, one readily sees that
[TABLE]
The maps and induce a closure operator on .
Lemma 6.2**.**
The composition is precisely the closure operator on defined by (2.1).
Proof.
We shall prove that for every . By symmetry, it suffices to prove that
[TABLE]
Let . If , then by the definition (6.1), while if , then by (6.1) and the defining relations of . It follows that .
In order to prove the opposite inclusion, take any satisfying ; if there is one, there is nothing to prove. We need to show that then . Certainly
[TABLE]
for suitable , , and such that all but finitely many of them are zero. We set for , for , and for . Since for every , it follows from (6.2) that
[TABLE]
It easily follows from the defining relations of that forms a basis of . Thus, applying (6.3) we get that
[TABLE]
Since by our assumption , we get from (6.2) that . Substituting to (6.4) we get that , hence . This concludes the proof that . ∎
The next lemma shows that preserves meets. Note that with Lemma 6.1, this means that is a lattice embedding of into the lattice .
Lemma 6.3**.**
Let be balanced triples. Then
[TABLE]
Proof.
Since, by Lemma 6.1, is a join-homomorphism, it is monotone, whence . Thus it remains to prove the opposite inclusion.
Let be a non-zero vector. Then can be expressed as
[TABLE]
Consider such an expression of with
[TABLE]
minimal possible. Put for , for , and for . By symmetry, we can assume that for some . Suppose for a contradiction that . Since the triple is balanced, , whence . Without loss of generality we can assume that . If all , and were non-zero, we could replace with and reduce the value of the expression in (6.6) which is assumed minimal possible. Thus either or (recall that we assume that ). We will deal with these two cases separately. If , then the equality
[TABLE]
must hold true. Since and are linearly independent, it follows from (6.7) that which contradicts our choice of . The remaining case is when . Under this assumption we have that
[TABLE]
It follows that
[TABLE]
Since and are linearly independent, we infer from (6.8) that . Then we could reduce the value of (6.6) by replacing with in (6.5). This contradicts the minimality of (6.6). ∎
Combining Lemma 6.1, Lemma 6.2, and Lemma 6.3, we conclude:
Theorem 6.4**.**
The restrictions and, a fortiory, are bounded lattice embeddings. In particular, the lattice is isomorphic to a bounded sublattice of the subspace-lattice of a vector space.
It is well-known that a distributive lattice embeds (via a bounds-preserving lattice embedding) into the lattice , where is the cardinality of the set of all maximal ideals of . Such embedding induces an embedding (cf. Lemma 3.3). By Theorem 6.4, the lattice embeds into the lattice for a suitable vector space (note again that we now also admit finite ). Since the lattice is Arguesian, so are and .
On the other hand, [5, Lemma 2.9] states that a lattice is distributive if and only if is modular. Hence, if is modular, it follows that is distributive, and, by the above argument, is even Arguesian. We have thus proven the following strengthening of [5, Lemma 2.9]:
Proposition 6.5**.**
Let be a lattice. Then is distributive iff the lattice is modular iff is Arguesian. If this is the case, then can be embedded into the lattice of all subspaces of a suitable vector space over any given field.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] B. Banaschewski, Totalgeordnete moduln , Arch. Math. 7 (1957), 430–440.
- 2[2] G. Grätzer and E. T. Schmidt, A lattice construction and congruence-preserving extensions , Acta Math. Hungar. 66 (1995), 275–288.
- 3[3] by same author, On the independence theorem of related structures for modular (arguesian) lattices , Studia Sci. Math. Hungar. 40 (2003), 1–12.
- 4[4] G. Grätzer and F. Wehrung, Flat semilattices , Colloq. Math. 79 (1999), 185–191.
- 5[5] by same author, The M 3 [ D ] subscript 𝑀 3 delimited-[] 𝐷 {M}_{3}[{D}] construction and n 𝑛 n -modularity , Algebra Universalis 41 (1999), 87–114.
- 6[6] by same author, A new lattice construction: the box product , J. Algebra 221 (1999), 5893–5919.
- 7[7] by same author, Proper congruence-preserving extension of lattices , Acta Math. Hungar. 85 (1999), 169–179.
- 8[8] by same author, Tensor product and transferability of semilattices , Canad. J. Math. 51 (1999), 792–815.
