Relation (mathematics)

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

In mathematics, a finitary relation is defined by one of the formal definitions given below.

* The basic idea is to generalize the concept of a two-place relation, such as the relation of equality denoted by the sign " = {\displaystyle =\\!} " in a statement like  5 + 7 = 12 {\displaystyle 5+7=12\\!} or the relation of order denoted by the sign " < {\displaystyle {<}\\!} " in a statement like  5 < 12. {\displaystyle 5<12.\\!} Relations that involve two places or roles are called binary relations by some and dyadic relations by others, the latter being historically prior but also useful when necessary to avoid confusion with binary (base 2) numerals.

* The concept of a two-place relation is generalized by considering relations with increasing but still finite numbers of places or roles. These are called finite-place or finitary relations. A finitary relation involving  k {\displaystyle k\\!} places is variously called a  k {\displaystyle k\\!} -ary,  k {\displaystyle k\\!} -adic, or  k {\displaystyle k\\!} -dimensional relation. The number  k {\displaystyle k\\!} is then called the arity, the adicity, or the dimension of the relation, respectively.

## Informal introduction

[edit | edit source]

The definition of relation given in the next section formally captures a concept that is actually quite familiar from everyday life. For example, consider the relationship, involving three roles that people might play, expressed in a statement of the form  X suspects that Y likes Z . {\displaystyle X~{\text{suspects that}}~Y~{\text{likes}}~Z.\\!} The facts of a concrete situation could be organized in the form of a Table like the one below:

Relation S : X suspects that Y likes Z {\displaystyle {\text{Relation}}~S~:~X~{\text{suspects that}}~Y~{\text{likes}}~Z\\!} Person X {\displaystyle {\text{Person}}~X\\!} |  Person Y {\displaystyle {\text{Person}}~Y\\!} |  Person Z {\displaystyle {\text{Person}}~Z\\!}

|
|

Alice {\displaystyle {\text{Alice}}\\!} |  Bob {\displaystyle {\text{Bob}}\\!} |  Denise {\displaystyle {\text{Denise}}\\!}
Charles {\displaystyle {\text{Charles}}\\!} |  Alice {\displaystyle {\text{Alice}}\\!} |  Bob {\displaystyle {\text{Bob}}\\!}
Charles {\displaystyle {\text{Charles}}\\!} |  Charles {\displaystyle {\text{Charles}}\\!} |  Alice {\displaystyle {\text{Alice}}\\!}
Denise {\displaystyle {\text{Denise}}\\!} |  Denise {\displaystyle {\text{Denise}}\\!} |  Denise {\displaystyle {\text{Denise}}\\!}

Each row of the Table records a fact or makes an assertion of the form  X suspects that Y likes Z . {\displaystyle X~{\text{suspects that}}~Y~{\text{likes}}~Z.\\!} For instance, the first row says, in effect,  Alice suspects that Bob likes Denise. {\displaystyle {\text{Alice suspects that Bob likes Denise.}}\\!} The Table represents a relation  S {\displaystyle S\\!} over the set  P {\displaystyle P\\!} of people under discussion:

P = { Alice , Bob , Charles , Denise } {\displaystyle P~=~\\{{\text{Alice}},{\text{Bob}},{\text{Charles}},{\text{Denise}}\\}\\!}

The data of the Table are equivalent to the following set of ordered triples:

S = { (Alice, Bob, Denise) , (Charles, Alice, Bob) , (Charles, Charles, Alice) , (Denise, Denise, Denise) } {\displaystyle {\begin{smallmatrix}S&=&\\{&{\text{(Alice, Bob, Denise)}},&{\text{(Charles, Alice, Bob)}},&{\text{(Charles, Charles, Alice)}},&{\text{(Denise, Denise, Denise)}}&\\}\end{smallmatrix}}\\!}

By a slight overuse of notation, it is usual to write  S ( Alice , Bob , Denise ) {\displaystyle S({\text{Alice}},{\text{Bob}},{\text{Denise}})\\!} to say the same thing as the first row of the Table. The relation  S {\displaystyle S\\!} is a triadic or ternary relation, since there are three items involved in each row. The relation itself is a mathematical object, defined in terms of concepts from set theory, that carries all the information from the Table in one neat package.

The Table for relation  S {\displaystyle S\\!} is an extremely simple example of a relational database. The theoretical aspects of databases are the specialty of one branch of computer science, while their practical impacts have become all too familiar in our everyday lives. Computer scientists, logicians, and mathematicians, however, tend to see different things when they look at these concrete examples and samples of the more general concept of a relation.

