Difference between revisions of "Relation reduction"

MyWikiBiz, Author Your Legacy — Wednesday November 13, 2024
Jump to navigationJump to search
(cats)
(update)
 
(11 intermediate revisions by the same user not shown)
Line 1: Line 1:
−
In [[logic]] and [[mathematics]], '''relation reduction''' and '''relational reducibility''' have to do with the extent to which a given [[relation (mathematics)|relation]] is determined by a set of other relations, called the ''relation dataset''.  The relation under examination is called the ''reductandum''.  The relation dataset typically consists of a specified relation over sets of relations, called the ''reducer'', the ''method of reduction'', or the ''relational step'', plus a set of other relations, called the ''reduciens'' or the ''relational base'',  each of which is properly simpler in a specified way than relation under examination.
+
<font size="3">&#9758;</font> This page belongs to resource collections on [[Logic Live|Logic]] and [[Inquiry Live|Inquiry]].
  
−
A question of relation reduction or relational reducibility is sometimes posed as a question of '''relation reconstruction''' or '''relational reconstructibility''', since a useful way of stating the question is to ask whether the reductandum can be reconstructed from the reduciens.  See [[Humpty Dumpty]].
+
In logic and mathematics, '''relation reduction''' and '''relational reducibility''' have to do with the extent to which a given [[relation (mathematics)|relation]] is determined by a set of other relations, called the ''relation dataset''.  The relation under examination is called the ''reductandum''.  The relation dataset typically consists of a specified relation over sets of relations, called the ''reducer'', the ''method of reduction'', or the ''relational step'', plus a set of other relations, called the ''reduciens'' or the ''relational base'',  each of which is properly simpler in a specified way than the relation under examination.
 +
 
 +
A question of relation reduction or relational reducibility is sometimes posed as a question of '''relation reconstruction''' or '''relational reconstructibility''', since a useful way of stating the question is to ask whether the reductandum can be reconstructed from the reduciens.
  
 
A relation that is not uniquely determined by a particular relation dataset is said to be ''irreducible'' in just that respect.  A relation that is not uniquely determined by any relation dataset in a particular class of relation datasets is said to be ''irreducible'' in respect of that class.
 
A relation that is not uniquely determined by a particular relation dataset is said to be ''irreducible'' in just that respect.  A relation that is not uniquely determined by any relation dataset in a particular class of relation datasets is said to be ''irreducible'' in respect of that class.
Line 7: Line 9:
 
==Discussion==
 
==Discussion==
  
−
The main thing that keeps the general problem of relational reducibility from being fully well-defined is that one would have to survey all of the conceivable ways of "getting new relations from old" in order to say precisely what is meant by the claim that the relation <math>L\!</math> is reducible to the set of relations <math>\{ L_j : j \in J \}.</math>  This amounts to claiming one can be given a set of ''properly simpler'' relations <math>L_j\!</math> for values <math>j\!</math> in a given index set <math>J\!</math> and that this collection of data would suffice to fix the original relation <math>L\!</math> that one is seeking to analyze, determine, specify, or synthesize.
+
The main thing that keeps the general problem of relational reducibility from being fully well-defined is that one would have to survey all of the conceivable ways of &ldquo;getting new relations from old&rdquo; in order to say precisely what is meant by the claim that the relation <math>L\!</math> is reducible to the set of relations <math>\{ L_j : j \in J \}.\!</math>  This amounts to claiming one can be given a set of ''properly simpler'' relations <math>L_j\!</math> for values <math>j\!</math> in a given index set <math>J\!</math> and that this collection of data would suffice to fix the original relation <math>L\!</math> that one is seeking to analyze, determine, specify, or synthesize.
  
 
In practice, however, apposite discussion of a particular application typically settles on either one of two different notions of reducibility as capturing the pertinent issues, namely:
 
In practice, however, apposite discussion of a particular application typically settles on either one of two different notions of reducibility as capturing the pertinent issues, namely:
Line 22: Line 24:
 
The work of intuiting how projections operate on multidimensional relations is often facilitated by keeping in mind the following sort of geometric image:
 
The work of intuiting how projections operate on multidimensional relations is often facilitated by keeping in mind the following sort of geometric image:
  
−
* Picture a ''k''-adic relation ''L'' as a body that resides in a ''k''-dimensional space ''X''.  If the domains of the relation ''L'' are ''X''<sub>1</sub>, …, ''X''<sub>''k''</sub> , then the ''extension'' of the relation ''L'' is a subset of the cartesian product ''X'' = ''X''<sub>1</sub> × … × ''X''<sub>''k''</sub> .
+
* Picture a <math>k\!</math>-adic relation <math>L\!</math> as a body that resides in a <math>k\!</math>-dimensional space <math>X.\!</math> If the domains of the relation <math>L\!</math> are <math>X_1, \ldots, X_k,\!</math> then the ''extension'' of the relation <math>L\!</math> is a subset of the cartesian product <math>X = X_1 \times \ldots \times X_k.\!</math>
  
−
In this setting, the interval ''K'' = [1, ''k''] = {1, …, ''k''} is called the ''[[index set]]'' of the ''[[indexed family]]'' of sets ''X''<sub>1</sub>, …, ''X''<sub>''k''</sub> .
+
In this setting the interval <math>K = [1, k] = \{ 1, \ldots, k \}\!</math> is called the ''index set'' of the ''indexed family'' of sets <math>X_1, \ldots, X_k.\!</math>
  
−
For any subset ''F'' of the index set ''K'', there is the corresponding subfamily of sets, {''X''<sub>''j''</sub>&nbsp;:&nbsp;''j''&nbsp;&isin;&nbsp;''F''&nbsp;}, and there is the corresponding cartesian product over this subfamily, notated and defined as ''X''<sub>''F''</sub> = <font size="+2">&Pi;</font><sub>''j''&nbsp;&isin;&nbsp;''F''</sub>&nbsp;''X''<sub>''j''</sub>.
+
For any subset <math>F\!</math> of the index set <math>K,\!</math> there is the corresponding subfamily of sets, <math>\{ X_j : j \in F \},\!</math> and there is the corresponding cartesian product over this subfamily, notated and defined as <math>\textstyle X_F = \prod_{j \in F} X_j.\!</math>
  
−
For any point ''x'' in ''X'', the ''projection'' of ''x'' on the subspace ''X''<sub>''F''</sub> is notated as proj<sub>''F''</sub>(''x'').
+
For any point <math>x\!</math> in <math>X,\!</math> the ''projection'' of <math>x\!</math> on the subspace <math>X_F\!</math> is notated as <math>\mathrm{proj}_F (x).\!</math>
  
−
More generally, for any relation ''L'' &#8838; ''X'', the projection of ''L'' on the subspace ''X''<sub>''F''</sub> is written as proj<sub>''F''</sub>(''L''), or still more simply, as proj<sub>''F''</sub> ''L''.
+
More generally, for any relation <math>L \subseteq X,\!</math> the projection of <math>L\!</math> on the subspace <math>X_F\!</math> is written as <math>\mathrm{proj}_F (L)\!</math> or still more simply as <math>\mathrm{proj}_F L.\!</math>
  
−
The question of ''projective reduction'' for k-adic relations can be stated with moderate generality in the following way:
+
The question of ''projective reduction'' for <math>k\!</math>-adic relations can be stated with moderate generality in the following way:
  
−
* Given a set of k-place relations in the same space ''X'' and a set of projections from X to the associated subspaces, do the projections afford sufficient data to tell the different relations apart?
+
* Given a set of <math>k\!</math>-place relations in the same space <math>X\!</math> and a set of projections from <math>X\!</math> to the associated subspaces, do the projections afford sufficient data to tell the different relations apart?
  
 
==Projective reducibility of triadic relations==
 
==Projective reducibility of triadic relations==
Line 43: Line 45:
 
===Examples of projectively irreducible relations===
 
===Examples of projectively irreducible relations===
  
−
The 3-adic relations '''L'''<sub>0</sub> and '''L'''<sub>1</sub> are shown in the next two Tables:
+
The 3-adic relations <math>L_0\!</math> and <math>L_1\!</math> are shown in the next two Tables:
 +
 
 +
<br>
  
