---
title: Conditional Esakia Spaces
url: https://www.emergentmind.com/topics/conditional-esakia-spaces
type: topic
---

# Conditional Esakia Spaces

Conditional Esakia spaces are the dual topological semantics for intuitionistic conditional logic: they are Esakia spaces equipped with a family of conditional relations indexed by clopen upsets, so that algebraic completeness for conditional Heyting algebras can be transferred to topological completeness and then, via fill-ins, to Kripke completeness [2508.11972]. They are a topologised refinement of conditional Kripke frames, but they should not be conflated with other extensions of Esakia theory, such as generalized Esakia spaces among stably locally compact spaces or locally Esakia spaces from order-compactification theory [1408.1072] [2512.22042].

## 1. Esakia-theoretic background

An Esakia space is, in the standard setting, a triple \((X,\le,\tau)\) where \((X,\le)\) is a nonempty partial order and \(\tau\) is a compact topology such that Priestley separation holds and, for every clopen \(a\), the down-closure \(\downarrow a\) is clopen [2508.11972]. Equivalently, a Priestley space is Esakia iff the down-closure of every open set is open; and if \(X\) is viewed as a spectral space with patch space \(X^p\), then \(X\) is Esakia iff for every open \(A\) of \(X^p\), the down-closure \(\downarrow A\) is open [1408.1072].

This condition is the topological core of intuitionistic duality. In an Esakia space, the lattice \(\mathrm{ClopUp}(X)\) of clopen upsets is a Heyting algebra, and for \(U,V\in \mathrm{ClopUp}(X)\) the implication is given by
\[
U\to V = X\setminus \downarrow (U\setminus V).
\]
Conversely, a Priestley space is Esakia iff \(\mathrm{ClopUp}(X)\) is a Heyting algebra [2302.07913]. The clopen upsets are therefore not merely topological subsets; they are the dual representatives of algebraic propositions.

This background is decisive for the conditional case. Conditional Esakia spaces do not replace Esakia spaces; they enrich them by adding relational structure compatible with the clopen-upset semantics already used in ordinary Esakia duality.

## 2. Conditional Kripke frames and conditional Heyting algebras

The conditional language \(\mathcal L_{\cto}\) extends intuitionistic propositional logic by a binary conditional operator \(\cto\). On the frame side, a conditional Kripke frame is a structure
\[
(X,\le,\mathcal R)
\]
where \((X,\le)\) is an intuitionistic Kripke frame and
\[
\mathcal R=\{R_a \mid a\in up(X,\le)\}
\]
is a family of binary relations indexed by all upsets, satisfying the coherence condition
\[
(\le \circ R_a)\subseteq (R_a\circ \le) \tag{$\dagger$}
\]
for every upset \(a\) [2508.11972].

The semantic clause for the conditional is
\[
\mathcal M,x\models \psi \cto \chi \iff \forall y\in X\,(xR_{V(\psi)}y \Rightarrow \mathcal M,y\models \chi),
\]
where \(V(\psi)\) is the truth set of \(\psi\). A key proposition states that in any such model every formula denotes an upset [2508.11972]. This preserves the monotonicity characteristic of intuitionistic semantics.

The algebraic semantics is given by conditional Heyting algebras
\[
(A,\top,\bot,\wedge,\vee,\to,\cto),
\]
where the additional operation satisfies
\[
a \cto (b\wedge c)=(a\cto b)\wedge (a\cto c), \qquad a\cto \top=\top.
\]
Thus \(\cto\) preserves finite meets in its second argument [2508.11972]. The corresponding completeness statement is algebraic:
\[
\oplus\Gamma\vdash \varphi
\quad\text{iff}\quad
\mathsf{CHA}(\Gamma)\Vdash \varphi.
\]
Conditional Esakia spaces arise precisely as the dual topological objects needed to transport this algebraic completeness into a spatial semantics.

## 3. Definition and internal structure of conditional Esakia spaces

A conditional Esakia space is an Esakia space
\[
(X,\le,\tau)
\]
equipped with a family of relations
\[
\mathcal R=\{R_a \mid a\in ClpUp(X)\},
\]
indexed only by clopen upsets, such that three conditions hold [2508.11972].

First, for all \(a,b\in ClpUp(X)\),
\[
a \dto b := \{x\in X \mid R_a[x]\subseteq b\}
\]
is clopen. This is the dual definability condition for the conditional operator.

Second, for every \(a\in ClpUp(X)\),
\[
(\le \circ R_a\circ \le)=R_a.
\]
This is the order-stability condition, and it is the topological analogue of the coherence condition for conditional Kripke frames.

Third, for every \(a\in ClpUp(X)\) and \(x\in X\), the set \(R_a[x]\) is closed. The closedness of each fibre is what the cited work uses for duality and compactness arguments.