For one thing, databases are designed to deal with empirical data, and experience is always finite, whereas mathematics is nothing if not concerned with infinity, at the very least, potential infinity. This difference in perspective brings up a number of ideas that are usefully introduced at this point, if by no means covered in depth.

## Example 1. Divisibility

[edit | edit source]

A more typical example of a two-place relation in mathematics is the relation of divisibility between two positive integers  n {\displaystyle n\\!} and  m {\displaystyle m\\!} that is expressed in statements like  ‵ ‵ n divides m ′ ′ {\displaystyle {}^{\backprime \backprime }n~{\text{divides}}~m{}^{\prime \prime }\\!} or  ‵ ‵ n goes into m ′ ′ . {\displaystyle {}^{\backprime \backprime }n~{\text{goes into}}~m{}^{\prime \prime }.\\!} This is a relation that comes up so often that a special symbol  ‵ ‵ | ′ ′ {\displaystyle {}^{\backprime \backprime }|{}^{\prime \prime }\\!} is reserved to express it, allowing one to write  ‵ ‵ n | m ′ ′ {\displaystyle {}^{\backprime \backprime }n|m{}^{\prime \prime }\\!} for  ‵ ‵ n divides m ′ ′ . {\displaystyle {}^{\backprime \backprime }n~{\text{divides}}~m{}^{\prime \prime }.\\!}

To express the binary relation of divisibility in terms of sets, we have the set  P {\displaystyle P\\!} of positive integers,  P = { 1 , 2 , 3 , … } , {\displaystyle P=\\{1,2,3,\ldots \\},\\!} and we have the binary relation  D {\displaystyle D\\!} on  P {\displaystyle P\\!} such that the ordered pair  ( n , m ) {\displaystyle (n,m)\\!} is in the relation  D {\displaystyle D\\!} just in case  n | m . {\displaystyle n|m.\\!} In other turns of phrase that are frequently used, one says that the number  n {\displaystyle n\\!} is related by  D {\displaystyle D\\!} to the number  m {\displaystyle m\\!} just in case  n {\displaystyle n\\!} is a factor of  m , {\displaystyle m,\\!} that is, just in case  n {\displaystyle n\\!} divides  m {\displaystyle m\\!} with no remainder. The relation  D , {\displaystyle D,\\!} regarded as a set of ordered pairs, consists of all pairs of numbers  ( n , m ) {\displaystyle (n,m)\\!} such that  n {\displaystyle n\\!} divides  m . {\displaystyle m.\\!}

For example,  2 {\displaystyle 2\\!} is a factor of  4 , {\displaystyle 4,\\!} and  6 {\displaystyle 6\\!} is a factor of  72 , {\displaystyle 72,\\!} which two facts can be written either as  2 | 4 {\displaystyle 2|4\\!} and  6 | 72 {\displaystyle 6|72\\!} or as  D ( 2 , 4 ) {\displaystyle D(2,4)\\!} and  D ( 6 , 72 ) . {\displaystyle D(6,72).\\!}

## Formal definitions

[edit | edit source]

There are two definitions of  k {\displaystyle k\\!} -place relations that are commonly encountered in mathematics. In order of simplicity, the first of these definitions is as follows:

Definition 1. A relation L {\displaystyle L\\!} over the sets  X 1 , … , X k {\displaystyle X_{1},\ldots ,X_{k}\\!} is a subset of their cartesian product, written  L ⊆ X 1 × … × X k . {\displaystyle L\subseteq X_{1}\times \ldots \times X_{k}.\\!} Under this definition, then, a  k {\displaystyle k\\!} -ary relation is simply a set of  k {\displaystyle k\\!} -tuples.

The second definition makes use of an idiom that is common in mathematics, saying that "such and such is an  n {\displaystyle n\\!} -tuple" to mean that the mathematical object being defined is determined by the specification of  n {\displaystyle n\\!} component mathematical objects. In the case of a relation  L {\displaystyle L\\!} over  k {\displaystyle k\\!} sets, there are  k + 1 {\displaystyle k+1\\!} things to specify, namely, the  k {\displaystyle k\\!} sets plus a subset of their cartesian product. In the idiom, this is expressed by saying that  L {\displaystyle L\\!} is a  ( k + 1 ) {\displaystyle (k+1)\\!} -tuple.

Definition 2. A relation L {\displaystyle L\\!} over the sets  X 1 , … , X k {\displaystyle X_{1},\ldots ,X_{k}\\!} is a  ( k + 1 ) {\displaystyle (k+1)\\!} -tuple  L = ( X 1 , … , X k , g r a p h ( L ) ) , {\displaystyle L=(X_{1},\ldots ,X_{k},\mathrm {graph} (L)),\\!} where  g r a p h ( L ) {\displaystyle \mathrm {graph} (L)\\!} is a subset of the cartesian product  X 1 × … × X k {\displaystyle X_{1}\times \ldots \times X_{k}~\\!} called the graph of  L . {\displaystyle L.\\!}

