# Fixed Points and Noetherian Topologies

Aliaume Lopez

► To cite this version:

Aliaume Lopez. Fixed Points and Noetherian Topologies. FoSSaCS, Apr 2023. Paris, France. pp.456-476, 10.1007/978-3-031-30829-1_22. hal-04284124

HAL Id: hal-04284124

https://hal.science/hal-04284124v1

Submitted on 21 Dec 2023

HAL is a multi-disciplinary open access
archive for the deposit and dissemination of sci-
entific research documents, whether they are pub-
lished or not. The documents may come from
teaching and research institutions in France or
abroad, or from public or private research centers.

L'archive ouverte pluridisciplinaire HAL, est
destinée au dépôt et à la diffusion de documents
scientifiques de niveau recherche, publiés ou non,
émanant des établissements d'enseignement et de
recherche français ou étrangers, des laboratoires
publics ou privés.

<figure><img src="image_1.png" /></figure>

Distributed under a Creative Commons CC BY 4.0 - Attribution - International License
<figure><img src="image_2.png" /></figure>

# Fixed Points and Noetherian Topologies

Aliaume Lopez¹,²(✉)

¹ Université Paris Cité, CNRS, IRIF, F-75013, Paris, France
alopez@irif.fr

² Université Paris-Saclay, CNRS, ENS Paris-Saclay, Laboratoire Méthodes Formelles, 91190, Gif-sur-Yvette, France.

**Abstract.** Noetherian spaces are a generalisation of well-quasi-orderings to topologies, that can be used to prove termination of programs. They find applications in the verification of transition systems, some of which are better described using topology. The goal of this paper is to allow the systematic description of computations using inductively defined datatypes via Noetherian spaces. This is achieved through a fixed point theorem based on a topological minimal bad sequence argument.

**Keywords:** Noetherian spaces · topology · well-quasi-orderings · initial algebras · Kruskal's Theorem · Higman's Lemma.

## 1 Introduction

Let $(\mathcal{E}, \le)$ be a set endowed with a quasi-order. A sequence $(x_n)_n \in \mathcal{E}^\mathbb{N}$ is good whenever there exists $i < j$ such that $x_i \le x_j$. A quasi-ordered set $(\mathcal{E}, \le)$ is a well-quasi-ordered — abbreviated as wqo — if every sequence is good. By calling a sequence bad whenever it is not good, well-quasi-orderings are equivalently defined as having no infinite bad sequences. This generalisation of well-founded total orderings can be used as a basis for proving program termination. For instance, algorithms alike Example 1.1 can be studied via well-quasi-orderings and the length of their bad sequences [5]. More generally, one can map the states of a run to a wqo via a so-called quasi-ranking function to both prove the termination of the program and gain information about its runtime [27, Chapter 2]. Let us provide a concrete example of this proof scheme.

*Example 1.1.* Let Alg be the algorithm with three integer variables *a*, *b*, *c* that non-deterministically performs one of the following operations until *a*, *b* or *c* becomes negative: (l) $\langle a, b, c \rangle \leftarrow \langle a-1, b, 2c \rangle$ or (r) $\langle a, b, c \rangle \leftarrow \langle 2c, b-1, 1 \rangle$.

**Lemma 1.2.** For every choice of $a, b, c \in \mathbb{N}^3$, the algorithm Alg terminates.

*Proof.* Let us prove that Alg builds a bad sequence of triples when ordering $\mathbb{N}^3$ with $(a_1, b_1, c_1) \le (a_2, b_2, c_2)$ whenever $a_1 \le a_2, b_1 \le b_2$, and $c_1 \le c_2$. If $(a_i, b_i, c_i)$ and $(a_j, b_j, c_j)$ represent two configurations in a run of Alg, either only rule (l) was fired and $a_j < a_i$, or rule (r) was fired as least once, and $b_j < b_i$.

