You're reading the public-facing archive of the Category Theory Zulip server.
To join the server you need an invite. Anybody can get an invite by contacting Matteo Capucci at name dot surname at gmail dot com.
For all things related to this archive refer to the same person.
Let be the subgraph of the directed graph reachable from the vertex . What do you call a graph homomorphism where
?
"Subgraph-isomorphism-preserving" is a bit of a mouthful.
Is this some kind of locality property?
The graphs I'm interested in have structural-equivalence-classes of terms of a process calculus as vertices and context-labeled transitions as directed edges. Induced subgraph isomorphism is essentially bisimilarity. Graph homomorphisms that preserve bisimilarity are a useful notion of morphism from one language into another that is semantic rather than syntactic. Compilation is an epi, abstract interpretation is a mono.
Is there a reason to not call it "bisimilarity-preserving"? If and are bisimilar in , then and should be bisimilar in .
That's fair. I just wondered if there was a pre-existing name for it.
It sounds like the map on subgraphs is the left adjoint of a localic morphism in the [[specialization topology]] (aka Alexandrov topology; upper sets are open); "bisimilarity-preserving" sure is hard to beat but maybe check with the Stone-spaces folks, seems intimately related.