Elements of a relation are sometimes denoted by using boldface characters, for example, the constant element  a = ( a 1 , … , a k ) {\displaystyle \mathbf {a} =(a_{1},\ldots ,a_{k})\\!} or the variable element  x = ( x 1 , … , x k ) . {\displaystyle \mathbf {x} =(x_{1},\ldots ,x_{k}).\\!}

A statement of the form " a {\displaystyle \mathbf {a} \\!} is in the relation  L {\displaystyle L\\!} " is taken to mean that  a {\displaystyle \mathbf {a} \\!} is in  L {\displaystyle L\\!} under the first definition and that  a {\displaystyle \mathbf {a} \\!} is in  g r a p h ( L ) {\displaystyle \mathrm {graph} (L)\\!} under the second definition.

The following considerations apply under either definition:

* The sets  X j {\displaystyle X_{j}~\\!} for  j = 1 to k {\displaystyle j=1~{\text{to}}~k\\!} are called the domains of the relation. In the case of the first definition, the relation itself does not uniquely determine a given sequence of domains.

* If all the domains  X j {\displaystyle X_{j}~\\!} are the same set  X , {\displaystyle X,\\!} then  L {\displaystyle L\\!} is more simply referred to as a  k {\displaystyle k\\!} -ary relation over  X . {\displaystyle X.\\!}

* If any domain  X j {\displaystyle X_{j}~\\!} is empty then the cartesian product is empty and the only relation over such a sequence of domains is the empty relation  L = ∅ . {\displaystyle L=\varnothing .\\!} Most applications of the relation concept will set aside this trivial case and assume that all domains are nonempty.

If  L {\displaystyle L\\!} is a relation over the domains  X 1 , … , X k , {\displaystyle X_{1},\ldots ,X_{k},\\!} it is conventional to consider a sequence of terms called variables,  x 1 , … , x k , {\displaystyle x_{1},\ldots ,x_{k},\\!} that are said to range over the respective domains.

A boolean domain B {\displaystyle \mathbb {B} \\!} is a generic 2-element set, say,  B = { 0 , 1 } , {\displaystyle \mathbb {B} =\\{0,1\\},\\!} whose elements are interpreted as logical values, typically  0 = f a l s e {\displaystyle 0=\mathrm {false} \\!} and  1 = t r u e . {\displaystyle 1=\mathrm {true} .\\!}

The characteristic function of the relation  L , {\displaystyle L,\\!} written  f L {\displaystyle f_{L}\\!} or  χ ( L ) , {\displaystyle \chi (L),\\!} is the boolean-valued function f L : X 1 × … × X k -> B , {\displaystyle f_{L}:X_{1}\times \ldots \times X_{k}\to \mathbb {B} ,\\!} defined in such a way that  f L ( x ) = 1 {\displaystyle f_{L}(\mathbf {x} )=1\\!} just in case the  k {\displaystyle k\\!} -tuple  x = ( x 1 , … , x k ) {\displaystyle \mathbf {x} =(x_{1},\ldots ,x_{k})\\!} is in the relation  L . {\displaystyle L.\\!} The characteristic function of a relation may also be called its indicator function, especially in probabilistic and statistical contexts.

It is conventional in applied mathematics, computer science, and statistics to refer to a boolean-valued function like  f L {\displaystyle f_{L}\\!} as a  k {\displaystyle k\\!} -place predicate. From the more abstract viewpoints of formal logic and model theory, the relation  L {\displaystyle L\\!} is seen as constituting a logical model or a relational structure that serves as one of many possible interpretations of a corresponding  k {\displaystyle k\\!} -place predicate symbol, as that term is used in predicate calculus.

Due to the convergence of many traditions of study, there are wide variations in the language used to describe relations. The extensional approach presented in this article treats a relation as the set-theoretic extension of a relational concept or term. An alternative, intensional approach reserves the term relation to the corresponding logical entity, either the logical comprehension, which is the totality of intensions or abstract properties that all the elements of the extensional relation have in common, or else the symbols that are taken to denote those elements and intensions.

## Example 2. Coplanarity

[edit | edit source]

For lines  ℓ {\displaystyle \ell \\!} in three-dimensional space, there is a triadic relation picking out the triples of lines that are coplanar. This does not reduce to the dyadic relation of coplanarity between pairs of lines.

