Relation composition

☞ This page belongs to resource collections on Logic and Inquiry.

Relation composition, or the composition of relations, is the generalization of function composition, or the composition of functions. The following treatment of relation composition takes the "strongly typed" approach to relations that is outlined in the article on relation theory.

## Preliminaries

[edit | edit source]

There are several ways to formalize the subject matter of relations. Relations and their combinations may be described in the logic of relative terms, in set theories of various kinds, and through a broadening of category theory from functions to relations in general.

The first order of business is to define the operation on relations that is variously known as the composition of relations, relational composition, or relative multiplication. In approaching the more general constructions, it pays to begin with the composition of dyadic and triadic relations.

As an incidental observation on usage, there are many different conventions of syntax for denoting the application and composition of relations, with perhaps even more options in general use than are common for the application and composition of functions. In this case there is little chance of standardization, since the convenience of conventions is relative to the context of use, and the same writers use different styles of syntax in different settings, depending on the ease of analysis and computation.

The first dimension of variation in syntax has to do with the correspondence between the order of operation and the linear order of terms on the page.

The second dimension of variation in syntax has to do with the automatic assumptions in place about the associations of terms in the absence of associations marked by parentheses. This becomes a significant factor with relations in general because the usual property of associativity is lost as both the complexities of compositions and the dimensions of relations increase.

These two factors together generate the following four styles of syntax:

LALA = left application, left association.

LARA = left application, right association.
RALA = right application, left association.
RARA = right application, right association.

## Definition

[edit | edit source]

A notion of relational composition is to be defined that generalizes the usual notion of functional composition:

Composing on the right,  f : X -> Y {\displaystyle f:X\to Y} followed by  g : Y -> Z {\displaystyle g:Y\to Z}

results in a composite function formulated as  f g : X -> Z . {\displaystyle fg:X\to Z.}

Composing on the left,  f : X -> Y {\displaystyle f:X\to Y} followed by  g : Y -> Z {\displaystyle g:Y\to Z}

results in a composite function formulated as  g f : X -> Z . {\displaystyle gf:X\to Z.}

Note on notation. The ordinary symbol for functional composition is the composition sign, a small circle " ∘ {\displaystyle \circ } " written between the names of the functions being composed, as  f ∘ g , {\displaystyle f\circ g,} but the sign is often omitted if there is no risk of confusing the composition of functions with their algebraic product. In contexts where both compositions and products occur, either the composition is marked on each occasion or else the product is marked by means of a center dot " ⋅ {\displaystyle \cdot } ", as  f ⋅ g . {\displaystyle f\cdot g.}

Generalizing the paradigm along parallel lines, the composition of a pair of dyadic relations is formulated in the following two ways:

Composing on the right,  P ⊆ X × Y {\displaystyle P\subseteq X\times Y} followed by  Q ⊆ Y × Z {\displaystyle Q\subseteq Y\times Z}

results in a composite relation formulated as  P Q ⊆ X × Z . {\displaystyle PQ\subseteq X\times Z.}

Composing on the left,  P ⊆ X × Y {\displaystyle P\subseteq X\times Y} followed by  Q ⊆ Y × Z {\displaystyle Q\subseteq Y\times Z}

results in a composite relation formulated as  Q P ⊆ X × Z . {\displaystyle QP\subseteq X\times Z.}

## Geometric construction

[edit | edit source]

There is a neat way of defining relational compositions in geometric terms, not only showing their relationship to the projection operations that come with any cartesian product, but also suggesting natural directions for generalizing relational compositions beyond the dyadic case, and even beyond relations that have any fixed arity, in effect, to the general case of formal languages as generalized relations.

This way of looking at relational compositions is sometimes referred to as Tarski's Trick, on account of his having put it to especially good use in his work (Ulam and Bednarek, 1977). It supplies the imagination with a geometric way of visualizing the relational composition of a pair of dyadic relations, doing this by attaching concrete imagery to the basic set-theoretic operations, namely, intersections, projections, and a certain class of operations inverse to projections, here called tacit extensions.

The stage is set for Tarski's trick by highlighting the links between two topics that are likely to appear wholly unrelated at first, namely:

* The use of logical conjunction, as denoted by the symbol  ∧ , {\displaystyle \land ,\\!} in expressions of the form  F ( x , y , z ) = G ( x , y ) ∧ H ( y , z ) , {\displaystyle F(x,y,z)=G(x,y)\land H(y,z),\\!} to define a triadic relation  F {\displaystyle F\\!} in terms of a pair of dyadic relations  G {\displaystyle G\\!} and  H . {\displaystyle H.\\!}

* The concepts of dyadic projection and projective determination, that are invoked in the "weak" notion of projective reducibility.

The relational composition  G ∘ H {\displaystyle G\circ H\\!} of a pair of dyadic relations  G {\displaystyle G\\!} and  H {\displaystyle H\\!} will be constructed in three stages, first, by taking the tacit extensions of  G {\displaystyle G\\!} and  H {\displaystyle H\\!} to triadic relations that reside in the same space, next, by taking the intersection of these extensions, tantamount to the maximal triadic relation that is consistent with the prima facie dyadic relation data, finally, by projecting this intersection on a suitable plane to form a third dyadic relation, constituting in fact the relational composition  G ∘ H {\displaystyle G\circ H\\!} of the relations  G {\displaystyle G\\!} and  H . {\displaystyle H.\\!}

The construction of a relational composition in a specifically mathematical setting normally begins with mathematical relations at a higher level of abstraction than the corresponding objects in linguistic or logical settings. This is due to the fact that mathematical objects are typically specified only up to isomorphism as the conventional saying goes, that is, any objects that have the "same form" are generally regarded as the being the same thing, for most all intents and mathematical purposes. Thus the mathematical construction of a relational composition begins by default with a pair of dyadic relations that reside, without loss of generality, in the same plane, say,  G , H ⊆ X × Y , {\displaystyle G,H\subseteq X\times Y,\\!} as shown in Figure 1\.

o

-o
|                                                 |
|        o                       o                |
|        |\                      |\               |
|        | \                     | \              |
|        |  \                    |  \             |
|        |   \                   |   \            |
|        |    \                  |    \           |
|        |     \                 |     \          |
|        |   *  \                |   *  \         |
|        X   *   Y               X   *   Y        |
|         \  *   |                \  *   |        |
|          \ G   |                 \ H   |        |
|           \    |                  \    |        |
|            \   |                   \   |        |
|             \  |                    \  |        |
|              \ |                     \ |        |
|               \|                      \|        |
|                o                       o        |
|                                                 |
o

-o
Figure 1.  Dyadic Relations G, H c X x Y

The dyadic relations  G {\displaystyle G\\!} and  H {\displaystyle H\\!} cannot be composed at all at this point, not without additional information or further stipulation. In order for their relational composition to be possible, one of two types of cases has to happen:

* The first type of case occurs when  X = Y . {\displaystyle X=Y.\\!} In this case, both of the compositions  G ∘ H {\displaystyle G\circ H\\!} and  H ∘ G {\displaystyle H\circ G\\!} are defined.

* The second type of case occurs when  X {\displaystyle X\\!} and  Y {\displaystyle Y\\!} are distinct, but when it nevertheless makes sense to speak of a dyadic relation  H ^ {\displaystyle {\hat {H}}\\!} that is isomorphic to  H , {\displaystyle H,\\!} but living in the plane  Y Z , {\displaystyle YZ,\\!} that is, in the space of the cartesian product  Y × Z , {\displaystyle Y\times Z,\\!} for some set  Z . {\displaystyle Z.\\!}

Whether you view isomorphic things to be the same things or not, you still have to specify the exact isomorphisms that are needed to transform any given representation of a thing into a required representation of the same thing. Let us imagine that we have done this, and say how later:

o

-o
|                                                 |
|        o                               o        |
|        |\                             /|        |
|        | \                           / |        |
|        |  \                         /  |        |
|        |   \                       /   |        |
|        |    \                     /    |        |
|        |     \                   /     |        |
|        |   *  \                 /  *   |        |
|        X   *   Y               Y   *   Z        |
|         \  *   |               |   *  /         |
|          \ G   |               |   Ĥ /          |
|           \    |               |    /           |
|            \   |               |   /            |
|             \  |               |  /             |
|              \ |               | /              |
|               \|               |/               |
|                o               o                |
|                                                 |
o

-o
Figure 2.  Dyadic Relations G c X x Y and Ĥ c Y x Z

With the required spaces carefully swept out, the stage is set for the presentation of Tarski's trick, and the invocation of the following symbolic formula, claimed to be a definition of the relational composition  P ∘ Q {\displaystyle P\circ Q\\!} of a pair of dyadic relations  P , Q ⊆ X × X . {\displaystyle P,Q\subseteq X\times X.\\!}

Definition. P ∘ Q = p r o j 13 ( P × X ∩ X × Q ) . {\displaystyle P\circ Q=\mathrm {proj} _{13}(P\times X~\cap ~X\times Q).\\!}

To get this drift of this definition one needs to understand that it comes from a point of view that regards all dyadic relations as covered well enough by subsets of a suitable cartesian square and thus of the form  L ⊆ X × X . {\displaystyle L\subseteq X\times X.\\!} So, if one has started out with a dyadic relation of the shape  L ⊆ U × V , {\displaystyle L\subseteq U\times V,\\!} one merely lets  X = U ∪ V , {\displaystyle X=U\cup V,\\!} trading in the initial  L {\displaystyle L\\!} for a new  L ⊆ X × X {\displaystyle L\subseteq X\times X\\!} as need be.

The projection  p r o j 13 {\displaystyle \mathrm {proj} _{13}\\!} is just the projection of the cartesian cube  X × X × X {\displaystyle X\times X\times X\\!} on the space of shape  X × X {\displaystyle X\times X\\!} that is spanned by the first and the third domains, but since they now have the same names and the same contents it is necessary to distinguish them by numbering their relational places.