The restriction to clopen upsets is essential. Clopen upsets are the topological surrogates for algebra elements, so the family \(\mathcal R\) is defined only where the dual algebraic operation is canonically represented. The resulting structure can be viewed as a kind of general frame with admissible sets \(A=ClpUp(X)\) [2508.11972].

A common misconception is that forgetting the topology of a conditional Esakia space automatically yields a full conditional Kripke frame. It does not. A conditional Kripke frame has relations \(R_a\) for all upsets \(a\in up(X,\le)\), whereas a conditional Esakia space carries relations only for clopen upsets. The missing relations for non-clopen upsets are exactly the semantic gap that motivates fill-ins [2508.11972].

## 4. Duality and completeness

The duality strategy for intuitionistic conditional logic has three layers. First, completeness is established algebraically for conditional Heyting algebras. Second, this is transferred to spaces via a dual equivalence
\[
\mathsf{CHA} \equiv^{op} \mathsf{CES},
\]
where \(\mathsf{CES}\) is the category of conditional Esakia spaces and conditional bounded morphisms. Third, completeness on spaces is turned into completeness on frames by extending the clopen-indexed relations to all upsets through fill-ins [2508.11972].

The functors implementing the duality are explicit. The functor
\[
ClpUp : \mathsf{CES}\to \mathsf{CHA}
\]
sends a conditional Esakia space to its Heyting algebra of clopen upsets, while
\[
Pf : \mathsf{CHA}\to \mathsf{CES}
\]
sends a conditional Heyting algebra to its prime-filter Esakia space equipped with the induced conditional relations [2508.11972]. This extends the classical duality
\[
\mathbf{HA}\simeq \mathbf{ES}^{\mathrm{op}}
\]
between Heyting algebras and Esakia spaces [2302.07913].

The semantic completeness result on the space side is correspondingly direct: for any set of axioms \(\Gamma\), the logic \(\oplus\Gamma\) is sound and complete with respect to the class of conditional Esakia spaces validating \(\Gamma\) [2508.11972].

General frames provide an intermediate representation. For a general frame \((X,\le,\mathcal R,A)\), where \(A\subseteq up(X,\le)\) is the collection of admissible upsets, the complex algebra is
\[
AUp(\mathcal G)=(A, X,\emptyset,\cap,\cup,\to,\dto).
\]
A formula is valid on a general frame iff it is valid in its complex algebra [2508.11972]. In the conditional Esakia setting, the admissible sets are exactly the clopen upsets, so the topological duality is tightly synchronized with the algebraic semantics.

## 5. Fill-ins, correspondence, and Kripke completeness

A fill-in of a conditional Esakia space
\[
\mathcal X=(X,\le,\tau,\mathcal S)
\]
is a conditional Kripke frame
\[
\mathcal F=(X,\le,\mathcal R)
\]
such that
\[
R_a=S_a \quad\text{for all } a\in ClpUp(\mathcal X).
\]
It fills in the missing relations for non-clopen upsets while leaving the clopen-indexed semantics unchanged [2508.11972].

The crucial lemma is preservation of falsification: if \(\mathcal F\) is a fill-in of \(\mathcal X\), then any formula falsified on \(\mathcal X\) is also falsified on \(\mathcal F\). The reason is that clopen valuations on \(\mathcal X\) are still valuations in the fill-in [2508.11972]. This is the bridge from dual-topological countermodels to ordinary Kripke countermodels.

The paper introduces several fill-ins, each designed for different axiom classes.

| Fill-in | Definition for non-clopen \(a\) | Note |
|---|---|---|
| \(\kappa_\emptyset\) | \(R_b^{triv}=\emptyset\) | Basic fill-in |
| \(\kappa_r\) | \(R_a^r[x]=a\) | Reflexive style |
| \(\kappa_\uparrow\) | \(R_a^\uparrow[x]=\uparrow x\) | Principal style |
| \(\kappa_t\) | \(R_a^t[x]=R_X[x]\) | Total style |
| \(\kappa_\cup\) | \(\displaystyle R_a^\cup[x]=\bigcup\{R_c[x]\mid c\in ClpUp(X),\, c\subseteq a\}\) | Union fill-in |
| \(\kappa_{tr}\) | \(\displaystyle R_a^{tr}[x]=\bigcup\{R_c[y]\mid c\in ClpUp(X),\, x\le y,\; R_c[y]\subseteq a\}\) | Transitive fill-in |

The empty fill-in \(\kappa_\emptyset\) already yields completeness for the basic logic: one obtains a conditional Esakia countermodel by duality, extends it by empty relations on non-clopen upsets, and the falsified formula remains falsified in the resulting frame [2508.11972].

