12,080
edits
Changes
MyWikiBiz, Author Your Legacy — Tuesday November 26, 2024
Jump to navigationJump to searchDirectory:Jon Awbrey/Papers/Inquiry Driven Systems : Part 6 (view source)
Revision as of 17:25, 21 February 2013
, 17:25, 21 February 2013→6.36. Irreducibly Triadic Relations: markup & renumber tables
Most likely, any triadic relation <math>L \subseteq X \times Y \times Z\!</math> imposed on arbitrary domains <math>X, Y, Z\!</math> could find use as a sign relation, provided it embodies any constraint at all, in other words, so long as it forms a proper subset of its total space, a relationship symbolized by writing <math>L \subset X \times Y \times Z.\!</math> However, triadic relations of this sort are not guaranteed to form the most natural examples of sign relations.
Most likely, any triadic relation <math>L \subseteq X \times Y \times Z\!</math> imposed on arbitrary domains <math>X, Y, Z\!</math> could find use as a sign relation, provided it embodies any constraint at all, in other words, so long as it forms a proper subset of its total space, a relationship symbolized by writing <math>L \subset X \times Y \times Z.\!</math> However, triadic relations of this sort are not guaranteed to form the most natural examples of sign relations.
In order to show what an irreducibly triadic relation looks like, this section presents a pair of triadic relations that have the same dyadic projections, and thus cannot be distinguished from each other on this basis alone. As it happens, these examples of triadic relations can be discussed independently of sign relational concerns, but structures of their general ilk are frequently found arising in signal theoretic applications, and they are undoubtedly closely associated with problems of reliable coding and communication.
In order to show what irreducibly triadic relations look like, this section presents a pair of triadic relations that have the same dyadic projections, and thus cannot be distinguished from each other on this basis alone. As it happens, these examples of triadic relations can be discussed independently of sign relational concerns, but structures of their general ilk are frequently found arising in signal-theoretic applications, and they are undoubtedly closely associated with problems of reliable coding and communication.
Tables 74.1 and 75.1 show a pair of irreducibly triadic relations <math>L_0\!</math> and <math>L_1,\!</math> respectively. Tables 74.2 to 74.4 and Tables 75.2 to 75.4 show the dyadic relations comprising <math>\operatorname{Proj}^{(2)} L_0\!</math> and <math>\operatorname{Proj}^{(2)} L_1,\!</math> respectively.
<br>
<pre>
<pre>
Table 74.1 Relation R0 = {<x, y, z> C B3 : x + y + z = 0}
Table 71.1 Relation R0 = {<x, y, z> C B3 : x + y + z = 0}
x y z
x y z
0 0 0
0 0 0
1 0 1
1 0 1
1 1 0
1 1 0
</pre>
Table 71.2 Dyadic Projection R012
<br>
<pre>
Table 74.2 Dyadic Projection R012
x y
x y
0 0
0 0
1 0
1 0
1 1
1 1
</pre>
<br>
Table 71.3 Dyadic Projection R013
<pre>
Table 74.3 Dyadic Projection R013
x z
x z
0 0
0 0
1 1
1 1
1 0
1 0
</pre>
Table 71.4 Dyadic Projection R023
<br>
<pre>
Table 74.4 Dyadic Projection R023
y z
y z
0 0
0 0
0 1
0 1
1 0
1 0
</pre>
Table 72.1 Relation R1 = {<x, y, z> C B3 : x + y + z = 1}
<br>
<pre>
Table 75.1 Relation R1 = {<x, y, z> C B3 : x + y + z = 1}
x y z
x y z
0 0 1
0 0 1
1 0 0
1 0 0
1 1 1
1 1 1
</pre>
Table 72.2 Dyadic Projection R112
<br>
<pre>
Table 75.2 Dyadic Projection R112
x y
x y
0 0
0 0
1 0
1 0
1 1
1 1
</pre>
Table 72.3 Dyadic Projection R113
<br>
<pre>
Table 75.3 Dyadic Projection R113
x z
x z
0 1
0 1
1 0
1 0
1 1
1 1
</pre>
Table 72.4 Dyadic Projection R123
<br>
<pre>
Table 75.4 Dyadic Projection R123
y z
y z
0 1
0 1
0 0
0 0
1 1
1 1
</pre>
<br>
<pre>
The relations R0, R1 c B3 are defined by the following equations, with algebraic operations taking place as in GF(2), that is, with 1 + 1 = 0.
The relations R0, R1 c B3 are defined by the following equations, with algebraic operations taking place as in GF(2), that is, with 1 + 1 = 0.
