Demonic composition
≈ 1 min read
Names in other languages
No names in other languages are held for this entry yet.
Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.
In mathematics, demonic composition is an operation on binary relations that is similar to the ordinary composition of relations but is robust to refinement of the relations into (partial) functions or injective relations. Unlike ordinary composition of relations, demonic composition is not associative.
In mathematics, demonic composition is an operation on binary relations that is similar to the ordinary composition of relations but is robust to refinement of the relations into (partial) functions or injective relations. Unlike ordinary composition of relations, demonic composition is not associative. ==Definition== Suppose R is a binary relation between X and Y and S is a relation between Y and Z. Their R \textbf{;}^{\to} S is a relation between X and Z. Its graph is defined as \{(x, z) \ : \ x \mathrel{(S \circ R)} z \text{ and for all } y \in Y \ (x \mathrel{R} y \text{ implies } y \mathrel{S} z)\}. Conversely, their R \textbf{;}^{\leftarrow} S is defined by \{(x, z) \ : \ x \mathrel{(S \circ R)} z \text{ and for all } y \in Y \ (y \mathrel{S} z \text{ implies } x \mathrel{R} y)\}. ==References== .
Text derived from https://en.wikipedia.org/w/index.php?oldid=1375068739 under CC BY-SA 4.0; modifications have been made.