Finally, the notation of the cartesian product sign " × {\displaystyle \times \\!} " is extended to signify two other products with respect to a dyadic relation  L ⊆ X × X {\displaystyle L\subseteq X\times X\\!} and a subset  W ⊆ X , {\displaystyle W\subseteq X,\\!} as follows:

Definition. L × W = { ( x , y , z ) ∈ X 3 : ( x , y ) ∈ L a n d z ∈ W } . {\displaystyle L\times W~=~\\{(x,y,z)\in X^{3}~:~(x,y)\in L~\mathrm {and} ~z\in W\\}.\\!}

Definition. W × L = { ( x , y , z ) ∈ X 3 : x ∈ W a n d ( y , z ) ∈ L } . {\displaystyle W\times L~=~\\{(x,y,z)\in X^{3}~:~x\in W~\mathrm {and} ~(y,z)\in L\\}.\\!}

Applying these definitions to the case  P , Q ⊆ X × X , {\displaystyle P,Q\subseteq X\times X,\\!} the two dyadic relations whose relational composition  P ∘ Q ⊆ X × X {\displaystyle P\circ Q\subseteq X\times X\\!} is about to be defined, one finds:

P × X = { ( x , y , z ) ∈ X 3 : ( x , y ) ∈ P a n d z ∈ X } , {\displaystyle P\times X~=~\\{(x,y,z)\in X^{3}~:~(x,y)\in P~\mathrm {and} ~z\in X\\},\\!}

X × Q = { ( x , y , z ) ∈ X 3 : x ∈ X a n d ( y , z ) ∈ Q } . {\displaystyle X\times Q~=~\\{(x,y,z)\in X^{3}~:~x\in X~\mathrm {and} ~(y,z)\in Q\\}.\\!}

These are just the appropriate special cases of the tacit extensions already defined.

P × X = t e 12 3 ( P ) , {\displaystyle P\times X~=~\mathrm {te} _{12}^{3}(P),~\\!}

X × Q = t e 23 1 ( Q ) . {\displaystyle X\times Q~=~\mathrm {te} _{23}^{1}(Q).~\\!}

In summary, then, the expression:

p r o j 13 ( P × X ∩ X × Q ) {\displaystyle \mathrm {proj} _{13}(P\times X~\cap ~X\times Q)\\!}

is equivalent to the expression:

p r o j 13 ( t e 12 3 ( P ) ∩ t e 23 1 ( Q ) ) {\displaystyle \mathrm {proj} _{13}(\mathrm {te} _{12}^{3}(P)~\cap ~\mathrm {te} _{23}^{1}(Q))\\!}

and this form is generalized -- although, relative to one's school of thought, perhaps inessentially so -- by the form that was given above as follows:

Definition. P ∘ Q = p r o j X Z ( t e X Y Z ( P ) ∩ t e Y Z X ( Q ) ) . {\displaystyle P\circ Q~=~\mathrm {proj} _{XZ}(\mathrm {te} _{XY}^{Z}(P)~\cap ~\mathrm {te} _{YZ}^{X}(Q)).\\!}

Figure 3 presents a geometric picture of what is involved in formulating a definition of the triadic relation  F ⊆ X × Y × Z {\displaystyle F\subseteq X\times Y\times Z\\!} by way of a conjunction between the dyadic relation  G ⊆ X × Y {\displaystyle G\subseteq X\times Y\\!} and the dyadic relation  H ⊆ Y × Z , {\displaystyle H\subseteq Y\times Z,\\!} as done for example by means of an expression of the following form:

* F ( x , y , z ) = G ( x , y ) ∧ H ( y , z ) . {\displaystyle F(x,y,z)~=~G(x,y)\land H(y,z).\\!}

o

-o
|                                                 |
|                        o                        |
|                       /|\                       |
|                      / | \                      |
|                     /  |  \                     |
|                    /   |   \                    |
|                   /    |    \                   |
|                  /     |     \                  |
|                 /      |      \                 |
|                o       o       o                |
|                |\     / \     /|                |
|                | \   / F \   / |                |
|                |  \ /  *  \ /  |                |
|                |   \  /*\  /   |                |
|                |  / \//*\\/ \  |                |
|                | /  /\/ \/\  \ |                |
|                |/  ///\ /\\\  \|                |
|        o       X  ///  Y  \\\  Z       o        |
|        |\       \///   |   \\\/       /|        |
|        | \      ///    |    \\\      / |        |
|        |  \    ///\    |    /\\\    /  |        |
|        |   \  ///  \   |   /  \\\  /   |        |
|        |    \///    \  |  /    \\\/    |        |
|        |    /\/      \ | /      \/\    |        |
|        |   *//\       \|/       /\\*   |        |
|        X   */  Y       o       Y  \*   Z        |
|         \  *   |               |   *  /         |
|          \ G   |               |   H /          |
|           \    |               |    /           |
|            \   |               |   /            |
|             \  |               |  /             |
|              \ |               | /              |
|               \|               |/               |
|                o               o                |
|                                                 |
o

-o
Figure 3.  Projections of F onto G and H

To interpret the Figure, visualize the triadic relation  F ⊆ X × Y × Z {\displaystyle F\subseteq X\times Y\times Z\\!} as a body in  X Y Z {\displaystyle XYZ\\!} -space, while  G {\displaystyle G\\!} is a figure in  X Y {\displaystyle XY\\!} -space and  H {\displaystyle H\\!} is a figure in  Y Z {\displaystyle YZ\\!} -space.

The dyadic projections that accompany a triadic relation over  X , Y , Z {\displaystyle X,Y,Z\\!} are defined as follows:

* p r o j X Y ( L ) = { ( x , y ) ∈ X × Y : ( x , y , z ) ∈ L for some z ∈ Z ) } , {\displaystyle \mathrm {proj} _{XY}(L)~=~\\{(x,y)\in X\times Y:(x,y,z)\in L~{\text{for some}}~z\in Z)\\},\\!}

* p r o j X Z ( L ) = { ( x , z ) ∈ X × Z : ( x , y , z ) ∈ L for some y ∈ Y ) } , {\displaystyle \mathrm {proj} _{XZ}(L)~=~\\{(x,z)\in X\times Z:(x,y,z)\in L~{\text{for some}}~y\in Y)\\},\\!}

* p r o j Y Z ( L ) = { ( y , z ) ∈ Y × Z : ( x , y , z ) ∈ L for some x ∈ X ) } . {\displaystyle \mathrm {proj} _{YZ}(L)~=~\\{(y,z)\in Y\times Z:(x,y,z)\in L~{\text{for some}}~x\in X)\\}.\\!}

For many purposes it suffices to indicate the dyadic projections of a triadic relation  L {\displaystyle L\\!} by means of the briefer equivalents listed next:

* L X Y = p r o j X Y ( L ) , {\displaystyle L_{XY}~=~\mathrm {proj} _{XY}(L),\\!}

* L X Z = p r o j X Z ( L ) , {\displaystyle L_{XZ}~=~\mathrm {proj} _{XZ}(L),\\!}

* L Y Z = p r o j Y Z ( L ) . {\displaystyle L_{YZ}~=~\mathrm {proj} _{YZ}(L).\\!}

In light of these definitions,  p r o j X Y {\displaystyle \mathrm {proj} _{XY}\\!} is a mapping from the set  L X Y Z {\displaystyle {\mathcal {L}}_{XYZ}\\!} of triadic relations over the domains  X , Y , Z {\displaystyle X,Y,Z\\!} to the set  L X Y {\displaystyle {\mathcal {L}}_{XY}\\!} of dyadic relations over the domains  X , Y , {\displaystyle X,Y,\\!} with similar relationships holding for the other projections. To formalize these relationships in a concise but explicit manner, it serves to add a few more definitions.

The set  L X Y Z , {\displaystyle {\mathcal {L}}_{XYZ},~\\!} whose members are just the triadic relations over  X , Y , Z , {\displaystyle X,Y,Z,\\!} can be recognized as the set of all subsets of the cartesian product  X × Y × Z , {\displaystyle X\times Y\times Z,\\!} also known as the power set of  X × Y × Z , {\displaystyle X\times Y\times Z,\\!} and notated here as  P o w ( X × Y × Z ) . {\displaystyle \mathrm {Pow} (X\times Y\times Z).\\!}

* L X Y Z = { L : L ⊆ X × Y × Z } = P o w ( X × Y × Z ) . {\displaystyle {\mathcal {L}}_{XYZ}~=~\\{L:L\subseteq X\times Y\times Z\\}~=~\mathrm {Pow} (X\times Y\times Z).\\!}

Likewise, the power sets of the pairwise cartesian products encompass all the dyadic relations on pairs of distinct domains that can be chosen from  { X , Y , Z } . {\displaystyle \\{X,Y,Z\\}.\\!}

* L X Y = { L : L ⊆ X × Y } = P o w ( X × Y ) , {\displaystyle {\mathcal {L}}_{XY}~=~\\{L:L\subseteq X\times Y\\}~=~\mathrm {Pow} (X\times Y),~\\!}

* L X Z = { L : L ⊆ X × Z } = P o w ( X × Z ) , {\displaystyle {\mathcal {L}}_{XZ}~=~\\{L:L\subseteq X\times Z\\}~=~\mathrm {Pow} (X\times Z),~\\!}

* L Y Z = { L : L ⊆ Y × Z } = P o w ( Y × Z ) . {\displaystyle {\mathcal {L}}_{YZ}~=~\\{L:L\subseteq Y\times Z\\}~=~\mathrm {Pow} (Y\times Z).~\\!}