Because $(\mathbb{N}^3, \le)$ is a well-quasi-ordering (see Dickson's Lemma in [28]), Alg terminates for every choice of initial triple $(a, b, c) \in \mathbb{N}^3$.
As a combinatorial tool, well-quasi-orderings appear frequently in varying fields of computer science, ranging from graph theory to number theory [18, 22, 21, 3]. Well-quasi-orderings have also been highly successful in proving the termination of verification algorithms. One critical application of well-quasi-orderings is to the verification of infinite state transition systems, via the study of so-called Well-Structured Transition Systems (WSTS) [1, 2, 16, 7].

**Noetherian spaces.** A major roadblock arises when using *well-quasi-orders*: the powerset of a well-quasi-order may fail to be one itself [26]. This is particularly problematic in the study of WSTS, where the powerset construction appears frequently [19, 29, 1]. To tackle this issue, one can justify that the quasi-orders of interest are not pathological, and are actually better quasi-orders [25, 23]. Another approach is offered by the topological notion of *Noetherian space*, which as pointed out by Goubault-Larrecq, can act as a suitable generalisation of well-quasi-orderings that is preserved under the powerset construction [10].

The topological analogues to WSTS enjoy similar decidability properties, and there even exists an analogue to Karp and Miller's forward analysis for Petri nets [11]. Moreover, their topological nature allows to verify systems beyond the reach of quasi-orderings, such as lossy concurrent polynomial programs [11]. This is possible because the polynomials are handled via results from algebraic geometry, through the notion of the *Zariski topology* over $C^n$ [12, Exercise 9.7.53].

One drawback of the topological approach is that many topologies correspond to a single quasi-ordering. Hence, when the problem is better described via an ordering, one has to choose a specific topology, and there usually does not exist a finest one that is Noetherian.

**Inductively defined datatypes.** As for *well-quasi-orders*, *Noetherian spaces* are stable under finite products and finite sums [28, 12]. While this can be enough to describe the set of configurations of a Petri net using $N^k$, it does not allow to talk about more complex data structures, that are typically defined inductively, such as lists and trees. To make the above statement precise, let **1** be the singleton set, $A + B$ be the disjoint union of $A$ and $B$, and $A \times B$ their cartesian product. Then, the set of finite words over an alphabet $\Sigma$ is precisely the least fixed point of $F: X \mapsto 1 + \Sigma \times X$. Similarly, the set of finite trees over $\Sigma$ equals $\text{lfp}_X \cdot \Sigma \times X^*$, where $\text{lfp}_X \cdot F(X)$ denotes the least fixed point of $F$.

In the realm of well-quasi-orderings, the specific cases of finite words and finite trees are handled respectively via Higman's Lemma [18] and Kruskal's Tree Theorem [22]. Let us recall that a word $u$ *embeds* into a word $w$ (written $u \leq_* v$) whenever whenever there exists a strictly increasing map $h: |w| \to |w'|$ such that $w_i \leq w_{h(i)}$ for $1 \leq i \leq |w|$. Similarly, a tree $t$ *embeds* into a tree $t'$ (written $t \leq_{\text{tree}} t'$) whenever there exists a map from nodes of $t$ to nodes of $t'$ respecting the least common ancestor relation, and increasing the colours of the nodes. Proofs that finite words and finite trees preserve *well-quasi-orderings* typically rely on a so-called *minimal bad sequence argument* due to Nash-Williams [24]. However, the argument is quite subtle, and needs to be handled with care [9, 30].
In addition, the argument is not compositional and has to be slightly modified whenever a new inductive construction is desired [as in, e.g., 4, 3].

This picture has been adapted by Goubault-Larrecq to the topological setting by proposing analogues of the word embedding and tree embedding, together with a proof that they preserve Noetherian spaces [12, Section 9.7]. However, both the definitions and the proofs have an increased complexity, as they rely on an adapted “topological minimal bad sequence argument” that appears to be even more subtle [14, errata n. 26]. Moreover, the newly introduced topologies have involved definitions often relying on ad-hoc constructions.

In the case of well-quasi-orderings, two generic fixed point constructions have been proposed to handle inductively defined datatypes [17, 8]. In these frameworks, $lfp_X \cdot F(X)$ is guaranteed to be a well-quasi-ordering provided that $F$ is a “well-behaved functor” of quasi-orders. Both proposals, while relying on different categorical notions, successfully recover Higman’s word embedding and Kruskal’s tree embedding through their respective definitions as least fixed points. As a side effect, they reinforce the idea that these two quasi-orders are somehow canonical.

In the case of Noetherian spaces, no equivalent framework exists to build inductive datatypes, and the notions of “well-behaved” constructors from [17, 8] rule out the use of important Noetherian spaces, as they require that an element $a \in F(X)$ has been built using *finitely many* elements of $X$: while this is the case for finite words and finite trees, it does not hold for the arbitrary powerset. Moreover, there have been recent advances in placing Noetherian topologies over spaces that are not straightforwardly obtained through “well-behaved” definitions, such as infinite words [13], or even ordinal length words [15].

## 1.1 Contributions of this paper

In this paper, we propose a least fixed point theorem for Noetherian topologies. This is done in a way that greatly differs from the categorical frameworks introduced in the study of *well-quasi-orders*, as the construction of the space is entirely *decoupled* from the construction of the topology. In particular, the carrier set $X$ itself need not be inductively defined.

In this setting, we consider a fixed set $X$ and a map $R$ from topologies $\tau$ over $X$ to topologies $R(\tau)$ over $X$. Because the set of topologies over $X$ is a complete lattice, it suffices to ask for $R$ to be monotone to guarantee that it has a least fixed point, that we write $lfp_\tau \cdot R(\tau)$. In general, this least fixed point will not be Noetherian, but we show that a simple sufficient condition on $R$ guarantees that it is. This main theorem (Theorem 3.21), encapsulates all the complexity of the topological adaptations of the minimal bad sequences arguments [12, Section 9.7], and we believe that it has its own interest.

The necessity to separate the construction of the set of points from the construction of the topology might be perceived as a weakness of the theory, when it is in fact a strength of our approach. We illustrate this by giving a shorter proof that the words of ordinal length are Noetherian [15], without providing an
inductive definition of the space. As an illustration of the versatility of our framework, we introduce a reasonable topology over ordinal branching trees (with finite depth), and prove that it is Noetherian using the same technique.

In the specific cases where the space of interest can be obtained as a least fixed point of a “well-behaved” functor, we show how Theorem 3.21 can be used to generalise the categorical framework of Hasegawa [17] to a topological setting. As well as adding inductively defined topologies (hence, inductively defined datatypes) to the theory of Noetherian spaces, this provide a reasonable answer to the canonicity issue previously mentioned.

**Outline.** In Section 2 we recall some of the main results in the theory of Noetherian spaces. In Section 3 we prove our main result (Theorem 3.21). In Section 4 we explore how this result covers existing topological results in the literature, and provide a new non-trivial Noetherian space (Definition 4.7). In Section 5, we leverage our main result to devise a Noetherian topology over inductively defined datatypes (Theorem 5.13), and prove that this generalises the work of Hasegawa over well-quasi-orders (Theorem 5.15).

## 2 A Quick Primer on Noetherian Topologies

A topological space is a pair $(\mathcal{X}, \tau)$ where $\tau \subseteq \mathcal{P}(\mathcal{X})$, $\tau$ is stable under finite intersections, and $\tau$ is stable under arbitrary unions. A subset $U \subseteq \mathcal{X}$ is an open subset when $U \in \tau$, and a closed subset when $\mathcal{X} \setminus U \in \tau$. As an order-theoretic counterpart to open and closed subsets, we say that a subest $U$ of a quasi-ordered set $(\mathcal{E}, \leq)$ is upwards-closed whenever for all $x \in U$, $x \leq y$ implies $y \in U$. Similarly, a subset is downwards-closed whenever its complement is upwards-closed. One can convert back and forth between the two as follows:

*Notation 2.1.* Let $(\mathcal{E}, \leq)$ be a quasi-order and $(\mathcal{X}, \tau)$ be a topological space. The Alexandroff topology *alex*($\leq$) over $\mathcal{E}$ is the collection of upwards-closed subsets of $\mathcal{E}$. The specialisation pre-order $\leq_{\tau}$ is defined via $x \leq_{\tau} y$ whenever for every open subset $U \in \tau$, if $x \in U$ then $y \in U$.

It is an easy check that the *specialisation pre-order* of the Alexandroff topology of a quasi-order $\leq$ is the quasi-order itself. Beware that several topologies can share the same *specialisation pre-order* $\leq$, and among those, the Alexandroff topology is the finest.

We can now build the topological analogue to *wqos* through the notion of compactness: a subset $K$ of $\mathcal{X}$ is defined as *compact* whenever from every family $(U_i)_{i \in I}$ of open sets such that $K \subseteq \bigcup_{i \in I} U_i$, one can extract a finite subset $J \subseteq I$ such that $K \subseteq \bigcup_{i \in J} U_i$. A quasi-order $(\mathcal{E}, \leq)$ is *wqo* if and only if every subset $K$ of $\mathcal{E}$ is compact for *alex*($\leq$). Generalising this property to arbitrary topological spaces $(\mathcal{X}, \tau)$, a topological space $(\mathcal{X}, \tau)$ is said to be a *Noetherian space* whenever every subset of $\mathcal{X}$ is compact.
<table><caption>**Table 1.** An *algebra* of Noetherian spaces [see 10, 12, 15].</caption><thead><tr><th>Constructor</th><th>Syntax</th><th>Topology</th></tr></thead><tbody><tr><td>Well-quasi-orders</td><td>ε</td><td>Alexandroff topology</td></tr><tr><td>Complex vectors</td><td>C<sup>k</sup></td><td>Zariski topology</td></tr><tr><td>Disjoint sum</td><td>X<sub>1</sub> + X<sub>2</sub></td><td>co-product topology</td></tr><tr><td>Product</td><td>X<sub>1</sub> × X<sub>2</sub></td><td>product topology</td></tr><tr><td>Finite words</td><td>X<sup>*</sup></td><td>subword topology</td></tr><tr><td>Finite trees</td><td>T(X)</td><td>tree topology</td></tr><tr><td>Finite multisets</td><td>X<sup>⊗</sup></td><td>multiset topology</td></tr><tr><td>Transfinite words</td><td>X<sup>≤α</sup></td><td>transfinite subword topology</td></tr><tr><td>Powerset</td><td>P(X)</td><td>Lower-Vietoris</td></tr></tbody></table>

*Remark 2.2.* A space $(\mathcal{X}, \tau)$ is Noetherian if and only if for every increasing sequence of open subsets $(U_i)_{i \in \mathbb{N}}$, there exists $j \in \mathbb{N}$ such that $\bigcup_{i \in \mathbb{N}} U_i = \bigcup_{i \le j} U_i$.

In order to inductively define Noetherian spaces, we will often rely on basic constructors such as the disjoint sum and the finite product. For completeness, we recall in Table 1 usual constructors that preserve Noetherian spaces. This table also illustrate the versatility of the concept, that encompasses both the algebraic properties of $C^k$ and the order properties of well-quasi-orders.

## 3 Refinements of Noetherian topologies

Let us fix a set $\mathcal{X}$. The collection of topologies over $\mathcal{X}$ is itself a set, and forms a complete lattice for inclusion. In this lattice, the least element is the trivial topology $\tau_{\text{triv}} := \{\emptyset, \mathcal{X}\}$, and the greatest element is the discrete topology $P(\mathcal{X})$. Thanks to Tarski's fixed point theorem, every monotone function $R$ mapping topologies over $\mathcal{X}$ to topologies over $\mathcal{X}$ has a least fixed point, which can be obtained by transfinitely iterating $R$ from the trivial topology. Writing $\text{lfp}_\tau.R(\tau)$ for the least fixed point of $R$, our goal is to provide sufficient conditions for $(\mathcal{X}, \text{lfp}_\tau.R(\tau))$ to be Noetherian.

**Definition 3.1.** A refinement function over a set $\mathcal{X}$ is a function $R$ mapping topologies over $\mathcal{X}$ to topologies over $\mathcal{X}$. Moreover, we assume that $R(\tau)$ is Noetherian whenever $\tau$ is, and that $R(\tau) \subseteq R(\tau')$ when $\tau \subseteq \tau'$.

As $(\mathcal{X}, \tau_{\text{triv}})$ is always Noetherian, $(\mathcal{X}, R^n(\tau_{\text{triv}}))$ is Noetherian for all $n \in \mathbb{N}$ and refinement function $R$. However, it remains unclear whether the transfinite iterations needed to reach a fixed point preserve Noetherian spaces.

We demonstrate in Example 3.2 how to obtain the topology $\text{alex}(\leq)$ over $\mathbb{N}$ as a least fixed point of some simple refinement function. Before that, let us define the notion of upwards-closure: given a quasi-order $(\mathcal{E}, \leq)$ and a set $E \subseteq \mathcal{E}$, let us define the *upwards-closure* of $E$, written $\uparrow \leq E$, as the set of elements that are greater or equal than some element of $E$ in $\mathcal{E}$.
*Example 3.2 (Natural Numbers)*. Over $X := \mathbb{N}$, one can define $\text{Div}(\tau)$ as the collection of the sets $\uparrow \le (U+1)$ for $U \in \tau$, plus $\mathbb{N}$ itself. Then $\text{Div}(\tau_{\text{triv}}) = \{\emptyset, \uparrow \le 1, \mathbb{N}\}$, $\text{Div}^2(\tau_{\text{triv}}) = \{\emptyset, \uparrow \le 1, \uparrow \le 2, \mathbb{N}\}$. More generally, for every $k \ge 0$, $\text{Div}^k(\tau_{\text{triv}}) = \{\emptyset, \uparrow \le 1, \dots, \uparrow \le k, \mathbb{N}\}$. It is an easy check that $\text{lfp}_\tau \cdot \text{Div}(\tau)$ is precisely $\text{alex}(\le)$, which is Noetherian because $(\mathbb{N}, \le)$ is a well-quasi-ordering.

**3.1 An ill-behaved refinement function**

Not all *refinement functions* behave as nicely as in *Example 3.2*, and one can obtain non-Noetherian topologies via their least fixed points.

Let us consider for this section $\Sigma := \{a, b\}$ with the *discrete topology*, i.e., $\{\emptyset, \{a\}, \{b\}, \Sigma\}$. Let us now build the set $\Sigma^*$ of finite words over $\Sigma$. Whenever $U$ and $V$ are subsets of $\Sigma^*$, let us write $UV$ for their concatenation, defined as $\{uv: u \in U, v \in V\}$. To construct an ill-behaved refinement function, we will associate to a topology $\tau$ the set $\{UV: U \in \{\emptyset, \{a\}, \{b\}, \Sigma\}, V \in \tau\}$. However, the latter fails to be a topology in general. This problem frequently appears in this paper, and is solved by considering the so-called generated topology.

Let us briefly recall that for every set $\mathcal{X}$ and collection of subsets $B \subseteq \mathcal{P}(\mathcal{X})$, one can construct the topology generated from $B$ as the least topology on $\mathcal{X}$ containing $B$. This topology coincides with the one containing arbitrary unions of finite intersections of subsets in $B$. We say that $B$ is a *subbasis* of $\tau$ when $\tau$ is the topology generated by $B$. Alexanders's Subbase Lemma allows to study Noetherian spaces in this setting [12, Thm. 4.4.29]: it states that checking whether a subset $K$ of $\mathcal{X}$ is compact in $\tau$ can be done by considering only open subsets in $B$, i.e., that for every family $(U_i)_{i \in I}$ of a subbasis $B$ of $\tau$ such that $K \subseteq \bigcup_{i \in I} U_i$, one can extract a finite subset $J \subseteq I$ such that $K \subseteq \bigcup_{j \in J} U_j$.

**Definition 3.3.** Let $\mathbb{R}_{\text{pref}}$ be the function mapping a topology $\tau$ over $\Sigma^*$ to the topology generated by the sets $UV$ where $U \subseteq \Sigma$ and $V \in \tau$,

We refer to Figure 1 for a graphical presentation of the first two iterations of the refinement function $\mathbb{R}_{\text{pref}}$. For the sake of completeness, let us compute $\text{lfp}_{\tau} \cdot \mathbb{R}_{\text{pref}}(\tau)$, which is the Alexandroff topology of the prefix ordering on words.

**Definition 3.4.** The prefix topology$^3$ $\tau_{\text{pref}}^*$, over $\Sigma^*$ is generated by the following open sets: $U_1 \dots U_n \Sigma^*$, where $n \ge 0$ and $U_i \subseteq \Sigma$.

**Lemma 3.5.** The prefix topology over $\Sigma^*$ is the least fixed point of $\mathbb{R}_{\text{pref}}$.

**Lemma 3.6.** The function $\mathbb{R}_{\text{pref}}$ is a refinement function.

*Proof.* It is an easy check that whenever $\tau \subseteq \tau'$, $\mathbb{R}_{\text{pref}}(\tau) \subseteq \mathbb{R}_{\text{pref}}(\tau')$. Now, assume that $\tau$ is Noetherian, it remains to prove that $\mathbb{R}_{\text{pref}}(\tau)$ remains Noetherian. Consider a subset $E \subseteq \Sigma^*$ and let us prove that $E$ is compact in $\mathbb{R}_{\text{pref}}(\tau)$.

<footnote>$^3$ This definition differs from what is called the “prefix topology” in the literature [see 6, 12, resp. Section 8 and Exercise 9.7.36].</footnote>
<figure><img src="image_3.png" /><figcaption>**Fig. 1.** Iterating $R_{\text{pref}}$ over $\Sigma^*$. On the left the trivial topology $\tau_{\text{triv}}$, followed by $R_{\text{pref}}$, and on the right $R_{\text{pref}}^2$.</figcaption></figure>

For that, we consider an open cover $E \subseteq \bigcup_{i \in I} W_i$, where $W_i \in R_{\text{pref}}(\tau)$. Thanks to Alexander's subbase lemma, we can assume without loss of generality that $W_i$ is a subbasic open set of $R_{\text{pref}}(\tau)$, that is, $W_i = U_i V_i$ with $U_i \subseteq \Sigma$ and $V_i \in \tau$.

Since $(\Sigma^*, \tau) \times (\Sigma^*, \tau)$ is Noetherian (see Table 1), there exists a finite set $J \subseteq I$ such that $\bigcup_{i \in J} U_i \times V_i = \bigcup_{i \in I} U_i \times V_i$. This implies that $E \subseteq \bigcup_{i \in J} U_i V_i$, and provides a finite subcover of $E$. $\square$

The sequence $\bigcup_{0 \le i \le k} a^i b^{\Sigma^*}$, for $k \in \mathbb{N}$, is a strictly increasing sequence of opens. Therefore, the prefix topology is not Noetherian. The terms $a^i b^{\Sigma^*}$ can be observed in Figure 1 as a diagonal of incomparable open sets.

**Corollary 3.7.** *The topology $\text{lfp}_\tau.R_{\text{pref}}(\tau)$ is not Noetherian.*

The prefix topology is not Noetherian, even when starting from a finite alphabet. However, we claimed in Section 1 that there is a natural generalisation of the subword embedding to topological spaces which is Noetherian. Before introducing this topology, let us write $[U_1, \dots, U_n]$ as a shorthand notation for the set $\Sigma^* U_1 \Sigma^* \dots \Sigma^* U_n \Sigma^*$.

**Definition 3.8 (Subword topology [12, Definition 9.7.26]).** *Given a topological space $(\Sigma, \tau)$, the space $\Sigma^*$ of finite words over $\Sigma$ can be endowed with the subword topology, generated by the open sets $[U_1, \dots, U_n]$ when $U_i \in \tau$.*

The topological Higman lemma [12, Theorem 9.7.33] states that the subword topology over $\Sigma^*$ is Noetherian if and only if $\Sigma$ is Noetherian. Although the subword topology might seem ad-hoc, it can be validated as a generalisation of the subword embedding because the subword topology of $\text{alex}(\leq)$ equals the Alexandroff topology of the subword ordering of $\leq$, for every quasi-order $\leq$ over $\Sigma$ [12, Exercise 9.7.30]. Let us now reverse engineer a refinement function whose least fixed point is the subword topology.

**Definition 3.9.** Let $(\Sigma, \theta)$ be a topological space. Let $E_{\text{words}}^\theta$ be defined as mapping a topology $\tau$ over $\Sigma^*$ to the topology generated by the following sets: $\uparrow_{\leq_*} UV$ for $U, V \in \tau$; and $\uparrow_{\leq_*} W$, for $W \in \theta$.
<figure><img src="image_4.png" /><figcaption>**Fig. 2.** The topology $E_{\text{words}}^{\theta} {}^2(\tau_{\text{triv}})$, with bold red arrows for the inclusions that were not present between the “analogous sets” in $\mathbb{R}_{\text{pref}}^2(\tau_{\text{triv}})$. We have taken $\theta$ to be the discrete topology over $\Sigma$.</figcaption></figure>

**Lemma 3.10.** Let $(\Sigma, \theta)$ be a topological space. The subword topology over $\Sigma^*$ is the least fixed point of $E_{\text{words}}^{\theta}$.

In order to show that $E_{\text{words}}^{\theta}$ is a refinement function, we first claim that the two parts of the topology can be dealt with separately.

**Lemma 3.11 ([12, Proposition 9.7.18]).** If $(\mathcal{X}, \tau)$ and $(\mathcal{X}, \tau')$ are Noetherian, then $\mathcal{X}$ endowed with the topology generated by $\tau \cup \tau'$ is Noetherian.

**Lemma 3.12.** Let $(\Sigma, \theta)$ be a Noetherian topological space. The map $E_{\text{words}}^{\theta}$ is a refinement function over $\Sigma$.

*Proof.* We leave the monotonicity of $E_{\text{words}}^{\theta}$ as an exercise and focus on the proof that $E_{\text{words}}^{\theta}(\tau)$ is Noetherian, whenever $\tau$ is. Thanks to Lemma 3.11, it suffices to prove that the topology generated by the sets $\uparrow_{\le \ast} UV$ ($U, V$ open in $\tau$), and the topology generated by the sets $\uparrow_{\le \ast} W$ ($W$ open in $\theta$) are Noetherian.

Let $(\uparrow_{\le \ast} U_i V_i)_{i \in \mathbb{N}}$ be a sequence of open sets. Because Noetherian topologies are closed under products (see Table 1), there exists $k$ such that $\bigcup_{i \le k} U_i \times V_i = \bigcup_{i \in \mathbb{N}} U_i \times V_i$. Hence, $\bigcup_{i \le k} \uparrow_{\le \ast} U_i V_i = \bigcup_{i \in \mathbb{N}} \uparrow_{\le \ast} U_i V_i$

Let $\uparrow_{\le \ast} W_i$ be a sequence of open sets. Because $\theta$ is Noetherian, there exists $k$ such that $\bigcup_{i \le k} W_i = \bigcup_{i \in \mathbb{N}} W_i$, hence $\bigcup_{i \le k} \uparrow_{\le \ast} W_i = \bigcup_{i \in \mathbb{N}} \uparrow_{\le \ast} W_i$. $\square$

We have designed two refinement functions $\mathbb{R}_{\text{pref}}$ and $E_{\text{words}}^{\theta}$ over $\Sigma^*$. Fixing $\theta$ to be the discrete topology over $\Sigma$, the least fixed point of $\mathbb{R}_{\text{pref}}$ is not Noetherian while the least fixed point of $E_{\text{words}}^{\theta}$ is. We have depicted the result of iterating $E_{\text{words}}^{\theta}$ twice over the trivial topology in Figure 2. As opposed to $\mathbb{R}_{\text{pref}}$, the “diagonal” elements are comparable for inclusion.

## 3.2 Well-behaved refinement functions

In this section, we will show how the behaviour of refinement function with respect to subsets will act as a sufficient condition to separate the well-behaved
ones from the others. In order to make the idea of computing the refinement function directly over a subset precise, we will replace a subset with the induced topology by a “restricted” topology over the whole space.

**Definition 3.13.** Let $(\mathcal{X}, \tau)$ be a topological space and $H$ be a closed subset of $\mathcal{X}$. Define the subset restriction $\tau|H$ to be the topology generated by the open subsets $U \cap H$ where $U$ ranges over $\tau$.

Let $\mathcal{X}$ be a topological space, and $H$ be a proper closed subset of $\mathcal{X}$. The space $\mathcal{X}$ endowed with $\tau|H$ has a lattice of open sets that is isomorphic to the one of the space $H$ endowed with the topology induced by $\tau$, except for the entire space $\mathcal{X}$ itself. As witnessed by Example 3.14, the two spaces are in general not homeomorphic.

*Example 3.14.* Let $\mathbb{R}$ be endowed with the usual metric topology. The set $\{a\}$ is a closed set when $a \in \mathbb{R}$. The induced topology over $\{a\}$ is $\{\emptyset, \{a\}\}$. The subset restriction of the topology to $\{a\}$ is $\tau_a := \{\emptyset, \{a\}, \mathbb{R}\}$. Clearly, $(\mathbb{R}, \tau_a)$ and $(\{a\}, \tau_{\text{triv}})$ are not homeomorphic.

In order to build intuition, let us consider the special case of an Alexandroff topology over $\mathcal{X}$ and compute the specialisation preorder of $\tau|H$, where $H$ is a downwards closed set.

**Lemma 3.15.** Let $\tau = \text{alex}(\leq)$ over a set $\mathcal{X}$, and $x, y \in X$. Then, $x \leq_{\tau|H} y$ if and only if $x \leq_{\tau} y \land y \in H$ or $x \notin H$. In other words, $H^c$ is collapsed to an equivalence class below $H$ itself.

**Definition 3.16.** A topology expander is a refinement function $\mathcal{E}$ that satisfies the following extra property: for every Noetherian topology $\tau$ satisfying $\tau \subseteq \mathcal{E}(\tau)$, for all closed set $H$ in $\tau$, $\mathcal{E}(\tau)|H \subseteq \mathcal{E}(\tau|H)|H$.

**Lemma 3.17.** The refinement function $\mathbb{R}_{\text{pref}}$ is not a topology expander.

*Proof.* Let us consider $\tau := \{\emptyset, a\Sigma^*, b\Sigma^*, \Sigma^*\}$. Remark that $H := a\Sigma^* \cup \{\varepsilon\}$ is a closed subset because $\Sigma = \{a, b\}$. It is an easy check that $\mathbb{R}_{\text{pref}}(\tau)|H = \{\emptyset, aa\Sigma^*, ab\Sigma^*, a\Sigma^*, \Sigma^*\} \neq \{\emptyset, aa\Sigma^*, a\Sigma^*, \Sigma^*\} = \mathbb{R}_{\text{pref}}(\tau|H)|H$.

**Lemma 3.18.** When $\theta$ is Noetherian, $\mathbb{E}_{\text{words}}^{\theta}$ is a topology expander.

*Proof.* We have proven in Lemma 3.12 that $\mathbb{E}_{\text{words}}^{\theta}$ is a refinement function. Let us now prove that it is a topology expander.

Let $\tau$ be a Noetherian topology over $\Sigma^*$, such that $\tau \subseteq \mathbb{E}_{\text{words}}^{\theta}(\tau)$. Let $H$ be a closed subset of $(\Sigma^*, \tau)$. Notice that as $H$ is closed in $\tau$, and since $\tau \subseteq \mathbb{E}_{\text{words}}^{\theta}(\tau)$, $H$ is downwards closed for $\leq_*$. As a consequence, $(\uparrow_{\leq_*} UV) \cap H = (\uparrow_{\leq_*} (U \cap H)(V \cap H)) \cap H$. Hence, $\mathbb{E}_{\text{words}}^{\theta}(\tau)|H \subseteq \mathbb{E}_{\text{words}}^{\theta}(\tau|H)|H$. $\square$
## 3.3 Iterating Expanders

Our goal is now to prove that topology expanders are refinement functions that can be safely iterated. For that, let us first define precisely what “iterating transfinitely” a refinement function means.

**Definition 3.19.** Let $(\mathcal{X}, \tau)$ be a topological space, and $\mathbb{E}$ be a topology expander. The limit topology $\mathbb{E}^{\alpha}(\tau)$ is defined as: $\tau$ when $\alpha = 0$, $\mathbb{E}(\mathbb{E}^{\beta}(\tau))$ when $\alpha = \beta + 1$, and as the join of the topologies $\mathbb{E}^{\beta}(\tau)$ for all $\beta < \alpha$, when $\alpha$ is a limit ordinal.

We devote the rest of this section to proving our main theorem, which immediately implies that least fixed points of topology expanders are Noetherian. Notice that the theorem is trivial whenever $\alpha$ is a successor ordinal.

**Proposition 3.20.** Let $\alpha$ be an ordinal, $\tau$ be a topology, and $\mathbb{E}$ be a topology expander. If $\mathbb{E}^{\beta}(\tau)$ is Noetherian for all $\beta < \alpha$, and $\tau \subseteq \mathbb{E}(\tau)$, then $\mathbb{E}^{\alpha}(\tau)$ is Noetherian.

**Theorem 3.21 (Main Result).** Let $\mathcal{X}$ be a set and $\mathbb{E}$ be a topology expander. The least fixed point of $\mathbb{E}$ is a Noetherian topology over $\mathcal{X}$.

**The topological minimal bad sequence argument.** In order to prove Theorem 3.21, we will use a topological minimal bad sequence argument. To that end, let us first introduce a well-founded partial ordering over the elements of $\mathbb{E}^{\alpha}(\tau)$. With an open set $U \in \mathbb{E}^{\alpha}(\tau)$, we associate a depth $\text{depth}(U)$, defined as the smallest ordinal $\beta \le \alpha$ such that $U \in \mathbb{E}^{\beta}(\tau)$. We then define $U \trianglelefteq V$ to hold whenever $\text{depth}(U) \le \text{depth}(V)$, and $U \triangleleft V$ whenever $\text{depth}(U) < \text{depth}(V)$. It is an easy check that this is a well-founded total quasi-order over $\mathbb{E}^{\alpha}(\tau)$.

As a first step towards proving that $\mathbb{E}^{\alpha}(\tau)$ is Noetherian for a limit ordinal $\alpha$, we first reduce the problem to open subsets of depth strictly less than $\alpha$ itself.

**Lemma 3.22.** Let $\alpha$ be a limit ordinal, and $\mathbb{E}$ be a topology expander. The topology $\mathbb{E}^{\alpha}(\tau)$ has a subbasis of elements of depth strictly below $\alpha$.

Let us recall the notion of topological bad sequence designed by Goubault-Larrecq [12, Lemma 9.7.31] in the proof of the Topological Kruskal Theorem, adapted to our ordering of subbasic open sets.

**Definition 3.23.** Let $(\mathcal{X}, \tau)$ be a topological space. A sequence $U = (U_i)_{i \in \mathbb{N}}$ of open subsets is good if there exists $i \in \mathbb{N}$ such that $U_i \subseteq \bigcup_{j<i} U_j$. A sequence that is not good is called bad.

**Lemma 3.24.** Let $\alpha$ be a limit ordinal, and $\mathbb{E}$ be a topology expander such that $\mathbb{E}^{\alpha}(\tau)$ is not Noetherian. Then, there exists a bad sequence $U$ of open subsets in $\mathbb{E}^{\alpha}(\tau)$ of depth less than $\alpha$ that is lexicographically minimal for $\trianglelefteq$. Such a sequence is called minimal bad.
We deduce that in a *limit topology*, *minimal bad sequences* are not allowed to use open subsets of arbitrary depth. This will then be leveraged via **Lemma 3.27** to decrease the depth by one.

**Lemma 3.25.** Let $\alpha$ be a limit ordinal, $\tau$ be a topology and $\mathbb{E}$ be a topology expander such that $\mathbb{E}^\beta(\tau)$ is Noetherian for all $\beta < \alpha$. Assume that $\mathcal{U} = (U_i)_{i \in \mathbb{N}}$ is a minimal bad sequence of $\mathbb{E}^\alpha(\tau)$. Then, for every $i \in \mathbb{N}$, $\text{depth}(U_i)$ is either 0 or a successor ordinal.

**Definition 3.26.** Let $\alpha$ be an ordinal, $\tau$ be a topology, $\mathbb{E}$ be a topology expander such that $\tau \subseteq \mathbb{E}(\tau)$, and let $U \in \mathbb{E}^\alpha(\tau)$. The topology $\text{Down}(U)$ is generated by the open sets $V$ such that $V \triangleleft U$, where $V$ ranges over $\mathbb{E}^\alpha(\tau)$.

**Lemma 3.27.** Let $\alpha$ be an ordinal, $\mathbb{E}$ be a topology expander and $U \in \mathbb{E}^\alpha(\tau)$. If $\text{depth}(U)$ is a successor ordinal, then $U \in \mathbb{E}(\text{Down}(U))$.

If $\mathcal{U}$ is a minimal bad sequence in $(X, \mathbb{E}^\alpha(\tau))$, then $U_i \not\subseteq \bigcup_{j<i} U_j := V_i$, i.e., $U_i \cap V_i^c \neq \emptyset$. We can now use our subset restriction operator to devise a topology associated to this minimal bad sequence. Noticing that $H_i := V_i^c$ is a closed set in $\mathbb{E}^\alpha(\tau)$, hence we can build the subset restriction $\text{Down}(U_i)|_{H_i}$.

**Definition 3.28.** Let $\alpha$ be an ordinal, $\tau$ be a topology, $\mathbb{E}$ be a topology expander such that $\tau \subseteq \mathbb{E}(\tau)$, and let $\mathcal{U} = (U_i)_{i \in \mathbb{N}}$ be a minimal bad sequence in $\mathbb{E}^\alpha(\tau)$. Then, the minimal topology $\mathcal{U}(\mathbb{E}^\alpha(\tau))$ is generated by $\bigcup_{i \in \mathbb{N}} \text{Down}(U_i)|_{H_i}$, where $H_i := (\bigcup_{j<i} U_j)^c$.

**Lemma 3.29.** Let $\alpha$ be an ordinal, $\tau$ be a topology, $\mathbb{E}$ be a topology expander such that $\tau \subseteq \mathbb{E}(\tau)$, and let $\mathcal{U} = (U_i)_{i \in \mathbb{N}}$ be a minimal bad sequence in $\mathbb{E}^\alpha(\tau)$. Then, the minimal topology $\mathcal{U}(\mathbb{E}^\alpha(\tau))$ is Noetherian.

*Proof.* Assume by contradiction that $\mathcal{U}(\mathbb{E}^\alpha(\tau))$ is not Noetherian. Let us define $V_i$ as $\bigcup_{j<i} U_j$, and $H_i$ as $V_i^c$.

Thanks to [12, Lemma 9.7.15] there exists a bad sequence $\mathcal{W} := (W_i)_{i \in \mathbb{N}}$ of subbasic elements of $\mathcal{U}(\mathbb{E}^\alpha(\tau))$. By definition, $W_i$ is in some $\text{Down}(U_j)|_{H_j}$. Let us select a mapping $\rho: \mathbb{N} \to \mathbb{N}$, such that $W_i \in \text{Down}(U_{\rho(i)})|_{H_{\rho(i)}}$. This amounts to the existence of an open $T_{\rho(i)}$, such that $T_{\rho(i)} \triangleleft U_{\rho(i)}$, and $W_i = T_{\rho(i)} \setminus V_{\rho(i)}$. Without loss of generality we assume that $\rho$ is monotonic.

Let us build the sequence $\mathcal{Y}$ defined by $Y_i := U_i$ if $i < \rho(0)$ and $Y_i := T_{\rho(i)}$ otherwise. This is a sequence of open sets in $\mathbb{E}^\alpha(\tau)$ that is lexicographically smaller than $\mathcal{U}$, hence $\mathcal{Y}$ is a good sequence: there exists $i \in \mathbb{N}$ such that $Y_i \subseteq \bigcup_{j<i} Y_j$.

- If $i < \rho(0)$, then $U_i \subseteq \bigcup_{j<i} U_j$ contradicting that $\mathcal{U}$ is bad.

- If $i \ge \rho(0)$, let us write $Y_i = T_{\rho(i)} \subseteq \bigcup_{j<\rho(0)} U_j \cup \bigcup_{j<i} T_{\rho(j)}$. By taking the intersection with $H_{\rho(i)}$, we obtain $W_i \subseteq \bigcup_{j<i} W_j$, contradicting the fact that $\mathcal{W}$ is a bad sequence. $\square$

We are now ready to leverage our knowledge of minimal topologies associated with minimal bad sequences to carry on the proof of our main theorem.
**Proposition 3.20.** Let $\alpha$ be an ordinal, $\tau$ be a topology, and $\mathbb{E}$ be a topology expander. If $\mathbb{E}^{\beta}(\tau)$ is Noetherian for all $\beta < \alpha$, and $\tau \subseteq \mathbb{E}(\tau)$, then $\mathbb{E}^{\alpha}(\tau)$ is Noetherian.

*Proof.* If $\alpha$ is a successor ordinal, then $\alpha = \beta + 1$ and $\mathbb{E}^{\alpha}(\tau)$ is Noetherian, using Lemma 3.24 there exists a minimal bad sequence $\mathcal{U} := (U_i)_{i \in \mathbb{N}}$. Let us write $d_i := \text{depth}(U_i) < \alpha$. Thanks to Lemma 3.25, $d_i$ is either 0 or a successor ordinal.

Because $\mathbb{E}^{\beta}(\tau)$ is Noetherian for $\beta < \alpha$, there are finitely many open subsets $U_i$ at depth $\beta$ for every ordinal $\beta < \alpha$. Indeed, if they were infinitely many, one would extract an infinite bad sequence of opens in $\mathbb{E}^{\beta}(\tau)$, which is absurd.

Furthermore, the sequence $(d_i)_{i \in \mathbb{N}}$ must be monotonic, otherwise $\mathcal{U}$ would not be lexicographically minimal. We can therefore construct a strictly increasing map $\rho: \mathbb{N} \to \mathbb{N}$ such that $0 < \text{depth}(U_{\rho(j)})$ and $\text{depth}(U_i) < \text{depth}(U_{\rho(j)})$ whenever $0 \le i < \rho(j)$.

Let us consider some $i = \rho(n)$ for some $n \in \mathbb{N}$. Let us write $V_i := \bigcup_{j<i} U_j$, and $H_i := X \setminus V_i$. The set $V_i$ is open in $\text{Down}(U_i)$ by construction of $\rho$, hence $H_i$ is closed in $\text{Down}(U_i)$. As $\mathbb{E}$ is a topology expander, we derive the following inclusions:

$$ \mathbb{E}(\text{Down}(U_i))|H_i \subseteq \mathbb{E}(\text{Down}(U_i)|H_i)|H_i \\ \subseteq \mathbb{E}(\mathcal{U}(\mathbb{E}^{\alpha}(\tau)))|H_i $$

Recall that $U_i \in \mathbb{E}(\text{Down}(U_i))$ thanks to Lemma 3.27. As a consequence, $U_i \setminus V_i = W_i \setminus V_i$ for some open set $W_i$ in $\mathbb{E}(\mathcal{U}(\mathbb{E}^{\alpha}(\tau)))$. Thanks to Lemma 3.29, and preservation of Noetherian topologies through topology expanders, the latter is a Noetherian topology. Therefore, $(W_{\rho(i)})_{i \in \mathbb{N}}$ is a good sequence. This provides an $i \in \mathbb{N}$ such that $W_{\rho(i)} \subseteq \bigcup_{\rho(j)<\rho(i)} W_{\rho(j)}$. In particular,

$$ \begin{aligned} U_{\rho(i)} \setminus V_{\rho(i)} &= W_{\rho(i)} \setminus V_{\rho(i)} \subseteq \bigcup_{\rho(j)<\rho(i)} W_{\rho(j)} \setminus V_{\rho(i)} \subseteq \bigcup_{\rho(j)<\rho(i)} W_{\rho(j)} \setminus V_{\rho(j)} \\ &\subseteq \bigcup_{\rho(j)<\rho(i)} U_{\rho(j)} \setminus V_{\rho(j)} \subseteq \bigcup_{j<\rho(i)} U_j = V_{\rho(i)} \end{aligned} $$

This proves that $U_{\rho(i)} \subseteq V_{\rho(i)}$, i.e. that $U_{\rho(i)} \subseteq \bigcup_{j<\rho(i)} U_j$. Finally, this contradicts the fact that $\mathcal{U}$ is bad. $\square$

We have effectively proven that being well-behaved with respect to closed subspaces is enough to consider least fixed points of refinement functions. This behaviour should become clearer in the upcoming sections, where we illustrate how this property can be ensured both in the case of Noetherian spaces and well-quasi-orderings.
# 4 Applications of Topology Expanders

We now briefly explore topologies that can be proven to be Noetherian using Theorem 3.21. It should not be surprising that both the topological Higman lemma and the topological Kruskal theorem fit in the framework of topology expanders, as both were already proven using a minimal bad sequence argument. However, we will proceed to extend the use of topology expander to spaces for which the original proof did not use a minimal bad sequence argument, and illustrate how they can easily be used to define new Noetherian topologies.

**Finite words and finite trees.** As a first example, we can easily recover the topological Higman lemma [12, Theorem 9.7.33] because the subword topology is the least fixed point of $E_{\text{words}}^{\theta}$, which is a topology expander (see Lemmas 3.10 and 3.18).

It does not require much effort to generalise this proof scheme to the case of the topological Kruskal theorem [12, Theorem 9.7.46]. As a shorthand notation, let us write $t \in \diamond U\langle V\rangle$ whenever there exists a subtree $t'$ of $t$ whose root is labelled by an element of $U$ and whose list of children belongs to $V$. Recall that we write $u \le_{*} v$ when $u$ is a scattered subword of $v$, and $t \le_{\text{tree}} t'$ when $t$ embeds in $t'$ as a tree (see page 2). As for the subword topology, the definition is ad-hoc but correctly generalises the tree embedding relation because the tree topology of $\text{alex}(\leq)$ is the Alexandroff topology of $\leq_{\text{tree}}$, for every ordering $\leq$ over $\Sigma$ [12, Exercise 9.7.48].

**Definition 4.1 ([12, Definition 9.7.39]).** Let $(\Sigma, \theta)$ be a topological space. The space $\mathcal{T}(\Sigma)$ of finite trees over $\Sigma$ can be endowed with the tree topology, the coarsest topology such that $\diamond U\langle V\rangle$ is open whenever $U$ is an open set of $\Sigma$, and $V$ is an open set of $\mathcal{T}(\Sigma)^*$ in its subword topology.

**Definition 4.2.** Let $(\Sigma, \theta)$ be a topological space. Let $E_{\text{tree}}^{\theta}$ be the function that maps a topology $\tau$ to the topology generated by the sets $\uparrow_{\leq_{\text{tree}}} U\langle V\rangle$, for $U$ open in $\theta$, $V$ open in $\mathcal{T}(\Sigma)^*$ with the subword topology of $\tau$.

**Lemma 4.3.** The tree topology is the least fixed point of $E_{\text{tree}}^{\theta}$, which is a topology expander. Hence, the tree topology is Noetherian when $\theta$ is.

**Ordinal words.** Let us now demonstrate how Theorem 3.21 can be applied over spaces which are proved to be Noetherian without using a minimal bad sequence argument. For that, let us consider $\Sigma^{<\alpha}$ the set of words of ordinal length less than $\alpha$, where $\alpha$ is a fixed ordinal. Since $\leq_{*}$ is in general not a wqo on $\Sigma^{<\alpha}$ when $\leq$ is wqo on $\Sigma$, this also provides an example of a topological minimal bad sequence argument that has no counterpart in the realm of wqos.

**Definition 4.4 ([15]).** Let $(\Sigma, \theta)$ be a topological space. The ordinal subword topology over $\Sigma^{<\alpha}$ is the topology generated by the closed sets $F_1^{<\beta_1} \dots F_n^{<\beta_n}$, for $n \in \mathbb{N}$, $F_i$ closed in $\theta$, $\beta_i < \alpha$, and where $F^{<\beta}$ is the set of words of length less than $\beta$ with all of their letters in $F$.
The ordinal subword topology is Noetherian [15], but the proof is quite technical and relies on the in-depth study of the possible inclusions between the subbasic closed sets. Before defining a suitable topology expander, given an ordinal $\beta$ and a set $U \subseteq \Sigma^{<\alpha}$, let us write $w \in \beta \triangleright U$ if and only if $w_{>\gamma} \in U$ for all $0 \le \gamma < \beta$.

**Definition 4.5.** Let $(\Sigma, \theta)$ be a topological space, and $\alpha$ be an ordinal. The function $E_{\alpha\text{-words}}^{\theta}$ maps a topology $\tau$ to the topology generated by the following sets: $\uparrow_{\le \ast} UV$ for $U, V$ opens in $\tau$; $\uparrow_{\le \ast} \beta \triangleright U$, for $U$ open in $\tau$, $\beta \le \alpha$; $\uparrow_{\le \ast} W$, for $W$ open in $\theta$.

**Lemma 4.6.** Given a Noetherian space $(\Sigma, \theta)$, and an ordinal $\alpha$. The map $E_{\alpha\text{-words}}^{\theta}$ is a topology expander, whose least fixed point contains the ordinal subword topology. Therefore, the ordinal subword topology is Noetherian.

Remark that Definitions 4.2, 4.5 and 3.9 all follow the same blueprint: new open sets are built as upwards closure for the corresponding quasi-order of the natural constructors associated to the space. We argue that this blueprint mitigates the canonicity issue and the complexity of Definitions 4.1, 4.4 and 3.8.

**Ordinal branching trees.** As an example of a new Noetherian topology derived using Theorem 3.21, we will consider $\alpha$-branching trees $T^{<\alpha}(\Sigma)$, i.e., the least fixed point of the constructor $X \mapsto 1 + \Sigma \times X^{<\alpha}$ where $\alpha$ is a given ordinal. This example was not known to be Noetherian, and fails to be a well-quasi-order, and illustrates how Theorem 3.21 easily applies on inductively defined spaces.

**Definition 4.7.** Let $(\Sigma, \theta)$ be a Noetherian space. The ordinal tree topology over $\alpha$-branching trees is the least fixed point of $E_{\alpha\text{-trees}}^{\theta}$, mapping a topology $\tau$ to the topology generated by the sets $\uparrow_{\le \text{tree}} U\langle V \rangle$, where $U \in \theta$, $V$ is open in $(T^{<\alpha}(\Sigma))^{<\alpha}$ with the ordinal subword topology, and $U\langle V \rangle$ is the set of trees whose root is labelled by an element of $U$ and list of children belongs to $V$.

**Theorem 4.8.** The $\alpha$-branching trees endowed with the ordinal tree topology forms a Noetherian space.

*Proof.* It suffices to prove that $E_{\alpha\text{-trees}}^{\theta}$ is a topology expander. It is clear that $E_{\alpha\text{-trees}}^{\theta}$ is monotone, and a closed set of $E_{\alpha\text{-trees}}^{\theta}(\tau)$ is always downwards closed for $\le \text{tree}$. As a consequence, if $\tau \subseteq E_{\alpha\text{-trees}}^{\theta}(\tau)$ and $H$ is closed in $\tau$, $t \in V := (\uparrow_{\le \text{tree}} U\langle V \rangle) \cap H$ if and only if $t \in H$ and every children of $t$ belongs to $H$. Therefore, $(\uparrow_{\le \text{tree}} U\langle V \rangle) \cap H = (\uparrow_{\le \text{tree}} U\langle V \cap H^{<\alpha} \rangle) \cap H$. Notice that $H^{<\alpha} \cap V$ is an open of the ordinal subword topology over $\tau|H$. As a consequence, $V \cap H \in E_{\alpha\text{-trees}}^{\theta}(\tau|H)|H$.

Let us now check that $E_{\alpha\text{-trees}}^{\theta}$ preserves Noetherian topologies. Let $W_i := \uparrow_{\le \text{tree}} U_i\langle V_i \rangle$ be a $\mathbb{N}$-indexed sequence of open sets in $E_{\alpha\text{-trees}}^{\theta}(\tau)$ where $\tau$ is Noetherian. The product of the topology $\theta$ and the ordinal subword topology over $\tau$ is Noetherian thanks to Table 1 and Lemma 4.6. Hence, there exists a $i \in \mathbb{N}$ such that $U_i \times V_i \subseteq \bigcup_{j<i} U_j \times V_j$. As a consequence, $W_i \subseteq \bigcup_{j<i} W_j$. We have proven that $E_{\alpha\text{-trees}}^{\theta}(\tau)$ is Noetherian. $\square$
At this point, we have proven that the framework of topology expanders allows to build non-trivial Noetherian spaces. We argue that this bears several advantages over ad-hoc proofs: (i) the ad-hoc proofs are often tedious and error prone [12, 13, 15] (ii) the verification that $E$ is a topology expander on the other hand is quite simple (iii) reduces the canonicity issue of topologies to the choice of a suitable topology expander.

# 5 Consequences on inductive definitions

So far, the process of constructing Noetherian spaces has been the following: first build a set of points, then compute a topology that is Noetherian as a least fixed point. In the case where the set of points itself is inductively defined (such as finite words or finite trees), the second step might seem redundant, and getting rid of it provides a satisfactory answer to the canonicity concerns about Noetherian topologies.

Before studying inductive definition of topological spaces, the notion of least fixed-point in this setting has to be made precise. To that purpose, let us now introduce one basic notions of category theory. In this paper only three categories will appear, the category **Set** of sets and functions, the category **Top** of topological spaces and continuous maps, and the category **Ord** of quasi-ordered spaces and monotone maps. Using this language, a unary constructor $G$ in the algebra of wqos defines an **endofunctor** from objects of the category **Ord** to objects of the category **Ord** preserving **well-quasi-orderings**.

**Notation 5.1.** Recall that in a category $C$, $\text{Hom}(A, B)$ is used to denote the collection of morphisms from the object $A$ to the object $B$ in $C$. Moreover, $\text{Aut}(A)$ denotes the set of **automorphisms** of $A$, i.e., invertible elements of $(\text{Hom}(A, A), \circ)$.

In our study of Noetherian spaces (resp. well-quasi-orderings), we will often see constructors $G'$ as first building a new set of structures, and then adapting the topology (resp. ordering) to this new set. In categorical terms, we are interested in **endofunctors $G'$** that are U-lifts of **endofunctors** on **Set**, where $U$ is the forgetful functor from **Top** (resp. **Ord**) to **Set**.

## 5.1 Divisibility Topologies of Analytic Functors

The goal of this section is to introduce the categorical framework needed to formalise the automatic definition of a topology over an inductively defined datatype, and to compare this definition with the work that exists on well-quasi-orders by Hasegawa [17] and Freund [8]. We will avoid as much as possible the use of complex machinery related to analytic functors, and use as a definition an equivalent characterisation given by Hasegawa [17, Theorem 1.6]. For an introduction to analytic functors and combinatorial species, we redirect the reader to Joyal [20].
Notation 5.2. Given $\mathcal{G}$ an endofunctor of $\mathcal{Set}$, the category of elements $\text{el}(\mathcal{G})$ has as objects pairs $(E, a)$ with $a \in \mathcal{G}(E)$, and as morphisms between $(E, a)$ and $(E', a')$ maps $f: E \to E'$ such that $\mathcal{G}_f(a) = a'$.

As an intuition to the unfamiliar reader, an element $(E, a)$ in $\text{el}(\mathcal{G})$ is a witness that $a$ can be produced through $\mathcal{G}$ by using elements of $E$. Morphisms of elements are witnessing how relations between elements of $\mathcal{G}(E)$ and $\mathcal{G}(E')$ arise from relations between $E$ and $E'$. As a way to define a “smallest” set of elements $E$ such that $a$ can be found in $\mathcal{G}(E)$, we rely on transitive objects. We recall that in a category $\mathcal{C}$, if $X, A$ are two objects, the action of $\text{Aut}(X)$ on $\text{Hom}(X, A)$ is transitive when for every pair $f, g \in \text{Hom}(X, A)$, there exists a $h \in \text{Aut}(X)$ such that $f \circ h = g$.

Notation 5.3. A transitive object in a category $\mathcal{C}$ is an object $X$ satisfying the following two conditions for every object $A$ of $\mathcal{C}$: (a) the set $\text{Hom}(X, A)$ in $\mathcal{C}$ is non-empty; (b) the right action of $\text{Aut}(X)$ on $\text{Hom}(X, A)$ by composition is transitive.

Notation 5.4. Given an object $A$ in a category $\mathcal{C}$, one can build the *slice category* $\mathcal{C}/A$ whose objects are elements of $\text{Hom}(B, A)$ when $B$ ranges over objects of $\mathcal{C}$ and morphisms between $c_1 \in \text{Hom}(B_1, A)$ and $c_2 \in \text{Hom}(B_2, A)$ are maps $f: B_1 \to B_2$ such that $c_2 \circ f = c_1$.

This notion of *slice category* can be combined with the one of *transitive object* to build so-called “weak normal forms”.

Notation 5.5. A weak normal form of an object $A$ in a category $\mathcal{C}$ is a transitive object in $\mathcal{C}/A$.

A category $\mathcal{C}$ has the *weak normal form property* whenever every object $A$ has a *weak normal form*. We are now ready to formulate a definition of *analytic functors* through the existence of *weak normal forms* for objects in their category of elements.

Notation 5.6. An endofunctor $\mathcal{G}$ of $\mathcal{Set}$ is an *analytic functor* whenever its category of elements $\text{el}(\mathcal{G})$ has the weak normal form property. Moreover; $X$ is a finite set for every weak normal form $f \in \text{Hom}((X, x), (Y, y))$ in $\text{el}(\mathcal{G})/(Y, y)$.

Example 5.7. The functor mapping $X$ to $X^*$ is analytic, and the weak normal form of a word $(X^*, w)$ is $(\text{letters}(w), w)$ together with the canonical injection from $\text{letters}(w)$ to $X$. In this specific case, the weak normal forms are in fact initial objects.

Example 5.8. The functor mapping $X$ to $X^{<\alpha}$ is not analytic when $\alpha \ge \omega$, because of the restriction that weak normal forms are defined using finite sets.

Let us now explain how these *weak normal forms* can be used to define a *support* associated to the *analytic functor*, which in turns allows us to build a notion of substructure ordering over initial algebras of analytic functors.
**Definition 5.9.** Let $\mathcal{G}$ be an analytic functor, $(X, x)$ be an element in $\text{el}(\mathcal{G})$ and $f \in \text{Hom}((Y, y), (X, x))$ be a weak normal form in the slice category $\text{el}(\mathcal{G})/(X, x)$. We define $f(Y)$ as the support of $x$ in $X$, written $\text{supp}_X(x)$.

**Definition 5.10.** Let $\mathcal{G}$ be an analytic functor and $(\mu\mathcal{G}, \delta)$ be an initial algebra of $\mathcal{G}$. We say that $a \in \mu\mathcal{G}$ is a child of $b \in \mu\mathcal{G}$ whenever $a = b$ or $a \in \text{supp}_{\mu\mathcal{G}}(\delta^{-1}(b))$. The transitive closure of the children relation is called the substructure ordering of $\mu\mathcal{G}$ and written $\sqsubseteq$.

**Example 5.11.** The substructure ordering on $\mu\mathcal{G}$ for $\mathcal{G}(X) := 1 + \Sigma \times X$ is the suffix ordering of words.

We leverage the notion of substructure ordering to define a suitable topology expander over initial algebras of analytic functors. Note that this ordering appears implicitly in the construction of Hasegawa [17, Definition 2.7].

**Definition 5.12.** Let $\mathcal{G}'$: $\text{Top} \to \text{Top}$ be a lifting of an analytic functor $\mathcal{G}$, and $(\mu\mathcal{G}, \delta)$ an initial algebra of $\mathcal{G}$. We define $\mathcal{E}_{\delta}^{\mathcal{G}'}$ that maps $\tau$ to the topology generated by $\upharpoonright_{\delta} \delta(U)$ where $U \in \mathcal{G}'(\mu\mathcal{G}, \tau)$.

We say that $\text{lfp}_\tau \cdot \mathcal{E}_{\delta}^{\mathcal{G}'}$ is the divisibility topology over $\mu\mathcal{G}$.

**Theorem 5.13.** Let $\mathcal{G}'$: $\text{Top} \to \text{Top}$ be a lifting of an analytic functor $\mathcal{G}$, and $(\mu\mathcal{G}, \delta)$ an initial algebra of $\mathcal{G}$. Moreover, we suppose that $\mathcal{G}'$ preserves inclusions. The map $\mathcal{E}_{\delta}^{\mathcal{G}'}$ is a topology expander, hence the divisibility topology is Noetherian.

As a sanity check, we can apply **Theorem 5.13** to the sets of finite words and finite trees, and recover the subword topology and the tree topology that were obtained in an ad-hoc fashion in **Section 4**. In addition to validating the usefulness of **Theorem 5.13**, we believe that these are strong indicators that the topologies introduced prior to this work were the right generalisations of Higman's word embedding and Kruskal's tree embedding in a topological setting, and addresses the canonicity issue of the aforementioned topologies.

**Lemma 5.14.** *The subword topology over $\Sigma^*$, (resp. the tree topology over $\mathcal{T}(\Sigma)$) is the divisibility topology associated to the inductive construction of finite words (resp. finite trees).*

## 5.2 Divisibility Preorders

We are now going to prove that the *divisibility topology* correctly generalises the corresponding notions on quasi-orderings. In the case of finite words, this translates to the equation $\text{alex}(\leq)^* = \text{alex}(\leq^*)$ [12, Exercise 9.7.30]. We relate the *divisibility topology* to the *divisibility preorder* introduced by Hasegawa [17, Definition 2.7].

**Theorem 5.15.** Let $\mathcal{G}'$ be the lift of an analytic functor respecting Alexandroff topologies, Noetherian spaces, and embeddings. Then, the divisibility topology of $\mu\mathcal{G}$ is the Alexandroff topology of the divisibility preorder of $\mu\mathcal{G}$, which is a well-quasi-ordering.
# 6 Outlook

We have provided a systematic way to place a Noetherian topology over an inductively defined datatype, which is correct with respect to its wqo counterpart whenever it exists. As a byproduct, we obtained a uniform framework that simplifies existing proofs, and serves as an indicator that the pre-existing topologies were the “right generalisations” of their quasi-order counterparts. Let us now briefly highlight some interesting properties of the underlying theory.

**Differences with the existing categorical frameworks.** The existing categorical frameworks are built around a specific kind of functors [17, 8], while the notion of topology expander only requires talking about one specific set. This allows proving that the ordinal subword topology and the $\alpha$-branching trees are Noetherian, while these escape both the realm of wqos, and of “well-behaved functors” having finite support functions.

**Quasi-analytic functors.** In fact, the proof of Theorem 5.13, never relies on the finiteness of the support of an element. This means that the definition of analytic functors can be loosened to allow non finite weak normal forms. We do not know whether this notion of “quasi-analytic functor” already exists in the literature.

**Transfinite iterations.** As the reader might have noticed, all of the least fixed points considered in this paper are obtained using at most $\omega$ steps. This is because the topology expanders that are presented in the paper are all Scott-continuous, i.e., they satisfy the equation $E(\sup_i \tau_i) = \sup_i E(\tau_i)$. While Theorem 3.21 does apply to non Scott-continuous topology expanders, we do not know any reasonable example of such expander.

**Lack of ordinal invariants.** Even though our proof that the ordinal subword topology is Noetherian is shorter than the original one, it actually provides less information. In particular, it does not provide a bound for ordinal rank of the lattice of closed sets (called the *stature* of $\Sigma^{<\alpha}$), whereas a clear bound is provided by the previous approach Goubault-Larrecq et al. [15, Proposition 33]. This limitation already appears in the existing categorical frameworks [17, 8], and we believe that this is inherent to the use of minimal bad sequence arguments.

**Acknowledgements.** I thank the anonymous reviewers for their helpful suggestions. I thank Jean Goubault-Larrecq and Sylvain Schmitz for their help and support in writing this paper, together with Simon Halfon for his insight on transfinite words.
References

1. Abdulla, P.A., Čerāns, K., Jonsson, B., Tsay, Y.K.: General decidability theorems for infinite-state systems. Proceedings of LICS'96. pp. 313–321. IEEE (1996). https://doi.org/10.1109/LICS.1996.561359

2. Abdulla, P.A., Jonsson, B.: Verifying networks of timed processes. Proceedings of TACAS'98. Lecture Notes in Computer Science, vol. 1384, pp. 298–312. Springer (1998). https://doi.org/10.1007/BFb0054179

3. Daligault, J., Rao, M., Thomassé, S.: Well-Quasi-Order of Relabel Functions. Order 27(3), 301–315 (2010). https://doi.org/10.1007/s11083-010-9174-0

4. Dershowitz, N., Tzameret, I.: Gap Embedding for Well-Quasi-Orderings. Proceedings of WoLLIC'03. Electronic Notes in Theoretical Computer Science, vol. 84, pp. 80–90. Elsevier (2003). https://doi.org/10.1016/S1571-0661(04)80846-6

5. Figueira, D., Figueira, S., Schmitz, S., Schnoebelen, P.: Ackermannian and Primitive-Recursive Bounds with Dickson's Lemma. Proceedings of LICS'11. pp. 269–278. IEEE (2011). https://doi.org/10.1109/LICS.2011.39

6. Finkel, A., Goubault-Larrecq, J.: Forward analysis for WSTS, part I: completions. Mathematical Structures in Computer Science 30(7), 752–832 (2020). https://doi.org/10.1017/S0960129520000195

7. Finkel, A., Schnoebelen, P.: Well-structured transition systems everywhere! Theoretical Computer Science 256(1), 63–92 (2001). https://doi.org/10.1016/S0304-3975(00)00102-X

8. Freund, A.: From Kruskal's Theorem to Friedman's gap condition. Mathematical Structures in Computer Science 30(8), 952–975 (2020). https://doi.org/10.1017/S0960129520000298

9. Gallier, J.H.: Ann. Pure Appl. Logic: Erratum to “What’s so special about Kruskal’s Theorem and the ordinal $\gamma_0$? A survey of some results in proof theory” [53 (1991) 199–260]. Annals of Pure and Applied Logic 89(2), 275 (1997). https://doi.org/10.1016/S0168-0072(97)00043-2

10. Goubault-Larrecq, J.: On Noetherian spaces. Proceedings of LICS'07. pp. 453–462. IEEE (2007). https://doi.org/10.1109/LICS.2007.34

11. Goubault-Larrecq, J.: Noetherian Spaces in Verification. Proceedings of ICALP'10. Lecture Notes in Computer Science, vol. 6199, pp. 2–21. Springer (2010). https://doi.org/10.1007/978-3-642-14162-1_2

12. Goubault-Larrecq, J.: Non-Hausdorff Topology and Domain Theory, New Mathematical Monographs, vol. 22. Cambridge University Press (2013). https://doi.org/10.1017/CBO9781139524438

13. Goubault-Larrecq, J.: Infinitary Noetherian Constructions I. Infinite Words. Colloquium Mathematicum (168), 257–286 (2022). https://doi.org/10.4064/cm8077-4-2021

14. Goubault-Larrecq, J.: Non-Hausdorff Topology and Domain Theory. Electronic supplements to the book – errata. https://projects.lsv.ens-cachan.fr/topology/?page_id=12 (2022)

15. Goubault-Larrecq, J., Halfon, S., Lopez, A.: Infinitary Noetherian Constructions II. Transfinite Words and the Regular Subword Topology (2022), https://doi.org/10.48550/arXiv.2202.05047

16. Goubault-Larrecq, J., Seisenberger, M., Selivanov, V.L., Weiermann, A.: Well Quasi-Orders in Computer Science (Dagstuhl Seminar 16031). Dagstuhl Reports 6(1), 69–98 (2016). https://doi.org/10.4230/DagRep.6.1.69
17. Hasegawa, R.: Two applications of analytic functors. Theoretical Computer Science 272(1), 113–175 (2002). https://doi.org/10.1016/S0304-3975(00)00349-2

18. Higman, G.: Ordering by divisibility in abstract algebras. Proceedings of the London Mathematical Society 3(1), 326–336 (1952). https://doi.org/10.1112/plms/s3-2.1.326

19. Jančar, P.: A note on well quasi-orderings for powersets. Information Processing Letters 72(5), 155–160 (Dec 1999). https://doi.org/10.1016/S0020-0190(99)00149-0

20. Joyal, A.: Foncteurs analytiques et espèces de structures. Combinatoire énumérative. Lecture Notes in Mathematics, vol. 1234, pp. 126–159. Springer (1986). https://doi.org/10.1007/BFb0072514

21. Kříž, I., Thomas, R.: On well-quasi-ordering finite structures with labels. Graphs and Combinatorics 6(1), 41–49 (1990). https://doi.org/10.1007/BF01787479

22. Kruskal, J.B.: The theory of well-quasi-ordering: A frequently discovered concept. Journal of Combinatorial Theory, Series A 13(3), 297–305 (1972). https://doi.org/10.1016/0097-3165(72)90063-5

23. Milner, E.C.: Basic wqo-and bqo-theory. Graphs and order, pp. 487–502. Springer (1985). https://doi.org/10.1007/978-94-009-5315-4_14

24. Nash-Williams, C.St.J.A.: On well-quasi-ordering transfinite sequences. Mathematical Proceedings of the Cambridge Philosophical Society 61(1), 33–39 (1965)

25. Pouzet, M.: Un bel ordre d'abritement et ses rapports avec les bornes d'une multirelation. CR Acad. Sci. Paris Sér. AB 274, A1677–A1680 (1972)

26. Rado, R.: Partial well-ordering of sets of vectors. Mathematika 1(2), 89–95 (1954). https://doi.org/10.1112/S0025579300000565

27. Schmitz, S.: Algorithmic Complexity of Well-Quasi-Orders. Habilitation à diriger des recherches, École normale supérieure Paris-Saclay (2017), https://tel.archives-ouvertes.fr/tel-01663266

28. Schmitz, S., Schnoebelen, P.: Algorithmic Aspects of WQO Theory (2012), https://cel.archives-ouvertes.fr/cel-00727025

29. Segoufin, L., Figueira, D.: Bottom-up automata on data trees and vertical XPath. Logical Methods in Computer Science 13 (2017). https://doi.org/10.23638/LMCS-13(4:5)2017

30. Singh, D., Shuaibu, A.M., Ndayawo: Simplified proof of Kruskal's Tree Theorem. Mathematical Theory and Modeling 3, 93–100 (2013). https://doi.org/10.13140/RG.2.2.12298.39363
**Open Access** This chapter is licensed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license and indicate if changes were made.

The images or other third party material in this chapter are included in the chapter's Creative Commons license, unless indicated otherwise in a credit line to the material. If material is not included in the chapter's Creative Commons license and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder.

<figure><img src="image_5.png" /></figure>