Relation theory

☞ This page belongs to resource collections on Logic and Inquiry.
This article treats relations from the perspective of combinatorics, in other words, as a subject matter in discrete mathematics, with special attention to finite structures and concrete set-theoretic constructions, many of which arise quite naturally in applications. This approach to relation theory, or the theory of relations, is distinguished from, though closely related to, its study from the perspectives of abstract algebra on the one hand and formal logic on the other.
==Preliminaries==
Two definitions of the relation concept are common in the literature. Although it is usually clear in context which definition is being used at a given time, it tends to become less clear as contexts collide, or as discussion moves from one context to another.
The same sort of ambiguity arose in the development of the function concept and it may save some effort to follow the pattern of resolution that worked itself out there.
When we speak of a function f : X \to Y\! we are thinking of a mathematical object whose articulation requires three pieces of data, specifying the set X,\! the set Y,\! and a particular subset of their cartesian product {X \times Y}.\! So far so good.
Let us write f = (\mathrm{obj_1}f, \mathrm{obj_2}f, \mathrm{obj_{12}}f)\! to express what has been said so far.
When it comes to parsing the notation {}^{\backprime\backprime} f : X \to Y {}^{\prime\prime},\! everyone takes the part {}^{\backprime\backprime} X \to Y {}^{\prime\prime}\! to specify the type of the function, that is, the pair (\mathrm{obj_1}f, \mathrm{obj_2}f),\! but {}^{\backprime\backprime} f {}^{\prime\prime}\! is used equivocally to denote both the triple and the subset \mathrm{obj_{12}}f\! that forms one part of it. One way to resolve the ambiguity is to formalize a distinction between a function and its graph, letting \mathrm{graph}(f) := \mathrm{obj_{12}}f.\!
Another tactic treats the whole notation {}^{\backprime\backprime} f : X \to Y {}^{\prime\prime}\! as sufficient denotation for the triple, letting {}^{\backprime\backprime} f {}^{\prime\prime}\! denote \mathrm{graph}(f).\!
In categorical and computational contexts, at least initially, the type is regarded as an essential attribute or an integral part of the function itself. In other contexts it may be desirable to use a more abstract concept of function, treating a function as a mathematical object that appears in connection with many different types.
Following the pattern of the functional case, let the notation {}^{\backprime\backprime} L \subseteq X \times Y {}^{\prime\prime}\! bring to mind a mathematical object that is specified by three pieces of data, the set X,\! the set Y,\! and a particular subset of their cartesian product {X \times Y}.\! As before we have two choices, either let L = (X, Y, \mathrm{graph}(L))\! or let {}^{\backprime\backprime} L {}^{\prime\prime}\! denote \mathrm{graph}(L)\! and choose another name for the triple.
==Definition==
It is convenient to begin with the definition of a k\!-place relation, where k\! is a positive integer.
Definition. A k\!-place relation L \subseteq X_1 \times \ldots \times X_k\! over the nonempty sets X_1, \ldots, X_k\! is a (k+1)\!-tuple (X_1, \ldots, X_k, L)\! where L\! is a subset of the cartesian product X_1 \times \ldots \times X_k.\!
==Remarks==
Though usage varies as usage will, there are several bits of optional language that are frequently useful in discussing relations. The sets X_1, \ldots, X_k\! are called the domains of the relation L \subseteq X_1 \times \ldots \times X_k,\! with {X_j}\! being the j^\text{th}\! domain. If all of the {X_j}\! are the same set X\! then L \subseteq X_1 \times \ldots \times X_k\! is more simply described as a k\!-place relation over X.\! The set L\! is called the graph of the relation L \subseteq X_1 \times \ldots \times X_k,\! on analogy with the graph of a function. If the sequence of sets X_1, \ldots, X_k\! is constant throughout a given discussion or is otherwise determinate in context, then the relation L \subseteq X_1 \times \ldots \times X_k\! is determined by its graph L,\! making it acceptable to denote the relation by referring to its graph. Other synonyms for the adjective k\!-place are k\!-adic and k\!-ary, all of which leads to the integer k\! being called the dimension, adicity, or arity of the relation L.\!
==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 \subseteq X_1 \times \ldots \times X_k.\!
Select a relational domain {X_j}\! and one of its elements x.\! Then L_{x \operatorname{at} j}\! is a subset of L\! that is referred to as the flag of L\! with x\! at {j},\! or the x \operatorname{at} j\!-flag of L,\! an object that has the following definition:
L_{x \operatorname{at} j} ~=~ \{ (x_1, \ldots, x_j, \ldots, x_k) \in L ~:~ x_j = x \}.\!
Any property C\! of the local flag L_{x \operatorname{at} j} \subseteq L\! is said to be a local incidence property of L\! with respect to the locus x \operatorname{at} j.\!
A k\!-adic relation L \subseteq X_1 \times \ldots \times X_k\! 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 X_j.\!
Expressed in symbols, L\! is C\!-regular at j\! if and only if C(L_{x \operatorname{at} j})\! is true for all x\! in X_j.\!
==Regional incidence properties==
The definition of a local flag can be broadened from a point x\! in {X_j}\! to a subset M\! of X_j,\! arriving at the definition of a regional flag in the following way:
Suppose that L \subseteq X_1 \times \ldots \times X_k,\! and choose a subset M \subseteq X_j.\! Then L_{M \operatorname{at} j}\! is a subset of L\! that is said to be the flag of L\! with M\! at {j},\! or the M \operatorname{at} j\!-flag of L,\! an object which has the following definition:
L_{M \operatorname{at} j} ~=~ \{ (x_1, \ldots, x_j, \ldots, x_k) \in L ~:~ x_j \in M \}.\!
==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 L_{x \operatorname{at} j}\! is c\! for all x\! in {X_j},\! or, to write it in symbols, if and only if |L_{x \operatorname{at} j}| = c\! for all {x \in X_j}.\!
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:
\begin{matrix}
L & \text{is} & c\textit{-regular} & \text{at}\ j
& \text{if and only if} &	& = & c & \text{for all}\ x \in X_j.
\\[4pt]
L & \text{is} & (<\!c)\textit{-regular} & \text{at}\ j
& \text{if and only if} &	& < & c & \text{for all}\ x \in X_j.
\\[4pt]
L & \text{is} & (>\!c)\textit{-regular} & \text{at}\ j
& \text{if and only if} &	& > & c & \text{for all}\ x \in X_j.
\end{matrix}
==Species of 2-adic relations==
Returning to 2-adic relations, it is useful to describe some familiar classes of objects in terms of their local and numerical incidence properties. Let L \subseteq S \times T\! be an arbitrary 2-adic relation. The following properties of L\! can be defined:
\begin{matrix}
L & \text{is} & \textit{total} & \text{at}~ S
& \text{if and only if} &
L & \text{is} & (\ge 1)\text{-regular} & \text{at}~ S.
\\[4pt]
L & \text{is} & \textit{total} & \text{at}~ T
& \text{if and only if} &
L & \text{is} & (\ge 1)\text{-regular} & \text{at}~ T.
\\[4pt]
L & \text{is} & \textit{tubular} & \text{at}~ S
& \text{if and only if} &
L & \text{is} & (\le 1)\text{-regular} & \text{at}\ S.
\\[4pt]
L & \text{is} & \textit{tubular} & \text{at}~ T
& \text{if and only if} &
L & \text{is} & (\le 1)\text{-regular} & \text{at}~ T.
\end{matrix}
If L \subseteq S \times T\! is tubular at S\! then L\! is called a partial function or a prefunction from S\! to T.\! This is sometimes indicated by giving L\! an alternate name, say, {}^{\backprime\backprime} p {}^{\prime\prime},~\! and writing L = p : S \rightharpoonup T.\!
Just by way of formalizing the definition:
\begin{matrix}
L & = & p : S \rightharpoonup T
& \text{if and only if} &
L & \text{is} & \text{tubular} & \text{at}~ S.
\end{matrix}
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 \to T.\! To say that a relation L \subseteq 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:
\begin{matrix}
L & = & f : S \to T
& \text{if and only if} &
L & \text{is} & 1\text{-regular} & \text{at}~ S.
\end{matrix}
In the case of a function f : S \to T,\! one has the following additional definitions:
\begin{matrix}
f & \text{is} & \textit{surjective}
& \text{if and only if} &
f & \text{is} & \text{total} & \text{at}~ T.
\\[4pt]
f & \text{is} & \textit{injective}
& \text{if and only if} &
f & \text{is} & \text{tubular} & \text{at}~ T.
\\[4pt]
f & \text{is} & \textit{bijective}
& \text{if and only if} &
f & \text{is} & 1\text{-regular} & \text{at}~ T.
\end{matrix}
==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 climes, 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, for k = 0, 1, 2, 3, \ldots,\! with some writers using the Greek forms, medadic, monadic, dyadic, triadic, k\!-adic, and other writers using the Latin forms, nullary, unary, binary, ternary, k\!-ary.
The number of relational domains may be referred to as the adicity, arity, or dimension of the relation. Accordingly, one finds a relation on a finite number of domains described as a polyadic relation or a finitary relation, but others count infinitary relations among the polyadic. If the number of domains is finite, say equal to k,\! then the relation may be described as a k\!-adic relation, a k\!-ary 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 is derivative in relationship to 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.
==References==
* Peirce, C.S., “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., “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, 1990.
==Bibliography==
* Barr, Michael, and Wells, Charles (1990), Category Theory for Computing Science, Prentice Hall, Hemel Hempstead, UK.
* Bourbaki, Nicolas (1994), Elements of the History of Mathematics, John Meldrum (trans.), Springer-Verlag, Berlin, Germany.
* Carnap, Rudolf (1958), Introduction to Symbolic Logic with Applications, Dover Publications, New York, NY.
* Chang, C.C., and Keisler, H.J. (1973), Model Theory, North-Holland, Amsterdam, Netherlands.
* van Dalen, Dirk (1980), Logic and Structure, 2nd edition, Springer-Verlag, Berlin, Germany.
* Devlin, Keith J. (1993), The Joy of Sets : Fundamentals of Contemporary Set Theory, 2nd edition, Springer-Verlag, New York, NY.
* Halmos, Paul Richard (1960), Naive Set Theory, D. Van Nostrand Company, Princeton, NJ.
* van Heijenoort, Jean (1967/1977), From Frege to Gödel : A Source Book in Mathematical Logic, 1879–1931, Harvard University Press, Cambridge, MA, 1967. Reprinted with corrections, 1977.
* Kelley, John L. (1955), General Topology, Van Nostrand Reinhold, New York, NY.
* Kneale, William; and Kneale, Martha (1962/1975), The Development of Logic, Oxford University Press, Oxford, UK, 1962. Reprinted with corrections, 1975.
* Lawvere, Francis William; and Rosebrugh, Robert (2003), Sets for Mathematics, Cambridge University Press, Cambridge, UK.
* Lawvere, Francis William; and Schanuel, Stephen H. (1997/2000), Conceptual Mathematics : A First Introduction to Categories, Cambridge University Press, Cambridge, UK, 1997. Reprinted with corrections, 2000.
* Manin, Yu. I. (1977), A Course in Mathematical Logic, Neal Koblitz (trans.), Springer-Verlag, New York, NY.
* Mathematical Society of Japan (1993), Encyclopedic Dictionary of Mathematics, 2nd edition, 2 vols., Kiyosi Itô (ed.), MIT Press, Cambridge, MA.
* Mili, A., Desharnais, J., Mili, F., with Frappier, M. (1994), Computer Program Construction, Oxford University Press, New York, NY. (Introduction to Tarskian relation theory and relational programming.)
* Mitchell, John C. (1996), Foundations for Programming Languages, MIT Press, Cambridge, MA.
* Peirce, Charles Sanders (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 (1870), 317–378. Reprinted (CP 3.45–149), (CE 2, 359–429).
* Peirce, Charles Sanders (1931–1935, 1958), Collected Papers of Charles Sanders Peirce, vols. 1–6, Charles Hartshorne and Paul Weiss (eds.), vols. 7–8, Arthur W. Burks (ed.), Harvard University Press, Cambridge, MA. Cited as (CP volume.paragraph).
* Peirce, Charles Sanders (1981–), Writings of Charles S. Peirce : A Chronological Edition, Peirce Edition Project (eds.), Indiana University Press, Bloomington and Indianapolis, IN. Cited as (CE volume, page).
* Poizat, Bruno (2000), A Course in Model Theory : An Introduction to Contemporary Mathematical Logic, Moses Klein (trans.), Springer-Verlag, New York, NY.
* Quine, Willard Van Orman (1940/1981), Mathematical Logic, 1940. Revised edition, Harvard University Press, Cambridge, MA, 1951. New preface, 1981.
* Royce, Josiah (1961), The Principles of Logic, Philosophical Library, New York, NY.
* Runes, Dagobert D. (ed., 1962), Dictionary of Philosophy, Littlefield, Adams, and Company, Totowa, NJ.
* Shoenfield, Joseph R. (1967), Mathematical Logic, Addison-Wesley, Reading, MA.
* Styazhkin, N.I. (1969), History of Mathematical Logic from Leibniz to Peano, MIT Press, Cambridge, MA.
* Suppes, Patrick (1957/1999), Introduction to Logic, 1st published 1957. Reprinted, Dover Publications, New York, NY, 1999.
* Suppes, Patrick (1960/1972), Axiomatic Set Theory, 1st published 1960. Reprinted, Dover Publications, New York, NY, 1972.
* Tarski, Alfred (1956/1983), Logic, Semantics, Metamathematics : Papers from 1923 to 1938, J.H. Woodger (trans.), Oxford University Press, 1956. 2nd edition, J. Corcoran (ed.), Hackett Publishing, Indianapolis, IN, 1983.
* Ulam, Stanislaw Marcin; and Bednarek, A.R. (1977), “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, 1990.
* Ulam, Stanislaw Marcin (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.
* Ullman, Jeffrey D. (1980), Principles of Database Systems, Computer Science Press, Rockville, MD.
* Venetus, Paulus (1472/1984), Logica Parva : Translation of the 1472 Edition with Introduction and Notes, Alan R. Perreiah (trans.), Philosophia Verlag, Munich, Germany.
==Syllabus==
===Focal nodes===
* Inquiry Live
* Logic Live
===Peer nodes===
* Relation Theory @ InterSciWiki
* Relation Theory @ MyWikiBiz
* Relation Theory @ Subject Wikis
* Relation Theory @ Wikiversity
* 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===
* 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==
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, InterSciWiki
* Relation Theory, MyWikiBiz
* Relation Theory, PlanetMath
* Relation Theory, Semantic Web
* Relation Theory, Wikinfo
* Relation Theory, Wikiversity
* Relation Theory, Wikiversity Beta
* Relation Theory, Wikipedia
Category:Charles Sanders Peirce
Category:Combinatorics
Category:Computer Science
Category:Database Theory
Category:Discrete Mathematics
Category:Formal Sciences
Category:Inquiry
Category:Logic
Category:Mathematics
Category:Relation Theory
Category:Set Theory