In mathematics, the inverse relation corresponding to a projection map is usually called an extension. To avoid confusion with other senses of the word, however, it is probably best for the sake of this discussion to stick with the more specific term tacit extension.

Given three sets,  X , Y , Z , {\displaystyle X,Y,Z,\\!} and three dyadic relations,

* U ⊆ X × Y , {\displaystyle U\subseteq X\times Y,~\\!}

* V ⊆ X × Z , {\displaystyle V\subseteq X\times Z,~\\!}

* W ⊆ Y × Z , {\displaystyle W\subseteq Y\times Z,~\\!}

the tacit extensions,  t e X Y Z , t e X Z Y , t e Y Z X , {\displaystyle \mathrm {te} _{XY}^{Z},\mathrm {te} _{XZ}^{Y},\mathrm {te} _{YZ}^{X},~\\!} of  U , V , W , {\displaystyle U,V,W,\\!} respectively, are defined as follows:

* t e X Y Z ( U ) = { ( x , y , z ) : ( x , y ) ∈ U } , {\displaystyle \mathrm {te} _{XY}^{Z}(U)~=~\\{(x,y,z):(x,y)\in U\\},\\!}

* t e X Z Y ( V ) = { ( x , y , z ) : ( x , z ) ∈ V } , {\displaystyle \mathrm {te} _{XZ}^{Y}(V)~=~\\{(x,y,z):(x,z)\in V\\},\\!}

* t e Y Z X ( W ) = { ( x , y , z ) : ( y , z ) ∈ W } . {\displaystyle \mathrm {te} _{YZ}^{X}(W)~=~\\{(x,y,z):(y,z)\in W\\}.\\!}

So long as the intended indices attaching to the tacit extensions can be gathered from context, it is usually clear enough to use the abbreviated forms,  t e ( U ) , t e ( V ) , t e ( W ) . {\displaystyle \mathrm {te} (U),\mathrm {te} (V),\mathrm {te} (W).\\!}

The definition and illustration of relational composition presently under way makes use of the tacit extension of  G ⊆ X × Y {\displaystyle G\subseteq X\times Y\\!} to  t e ( G ) ⊆ X × Y × Z {\displaystyle \mathrm {te} (G)\subseteq X\times Y\times Z\\!} and the tacit extension of  H ⊆ Y × Z {\displaystyle H\subseteq Y\times Z\\!} to  t e ( H ) ⊆ X × Y × Z , {\displaystyle \mathrm {te} (H)\subseteq X\times Y\times Z,\\!} only.

Geometric illustrations of  t e ( G ) {\displaystyle \mathrm {te} (G)\\!} and  t e ( H ) {\displaystyle \mathrm {te} (H)\\!} are afforded by Figures 4 and 5, respectively.

o

-o
|                                                 |
|                        o                        |
|                       /|\                       |
|                      / | \                      |
|                     /  |  \                     |
|                    /   |   \                    |
|                   /    |    \                   |
|                  /     |     \                  |
|                 /      |   *  \                 |
|                o       o  **   o                |
|                |\     / \***  /|                |
|                | \   /  ***  / |                |
|                |  \ /  ***\ /  |                |
|                |   \  ***  /   |                |
|                |  / \***  / \  |                |
|                | /  ***  /   \ |                |
|                |/  ***\ /     \|                |
|        o       X  /**  Y       Z       o        |
|        |\       \//*   |      /       /|        |
|        | \      ///    |     /       / |        |
|        |  \    ///\    |    /       /  |        |
|        |   \  ///  \   |   /       /   |        |
|        |    \///    \  |  /       /    |        |
|        |    /\/      \ | /       /     |        |
|        |   *//\       \|/       /  *   |        |
|        X   */  Y       o       Y   *   Z        |
|         \  *   |               |   *  /         |
|          \ G   |               |   H /          |
|           \    |               |    /           |
|            \   |               |   /            |
|             \  |               |  /             |
|              \ |               | /              |
|               \|               |/               |
|                o               o                |
|                                                 |
o

-o
Figure 4.  Tacit Extension of G to X x Y x Z

o

-o
|                                                 |
|                        o                        |
|                       /|\                       |
|                      / | \                      |
|                     /  |  \                     |
|                    /   |   \                    |
|                   /    |    \                   |
|                  /     |     \                  |
|                 /  *   |      \                 |
|                o   **  o       o                |
|                |\  ***/ \     /|                |
|                | \  ***  \   / |                |
|                |  \ /***  \ /  |                |
|                |   \  ***  /   |                |
|                |  / \  ***/ \  |                |
|                | /   \  ***  \ |                |
|                |/     \ /***  \|                |
|        o       X       Y  **\  Z       o        |
|        |\       \      |   *\\/       /|        |
|        | \       \     |    \\\      / |        |
|        |  \       \    |    /\\\    /  |        |
|        |   \       \   |   /  \\\  /   |        |
|        |    \       \  |  /    \\\/    |        |
|        |     \       \ | /      \/\    |        |
|        |   *  \       \|/       /\\*   |        |
|        X   *   Y       o       Y  \*   Z        |
|         \  *   |               |   *  /         |
|          \ G   |               |   H /          |
|           \    |               |    /           |
|            \   |               |   /            |
|             \  |               |  /             |
|              \ |               | /              |
|               \|               |/               |
|                o               o                |
|                                                 |
o

-o
Figure 5.  Tacit Extension of H to X x Y x Z

A geometric interpretation can now be given that fleshes out in graphic form the meaning of a formula like the following:

* F ( x , y , z ) = G ( x , y ) ∧ H ( y , z ) . {\displaystyle F(x,y,z)~=~G(x,y)\land H(y,z).\\!}

The conjunction that is indicated by " ∧ {\displaystyle \land \\!} " corresponds as usual to an intersection of two sets, however, in this case it is the intersection of the tacit extensions  t e ( G ) {\displaystyle \mathrm {te} (G)\\!} and  t e ( H ) . {\displaystyle \mathrm {te} (H).\\!}

o

-o
|                                                 |
|                        o                        |
|                       /|\                       |
|                      / | \                      |
|                     /  |  \                     |
|                    /   |   \                    |
|                   /    |    \                   |
|                  /     |     \                  |
|                 /      |      \                 |
|                o       o       o                |
|                |\     / \     /|                |
|                | \   / F \   / |                |
|                |  \ /  *  \ /  |                |
|                |   \  /*\  /   |                |
|                |  / \//*\\/ \  |                |
|                | /  /\/ \/\  \ |                |
|                |/  ///\ /\\\  \|                |
|        o       X  ///  Y  \\\  Z       o        |
|        |\       \///   |   \\\/       /|        |
|        | \      ///    |    \\\      / |        |
|        |  \    ///\    |    /\\\    /  |        |
|        |   \  ///  \   |   /  \\\  /   |        |
|        |    \///    \  |  /    \\\/    |        |
|        |    /\/      \ | /      \/\    |        |
|        |   *//\       \|/       /\\*   |        |
|        X   */  Y       o       Y  \*   Z        |
|         \  *   |               |   *  /         |
|          \ G   |               |   H /          |
|           \    |               |    /           |
|            \   |               |   /            |
|             \  |               |  /             |
|              \ |               | /              |
|               \|               |/               |
|                o               o                |
|                                                 |
o

-o
Figure 6.  F as the Intersection of te(G) and te(H)

## Algebraic construction

[edit | edit source]

The transition from a geometric picture of relation composition to an algebraic formulation is accomplished through the introduction of coordinates, in other words, identifiable names for the objects that are related through the various forms of relations, dyadic and triadic in the present case. Adding coordinates to the running Example produces the following Figure:

o

