Free constructions and coproducts of d-frames
Tomáš Jakl
Achim Jung
(April 7, 2017)
Abstract
A general theory of presentations for d-frames does not yet exist. We review the difficulties and give sufficient conditions for when they can be overcome. As an application we prove that the category of d-frames is closed under coproducts.
1 Introduction
In his celebrated Domain Theory in Logical Form [1], Abramsky describes a flexible framework for connecting the denotational semantics of a programming language with an algebraic presentation of a program logics. The denotational spaces are spectral spaces and the algebras are distributive lattices; they are connected via Stone duality [7].
The attempt to expand the scope of Abramsky’s work to cover probabilistic and real-number computation led to the study of stably compact spaces and their Stone duality. Later, it was shown that stably compact spaces have a very natural bitopological description; they are exactly the compact regular bitopological spaces (or bispaces for short) [8, 11]. Moreover, the Stone-type duality between bispaces and d-frames given in [8] has a finitistic description in the compact regular case, and so we can try to extend Abramsky’s work to this setting.
Free constructions of distributive lattices are an essential tool of Domain Theory in Logical Form and therefore a general theory of free constructions of d-frames is highly desirable. Unfortunately, no such theory exists as of yet. The difficulty lies in the mixed algebraic-relational nature of d-frames and particularly in the axiom (con-tot). In the absence of a general theory one can look at special instances of the problem where the difficulties with (con-tot) can be controlled. This is our approach in this paper.
The carrier of a d-frame is two-sorted, consisting of two standard frames L+ and L−. We use the usual generator and relations machinery to present them separately. The remaining parts of the structure, the consistency and totality relations con,tot⊆L+×L− can be specified by generating relations con1 and tot1, but it is not clear how to make sure that (con-tot), the only axiom that bonds both relations, will hold in the generated structure. Rather than solve this general problem, we provide sufficient conditions which can be checked in an early stage of the generating process (Section 4).
As an application, we prove that the category of d-frames is closed under coproducts (Section 5). In forthcoming work, [5], we show that the same techniques allow us to define the d-frame that corresponds to the Vietoris power space over a bispace. Together, this lays the foundation for the extension of Abramsky’s program as explained above as well as four-valued coalgebraic logic (inspired by [9, 10, 4]). We believe that our results are interesting from a model-theoretic perspective as well, as they provide an example of a free construction for a two-sorted algebraic-relational structure. Although not completely general, our techniques hold promise for extending many other frame-theoretic constructions to d-frames (for examples see [6, 12, 13]).
2 Preliminaries
Frames are algebraic structures which capture the order-theoretic properties of the lattice of open sets of a topological space. We say that a complete lattice (L;⋁,∧,0,1) is a frame if it satisfies the following infinitary distributivity law
- (Frm)
b∧(⋁iai)=⋁i(b∧ai).
The counterparts to continuous maps are the frame homomorphisms which are maps distributing over all joins and all finite meets.
A topological space (X;τ) gives rise to a frame: the lattice of its open sets ordered by set inclusion Ω(X)=(τ;⋃,∩;∅,X) is a frame. Also, any continuous map f:X→Y gives rise to a frame homomorphism Ω(f):Ω(Y)→Ω(X) as U∈τY↦f−1[U]∈τX.
Following the example of frames we have d-frames as the algebraic counterparts to bitopological spaces (or bispaces, for short)111Bispaces are the structures (X;τ+,τ−) where (X;τ+) and (X;τ−) are topological spaces. A map between two bispaces f:X→Y is bicontinuous if both f+:(X;τ+X)→(Y;τ+Y) and f−:(X;τ−X)→(Y;τ−Y) (which are acting on the underlying set X the same way as f does) are continuous.. Because bispaces have two topologies, we expect to have two frames, L+ and L−, as part of the structure of d-frames.
This alone has some consequences. We can recognise two orders in the product L+×L−; the first is the information order ⊑ where, for α=(α+,α−) and β=(β+,β−)∈L+×L−, α⊑β iff α+≤β+ and α−≤β−. The second is the logical order ≤ where α≤β iff α+≤β+ and α−≥β−. Both (L+×L−;⊑) and (L+×L−;≤) are bounded distributive lattices with meets and joins computed as follows
[TABLE]
The smallest and largest elements in the information order are ⊥=(0,0) and ⊤=(1,1), and in the logical order ff=(0,1) and tt=(1,0), respectively.
With just two frames we would not be able to express many bitopological properties. One can require L+ and L− to be subframes of a bigger frame representing the join of the two topologies as proposed by Banashewski [3]. Or, following the second author and Moshier [8], we can require two binary relations con and tot between the two frame components where (a,b)∈con corresponds to a being disjoint from b, and (a,b)∈tot if a and b cover the whole space. Our work takes the second approach.
Formally, then, a d-frame is a structure L=(L+,L−;con,tot) such that L+ and L− are frames and the binary consistency con⊆L+×L− and totality tot⊆L+×L− relations satisfy the following axioms, for all α,β∈L+×L−:
- (con–↓)
α∈con and β⊑α⟹β∈con,
2. (tot–↑)
α∈tot and β⊒α⟹β∈tot,
3. (con,tot–tt,ff)
tt∈con and tt∈tot, ff∈con and ff∈tot,
4. (con–∧,∨)
α,β∈con⟹α∨β∈con and α∧β∈con,
5. (tot–∧,∨)
α,β∈tot⟹α∨β∈tot and α∧β∈tot,
6. (con–⨆↑)
A⊆con and A is ⊑-directed ⟹\ThisStyle\ensurestackMath⨆\stackengine−0pt\SavedStyle↑OlFTSA∈con,
7. (con–tot)
α∈con,β∈tot and (α+=β+ or α−=β−)⟹α⊑β.
Algebraically speaking, the 3rd–6th axioms say that (con;∧,∨,tt,ff) and (tot;∧,∨,tt,ff) are (bounded) distributive lattices and that (con;⊑) is a DCPO. Directed suprema are computed pointwise, i.e. for a ⊑-directed A⊆con, \ThisStyle\ensurestackMath⨆\stackengine−0pt\SavedStyle↑OlFTSA=(\ThisStyle\ensurestackMath⋁\stackengine−0pt\SavedStyle↑OlFTS {α+:α∈A}, \ThisStyle\ensurestackMath⋁\stackengine−0pt\SavedStyle↑OlFTS {α−:α∈A}).
A pair of frame homomorphisms h=(h+:L+→M+,h−:L−→M−) is a d-frame homomorphism h:L→M if, for all α∈conL, h(α)=(h+(α+),h−(α−))∈conM and, for all α∈totL, h(α)∈totM.
Every bispace X=(X;τ+,τ−) gives rise to a d-frame
Ωd(X)=(τ+,τ−;conX,totX)
where (U+,U−)∈conX iff U+∩U−=∅ and (U+,U−)∈totX iff U+∪U−=X. Similarly, every bicontinuous map f:X→Y gives rise to a d-frame homomorphism Ωd(f)=(Ω(f+),Ω(f−)):Ωd(Y)→Ωd(X).
The (con-tot) axiom, while essential in the theory of d-frames, is harder to guarantee in constructions. We therefore introduce the auxiliary notion of a pre-d-frame where all but the (con-tot) axiom of d-frames are required to hold.
Remark**.**
Often, when we quantify over elements or sets that appear in both plus and minus forms we will use the symbol “±” to mean both of them. For example, “A± has property X” means “A+ and A− have property X”, or “there exist elements x±∈L±” means “there exist elements x+∈L+ and x−∈L−”.
Also, because of the symmetrical nature of d-frames, many proofs consist of two identical arguments, one for the plus and and one for the minus side. Instead, we give only one of the variants without even mentioning the other.
3 Presentations
3.1 Presentation of frames
Frames, like other algebraic structures, may be presented in terms of generators and relations ⟨G∣R⟩. The resulting frame Fr⟨G∣R⟩ is obtained as the quotient Fr⟨G⟩/∼R. Here, Fr⟨G⟩ represents the term algebra generated by the set of generators G which, because of the frame distributivity law, consists of terms of the form: ⋁i(∧j=1ni gi,j). The congruence ∼R is generated from a relation R⊆Fr⟨G⟩×Fr⟨G⟩ where each element of R is thought of as an equation:
[TABLE]
However, the structure of Fr⟨G⟩/∼R is not transparent at all. Its elements are equivalence classes of infinitary terms quotiented by R, which itself consists of “infinitary” equations.
This is addressed in the C-ideal presentation of frames. We assume that our generators form a meet-semilattice222We always assume that meet-semilattices are closed under all finite meets, i.e. they also contain the top element. B representing the terms ∧j=1n gj. Moreover, we can restrict to equations in which the right-hand side consists of a single finite meet of generators, i.e. an element of B. In the terminology of C-ideals, we have a set of cover relations C where a cover relation is any pair U⊣a such that a∈B and U⊆↓a (to represent the equation ⋁U=a). If, moreover, C satisfies the stability condition
[TABLE]
then we call (B,C) a frame presentation.
The frame presented by (B,C) has an explicit description as the frame of all C-ideals, denoted by C-Idl(B), where I⊆B is a C-ideal if it is a downset and
[TABLE]
Computing with C-ideals is straightforward. The join of a set {Ii}i of C-ideal is computed as C-Idl⟨⋃iIi⟩ where, for an M⊆B, C-Idl⟨M⟩ is the smallest C-ideal containing M. The meets of C-ideals are just intersections: ⋀iIi=⋂iIi, [6, Proposition II.2.11].
There is a map translating syntactic terms to their semantic interpretation as C-ideals with the following universal property:
Lemma 1** (Universality).**
Let (B,C) be a presentation of a frame. Then the map [[−]]:B→C-Idl(B)
defined as b↦C-Idl⟨{b}⟩ is a meet-semilattice homomorphism that transforms covers into joins, i.e. ⋁{[[u]]:u∈U}=[[a]] for every U⊣a∈C.
Moreover, [[−]] is universal among all such maps. That is, if f:B→L is a meet-semilattice homomorphisms that transform covers in C into joins, where L is a frame, then there exists a unique frame homomorphism f:C-Idl(B)→L such that f=f∘[[−]].
Remark**.**
There are numerous ways of presenting frames, e.g. [13], [6], [2] or [12]. We picked this one because it suits us better later on for the coproduct of d-frames. For the actual definition of presentation of d-frames it should not really matter as long as we have a universality property similar to the one in Lemma 1.
3.2 Presentations of pre-d-frames
In this section we show that we can extend the classical theory to also present a (pre-)d-frame (L+,L−;con,tot). Let us assume that L±=C±-Idl(B±), for some frame presentations (B±,C±), as in the previous section. We also have the translations [[−]]±:B±→L± from syntax to semantics according to Lemma 1.
Any consistency relation con on L+×L− can be specified via the generators: Let α∈con. Since the sets [[B±]]±={[[b]]±:b∈B±} generate the frames L±,
[TABLE]
and, because con is downwards closed in the information order, con must contain all the pairs (b+i, b−i′), for (i,i′)∈I+×I−. Moreover, the converse is also true:
Lemma 2**.**
(⋁i∈I+b+i, ⋁i∈I−b−i)∈coniff(b+i, b−i′)∈con, for all (i,i′)∈I+×I−
Proof.
Only the right-to-left implication remains to be proved. Assume that (b+i, b−i′)∈con, for all (i,i′)∈I+×I−. Since con is ∧-closed, for an i∈I+ and a finite F−⊆finI−, (b+i,⋁i∈F−b−i)∈con. Similarly, since con is ∨-closed, for finite F−⊆finI− and F+⊆finI+, (⋁i∈F+b+i,⋁i∈F−b−i)∈con. Notice that the set M={(⋁i∈F+b+i,⋁i∈F−b−i):F+⊆finI+ and F−⊆finI−} is directed and \ThisStyle\ensurestackMath⨆\stackengine−0pt\SavedStyle↑OlFTSM=(⋁i∈I+b+i, ⋁i′∈I−b−i′). Moreover, because M⊆con and con is closed under directed suprema, \ThisStyle\ensurestackMath⨆\stackengine−0pt\SavedStyle↑OlFTSM∈con.
∎
This means that we can specify con by a subset con1⊆B+×B− such that con=CON⟨[[con1]]⟩ where CON⟨[[con1]]⟩ is the smallest consistency relation containing [[con1]]={([[α+]]+,[[α−]]−):α∈con1}.333Formally, for an R⊆L+×L−,
\mathtt{CON}\langle R\rangle=\bigcap\{R^{\prime}\subseteq L_{+}\mathord{\times}L_{-}~{}|~{}R\subseteq R^{\prime},R^{\prime}\text{ is \mathord{\downarrow}\mkern 1.0mu−closed,closedunder\wedge,\vee,!\mathop{,\ThisStyle{\ensurestackMath{\bigsqcup\stackengine{-0pt}{,}{\SavedStyle!^{\mathord{\uparrow}}}{O}{l}{F}{T}{S}}}!},and\text{\emph{ff}},\text{\emph{t}}\mkern-3.0mu\text{\emph{t}}\in R^{\prime}}\}.
In general, we cannot hope to do the same for tot, i.e. find a tot1⊆B+×B− such that tot=TOT⟨[[tot1]]⟩ where TOT⟨[[tot1]]⟩ is the smallest totality relation containing [[tot1]]. We would have to specify tot by a subset of P(B+)×P(B−). However, the special kind of presentations, when tot1⊆B+×B−, turns out to be sufficient for our purposes.
Definition**.**
A tuple (B+,B−;C+,C−;con1,tot1) is a presentation of a pre-d-frame if
- (d-Pres-1)
(B+,C+) and (B−,C−) are presentations of frames,
2. (d-Pres-2)
con1⊆B+×B− and tot1⊆B+×B−.
The resulting pre-d-frame is obtained in two steps. First, we generate the frames of C-ideals C±-Idl(B±) and then we generate the consistency and totality relations from the embedded relations [[con1]],[[tot1]]⊆C+-Idl(B+)×C−-Idl(B−). We obtain the following pre-d-frame:
[TABLE]
Similarly to its frame counterpart, [[−]]=([[−]]+,[[−]]−) has the following universal property.
Lemma 3** (Universality).**
Let (B+,B−;C+,C−;con1,tot1) be a presentation of a pre-d-frame. Then,
[TABLE]
is presentation preserving, i.e. its components are meet-semilattice homomorphisms that transform covers from C± into joins and together they preserve con1 and tot1.
Also, if M is a pre-d-frame and f=(f+,f−):(B+,B−;con1,tot1)→M is a presentation-preserving pair of maps, then there is a unique d-frame homomorphism
[TABLE]
such that f=f∘[[−]]. Moreover, the components of f are the unique frame homomorphisms that are guaranteed to exist by Lemma 1.
4 Generating d-frames
So far we made no attempt in making sure that the axiom (con-tot) is satisfied in the generated pre-d-frame. Let us fix a presentation (B+,B−;C+,C−;con1,tot1) for the rest of this section and, because both frame components stay intact after we generate them, let us denote them by L±≡defC±-Idl(B±). Also, for brevity, we will identify B± with [[B±]]±⊆L± and, also, con1 and tot1 with [[con1]] and [[tot1]]⊆L+×L−, respectively.
The question for this section is: Under which conditions for (B+,B−;C+,C−;con1,tot1) is the generated pre-d-frame
[TABLE]
a d-frame? We solve this problem (partially) by showing that the following conditions are sufficient (though not necessarily minimal):
-
(↓con∧,∨-ind±), from Section 4.2, which will ensure that the structure of CON⟨con1⟩ is “sufficiently simple”, and
2. 2.
(λ±4-con-tot), from Section 4.3, which is just a simple instance of (con-tot).
4.1 The structure of CON⟨con1⟩ and TOT⟨tot1⟩
Before we get to the two conditions, we show that the relations CON⟨con1⟩ and TOT⟨tot1⟩ can be generated more explicitly. As in the HSP theorem from universal algebra, we can close con1 and tot1 under the operations they should be closed under (e.g. ∧, ∨, etc.) and, if we proceed in a certain order, we do not have to repeat any of the steps.
Let R⊆L+×L− be a any relation. We say that R is ∧-closed (resp. ∨-closed), if for every α,β∈R, α∧β∈R (resp. α∨β∈R). By ↓R denote the downwards closure of R in the ⊑-ordering, i.e. the relation {α∈L+×L− ∣ ∃β∈R. α⊑β} and define ↑R similarly.
Finally, define D(R)≡def{\ThisStyle\ensurestackMath⨆\stackengine−0pt\SavedStyle↑OlFTSA ∣ A⊆↑R}.444A⊆↑R means that A is a directed subset of R in the ⊑-order. Note that D(R) is only a “one-step” closure under joins of directed subsets in ⊑-order. D(R) might still contain directed subsets which do not have suprema in D(R). To close R under all directed suprema, one would have to iterate this process. However, as we will see later, there are natural conditions under which only one application is enough.
Lemma 4**.**
Let L+,L− be two frames and let R⊆L+×L− be a relation. Then:
-
If R is (∧,∨)-closed then ↓R and ↑R in L+×L− are also (∧,∨)-closed.
2. 2.
If R is (∧,∨)-closed then the relation D(R) is still (∧,∨)-closed.
3. 3.
If R is downwards closed then the relation D(R) is still downwards closed.
Proof.
For 1., let α,β∈↓R. This means that there are α′,β′∈R such that α⊑α′ and β⊑β′. Observe that (α∧β)+=α+∧β+≤α+′∧β+′=(α′∧β′)+ and similarly (α∧β)−≤(α′∧β′)−. Therefore, α∧β⊑α′∧β′∈R and α∧β∈↓R. Proving closedness ↓R under ∨ is the same and the same reasoning also applies to ↑R. For 2., let α,β∈D(R). From the definition α=⨆i↑αi and β=⨆j↑βj for some αi’s and βj’s from R. Let us calculate,
[TABLE]
Notice that the set {αi∧βj:i∈I,j∈J} is directed since {αi}i and {βj}j are and, moreover, αi∧βj∈R for all i,j since R is closed under logical meets.
For 3., let β⊑⨆i↑αi where αi’s are from R. Then, β=⨆i↑(β⊓αi)∈D(R) because the set {β⊓αi}i is a directed subset of R.
∎
Lemma 4 shows the order in which one can generate CON⟨con1⟩ and TOT⟨tot1⟩. Set con∧,∨ to be the algebraic closure of con1 under all finite logical joins and meets in L+×L−, and define tot∧,∨ correspondingly. Then we have:
Corollary 5**.**
[TABLE]
where, for an ordinal ι and a limit ordinal λ,
[TABLE]
4.2 When is one step enough?
Proving (con-tot) for CON⟨con1⟩ and TOT⟨tot1⟩ as it is, turned out to be too hard and, unless the authors have missed something obvious, we need to assume additional properties about the presentation. One of the reasons for the difficulty is the fact that CON⟨con1⟩ is computed as an iteration of D(−). In this subsection, we focus on the question whether there are natural properties, for a relation R⊆L+×L−, which guarantee D(D(R))=D(R).
At the moment, R can be any relation on the frames but for the application to presentations we would like to instantiate R with ↓con∧,∨. Because of that we will assume that R is downwards closed in ⊑-order and that it is closed under ∧ and ∨.
We start with an important definition. Two sets A+⊆L+ and A−⊆L− are said to be R-independent if ∀a+∈A+ and ∀a−∈A−, (a+,a−)∈R.
Observation 6**.**
For every α∈R, the sets B+(α+) and B−(α−) are R-independent where B±(α±)≡def↓α±∩B±.
It turns out that D(R) can reformulated by using R-independent sets. Let α∈D(R). From the definition, there is some directed A⊆↑R such that α=\ThisStyle\ensurestackMath⨆\stackengine−0pt\SavedStyle↑OlFTSA. Because B±(−) are monotone and A is directed, the sets {B+(α+):α∈A} and {B−(α−):α∈A} are both also directed (in the subset order) and so we have:
[TABLE]
Moreover, because L± is generated by B± and every x∈L± is equal to ⋁B±(x), we obtain that α=(\ThisStyle\ensurestackMath⋁\stackengine−0pt\SavedStyle↑OlFTSα∈Aα+,\ThisStyle\ensurestackMath⋁\stackengine−0pt\SavedStyle↑OlFTSα∈Aα−)=(⋁A+,⋁A−) where A±=⋃α∈AB±(α±).
It might seem that D(−) is just a special case of a more general construction:
[TABLE]
What we have proved in the previous paragraphs is that D(R)⊆Dind(R). In fact, both closures are equivalent:
Lemma 7**.**
D(R)=Dind(R)**
Proof.
Only the right-to-left inclusion remains to be proved. Let A+⊆B+ and A−⊆B− be R-independent. Observe that for two finite sets F+⊆finA+ and F−⊆finA−, (⋁F+,⋁F−)∈R. This is because R is ∨-closed and so (⋁F+,f−)∈R for every f−∈F− and, because R is ∧-closed, (⋁F+,⋁F−)∈R. Clearly, the set A={(⋁F+,⋁F−):F+⊆finA+ and F−⊆finA−} is a directed subset of R and (⋁A+,⋁A−)=\ThisStyle\ensurestackMath⨆\stackengine−0pt\SavedStyle↑OlFTSA∈D(R).
∎
Because D(R) is also downwards closed and closed under ∧ and ∨ (Lemma 4), D(D(R))=Dind(Dind(R)) and it might seem that this is already equal to Dind(R). But, this is not true in general. Take, for example, A+={a+} and A−={a−1,a−2} which are Dind(R)-independent. Each of (a+,a−1) and (a+,a−2)∈Dind(R) is witnessed by a pair of R-independent sets A+1 and A−1, and A+2 and A−2, respectively, such that a+=⋁A+1=⋁A+2 and a−1=⋁A−1 and a−2=⋁A−2. However, because there is no reason to believe that A+1 and A+2 are equal, there are no obvious candidates for R-independent sets which would have (a+,a−1∨a−2) as their supremum. To overcome this problem, we assume the following condition:
- (R-ind)
For all ∀α∈Dind(R), B+(α+) and B−(α−) are R-independent.
This guarantees, for every α∈Dind(R), a canonical choice of R-independent sets, namely A±=B±(α±).
Lemma 8**.**
D(Dind(R))⊆Dind(R)**
Proof.
Let A⊆↑Dind(R). By (R-ind), for every α∈A, B+(α+) and B−(α−) are R-independent. As in (⋆ ‣ 4.2), because A is directed, the sets A+≡def\ThisStyle\ensurestackMath⋃\stackengine−0pt\SavedStyle↑OlFTSα∈AB+(α+) and A−≡def\ThisStyle\ensurestackMath⋃\stackengine−0pt\SavedStyle↑OlFTSα∈AB+(α+) are R-independent and \ThisStyle\ensurestackMath⨆\stackengine−0pt\SavedStyle↑OlFTSA=(⋁A+,⋁A−). Hence, \ThisStyle\ensurestackMath⨆\stackengine−0pt\SavedStyle↑OlFTSA∈Dind(R).
∎
A combination of the preceding lemmas yields the desired result:
Theorem 9**.**
Let R⊆L+×L− be downwards closed, closed under logical meets and joins. If (R-ind) is true for R, then
D(D(R))=D(R).
Proof.
D(D(R))=(Lemma \refl:d−equals−db)D(Dind(R))⊆(Lemma \refl:reduce−dirjoin)Dind(R)=(Lemma \refl:d−equals−db)D(R) ⊆ D(D(R))\qed
Remark**.**
Because D(R)=Dind(R) is downwards closed, for every α∈D(R) and every (b+,b−)∈B+(α+)×B−(α−), also (b+,b−)∈D(R). Therefore, (R-ind) can be reformulated in the following more compact way:
- (R-ind)
(B+×B−)∩D(R)⊆R
4.3 Chasing down (con-tot)
Finally, we can focus on the original (con-tot) axiom for (L+,L−;CON⟨con1⟩,TOT⟨tot1⟩). We split it into two parts:
- (λ+0-con-tot)
α∈CON⟨con1⟩, β∈TOT⟨tot1⟩ and α+=β+⟹α−≤β−
2. (λ−0-con-tot)
α∈CON⟨con1⟩, β∈TOT⟨tot1⟩ and α−=β−⟹α+≤β+
If we assume (R-ind) about ↓con∧,∨, then the conditions of Theorem 9 hold for R=↓con∧,∨ and we can rewrite (λ±0-con-tot) into the following more explicit form
- (λ+0-con-tot)
α∈D(↓con∧,∨), β∈↑tot∧,∨ and α+=β+⟹α−≤β−
2. (λ−0-con-tot)
α∈D(↓con∧,∨), β∈↑tot∧,∨ and α−=β−⟹α+≤β+
Our aim now is to restrict α and β to smaller and smaller sets. First, we restate the axioms such that the β’s come from tot∧,∨ and then from tot∧ (resp. tot∨). Then, we do the same with α until we obtain a version of the (con-tot) axiom stated purely in terms of formulas involving only elements from con∧,⋁ (resp. con∨,⋀) and tot∧ (resp. tot∨). The individual stages are depicted in the diagram below (the λ superscripts in the axiom name correspond to the stages as shown in the diagram):
{\mathcal{D}(\mathord{\downarrow}\mkern 1.0mu\mathsf{con}_{\wedge,\vee})}$${\mathord{\uparrow}\mkern 1.0mu\mathsf{tot}_{\wedge,\vee}}$${\mathsf{con}_{\wedge,\vee,\bigvee}/\mathsf{con}_{\wedge,\vee,\bigwedge}}$${\mathsf{tot}_{\wedge,\vee}}$${\mathsf{con}_{\wedge,\bigvee}/\mathsf{con}_{\vee,\bigwedge}}$${\mathsf{tot}_{\wedge}/\mathsf{tot}_{\vee}}$$\scriptstyle{0th}$$\scriptstyle{1st}$$\scriptstyle{2nd}$$\scriptstyle{3rd}$$\scriptstyle{4th}
In every stage we introduce a pair of axioms (named (λ±i-con-tot), for i=1,…,4) and show that they imply the previous axioms. Because the axioms (λ+i-con-tot) and (λ−i-con-tot) are dual to each other, we will always only prove that, say, (λ+i-con-tot) implies (λ+i−1-con-tot) and leave out that (λ−i-con-tot) implies (λ−i−1-con-tot) as it is proved dually.
Remark**.**
Above we use a notation similar to the one introduced earlier. The relation con∨ is the algebraic closure of con1 under all finite logical joins (∨) in L+×L−, and con∧, tot∨, tot∧, tot∧,∨ and con∧,∨ are defined correspondingly. Likewise, con∧,⋁ is the closure of con1 under finite meets followed by the closure under all joins, both in logical order555This makes sense because, in any d-frame (L+,L−;con,tot), {(⋁iα+i, ⋀iα−i):{αi}i⊆con}⊆con. Indeed, from (con–↓), all (α+i, ⋀iα−i)∈con and, by ∨ and \ThisStyle\ensurestackMath⨆\stackengine−0pt\SavedStyle↑OlFTS-closedness, (⋁iα+i, ⋀iα−i)∈con. , i.e.
[TABLE]
The other versions, such as con∨,⋀, con∧,∨,⋁ and con∧,∨,⋀, are defined correspondingly.
1st stage.
We intend to simplify the elements in the tot relation. Consider the following axioms:
- (λ+1-con-tot)
\alpha\in\mathcal{D}(\mathord{\downarrow}\mkern 1.0mu\mathsf{con}_{\wedge,\vee}),\ {\color[rgb]{.5,.5,.5}\definecolor[named]{pgfstrokecolor}{rgb}{.5,.5,.5}\pgfsys@color@gray@stroke{.5}\pgfsys@color@gray@fill{.5}\dbox{\normalcolor\beta\in\mathsf{tot}_{\wedge,\vee}}},\ \beta_{+}\leq\alpha_{+}\implies\alpha_{-}\leq\beta_{-}
2. (λ−1-con-tot)
\alpha\in\mathcal{D}(\mathord{\downarrow}\mkern 1.0mu\mathsf{con}_{\wedge,\vee}),\ {\color[rgb]{.5,.5,.5}\definecolor[named]{pgfstrokecolor}{rgb}{.5,.5,.5}\pgfsys@color@gray@stroke{.5}\pgfsys@color@gray@fill{.5}\dbox{\normalcolor\beta\in\mathsf{tot}_{\wedge,\vee}}},\ \beta_{-}\leq\alpha_{-}\implies\alpha_{+}\leq\beta_{+}
Now, let α∈D(↓con∧,∨) and let β∈TOT⟨tot1⟩ with α+=β+. That means that there is some β′∈tot∧,∨ such that β′⊑β. We have that β+′≤α+ and so we can now apply (λ+1-con-tot) and get that α−≤β−′ and so α−≤β−′≤β−. To sum up, we have proved the first part of:
Lemma 10**.**
(λ±1-con-tot) implies (λ±0-con-tot), and vice versa.
For the converse assume β+≤α+. Then the pair (α+,β−) belongs to ↑tot∧,∨ and by (λ±0-con-tot) we can conclude α−≤β−.
2nd stage.
We can simplify the elements in tot even further. Take the axioms:
- (λ+2-con-tot)
\alpha\in\mathcal{D}(\mathord{\downarrow}\mkern 1.0mu\mathsf{con}_{\wedge,\vee}),\ {\color[rgb]{.5,.5,.5}\definecolor[named]{pgfstrokecolor}{rgb}{.5,.5,.5}\pgfsys@color@gray@stroke{.5}\pgfsys@color@gray@fill{.5}\dbox{\normalcolor\beta\in\mathsf{tot}_{\wedge}}},\ \beta_{+}\leq\alpha_{+}\implies\alpha_{-}\leq\beta_{-}
2. (λ−2-con-tot)
\alpha\in\mathcal{D}(\mathord{\downarrow}\mkern 1.0mu\mathsf{con}_{\wedge,\vee}),\ {\color[rgb]{.5,.5,.5}\definecolor[named]{pgfstrokecolor}{rgb}{.5,.5,.5}\pgfsys@color@gray@stroke{.5}\pgfsys@color@gray@fill{.5}\dbox{\normalcolor\beta\in\mathsf{tot}_{\vee}}},\ \beta_{-}\leq\alpha_{-}\implies\alpha_{+}\leq\beta_{+}
Let α∈D(↓con∧,∨) and let β∈tot∧,∨ with α+≤β+. We can decompose β such that β=⋁k=1nβk where βk∈tot∧, for every k=1,…,n. Then, for every k, we have that β+k≤β+≤α and so α−≤β−k. Because α−≤β−k for every k, also α−≤β−=⋀k=1nβ−k.
Lemma 11**.**
(λ±2-con-tot) implies (λ±1-con-tot), and vice versa.
Here the converse direction is trivial.
3rd stage.
Now we focus on the complexity of elements α from con. To eliminate D(−) consider the following auxiliary axioms:
- (α+-con-tot)
{\color[rgb]{.5,.5,.5}\definecolor[named]{pgfstrokecolor}{rgb}{.5,.5,.5}\pgfsys@color@gray@stroke{.5}\pgfsys@color@gray@fill{.5}\dbox{\normalcolor{(x^{k},y)}{k}\subseteq\mathord{\downarrow}\mkern 1.0mu\mathsf{con}{\wedge,\vee}}},\ \beta\in\mathsf{tot}_{\wedge},\ \beta_{+}\leq\bigvee_{k}x^{k}\implies y\leq\beta_{-}
2. (α−-con-tot)
{\color[rgb]{.5,.5,.5}\definecolor[named]{pgfstrokecolor}{rgb}{.5,.5,.5}\pgfsys@color@gray@stroke{.5}\pgfsys@color@gray@fill{.5}\dbox{\normalcolor{(x,y^{k})}{k}\subseteq\mathord{\downarrow}\mkern 1.0mu\mathsf{con}{\wedge,\vee}}},\ \beta\in\mathsf{tot}_{\vee},\ \beta_{-}\leq\bigvee_{k}y^{k}\implies x\leq\beta_{+}
Let α∈D(↓con∧,∨). By Lemma 7, this means that there exist A±⊆B± which are (↓con∧,∨)-independent and such that α=(⋁A+,⋁A−). Let us fix a b−∈A−. The (↓con∧,∨)-independence of A+ and A− means that A+×{b}⊆↓con∧,∨. Because also β+≤α+=⋁A+, we can apply (α+-con-tot) and obtain that b−≤β−. Since b−∈A− was chosen arbitrarily, α−=⋁A−≤β−. We have proved that (α+-con-tot) implies (λ+2-con-tot).
Finally, we can get rid of the downwards closure of con∧,∨. Consider the following axioms:
- (λ+3-con-tot)
{\color[rgb]{.5,.5,.5}\definecolor[named]{pgfstrokecolor}{rgb}{.5,.5,.5}\pgfsys@color@gray@stroke{.5}\pgfsys@color@gray@fill{.5}\dbox{\normalcolor\alpha\in\mathsf{con}_{\wedge,\vee,\bigvee}}},\ \beta\in\mathsf{tot}_{\wedge}, β+≤α+⟹α−≤β−
2. (λ−3-con-tot)
{\color[rgb]{.5,.5,.5}\definecolor[named]{pgfstrokecolor}{rgb}{.5,.5,.5}\pgfsys@color@gray@stroke{.5}\pgfsys@color@gray@fill{.5}\dbox{\normalcolor\alpha\in\mathsf{con}_{\wedge,\vee,\bigwedge}}},\ \beta\in\mathsf{tot}_{\vee}, β−≤α−⟹α+≤β+
Let {(xk,y)}k⊆↓con∧,∨ be such that β+≤⋁kxk. For every k, there exists an αk∈con∧,∨ such that (xk,y)⊑αk. Clearly, β+≤⋁kxk≤⋁kα+k, and α=(⋁kα+k,⋀kα−k)∈con∧,∨,⋁. We can apply (λ+3-con-tot) and obtain that y≤α−≤β−. Together with the previous result we have that:
Lemma 12**.**
(λ±3-con-tot) implies (λ±2-con-tot).
4th stage.
The final simplification is similar to the 2nd stage but this time acts on the con side:
- (λ+4-con-tot)
{\color[rgb]{.5,.5,.5}\definecolor[named]{pgfstrokecolor}{rgb}{.5,.5,.5}\pgfsys@color@gray@stroke{.5}\pgfsys@color@gray@fill{.5}\dbox{\normalcolor\alpha\in\mathsf{con}_{\wedge,\bigvee}}},\ \beta\in\mathsf{tot}_{\wedge}, β+≤α+⟹α−≤β−
2. (λ−4-con-tot)
{\color[rgb]{.5,.5,.5}\definecolor[named]{pgfstrokecolor}{rgb}{.5,.5,.5}\pgfsys@color@gray@stroke{.5}\pgfsys@color@gray@fill{.5}\dbox{\normalcolor\alpha\in\mathsf{con}_{\vee,\bigwedge}}},\ \beta\in\mathsf{tot}_{\vee}, β−≤α−⟹α+≤β+
Distributivity of ∧ and ∨ gives us that
[TABLE]
from which we can conclude:
Lemma 13**.**
(λ±4-con-tot) implies (λ±3-con-tot), and vice versa.
Furthermore, (λ±4-con-tot) and (λ±1-con-tot) are equivalent because
[TABLE]
To prove these inclusions, let α=(⋁kα+k,⋀kα−k) where {αk}k∈K⊆con∧. Then, for every k∈K, (α+k,α−)⊑αk and so (α+k,α−)∈↓con∧⊆↓con∧,∨. Because ↓con∧,∨ is ∨-closed, {(⋁k∈Fα+k,α−):F⊆finK} is directed in ↓con∧,∨ and so α∈D(↓con∧,∨).
We can apply similar techniques to simplify (R-ind):
Lemma 14**.**
(↓con∧,∨-ind) is equivalent to having the following two conditions
- (↓con∧,∨-ind+)
(B+×B−)∩↓con∧,⋁⊆↓con∧,∨**
2. (↓con∧,∨-ind-)
(B+×B−)∩↓con∨,⋀⊆↓con∧,∨**
We sum up all the previous results into this theorem:
Theorem 15**.**
If (λ±4-con-tot) and (↓con∧,∨-ind±) hold for a pre-d-frame presentation, then the generated pre-d-frame satisfies (con-tot).
Remark**.**
It is not possible to check if (con-tot) holds in the generated pre-d-frame just by looking at its syntactic presentation. However, our sufficient conditions are much simpler than the formulas involving infinitary applications of D(−). Nevertheless we still need to understand the structure of the generated frame components.
4.4 A special case
In our applications even stronger and simpler conditions hold for the presentations. Namely, consider the following “micro version” of (con-tot):
- (μ+-con-tot)
α∈con∨, β∈tot∧. β+≤α+⟹α−≤β−
2. (μ−-con-tot)
α∈con∧, β∈tot∨. β−≤α−⟹α+≤β+
and the following (more powerful) version of conditions (↓con∧,∨-ind±):
- (Indep+)
(L+×B−)∩↓con∧,⋁⊆↓con∨
2. (Indep-)
(B+×L−)∩↓con∨,⋀⊆↓con∧
Proposition 16**.**
If (μ±-con-tot) and (Indep±) hold for a pre-d-frame presentation, then the generated pre-d-frame satisfies (con-tot).
5 Application: Coproducts
5.1 Coproducts of frames
For a nice presentation of the coproducts of frames, we refer the reader to the book “Frames and Locales” [12]. Here we only outline basic facts about the construction. Let {Li}i∈I be a family of frames. The coproduct of {Li}i in the category of meet-semilattices is ∏i′Li which is the subset of ∏iLi consisting of those elements with all but finitely many coordinates equal to 1. Then, the coproduct of {Li}i in the category of frames ⨁iLi can be presented as the frame of C-ideals of (∏i′Li,C) with the set of coverings C of the form:
[TABLE]
where, for an a∈Lj and u∈∏i′Li, a∗ju is the element of ∏i′Li such that (a∗ju)j=a and (a∗ju)i=ui for i=j. Recall also that the smallest element of ⨁iLi is the C-ideal n={u∈∏i′Li ∣ ui=0 for some i}.
The inclusion maps are the frame homomorphisms ιj:Lj→⨁iLi, x↦↓(x∗j1)∪n, where (1)i=1 for all i∈I. We can factor ιj into a composition of two meet-semilattice homomorphisms [[−]]∘κj where
[TABLE]
Here κj is the universal map for the semilattice coproduct ∏i′Li and [[−]] is the inclusion B→C-Idl(B) as in Lemma 1, B=∏i′Li, and ↓u∪n is the smallest C-ideal containing u.
5.2 Coproducts of d-frames
Let {Li=(L+i,L−i;coni,toti)}i∈I be a family of d-frames. We will define the coproduct of {Li}i by a free d-frame construction. First, we compute the frame components of the coproduct of {Li}i as the coproducts of the frame components of the d-frames {Li}i. Set B+=∏i′L+i and B−=∏i′L−i and C+ and C− independently as in Subsection 5.1 (for B+ and B−, respectively). Namely, for every j∈I, we have a frame homomorphism
[TABLE]
In order for ιj=(ι+j,ι−j) to be a d-frame embedding into a coproduct, for every (a,b)∈conj (resp. totj), it has to be the case that (ι+j(a),ι−j(b))∈CON⟨con1⟩ (resp. TOT⟨tot1⟩). Also, the universal property of coproducts guarantees that for any d-frame cone {Li→M}i there is a mediating d-frame homomorphism ⨁iLi→M. This means that the relations we generate CON⟨con1⟩ and TOT⟨tot1⟩ from should not contain anything more. Therefore, define con1,tot1⊆B+×B− by
[TABLE]
and by ⨁iLi denote the resulting pre-d-frame (⨁iL+i×⨁iL−i;CON⟨con1⟩,TOT⟨tot1⟩).
Notation**.**
For every a∈Li and u∈B, denote a⊕iu=[[a∗iu]]±=↓(a∗iu)∪n±. In particular, a⊕i1=↓(a∗i1)∪n±. As before, we identify B± with [[B±]]±⊆⨁iL±i, con1 with [[con1]]⊆⨁iL+i×⨁iL−i, and tot1 with [[tot1]].
To simplify our work by making sure that we can deal with indexes coherently, we prove the following lemma about normal forms of elements from con∨, con∧, tot∨ and tot∧:
Lemma 17**.**
Let α∈con∧/tot∧. Then, it is of the form (⋀iα+i,⋁iα−i) such that
-
for every i∈I: αi=(a+⊕i1,a−⊕i1) for some (a+,a−)∈coni (resp. toti), and
2. 2.
there exists a finite I(α)⊆finI s.t. i∈I(α) iff αi=tt
Similarly, every α∈con∨ (resp. tot∧) is of the form (⋁iα+i,⋀iα−i) where αi∈con1 (resp. tot1) and I(α) denotes the finite set of indexes for which αi=ff.
Notice that 1. and 2. make sense together. Anytime αi=tt we have that tt=(↓1∪n+,n−)=(1⊕i1,0⊕i1) and (1,0)∈coni/toti. The case for αi=ff is similar.
5.3 Strips, rectangles and crosses
Before we get into proving that ⨁iLi satisfies (con-tot) we look into the structure of con∨, con∧, tot∨ and tot∧. It turns out that there is a nice geometrical intuition that we can employ.
First, for an a∈L±i, we call a⊕i1 an i-strip666We sometimes omit the index and call i-strips just strips whenever it does not lead to a confusion.. Then, anytime (a,b)∈coni, we can think of the corresponding pair (a⊕i1,b⊕i1)∈con1 as of a pair of “disjoint” i-strips and, similarly, (c,d)∈toti gives a pair of strips that are “covering the whole space”, i.e. (c⊕i1,d⊕i1)∈tot1. This terminology is motivated by the case when I={1,2}. Both cases are displayed in the picture below for L1⊕L2:
a\oplus_{1}\overline{1}$$a\oplus_{1}\overline{1}ab\mathcal{L}^{1}$$\mathcal{L}^{2}$$c\oplus_{1}\overline{1}$$d\oplus_{1}\overline{1}cd\mathcal{L}^{1}$$\mathcal{L}^{2}
Therefore, all elements of con1 and tot1 are pairs of strips. It is rather a technical lemma that the set of i-strips in the coproduct has exactly the same structure as the d-frame Li:
Lemma 18**.**
Let S±i be the set of all i-strips in ⨁iL±i. If all L±i’s are nontrivial777A frame is trivial if it is isomorphic to the trivial frame 1={0=1}. then
[TABLE]
Moreover, finite ∧-combinations of pairs of strips is something that we can imagine as a pair consisting of a rectangle and a cross. For example, let α∈con1 be a pair of 1-strips and α′∈con1 a pair of 2-strips. Then, as the picture below suggests, the plus coordinate of α∧α′ in L1⊕L2 is a rectangle and the minus coordinate is a cross. Notice also that the cross and rectangle are disjoint.
\alpha_{+}$$\alpha_{-}$$\mathcal{L}^{1}$$\mathcal{L}^{2}$$\wedge$$\alpha^{\prime}_{+}$$\alpha^{\prime}_{-}$$\mathcal{L}^{1}$$\mathcal{L}^{2}$$=$$\alpha_{-}\vee\alpha^{\prime}_{-}$$\alpha_{+}\wedge\alpha^{\prime}_{+}$$\mathcal{L}^{1}$$\mathcal{L}^{2}
The picture for two pairs of strips β,β′∈tot1 is similar but this time the cross and rectangle of β∧β′ cover the whole space.
This geometrical intuition builds up well for these formal definitions:
γ=⋀iγi, where γi=ci⊕i1 (∀i∈I), is a rectangle if there exists a finite I(γ)⊆finI such that ci=1 iff i∈I(γ). Similarly, δ=⋁iδi, where δi=di⊕i1, is a cross if for some finite I(δ)⊆finI, di=0 iff i∈I(δ).
Notice that, by Lemma 17, every element of con∧ (resp. tot∧) is of the form (⋀iα+i,⋁iα−i) with only finitely many nontrivial αi’s. In the present terminology, α is a pair rectangle–cross and this exactly matches the geometrical intuition we just discussed.
Observation 19**.**
Rectangles are exactly the elements of B±.
Proof.
Every γ∈B± is of the form [[u]]± for some u∈∏i′L±i. Because u has only finitely many indexes different from 1, [[u]]±=[[(a1∗i(1)1)∧⋯∧(an∗i(n)1)]]±=[[a1∗i(1)1]]±∧⋯∧[[an∗i(n)1]]±=(a1⊕i(1)1)∧⋯∧(an⊕i(n)1). The reverse direction is similar.
∎
There is a nice interplay between rectangles and crosses:
Lemma 20**.**
Let γ=⋀iγi be a rectangle and let δ=⋁iδi be a cross such that γ≤δ. Then, there exists an i∈I(γ) such that γi≤δi.
Proof.
Let γi=ci⊕i1 and δi=di⊕i1, for every i∈I. By Observation 19, γ=[[u]]± for some u∈∏i′L±i such that, for every i∈I, (u)i=ci. This means that (u)i=1 iff i∈I(γ). Also, by Lemma 27, δ has a form of a finite union ⋃i∈I(δ)δi. If ci=0 for some i∈I(γ), then ci≤di. Otherwise, ci=0 for all i∈I(γ) and, since γ≤δ iff u∈δ, there must exist an i∈I(δ) such that u∈δi and then, by Lemma 25.1, (u)i=ci≤di. Finally, because i∈I(δ), di=1 and so also ci=1 and i∈I(γ).
∎
5.4 Proof of (con-tot)
In this section we prove that ⨁iLi is a d-frame. To simplify our proofs, we can assume that all Li’s are nontrivial thanks to the following lemma.
Lemma 21**.**
If L+i=1 or L−i=1 for some i∈I, then ⨁iLi satisfies (con-tot).
Proof.
Observe that, by (con-tot) for Li, if L+i=1 then automatically also L−i=1, and vice versa. Therefore, ⨁iL±i={n±} and so ⨁iLi is trivial and satisfies (con-tot).
∎
To show that (con-tot) holds for ⨁iLi we will use Proposition 16. In order to be able to do that we need to prove that (μ±-con-tot) and (Indep±) hold:
Lemma 22**.**
(μ±-con-tot) holds for ⨁iLi:
Proof.
Let α=⋁iαi∈con∨ and β=⋀iβi∈tot∧ be in canonical forms, and assume that β+≤α+. From canonicity of α and β, know that α+ is a cross and β+ is a rectangle. By Lemma 20, there is an i∈I(β) such that β+i≤α+i. From (con-tot) for Li, α−i≤β−i and so
α−=⋀iα−i≤α−i≤β−i≤⋁iβ−i=β−.
∎
Lemma 23**.**
(Indep±) holds for ⨁iLi.
Proof.
Let (x,b−)∈(L+×B−)∩↓con∧,⋁. Denote its upper bound (⋁kα+k,⋀kα−k) where, for each k, αk=(⋀iα+k,i,⋁iα−k,i) is a pair rectangle–cross from con∧. Because b−∈B−, it is a rectangle of the form b−=⋀iγi (Observation 19). Because, for every k, b−≤α−k, by Lemma 20, there exists an i(k)∈I(b−) such that γi(k)≤α−k,i(k). Fix an i∈I(b−) and set K(i)={k ∣ i(k)=i}.
By Lemma 21, we can assume that all L±i’s are nontrivial and because {αk,i:k∈K(i)} are all pairs of i-strips and γi is an i-strip, by Lemma 18, we can carry the reasoning in the rest of this paragraph in the d-frame Li. Since coni(k) is downwards closed and γi≤αk,i (∀k∈K(i)), also (α+k,i(k),γi(k))∈con1 and, therefore, by \ThisStyle\ensurestackMath⨆\stackengine−0pt\SavedStyle↑OlFTS and ∨-closeness of coni(k), (⋁k∈K(i)α+k,i,γi)∈con1.
Finally, because I(b−) is finite
[TABLE]
Because α+k=⋀iα+k,i≤α+k,i(k) (∀k), x≤⋁kα+k≤⋁kα+k,i(k) and so (x,b−)∈↓con∨.
∎
By Proposition 16, we know that ⨁iLi is a d-frame and, moreover, by the same reasoning as for frames, we can prove that it has the universal property of a coproduct:
Theorem 24**.**
⨁iLi* is the coproduct in the category of d-frames.*
Acknowledgement
Discussions with Aleš Pultr helped greatly in the simplifications of Section 4.
Appendix A Missing proofs in Section 3 and 4
Proof of Lemma 3 (Universality).
By Lemma 1, [[−]] is a pointwise meet-semilattice homomorphism which transforms C± covers into joins and, by the definition, also [[con1]]⊆con∗ and [[tot1]]⊆tot∗. To show universality, let f:(B+,B−;con1,tot1)→M be a presentation preserving map. Because the individual components of f, i.e. f±:B±→M±, are meet-preserving and transform covers into joins, by Lemma 1, there exist unique frame homomorphisms f±:L±→M± such that f±=f±∘[[−]]±.
We need to prove that f=(f+,f−) is a d-frame homomorphism. Since f preserves con1 and tot1, we have that f[[[con1]]]=f[con1]⊆conM which is equivalent to [[con1]]⊆f−1[conM]. Because f is a pair of frame homomorphisms, f−1[conM] is ↓-closed, closed under ∧,∨,\ThisStyle\ensurestackMath⨆\stackengine−0pt\SavedStyle↑OlFTS and contains t**t and ff. However, CON⟨[[con1]]⟩ is the smallest such relation which contains [[con1]] and so CON⟨[[con1]]⟩⊆f−1[conM]. Finally, as before, this is equivalent to f[CON⟨[[con1]]⟩]⊆conM. The case for f[[[tot1]]]⊆totM is similar.
∎
Proof of Lemma 14.
The left-to-right implication holds immediately from (2) on page 2 and the fact that D(↓con∧,∨) is downwards closed. For the other implication, let (b+,b−)∈(B+×B−)∩D(↓con∧,∨). By Lemma 7, there exist A±⊆B± such that b±=⋁A± and A+×A−⊆↓con∧,∨. Fix an a−∈A−. Because A+×{a−}⊆↓con∧,∨, for every a+k∈A+, there exists an αk∈con∧,∨ such that (a+k,a−)⊑αk. Then,
[TABLE]
and because (b+,a−)∈B+×B− we can use (↓con∧,∨-ind+) and obtain that (b+,a−)∈↓con∧,∨.
Since a−∈A− was chosen arbitrarily, {b+}×A−⊆↓con∧,∨. Similarly to the above, for every a−k∈A− there is an αk∈con∧,∨ such that (b+,a−k)⊑αk, and (b+,b−)⊑(⋀kα+k,⋁kα−k)∈con∨,⋀. Finally, by (↓con∧,∨-ind-), (b+,b−)∈↓con∧,∨.
∎
Proof of Proposition 16.
We use Theorem 15. Clearly, (Indep±) is a strengthening of (↓con∧,∨-ind+). To prove (λ±4-con-tot), let α∈con∧,⋁ and β∈tot∧ be such that β+≤α+. Moreover, fix a b−∈B− such that b−≤α−. Then, (α+,b−)∈↓con∧,⋁. By, (Indep+), (α+,b−)∈↓con∨ and so there must be some γ∈con∨ such that (α+,b−)⊑γ. Because β+≤α+≤γ+, by (μ+-con-tot), b−≤γ−≤β−. Finally, because b−∈↓α−∩B− was chosen arbitrarily, then also α−=⋁(↓α−∩B−)≤β−.
∎
Appendix B Missing proofs in Section 5
First, we prove general lemmas about a coproduct of frames ⨁iLi.
Lemma 25**.**
Let a,b∈Lj,{ak}k⊆Lj and u,v∈B. Then,
-
If u∈/n, [[u]]≤[[v]] iff u≤v.
2. 2.
[[−]]* is injective on B∖n.*
3. 3.
(a⊕ju)∧(b⊕ju)=(a∧b)⊕ju**
4. 4.
⋁k(ak⊕ju)=(⋁kak)⊕ju**
Proof.
(1) is exactly Proposition IV.5.2.4 in [12]. (2) follows from (1). For (3), recall that [[−]] is a meet-semilattice homomorphism, so (a⊕ju)∧(b⊕ju)=[[a∗ju]]∧[[b∗ju]]=[[(a∗ju)∧(b∗ju)]]=[[(a∧b)∗ju]]=(a∧b)⊕ju. Finally, for (4), by Proposition IV.5.2.3 in [12], we know that in a coproduct of two frames we have
[TABLE]
and we can view ⨁iLi as a coproduct of two frames Lj⊕(⨁i∈I∖{j}Li).
∎
Lemma 26** (finite meets).**
Let αj=aj⊕i(j)1, for j=1,…,n. Then,
[TABLE]
where I={i(j):j=1,…,n}, bi=⋀{aj ∣ i(j)=i}).
Moreover, ⋀j=1nαj=[[u]]=↓u∪n where u∈∏i′Li such that (u)i=bi for every i∈I and (u)i=1 otherwise.
Proof.
By Lemma 25, ⋀j=1nαj=⋀i∈I(bi⊕i1) and, because meets of C-ideals are computed as their intersection (see Section 3.1), ⋀j=1nαj=⋂i∈I(bi⊕i1). The ‘Moreover’ part follows from this representation.
∎
Lemma 27** (finite joins).**
Let αj=aj⊕i(j)1, for j=1,…,n. Then,
[TABLE]
where I={i(j):j=1,…,n} and bi=⋁{aj ∣ i(j)=i}.
Proof.
Let βi≡defbi⊕i1, for every i∈I. First, we will show that ⋃i∈Iβi is a C-ideal. Let X={xk∗lu}k∈K⊆⋃i∈Iβi. Without loss of generality, assume that X∩n=∅, i.e. ui=0, for all i=l, and that xk=0, for all k∈K. If X⊆βi, for some i, then also ⋁k∈Kxk∗lu∈βi because βi is a C-ideal. Otherwise, there must exist an m∈K which is different from l such that xm∗lu∈βm. This means that (xm∗lu)m=um≤bm. From this we have that, for all k∈K, (xk∗lu)m=um≤bm and, therefore, xk∗lu∈βk. Again, because βk is a C-ideal, (⋁k∈Kxk)∗lu∈βk.
Next, αj⊆βi(j), for all j=1,…,n, and so ⋃jαj⊆⋃i∈Iβi. Because ⋁j=1nαj is the smallest C-ideal containing ⋃jαj and ⋃i∈Iβi is also a C-ideal, we get that ⋁j=1nαj⊆⋃i∈Iβj. Finally, every βi⊆⋁{αj ∣ i(j)=i}⊆⋁j=1nαj and so ⋃i∈Iβj⊆⋁j=1nαj.
∎
Now, let us look at the missing proofs from Section 5:
Proof of Lemma 17.
We prove that, for every α∈con∨, α=⋁i∈Iαi for some I⊆finI and αi=(b+i⊕i1,b−i⊕i1)∈con1 (or tot1) and from this the lemma follows.
Let ⋁j=1nαj∈con∨ where αj=(a+j⊕i(j)1,a−j⊕i(j)1)∈con1, for all j=1,…,n. From Lemma 26 and Lemma 27, we have that
[TABLE]
where I={i(j):j=1,…,n} and b+i=⋁{aj ∣ i(j)=i} and b−i=⋀{aj ∣ i(j)=i}. For every i∈I, because (con-∨) holds for Li, (b+i,b−i)∈coni and, therefore, also (b+i⊕i1,b−i⊕i1)∈con1.
∎
Proof of Lemma 18.
Recall that, for every i∈I, ι±i:L±i→⨁iL±i, a↦a⊕i1, is a frame homomorphism obtained as a composition ι±i=[[−]]±∘κ±i (see Section 5.1). Here, κ±i is always one-one and, because all L±i’s are nontrivial, κ±i[L±i∖{0}]∩n±=∅ and so, by Lemma 25, [[−]]± is one-one when restricted to image of κ±i. Therefore, ιi is also one-one as it is a composition of those two maps. Moreover, ιi is also onto S±i and, because of Lemma 25,
[TABLE]
and so the associated inverse image map (ι±i)−1:S±i→L±i is also a frame homomorphism. Finally, from the definitions
[TABLE]
which makes ιi restricted to the image, i.e. to S+i×S−i, an isomorphism of both structures.
∎
Proof of Theorem 24.
The last thing we need to check is universality of the construction. Let M be a d-frame such that for every j∈I there is a d-frame homomorphism λj:Lj→M. We have the following situation:
{\mathcal{L}^{j}}$${(\prod^{\prime}_{i}L^{i}_{+},\prod^{\prime}_{i}L^{i}_{-},\mathsf{con}_{1},\mathsf{tot}_{1})}$${\bigoplus_{i}\mathcal{L}^{i}}$${\mathcal{M}}$$\scriptstyle{\kappa^{j}}$$\scriptstyle{\lambda^{j}}$$\scriptstyle{\llbracket-\rrbracket}$$\scriptstyle{\lambda}$$\scriptstyle{\overline{\lambda}}
We obtain λ=(λ+,λ−) from the universal property of the coproduct ∏i′L±i: because all λ±j’s are meet-semilattice homomorphisms, λ± is the unique meet-semilattice homomorphism such that λ±j=λ±∘κ±j. Since all λj are d-frame homomorphisms, also λ preserves con1 and tot1 (follows immediately from the definition). It also preserves the cover relations in the presentation of d-frame coproducts (similarly to Proposition 4.3.2 in [12]):
[TABLE]
Where (1)’s hold because λ± is a meet-semilattice homomorphism and (2) holds because λ±j is a frame homomorphism and so ⋁kλ±(ak∗j1)=⋁kλ±(κ±j(ak))=⋁kλ±j(ak)=λ±j(⋁kak)=λ±(κ±j(⋁kak))=λ±j((⋁kak)∗j1). Therefore, λ preserves ⨁iLi presentation and, by Lemma 3, it can be uniquely extended to a d-frame homomorphisms λ.
∎