−
{| align="center" border="1" cellpadding="8" cellspacing="0" style="background:lightcyan; font-weight:bold; text-align:center; width:60%"
+
{| align="center" border="1" cellpadding="10" cellspacing="0" style="text-align:center; width:60%"
−
|+ '''L'''<sub>0</sub> = {(''x'', ''y'', ''z'') &#8712; '''B'''<sup>3</sup> : ''x'' + ''y'' + ''z'' = 0}
+
|+ style="height:30px" | <math>L_0 ~=~ \{ (x, y, z) \in \mathbb{B}^3 : x + y + z = 0 \}\!</math>
−
|- style="background:paleturquoise"
+
|- style="height:40px; background:ghostwhite"
−
! X !! Y !! Z
+
| <math>X\!</math> || <math>Y\!</math> || <math>Z\!</math>
 
|-
 
|-
−
| '''0''' || '''0''' || '''0'''
+
| <math>0\!</math> || <math>0\!</math> || <math>0\!</math>
 
|-
 
|-
−
| '''0''' || '''1''' || '''1'''
+
| <math>0\!</math> || <math>1\!</math> || <math>1\!</math>
 
|-
 
|-
−
| '''1''' || '''0''' || '''1'''
+
| <math>1\!</math> || <math>0\!</math> || <math>1\!</math>
 
|-
 
|-
−
| '''1''' || '''1''' || '''0'''
+
| <math>1\!</math> || <math>1\!</math> || <math>0\!</math>
 
|}
 
|}
 +
 
<br>
 
<br>
  
−
{| align="center" border="1" cellpadding="8" cellspacing="0" style="background:lightcyan; font-weight:bold; text-align:center; width:60%"
+
{| align="center" border="1" cellpadding="10" cellspacing="0" style="text-align:center; width:60%"
−
|+ '''L'''<sub>1</sub> = {(''x'', ''y'', ''z'') &#8712; '''B'''<sup>3</sup> : ''x'' + ''y'' + ''z'' = 1}
+
|+ style="height:30px" | <math>L_1 ~=~ \{ (x, y, z) \in \mathbb{B}^3 : x + y + z = 1 \}\!</math>
−
|- style="background:paleturquoise"
+
|- style="height:40px; background:ghostwhite"
−
! X !! Y !! Z
+
| <math>X\!</math> || <math>Y\!</math> || <math>Z\!</math>
 
|-
 
|-
−
| '''0''' || '''0''' || '''1'''
+
| <math>0\!</math> || <math>0\!</math> || <math>1\!</math>
 
|-
 
|-
−
| '''0''' || '''1''' || '''0'''
+
| <math>0\!</math> || <math>1\!</math> || <math>0\!</math>
 
|-
 
|-
−
| '''1''' || '''0''' || '''0'''
+
| <math>1\!</math> || <math>0\!</math> || <math>0\!</math>
 
|-
 
|-
−
| '''1''' || '''1''' || '''1'''
+
| <math>1\!</math> || <math>1\!</math> || <math>1\!</math>
 
|}
 
|}
 +
 
<br>
 
<br>
  
−
A ''2-adic projection'' of a 3-adic relation ''L'' is the 2-adic relation that results from deleting one column of the table for ''L'' and then deleting all but one row of any resulting rows that happen to be identical in content.  In other words, the multiplicity of any repeated row is ignored.
+
A ''2-adic projection'' of a 3-adic relation <math>L\!</math> is the 2-adic relation that results from deleting one column of the table for <math>L\!</math> and then deleting all but one row of any resulting rows that happen to be identical in content.  In other words, the multiplicity of any repeated row is ignored.
  
−
In the case of the above two relations, '''L'''<sub>0</sub>, '''L'''<sub>1</sub> &#8838; ''X'' × ''Y'' × ''Z'' <u>&#8776;</u> '''B'''<sup>3</sup>, the 2-adic projections are indexed by the columns or domains that remain, as shown in the following Tables.
+
In the case of the above two relations, <math>{L_0, L_1 ~\subseteq~ X \times Y \times Z ~\cong~ \mathbb{B}^3},\!</math> the 2-adic projections are indexed by the columns or domains that remain, as shown in the following Tables.
 +
 
 +
<br>
  
 
{| align="center" style="width:90%"
 
{| align="center" style="width:90%"
 
|
 
|
−
{| border="1" cellpadding="8" cellspacing="0" style="background:lightcyan; font-weight:bold; text-align:center; width:90%"
+
{| align="center" border="1" cellpadding="8" cellspacing="0" style="text-align:center; width:90%"
−
|+ proj<sub>''XY''</sub>('''L'''<sub>0</sub>)
+
|+ style="height:30px" | <math>\mathrm{proj}_{XY} L_0\!</math>
−
|- style="background:paleturquoise"
+
|- style="height:40px; background:ghostwhite"
−
! X !! Y
+
| <math>X\!</math> || <math>Y\!</math>
 
|-
 
|-
−
| '''0''' || '''0'''
+
| <math>0\!</math> || <math>0\!</math>
 
|-
 
|-
−
| '''0''' || '''1'''
+
| <math>0\!</math> || <math>1\!</math>
 
|-
 
|-
−
| '''1''' || '''0'''
+
| <math>1\!</math> || <math>0\!</math>
 
|-
 
|-
−
| '''1''' || '''1'''
+
| <math>1\!</math> || <math>1\!</math>
 
|}
 
|}
 
|
 
|
−
{| border="1" cellpadding="8" cellspacing="0" style="background:lightcyan; font-weight:bold; text-align:center; width:90%"
+
{| align="center" border="1" cellpadding="8" cellspacing="0" style="text-align:center; width:90%"
−
|+ proj<sub>''XZ''</sub>('''L'''<sub>0</sub>)
+
|+ style="height:30px" | <math>\mathrm{proj}_{XZ} L_0\!</math>
−
|- style="background:paleturquoise"
+
|- style="height:40px; background:ghostwhite"
−
! X !! Z
+
| <math>X\!</math> || <math>Z\!</math>
 
|-
 
|-
−
| '''0''' || '''0'''
+
| <math>0\!</math> || <math>0\!</math>
 
|-
 
|-
−
| '''0''' || '''1'''
+
| <math>0\!</math> || <math>1\!</math>
 
|-
 
|-
−
| '''1''' || '''1'''
+
| <math>1\!</math> || <math>1\!</math>
 
|-
 
|-
−
| '''1''' || '''0'''
+
| <math>1\!</math> || <math>0\!</math>
 
|}
 
|}
 
|
 
|
−
{| border="1" cellpadding="8" cellspacing="0" style="background:lightcyan; font-weight:bold; text-align:center; width:90%"
+
{| align="center" border="1" cellpadding="8" cellspacing="0" style="text-align:center; width:90%"
−
|+ proj<sub>''YZ''</sub>('''L'''<sub>0</sub>)
+
|+ style="height:30px" | <math>\mathrm{proj}_{YZ} L_0\!</math>
−
|- style="background:paleturquoise"
+
|- style="height:40px; background:ghostwhite"
−
! Y !! Z
+
| <math>Y\!</math> || <math>Z\!</math>
 
|-
 
|-
−
| '''0''' || '''0'''
+
| <math>0\!</math> || <math>0\!</math>
 
|-
 
|-
−
| '''1''' || '''1'''
+
| <math>1\!</math> || <math>1\!</math>
 
|-
 
|-
−
| '''0''' || '''1'''
+
| <math>0\!</math> || <math>1\!</math>
 
|-
 
|-
−
| '''1''' || '''0'''
+
| <math>1\!</math> || <math>0\!</math>
 
|}
 
|}
 
|}
 
|}
 +
 
<br>
 
<br>
  
 
{| align="center" style="width:90%"
 
{| align="center" style="width:90%"
 
|
 
|
−
{| border="1" cellpadding="8" cellspacing="0" style="background:lightcyan; font-weight:bold; text-align:center; width:90%"
+
{| align="center" border="1" cellpadding="8" cellspacing="0" style="text-align:center; width:90%"
−
|+ proj<sub>''XY''</sub>('''L'''<sub>1</sub>)
+
|+ style="height:30px" | <math>\mathrm{proj}_{XY} L_1\!</math>
−
|- style="background:paleturquoise"
+
|- style="height:40px; background:ghostwhite"
−
! X !! Y
+
| <math>X\!</math> || <math>Y\!</math>
 
|-
 
|-
−
| '''0''' || '''0'''
+
| <math>0\!</math> || <math>0\!</math>
 
|-
 
|-
−
| '''0''' || '''1'''
+
| <math>0\!</math> || <math>1\!</math>
 
|-
 
|-
−
| '''1''' || '''0'''
+
| <math>1\!</math> || <math>0\!</math>
 
|-
 
|-
−
| '''1''' || '''1'''
+
| <math>1\!</math> || <math>1\!</math>
 
|}
 
|}
 
|
 
|
−
{| border="1" cellpadding="8" cellspacing="0" style="background:lightcyan; font-weight:bold; text-align:center; width:90%"
+
{| align="center" border="1" cellpadding="8" cellspacing="0" style="text-align:center; width:90%"
−
|+ proj<sub>''XZ''</sub>('''L'''<sub>1</sub>)
+
|+ style="height:30px" | <math>\mathrm{proj}_{XZ} L_1\!</math>
−
|- style="background:paleturquoise"
+
|- style="height:40px; background:ghostwhite"
−
! X !! Z
+
| <math>X\!</math> || <math>Z\!</math>
 
|-
 
|-
−
| '''0''' || '''1'''
+
| <math>0\!</math> || <math>1\!</math>
 
|-
 
|-
−
| '''0''' || '''0'''
+
| <math>0\!</math> || <math>0\!</math>
 
|-
 
|-
−
| '''1''' || '''0'''
+
| <math>1\!</math> || <math>0\!</math>
 
|-
 
|-
−
| '''1''' || '''1'''
+
| <math>1\!</math> || <math>1\!</math>
 
|}
 
|}
 
|
 
|
−
{| border="1" cellpadding="8" cellspacing="0" style="background:lightcyan; font-weight:bold; text-align:center; width:90%"
+
{| align="center" border="1" cellpadding="8" cellspacing="0" style="text-align:center; width:90%"
−
|+ proj<sub>''YZ''</sub>('''L'''<sub>1</sub>)
+
|+ style="height:30px" | <math>\mathrm{proj}_{YZ} L_1\!</math>
−
|- style="background:paleturquoise"
+
|- style="height:40px; background:ghostwhite"
−
! Y !! Z
+
| <math>Y\!</math> || <math>Z\!</math>
 
|-
 
|-
−
| '''0''' || '''1'''
+
| <math>0\!</math> || <math>1\!</math>
 
|-
 
|-
−
| '''1''' || '''0'''
+
| <math>1\!</math> || <math>0\!</math>
 
|-
 
|-
−
| '''0''' || '''0'''
+
| <math>0\!</math> || <math>0\!</math>
 
|-
 
|-
−
| '''1''' || '''1'''
+
| <math>1\!</math> || <math>1\!</math>
 
|}
 
|}
 
|}
 
|}
 +
 
<br>
 
<br>
  
 
It is clear on inspection that the following three equations hold:
 
It is clear on inspection that the following three equations hold:
  
−
{| align="center" cellpadding="4" style="text-align:center; width:90%"
+
{| align="center" cellpadding="8" style="text-align:center; width:90%"
−
| proj<sub>''XY''</sub>('''L'''<sub>0</sub>) = proj<sub>''XY''</sub>('''L'''<sub>1</sub>)
+
| <math>\mathrm{proj}_{XY}(L_0) ~=~ \mathrm{proj}_{XY}(L_1)~\!</math>
−
| proj<sub>''XZ''</sub>('''L'''<sub>0</sub>) = proj<sub>''XZ''</sub>('''L'''<sub>1</sub>)
+
| <math>\mathrm{proj}_{XZ}(L_0) ~=~ \mathrm{proj}_{XZ}(L_1)~\!</math>
−
| proj<sub>''YZ''</sub>('''L'''<sub>0</sub>) = proj<sub>''YZ''</sub>('''L'''<sub>1</sub>)
+
| <math>\mathrm{proj}_{YZ}(L_0) ~=~ \mathrm{proj}_{YZ}(L_1)~\!</math>
 
|}
 
|}
  
−
These equations say that '''L'''<sub>0</sub> and '''L'''<sub>1</sub> cannot be distinguished from each other solely on the basis of their 2-adic projection data.  In such a case, either relation is said to be ''irreducible with respect to 2-adic projections''.  Since reducibility with respect to 2-adic projections is the only interesting case where it concerns the reduction of 3-adic relations, it is customary to say more simply of such a relation that it is ''projectively irreducible'', the 2-adic basis being understood.  It is immediate from the definition that projectively irreducible relations always arise in non-trivial multiplets of mutually indiscernible relations.
+
These equations say that <math>L_0\!</math> and <math>L_1\!</math> cannot be distinguished from each other solely on the basis of their 2-adic projection data.  In such a case, each relation is said to be ''irreducible with respect to 2-adic projections''.  Since reducibility with respect to 2-adic projections is the only interesting case where it concerns the reduction of 3-adic relations, it is customary to say more simply of such a relation that it is ''projectively irreducible'', the 2-adic basis being understood.  It is immediate from the definition that projectively irreducible relations always arise in non-trivial multiplets of mutually indiscernible relations.
  
 
===Examples of projectively reducible relations===
 
===Examples of projectively reducible relations===
  
−
The 3-adic relations '''L'''<sub>A</sub> and '''L'''<sub>B</sub> are shown in the next two Tables:
+
The 3-adic relations <math>L_\mathrm{A}\!</math> and <math>L_\mathrm{B}\!</math> are shown in the next two Tables:
 +
 
 +
<br>
  
−
{| align="center" border="1" cellpadding="8" cellspacing="0" style="background:lightcyan; font-weight:bold; text-align:center; width:60%"
+
{| align="center" border="1" cellpadding="10" cellspacing="0" style="text-align:center; width:60%"
−
|+ '''L'''<sub>A</sub> = Sign Relation of Interpreter A
+
|+ style="height:30px" | <math>L_\mathrm{A} ~=~ \text{Sign Relation of Interpreter A}\!</math>
−
|- style="background:paleturquoise"
+
|- style="height:40px; background:ghostwhite"
−
! style="width:20%" | Object
+
| style="width:33%" | <math>\text{Object}\!</math>
−
! style="width:20%" | Sign
+
| style="width:33%" | <math>\text{Sign}\!</math>
−
! style="width:20%" | Interpretant
+
| style="width:33%" | <math>\text{Interpretant}\!</math>
 
|-
 
|-
−
| '''A''' || '''"A"''' || '''"A"'''
+
| <math>\mathrm{A}\!</math>
 +
| <math>{}^{\backprime\backprime} \mathrm{A} {}^{\prime\prime}\!</math>
 +
| <math>{}^{\backprime\backprime} \mathrm{A} {}^{\prime\prime}\!</math>
 
|-
 
|-
−
| '''A''' || '''"A"''' || '''"i"'''
+
| <math>\mathrm{A}\!</math>
 +
| <math>{}^{\backprime\backprime} \mathrm{A} {}^{\prime\prime}\!</math>
 +
| <math>{}^{\backprime\backprime} \mathrm{i} {}^{\prime\prime}\!</math>
 
|-
 
|-
−
| '''A''' || '''"i"''' || '''"A"'''
+
| <math>\mathrm{A}\!</math>
 +
| <math>{}^{\backprime\backprime} \mathrm{i} {}^{\prime\prime}\!</math>
 +
| <math>{}^{\backprime\backprime} \mathrm{A} {}^{\prime\prime}\!</math>
 
|-
 
|-
−
| '''A''' || '''"i"''' || '''"i"'''
+
| <math>\mathrm{A}\!</math>
 +
| <math>{}^{\backprime\backprime} \mathrm{i} {}^{\prime\prime}\!</math>
 +
| <math>{}^{\backprime\backprime} \mathrm{i} {}^{\prime\prime}\!</math>
 
|-
 
|-
−
| '''B''' || '''"B"''' || '''"B"'''
+
| <math>\mathrm{B}\!</math>
 +
| <math>{}^{\backprime\backprime} \mathrm{B} {}^{\prime\prime}\!</math>
 +
| <math>{}^{\backprime\backprime} \mathrm{B} {}^{\prime\prime}\!</math>
 
|-
 
|-
−
| '''B''' || '''"B"''' || '''"u"'''
+
| <math>\mathrm{B}\!</math>
 +
| <math>{}^{\backprime\backprime} \mathrm{B} {}^{\prime\prime}\!</math>
 +
| <math>{}^{\backprime\backprime} \mathrm{u} {}^{\prime\prime}\!</math>
 
|-
 
|-
−
| '''B''' || '''"u"''' || '''"B"'''
+
| <math>\mathrm{B}\!</math>
 +
| <math>{}^{\backprime\backprime} \mathrm{u} {}^{\prime\prime}\!</math>
 +
| <math>{}^{\backprime\backprime} \mathrm{B} {}^{\prime\prime}\!</math>
 
|-
 
|-
−
| '''B''' || '''"u"''' || '''"u"'''
+
| <math>\mathrm{B}\!</math>
 +
| <math>{}^{\backprime\backprime} \mathrm{u} {}^{\prime\prime}\!</math>
 +
| <math>{}^{\backprime\backprime} \mathrm{u} {}^{\prime\prime}\!</math>
 
|}
 
|}
 +
 
<br>
 
<br>
  
−
{| align="center" border="1" cellpadding="8" cellspacing="0" style="background:lightcyan; font-weight:bold; text-align:center; width:60%"
+
{| align="center" border="1" cellpadding="10" cellspacing="0" style="text-align:center; width:60%"
−
|+ '''L'''<sub>B</sub> = Sign Relation of Interpreter B
+
|+ style="height:30px" | <math>L_\mathrm{B} ~=~ \text{Sign Relation of Interpreter B}\!</math>
−
|- style="background:paleturquoise"
+
|- style="height:40px; background:ghostwhite"
−
! style="width:20%" | Object
+
| style="width:33%" | <math>\text{Object}\!</math>
−
! style="width:20%" | Sign
+
| style="width:33%" | <math>\text{Sign}\!</math>
−
! style="width:20%" | Interpretant
+
| style="width:33%" | <math>\text{Interpretant}\!</math>
 
|-
 
|-
−
| '''A''' || '''"A"''' || '''"A"'''
+
| <math>\mathrm{A}\!</math>
 +
| <math>{}^{\backprime\backprime} \mathrm{A} {}^{\prime\prime}\!</math>
 +
| <math>{}^{\backprime\backprime} \mathrm{A} {}^{\prime\prime}\!</math>
 
|-
 
|-
−
| '''A''' || '''"A"''' || '''"u"'''
+
| <math>\mathrm{A}\!</math>
 +
| <math>{}^{\backprime\backprime} \mathrm{A} {}^{\prime\prime}\!</math>
 +
| <math>{}^{\backprime\backprime} \mathrm{u} {}^{\prime\prime}\!</math>
 
|-
 
|-
−
| '''A''' || '''"u"''' || '''"A"'''
+
|<math>\mathrm{A}\!</math>
 +
| <math>{}^{\backprime\backprime} \mathrm{u} {}^{\prime\prime}\!</math>
 +
| <math>{}^{\backprime\backprime} \mathrm{A} {}^{\prime\prime}\!</math>
 
|-
 
|-
−
| '''A''' || '''"u"''' || '''"u"'''
+
| <math>\mathrm{A}\!</math>
 +
| <math>{}^{\backprime\backprime} \mathrm{u} {}^{\prime\prime}\!</math>
 +
| <math>{}^{\backprime\backprime} \mathrm{u} {}^{\prime\prime}\!</math>
 
|-
 
|-
−
| '''B''' || '''"B"''' || '''"B"'''
+
| <math>\mathrm{B}\!</math>
 +
| <math>{}^{\backprime\backprime} \mathrm{B} {}^{\prime\prime}\!</math>
 +
| <math>{}^{\backprime\backprime} \mathrm{B} {}^{\prime\prime}\!</math>
 
|-
 
|-
−
| '''B''' || '''"B"''' || '''"i"'''
+
| <math>\mathrm{B}\!</math>
 +
| <math>{}^{\backprime\backprime} \mathrm{B} {}^{\prime\prime}\!</math>
 +
| <math>{}^{\backprime\backprime} \mathrm{i} {}^{\prime\prime}\!</math>
 
|-
 
|-
−
| '''B''' || '''"i"''' || '''"B"'''
+
| <math>\mathrm{B}\!</math>
 +
| <math>{}^{\backprime\backprime} \mathrm{i} {}^{\prime\prime}\!</math>
 +
| <math>{}^{\backprime\backprime} \mathrm{B} {}^{\prime\prime}\!</math>
 
|-
 
|-
−
| '''B''' || '''"i"''' || '''"i"'''
+
| <math>\mathrm{B}\!</math>
 +
| <math>{}^{\backprime\backprime} \mathrm{i} {}^{\prime\prime}\!</math>
 +
| <math>{}^{\backprime\backprime} \mathrm{i} {}^{\prime\prime}\!</math>
 
|}
 
|}
 +
 
<br>
 
<br>
  
−
In the case of the two sign relations, '''L'''<sub>A</sub>, '''L'''<sub>B</sub> &#8838; ''X'' × ''Y'' × ''Z'' <u>&#8776;</u> '''O''' × '''S''' × '''I''', the 2-adic projections are indexed by the columns or domains that remain, as shown in the following Tables.
+
In the case of the two sign relations, <math>L_\mathrm{A}, L_\mathrm{B} ~\subseteq~ X \times Y \times Z ~\cong~ O \times S \times I,\!</math> the 2-adic projections are indexed by the columns or domains that remain, as shown in the following Tables.
 +
 
 +
<br>
  
 
{| align="center" style="width:90%"
 
{| align="center" style="width:90%"
 
|
 
|
−
{| border="1" cellpadding="8" cellspacing="0" style="background:lightcyan; font-weight:bold; text-align:center; width:90%"
+
{| align="center" border="1" cellpadding="8" cellspacing="0" style="text-align:center; width:90%"
−
|+ proj<sub>''XY''</sub>('''L'''<sub>A</sub>)
+
|+ style="height:30px" | <math>\mathrm{proj}_{XY}(L_\mathrm{A})\!</math>
−
|- style="background:paleturquoise"
+
|- style="height:40px; background:ghostwhite"
−
! style="width:50%" | Object
+
| width="50%" | <math>\text{Object}\!</math>
−
! style="width:50%" | Sign
+
| width="50%" | <math>\text{Sign}\!</math>
 
|-
 
|-
−
| '''A''' || '''"A"'''
+
| <math>\mathrm{A}\!</math> || <math>{}^{\backprime\backprime} \mathrm{A} {}^{\prime\prime}\!</math>
 
|-
 
|-
−
| '''A''' || '''"i"'''
+
| <math>\mathrm{A}\!</math> || <math>{}^{\backprime\backprime} \mathrm{i} {}^{\prime\prime}\!</math>
 
|-
 
|-
−
| '''B''' || '''"B"'''
+
| <math>\mathrm{B}\!</math> || <math>{}^{\backprime\backprime} \mathrm{B} {}^{\prime\prime}\!</math>
 
|-
 
|-
−
| '''B''' || '''"u"'''
+
| <math>\mathrm{B}\!</math> || <math>{}^{\backprime\backprime} \mathrm{u} {}^{\prime\prime}\!</math>
 
|}
 
|}
 
|
 
|
−
{| border="1" cellpadding="8" cellspacing="0" style="background:lightcyan; font-weight:bold; text-align:center; width:90%"
+
{| align="center" border="1" cellpadding="8" cellspacing="0" style="text-align:center; width:90%"
−
|+ proj<sub>''XZ''</sub>('''L'''<sub>A</sub>)
+
|+ style="height:30px" | <math>\mathrm{proj}_{XZ}(L_\mathrm{A})\!</math>
−
|- style="background:paleturquoise"
+
|- style="height:40px; background:ghostwhite"
−
! style="width:50%" | Object
+
| width="50%" | <math>\text{Object}\!</math>
−
! style="width:50%" | Interpretant
+
| width="50%" | <math>\text{Interpretant}\!</math>
 
|-
 
|-
−
| '''A''' || '''"A"'''
+
| <math>\mathrm{A}\!</math> || <math>{}^{\backprime\backprime} \mathrm{A} {}^{\prime\prime}\!</math>
 
|-
 
|-
−
| '''A''' || '''"i"'''
+
| <math>\mathrm{A}\!</math> || <math>{}^{\backprime\backprime} \mathrm{i} {}^{\prime\prime}\!</math>
 
|-
 
|-
−
| '''B''' || '''"B"'''
+
| <math>\mathrm{B}\!</math> || <math>{}^{\backprime\backprime} \mathrm{B} {}^{\prime\prime}\!</math>
 
|-
 
|-
−
| '''B''' || '''"u"'''
+
| <math>\mathrm{B}\!</math> || <math>{}^{\backprime\backprime} \mathrm{u} {}^{\prime\prime}\!</math>
 
|}
 
|}
 
|
 
|
−
{| border="1" cellpadding="8" cellspacing="0" style="background:lightcyan; font-weight:bold; text-align:center; width:90%"
+
{| align="center" border="1" cellpadding="8" cellspacing="0" style="text-align:center; width:90%"
−
|+ proj<sub>''YZ''</sub>('''L'''<sub>A</sub>)
+
|+ style="height:30px" | <math>\mathrm{proj}_{YZ}(L_\mathrm{A})\!</math>
−
|- style="background:paleturquoise"
+
|- style="height:40px; background:ghostwhite"
−
! style="width:50%" | Sign
+
| width="50%" | <math>\text{Sign}\!</math>
−
! style="width:50%" | Interpretant
+
| width="50%" | <math>\text{Interpretant}\!</math>
 
|-
 
|-
−
| '''"A"''' || '''"A"'''
+
| <math>{}^{\backprime\backprime} \mathrm{A} {}^{\prime\prime}\!</math>
 +
| <math>{}^{\backprime\backprime} \mathrm{A} {}^{\prime\prime}\!</math>
 
|-
 
|-
−
| '''"A"''' || '''"i"'''
+
| <math>{}^{\backprime\backprime} \mathrm{A} {}^{\prime\prime}\!</math>
 +
| <math>{}^{\backprime\backprime} \mathrm{i} {}^{\prime\prime}\!</math>
 
|-
 
|-
−
| '''"i"''' || '''"A"'''
+
| <math>{}^{\backprime\backprime} \mathrm{i} {}^{\prime\prime}\!</math>
 +
| <math>{}^{\backprime\backprime} \mathrm{A} {}^{\prime\prime}\!</math>
 
|-
 
|-
−
| '''"i"''' || '''"i"'''
+
| <math>{}^{\backprime\backprime} \mathrm{i} {}^{\prime\prime}\!</math>
 +
| <math>{}^{\backprime\backprime} \mathrm{i} {}^{\prime\prime}\!</math>
 
|-
 
|-
−
| '''"B"''' || '''"B"'''
+
| <math>{}^{\backprime\backprime} \mathrm{B} {}^{\prime\prime}\!</math>
 +
| <math>{}^{\backprime\backprime} \mathrm{B} {}^{\prime\prime}\!</math>
 
|-
 
|-
−
| '''"B"''' || '''"u"'''
+
| <math>{}^{\backprime\backprime} \mathrm{B} {}^{\prime\prime}\!</math>
 +
| <math>{}^{\backprime\backprime} \mathrm{u} {}^{\prime\prime}\!</math>
 
|-
 
|-
−
| '''"u"''' || '''"B"'''
+
| <math>{}^{\backprime\backprime} \mathrm{u} {}^{\prime\prime}\!</math>
 +
| <math>{}^{\backprime\backprime} \mathrm{B} {}^{\prime\prime}\!</math>
 
|-
 
|-
−
| '''"u"''' || '''"u"'''
+
| <math>{}^{\backprime\backprime} \mathrm{u} {}^{\prime\prime}\!</math>
 +
| <math>{}^{\backprime\backprime} \mathrm{u} {}^{\prime\prime}\!</math>
 
|}
 
|}
 
|}
 
|}
 +
 
<br>
 
<br>
  
 
{| align="center" style="width:90%"
 
{| align="center" style="width:90%"
 
|
 
|
−
{| border="1" cellpadding="8" cellspacing="0" style="background:lightcyan; font-weight:bold; text-align:center; width:90%"
+
{| align="center" border="1" cellpadding="8" cellspacing="0" style="text-align:center; width:90%"
−
|+ proj<sub>''XY''</sub>('''L'''<sub>B</sub>)
+
|+ style="height:30px" | <math>\mathrm{proj}_{XY}(L_\mathrm{B})\!</math>
−
|- style="background:paleturquoise"
+
|- style="height:40px; background:ghostwhite"
−
! style="width:50%" | Object
+
| width="50%" | <math>\text{Object}\!</math>
−
! style="width:50%" | Sign
+
| width="50%" | <math>\text{Sign}\!</math>
 
|-
 
|-
−
| '''A''' || '''"A"'''
+
| <math>\mathrm{A}\!</math> || <math>{}^{\backprime\backprime} \mathrm{A} {}^{\prime\prime}\!</math>
 
|-
 
|-
−
| '''A''' || '''"u"'''
+
| <math>\mathrm{A}\!</math> || <math>{}^{\backprime\backprime} \mathrm{u} {}^{\prime\prime}\!</math>
 
|-
 
|-
−
| '''B''' || '''"B"'''
+
| <math>\mathrm{B}\!</math> || <math>{}^{\backprime\backprime} \mathrm{B} {}^{\prime\prime}\!</math>
 
|-
 
|-
−
| '''B''' || '''"i"'''
+
| <math>\mathrm{B}\!</math> || <math>{}^{\backprime\backprime} \mathrm{i} {}^{\prime\prime}\!</math>
 
|}
 
|}
 
|
 
|
−
{| border="1" cellpadding="8" cellspacing="0" style="background:lightcyan; font-weight:bold; text-align:center; width:90%"
+
{| align="center" border="1" cellpadding="8" cellspacing="0" style="text-align:center; width:90%"
−
|+ proj<sub>''XZ''</sub>('''L'''<sub>B</sub>)
+
|+ style="height:30px" | <math>\mathrm{proj}_{XZ}(L_\mathrm{B})\!</math>
−
|- style="background:paleturquoise"
+
|- style="height:40px; background:ghostwhite"
−
! style="width:50%" | Object
+
| width="50%" | <math>\text{Object}\!</math>
−
! style="width:50%" | Interpretant
+
| width="50%" | <math>\text{Interpretant}\!</math>
 
|-
 
|-
−
| '''A''' || '''"A"'''
+
| <math>\mathrm{A}\!</math> || <math>{}^{\backprime\backprime} \mathrm{A} {}^{\prime\prime}\!</math>
 
|-
 
|-
−
| '''A''' || '''"u"'''
+
| <math>\mathrm{A}\!</math> || <math>{}^{\backprime\backprime} \mathrm{u} {}^{\prime\prime}\!</math>
 
|-
 
|-
−
| '''B''' || '''"B"'''
+
| <math>\mathrm{B}\!</math> || <math>{}^{\backprime\backprime} \mathrm{B} {}^{\prime\prime}\!</math>
 
|-
 
|-
−
| '''B''' || '''"i"'''
+
| <math>\mathrm{B}\!</math> || <math>{}^{\backprime\backprime} \mathrm{i} {}^{\prime\prime}\!</math>
 
|}
 
|}
 
|
 
|
−
{| border="1" cellpadding="8" cellspacing="0" style="background:lightcyan; font-weight:bold; text-align:center; width:90%"
+
{| align="center" border="1" cellpadding="8" cellspacing="0" style="text-align:center; width:90%"
−
|+ proj<sub>''YZ''</sub>('''L'''<sub>B</sub>)
+
|+ style="height:30px" | <math>\mathrm{proj}_{YZ}(L_\mathrm{B})\!</math>
−
|- style="background:paleturquoise"
+
|- style="height:40px; background:ghostwhite"
−
! style="width:50%" | Sign
+
| width="50%" | <math>\text{Sign}\!</math>
−
! style="width:50%" | Interpretant
+
| width="50%" | <math>\text{Interpretant}\!</math>
 
|-
 
|-
−
| '''"A"''' || '''"A"'''
+
| <math>{}^{\backprime\backprime} \mathrm{A} {}^{\prime\prime}\!</math>
 +
| <math>{}^{\backprime\backprime} \mathrm{A} {}^{\prime\prime}\!</math>
 
|-
 
|-
−
| '''"A"''' || '''"u"'''
+
| <math>{}^{\backprime\backprime} \mathrm{A} {}^{\prime\prime}\!</math>
 +
| <math>{}^{\backprime\backprime} \mathrm{u} {}^{\prime\prime}\!</math>
 
|-
 
|-
−
| '''"u"''' || '''"A"'''
+
| <math>{}^{\backprime\backprime} \mathrm{u} {}^{\prime\prime}\!</math>
 +
| <math>{}^{\backprime\backprime} \mathrm{A} {}^{\prime\prime}\!</math>
 
|-
 
|-
−
| '''"u"''' || '''"u"'''
+
| <math>{}^{\backprime\backprime} \mathrm{u} {}^{\prime\prime}\!</math>
 +
| <math>{}^{\backprime\backprime} \mathrm{u} {}^{\prime\prime}\!</math>
 
|-
 
|-
−
| '''"B"''' || '''"B"'''
+
| <math>{}^{\backprime\backprime} \mathrm{B} {}^{\prime\prime}\!</math>
 +
| <math>{}^{\backprime\backprime} \mathrm{B} {}^{\prime\prime}\!</math>
 
|-
 
|-
−
| '''"B"''' || '''"i"'''
+
| <math>{}^{\backprime\backprime} \mathrm{B} {}^{\prime\prime}\!</math>
 +
| <math>{}^{\backprime\backprime} \mathrm{i} {}^{\prime\prime}\!</math>
 
|-
 
|-
−
| '''"i"''' || '''"B"'''
+
| <math>{}^{\backprime\backprime} \mathrm{i} {}^{\prime\prime}\!</math>
 +
| <math>{}^{\backprime\backprime} \mathrm{B} {}^{\prime\prime}\!</math>
 
|-
 
|-
−
| '''"i"''' || '''"i"'''
+
| <math>{}^{\backprime\backprime} \mathrm{i} {}^{\prime\prime}\!</math>
 +
| <math>{}^{\backprime\backprime} \mathrm{i} {}^{\prime\prime}\!</math>
 
|}
 
|}
 
|}
 
|}
 +
 
<br>
 
<br>
  
−
It is clear on inspection that the following three inequations hold:
+
It is clear on inspection that the following three inequalities hold:
  
−
{| align="center" cellpadding="4" style="text-align:center; width:90%"
+
{| align="center" cellpadding="8" style="text-align:left; width:90%"
−
| proj<sub>''XY''</sub>('''L'''<sub>A</sub>) &#8800; proj<sub>''XY''</sub>('''L'''<sub>B</sub>)
+
| <math>\mathrm{proj}_{XY}(L_\mathrm{A}) ~\ne~ \mathrm{proj}_{XY}(L_\mathrm{B})\!</math>
−
| proj<sub>''XZ''</sub>('''L'''<sub>A</sub>) &#8800; proj<sub>''XZ''</sub>('''L'''<sub>B</sub>)
+
| <math>\mathrm{proj}_{XZ}(L_\mathrm{A}) ~\ne~ \mathrm{proj}_{XZ}(L_\mathrm{B})\!</math>
−
| proj<sub>''YZ''</sub>('''L'''<sub>A</sub>) &#8800; proj<sub>''YZ''</sub>('''L'''<sub>B</sub>)
+
| <math>\mathrm{proj}_{YZ}(L_\mathrm{A}) ~\ne~ \mathrm{proj}_{YZ}(L_\mathrm{B})\!</math>
 
|}
 
|}
  
−
These inequations say that '''L'''<sub>A</sub> and '''L'''<sub>B</sub> can be distinguished from each other solely on the basis of their 2-adic projection data.  But this is not enough to say that either one of them is projectively reducible to their 2-adic projection data.  To say that a 3-adic relation is projectively reducible in that respect, one has to show that it can be distinguished from ''every'' other 3-adic relation on the basis of the 2-adic projection data alone.
+
These inequalities say that <math>L_\mathrm{A}\!</math> and <math>L_\mathrm{B}\!</math> can be distinguished from each other solely on the basis of their 2-adic projection data.  But this is not enough to say that either one of them is projectively reducible to their 2-adic projection data.  To say that a 3-adic relation is projectively reducible in that respect, one has to show that it can be distinguished from ''every'' other 3-adic relation on the basis of the 2-adic projection data alone.
  
−
In other words, to show that a 3-adic relation ''L'' on '''O''' × '''S''' × '''I''' is ''reducible'' or ''reconstructible'' in the 2-adic projective sense, it is necessary to show that no distinct ''L&#8242;'' on '''O''' × '''S''' × '''I'''
+
In other words, to show that a 3-adic relation <math>L\!</math> on <math>O \times S \times I\!</math> is ''reducible'' or ''reconstructible'' in the 2-adic projective sense, it is necessary to show that no distinct <math>L'\!</math> on <math>O \times S \times I\!</math> exists such that <math>L\!</math> and <math>L'\!</math> have the same set of projections.  Proving this takes a much more comprehensive or exhaustive investigation of the space of possible relations on <math>O \times S \times I\!</math> than looking merely at one or two relations at a time.
−
exists such that ''L'' and ''L&#8242;'' have the same set of projections.  Proving this takes a much more comprehensive or exhaustive investigation of the space of possible relations on '''O''' × '''S''' × '''I''' than looking merely at one or two relations at a time.
 
  
−
'''Fact.'''  As it happens, each of the relations '''L'''<sub>A</sub> and '''L'''<sub>B</sub> is uniquely determined by its 2-adic projections.  This can be seen by following the proof that is given below.
+
'''Fact.'''  As it happens, each of the relations <math>L_\mathrm{A}\!</math> and <math>L_\mathrm{B}\!</math> is uniquely determined by its 2-adic projections.  This can be seen by following the proof that is given below.
  
 
Before tackling the proof, however, it will speed things along to recall a few ideas and notations from other articles.
 
Before tackling the proof, however, it will speed things along to recall a few ideas and notations from other articles.
  
−
* If ''L'' is a relation over a set of domains that includes the domains ''U'' and ''V'', then the abbreviated notation ''L''<sub>''UV'' </sub> can be used for the projection proj<sub>''UV'' </sub>(''L'').
+
* If <math>L\!</math> is a relation over a set of domains that includes the domains <math>U\!</math> and <math>V,\!</math> then the abbreviated notation <math>L_{UV}\!</math> can be used for the projection <math>\mathrm{proj}_{UV}(L).\!</math>
  
−
* The operation of reversing a projection asks what elements of a bigger space project onto given elements of a smaller space.  The set of elements that project onto ''x'' under a given projection ''f'' is called the ''[[image (mathematics)|fiber]]'' of ''x'' under ''f'' and is written ''f''<sup>–1</sup>(''x'') or ''f''<sup>–1</sup>''x''.
+
* The operation of reversing a projection asks what elements of a bigger space project onto given elements of a smaller space.  The set of elements that project onto <math>x\!</math> under a given projection <math>f\!</math> is called the ''fiber'' of <math>x\!</math> under <math>f\!</math> and is written <math>f^{-1}(x)\!</math> or <math>f^{-1}x.\!</math>
  
−
* If ''X'' is a finite set, the ''cardinality'' of ''X'', written card(''X'') or |''X''|, means the number of elements in ''X''.
+
* If <math>X\!</math> is a finite set, the ''cardinality'' of <math>X,\!</math> written <math>\mathrm{card}(X)\!</math> or <math>|X|,\!</math> means the number of elements in <math>X.\!</math>
  
−
'''Proof.'''  Let ''L'' be either one of the relations '''L'''<sub>A</sub> or '''L'''<sub>B</sub>. Consider any coordinate position (''s'', ''i'') in the '''SI'''-plane '''S''' × '''I'''.  If (''s'', ''i'') is not in ''L''<sub>'''SI'''</sub> then there can be no element (''o'', ''s'', ''i'') in ''L'', therefore we may restrict our attention to positions (''s'', ''i'') in ''L''<sub>'''SI'''</sub>, knowing that there exist at least |''L''<sub>'''SI'''</sub>| = 8 elements in ''L'', and seeking only to determine what objects ''o'' exist such that (''o'', ''s'', ''i'') is an element in the ''fiber'' of (''s'', ''i'').  In other words, for what ''o'' in '''O''' is (''o'', ''s'', ''i'') in the fiber proj<sub>'''SI'''</sub><sup>–1</sup>(''s'', ''i'') ?  Now, the circumstance that ''L''<sub>'''OS'''</sub> has exactly one element (''o'', ''s'') for each coordinate ''s'' in '''S''' and that ''L''<sub>'''OI'''</sub> has exactly one element (''o'', ''i'') for each coordinate ''i'' in '''I''', plus the "coincidence" of it being the same ''o'' at any one choice for (''s'', ''i''), tells us that ''L'' has just the one element (''o'', ''s'', ''i'') over each point of '''S''' × '''I'''.  All together, this proves that both '''L'''<sub>A</sub> and '''L'''<sub>B</sub> are reducible in an informative sense to 3-tuples of 2-adic relations, that is, they are ''projectively 2-adically reducible''.
+
'''Proof.'''  Let <math>L\!</math> be either one of the relations <math>L_\mathrm{A}\!</math> or <math>L_\mathrm{B}.\!</math>  Consider any coordinate position <math>(s, i)\!</math> in the <math>SI\!</math>-plane <math>S \times I.\!</math> If <math>(s, i)\!</math> is not in <math>L_{SI}\!</math> then there can be no element <math>(o, s, i)\!</math> in <math>L,\!</math> therefore we may restrict our attention to positions <math>(s, i)\!</math> in <math>L_{SI},\!</math> knowing that there exist at least <math>|L_{SI}| = 8\!</math> elements in <math>L,\!</math> and seeking only to determine what objects <math>o\!</math> exist such that <math>(o, s, i)\!</math> is an element in the ''fiber'' of <math>(s, i).\!</math> In other words, for what <math>o\!</math> in <math>O\!</math> is <math>(o, s, i)\!</math> in the fiber <math>\mathrm{proj}_{SI}^{-1}(s, i)?\!</math> Now, the circumstance that <math>L_{OS}\!</math> has exactly one element <math>(o, s)\!</math> for each coordinate <math>s\!</math> in <math>S\!</math> and that <math>L_{OI}\!</math> has exactly one element <math>(o, i)\!</math> for each coordinate <math>i\!</math> in <math>I,\!</math> plus the &ldquo;coincidence&rdquo; of it being the same <math>o\!</math> at any one choice for <math>(s, i),\!</math> tells us that <math>L\!</math> has just the one element <math>(o, s, i)\!</math> over each point of <math>S \times I.\!</math> All together, this proves that both <math>L_\mathrm{A}\!</math> and <math>L_\mathrm{B}\!</math> are reducible in an informative sense to 3-tuples of 2-adic relations, that is, they are ''projectively 2-adically reducible''.
  
 
===Summary===
 
===Summary===
Line 382: Line 447:
 
* Some 3-adic relations are, and other 3-adic relations are not, reducible to, or reconstructible from, their 2-adic projection data.  In short, some 3-adic relations are projectively reducible and some 3-adic relations are projectively irreducible.
 
* Some 3-adic relations are, and other 3-adic relations are not, reducible to, or reconstructible from, their 2-adic projection data.  In short, some 3-adic relations are projectively reducible and some 3-adic relations are projectively irreducible.
  
−
==See also==
+
==Syllabus==
 +
 
 +
===Focal nodes===
 +
 
 +
* [[Inquiry Live]]
 +
* [[Logic Live]]
 +
 
 +
===Peer nodes===
 +
 
 +
* [http://intersci.ss.uci.edu/wiki/index.php/Relation_reduction Relation Reduction @ InterSciWiki]
 +
* [http://mywikibiz.com/Relation_reduction Relation Reduction @ MyWikiBiz]
 +
* [http://ref.subwiki.org/wiki/Relation_reduction Relation Reduction @ Subject Wikis]
 +
* [http://en.wikiversity.org/wiki/Relation_reduction Relation Reduction @ Wikiversity]
 +
* [http://beta.wikiversity.org/wiki/Relation_reduction Relation Reduction @ Wikiversity Beta]
 +
 
 +
===Logical operators===
 +
 
 +
{{col-begin}}
 +
{{col-break}}
 +
* [[Exclusive disjunction]]
 +
* [[Logical conjunction]]
 +
* [[Logical disjunction]]
 +
* [[Logical equality]]
 +
{{col-break}}
 +
* [[Logical implication]]
 +
* [[Logical NAND]]
 +
* [[Logical NNOR]]
 +
* [[Logical negation|Negation]]
 +
{{col-end}}
 +
 
 +
===Related topics===
 +
 
 +
{{col-begin}}
 +
{{col-break}}
 +
* [[Ampheck]]
 +
* [[Boolean domain]]
 +
* [[Boolean function]]
 +
* [[Boolean-valued function]]
 +
* [[Differential logic]]
 +
{{col-break}}
 +
* [[Logical graph]]
 +
* [[Minimal negation operator]]
 +
* [[Multigrade operator]]
 +
* [[Parametric operator]]
 +
* [[Peirce's law]]
 +
{{col-break}}
 +
* [[Propositional calculus]]
 +
* [[Sole sufficient operator]]
 +
* [[Truth table]]
 +
* [[Universe of discourse]]
 +
* [[Zeroth order logic]]
 +
{{col-end}}
 +
 
 +
===Relational concepts===
  
 
{{col-begin}}
 
{{col-begin}}
 
{{col-break}}
 
{{col-break}}
−
* [[Binary relation]]
+
* [[Continuous predicate]]
−
* [[Cartesian product]]
+
* [[Hypostatic abstraction]]
−
* [[Level set|Fiber, level set]]
+
* [[Logic of relatives]]
−
* [[Function (mathematics)|Function]]
+
* [[Logical matrix]]
−
* [[Image (mathematics)|Functional image]]
 
−
* [[Reconstruction conjecture|Graph reconstruction]]
 
 
{{col-break}}
 
{{col-break}}
−
* [[Projection (set theory)|Projection]]
 
 
* [[Relation (mathematics)|Relation]]
 
* [[Relation (mathematics)|Relation]]
 
* [[Relation composition]]
 
* [[Relation composition]]
 
* [[Relation construction]]
 
* [[Relation construction]]
−
* [[Tacit extension]]
+
* [[Relation reduction]]
 +
{{col-break}}
 +
* [[Relation theory]]
 +
* [[Relative term]]
 +
* [[Sign relation]]
 
* [[Triadic relation]]
 
* [[Triadic relation]]
 
{{col-end}}
 
{{col-end}}
  
 +
===Information, Inquiry===
 +
 +
{{col-begin}}
 +
{{col-break}}
 +
* [[Inquiry]]
 +
* [[Dynamics of inquiry]]
 +
{{col-break}}
 +
* [[Semeiotic]]
 +
* [[Logic of information]]
 +
{{col-break}}
 +
* [[Descriptive science]]
 +
* [[Normative science]]
 +
{{col-break}}
 +
* [[Pragmatic maxim]]
 +
* [[Truth theory]]
 +
{{col-end}}
 +
 +
===Related articles===
 +
 +
{{col-begin}}
 +
{{col-break}}
 +
* [http://intersci.ss.uci.edu/wiki/index.php/Cactus_Language Cactus Language]
 +
* [http://intersci.ss.uci.edu/wiki/index.php/Futures_Of_Logical_Graphs Futures Of Logical Graphs]
 +
* [http://intersci.ss.uci.edu/wiki/index.php/Propositional_Equation_Reasoning_Systems Propositional Equation Reasoning Systems]
 +
{{col-break}}
 +
* [http://intersci.ss.uci.edu/wiki/index.php/Differential_Logic_:_Introduction Differential Logic : Introduction]
 +
* [http://intersci.ss.uci.edu/wiki/index.php/Differential_Propositional_Calculus Differential Propositional Calculus]
 +
* [http://intersci.ss.uci.edu/wiki/index.php/Differential_Logic_and_Dynamic_Systems_2.0 Differential Logic and Dynamic Systems]
 +
{{col-break}}
 +
* [http://intersci.ss.uci.edu/wiki/index.php/Introduction_to_Inquiry_Driven_Systems Introduction to Inquiry Driven Systems]
 +
* [http://intersci.ss.uci.edu/wiki/index.php/Prospects_for_Inquiry_Driven_Systems Prospects for Inquiry Driven Systems]
 +
* [http://intersci.ss.uci.edu/wiki/index.php/Inquiry_Driven_Systems Inquiry Driven Systems : Inquiry Into Inquiry]
 +
{{col-end}}
 +
 +
==Document history==
 +
 +
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.
 +
 +
* [http://intersci.ss.uci.edu/wiki/index.php/Relation_reduction Relation Reduction], [http://intersci.ss.uci.edu/ InterSciWiki]
 +
* [http://mywikibiz.com/Relation_reduction Relation Reduction], [http://mywikibiz.com/ MyWikiBiz]
 +
* [http://semanticweb.org/wiki/Relation_reduction Relation Reduction], [http://semanticweb.org/ Semantic Web]
 +
* [http://ref.subwiki.org/wiki/Relation_reduction Relation Reduction], [http://ref.subwiki.org/ Subject Wikis]
 +
* [http://wikinfo.org/w/index.php/Relation_reduction Relation Reduction], [http://wikinfo.org/w/ Wikinfo]
 +
* [http://en.wikiversity.org/wiki/Relation_reduction Relation Reduction], [http://en.wikiversity.org/ Wikiversity]
 +
* [http://beta.wikiversity.org/wiki/Relation_reduction Relation Reduction], [http://beta.wikiversity.org/ Wikiversity Beta]
 +
* [http://en.wikipedia.org/w/index.php?title=Relation_reduction&oldid=39828834 Relation Reduction], [http://en.wikipedia.org/ Wikipedia]
 +
 +
[[Category:Charles Sanders Peirce]]
 +
[[Category:Combinatorics]]
 +
[[Category:Computer Science]]
 +
[[Category:Database Theory]]
 +
[[Category:Discrete Mathematics]]
 +
[[Category:Formal Sciences]]
 
[[Category:Inquiry]]
 
[[Category:Inquiry]]
−
[[Category:Peer Educational Resource]]
 
 
[[Category:Logic]]
 
[[Category:Logic]]
 
[[Category:Mathematics]]
 
[[Category:Mathematics]]
 +
[[Category:Relation Theory]]
 +
[[Category:Semiotics]]
 +
[[Category:Set Theory]]

Latest revision as of 03:32, 15 November 2015

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

In logic and mathematics, relation reduction and relational reducibility have to do with the extent to which a given relation is determined by a set of other relations, called the relation dataset. The relation under examination is called the reductandum. The relation dataset typically consists of a specified relation over sets of relations, called the reducer, the method of reduction, or the relational step, plus a set of other relations, called the reduciens or the relational base, each of which is properly simpler in a specified way than the relation under examination.

A question of relation reduction or relational reducibility is sometimes posed as a question of relation reconstruction or relational reconstructibility, since a useful way of stating the question is to ask whether the reductandum can be reconstructed from the reduciens.

A relation that is not uniquely determined by a particular relation dataset is said to be irreducible in just that respect. A relation that is not uniquely determined by any relation dataset in a particular class of relation datasets is said to be irreducible in respect of that class.

Discussion

The main thing that keeps the general problem of relational reducibility from being fully well-defined is that one would have to survey all of the conceivable ways of “getting new relations from old” in order to say precisely what is meant by the claim that the relation \(L\!\) is reducible to the set of relations \(\{ L_j : j \in J \}.\!\) This amounts to claiming one can be given a set of properly simpler relations \(L_j\!\) for values \(j\!\) in a given index set \(J\!\) and that this collection of data would suffice to fix the original relation \(L\!\) that one is seeking to analyze, determine, specify, or synthesize.

In practice, however, apposite discussion of a particular application typically settles on either one of two different notions of reducibility as capturing the pertinent issues, namely:

  1. Reduction under composition.
  2. Reduction under projections.

As it happens, there is an interesting relationship between these two notions of reducibility, the implications of which may be taken up partly in parallel with the discussion of the basic concepts.

Projective reducibility of relations

It is convenient to begin with the projective reduction of relations, partly because this type of reduction is simpler and more intuitive (in the visual sense), but also because a number of conceptual tools that are needed in any case arise quite naturally in the projective setting.

The work of intuiting how projections operate on multidimensional relations is often facilitated by keeping in mind the following sort of geometric image:

  • Picture a \(k\!\)-adic relation \(L\!\) as a body that resides in a \(k\!\)-dimensional space \(X.\!\) If the domains of the relation \(L\!\) are \(X_1, \ldots, X_k,\!\) then the extension of the relation \(L\!\) is a subset of the cartesian product \(X = X_1 \times \ldots \times X_k.\!\)

In this setting the interval \(K = [1, k] = \{ 1, \ldots, k \}\!\) is called the index set of the indexed family of sets \(X_1, \ldots, X_k.\!\)

For any subset \(F\!\) of the index set \(K,\!\) there is the corresponding subfamily of sets, \(\{ X_j : j \in F \},\!\) and there is the corresponding cartesian product over this subfamily, notated and defined as \(\textstyle X_F = \prod_{j \in F} X_j.\!\)

For any point \(x\!\) in \(X,\!\) the projection of \(x\!\) on the subspace \(X_F\!\) is notated as \(\mathrm{proj}_F (x).\!\)

More generally, for any relation \(L \subseteq X,\!\) the projection of \(L\!\) on the subspace \(X_F\!\) is written as \(\mathrm{proj}_F (L)\!\) or still more simply as \(\mathrm{proj}_F L.\!\)

The question of projective reduction for \(k\!\)-adic relations can be stated with moderate generality in the following way:

  • Given a set of \(k\!\)-place relations in the same space \(X\!\) and a set of projections from \(X\!\) to the associated subspaces, do the projections afford sufficient data to tell the different relations apart?

Projective reducibility of triadic relations

Main article : Triadic relation

By way of illustrating the different sorts of things that can occur in considering the projective reducibility of relations, it is convenient to reuse the four examples of 3-adic relations that are discussed in the main article on that subject.

Examples of projectively irreducible relations

The 3-adic relations \(L_0\!\) and \(L_1\!\) are shown in the next two Tables:


\(L_0 ~=~ \{ (x, y, z) \in \mathbb{B}^3 : x + y + z = 0 \}\!\)
\(X\!\) \(Y\!\) \(Z\!\)
\(0\!\) \(0\!\) \(0\!\)
\(0\!\) \(1\!\) \(1\!\)
\(1\!\) \(0\!\) \(1\!\)
\(1\!\) \(1\!\) \(0\!\)


\(L_1 ~=~ \{ (x, y, z) \in \mathbb{B}^3 : x + y + z = 1 \}\!\)
\(X\!\) \(Y\!\) \(Z\!\)
\(0\!\) \(0\!\) \(1\!\)
\(0\!\) \(1\!\) \(0\!\)
\(1\!\) \(0\!\) \(0\!\)
\(1\!\) \(1\!\) \(1\!\)


A 2-adic projection of a 3-adic relation \(L\!\) is the 2-adic relation that results from deleting one column of the table for \(L\!\) and then deleting all but one row of any resulting rows that happen to be identical in content. In other words, the multiplicity of any repeated row is ignored.

In the case of the above two relations, \({L_0, L_1 ~\subseteq~ X \times Y \times Z ~\cong~ \mathbb{B}^3},\!\) the 2-adic projections are indexed by the columns or domains that remain, as shown in the following Tables.


\(\mathrm{proj}_{XY} L_0\!\)
\(X\!\) \(Y\!\)
\(0\!\) \(0\!\)
\(0\!\) \(1\!\)
\(1\!\) \(0\!\)
\(1\!\) \(1\!\)
\(\mathrm{proj}_{XZ} L_0\!\)
\(X\!\) \(Z\!\)
\(0\!\) \(0\!\)
\(0\!\) \(1\!\)
\(1\!\) \(1\!\)
\(1\!\) \(0\!\)
\(\mathrm{proj}_{YZ} L_0\!\)
\(Y\!\) \(Z\!\)
\(0\!\) \(0\!\)
\(1\!\) \(1\!\)
\(0\!\) \(1\!\)
\(1\!\) \(0\!\)


\(\mathrm{proj}_{XY} L_1\!\)
\(X\!\) \(Y\!\)
\(0\!\) \(0\!\)
\(0\!\) \(1\!\)
\(1\!\) \(0\!\)
\(1\!\) \(1\!\)
\(\mathrm{proj}_{XZ} L_1\!\)
\(X\!\) \(Z\!\)
\(0\!\) \(1\!\)
\(0\!\) \(0\!\)
\(1\!\) \(0\!\)
\(1\!\) \(1\!\)
\(\mathrm{proj}_{YZ} L_1\!\)
\(Y\!\) \(Z\!\)
\(0\!\) \(1\!\)
\(1\!\) \(0\!\)
\(0\!\) \(0\!\)
\(1\!\) \(1\!\)


It is clear on inspection that the following three equations hold:

\(\mathrm{proj}_{XY}(L_0) ~=~ \mathrm{proj}_{XY}(L_1)~\!\) \(\mathrm{proj}_{XZ}(L_0) ~=~ \mathrm{proj}_{XZ}(L_1)~\!\) \(\mathrm{proj}_{YZ}(L_0) ~=~ \mathrm{proj}_{YZ}(L_1)~\!\)

These equations say that \(L_0\!\) and \(L_1\!\) cannot be distinguished from each other solely on the basis of their 2-adic projection data. In such a case, each relation is said to be irreducible with respect to 2-adic projections. Since reducibility with respect to 2-adic projections is the only interesting case where it concerns the reduction of 3-adic relations, it is customary to say more simply of such a relation that it is projectively irreducible, the 2-adic basis being understood. It is immediate from the definition that projectively irreducible relations always arise in non-trivial multiplets of mutually indiscernible relations.

Examples of projectively reducible relations

The 3-adic relations \(L_\mathrm{A}\!\) and \(L_\mathrm{B}\!\) are shown in the next two Tables:


\(L_\mathrm{A} ~=~ \text{Sign Relation of Interpreter A}\!\)
\(\text{Object}\!\) \(\text{Sign}\!\) \(\text{Interpretant}\!\)
\(\mathrm{A}\!\) \({}^{\backprime\backprime} \mathrm{A} {}^{\prime\prime}\!\) \({}^{\backprime\backprime} \mathrm{A} {}^{\prime\prime}\!\)
\(\mathrm{A}\!\) \({}^{\backprime\backprime} \mathrm{A} {}^{\prime\prime}\!\) \({}^{\backprime\backprime} \mathrm{i} {}^{\prime\prime}\!\)
\(\mathrm{A}\!\) \({}^{\backprime\backprime} \mathrm{i} {}^{\prime\prime}\!\) \({}^{\backprime\backprime} \mathrm{A} {}^{\prime\prime}\!\)
\(\mathrm{A}\!\) \({}^{\backprime\backprime} \mathrm{i} {}^{\prime\prime}\!\) \({}^{\backprime\backprime} \mathrm{i} {}^{\prime\prime}\!\)
\(\mathrm{B}\!\) \({}^{\backprime\backprime} \mathrm{B} {}^{\prime\prime}\!\) \({}^{\backprime\backprime} \mathrm{B} {}^{\prime\prime}\!\)
\(\mathrm{B}\!\) \({}^{\backprime\backprime} \mathrm{B} {}^{\prime\prime}\!\) \({}^{\backprime\backprime} \mathrm{u} {}^{\prime\prime}\!\)
\(\mathrm{B}\!\) \({}^{\backprime\backprime} \mathrm{u} {}^{\prime\prime}\!\) \({}^{\backprime\backprime} \mathrm{B} {}^{\prime\prime}\!\)
\(\mathrm{B}\!\) \({}^{\backprime\backprime} \mathrm{u} {}^{\prime\prime}\!\) \({}^{\backprime\backprime} \mathrm{u} {}^{\prime\prime}\!\)


\(L_\mathrm{B} ~=~ \text{Sign Relation of Interpreter B}\!\)
\(\text{Object}\!\) \(\text{Sign}\!\) \(\text{Interpretant}\!\)
\(\mathrm{A}\!\) \({}^{\backprime\backprime} \mathrm{A} {}^{\prime\prime}\!\) \({}^{\backprime\backprime} \mathrm{A} {}^{\prime\prime}\!\)
\(\mathrm{A}\!\) \({}^{\backprime\backprime} \mathrm{A} {}^{\prime\prime}\!\) \({}^{\backprime\backprime} \mathrm{u} {}^{\prime\prime}\!\)
\(\mathrm{A}\!\) \({}^{\backprime\backprime} \mathrm{u} {}^{\prime\prime}\!\) \({}^{\backprime\backprime} \mathrm{A} {}^{\prime\prime}\!\)
\(\mathrm{A}\!\) \({}^{\backprime\backprime} \mathrm{u} {}^{\prime\prime}\!\) \({}^{\backprime\backprime} \mathrm{u} {}^{\prime\prime}\!\)
\(\mathrm{B}\!\) \({}^{\backprime\backprime} \mathrm{B} {}^{\prime\prime}\!\) \({}^{\backprime\backprime} \mathrm{B} {}^{\prime\prime}\!\)
\(\mathrm{B}\!\) \({}^{\backprime\backprime} \mathrm{B} {}^{\prime\prime}\!\) \({}^{\backprime\backprime} \mathrm{i} {}^{\prime\prime}\!\)
\(\mathrm{B}\!\) \({}^{\backprime\backprime} \mathrm{i} {}^{\prime\prime}\!\) \({}^{\backprime\backprime} \mathrm{B} {}^{\prime\prime}\!\)
\(\mathrm{B}\!\) \({}^{\backprime\backprime} \mathrm{i} {}^{\prime\prime}\!\) \({}^{\backprime\backprime} \mathrm{i} {}^{\prime\prime}\!\)


In the case of the two sign relations, \(L_\mathrm{A}, L_\mathrm{B} ~\subseteq~ X \times Y \times Z ~\cong~ O \times S \times I,\!\) the 2-adic projections are indexed by the columns or domains that remain, as shown in the following Tables.


\(\mathrm{proj}_{XY}(L_\mathrm{A})\!\)
\(\text{Object}\!\) \(\text{Sign}\!\)
\(\mathrm{A}\!\) \({}^{\backprime\backprime} \mathrm{A} {}^{\prime\prime}\!\)
\(\mathrm{A}\!\) \({}^{\backprime\backprime} \mathrm{i} {}^{\prime\prime}\!\)
\(\mathrm{B}\!\) \({}^{\backprime\backprime} \mathrm{B} {}^{\prime\prime}\!\)
\(\mathrm{B}\!\) \({}^{\backprime\backprime} \mathrm{u} {}^{\prime\prime}\!\)
\(\mathrm{proj}_{XZ}(L_\mathrm{A})\!\)
\(\text{Object}\!\) \(\text{Interpretant}\!\)
\(\mathrm{A}\!\) \({}^{\backprime\backprime} \mathrm{A} {}^{\prime\prime}\!\)
\(\mathrm{A}\!\) \({}^{\backprime\backprime} \mathrm{i} {}^{\prime\prime}\!\)
\(\mathrm{B}\!\) \({}^{\backprime\backprime} \mathrm{B} {}^{\prime\prime}\!\)
\(\mathrm{B}\!\) \({}^{\backprime\backprime} \mathrm{u} {}^{\prime\prime}\!\)
\(\mathrm{proj}_{YZ}(L_\mathrm{A})\!\)
\(\text{Sign}\!\) \(\text{Interpretant}\!\)
\({}^{\backprime\backprime} \mathrm{A} {}^{\prime\prime}\!\) \({}^{\backprime\backprime} \mathrm{A} {}^{\prime\prime}\!\)
\({}^{\backprime\backprime} \mathrm{A} {}^{\prime\prime}\!\) \({}^{\backprime\backprime} \mathrm{i} {}^{\prime\prime}\!\)
\({}^{\backprime\backprime} \mathrm{i} {}^{\prime\prime}\!\) \({}^{\backprime\backprime} \mathrm{A} {}^{\prime\prime}\!\)
\({}^{\backprime\backprime} \mathrm{i} {}^{\prime\prime}\!\) \({}^{\backprime\backprime} \mathrm{i} {}^{\prime\prime}\!\)
\({}^{\backprime\backprime} \mathrm{B} {}^{\prime\prime}\!\) \({}^{\backprime\backprime} \mathrm{B} {}^{\prime\prime}\!\)
\({}^{\backprime\backprime} \mathrm{B} {}^{\prime\prime}\!\) \({}^{\backprime\backprime} \mathrm{u} {}^{\prime\prime}\!\)
\({}^{\backprime\backprime} \mathrm{u} {}^{\prime\prime}\!\) \({}^{\backprime\backprime} \mathrm{B} {}^{\prime\prime}\!\)
\({}^{\backprime\backprime} \mathrm{u} {}^{\prime\prime}\!\) \({}^{\backprime\backprime} \mathrm{u} {}^{\prime\prime}\!\)


\(\mathrm{proj}_{XY}(L_\mathrm{B})\!\)
\(\text{Object}\!\) \(\text{Sign}\!\)
\(\mathrm{A}\!\) \({}^{\backprime\backprime} \mathrm{A} {}^{\prime\prime}\!\)
\(\mathrm{A}\!\) \({}^{\backprime\backprime} \mathrm{u} {}^{\prime\prime}\!\)
\(\mathrm{B}\!\) \({}^{\backprime\backprime} \mathrm{B} {}^{\prime\prime}\!\)
\(\mathrm{B}\!\) \({}^{\backprime\backprime} \mathrm{i} {}^{\prime\prime}\!\)
\(\mathrm{proj}_{XZ}(L_\mathrm{B})\!\)
\(\text{Object}\!\) \(\text{Interpretant}\!\)
\(\mathrm{A}\!\) \({}^{\backprime\backprime} \mathrm{A} {}^{\prime\prime}\!\)
\(\mathrm{A}\!\) \({}^{\backprime\backprime} \mathrm{u} {}^{\prime\prime}\!\)
\(\mathrm{B}\!\) \({}^{\backprime\backprime} \mathrm{B} {}^{\prime\prime}\!\)
\(\mathrm{B}\!\) \({}^{\backprime\backprime} \mathrm{i} {}^{\prime\prime}\!\)
\(\mathrm{proj}_{YZ}(L_\mathrm{B})\!\)
\(\text{Sign}\!\) \(\text{Interpretant}\!\)
\({}^{\backprime\backprime} \mathrm{A} {}^{\prime\prime}\!\) \({}^{\backprime\backprime} \mathrm{A} {}^{\prime\prime}\!\)
\({}^{\backprime\backprime} \mathrm{A} {}^{\prime\prime}\!\) \({}^{\backprime\backprime} \mathrm{u} {}^{\prime\prime}\!\)
\({}^{\backprime\backprime} \mathrm{u} {}^{\prime\prime}\!\) \({}^{\backprime\backprime} \mathrm{A} {}^{\prime\prime}\!\)
\({}^{\backprime\backprime} \mathrm{u} {}^{\prime\prime}\!\) \({}^{\backprime\backprime} \mathrm{u} {}^{\prime\prime}\!\)
\({}^{\backprime\backprime} \mathrm{B} {}^{\prime\prime}\!\) \({}^{\backprime\backprime} \mathrm{B} {}^{\prime\prime}\!\)
\({}^{\backprime\backprime} \mathrm{B} {}^{\prime\prime}\!\) \({}^{\backprime\backprime} \mathrm{i} {}^{\prime\prime}\!\)
\({}^{\backprime\backprime} \mathrm{i} {}^{\prime\prime}\!\) \({}^{\backprime\backprime} \mathrm{B} {}^{\prime\prime}\!\)
\({}^{\backprime\backprime} \mathrm{i} {}^{\prime\prime}\!\) \({}^{\backprime\backprime} \mathrm{i} {}^{\prime\prime}\!\)


It is clear on inspection that the following three inequalities hold:

\(\mathrm{proj}_{XY}(L_\mathrm{A}) ~\ne~ \mathrm{proj}_{XY}(L_\mathrm{B})\!\) \(\mathrm{proj}_{XZ}(L_\mathrm{A}) ~\ne~ \mathrm{proj}_{XZ}(L_\mathrm{B})\!\) \(\mathrm{proj}_{YZ}(L_\mathrm{A}) ~\ne~ \mathrm{proj}_{YZ}(L_\mathrm{B})\!\)

These inequalities say that \(L_\mathrm{A}\!\) and \(L_\mathrm{B}\!\) can be distinguished from each other solely on the basis of their 2-adic projection data. But this is not enough to say that either one of them is projectively reducible to their 2-adic projection data. To say that a 3-adic relation is projectively reducible in that respect, one has to show that it can be distinguished from every other 3-adic relation on the basis of the 2-adic projection data alone.

In other words, to show that a 3-adic relation \(L\!\) on \(O \times S \times I\!\) is reducible or reconstructible in the 2-adic projective sense, it is necessary to show that no distinct \(L'\!\) on \(O \times S \times I\!\) exists such that \(L\!\) and \(L'\!\) have the same set of projections. Proving this takes a much more comprehensive or exhaustive investigation of the space of possible relations on \(O \times S \times I\!\) than looking merely at one or two relations at a time.

Fact. As it happens, each of the relations \(L_\mathrm{A}\!\) and \(L_\mathrm{B}\!\) is uniquely determined by its 2-adic projections. This can be seen by following the proof that is given below.

Before tackling the proof, however, it will speed things along to recall a few ideas and notations from other articles.

  • If \(L\!\) is a relation over a set of domains that includes the domains \(U\!\) and \(V,\!\) then the abbreviated notation \(L_{UV}\!\) can be used for the projection \(\mathrm{proj}_{UV}(L).\!\)
  • The operation of reversing a projection asks what elements of a bigger space project onto given elements of a smaller space. The set of elements that project onto \(x\!\) under a given projection \(f\!\) is called the fiber of \(x\!\) under \(f\!\) and is written \(f^{-1}(x)\!\) or \(f^{-1}x.\!\)
  • If \(X\!\) is a finite set, the cardinality of \(X,\!\) written \(\mathrm{card}(X)\!\) or \(|X|,\!\) means the number of elements in \(X.\!\)

Proof. Let \(L\!\) be either one of the relations \(L_\mathrm{A}\!\) or \(L_\mathrm{B}.\!\) Consider any coordinate position \((s, i)\!\) in the \(SI\!\)-plane \(S \times I.\!\) If \((s, i)\!\) is not in \(L_{SI}\!\) then there can be no element \((o, s, i)\!\) in \(L,\!\) therefore we may restrict our attention to positions \((s, i)\!\) in \(L_{SI},\!\) knowing that there exist at least \(|L_{SI}| = 8\!\) elements in \(L,\!\) and seeking only to determine what objects \(o\!\) exist such that \((o, s, i)\!\) is an element in the fiber of \((s, i).\!\) In other words, for what \(o\!\) in \(O\!\) is \((o, s, i)\!\) in the fiber \(\mathrm{proj}_{SI}^{-1}(s, i)?\!\) Now, the circumstance that \(L_{OS}\!\) has exactly one element \((o, s)\!\) for each coordinate \(s\!\) in \(S\!\) and that \(L_{OI}\!\) has exactly one element \((o, i)\!\) for each coordinate \(i\!\) in \(I,\!\) plus the “coincidence” of it being the same \(o\!\) at any one choice for \((s, i),\!\) tells us that \(L\!\) has just the one element \((o, s, i)\!\) over each point of \(S \times I.\!\) All together, this proves that both \(L_\mathrm{A}\!\) and \(L_\mathrm{B}\!\) are reducible in an informative sense to 3-tuples of 2-adic relations, that is, they are projectively 2-adically reducible.

Summary

The projective analysis of 3-adic relations, illustrated by means of concrete examples, has been pursued just far enough at this point to state this clearly demonstrated result:

  • Some 3-adic relations are, and other 3-adic relations are not, reducible to, or reconstructible from, their 2-adic projection data. In short, some 3-adic relations are projectively reducible and some 3-adic relations are projectively irreducible.

Syllabus

Focal nodes

Peer nodes

Logical operators

Template:Col-breakTemplate:Col-breakTemplate:Col-end

Related topics

Template:Col-breakTemplate:Col-breakTemplate:Col-breakTemplate:Col-end

Relational concepts

Template:Col-breakTemplate:Col-breakTemplate:Col-breakTemplate:Col-end

Information, Inquiry

Template:Col-breakTemplate:Col-breakTemplate:Col-breakTemplate:Col-breakTemplate:Col-end

Related articles

Template:Col-breakTemplate:Col-breakTemplate:Col-breakTemplate:Col-end

Document history

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.

Retrieved from "https://mywikibiz.com/index.php?title=Relation_reduction&oldid=466886"