-o
|                                                 |
|                        o                        |
|                       /|\                       |
|                      / | \                      |
|                     /  |  \                     |
|                    /   |   \                    |
|                   /    |    \                   |
|                  /     |     \                  |
|                 /      |      \                 |
|                o       o       o                |
|                |\     / \     /|                |
|                | \   / F \   / |                |
|                |  \ /  *  \ /  |                |
|                |   \  /*\  /   |                |
|                |  / \//*\\/ \  |                |
|                | /  /\/ \/\  \ |                |
|                |/  ///\ /\\\  \|                |
|        o       X  ///  Y  \\\  Z       o        |
|        |\      7\///   |   \\\/7      /|        |
|        | \      6//    |    \\6      / |        |
|        |  \    //5\    |    /5\\    /  |        |
|        |   \  /// 4\   |   /4 \\\  /   |        |
|        |    \///   3\  |  /3   \\\/    |        |
|        |   G/\/     2\ | /2     \/\H   |        |
|        |   *//\      1\|/1      /\\*   |        |
|        X   *\  Y       o       Y  /*   Z        |
|        7\  *\\ |7             7| //*  /7        |
|         6\ |\\\|6             6|///| /6         |
|          5\| \\@5             5@// |/5          |
|           4@  \@4             4@/  @4           |
|            3\  @3             3@  /3            |
|             2\ |2             2| /2             |
|              1\|1             1|/1              |
|                o               o                |
|                                                 |
o

-o
Figure 7.  F as the Intersection of te(G) and te(H)

Thinking of relations in operational terms is facilitated by using variant notations for ordered tuples and sets of ordered tuples, namely, the ordered pair  ( x , y ) {\displaystyle (x,y)\\!} is written  x : y , {\displaystyle x\\!:\\!y,\\!} the ordered triple  ( x , y , z ) {\displaystyle (x,y,z)\\!} is written  x : y : z , {\displaystyle x\\!:\\!y\\!:\\!z,\\!} and so on, and a set of tuples is conceived as a logical-algebraic sum, which can be written out in the smaller finite cases in forms like  a : b + b : c + c : d {\displaystyle a\\!:\\!b~+~b\\!:\\!c~+~c\\!:\\!d\\!} and so on.

For example, translating the relations  F ⊆ X × Y × Z , G ⊆ X × Y , H ⊆ Y × Z {\displaystyle F\subseteq X\times Y\times Z,~G\subseteq X\times Y,~H\subseteq Y\times Z\\!} into this notation produces the following summary of the data:

F = 4 : 3 : 4 + 4 : 4 : 4 + 4 : 5 : 4 G = 4 : 3 + 4 : 4 + 4 : 5 H = 3 : 4 + 4 : 4 + 5 : 4 {\displaystyle {\begin{matrix}F&=&4:3:4&+&4:4:4&+&4:5:4\\\G&=&4:3&+&4:4&+&4:5\\\H&=&3:4&+&4:4&+&5:4\end{matrix}}}

As often happens with abstract notations for functions and relations, the type information, in this case, the fact that  G {\displaystyle G\\!} and  H {\displaystyle H\\!} live in different spaces, is left implicit in the context of use.

Let us now verify that all of the proposed definitions, formulas, and other relationships check out against the concrete data of the current composition example. The ultimate goal is to develop a clearer picture of what is going on in the formula that expresses the relational composition of a couple of dyadic relations in terms of the medial projection of the intersection of their tacit extensions:

G ∘ H = p r o j X Z ( t e X Y Z ( G ) ∩ t e Y Z X ( H ) ) . {\displaystyle G\circ H~=~\mathrm {proj} _{XZ}(\mathrm {te} _{XY}^{Z}(G)~\cap ~\mathrm {te} _{YZ}^{X}(H)).\\!}

Here is the big picture, with all the pieces in place:

o

-o
|                                                 |
|                        o                        |
|                       / \                       |
|                      /   \                      |
|                     /     \                     |
|                    /       \                    |
|                   /         \                   |
|                  /           \                  |
|                 /    G o H    \                 |
|                X       *       Z                |
|                7\     /|\     /7                |
|                 6\   / | \   /6                 |
|                  5\ /  |  \ /5                  |
|                   4@   |   @4                   |
|                    3\  |  /3                    |
|                     2\ | /2                     |
|                      1\|/1                      |
|                        |                        |
|                        |                        |
|                        |                        |
|                       /|\                       |
|                      / | \                      |
|                     /  |  \                     |
|                    /   |   \                    |
|                   /    |    \                   |
|                  /     |     \                  |
|                 /      |      \                 |
|                o       |       o                |
|                |\     /|\     /|                |
|                | \   / F \   / |                |
|                |  \ /  *  \ /  |                |
|                |   \  /*\  /   |                |
|                |  / \//*\\/ \  |                |
|                | /  /\/ \/\  \ |                |
|                |/  ///\ /\\\  \|                |
|        o       X  ///  Y  \\\  Z       o        |
|        |\       \///   |   \\\/       /|        |
|        | \      ///    |    \\\      / |        |
|        |  \    ///\    |    /\\\    /  |        |
|        |   \  ///  \   |   /  \\\  /   |        |
|        |    \///    \  |  /    \\\/    |        |
|        |   G/\/      \ | /      \/\H   |        |
|        |   *//\       \|/       /\\*   |        |
|        X   *\  Y       o       Y  /*   Z        |
|        7\  *\\ |7             7| //*  /7        |
|         6\ |\\\|6             6|///| /6         |
|          5\| \\@5             5@// |/5          |
|           4@  \@4             4@/  @4           |
|            3\  @3             3@  /3            |
|             2\ |2             2| /2             |
|              1\|1             1|/1              |
|                o               o                |
|                                                 |
o

-o
Figure 8.  G o H  =  proj_XZ (te(G) |^| te(H))

All that remains is to check the following collection of data and derivations against the situation represented in Figure 8\.

F = 4 : 3 : 4 + 4 : 4 : 4 + 4 : 5 : 4 G = 4 : 3 + 4 : 4 + 4 : 5 H = 3 : 4 + 4 : 4 + 5 : 4 {\displaystyle {\begin{matrix}F&=&4:3:4&+&4:4:4&+&4:5:4\\\G&=&4:3&+&4:4&+&4:5\\\H&=&3:4&+&4:4&+&5:4\end{matrix}}}

G ∘ H = ( 4 : 3 + 4 : 4 + 4 : 5 ) ( 3 : 4 + 4 : 4 + 5 : 4 ) = 4 : 4 {\displaystyle {\begin{matrix}G\circ H&=&(4\\!:\\!3~+~4\\!:\\!4~+~4\\!:\\!5)(3\\!:\\!4~+~4\\!:\\!4~+~5\\!:\\!4)\\\\[6pt]&=&4:4\end{matrix}}}

t e ( G ) = t e X Y Z ( G ) = ∑ z = 1 7 ( 4 : 3 : z + 4 : 4 : z + 4 : 5 : z ) {\displaystyle {\begin{matrix}\mathrm {te} (G)&=&\mathrm {te} _{XY}^{Z}(G)\\\\[4pt]&=&\displaystyle \sum _{z=1}^{7}(4\\!:\\!3\\!:\\!z~+~4\\!:\\!4\\!:\\!z~+~4\\!:\\!5\\!:\\!z)\end{matrix}}}

t e ( G ) = 4 : 3 : 1 + 4 : 4 : 1 + 4 : 5 : 1 + 4 : 3 : 2 + 4 : 4 : 2 + 4 : 5 : 2 + 4 : 3 : 3 + 4 : 4 : 3 + 4 : 5 : 3 + 4 : 3 : 4 + 4 : 4 : 4 + 4 : 5 : 4 + 4 : 3 : 5 + 4 : 4 : 5 + 4 : 5 : 5 + 4 : 3 : 6 + 4 : 4 : 6 + 4 : 5 : 6 + 4 : 3 : 7 + 4 : 4 : 7 + 4 : 5 : 7 {\displaystyle {\begin{matrix}\mathrm {te} (G)&=&4:3:1&+&4:4:1&+&4:5:1&+\\\&&4:3:2&+&4:4:2&+&4:5:2&+\\\&&4:3:3&+&4:4:3&+&4:5:3&+\\\&&4:3:4&+&4:4:4&+&4:5:4&+\\\&&4:3:5&+&4:4:5&+&4:5:5&+\\\&&4:3:6&+&4:4:6&+&4:5:6&+\\\&&4:3:7&+&4:4:7&+&4:5:7\end{matrix}}}

t e ( H ) = t e Y Z X ( H ) = ∑ x = 1 7 ( x : 3 : 4 + x : 4 : 4 + x : 5 : 4 ) {\displaystyle {\begin{matrix}\mathrm {te} (H)&=&\mathrm {te} _{YZ}^{X}(H)\\\\[4pt]&=&\displaystyle \sum _{x=1}^{7}(x\\!:\\!3\\!:\\!4~+~x\\!:\\!4\\!:\\!4~+~x\\!:\\!5\\!:\\!4)\end{matrix}}}

t e ( H ) = 1 : 3 : 4 + 1 : 4 : 4 + 1 : 5 : 4 + 2 : 3 : 4 + 2 : 4 : 4 + 2 : 5 : 4 + 3 : 3 : 4 + 3 : 4 : 4 + 3 : 5 : 4 + 4 : 3 : 4 + 4 : 4 : 4 + 4 : 5 : 4 + 5 : 3 : 4 + 5 : 4 : 4 + 5 : 5 : 4 + 6 : 3 : 4 + 6 : 4 : 4 + 6 : 5 : 4 + 7 : 3 : 4 + 7 : 4 : 4 + 7 : 5 : 4 {\displaystyle {\begin{matrix}\mathrm {te} (H)&=&1:3:4&+&1:4:4&+&1:5:4&+\\\&&2:3:4&+&2:4:4&+&2:5:4&+\\\&&3:3:4&+&3:4:4&+&3:5:4&+\\\&&4:3:4&+&4:4:4&+&4:5:4&+\\\&&5:3:4&+&5:4:4&+&5:5:4&+\\\&&6:3:4&+&6:4:4&+&6:5:4&+\\\&&7:3:4&+&7:4:4&+&7:5:4\end{matrix}}}

t e ( G ) ∩ t e ( H ) = 4 : 3 : 4 + 4 : 4 : 4 + 4 : 5 : 4 G ∘ H = p r o j X Z ( t e ( G ) ∩ t e ( H ) ) = p r o j X Z ( 4 : 3 : 4 + 4 : 4 : 4 + 4 : 5 : 4 ) = 4 : 4 {\displaystyle {\begin{array}{ccl}\mathrm {te} (G)\cap \mathrm {te} (H)&=&4\\!:\\!3:\\!4~+~4\\!:\\!4\\!:\\!4~+~4\\!:\\!5\\!:\\!4\\\\[4pt]G\circ H&=&\mathrm {proj} _{XZ}(\mathrm {te} (G)\cap \mathrm {te} (H))\\\\[4pt]&=&\mathrm {proj} _{XZ}(4\\!:\\!3:\\!4~+~4\\!:\\!4\\!:\\!4~+~4\\!:\\!5\\!:\\!4)\\\\[4pt]&=&4:4\end{array}}}

## Matrix representation

[edit | edit source]

We have it within our reach to pick up another way of representing dyadic relations, namely, the representation as logical matrices, and also to grasp the analogy between relational composition and ordinary matrix multiplication as it appears in linear algebra.

First of all, while we still have the data of a very simple concrete case in mind, let us reflect on what we did in our last Example in order to find the composition  G ∘ H {\displaystyle G\circ H\\!} of the dyadic relations  G {\displaystyle G\\!} and  H . {\displaystyle H.\\!}

Here is the setup that we had before:

X = { 1 , 2 , 3 , 4 , 5 , 6 , 7 } {\displaystyle {\begin{matrix}X&=&\\{1,2,3,4,5,6,7\\}\end{matrix}}}

G = 4 : 3 + 4 : 4 + 4 : 5 ⊆ X × X H = 3 : 4 + 4 : 4 + 5 : 4 ⊆ X × X {\displaystyle {\begin{matrix}G&=&4:3&+&4:4&+&4:5&\subseteq &X\times X\\\H&=&3:4&+&4:4&+&5:4&\subseteq &X\times X\end{matrix}}}

Let us recall the rule for finding the relational composition of a pair of dyadic relations. Given the dyadic relations  P ⊆ X × Y {\displaystyle P\subseteq X\times Y\\!} and  Q ⊆ Y × Z , {\displaystyle Q\subseteq Y\times Z,\\!} the composition of  P on Q {\displaystyle P~{\text{on}}~Q\\!} is written as  P ∘ Q , {\displaystyle P\circ Q,\\!} or more simply as  P Q , {\displaystyle PQ,\\!} and obtained as follows:

To compute  P Q , {\displaystyle PQ,\\!} in general, where  P {\displaystyle P\\!} and  Q {\displaystyle Q\\!} are dyadic relations, simply multiply out the two sums in the ordinary distributive algebraic way, but subject to the following rule for finding the product of two elementary relations of shapes  a : b {\displaystyle a:b\\!} and  c : d . {\displaystyle c:d.\\!}

( a : b ) ( c : d ) = ( a : d ) if b = c ( a : b ) ( c : d ) = 0 otherwise {\displaystyle {\begin{matrix}(a:b)(c:d)&=&(a:d)&{\text{if}}~b=c\\\\(a:b)(c:d)&=&0&{\text{otherwise}}\end{matrix}}}

To find the relational composition  G ∘ H , {\displaystyle G\circ H,\\!} one may begin by writing it as a quasi-algebraic product:

G ∘ H = ( 4 : 3 + 4 : 4 + 4 : 5 ) ( 3 : 4 + 4 : 4 + 5 : 4 ) {\displaystyle {\begin{matrix}G\circ H&=&(4\\!:\\!3~+~4\\!:\\!4~+~4\\!:\\!5)(3\\!:\\!4~+~4\\!:\\!4~+~5\\!:\\!4)\end{matrix}}}

Multiplying this out in accord with the applicable form of distributive law one obtains the following expansion:

G ∘ H = ( 4 : 3 ) ( 3 : 4 ) + ( 4 : 3 ) ( 4 : 4 ) + ( 4 : 3 ) ( 5 : 4 ) + ( 4 : 4 ) ( 3 : 4 ) + ( 4 : 4 ) ( 4 : 4 ) + ( 4 : 4 ) ( 5 : 4 ) + ( 4 : 5 ) ( 3 : 4 ) + ( 4 : 5 ) ( 4 : 4 ) + ( 4 : 5 ) ( 5 : 4 ) {\displaystyle {\begin{matrix}G\circ H&=&(4:3)(3:4)&+&(4:3)(4:4)&+&(4:3)(5:4)&+\\\&&(4:4)(3:4)&+&(4:4)(4:4)&+&(4:4)(5:4)&+\\\&&(4:5)(3:4)&+&(4:5)(4:4)&+&(4:5)(5:4)\end{matrix}}}

Applying the rule that determines the product of elementary relations produces the following array:

G ∘ H = 4 : 4 + 0 + 0 + 0 + 4 : 4 + 0 + 0 + 0 + 4 : 4 {\displaystyle {\begin{matrix}G\circ H&=&4:4&+&0&+&0&+\\\&&0&+&4:4&+&0&+\\\&&0&+&0&+&4:4\end{matrix}}}

Since the plus sign in this context represents an operation of logical disjunction or set-theoretic aggregation, all of the positive multiplicites count as one, and this gives the ultimate result:

G ∘ H = 4 : 4 {\displaystyle {\begin{matrix}G\circ H&=&4:4\end{matrix}}}

With an eye toward extracting a general formula for relation composition, viewed here on analogy to algebraic multiplication, let us examine what we did in multiplying the dyadic relations  G {\displaystyle G\\!} and  H {\displaystyle H\\!} together to obtain their relational composite  G ∘ H . {\displaystyle G\circ H.\\!}

Given the space  X = { 1 , 2 , 3 , 4 , 5 , 6 , 7 } , {\displaystyle X=\\{1,2,3,4,5,6,7\\},\\!} whose cardinality  | X | {\displaystyle |X|\\!} is  7 , {\displaystyle 7,\\!} there are  | X × X | = | X | ⋅ | X | {\displaystyle |X\times X|=|X|\cdot |X|\\!} = {\displaystyle =\\!} 7 ⋅ 7 = 49 {\displaystyle 7\cdot 7=49\\!} elementary relations of the form  i : j , {\displaystyle i:j,\\!} where  i {\displaystyle i\\!} and  j {\displaystyle j\\!} range over the space  X . {\displaystyle X.\\!} Although they might be organized in many different ways, it is convenient to regard the collection of elementary relations as arranged in a lexicographic block of the following form:

1 : 1 1 : 2 1 : 3 1 : 4 1 : 5 1 : 6 1 : 7 2 : 1 2 : 2 2 : 3 2 : 4 2 : 5 2 : 6 2 : 7 3 : 1 3 : 2 3 : 3 3 : 4 3 : 5 3 : 6 3 : 7 4 : 1 4 : 2 4 : 3 4 : 4 4 : 5 4 : 6 4 : 7 5 : 1 5 : 2 5 : 3 5 : 4 5 : 5 5 : 6 5 : 7 6 : 1 6 : 2 6 : 3 6 : 4 6 : 5 6 : 6 6 : 7 7 : 1 7 : 2 7 : 3 7 : 4 7 : 5 7 : 6 7 : 7 {\displaystyle {\begin{matrix}1\\!:\\!1&1\\!:\\!2&1\\!:\\!3&1\\!:\\!4&1\\!:\\!5&1\\!:\\!6&1\\!:\\!7\\\2\\!:\\!1&2\\!:\\!2&2\\!:\\!3&2\\!:\\!4&2\\!:\\!5&2\\!:\\!6&2\\!:\\!7\\\3\\!:\\!1&3\\!:\\!2&3\\!:\\!3&3\\!:\\!4&3\\!:\\!5&3\\!:\\!6&3\\!:\\!7\\\4\\!:\\!1&4\\!:\\!2&4\\!:\\!3&4\\!:\\!4&4\\!:\\!5&4\\!:\\!6&4\\!:\\!7\\\5\\!:\\!1&5\\!:\\!2&5\\!:\\!3&5\\!:\\!4&5\\!:\\!5&5\\!:\\!6&5\\!:\\!7\\\6\\!:\\!1&6\\!:\\!2&6\\!:\\!3&6\\!:\\!4&6\\!:\\!5&6\\!:\\!6&6\\!:\\!7\\\7\\!:\\!1&7\\!:\\!2&7\\!:\\!3&7\\!:\\!4&7\\!:\\!5&7\\!:\\!6&7\\!:\\!7\end{matrix}}}

The relations  G {\displaystyle G\\!} and  H {\displaystyle H\\!} may then be regarded as logical sums of the following forms:

G = ∑ i j G i j ( i : j ) H = ∑ i j H i j ( i : j ) {\displaystyle {\begin{matrix}G&=&\displaystyle \sum _{ij}G_{ij}(i\\!:\\!j)\\\\[20pt]H&=&\displaystyle \sum _{ij}H_{ij}(i\\!:\\!j)\end{matrix}}\\!}

The notation  ∑ i j {\displaystyle \textstyle \sum _{ij}\\!} indicates a logical sum over the collection of elementary relations  i : j {\displaystyle i\\!:\\!j\\!} while the factors  G i j {\displaystyle G_{ij}\\!} and  H i j {\displaystyle H_{ij}\\!} are values in the boolean domain B = { 0 , 1 } {\displaystyle \mathbb {B} =\\{0,1\\}~\\!} that are called the coefficients of the relations  G {\displaystyle G\\!} and  H , {\displaystyle H,\\!} respectively, with regard to the corresponding elementary relations  i : j . {\displaystyle i\\!:\\!j.\\!}

In general, for a dyadic relation  L , {\displaystyle L,\\!} the coefficient  L i j {\displaystyle L_{ij}\\!} of the elementary relation  i : j {\displaystyle i\\!:\\!j\\!} in the relation  L {\displaystyle L\\!} will be  0 {\displaystyle 0\\!} or  1 , {\displaystyle 1,\\!} respectively, as  i : j {\displaystyle i\\!:\\!j\\!} is excluded from or included in  L . {\displaystyle L.\\!}

With these conventions in place, the expansions of  G {\displaystyle G\\!} and  H {\displaystyle H\\!} may be written out as follows:

G = 4 : 3 + 4 : 4 + 4 : 5 = {\displaystyle {\begin{matrix}G&=&4:3&+&4:4&+&4:5&=\end{matrix}}}

0 ⋅ ( 1 : 1 ) + 0 ⋅ ( 1 : 2 ) + 0 ⋅ ( 1 : 3 ) + 0 ⋅ ( 1 : 4 ) + 0 ⋅ ( 1 : 5 ) + 0 ⋅ ( 1 : 6 ) + 0 ⋅ ( 1 : 7 ) + 0 ⋅ ( 2 : 1 ) + 0 ⋅ ( 2 : 2 ) + 0 ⋅ ( 2 : 3 ) + 0 ⋅ ( 2 : 4 ) + 0 ⋅ ( 2 : 5 ) + 0 ⋅ ( 2 : 6 ) + 0 ⋅ ( 2 : 7 ) + 0 ⋅ ( 3 : 1 ) + 0 ⋅ ( 3 : 2 ) + 0 ⋅ ( 3 : 3 ) + 0 ⋅ ( 3 : 4 ) + 0 ⋅ ( 3 : 5 ) + 0 ⋅ ( 3 : 6 ) + 0 ⋅ ( 3 : 7 ) + 0 ⋅ ( 4 : 1 ) + 0 ⋅ ( 4 : 2 ) + 1 ⋅ ( 4 : 3 ) + 1 ⋅ ( 4 : 4 ) + 1 ⋅ ( 4 : 5 ) + 0 ⋅ ( 4 : 6 ) + 0 ⋅ ( 4 : 7 ) + 0 ⋅ ( 5 : 1 ) + 0 ⋅ ( 5 : 2 ) + 0 ⋅ ( 5 : 3 ) + 0 ⋅ ( 5 : 4 ) + 0 ⋅ ( 5 : 5 ) + 0 ⋅ ( 5 : 6 ) + 0 ⋅ ( 5 : 7 ) + 0 ⋅ ( 6 : 1 ) + 0 ⋅ ( 6 : 2 ) + 0 ⋅ ( 6 : 3 ) + 0 ⋅ ( 6 : 4 ) + 0 ⋅ ( 6 : 5 ) + 0 ⋅ ( 6 : 6 ) + 0 ⋅ ( 6 : 7 ) + 0 ⋅ ( 7 : 1 ) + 0 ⋅ ( 7 : 2 ) + 0 ⋅ ( 7 : 3 ) + 0 ⋅ ( 7 : 4 ) + 0 ⋅ ( 7 : 5 ) + 0 ⋅ ( 7 : 6 ) + 0 ⋅ ( 7 : 7 ) {\displaystyle {\begin{smallmatrix}0\cdot (1:1)&+&0\cdot (1:2)&+&0\cdot (1:3)&+&0\cdot (1:4)&+&0\cdot (1:5)&+&0\cdot (1:6)&+&0\cdot (1:7)&+\\\0\cdot (2:1)&+&0\cdot (2:2)&+&0\cdot (2:3)&+&0\cdot (2:4)&+&0\cdot (2:5)&+&0\cdot (2:6)&+&0\cdot (2:7)&+\\\0\cdot (3:1)&+&0\cdot (3:2)&+&0\cdot (3:3)&+&0\cdot (3:4)&+&0\cdot (3:5)&+&0\cdot (3:6)&+&0\cdot (3:7)&+\\\0\cdot (4:1)&+&0\cdot (4:2)&+&\mathbf {1} \cdot (4:3)&+&\mathbf {1} \cdot (4:4)&+&\mathbf {1} \cdot (4:5)&+&0\cdot (4:6)&+&0\cdot (4:7)&+\\\0\cdot (5:1)&+&0\cdot (5:2)&+&0\cdot (5:3)&+&0\cdot (5:4)&+&0\cdot (5:5)&+&0\cdot (5:6)&+&0\cdot (5:7)&+\\\0\cdot (6:1)&+&0\cdot (6:2)&+&0\cdot (6:3)&+&0\cdot (6:4)&+&0\cdot (6:5)&+&0\cdot (6:6)&+&0\cdot (6:7)&+\\\0\cdot (7:1)&+&0\cdot (7:2)&+&0\cdot (7:3)&+&0\cdot (7:4)&+&0\cdot (7:5)&+&0\cdot (7:6)&+&0\cdot (7:7)\end{smallmatrix}}}

H = 3 : 4 + 4 : 4 + 5 : 4 = {\displaystyle {\begin{matrix}H&=&3:4&+&4:4&+&5:4&=\end{matrix}}}

0 ⋅ ( 1 : 1 ) + 0 ⋅ ( 1 : 2 ) + 0 ⋅ ( 1 : 3 ) + 0 ⋅ ( 1 : 4 ) + 0 ⋅ ( 1 : 5 ) + 0 ⋅ ( 1 : 6 ) + 0 ⋅ ( 1 : 7 ) + 0 ⋅ ( 2 : 1 ) + 0 ⋅ ( 2 : 2 ) + 0 ⋅ ( 2 : 3 ) + 0 ⋅ ( 2 : 4 ) + 0 ⋅ ( 2 : 5 ) + 0 ⋅ ( 2 : 6 ) + 0 ⋅ ( 2 : 7 ) + 0 ⋅ ( 3 : 1 ) + 0 ⋅ ( 3 : 2 ) + 0 ⋅ ( 3 : 3 ) + 1 ⋅ ( 3 : 4 ) + 0 ⋅ ( 3 : 5 ) + 0 ⋅ ( 3 : 6 ) + 0 ⋅ ( 3 : 7 ) + 0 ⋅ ( 4 : 1 ) + 0 ⋅ ( 4 : 2 ) + 0 ⋅ ( 4 : 3 ) + 1 ⋅ ( 4 : 4 ) + 0 ⋅ ( 4 : 5 ) + 0 ⋅ ( 4 : 6 ) + 0 ⋅ ( 4 : 7 ) + 0 ⋅ ( 5 : 1 ) + 0 ⋅ ( 5 : 2 ) + 0 ⋅ ( 5 : 3 ) + 1 ⋅ ( 5 : 4 ) + 0 ⋅ ( 5 : 5 ) + 0 ⋅ ( 5 : 6 ) + 0 ⋅ ( 5 : 7 ) + 0 ⋅ ( 6 : 1 ) + 0 ⋅ ( 6 : 2 ) + 0 ⋅ ( 6 : 3 ) + 0 ⋅ ( 6 : 4 ) + 0 ⋅ ( 6 : 5 ) + 0 ⋅ ( 6 : 6 ) + 0 ⋅ ( 6 : 7 ) + 0 ⋅ ( 7 : 1 ) + 0 ⋅ ( 7 : 2 ) + 0 ⋅ ( 7 : 3 ) + 0 ⋅ ( 7 : 4 ) + 0 ⋅ ( 7 : 5 ) + 0 ⋅ ( 7 : 6 ) + 0 ⋅ ( 7 : 7 ) {\displaystyle {\begin{smallmatrix}0\cdot (1:1)&+&0\cdot (1:2)&+&0\cdot (1:3)&+&0\cdot (1:4)&+&0\cdot (1:5)&+&0\cdot (1:6)&+&0\cdot (1:7)&+\\\0\cdot (2:1)&+&0\cdot (2:2)&+&0\cdot (2:3)&+&0\cdot (2:4)&+&0\cdot (2:5)&+&0\cdot (2:6)&+&0\cdot (2:7)&+\\\0\cdot (3:1)&+&0\cdot (3:2)&+&0\cdot (3:3)&+&\mathbf {1} \cdot (3:4)&+&0\cdot (3:5)&+&0\cdot (3:6)&+&0\cdot (3:7)&+\\\0\cdot (4:1)&+&0\cdot (4:2)&+&0\cdot (4:3)&+&\mathbf {1} \cdot (4:4)&+&0\cdot (4:5)&+&0\cdot (4:6)&+&0\cdot (4:7)&+\\\0\cdot (5:1)&+&0\cdot (5:2)&+&0\cdot (5:3)&+&\mathbf {1} \cdot (5:4)&+&0\cdot (5:5)&+&0\cdot (5:6)&+&0\cdot (5:7)&+\\\0\cdot (6:1)&+&0\cdot (6:2)&+&0\cdot (6:3)&+&0\cdot (6:4)&+&0\cdot (6:5)&+&0\cdot (6:6)&+&0\cdot (6:7)&+\\\0\cdot (7:1)&+&0\cdot (7:2)&+&0\cdot (7:3)&+&0\cdot (7:4)&+&0\cdot (7:5)&+&0\cdot (7:6)&+&0\cdot (7:7)\end{smallmatrix}}}

Stripping down to the bare essentials, one obtains the following matrices of coefficients for the relations  G {\displaystyle G\\!} and  H . {\displaystyle H.\\!}

G = ( 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 ) {\displaystyle G~=~{\begin{pmatrix}0&0&0&0&0&0&0\\\0&0&0&0&0&0&0\\\0&0&0&0&0&0&0\\\0&0&1&1&1&0&0\\\0&0&0&0&0&0&0\\\0&0&0&0&0&0&0\\\0&0&0&0&0&0&0\end{pmatrix}}}

H = ( 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 1 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 ) {\displaystyle H~=~{\begin{pmatrix}0&0&0&0&0&0&0\\\0&0&0&0&0&0&0\\\0&0&0&1&0&0&0\\\0&0&0&1&0&0&0\\\0&0&0&1&0&0&0\\\0&0&0&0&0&0&0\\\0&0&0&0&0&0&0\end{pmatrix}}}

These are the logical matrix representations of the dyadic relations  G {\displaystyle G\\!} and  H . {\displaystyle H.\\!}

If the dyadic relations  G {\displaystyle G\\!} and  H {\displaystyle H\\!} are viewed as logical sums then their relational composition  G ∘ H {\displaystyle G\circ H\\!} can be regarded as a product of sums, a fact that can be indicated as follows:

G ∘ H = ( ∑ i j G i j ( i : j ) ) ( ∑ i j H i j ( i : j ) ) . {\displaystyle G\circ H~=~(\sum _{ij}G_{ij}(i\\!:\\!j))(\sum _{ij}H_{ij}(i\\!:\\!j)).\\!}

The composite relation  G ∘ H {\displaystyle G\circ H\\!} is itself a dyadic relation over the same space  X , {\displaystyle X,\\!} in other words,  G ∘ H ⊆ X × X , {\displaystyle G\circ H\subseteq X\times X,\\!} and this means that  G ∘ H {\displaystyle G\circ H\\!} must be amenable to being written as a logical sum of the following form:

G ∘ H = ∑ i j ( G ∘ H ) i j ( i : j ) . {\displaystyle G\circ H~=~\sum _{ij}(G\circ H)_{ij}(i\\!:\\!j).\\!}

In this formula,  ( G ∘ H ) i j {\displaystyle (G\circ H)_{ij}\\!} is the coefficient of  G ∘ H {\displaystyle G\circ H\\!} with respect to the elementary relation  i : j . {\displaystyle i\\!:\\!j.\\!}

One of the best ways to reason out what  G ∘ H {\displaystyle G\circ H\\!} should be is to ask oneself what its coefficient  ( G ∘ H ) i j {\displaystyle (G\circ H)_{ij}\\!} should be for each of the elementary relations  i : j {\displaystyle i\\!:\\!j\\!} in turn.

So let us pose the question:

( G ∘ H ) i j = ? {\displaystyle (G\circ H)_{ij}~=~?\\!}

In order to answer this question, it helps to realize that the indicated product given above can be written in the following equivalent form:

G ∘ H = ( ∑ i k G i k ( i : k ) ) ( ∑ k j H k j ( k : j ) ) . {\displaystyle G\circ H~=~(\sum _{ik}G_{ik}(i\\!:\\!k))(\sum _{kj}H_{kj}(k\\!:\\!j)).\\!}

A moment's thought will tell us that  ( G ∘ H ) i j = 1 {\displaystyle (G\circ H)_{ij}=1\\!} if and only if there is an element  k {\displaystyle k\\!} in  X {\displaystyle X\\!} such that  G i k = 1 {\displaystyle G_{ik}=1\\!} and  H k j = 1. {\displaystyle H_{kj}=1.\\!}

Consequently, we have the result:

( G ∘ H ) i j = ∑ k G i k H k j . {\displaystyle (G\circ H)_{ij}~=~\sum _{k}G_{ik}H_{kj}.\\!}

This follows from the properties of boolean arithmetic, specifically, from the fact that the product  G i k H k j {\displaystyle G_{ik}H_{kj}\\!} is  1 {\displaystyle 1\\!} if and only if both  G i k {\displaystyle G_{ik}\\!} and  H k j {\displaystyle H_{kj}\\!} are  1 {\displaystyle 1\\!} and from the fact that  ∑ k F k {\displaystyle \textstyle \sum _{k}F_{k}\\!} is equal to  1 {\displaystyle 1\\!} just in case some  F k {\displaystyle F_{k}\\!} is  1. {\displaystyle 1.\\!}

All that remains in order to obtain a computational formula for the relational composite  G ∘ H {\displaystyle G\circ H\\!} of the dyadic relations  G {\displaystyle G\\!} and  H {\displaystyle H\\!} is to collect the coefficients  ( G ∘ H ) i j {\displaystyle (G\circ H)_{ij}\\!} as  i {\displaystyle i\\!} and  j {\displaystyle j\\!} range over  X . {\displaystyle X.\\!}

G ∘ H = ∑ i j ( G ∘ H ) i j ( i : j ) = ∑ i j ( ∑ k G i k H k j ) ( i : j ) . {\displaystyle {\begin{matrix}G\circ H&=&\displaystyle \sum _{ij}(G\circ H)_{ij}(i\\!:\\!j)&=&\displaystyle \sum _{ij}(\sum _{k}G_{ik}H_{kj})(i\\!:\\!j).\end{matrix}}}

This is the logical analogue of matrix multiplication in linear algebra, the difference in the logical setting being that all of the operations performed on coefficients take place in a system of boolean arithmetic where summation corresponds to logical disjunction and multiplication corresponds to logical conjunction.

By way of disentangling this formula, one may notice that the form  ∑ k G i k H k j {\displaystyle \textstyle \sum _{k}G_{ik}H_{kj}\\!} is what is usually called a scalar product. In this case it is the scalar product of the  i th {\displaystyle i^{\text{th}}\\!} row of  G {\displaystyle G\\!} with the  j th {\displaystyle j^{\text{th}}\\!} column of  H . {\displaystyle H.\\!}

To make this statement more concrete, let us go back to the examples of  G {\displaystyle G\\!} and  H {\displaystyle H\\!} we came in with:

G = ( 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 ) {\displaystyle G~=~{\begin{pmatrix}0&0&0&0&0&0&0\\\0&0&0&0&0&0&0\\\0&0&0&0&0&0&0\\\0&0&1&1&1&0&0\\\0&0&0&0&0&0&0\\\0&0&0&0&0&0&0\\\0&0&0&0&0&0&0\end{pmatrix}}}

H = ( 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 1 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 ) {\displaystyle H~=~{\begin{pmatrix}0&0&0&0&0&0&0\\\0&0&0&0&0&0&0\\\0&0&0&1&0&0&0\\\0&0&0&1&0&0&0\\\0&0&0&1&0&0&0\\\0&0&0&0&0&0&0\\\0&0&0&0&0&0&0\end{pmatrix}}}

The formula for computing  G ∘ H {\displaystyle G\circ H\\!} says the following:

( G ∘ H ) i j = the i j th entry in the matrix representation for G ∘ H = the entry in the i th row and the j th column of G ∘ H = the scalar product of the i th row of G with the j th column of H = ∑ k G i k H k j {\displaystyle {\begin{array}{ccl}(G\circ H)_{ij}&=&{\text{the}}~{ij}^{\text{th}}~{\text{entry in the matrix representation for}}~G\circ H\\\\[2pt]&=&{\text{the entry in the}}~{i}^{\text{th}}~{\text{row and the}}~{j}^{\text{th}}~{\text{column of}}~G\circ H\\\\[2pt]&=&{\text{the scalar product of the}}~{i}^{\text{th}}~{\text{row of}}~G~{\text{with the}}~{j}^{\text{th}}~{\text{column of}}~H\\\\[2pt]&=&\sum _{k}G_{ik}H_{kj}\end{array}}}

As it happens, it is possible to make exceedingly light work of this example, since there is only one row of  G {\displaystyle G\\!} and one column of  H {\displaystyle H\\!} that are not all zeroes. Taking the scalar product, in a logical way, of the fourth row of  G {\displaystyle G\\!} with the fourth column of  H {\displaystyle H\\!} produces the sole non-zero entry for the matrix of  G ∘ H . {\displaystyle G\circ H.\\!}

G ∘ H = ( 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 ) {\displaystyle G\circ H~=~{\begin{pmatrix}0&0&0&0&0&0&0\\\0&0&0&0&0&0&0\\\0&0&0&0&0&0&0\\\0&0&0&1&0&0&0\\\0&0&0&0&0&0&0\\\0&0&0&0&0&0&0\\\0&0&0&0&0&0&0\end{pmatrix}}}

## Graph-theoretic picture

[edit | edit source]

There is another form of representation for dyadic relations that is useful to keep in mind, especially for its ability to render the logic of many complex formulas almost instantly understandable to the mind's eye. This is the representation in terms of bipartite graphs, or bigraphs for short.

Here is what  G {\displaystyle G\\!} and  H {\displaystyle H\\!} look like in the bigraph picture:

o

o
|                                       |
|     1   2   3   4   5   6   7         |
|     o   o   o   o   o   o   o    X    |
|                /|\                    |
|               / | \              G    |
|              /  |  \                  |
|     o   o   o   o   o   o   o    X    |
|     1   2   3   4   5   6   7         |
|                                       |
o

o
Figure 9.  G = 4:3 + 4:4 + 4:5

o

o
|                                       |
|     1   2   3   4   5   6   7         |
|     o   o   o   o   o   o   o    X    |
|              \  |  /                  |
|               \ | /              H    |
|                \|/                    |
|     o   o   o   o   o   o   o    X    |
|     1   2   3   4   5   6   7         |
|                                       |
o

o
Figure 10.  H = 3:4 + 4:4 + 5:4

These graphs may be read to say:

G puts 4 in relation to 3 , 4 , 5. H puts 3 , 4 , 5 in relation to 4. {\displaystyle {\begin{matrix}G~{\text{puts}}~4~{\text{in relation to}}~3,4,5.\\\\[2pt]H~{\text{puts}}~3,4,5~{\text{in relation to}}~4.\end{matrix}}}

To form the composite relation  G ∘ H , {\displaystyle G\circ H,\\!} one simply follows the bigraph for  G {\displaystyle G\\!} by the bigraph for  H , {\displaystyle H,\\!} here arranging the bigraphs in order down the page, and then treats any non-empty set of paths of length two between two nodes as being equivalent to a single directed edge between those nodes in the composite bigraph for  G ∘ H . {\displaystyle G\circ H.\\!}

Here's how it looks in pictures:

o

o
|                                       |
|     1   2   3   4   5   6   7         |
|     o   o   o   o   o   o   o    X    |
|                /|\                    |
|               / | \              G    |
|              /  |  \                  |
|     o   o   o   o   o   o   o    X    |
|              \  |  /                  |
|               \ | /              H    |
|                \|/                    |
|     o   o   o   o   o   o   o    X    |
|     1   2   3   4   5   6   7         |
|                                       |
o

o
Figure 11.  G Followed By H

o

o
|                                       |
|     1   2   3   4   5   6   7         |
|     o   o   o   o   o   o   o    X    |
|                 |                     |
|                 |              G o H  |
|                 |                     |
|     o   o   o   o   o   o   o    X    |
|     1   2   3   4   5   6   7         |
|                                       |
o

o
Figure 12.  G Composed With H

Once again we find that  G ∘ H = 4 : 4. {\displaystyle G\circ H=4:4.\\!}

We have now seen three different representations of dyadic relations. If one has a strong preference for letters, or numbers, or pictures, then one may be tempted to take one or another of these as being canonical, but each of them will be found to have its peculiar advantages and disadvantages in any given application, and the maximum advantage is therefore approached by keeping all three of them in mind.

To see the promised utility of the bigraph picture of dyadic relations, let us devise a slightly more complex example of a composition problem, and use it to illustrate the logic of the matrix multiplication formula.

Keeping to the same space  X = { 1 , 2 , 3 , 4 , 5 , 6 , 7 } , {\displaystyle X=\\{1,2,3,4,5,6,7\\},\\!} define the dyadic relations  M , N ⊆ X × X {\displaystyle M,N\subseteq X\times X\\!} as follows:

M = 2 : 1 + 2 : 2 + 2 : 3 + 4 : 3 + 4 : 4 + 4 : 5 + 6 : 5 + 6 : 6 + 6 : 7 N = 1 : 1 + 2 : 1 + 3 : 3 + 4 : 3 + 4 : 5 + 5 : 5 + 6 : 7 + 7 : 7 {\displaystyle {\begin{array}{*{19}{c}}M&=&2\\!:\\!1&+&2\\!:\\!2&+&2\\!:\\!3&+&4\\!:\\!3&+&4\\!:\\!4&+&4\\!:\\!5&+&6\\!:\\!5&+&6\\!:\\!6&+&6\\!:\\!7\\\\[2pt]N&=&1\\!:\\!1&+&2\\!:\\!1&+&3\\!:\\!3&+&4\\!:\\!3&~&+&~&4\\!:\\!5&+&5\\!:\\!5&+&6\\!:\\!7&+&7\\!:\\!7\end{array}}}

Here are the bigraph pictures:

o

o
|                                       |
|     1   2   3   4   5   6   7         |
|     o   o   o   o   o   o   o    X    |
|        /|\     /|\     /|\            |
|       / | \   / | \   / | \      M    |
|      /  |  \ /  |  \ /  |  \          |
|     o   o   o   o   o   o   o    X    |
|     1   2   3   4   5   6   7         |
|                                       |
o

o
Figure 13.  Dyadic Relation M

o

o
|                                       |
|     1   2   3   4   5   6   7         |
|     o   o   o   o   o   o   o    X    |
|     |  /    |  / \  |    \  |         |
|     | /     | /   \ |     \ |    N    |
|     |/      |/     \|      \|         |
|     o   o   o   o   o   o   o    X    |
|     1   2   3   4   5   6   7         |
|                                       |
o

o
Figure 14.  Dyadic Relation N

To form the composite relation  M ∘ N , {\displaystyle M\circ N,\\!} one simply follows the bigraph for  M {\displaystyle M\\!} by the bigraph for  N , {\displaystyle N,\\!} arranging the bigraphs in order down the page, and then counts any non-empty set of paths of length two between two nodes as being equivalent to a single directed edge between those two nodes in the composite bigraph for  M ∘ N . {\displaystyle M\circ N.\\!}

Here's how it looks in pictures:

o

o
|                                       |
|     1   2   3   4   5   6   7         |
|     o   o   o   o   o   o   o    X    |
|        /|\     /|\     /|\            |
|       / | \   / | \   / | \      M    |
|      /  |  \ /  |  \ /  |  \          |
|     o   o   o   o   o   o   o    X    |
|     |  /    |  / \  |    \  |         |
|     | /     | /   \ |     \ |    N    |
|     |/      |/     \|      \|         |
|     o   o   o   o   o   o   o    X    |
|     1   2   3   4   5   6   7         |
|                                       |
o

o
Figure 15.  M Followed By N

o

o
|                                       |
|     1   2   3   4   5   6   7         |
|     o   o   o   o   o   o   o    X    |
|        / \     / \     / \            |
|       /   \   /   \   /   \    M o N  |
|      /     \ /     \ /     \          |
|     o   o   o   o   o   o   o    X    |
|     1   2   3   4   5   6   7         |
|                                       |
o

o
Figure 16.  M Composed With N

Let us hark back to that mysterious matrix multiplication formula, and see how it appears in the light of the bigraph representation.

The coefficient of the composition  M ∘ N {\displaystyle M\circ N\\!} between  i {\displaystyle i\\!} and  j {\displaystyle j\\!} in  X {\displaystyle X\\!} is given as follows:

( M ∘ N ) i j = ∑ k M i k N k j {\displaystyle (M\circ N)_{ij}~=~\sum _{k}M_{ik}N_{kj}\\!}

Graphically interpreted, this is a sum over paths. Starting at the node  i , {\displaystyle i,\\!} M i k {\displaystyle M_{ik}\\!} being  1 {\displaystyle 1\\!} indicates that there is an edge in the bigraph of  M {\displaystyle M\\!} from node  i {\displaystyle i\\!} to node  k {\displaystyle k\\!} and  N k j {\displaystyle N_{kj}\\!} being  1 {\displaystyle 1\\!} indicates that there is an edge in the bigraph of  N {\displaystyle N\\!} from node  k {\displaystyle k\\!} to node  j . {\displaystyle j.\\!} So the  ∑ k {\displaystyle \textstyle \sum _{k}\\!} ranges over all possible intermediaries  k , {\displaystyle k,\\!} ascending from  0 {\displaystyle 0\\!} to  1 {\displaystyle 1\\!} just as soon as there happens to be a path of length two between nodes  i {\displaystyle i\\!} and  j . {\displaystyle j.\\!}

It is instructive at this point to compute the other possible composition that can be formed from  M {\displaystyle M\\!} and  N , {\displaystyle N,\\!} namely, the composition  N ∘ M , {\displaystyle N\circ M,\\!} that takes  M {\displaystyle M\\!} and  N {\displaystyle N\\!} in the opposite order. Here is the graphic computation:

o

o
|                                       |
|     1   2   3   4   5   6   7         |
|     o   o   o   o   o   o   o    X    |
|     |  /    |  / \  |    \  |         |
|     | /     | /   \ |     \ |    N    |
|     |/      |/     \|      \|         |
|     o   o   o   o   o   o   o    X    |
|        /|\     /|\     /|\            |
|       / | \   / | \   / | \      M    |
|      /  |  \ /  |  \ /  |  \          |
|     o   o   o   o   o   o   o    X    |
|     1   2   3   4   5   6   7         |
|                                       |
o

o
Figure 17.  N Followed By M

o

o
|                                       |
|     1   2   3   4   5   6   7         |
|     o   o   o   o   o   o   o    X    |
|                                       |
|                                N o M  |
|                                       |
|     o   o   o   o   o   o   o    X    |
|     1   2   3   4   5   6   7         |
|                                       |
o

o
Figure 18.  N Composed With M

In sum,  N ∘ M = 0. {\displaystyle N\circ M=0.\\!} This example affords sufficient evidence that relational composition, just like its kindred, matrix multiplication, is a non-commutative algebraic operation.

## References

[edit | edit source]

* Ulam, S.M., and Bednarek, A.R., "On the Theory of Relational Structures and Schemata for Parallel Computation" (1977), pp. 477-508 in A.R. Bednarek and Françoise Ulam (eds.), Analogies Between Analogies : The Mathematical Reports of S.M. Ulam and His Los Alamos Collaborators, University of California Press, Berkeley, CA, 1990.

## Bibliography

[edit | edit source]

* Mathematical Society of Japan, Encyclopedic Dictionary of Mathematics, 2nd edition, 2 volumes., Kiyosi Itô (ed.), MIT Press, Cambridge, MA, 1993.

* Mili, A., Desharnais, J., Mili, F., with Frappier, M., Computer Program Construction, Oxford University Press, New York, NY, 1994.

* Ulam, S.M., Analogies Between Analogies : The Mathematical Reports of S.M. Ulam and His Los Alamos Collaborators, A.R. Bednarek and Françoise Ulam (eds.), University of California Press, Berkeley, CA, 1990.

## Syllabus

[edit | edit source]

### Focal nodes

[edit | edit source]

* Inquiry Live
* Logic Live

### Peer nodes

[edit | edit source]

* Relation Composition @ InterSciWiki
* Relation Composition @ Subject Wikis
* Relation Composition @ Wikiversity
* Relation Composition @ Wikiversity Beta

### Logical operators

[edit | edit source]

* Exclusive disjunction
* Logical conjunction
* Logical disjunction
* Logical equality

* Logical implication
* Logical NAND
* Logical NNOR
* Negation

|

### Related topics

[edit | edit source]

* Ampheck
* Boolean domain
* Boolean function
* Boolean-valued function
* Differential logic

* Logical graph
* Minimal negation operator
* Multigrade operator
* Parametric operator
* Peirce's law

* Propositional calculus
* Sole sufficient operator
* Truth table
* Universe of discourse
* Zeroth order logic

|
|

### Relational concepts

[edit | edit source]

* Continuous predicate
* Hypostatic abstraction
* Logic of relatives
* Logical matrix

* Relation
* Relation composition
* Relation construction
* Relation reduction

* Relation theory
* Relative term
* Sign relation
* Triadic relation

|
|

### Information, Inquiry

[edit | edit source]

* Inquiry
* Dynamics of inquiry

* Semeiotic
* Logic of information

* Descriptive science
* Normative science

* Pragmatic maxim
* Truth theory

|
|
|

### Related articles

[edit | edit source]

* Cactus Language
* Futures Of Logical Graphs
* Propositional Equation Reasoning Systems

* Differential Logic : Introduction
* Differential Propositional Calculus
* Differential Logic and Dynamic Systems

* Introduction to Inquiry Driven Systems
* Prospects for Inquiry Driven Systems
* Inquiry Driven Systems : Inquiry Into Inquiry

|
|

## Document history

[edit | edit source]

Portions of the above article were adapted from the following sources under the GNU Free Documentation License, under other applicable licenses, or by permission of the copyright holders.

* Relation Composition, InterSciWiki
* Relation Composition, Semantic Web
* Relation Composition, Subject Wikis
* Relation Composition, Wikinfo
* Relation Composition, Wikiversity
* Relation Composition, Wikiversity Beta
* Relation Composition, Wikipedia