Residuated Park Theories

When $L$ is a complete lattice, the collection $\Mon_L$ of all monotone functions $L^p \to L^n$, $n,p \geq 0$, forms a Lawvere theory. We enrich this Lawvere theory with the binary supremum operation $\vee$, an operation of (left) residuation $\res$ and the parameterized least fixed point operation $^\dagger$. We exhibit a system of \emph{equational} axioms which is sound and proves all valid equations of the theories $\Mon_L$ involving only the theory operations, $\vee$ and $^\dagger$, i.e., all valid equations not involving residuation. We also present an alternative axiomatization, where $^\dagger$ is replaced by a star operation, and provide an application to regular tree languages.

💡 Research Summary

The paper studies the Lawvere theory Monₗ consisting of all monotone functions Lᵖ→Lⁿ over a complete lattice L, and enriches it with three additional operations: a binary supremum ∨, a (left) residuation operation ⇐, and a parameterized least fixed‑point operation † (or alternatively a star *). The basic Lawvere structure provides objects as natural numbers and morphisms n→p as functions Lᵖ→Lⁿ, with composition and tupling defined in the usual categorical way. The supremum ∨ turns each hom‑set into a complete lattice, and the order is defined by f≤g iff f∨g=g.

The residuation h⇐g for a fixed g:p→q and any h:n→q is defined as the greatest f:n→p such that f·g≤h. This operation is monotone in its first argument, preserves arbitrary joins, and satisfies the fundamental inequalities (6) (h⇐g)·g≤h, (7) f≤(f·g)⇐g, and (8) h⇐g≤(h∨h′)⇐g.

The parameterized least fixed‑point operation f† is defined for any f:n→n+p. For each y∈Lᵖ, the function x↦f(x,y) has a least fixed point by the Knaster‑Tarski theorem; collecting these points yields a monotone morphism f†:n→p. The operation satisfies a fixed‑point equation (9) f†≤(f∨g)†, a parameter equation (11) f†·g=(f·(1ₙ⊕g))†, and interacts with residuation via (12) (g⇐h g,1ₚ)†≤g, among others.

The core equational system consists of the lattice axioms (1)–(5) for ∨, the residuation inequalities (6)–(8), and the fixed‑point axioms (9)–(12). Theorem 2.2 proves that these equations hold in every Monₗ and that any inequation involving only the theory operations, ∨, and † (or *) that is valid in all Monₗ can be derived from this system using standard many‑sorted equational logic. In other words, the system provides a complete axiomatization for the fragment that excludes residuation.

The paper then introduces the notion of a Park theory, an ordered Lawvere theory equipped with a dagger (†) satisfying the fixed‑point equation, the parameter equation, and a least pre‑fixed‑point rule. A semilattice‑ordered Park theory further requires compatibility of ∨ with composition. The authors show that Monₗ (and its continuous counterpart) are examples of semilattice‑ordered Park theories. By adding the left residuation operation, they define “residuated Park theories” and “residuated semilattice‑ordered Park theories”, which precisely model the axioms of Theorem 2.2.

A second axiomatization replaces † by a star operation . The star is defined by f = (1ₙ⊕f)†, and the authors prove that the star‑based system is equivalent to the dagger‑based one. This connects the present framework to Kleene algebras, where the star captures iteration.

Finally, the authors apply the theory to regular tree languages. They observe that regular tree languages form a sub‑theory of Monₗ, with language substitution corresponding to composition, union to ∨, and iteration to the star. The residuated axioms allow one to express language inclusion and equivalence purely equationally, yielding a finite, complete axiom set for regular tree languages that extends the classical Kleene‑algebra axiomatization.

Overall, the paper achieves a significant simplification: it replaces the intricate group‑equations of traditional iteration theories with a modest set of pure equations, while still attaining completeness for the fragment without residuation. Moreover, by integrating residuation, it provides a richer algebraic structure that captures both fixed‑point semantics and iterative behaviour, with concrete implications for the algebraic theory of regular tree languages.