Relation theory

&#9758; This page belongs to resource collections on Logic and Inquiry.

Relation theory, or the theory of relations, treats the subject matter of relations in its combinatorial aspect, as distinguished from, though related to, its more properly logical study on one side and its more generally mathematical study on another.

A relation, as conceived in the combinatorial theory of relations, is a mathematical object that in general can have a very complex type, the complexity of which is best approached in several stages, as indicated next.

In order to approach the combinatorial definition of a relation, it helps to introduce a few preliminary notions that can serve as stepping stones to the general idea.

A relation in mathematics is defined as an object that has its existence as such within a definite context or setting. It is literally the case that to change this setting is to change the relation that is being defined. The particular type of context that is needed here is formalized as a collection of elements from which are chosen the elements of the relation in question. This larger collection of elementary relations or tuples is constructed by means of the set-theoretic product commonly known as the cartesian product.

Preliminaries
A relation $$L\!$$ is defined by specifying two mathematical objects as its constituent parts:

In the special case of a finitary relation, for concreteness a $$k\!$$-place relation, the concepts of figure and ground are defined as follows:

Strictly speaking, then, the relation $$L\!$$ is an ordered pair of mathematical objects, $$L = (\operatorname{figure}(L), \operatorname{ground}(L)),$$ but it is customary in loose speech to use the single name $$L\!$$ in a systematically equivocal fashion, taking it to denote either the pair $$L = (\operatorname{figure}(L), \operatorname{ground}(L))$$ or the figure $$\operatorname{figure}(L).$$ There is usually no confusion about this so long as the ground of the relation can be gathered from context.

Definition
The formal definition of a finite arity relation, specifically, a k-ary relation can now be stated.


 * Definition. A k-ary relation L over the nonempty sets X1, …, Xk is a (1+k)-tuple L = (F(L), X1, …, Xk) where F(L) is a subset of the cartesian product X1 &times; … &times; Xk.  If all of the Xj for j = 1 to k are the same set X, then L is more simply called a k-ary relation over X.  The set F(L) is called the figure of L and, provided that the sequence of sets X1, …, Xk is fixed throughout a given discussion or is otherwise determinate in context, one may regard the relation L as being determined by its figure F(L).

The formal definition simply repeats more concisely what was said above, merely unwrapping the conceptual packaging of the relation's ground to define the relation in 1 + k parts, as L = (F(X), X1, …, Xk), rather than just the two, as L = (F(L), G(L)).

A k-ary predicate is a boolean-valued function on k variables.

Local incidence properties
A local incidence property (LIP) of a relation L is a property that depends in turn on the properties of special subsets of L that are known as its local flags. The local flags of a relation are defined in the following way:

Let L be a k-place relation L &sube; X1 × … × Xk.

Select a relational domain Xj and one of its elements x. Then Lx.j is a subset of L that is referred to as the flag of L with x at j, or the x.j-flag of L, an object which has the following definition:


 * Lx.j = { (x1, …, xj, …, xk) &isin; L : xj = x }.

Any property C of the local flag Lx.j &sube; L is said to be a local incidence property of L with respect to the locus x at j.

A k-adic relation L &sube; X1 &times; … &times; Xk is said to be C-regular at j if and only if every flag of L with x at j has the property C, where x is taken to vary over the theme of the fixed domain Xj.

Expressed in symbols, L is C-regular at j if and only if C(Lx.j) is true for all x in Xj.

Numerical incidence properties
A numerical incidence property (NIP) of a relation is a local incidence property that depends on the cardinalities of its local flags.

For example, L is said to be c-regular at j if and only if the cardinality of the local flag Lx.j is c for all x in Xj, or, to write it in symbols, if and only if |Lx.j| = c for all x in Xj.

In a similar fashion, one can define the NIPs (< c)-regular at j, (> c)-regular at j, and so on. For ease of reference, a few of these definitions are recorded here:

The definition of a local flag can be broadened from a point x in Xj to a subset M of Xj, arriving at the definition of a regional flag in the following way:

Suppose that L &sube; X1 &times; … &times; Xk, and choose a subset M &sube; Xj. Then LM.j is a subset of L that is said to be the flag of L with M at j, or the M.j-flag of L, an object which has the following  definition:

Returning to 2-adic relations, it is useful to describe some familiar classes of objects in terms of their local and their numerical incidence properties. Let L &sube; S &times; T be an arbitrary 2-adic relation. The following properties of L can be defined:

