Finitary relation

In mathematics, a finitary relation is a collection of finite tuples of elements (with a -ary relation being a collection of -tuples, or more precisely, a subset of Cartesian product with rank ).[1][2][3] Typically, the relation describes a possible connection between the components of a -tuple. For example, the relation " is divisible by and " consists of all the 3-tuples (of positive integers) such that when substituted into , , , respectively, make the sentence true. When , one has the most common version, a binary relation.[2]

Informal introduction

Consider the relation S involving three roles that people might play, that is expressed in a statement of the form "X thinks that Y likes Z ". For simplicity, we notate a set of possible scenarios in a table as follows:

Relation S : X thinks that Y likes Z
Person XPerson YPerson Z
AliceBobDenise
CharlesAliceBob
CharlesCharlesAlice
DeniseDeniseDenise

Here, each row of the table makes an assertion of the form "X thinks that Y likes Z ". For instance, the first row asserts that "Alice thinks that Bob likes Denise". The table represents a relation S over the set P, the set of all people under discussion. That is:

P = {Alice, Bob, Charles, 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)}.

The notation S(Alice, Bob, Denise) has the same effect as the first row of the table. The relation S is a ternary relation, since there are three items involved in each row. The relation is itself a set-theoretic object defined as a subset of the Cartesian product P×P×P, where P is the set of individuals as discussed above. Thus mathematically, a relation is simply a collection of "ordered list".

The above table for relation S is also a simple example of a relational database, a field with theory rooted in relational algebra and applications in data management.[4] 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 dimensions (i.e., infinitary relation) are also considered.

Relations with a small number of "places"

The non-negative integer giving the number of "places" in the relation, 3 for the above example, is called the relation's arity, rank, adicity, or dimension. A relation with places is variously called a -ary, a -adic, or a -dimensional relation. Relations with a finite number of places are called finite-place or finitary relations (or simply relations if the context is clear). It is also possible to generalize the concept to include infinitary relations between infinitudes of numbers,[5] as in the case of infinite sequences.

Since there is only one 0-tuple, the empty tuple ( ), there are only two zero-place relations: the one that always holds, and the one that never holds. These are sometimes useful for constructing the base case of an induction argument. One-place relations are called unary relations. For instance, any set (such as the collection of Nobel laureates) can be viewed as a collection of members having some property (such as that of having been awarded the Nobel prize). Two-place relations are called binary relations or, in some cases, dyadic relations.[6] Binary relations are the most commonly studied form of finitary relations,[1] whose examples include, among others:

  • Equality and inequality, denoted by signs such as '' and '' in statements such as '';
  • Divisibility, denoted by the sign '' in statements such as '';
  • Set membership, denoted by the sign '' in statements such as ''.

A -ary relation is a generalization of a binary relation.

Formal definitions

When two objects, qualities, classes, or attributes, viewed together by the mind, are seen under some connexion, that connexion is called a relation.

The simpler of the two definitions of -place relations encountered in mathematics is:

Definition 1. A relation L over the sets X1, …, Xk is a subset of their Cartesian product, written LX1 ×  × Xk.

Relations are classified according to the number of sets in the defining Cartesian product, in other words, according to the number of terms following L. Hence:

Relations with more than four terms are usually referred to as k-ary or n-ary, for example, a "5-ary relation". A k-ary relation is simply a set of k-tuples.[1]

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

Definition 2. A relation L over the sets X1, …, Xk is a (k + 1)-tuple L = (X1, …, Xk, G(L)), where G(L), also known as the graph of L, is a subset of the Cartesian product X1 ×  × Xk. G(L) is called the graph of L.

Elements of a relation are more briefly denoted by using boldface characters, for example, the constant element a = (a1, …, ak) or the variable element x = (x1, …, xk).

A statement of the form "a is in the relation L " or "a satisfies L " is taken to mean that a is in L under the first definition, and that a is in G(L) under the second definition.

The following considerations apply under either definition:

  • The sets Xj for j = 1 to k are called the domains of the relation. Under the first definition, the relation does not uniquely determine a given sequence of domains.
  • If all of the domains Xj are the same set X, then it is simpler to refer to L as a k-ary relation over X (i.e., a homogeneous relation).
  • If any of the domains Xj is empty, then the defining Cartesian product is empty, and the only relation over such a sequence of domains is the empty relation L = . Hence it is commonly stipulated that all of the domains be nonempty.

As a rule, whatever definition best fits the application at hand will be chosen for that purpose, and if it ever becomes necessary to distinguish between the two definitions, an entity satisfying the second definition may be called an embedded or included relation.

