---
title: Sublocale determined by a nucleus on a locale
author: Ayberk Tosun
date: 2026-10-30
---
This module contains the construction of the sublocale of a locale determined by
a nucleus on that locale. This is a standard construction that be found in
textbooks on locale theory (e.g. [1, p. 49]).
\begin{code}
{-# OPTIONS --safe --without-K #-}
open import UF.FunExt
open import UF.PropTrunc
module Locales.Sublocale.SublocaleDeterminedByNucleus
(pt : propositional-truncations-exist)
(fe : Fun-Ext)
where
open import Locales.Frame pt fe
open import Locales.Sublocale.Nucleus pt fe
open import MLTT.Spartan
open import Slice.Family
open import UF.Logic
open import UF.Subsingletons
open import UF.SubtypeClassifier using (Ξ©; _holds)
open AllCombinators pt fe
open Locale
\end{code}
We work in a module parameterized by a locale `X` and a nucleus `j : πͺ X β πͺ X`.
\begin{code}
module Sublocale-Determined-By-Nucleus
(X : Locale (π€ βΊ) π€ π€)
(πΏ : Nucleus (πͺ X))
where
j : β¨ πͺ X β© β β¨ πͺ X β©
j = prβ πΏ
\end{code}
We start by writing down the type of fixed points for `j`.
\begin{code}
Fixed-Point : π€ βΊ Μ
Fixed-Point = Ξ£ U κ β¨ πͺ X β© , j U οΌ U
underlying-open : Fixed-Point β β¨ πͺ X β©
underlying-open (U , _) = U
underlying-open-is-fixed-point
: (π : Fixed-Point)
β j (underlying-open π) οΌ underlying-open π
underlying-open-is-fixed-point (_ , p) = p
\end{code}
The order of the frame of fixed points is the same as that of `πͺ X`.
\begin{code}
_β€αΆ _ : Fixed-Point β Fixed-Point β Ξ© π€
(U , _) β€αΆ (V , _) = U β€[ poset-of (πͺ X) ] V
β€αΆ -is-reflexive : is-reflexive _β€αΆ _ holds
β€αΆ -is-reflexive = β€-is-reflexive (poset-of (πͺ X)) β underlying-open
β€αΆ -is-transitive : is-transitive _β€αΆ _ holds
β€αΆ -is-transitive (U , _) (V , _) (W , _) =
β€-is-transitive (poset-of (πͺ X)) U V W
β€αΆ -is-antisymmetric : is-antisymmetric _β€αΆ _
β€αΆ -is-antisymmetric {π} {π} p q = to-subtype-οΌ β β‘
where
β : (U : β¨ πͺ X β©) β is-prop (j U οΌ U)
β _ = carrier-of-[ poset-of (πͺ X) ]-is-set
β‘ : underlying-open π οΌ underlying-open π
β‘ = β€-is-antisymmetric (poset-of (πͺ X)) p q
β€αΆ -is-partial-order : is-partial-order Fixed-Point _β€αΆ _
β€αΆ -is-partial-order =
(β€αΆ -is-reflexive , β€αΆ -is-transitive) , β€αΆ -is-antisymmetric
open Meets _β€αΆ _
\end{code}
The top element and binary meets are exactly the same as those of `πͺ X`.
\begin{code}
παΆ : Fixed-Point
παΆ = π[ πͺ X ] , nucleus-preserves-top (πͺ X) πΏ
παΆ -is-top : Meets.is-top _β€αΆ _ παΆ holds
παΆ -is-top (U , _) = π-is-top (πͺ X) U
fixed-points-are-closed-under-binary-meets
: (U V : β¨ πͺ X β©)
β j U οΌ U
β j V οΌ V
β j (U β§[ πͺ X ] V) οΌ U β§[ πͺ X ] V
fixed-points-are-closed-under-binary-meets U V p q =
j (U β§[ πͺ X ] V) οΌβ¨ β
β©
j U β§[ πͺ X ] j V οΌβ¨ β
‘ β©
U β§[ πͺ X ] j V οΌβ¨ β
’ β©
U β§[ πͺ X ] V β
where
β
= πβ (πͺ X) πΏ U V
β
‘ = ap (Ξ» - β - β§[ πͺ X ] j V) p
β
’ = ap (Ξ» - β U β§[ πͺ X ] -) q
_β§αΆ _ : Fixed-Point β Fixed-Point β Fixed-Point
(U , p) β§αΆ (V , q) = (U β§[ πͺ X ] V) , β
where
β : j (U β§[ πͺ X ] V) οΌ U β§[ πͺ X ] V
β = fixed-points-are-closed-under-binary-meets U V p q
β§αΆ -gives-glb : (U V : Fixed-Point) β ((U β§αΆ V) is-glb-of (U , V)) holds
β§αΆ -gives-glb π@(U , _) π@(V , _) = (Ξ² , Ξ³) , Ξ΄
where
Ξ² : ((π β§αΆ π) β€αΆ π) holds
Ξ² = β§[ πͺ X ]-lowerβ U V
Ξ³ : ((π β§αΆ π) β€αΆ π) holds
Ξ³ = β§[ πͺ X ]-lowerβ U V
Ξ΄ : ((π , _) : lower-bound (π , π)) β (π β€αΆ (π β§αΆ π)) holds
Ξ΄ (_ , p , q) = β§[ πͺ X ]-greatest _ _ _ p q
\end{code}
The join operation, however, is different. It is obtained by composing the the
join operation of `πͺ X` with the nucleus `j`.
\begin{code}
βαΆ _ : Fam π€ Fixed-Point β Fixed-Point
βαΆ πβ = j (ββ¨ i β© Uβ [ i ]) , nuclei-are-idempotent (πͺ X) πΏ (ββ¨ i β© Uβ [ i ])
where
open JoinNotation (Ξ» - β β[ πͺ X ] -)
Uβ : Fam π€ β¨ πͺ X β©
Uβ = β
underlying-open πβα΅’ β£ πβα΅’ Ξ΅ πβ β
open Joins _β€αΆ _
βαΆ -gives-lub : (πβ : Fam π€ Fixed-Point) β ((βαΆ πβ) is-lub-of πβ) holds
βαΆ -gives-lub πβ = Ξ² , Ξ³
where
open PosetReasoning (poset-of (πͺ X))
open JoinNotation (Ξ» - β β[ πͺ X ] -)
Uβ : Fam π€ β¨ πͺ X β©
Uβ = β
underlying-open πβα΅’ β£ πβα΅’ Ξ΅ πβ β
Ξ² : ((βαΆ πβ) is-an-upper-bound-of πβ) holds
Ξ² i = Uβ [ i ] β€β¨ β
β©
ββ¨ i β© Uβ [ i ] β€β¨ β
‘ β©
j (ββ¨ i β© Uβ [ i ]) β
where
β
= β[ πͺ X ]-upper Uβ i
β
‘ = πβ (πͺ X) πΏ (ββ¨ i β© Uβ [ i ])
Ξ³ : ((π , _) : upper-bound πβ) β ((βαΆ πβ) β€αΆ π) holds
Ξ³ ((V , p) , Ο) =
j (ββ¨ i β© Uβ [ i ]) β€β¨ β
β©
j V οΌβ¨ β
‘ β©β
V β
where
β : ((ββ¨ i β© Uβ [ i ]) β€[ poset-of (πͺ X) ] V) holds
β = β[ πͺ X ]-least Uβ (V , Ο)
β
= nuclei-are-monotone (πͺ X) πΏ ((β[ πͺ X ] Uβ) , V) β
β
‘ = p
\end{code}
We package these operations up into the defining frame data defining the
sublocale that `j` determines, namely, the quotient frame given by `j`.
\begin{code}
quotient-frame-data : frame-data π€ π€ Fixed-Point
quotient-frame-data = _β€αΆ _ , παΆ , _β§αΆ _ , βαΆ _
\end{code}
It remains to prove distributivity and package these into a frame, which we do
below.
\begin{code}
open JoinNotation βαΆ _
distributivityαΆ
: (π : Fixed-Point)
β (πβ : Fam π€ Fixed-Point)
β π β§αΆ (ββ¨ i β© πβ [ i ]) οΌ ββ¨ i β© π β§αΆ (πβ [ i ])
distributivityαΆ π@(V , p) πβ = to-subtype-οΌ Ξ² Ξ³
where
Uβ : Fam π€ β¨ πͺ X β©
Uβ = β
underlying-open πβα΅’ β£ πβα΅’ Ξ΅ πβ β
Ξ² : (U : β¨ πͺ X β©) β is-prop (j U οΌ U)
Ξ² _ = carrier-of-[ poset-of (πͺ X) ]-is-set
Ξ³ : (π β§αΆ (ββ¨ i β© πβ [ i ])) .prβ οΌ (ββ¨ i β© π β§αΆ (πβ [ i ])) .prβ
Ξ³ = V β§[ πͺ X ] j (β[ πͺ X ] Uβ) οΌβ¨ β
β©
j V β§[ πͺ X ] j (β[ πͺ X ] Uβ) οΌβ¨ β
‘ β©
j (V β§[ πͺ X ] (β[ πͺ X ] Uβ)) οΌβ¨ β
’ β©
j (β[ πͺ X ] β
V β§[ πͺ X ] Uα΅’ β£ Uα΅’ Ξ΅ Uβ β) β
where
β
= ap (Ξ» - β - β§[ πͺ X ] j (β[ πͺ X ] Uβ)) (p β»ΒΉ)
β
‘ = πβ (πͺ X) πΏ V (β[ πͺ X ] Uβ) β»ΒΉ
β
’ = ap j (distributivity (πͺ X) V Uβ)
quotient-frame-data-satisfies-frame-laws
: satisfies-frame-laws quotient-frame-data
quotient-frame-data-satisfies-frame-laws =
β€αΆ -is-partial-order
, (παΆ -is-top , (Ξ» { (π , π) β β§αΆ -gives-glb π π })
, βαΆ -gives-lub
, Ξ» { (π , πβ) β distributivityαΆ π πβ })
quotient-frame-structure : frame-structure π€ π€ Fixed-Point
quotient-frame-structure =
quotient-frame-data , quotient-frame-data-satisfies-frame-laws
quotient-frame : Frame (π€ βΊ) π€ π€
quotient-frame = Fixed-Point , quotient-frame-structure
\end{code}
The sublocale determined by `j` is the locale that the above frame defines.
\begin{code}
sublocale-determined-by-nucleus : Locale (π€ βΊ) π€ π€
sublocale-determined-by-nucleus =
record
{ β¨_β©β = Fixed-Point
; frame-str-of = quotient-frame-structure
}
\end{code}
\section{Biblioography}
[1]: Peter T. Johnstone. _Stone Spaces_. Cambridge Studies in Advanced
Mathematics, Cambridge, 1982. ISBN:978-0-521-33779-3