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 {\displaystyle R} is a binary relation between X {\displaystyle X} and Y {\displaystyle Y} and S {\displaystyle S} is a relation between Y {\displaystyle Y} and Z . {\displaystyle Z.} Their right demonic composition R ; → S {\displaystyle R{\textbf {;}}^{\to }S} is a relation between X {\displaystyle X} and Z . {\displaystyle Z.} Its graph is defined as
{ ( x , z ) : x ( S ∘ R ) z and for all y ∈ Y ( x R y implies y S z ) } . {\displaystyle \{(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 left demonic composition R ; ← S {\displaystyle R{\textbf {;}}^{\leftarrow }S} is defined by
{ ( x , z ) : x ( S ∘ R ) z and for all y ∈ Y ( y S z implies x R y ) } . {\displaystyle \{(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
Backhouse, Roland; van der Woude, Jaap (1993), "Demonic operators and monotype factors", Mathematical Structures in Computer Science, 3 (4): 417–433, CiteSeerX 10.1.1.40.9602, doi:10.1017/S096012950000030X, MR 1249420 {{citation}}: Cite uses deprecated parameter |citeseerx= (help).