Well-Founded Coalgebras Meet König's Lemma

2025-07-24

AI Summary

Extending König’s Lemma from finitely branching trees to well-founded coalgebras for finitary functors on locally finitely presentable categories—specifically, under what conditions is a well-founded coalgebra expressible as a directed colimit of its finitely generated well-founded subcoalgebras? Method: The authors establish the first coalgebraic analogue of König’s Lemma, develop a unified construction of initial algebras via directed colimits, and provide a concise proof of the limit structure for recursive coalgebras. Contributions: (1) They prove that the category of well-founded coalgebras itself is locally finitely presentable; (2) they derive König-type lemmas for graphs, nominal transition systems, and convex transition systems in the categories of sets, posets, nominal sets, and convex sets; (3) they realize two categorical, colimit-based uniform constructions of initial algebras, substantially broadening both the applicability and theoretical depth of the classical lemma.

Technology Category

• Knowledge Representation and Reasoning: Automated Reasoning and Theorem Proving
• Reasoning under Uncertainty: Other Foundations of Reasoning under Uncertainty
• Multiagent Systems: Other Foundations of Multi Agent Systems

Application Category

• Graph Algorithms and Modeling for the Web: Foundation models and LLMs for Web-related graphs
• Semantics and Knowledge: Methods, algorithms and applications for the development of semantic models, knowledge graphs and other forms of structured data models with machine-interpretable semantics
• Responsible Web: Human-perceived consequences of algorithmic deployment on the web

Abstract

König's lemma is a fundamental result about trees with countless applications in mathematics and computer science. In contrapositive form, it states that if a tree is finitely branching and well-founded (i.e. has no infinite paths), then it is finite. We present a coalgebraic version of König's lemma featuring two dimensions of generalization: from finitely branching trees to coalgebras for a finitary endofunctor H, and from the base category of sets to a locally finitely presentable category C, such as the category of posets, nominal sets, or convex sets. Our coalgebraic König's lemma states that, under mild assumptions on C and H, every well-founded coalgebra for H is the directed join of its well-founded subcoalgebras with finitely generated state space -- in particular, the category of well-founded coalgebras is locally presentable. As applications, we derive versions of König's lemma for graphs in a topos as well as for nominal and convex transition systems. Additionally, we show that the key construction underlying the proof gives rise to two simple constructions of the initial algebra (equivalently, the final recursive coalgebra) for the functor H: The initial algebra is both the colimit of all well-founded and of all recursive coalgebras with finitely presentable state space. Remarkably, this result holds even in settings where well-founded coalgebras form a proper subclass of recursive ones. The first construction of the initial algebra is entirely new, while for the second one our approach yields a short and transparent new correctness proof.

Problem

• Generalize König's lemma to coalgebras for finitary endofunctors
• Extend lemma to locally finitely presentable categories
• Establish initial algebra constructions for well-founded coalgebras

Innovation

• Coalgebraic version of König's lemma
• Generalizes to finitary endofunctor H
• Initial algebra construction via coalgebras