If L &sube; S × T is tubular at S, then L is called a partial function or a prefunction from S to T, sometimes indicated by giving L an alternate name, say, "p", and writing L = p : S $$\rightharpoonup$$ T.

Just by way of formalizing the definition:

If L is a prefunction p : S $$\rightharpoonup$$ T that happens to be total at S, then L is called a function from S to T, indicated by writing L = f : S &rarr; T. To say that a relation L &sube; S &times; T is totally tubular at S is to say that it is 1-regular at S. Thus, we may formalize the following definition:

In the case of a function f : S &rarr; T, one has the following additional definitions:

Variations
Because the concept of a relation has been developed quite literally from the beginnings of logic and mathematics, and because it has incorporated contributions from a diversity of thinkers from many different times and intellectual climates, there is a wide variety of terminology that the reader may run across in connection with the subject.

One dimension of variation is reflected in the names that are given to k-place relations, with some writers using medadic, monadic, dyadic, triadic, k-adic where other writers use nullary, unary, binary, ternary, k-ary.

One finds a relation on a finite number of domains described as either a finitary relation or a polyadic relation. If the number of domains is finite, say equal to k, then the parameter k may be referred to as the arity, the adicity, or the dimension of the relation. In these cases, the relation may be described as a k-ary relation, a k-adic relation, or a k-dimensional relation, respectively.

A more conceptual than nominal variation depends on whether one uses terms like 'predicate', 'relation', and even 'term' to refer to the formal object proper or else to the allied syntactic items that are used to denote them. Compounded with this variation is still another, frequently associated with philosophical differences over the status in reality accorded formal objects. Among those who speak of numbers, functions, properties, relations, and sets as being real, that is to say, as having objective properties, there are divergences as to whether some things are more real than others, especially whether particulars or properties are equally real or else one derivative of the other. Historically speaking, just about every combination of modalities has been used by one school of thought or another, but it suffices here merely to indicate how the options are generated.

Examples

 * See the articles on relations, relation composition, relation reduction, sign relations, and triadic relations for concrete examples of relations.

Many relations of the greatest interest in mathematics are triadic relations, but this fact is somewhat disguised by the circumstance that many of them are referred to as binary operations, and because the most familiar of these have very specific properties that are dictated by their axioms. This makes it practical to study these operations for quite some time by focusing on their dyadic aspects before being forced to consider their proper characters as triadic relations.

Focal nodes

 * Inquiry Live


 * Logic Live

Peer nodes

 * Relation Theory @ MyWikiBiz
 * Relation Theory @ MathWeb Wiki
 * Relation Theory @ NetKnowledge
 * Relation Theory @ OER Commons


 * Relation Theory @ P2P Foundation
 * Relation Theory @ SemanticWeb
 * Relation Theory @ Subject Wikis
 * Relation Theory @ Wikiversity Beta

Logical operators

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


 * Logical implication
 * Logical NAND
 * Logical NNOR
 * Negation

Related topics

 * 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

 * 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

 * Inquiry
 * Dynamics of inquiry


 * Semeiotic
 * Logic of information


 * Descriptive science
 * Normative science


 * Pragmatic maxim
 * Truth theory

Related articles

 * Jon Awbrey, &ldquo;Semiotic Information&rdquo;


 * Jon Awbrey, &ldquo;Introduction To Inquiry Driven Systems&rdquo;


 * Jon Awbrey, &ldquo;Prospects For Inquiry Driven Systems&rdquo;


 * Jon Awbrey, &ldquo;Inquiry Driven Systems : Inquiry Into Inquiry&rdquo;


 * Jon Awbrey, &ldquo;Propositional Equation Reasoning Systems&rdquo;


 * Jon Awbrey, &ldquo;Differential Logic : Introduction&rdquo;


 * Jon Awbrey, &ldquo;Differential Propositional Calculus&rdquo;


 * Jon Awbrey, &ldquo;Differential Logic and Dynamic Systems&rdquo;

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.


 * Relation Theory, MyWikiBiz
 * Relation Theory, MathWeb Wiki
 * Relation Theory, NetKnowledge
 * Relation Theory, OER Commons


 * Relation Theory, P2P Foundation
 * Relation Theory, Semantic Web
 * Relation Theory, PlanetMath
 * Relation Theory, PlanetPhysics


 * Relation Theory, GetWiki
 * Relation Theory, Wikinfo
 * Relation Theory, Textop Wiki
 * Relation Theory, Wikipedia