SKILL

Learn Closure Operators

What you will be able to do

• Given a function on a poset, determine whether it is a closure operator by checking the three axioms: extensive, monotone, idempotent.
• Compute the fixed points of a simple closure operator on a finite poset.
• State the Knaster-Tarski fixed-point theorem and explain what it guarantees: that a monotone function on a complete lattice has a least fixed point.
• Explain why the composite of two closure operators is not generally idempotent, and why the least-fixed-point construction is needed for composed operators.

Prerequisites

• learn-partial-orders — the definition of a partial order, meets and joins, the concept of a complete lattice (you need all of this because closure operators are defined on posets and the key theorem requires a complete lattice)
• learn-heyting-algebras — the worked examples in the closure operators lesson build on Heyting algebra structure, and the connection to deductive closure is clearer with the Heyting implication in hand

Lessons

• Closure Operators and Fixed Points — the definition, standard examples (topological, transitive, deductive closure), the Knaster-Tarski theorem, iterative construction, and composing operators

This is a single lesson. Work through it fully, including the deductive closure worked example.

Scope

This skill covers closure operators on posets and complete lattices: the definition, standard examples, the Knaster-Tarski theorem, and composition of operators. It does not cover:

• Galois connections (a closely related concept — every closure operator arises from a Galois connection, but this is not developed here)
• Closure operators in topology in depth (topological closure is used as an example, but the full theory of topological spaces is a separate subject)
• The specific closure operators of the semiotic universe (semantic, syntactic, and fusion closures — covered by learn-semiotic-universe, which depends on this skill)
• Iterative fixed-point constructions at transfinite ordinals (the lesson gives the idea but not the technical ordinal arithmetic)

Verification

Given the power set lattice $\mathcal{P}(\{a,b,c\})$ ordered by inclusion, define $c(X)=X\cup \{a\}$ for all $X$. Check that $c$ is extensive, monotone, and idempotent. List the fixed points of $c$. Is $c$ a closure operator? What is its least fixed point?