---
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