If L is a relation over the domains X1, …, Xk, it is conventional to consider a sequence of terms called variables, x1, …, xk, that are said to range over the respective domains.

Let a Boolean domain B be a two-element set, say, B = {0, 1}, whose elements can be interpreted as logical values, typically 0 = false and 1 = true. The characteristic function of the relation L, written ƒL or χ(L), is the Boolean-valued function ƒL : X1 ×  × Xk  B, defined in such a way that ƒL() = 1 precisely when the k-tuple is in the relation L. Such a function can also be called an indicator function, particularly in probability and statistics, to avoid confusion with the notion of a characteristic function in probability theory.

In applied mathematics, computer science and statistics, it is common to refer to a Boolean-valued function (such as ƒL) as a k-place predicate. From the more abstract viewpoint of formal logic and model theory, the relation L constitutes a logical model or a relational structure, that serves as one of many possible interpretations of some k-place 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-theoretic extension of a relational concept or term, the term "relation" can also be used to refer to the corresponding logical entity, either the logical comprehension, which is the totality of intensions 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).

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 restated and extended De Morgan's results.

In the 19th century, Peirce, Gottlob Frege, Georg Cantor, Richard Dedekind and others advanced the theory of relations. Many of their ideas, especially on relations called orders, were summarized in Principles of Mathematics (1903), where Bertrand Russell and Alfred Whitehead, made free use of these results.

See also

References

  1. "The Definitive Glossary of Higher Mathematical Jargon — Relation". Math Vault. 2019-08-01. Retrieved 2019-12-12.
  2. "Relation - Encyclopedia of Mathematics". www.encyclopediaofmath.org. Retrieved 2019-12-12.
  3. "Definition of n-ary Relation". cs.odu.edu. Retrieved 2019-12-12.
  4. "Relations — CS441" (PDF). www.pitt.edu. Retrieved 2019-12-11.
  5. Nivat, Maurice (1981). Astesiano, Egidio; Böhm, Corrado (eds.). "Infinitary relations". CAAP '81. Lecture Notes in Computer Science. Springer Berlin Heidelberg: 46–75. doi:10.1007/3-540-10828-9_54. ISBN 978-3-540-38716-9.
  6. MacBride, Fraser (2016), Zalta, Edward N. (ed.), "Relations", The Stanford Encyclopedia of Philosophy (Winter 2016 ed.), Metaphysics Research Lab, Stanford University, retrieved 2019-12-12
  7. De Morgan, A. (1858) "On the syllogism, part 3" in Heath, P., ed. (1966) On the syllogism and other logical writings. Routledge. P. 119,

Bibliography

  • Bourbaki, N. (1994) Elements of the History of Mathematics, John Meldrum, trans. Springer-Verlag.
  • Carnap, Rudolf (1958) Introduction to Symbolic Logic with Applications. Dover Publications.
  • Halmos, P.R. (1960) Naive Set Theory. Princeton NJ: D. Van Nostrand Company.
  • Lawvere, F.W., and R. Rosebrugh (2003) Sets for Mathematics, Cambridge Univ. Press.
  • Lewis, C.I. (1918) A Survey of Symbolic Logic, Chapter 3: Applications of the Boole—Schröder Algebra, via Internet Archive
  • Lucas, J. R. (1999) Conceptual Roots of Mathematics. Routledge.
  • Maddux, R.D. (2006) Relation Algebras, vol. 150 in 'Studies in Logic and the Foundations of Mathematics'. Elsevier Science.
  • Merrill, Dan D. (1990) Augustus De Morgan and the logic of relations. Kluwer.
  • 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.
  • Peirce, C.S. (1984) Writings of Charles S. Peirce: A Chronological Edition, Volume 2, 1867-1871. Peirce Edition Project, eds. Indiana University Press.
  • Russell, Bertrand (1903/1938) The Principles of Mathematics, 2nd ed. Cambridge Univ. Press.
  • Suppes, Patrick (1960/1972) Axiomatic Set Theory. Dover Publications.
  • Tarski, A. (1956/1983) Logic, Semantics, Metamathematics, Papers from 1923 to 1938, J.H. Woodger, trans. 1st edition, Oxford University Press. 2nd edition, J. Corcoran, ed. Indianapolis IN: Hackett Publishing.
  • 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.
  • Ulam, S.M. (1990) Analogies Between Analogies: The Mathematical Reports of S.M. Ulam and His Los Alamos Collaborators in A.R. Bednarek and Françoise Ulam, eds., University of California Press.
  • Roland Fraïssé (2000) [1986] Theory of Relations, North Holland
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.