Trees in Coalgebra from Generalized Reachability
Fuente:
arXiv
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866908780172673024 |
|---|---|
| author | Wißmann, Thorsten Kocsis, Bálint Rot, Jurriaan Turkenburg, Ruben |
| author_facet | Wißmann, Thorsten Kocsis, Bálint Rot, Jurriaan Turkenburg, Ruben |
| contents | An automaton is called reachable if every state is reachable from the initial state. This notion has been generalized coalgebraically in two ways: first, via a universal property on pointed coalgebras, namely, that a reachable coalgebra has no proper subcoalgebras; and second, a coalgebra is reachable if it arises as the union of an iterative computation of successor states, starting from the initial state.
In the current paper, we present corresponding universal properties and iterative constructions for trees. The universal property captures when a coalgebra is a tree, namely, when it has no proper tree unravellings. The iterative construction unravels an arbitrary coalgebra to a tree. We show that this yields the expected notion of tree for a variety of standard examples.
We obtain our characterization of trees by first generalizing the previous theory of reachable coalgebras and of a minimal object in a category, related to projectivity. Surprisingly, both the universal property and the iterative construction for trees arise as instances of this generalized notion of reachability. Our iterative construction works for all analytic set functors. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2503_15585 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Trees in Coalgebra from Generalized Reachability Wißmann, Thorsten Kocsis, Bálint Rot, Jurriaan Turkenburg, Ruben Logic in Computer Science An automaton is called reachable if every state is reachable from the initial state. This notion has been generalized coalgebraically in two ways: first, via a universal property on pointed coalgebras, namely, that a reachable coalgebra has no proper subcoalgebras; and second, a coalgebra is reachable if it arises as the union of an iterative computation of successor states, starting from the initial state. In the current paper, we present corresponding universal properties and iterative constructions for trees. The universal property captures when a coalgebra is a tree, namely, when it has no proper tree unravellings. The iterative construction unravels an arbitrary coalgebra to a tree. We show that this yields the expected notion of tree for a variety of standard examples. We obtain our characterization of trees by first generalizing the previous theory of reachable coalgebras and of a minimal object in a category, related to projectivity. Surprisingly, both the universal property and the iterative construction for trees arise as instances of this generalized notion of reachability. Our iterative construction works for all analytic set functors. |
| title | Trees in Coalgebra from Generalized Reachability |
| topic | Logic in Computer Science |
| url | https://arxiv.org/abs/2503.15585 |