In other words, writing  P ( ℓ , m , n ) {\displaystyle P(\ell ,m,n)\\!} when the lines  ℓ , m , n {\displaystyle \ell ,m,n\\!} lie in a plane, and  Q ( ℓ , m ) {\displaystyle Q(\ell ,m)\\!} for the binary relation, it is not true that  Q ( ℓ , m ) , {\displaystyle Q(\ell ,m),\\!} Q ( m , n ) , {\displaystyle Q(m,n),\\!} and  Q ( n , ℓ ) {\displaystyle Q(n,\ell )\\!} together imply  P ( ℓ , m , n ) , {\displaystyle P(\ell ,m,n),\\!} although the converse is certainly true: any two of three coplanar lines are necessarily coplanar. There are two geometrical reasons for this.

In one case, for example taking the  x {\displaystyle x\\!} -axis,  y {\displaystyle y\\!} -axis, and  z {\displaystyle z\\!} -axis, the three lines are concurrent, that is, they intersect at a single point. In another case,  ℓ , m , n {\displaystyle \ell ,m,n\\!} can be three edges of an infinite triangular prism.

What is true is that if each pair of lines intersects, and the points of intersection are distinct, then pairwise coplanarity implies coplanarity of the triple.

## Remarks

[edit | edit source]

Relations are classified by the number of sets in the cartesian product, in other words, the number of places or terms in the relational expression:

L ( a ) {\displaystyle L(a)\\!} | Monadic or unary relation, in other words, a property or set

|

L ( a , b ) or a L b {\displaystyle L(a,b)~{\text{or}}~aLb\\!} | Dyadic or binary relation
L ( a , b , c ) {\displaystyle L(a,b,c)\\!} | Triadic or ternary relation
L ( a , b , c , d ) {\displaystyle L(a,b,c,d)\\!} | Tetradic or quaternary relation
L ( a , b , c , d , e ) {\displaystyle L(a,b,c,d,e)\\!} | Pentadic or quinary relation

Relations with more than five terms are usually referred to as  k {\displaystyle k\\!} -adic or  k {\displaystyle k\\!} -ary, for example, a 6-adic, 6-ary, or hexadic relation.

## References

[edit | edit source]

* Peirce, C.S. (1870), "Description of a Notation for the Logic of Relatives, Resulting from an Amplification of the Conceptions of Boole's Calculus of Logic", Memoirs of the American Academy of Arts and Sciences 9, 317-378, 1870. Reprinted, Collected Papers CP 3.45-149, Chronological Edition CE 2, 359-429.

* Ulam, S.M., and Bednarek, A.R. (1990), "On the Theory of Relational Structures and Schemata for Parallel Computation", 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.

## Bibliography

[edit | edit source]

* Bourbaki, N. (1994), Elements of the History of Mathematics, John Meldrum (trans.), Springer-Verlag, Berlin, Germany.

* Halmos, P.R. (1960), Naive Set Theory, D. Van Nostrand Company, Princeton, NJ.

* Lawvere, F.W., and Rosebrugh, R. (2003), Sets for Mathematics, Cambridge University Press, Cambridge, UK.

* Maddux, R.D. (2006), Relation Algebras, vol. 150 in Studies in Logic and the Foundations of Mathematics, Elsevier Science.

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

* Minsky, M.L., and Papert, S.A. (1969/1988), Perceptrons, An Introduction to Computational Geometry, MIT Press, Cambridge, MA, 1969. Expanded edition, 1988.

* Peirce, C.S. (1984), Writings of Charles S. Peirce : A Chronological Edition, Volume 2, 1867-1871, Peirce Edition Project (eds.), Indiana University Press, Bloomington, IN.

* Royce, J. (1961), The Principles of Logic, Philosophical Library, New York, NY.

* Tarski, A. (1956/1983), Logic, Semantics, Metamathematics, Papers from 1923 to 1938, J.H. Woodger (trans.), 1st edition, Oxford University Press, 1956. 2nd edition, J. Corcoran (ed.), Hackett Publishing, Indianapolis, IN, 1983.

* Ulam, S.M. (1990), 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.

* Venetus, P. (1984), Logica Parva, Translation of the 1472 Edition with Introduction and Notes, Alan R. Perreiah (trans.), Philosophia Verlag, Munich, Germany.

## Syllabus

[edit | edit source]

### Focal nodes

[edit | edit source]

* Inquiry Live
* Logic Live

### Peer nodes

[edit | edit source]

* Relation @ InterSciWiki
* Relation @ Subject Wikis
* Relation @ Wikiversity
* Relation @ 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, InterSciWiki
* Relation, Wikiversity
* Relation, Wikiversity Beta
* Relation, Wikipedia