Dependency relation

In mathematics and computer science, a dependency relation is a binary relation that is finite, symmetric, and reflexive; i.e. a finite tolerance relation. That is, it is a finite set of ordered pairs ${\displaystyle D}$, such that

In general, dependency relations are not transitive; thus, they generalize the notion of an equivalence relation by discarding transitivity.

Let ${\displaystyle \Sigma }$ denote the alphabet of all the letters of ${\displaystyle D}$. Then the independency induced by ${\displaystyle D}$ is the binary relation ${\displaystyle I}$

...
Wikipedia