Editing Finitary relation

{{short description|Property that assigns truth values to k-tuples of individuals}}

In [[mathematics]], a '''finitary relation''' over a sequence of sets {{nowrap|''X''<sub>1</sub>, ..., ''X''<sub>''n''</sub>}} is a [[subset]] of the [[Cartesian product]] {{nowrap|''X''<sub>1</sub> × ... × ''X''<sub>''n''</sub>}}; that is, it is a set of ''n''-tuples {{nowrap|(''x''<sub>1</sub>, ..., ''x''<sub>''n''</sub>)}}, each being a sequence of elements ''x''<sub>''i''</sub> in the corresponding ''X''<sub>''i''</sub>.{{sfn|ps=|Codd|1970}}<ref>{{Cite web|url=https://www.encyclopediaofmath.org/index.php/Relation|title=Relation – Encyclopedia of Mathematics|website=www.encyclopediaofmath.org|access-date=2019-12-12}}</ref><ref>{{Cite web|url=https://www.cs.odu.edu/~toida/nerzic/content/relation/definition/cp_gen/index.html|title=Definition of ''n''-ary Relation|website=cs.odu.edu|access-date=2019-12-12}}</ref> Typically, the relation describes a possible connection between the elements of an ''n''-tuple. For example, the relation "''x'' is divisible by ''y'' and ''z''" consists of the set of 3-tuples such that when substituted to ''x'', ''y'' and ''z'', respectively, make the sentence true.

The non-negative integer ''n'' that gives the number of "places" in the relation is called the ''[[arity]]'', ''adicity'' or ''degree'' of the relation. A relation with ''n'' "places" is variously called an '''''n''-ary relation''', an '''''n''-adic relation''' or a '''relation of degree ''n'''''. Relations with a finite number of places are called ''finitary relations'' (or simply ''relations'' if the context is clear). It is also possible to generalize the concept to ''infinitary relations'' with [[Sequence|infinite sequences]].{{sfn|ps=|Nivat|1981}}

== Definitions ==
{{Blockquote|When two objects, qualities, classes, or attributes, viewed together by the mind, are seen under some connexion, that connexion is called a relation.|[[Augustus De Morgan]]{{sfn|ps=|De Morgan|1966}}}}

; Definition : ''R'' is an ''n''-ary '''relation''' on sets {{nowrap|''X''<sub>1</sub>, ..., ''X''<sub>''n''</sub>}} is given by a subset of the Cartesian product {{nowrap|''X''<sub>1</sub> × ... × ''X''<sub>''n''</sub>}}.{{sfn|ps=|Codd|1970}}

Since the definition is predicated on the underlying sets {{nowrap|''X''<sub>1</sub>, ..., ''X''<sub>''n''</sub>}}, ''R'' may be more formally defined as the ({{nowrap|''n'' + 1}})-tuple {{nowrap|(''X''<sub>1</sub>, ..., ''X''<sub>''n''</sub>, ''G'')}}, where ''G'', called the ''graph'' of ''R'', is a subset of the Cartesian product {{nowrap|''X''<sub>1</sub> × ... × ''X''<sub>''n''</sub>}}.

As is often done in mathematics, the same symbol is used to refer to the mathematical object and an underlying set, so the statement {{nowrap|(''x''<sub>1</sub>, ..., ''x''<sub>''n''</sub>) ∈ ''R''}} is often used to mean {{nowrap|(''x''<sub>1</sub>, ..., ''x''<sub>''n''</sub>) ∈ ''G''}} is read "''x''<sub>1</sub>, ..., ''x''<sub>''n''</sub> are ''R''-related" and are denoted using [[Polish notation|prefix notation]] by {{nowrap|''Rx''<sub>1</sub>⋯''x''<sub>''n''</sub>}} and using [[Reverse Polish notation|postfix notation]] by {{nowrap|''x''<sub>1</sub>⋯''x''<sub>''n''</sub>''R''}}. In the case where ''R'' is a binary relation, those statements are also denoted using [[infix notation]] by {{nowrap|''x''<sub>1</sub>''Rx''<sub>2</sub>}}.

The following considerations apply:
* The set ''X''<sub>''i''</sub> is called the {{itco|{{mvar|i}}}}th ''domain'' of ''R''.{{sfn|ps=|Codd|1970}} In the case where ''R'' is a binary relation, ''X''<sub>1</sub> is also called simply the [[Binary relation#Definition|''domain'']] or ''set of departure'' of ''R'', and ''X''<sub>2</sub> is also called the [[Binary relation#Definition|''codomain'']] or ''set of destination'' of ''R''.
* When the elements of ''X''<sub>''i''</sub> are relations, ''X''<sub>''i''</sub> is called a ''nonsimple domain'' of ''R''.{{sfn|ps=|Codd|1970}}
* The set of {{nowrap|∀''x''<sub>''i''</sub> ∈ ''X''<sub>''i''</sub>}} such that {{nowrap|''Rx''<sub>1</sub>⋯''x''<sub>''i''−1</sub>''x''<sub>''i''</sub>''x''<sub>''i''+1</sub>⋯''x''<sub>''n''</sub>}} for at least one {{nowrap|(''x''<sub>1</sub>, ..., ''x''<sub>''n''</sub>)}} is called the ''i''th ''domain of definition'' or ''active domain'' of ''R''.{{sfn|ps=|Codd|1970}} In the case where ''R'' is a binary relation, its first domain of definition is also called simply the [[Binary relation#Definition|''domain of definition'']] or ''active domain'' of ''R'', and its second domain of definition is also called the [[Binary relation#Definition|''codomain of definition'']] or ''active codomain'' of ''R''.
* When the {{mvar|i}}th domain of definition of ''R'' is equal to ''X''<sub>''i''</sub>, ''R'' is said to be ''total'' on its ''i''th domain (or on ''X''<sub>''i''</sub>, when this is not ambiguous). In the case where ''R'' is a binary relation, when ''R'' is total on ''X''<sub>1</sub>, it is also said to be [[Binary relation#Special types of binary relations|''left-total'']] or ''serial'', and when ''R'' is total on ''X''<sub>2</sub>, it is also said to be [[Binary relation#Special types of binary relations|''right-total'']] or ''surjective''.
* When {{nowrap|∀''x'' ∀''y'' ∈ ''X''<sub>''i''</sub>.}} {{nowrap|∀''z'' ∈ ''X''<sub>''j''</sub>.}} {{nowrap|1=''xR''<sub>''ij''</sub>''z'' &and; ''yR''<sub>''ij''</sub>''z'' ⇒ ''x'' = ''y''}}, where {{nowrap|''i'' ∈ ''I''}}, {{nowrap|''j'' ∈ ''J''}}, {{nowrap|1=''R''<sub>''ij''</sub> = ''π''<sub>''ij''</sub> ''R''}}, and {{nowrap|{{mset|''I'', ''J''}}}} is a [[Partition of a set|partition]] of {{nowrap|{{mset|1, ..., ''n''}}}}, ''R'' is said to be ''unique'' on {{nowrap|{{mset|''X''<sub>''i''</sub>}}<sub>''i''∈''I''</sub>}}, and {{nowrap|{{mset|''X''<sub>''i''</sub>}}<sub>''i''∈''J''</sub>}} is called ''a [[primary key]]''{{sfn|ps=|Codd|1970}} of ''R''. In the case where ''R'' is a binary relation, when ''R'' is unique on {{mset|''X''<sub>1</sub>}}, it is also said to be [[Binary relation#Special types of binary relations|''left-unique'']] or ''injective'', and when ''R'' is unique on {{mset|''X''<sub>2</sub>}}, it is also said to be [[Binary relation#Special types of binary relations|''univalent'']] or ''right-unique''.
* When all ''X''<sub>''i''</sub> are the same set ''X'', it is simpler to refer to ''R'' as an ''n''-ary relation over ''X'', called a ''[[homogeneous relation]]''. Without this restriction, ''R'' is called a ''[[heterogeneous relation]]''.
* When any of ''X''<sub>''i''</sub> is empty, the defining Cartesian product is empty, and the only relation over such a sequence of domains is the empty relation {{nowrap|1=''R'' = ∅}}.

Let a [[Boolean domain]] ''B'' be a two-element set, say, {{nowrap|1=''B'' = {{mset|0, 1}}}}, whose elements can be interpreted as logical values, typically {{nowrap|1=0 = false}} and {{nowrap|1=1 = true}}. The [[Indicator function|characteristic function]] of ''R'', denoted by ''χ''<sub>''R''</sub>, is the [[Boolean-valued function]] {{nowrap|''χ''<sub>''R''</sub>: ''X''<sub>1</sub> × ... × ''X''<sub>''n''</sub> → ''B''}}, defined by {{nowrap|1=''χ''<sub>''R''</sub>({{nowrap|(''x''<sub>1</sub>, ..., ''x''<sub>''n''</sub>)}}) = 1}} if {{nowrap|''Rx''<sub>1</sub>⋯''x''<sub>''n''</sub>}} and {{nowrap|1=''χ''<sub>''R''</sub>({{nowrap|(''x''<sub>1</sub>, ..., ''x''<sub>''n''</sub>)}}) = 0}} otherwise.

In applied mathematics, [[computer science]] and statistics, it is common to refer to a Boolean-valued function as an ''n''-ary [[Predicate (mathematics)|''predicate'']]. From the more abstract viewpoint of [[formal logic]] and [[model theory]], the relation ''R'' constitutes a ''logical model'' or a ''relational structure'', that serves as one of many possible [[Interpretation (logic)|interpretation]]s of some ''n''-ary predicate symbol.

Because relations arise in many scientific disciplines, as well as in many branches of [[mathematics]] and [[logic]], there is considerable variation in terminology. Aside from the [[Set theory|set-theoretic]] [[extension (semantics)|extension]] of a relational concept or term, the term "relation" can also be used to refer to the corresponding logical entity, either the [[Comprehension (logic)|logical comprehension]], which is the totality of [[intension]]s or abstract properties shared by all elements in the relation, or else the symbols denoting these elements and intensions. Further, some writers of the latter persuasion introduce terms with more concrete connotations (such as "relational structure" for the set-theoretic extension of a given relational concept).

== Specific values of ''n'' ==
=== Nullary ===
{{Main article|Relation of degree zero}}
Nullary (0-ary) relations count only two members: the empty nullary relation, which never holds, and the universal nullary relation, which always holds. This is because there is only one 0-tuple, the empty tuple (), and there are exactly two subsets of the (singleton) set of all 0-tuples. They are sometimes useful for constructing the base case of an [[Mathematical induction|induction]] argument.

=== Unary ===
Unary (1-ary) relations can be viewed as a collection of members (such as the collection of [[Nobel laureates]]) having some property (such as that of having been awarded the [[Nobel Prize]]).

Every nullary function is a unary relation.

=== Binary ===
[[Binary relation|Binary]] (2-ary) relations are the most commonly studied form of finitary relations. Homogeneous binary relations (where {{nowrap|1=''X''<sub>1</sub> = ''X''<sub>2</sub>}}) include
* [[Equality (mathematics)|Equality]] and [[inequality (mathematics)|inequality]], denoted by signs such as = and < in statements such as "{{nowrap|5 < 12}}", or 
* [[Divisor|Divisibility]], denoted by the sign | in statements such as "{{nowrap|13 {{!}} 143}}".

Heterogeneous binary relations include
* [[Element (mathematics)|Set membership]], denoted by the sign ∈ in statements such as "{{nowrap|1 ∈ '''N'''}}".

=== Ternary ===
[[Ternary relation|Ternary]] (3-ary) relations include, for example, the [[binary function]]s, which relate two inputs and the output.  All three of the domains of a homogeneous ternary relation are the same set.

== Example ==
Consider the ternary relation ''R'' "''x'' thinks that ''y'' likes ''z''" over the set of people {{nowrap|1=''P'' = {{mset| Alice, Bob, Charles, Denise }}}}, defined by:
: {{nowrap|1=''R'' = {{mset| (Alice, Bob, Denise), (Charles, Alice, Bob), (Charles, Charles, Alice), (Denise, Denise, Denise) }}}}.

''R'' can be represented equivalently by the following table:

{| class="wikitable" style="width: 25em; margin: 0.5em auto; text-align: center;"
|+ Relation ''R'' "''x'' thinks that ''y'' likes ''z''"
|-
! ''x'' !! ''y'' !! ''z''
|-
| Alice || Bob || Denise
|-
| Charles || Alice || Bob
|-
| Charles || Charles || Alice
|-
| Denise || Denise || Denise
|}

Here, each row represents a triple of ''R'', that is it makes a statement of the form "''x'' thinks that ''y'' likes ''z''". For instance, the first row states that "Alice thinks that Bob likes Denise". All rows are distinct. The ordering of rows is insignificant but the ordering of columns is significant.{{sfn|ps=|Codd|1970}}

The above table is also a simple example of a [[relational database]], a field with theory rooted in [[relational algebra]] and applications in data management.<ref>{{cite web|url=http://www.pitt.edu/~bonidie/cs441/relations.pdf|title=Relations – CS441|website=www.pitt.edu|access-date=2019-12-11}}</ref> Computer scientists, logicians, and mathematicians, however, tend to have different conceptions what a general relation is, and what it is consisted of. For example, databases are designed to deal with empirical data, which is by definition finite, whereas in mathematics, relations with infinite arity (i.e., infinitary relation) are also considered.

== History ==
{{see also|Algebraic logic#History}}

The logician [[Augustus De Morgan]], in work published around 1860, was the first to articulate the notion of relation in anything like its present sense. He also stated the first formal results in the theory of relations (on De Morgan and relations, see Merrill 1990).

[[Charles Sanders Peirce|Charles Peirce]], [[Gottlob Frege]], [[Georg Cantor]], [[Richard Dedekind]] and others advanced the theory of relations. Many of their ideas, especially on relations called [[Order theory|orders]], were summarized in ''[[The Principles of Mathematics]]'' (1903) where [[Bertrand Russell]] made free use of these results.

In 1970, [[Edgar F. Codd|Edgar Codd]] proposed a [[relational model]] for [[database]]s, thus anticipating the development of [[data base management system]]s.{{sfn|ps=|Codd|1970}}

== See also ==
{{div col|colwidth=22em}}
* [[Incidence structure]]
* [[Hypergraph]]
* [[Logic of relatives]]
* [[Logical matrix]]
* [[Partial order]]
* [[Predicate (mathematical logic)]]
* [[Projection (set theory)]]
* [[Reflexive relation]]
* [[Relation algebra]]
* [[Relational algebra]]
* [[Relational model]]
* [[Relations (philosophy)]]
{{div col end}}

== References ==
{{reflist}}

== Bibliography ==
{{refbegin}}
* {{citation |last1=Bourbaki |first1=N. |author-link1=Nicolas Bourbaki |year=1994 |title=Elements of the History of Mathematics |translator=John Meldrum |translator-link=John D. P. Meldrum|publisher=Springer-Verlag }}
* {{citation |last1=Carnap |first1=Rudolf |author-link1=Rudolf Carnap |year=1958 |title=Introduction to Symbolic Logic with Applications |publisher=Dover Publications }}
* {{cite journal |last1=Codd |first1=Edgar Frank |author-link=Edgar F. Codd |date=June 1970 |title=A Relational Model of Data for Large Shared Data Banks |url=https://www.seas.upenn.edu/~zives/03f/cis550/codd.pdf |journal=Communications of the ACM |volume=13 |issue=6 |pages=377–387 |doi=10.1145/362384.362685 |s2cid=207549016 |access-date=2020-04-29 }}
* {{cite book |last=Codd |first=Edgar Frank |author-link=Edgar F. Codd |date=1990 |title=The Relational Model for Database Management: Version 2 |url=https://codeblab.com/wp-content/uploads/2009/12/rmdb-codd.pdf |location=Boston |publisher=[[Addison-Wesley]] |isbn=978-0201141924}}
* {{citation |last1=De Morgan |first1=A. |author1-link=Augustus De Morgan |orig-year=1858 |chapter=On the syllogism, part 3 |editor=Heath, P. |year=1966 |title=On the syllogism and other logical writings |publisher=Routledge |page=119 }}
* {{citation |last1= Halmos |first1=P.R. |author-link1=Paul Richard Halmos| year=1960 |title=Naive Set Theory |publication-place=Princeton NJ |publisher=D. Van Nostrand Company }}
* {{citation |last1=Lawvere |first1=F.W. |author-link1=William Lawvere |last2=Rosebrugh |first2= R |year=2003 |title=Sets for Mathematics |publisher=Cambridge Univ. Press }}
* [[Clarence Irving Lewis|Lewis, C.I.]] (1918) [[iarchive:asurveyofsymboli00lewiuoft|A Survey of Symbolic Logic]], Chapter 3: Applications of the Boole–Schröder Algebra, via [[Internet Archive]]
* {{citation |last1=Lucas |first1=J.R. |author-link1=John Lucas (philosopher) |year=1999 |title=Conceptual Roots of Mathematics |publisher=Routledge }}
* {{citation |last1=Maddux |first1=R.D. |author-link1=Roger Maddux |year=2006 |title=Relation Algebras |volume=150 |series=Studies in Logic and the Foundations of Mathematics |publisher=Elsevier Science }}
* {{citation |last1=Merrill |first1=Dan D. |year=1990 |title=Augustus De Morgan and the logic of relations |publisher=Kluwer }}
* {{cite book |last=Nivat |first=M. |chapter=Infinitary relations |author-link1=Maurice Nivat |date=1981 |editor-last=Astesiano |editor-first=Egidio |editor2-last=Böhm |editor2-first=Corrado |title=Caap '81 |chapter-url=https://link.springer.com/chapter/10.1007/3-540-10828-9_54 |series=Lecture Notes in Computer Science |volume=112 |language=en |publisher=Springer Berlin Heidelberg |pages=46–75 |doi=10.1007/3-540-10828-9_54 |isbn=978-3-540-38716-9 }}
* [[Charles Sanders Peirce|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–78, 1870. Reprinted, ''Collected Papers'' CP 3.45–149, ''Chronological Edition'' CE 2, 359–429.
* [[Charles Sanders Peirce|Peirce, C.S.]] (1984) ''Writings of Charles S. Peirce: A Chronological Edition, Volume 2, 1867–1871''. Peirce Edition Project, eds. Indiana University Press.
* {{citation |last1=Russell |first1=B. |author-link1=Bertrand Russell |orig-year=1903 |year=1938 |url=http://fair-use.org/bertrand-russell/the-principles-of-mathematics |title=The Principles of Mathematics |edition=2nd |publisher=Cambridge Univ. Press. }}
* {{citation |last1=Suppes |first1=P. |author-link1=Patrick Suppes |orig-year=1960 |year=1972 |title=Axiomatic Set Theory |publisher=Dover Publications }}
* {{citation |last1=Tarski |first1=A. |author-link1=Alfred Tarski |orig-year=1956 |year=1983 |title=Logic, Semantics, Metamathematics, Papers from 1923 to 1938 |translator=J.H. Woodger |edition=1st |publisher=Oxford University Press }} 2nd edition, J. Corcoran, ed. Indianapolis IN: Hackett Publishing.
* [[Stanislaw Ulam|Ulam, S.M.]] and [[Al Bednarek|Bednarek, A.R.]] (1990), "On the Theory of Relational Structures and Schemata for Parallel Computation", pp.&nbsp;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.
* {{citation |last1=Ulam |first1=S.M. |author-link1=Stanislaw Ulam |year=1990 |title=Analogies Between Analogies: The Mathematical Reports of S.M. Ulam and His Los Alamos Collaborators |editor1=A.R. Bednarek |editor2= Françoise Ulam |publisher=University of California Press }}
* {{citation |last1=Fraïssé |first1=R. |author-link1=Roland Fraïssé |year=2000 |orig-year=1986 |title=Theory of Relations |publisher=North Holland }}
{{refend}}

{{Mathematical logic}}
{{Authority control}}

[[Category:Mathematical logic]]
[[Category:Mathematical relations]]