Relation reduction
From Wikipedia, the free encyclopedia
In logic and mathematics, relation reduction and relational reducibility have to do with the extent to which a given relation is determined by an indexed family or a sequence 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 specified set of other relations, simpler in some measure than the reductandum, called the reduciens or the relational base.
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.
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.
Contents |
[edit] 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 {Lj : j in J }. This is tantamount to claiming that if one is given a set of "simpler" relations Lj , for indices j in some set J, that this collection of data would somehow or other fix the original relation L that one is seeking to analyze, to determine, to specify, or to 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:
- Reduction under composition.
- 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.
[edit] 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 X1, …, Xk , then the extension of the relation L is a subset of the cartesian product X = X1 × … × Xk .
In this setting, the interval K = [1, k] = {1, ;…, k} is called the index set of the indexed family of sets X1, …, Xk .
For any subset F of the index set K, there is the corresponding subfamily of sets, {Xj : j ∈ F }, and there is the corresponding cartesian product over this subfamily, notated and defined as XF = 
j ∈ F Xj.
For any point x in X, the projection of x on the subspace XF is notated as projF(x).
More generally, for any relation L ⊆ X, the projection of L on the subspace XF is written as projF(L), or still more simply, as projF 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?
[edit] Projective reducibility of triadic relations
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.
[edit] Examples of projectively irreducible relations
The 3-adic relations L0 and L1 are shown in the next two Tables:
| X | Y | Z |
|---|---|---|
| 0 | 0 | 0 |
| 0 | 1 | 1 |
| 1 | 0 | 1 |
| 1 | 1 | 0 |
| 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, L0, L1 ⊆ X × Y × Z ≈ B3, the 2-adic projections are indexed by the columns or domains that remain, as shown in the following Tables.
projXY(L0)
|
projXZ(L0)
|
projYZ(L0)
|
projXY(L1)
|
projXZ(L1)
|
projYZ(L1)
|
It is clear on inspection that the following three equations hold:
| projXY(L0) = projXY(L1) | projXZ(L0) = projXZ(L1) | projYZ(L0) = projYZ(L1) |
These equations say that L0 and L1 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.
[edit] Examples of projectively reducible relations
The 3-adic relations LA and LB are shown in the next two Tables:
| Object | Sign | Interpretant |
|---|---|---|
| A | "A" | "A" |
| A | "A" | "i" |
| A | "i" | "A" |
| A | "i" | "i" |
| B | "B" | "B" |
| B | "B" | "u" |
| B | "u" | "B" |
| B | "u" | "u" |
| Object | Sign | Interpretant |
|---|---|---|
| A | "A" | "A" |
| A | "A" | "u" |
| A | "u" | "A" |
| A | "u" | "u" |
| B | "B" | "B" |
| B | "B" | "i" |
| B | "i" | "B" |
| B | "i" | "i" |
In the case of the two sign relations, LA, LB ⊆ X × Y × Z ≈ O × S × I, the 2-adic projections are indexed by the columns or domains that remain, as shown in the following Tables.
projXY(LA)
|
projXZ(LA)
|
projYZ(LA)
|
projXY(LB)
|
projXZ(LB)
|
projYZ(LB)
|
It is clear on inspection that the following three inequations hold:
| projXY(LA) ≠ projXY(LB) | projXZ(LA) ≠ projXZ(LB) | projYZ(LA) ≠ projYZ(LB) |
These inequations say that LA and LB 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′ on O × S × 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 × S × I than looking merely at one or two relations at a time.
Fact. As it happens, each of the relations LA and LB 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 LUV can be used for the projection projUV (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–1x.
- If X is a finite set, the cardinality of X, written card(X) or |X|, means the number of elements in X.
Proof. Let L be either one of the relations LA or LB. Consider any coordinate position (s, i) in the SI-plane S × I. If (s, i) is not in LSI then there can be no element (o, s, i) in L, therefore we may restrict our attention to positions (s, i) in LSI, knowing that there exist at least |LSI| = 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 projSI–1(s, i) ? Now, the circumstance that LOS has exactly one element (o, s) for each coordinate s in S and that LOI 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 LA and LB are reducible in an informative sense to 3-tuples of 2-adic relations, that is, they are projectively 2-adically reducible.
[edit] 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.
