Funayama's theorem revisited (Q387628)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Funayama's theorem revisited |
scientific article |
Statements
Funayama's theorem revisited (English)
0 references
23 December 2013
0 references
Let \(L\) be a lattice. \(L\) satisfies the \textit{join infinite distributive law} (JID) if for each \(a\in L\) and \(T\subseteq L\), whenever \(\bigvee T\) exists, so does \(\bigvee\{a\wedge t:t\in T\}\), and \(a\wedge \bigvee T=\bigvee \{a\wedge t:t\in T\}\). Dually, we have the meet infinite distributive law (MID). It is obvious that each lattice that satisfies either (JID) or (MID) is distributive. Funayama's theorem states that there is an embedding \(e\) of \(L\) into a complete Boolean algebra \(B\) that preserve all existing joins and meets in \(L\) iff \(L\) satisfies (JID) and (MID). Since every complete Boolean algebra satisfies both (JID) and (MID), one direction of this theorem is obvious. Thus, the main challenge is in proving the other direction. Funayama's original proof is quite involved. \textit{G. Grätzer} gave (in [General lattice theory. Berlin: Akademie-Verlag (1978; Zbl 0385.06014); Basel-Stuttgart: Birkhäuser Verlag (1978; Zbl 0385.06015); New York-San Francisco: Academic Press (1978; Zbl 0436.06001)]) a more accessible proof in case \(L\) is complete by showing that if \(L\) satisfies both (JID) and (MID), then the embedding of \(L\) into its free Boolean extension \(B(L)\) is a complete lattice embedding. Then, taking the MacNeille completion \(\overline{B(L)}\) of \(B(L)\), we have a complete Boolean algebra and the composition \(L\hookrightarrow B(L)\hookrightarrow \overline{B(L)}\) is a complete lattice embedding. A different proof of this theorem in the case where \(L\) is a complete lattice satisfying (JID) was given in [\textit{P. T. Johnstone}, Stone spaces. Cambridge etc.: Cambridge University Press (1982; Zbl 0499.54001)]. In this paper, the authors show that Grätzer's proof has a generalization to the case when \(L\) is not necessarily complete, thus providing an accessible proof of Funayama's theorem in the general case. In the complete case, they show that the Boolean algebras obtained by Grätzer and Johnstone, respectively, are isomorphic. In the non-complete case, they show that the class of lattices satisfying (JID) properly contains the class of Heyting algebras and so they characterize lattices satisfying (JID) and (MID) by means of their Priestley spaces. Using duality theory, they give alternative proofs of Funayama's theorem and of the isomorphism between the Boolean algebras constructed by Grätzer and Johnstone, respectively. The authors conclude this paper by showing that, unlike Grätzer's proof, Johnstone's proof has no obvious generalization to the non-complete case.
0 references
join infinite distributive law
0 references
meet infinite distributive law
0 references
free Boolean extension
0 references
MacNeille completion
0 references
nucleus
0 references
Priestley spaces
0 references
Esakia space
0 references
subframe
0 references