For axiomatic extensions, the governing notion is persistence. An axiom is \(\kappa_\star\)-persistent if whenever it holds on a conditional Esakia space, it still holds after applying the fill-in \(\kappa_\star\). The cited work combines persistence with correspondence theory through a three-step pattern: derive a frame correspondent for an axiom, derive a space correspondent over clopen upsets, and prove that the chosen fill-in transforms spaces satisfying the space-correspondent into frames satisfying the frame-correspondent [2508.11972].

The frame correspondents exhibited include the following:
\[
p\cto p \quad\leftrightarrow\quad R_a[x]\subseteq a,
\]
\[
(p\to q)\to (p\cto q) \quad\leftrightarrow\quad R_a[x]\subseteq \uparrow x \cap a,
\]
\[
p\to(q\cto p) \quad\leftrightarrow\quad R_a[x]\subseteq \uparrow x,
\]
\[
\neg p \to (p\cto q) \quad\leftrightarrow\quad \uparrow x\cap a=\emptyset \Rightarrow R_a[x]=\emptyset,
\]
\[
(p\cto q)\to q \quad\leftrightarrow\quad x\in \uparrow R_a[x],
\]
\[
((p\wedge q)\cto r)\to(p\cto(q\cto r)) \quad\leftrightarrow\quad (R_a\circ R_b)\subseteq (R_{a\cap b}\circ \le).
\]
Not every axiom is persistent under every fill-in. For example, \(p\cto p\) is persistent for \(\kappa_\emptyset,\kappa_r,\kappa_{tr}\), while \((p\cto q)\to q\) is persistent for \(\kappa_\uparrow,\kappa_t,\kappa_\cup\) [2508.11972].

A special case is the squeeze fill-in \(\kappa_s\), introduced for cautious logics. It is tailored to cautious transitivity, cautious monotonicity, and reflexivity. The central squeeze-related condition is
\[
R_a[x]\subseteq b \subseteq a \Rightarrow R_a[x]=R_b[x]
\]
in the reflexive Esakia setting, and it is used to prove completeness for logics such as \(iCC\) and its extensions [2508.11972].

## 6. Relation to generalized, local, and frame-theoretic Esakia semantics

Conditional Esakia spaces belong to a broader landscape of Esakia-style generalizations, but they solve a different problem from the constructions studied elsewhere.

Generalized Esakia spaces, in the sense of stably locally compact topology, are defined by the same patch-open down-closure condition:
\[
\downarrow A \text{ is open whenever } A \text{ is open in the patch topology}.
\]
For a stably locally compact space \(X\), this is equivalent to the canonical map
\[
i_X : X^p \to X
\]
being downwards open, equivalent again to the associated spectral distributor having a right adjoint, and equivalent to \(X\) being a split subobject of a compact Hausdorff space in \(\mathbf{StLocCompDist}\) [1408.1072]. In that framework, generalized Esakia spaces and spectral distributors form the idempotent split completion of \(\mathbf{CompHausRel}\). This is a categorical extension of ordinary Esakia duality, but it is not a semantics for the conditional connective \(\cto\).

Locally Esakia spaces arise from order-compactification theory. A space is locally Esakia iff it is E-order-zero-dimensional and image-compact, and for order-zero-dimensional \(X\) this is equivalent to the existence of an Esakia order-compactification \(Y\) such that \(X\) is an upset of \(Y\), equivalently to \(\eta_0 X\) being such an Esakia order-compactification [2512.22042]. The functor
\[
\eta_0:\mathsf{LocEsa}\to \mathsf{Esa}
\]
is left adjoint to the inclusion \(\mathsf{Esa}\hookrightarrow \mathsf{LocEsa}\). Again, the issue here is reflective compactification, not conditional semantics.

A third adjacent viewpoint is frame-theoretic. Heyting frames were introduced precisely so that
\[
\mathbf{HeytFrm}\simeq \mathbf{HA}
\quad\text{and}\quad
\mathbf{HeytFrm}\simeq \mathbf{ES}^{\mathrm{op}},
\]
thereby recasting Esakia duality through coherent and algebraic frames [2302.07913]. This suggests a natural meta-level interpretation: conditional Esakia spaces are best understood not as another topological relaxation of the Esakia condition, but as a semantic enrichment of ordinary Esakia spaces by clopen-indexed residual relations tailored to intuitionistic conditional logic.

Other semantic bridges confirm the centrality of ordinary Esakia spaces in the background. Intuitionistic topological systems, for example, were shown to satisfy
\[
\mathbf{HI\text{-}TopSys}\simeq \mathbf{ESA},
\]
with the implication clause already formulated in relational Kripke style [1807.05833]. Conditional Esakia spaces continue this pattern at the level of a genuine binary conditional, preserving the Esakia topology while adding exactly the extra relational structure needed for duality, correspondence, and completeness [2508.11972].

Source: https://www.emergentmind.com/topics/conditional-esakia-spaces