Binary relation

Relationship between elements of two sets

This article covers advanced notions. For basic topics, see Relation (mathematics).

Transitive binary relations

* v
* t
* e

| |  Symmetric|  Antisymmetric|  Connected|  Well-founded|  Has joins|  Has meets|  Reflexive|  Irreflexive|  Asymmetric

|
|
|
|
|
|
|
|
|

| | |  Total,
Semiconnex| | | | |  Anti-
reflexive|
Equivalence relation|  Y|  ✗|  ✗|  ✗|  ✗|  ✗|  Y|  ✗|  ✗
Preorder (Quasiorder)|  ✗|  ✗|  ✗|  ✗|  ✗|  ✗|  Y|  ✗|  ✗
Partial order|  ✗|  Y|  ✗|  ✗|  ✗|  ✗|  Y|  ✗|  ✗
Total preorder|  ✗|  ✗|  Y|  ✗|  ✗|  ✗|  Y|  ✗|  ✗
Total order|  ✗|  Y|  Y|  ✗|  ✗|  ✗|  Y|  ✗|  ✗
Prewellordering|  ✗|  ✗|  Y|  Y|  ✗|  ✗|  Y|  ✗|  ✗
Well-quasi-ordering|  ✗|  ✗|  ✗|  Y|  ✗|  ✗|  Y|  ✗|  ✗
Well-ordering|  ✗|  Y|  Y|  Y|  ✗|  ✗|  Y|  ✗|  ✗
Lattice|  ✗|  Y|  ✗|  ✗|  Y|  Y|  Y|  ✗|  ✗
Join-semilattice|  ✗|  Y|  ✗|  ✗|  Y|  ✗|  Y|  ✗|  ✗
Meet-semilattice|  ✗|  Y|  ✗|  ✗|  ✗|  Y|  Y|  ✗|  ✗
Strict partial order|  ✗|  Y|  ✗|  ✗|  ✗|  ✗|  ✗|  Y|  Y
Strict weak order|  ✗|  Y|  ✗|  ✗|  ✗|  ✗|  ✗|  Y|  Y
Strict total order|  ✗|  Y|  Y|  ✗|  ✗|  ✗|  ✗|  Y|  Y
|  Symmetric|  Antisymmetric|  Connected|  Well-founded|  Has joins|  Has meets|  Reflexive|  Irreflexive|  Asymmetric
Definitions,
for all  a , b {\displaystyle a,b} and  S ≠ ∅ : {\displaystyle S\neq \varnothing :} |  a R b ⇒ b R a {\displaystyle {\begin{aligned}&aRb\\\\\Rightarrow {}&bRa\end{aligned}}} |  a R b  and  b R a ⇒ a = b {\displaystyle {\begin{aligned}aRb{\text{ and }}&bRa\\\\\Rightarrow a={}&b\end{aligned}}} |  a ≠ b ⇒ a R b  or  b R a {\displaystyle {\begin{aligned}a\neq {}&b\Rightarrow \\\aRb{\text{ or }}&bRa\end{aligned}}} |  min S exists {\displaystyle {\begin{aligned}\min S\\\\{\text{exists}}\end{aligned}}} |  a ∨ b exists {\displaystyle {\begin{aligned}a\vee b\\\\{\text{exists}}\end{aligned}}} |  a ∧ b exists {\displaystyle {\begin{aligned}a\wedge b\\\\{\text{exists}}\end{aligned}}} |  a R a {\displaystyle aRa} |  not  a R a {\displaystyle {\text{not }}aRa} |  a R b ⇒ not  b R a {\displaystyle {\begin{aligned}aRb\Rightarrow \\\\{\text{not }}bRa\end{aligned}}}
Y indicates that the column's property is always true for the row's term (at the very left), while ✗ indicates that the property is not guaranteed
in general (it might, or might not, hold). For example, that every equivalence relation is symmetric, but not necessarily antisymmetric,
is indicated by Y in the "Symmetric" column and ✗ in the "Antisymmetric" column, respectively.

All definitions tacitly require the homogeneous relation R {\displaystyle R} be transitive: for all  a , b , c , {\displaystyle a,b,c,} if  a R b {\displaystyle aRb} and  b R c {\displaystyle bRc} then  a R c . {\displaystyle aRc.}
A term's definition may require additional properties that are not listed in this table.

An example of a binary relation R between two finite sets of natural numbers, A and B. Note that R is a subset of the Cartesian product, A × B. In this example, R = {(a, b) ∈ A × B: a < b}.

In mathematics, a binary relation associates some elements of one set called the domain with some elements of another set (possibly the same) called the codomain.[1] Precisely, a binary relation over sets  X {\displaystyle X} and  Y {\displaystyle Y} is a set of ordered pairs ( x , y ) {\displaystyle (x,y)} , where  x {\displaystyle x} is an element of  X {\displaystyle X} and  y {\displaystyle y} is an element of  Y {\displaystyle Y} .[2] It encodes the common concept of relation: an element  x {\displaystyle x} is related to an element  y {\displaystyle y} , if and only if the pair  ( x , y ) {\displaystyle (x,y)} belongs to the set of ordered pairs that defines the binary relation.

An example of a binary relation is the "divides" relation over the set of prime numbers P {\displaystyle \mathbb {P} } and the set of integers Z {\displaystyle \mathbb {Z} } , in which each prime  p {\displaystyle p} is related to each integer  z {\displaystyle z} that is a multiple of  p {\displaystyle p} , but not to an integer that is not a multiple of  p {\displaystyle p} . In this relation, for instance, the prime number  2 {\displaystyle 2} is related to numbers such as  − 4 {\displaystyle -4} ,  0 {\displaystyle 0} ,  6 {\displaystyle 6} ,  10 {\displaystyle 10} , but not to  1 {\displaystyle 1} or  9 {\displaystyle 9} , just as the prime number  3 {\displaystyle 3} is related to  0 {\displaystyle 0} ,  6 {\displaystyle 6} , and  9 {\displaystyle 9} , but not to  4 {\displaystyle 4} or  13 {\displaystyle 13} .

A binary relation is called a homogeneous relation when  X = Y {\displaystyle X=Y} . A binary relation is also called a heterogeneous relation when it is not necessary that  X = Y {\displaystyle X=Y} .

Binary relations, and especially homogeneous relations, are used in many branches of mathematics to model a wide variety of concepts. These include, among others:

* the "is greater than", "is equal to", and "divides" relations in arithmetic;
* the "is congruent to" relation in geometry;
* the "is adjacent to" relation in graph theory;
* the "is orthogonal to" relation in linear algebra.

A function may be defined as a binary relation that meets additional constraints.[3] Binary relations are also heavily used in computer science.

A binary relation over sets  X {\displaystyle X} and  Y {\displaystyle Y} can be identified with an element of the power set of the Cartesian product X × Y . {\displaystyle X\times Y.} Since a powerset is a lattice for set inclusion ( ⊆ {\displaystyle \subseteq } ), relations can be manipulated using set operations (union, intersection, and complementation) and algebra of sets.

In some systems of axiomatic set theory, relations are extended to classes, which are generalizations of sets. This extension is needed for, among other things, modeling the concepts of "is an element of" or "is a subset of" in set theory, without running into logical inconsistencies such as Russell's paradox.

A binary relation is the most studied special case  n = 2 {\displaystyle n=2} of an  n {\displaystyle n} -ary relation over sets  X 1 , … , X n {\displaystyle X_{1},\dots ,X_{n}} , which is a subset of the Cartesian product X 1 × ⋯ × X n . {\displaystyle X_{1}\times \cdots \times X_{n}.} [2]

## Definition

[edit]

Given sets  X {\displaystyle X} and  Y {\displaystyle Y} , the Cartesian product  X × Y {\displaystyle X\times Y} is defined as  { ( x , y ) ∣ x ∈ X  and  y ∈ Y } , {\displaystyle \\{(x,y)\mid x\in X{\text{ and }}y\in Y\\},} and its elements are called ordered pairs.

A binary relation R {\displaystyle R} over sets  X {\displaystyle X} and  Y {\displaystyle Y} is a subset of  X × Y . {\displaystyle X\times Y.} [2][4] The set  X {\displaystyle X} is called the domain[2] or set of departure of  R {\displaystyle R} , and the set  Y {\displaystyle Y} the codomain or set of destination of  R {\displaystyle R} . In order to specify the choices of the sets  X {\displaystyle X} and  Y {\displaystyle Y} , some authors define a binary relation or correspondence as an ordered triple  ( X , Y , G ) {\displaystyle (X,Y,G)} , where  G {\displaystyle G} is a subset of  X × Y {\displaystyle X\times Y} called the graph of the binary relation. The statement  ( x , y ) ∈ R {\displaystyle (x,y)\in R} reads " x {\displaystyle x} is  R {\displaystyle R} -related to  y {\displaystyle y} " and is denoted by  x R y {\displaystyle xRy} .[5][6][7][a] The domain of definition or active domain[2] of  R {\displaystyle R} is the set of all  x {\displaystyle x} such that  x R y {\displaystyle xRy} for at least one  y {\displaystyle y} . The codomain of definition, active codomain,[2] image or range of  R {\displaystyle R} is the set of all  y {\displaystyle y} such that  x R y {\displaystyle xRy} for at least one  x {\displaystyle x} . The field of  R {\displaystyle R} is the union of its domain of definition and its codomain of definition.[9][10][11]

When  X = Y , {\displaystyle X=Y,} a binary relation is called a homogeneous relation (or endorelation). To emphasize the fact that  X {\displaystyle X} and  Y {\displaystyle Y} are allowed to be different, a binary relation is also called a heterogeneous relation.[12][13][14] The prefix hetero is from the Greek ἕτερος (heteros, "other, another, different").

A heterogeneous relation has been called a rectangular relation,[14] suggesting that it does not have the square-like symmetry of a homogeneous relation on a set where  A = B . {\displaystyle A=B.} Commenting on the development of binary relations beyond homogeneous relations, researchers wrote, "... a variant of the theory has evolved that treats relations from the very beginning as heterogeneous or rectangular, i.e. as relations where the normal case is that they are relations between different sets."[15]

The terms correspondence,[16] dyadic relation and two-place relation are synonyms for binary relation, though some authors use the term "binary relation" for any subset of a Cartesian product  X × Y {\displaystyle X\times Y} without reference to  X {\displaystyle X} and  Y {\displaystyle Y} , and reserve the term "correspondence" for a binary relation with reference to  X {\displaystyle X} and  Y {\displaystyle Y} .[citation needed]

In a binary relation, the order of the elements is important; if  x ≠ y {\displaystyle x\neq y} then  y R x {\displaystyle yRx} can be true or false independently of  x R y {\displaystyle xRy} . For example,  3 {\displaystyle 3} divides  9 {\displaystyle 9} , but  9 {\displaystyle 9} does not divide  3 {\displaystyle 3} .

## Operations

[edit]

### Union

[edit]

If  R {\displaystyle R} and  S {\displaystyle S} are binary relations over sets  X {\displaystyle X} and  Y {\displaystyle Y} then  R ∪ S = { ( x , y ) ∣ x R y  or  x S y } {\displaystyle R\cup S=\\{(x,y)\mid xRy{\text{ or }}xSy\\}} is the union relation of  R {\displaystyle R} and  S {\displaystyle S} over  X {\displaystyle X} and  Y {\displaystyle Y} .

The identity element is the empty relation. For example,  ≤ {\displaystyle \leq } is the union of < and =, and  ≥ {\displaystyle \geq } is the union of > and =.

### Intersection

[edit]

If  R {\displaystyle R} and  S {\displaystyle S} are binary relations over sets  X {\displaystyle X} and  Y {\displaystyle Y} then  R ∩ S = { ( x , y ) ∣ x R y  and  x S y } {\displaystyle R\cap S=\\{(x,y)\mid xRy{\text{ and }}xSy\\}} is the intersection relation of  R {\displaystyle R} and  S {\displaystyle S} over  X {\displaystyle X} and  Y {\displaystyle Y} .

The identity element is the universal relation. For example, the relation "is divisible by 6" is the intersection of the relations "is divisible by 3" and "is divisible by 2".

### Composition

[edit]

Main article: Composition of relations

If  R {\displaystyle R} is a binary relation over sets  X {\displaystyle X} and  Y {\displaystyle Y} , and  S {\displaystyle S} is a binary relation over sets  Y {\displaystyle Y} and  Z {\displaystyle Z} then  S ∘ R = { ( x , z ) ∣  there exists  y ∈ Y  such that  x R y  and  y S z } {\displaystyle S\circ R=\\{(x,z)\mid {\text{ there exists }}y\in Y{\text{ such that }}xRy{\text{ and }}ySz\\}} (also denoted by  R ; S {\displaystyle R;S} ) is the composition relation of  R {\displaystyle R} and  S {\displaystyle S} over  X {\displaystyle X} and  Z {\displaystyle Z} .

The identity element is the identity relation. The order of  R {\displaystyle R} and  S {\displaystyle S} in the notation  S ∘ R , {\displaystyle S\circ R,} used here agrees with the standard notational order for composition of functions. For example, the composition (is parent of) ∘ {\displaystyle \circ } (is mother of) yields (is maternal grandparent of), while the composition (is mother of) ∘ {\displaystyle \circ } (is parent of) yields (is grandmother of). For the former case, if  x {\displaystyle x} is the parent of  y {\displaystyle y} and  y {\displaystyle y} is the mother of  z {\displaystyle z} , then  x {\displaystyle x} is the maternal grandparent of  z {\displaystyle z} .

### Converse

[edit]

Main article: Converse relation

See also: Duality (order theory)

If  R {\displaystyle R} is a binary relation over sets  X {\displaystyle X} and  Y {\displaystyle Y} then  R T = { ( y , x ) ∣ x R y } {\displaystyle R^{\textsf {T}}=\\{(y,x)\mid xRy\\}} is the converse relation,[17] also called inverse relation,[18] of  R {\displaystyle R} over  Y {\displaystyle Y} and  X {\displaystyle X} .

For example,  = {\displaystyle =} is the converse of itself, as is  ≠ {\displaystyle \neq } , and  < {\displaystyle <} and  > {\displaystyle >} are each other's converse, as are  ≤ {\displaystyle \leq } and  ≥ . {\displaystyle \geq .} A binary relation is equal to its converse if and only if it is symmetric.

### Complement

[edit]

Main article: Complementary relation

If  R {\displaystyle R} is a binary relation over sets  X {\displaystyle X} and  Y {\displaystyle Y} then  R ¯ = { ( x , y ) ∣ ¬ x R y } {\displaystyle {\bar {R}}=\\{(x,y)\mid \neg xRy\\}} (also denoted by  ¬ R {\displaystyle \neg R} ) is the complementary relation of  R {\displaystyle R} over  X {\displaystyle X} and  Y {\displaystyle Y} .

For example,  = {\displaystyle =} and  ≠ {\displaystyle \neq } are each other's complement, as are  ⊆ {\displaystyle \subseteq } and  ⊈ {\displaystyle \not \subseteq } ,  ⊇ {\displaystyle \supseteq } and  ⊉ {\displaystyle \not \supseteq } ,  ∈ {\displaystyle \in } and  ∉ {\displaystyle \not \in } , and for total orders also  < {\displaystyle <} and  ≥ {\displaystyle \geq } , and  > {\displaystyle >} and  ≤ {\displaystyle \leq } .

The complement of the converse relation R T {\displaystyle R^{\textsf {T}}} is the converse of the complement:  R T ¯ = R ¯ T . {\displaystyle {\overline {R^{\mathsf {T}}}}={\bar {R}}^{\mathsf {T}}.}

If  X = Y , {\displaystyle X=Y,} the complement has the following properties:

* If a relation is symmetric, then so is the complement.
* The complement of a reflexive relation is irreflexive—and vice versa.
* The complement of a strict weak order is a total preorder—and vice versa.

### Restriction

[edit]

Main article: Restriction (mathematics)

If  R {\displaystyle R} is a binary homogeneous relation over a set  X {\displaystyle X} and  S {\displaystyle S} is a subset of  X {\displaystyle X} then  R | S = { ( x , y ) ∣ x R y  and  x ∈ S  and  y ∈ S } {\displaystyle R_{\vert S}=\\{(x,y)\mid xRy{\text{ and }}x\in S{\text{ and }}y\in S\\}} is the restriction relation of  R {\displaystyle R} to  S {\displaystyle S} over  X {\displaystyle X} .

If  R {\displaystyle R} is a binary relation over sets  X {\displaystyle X} and  Y {\displaystyle Y} and if  S {\displaystyle S} is a subset of  X {\displaystyle X} then  R | S = { ( x , y ) ∣ x R y  and  x ∈ S } {\displaystyle R_{\vert S}=\\{(x,y)\mid xRy{\text{ and }}x\in S\\}} is the left-restriction relation of  R {\displaystyle R} to  S {\displaystyle S} over  X {\displaystyle X} and  Y {\displaystyle Y} .[clarification needed]

If a relation is reflexive, irreflexive, symmetric, antisymmetric, asymmetric, transitive, total, trichotomous, a partial order, total order, strict weak order, total preorder (weak order), or an equivalence relation, then so too are its restrictions.

However, the transitive closure of a restriction is a subset of the restriction of the transitive closure, i.e., in general not equal. For example, restricting the relation " x {\displaystyle x} is parent of  y {\displaystyle y} " to females yields the relation " x {\displaystyle x} is mother of the woman  y {\displaystyle y} "; its transitive closure does not relate a woman with her paternal grandmother. On the other hand, the transitive closure of "is parent of" is "is ancestor of"; its restriction to females does relate a woman with her paternal grandmother.

Also, the various concepts of completeness (not to be confused with being "total") do not carry over to restrictions. For example, over the real numbers a property of the relation  ≤ {\displaystyle \leq } is that every non-empty subset  S ⊆ R {\displaystyle S\subseteq \mathbb {R} } with an upper bound in  R {\displaystyle \mathbb {R} } has a least upper bound (also called supremum) in  R . {\displaystyle \mathbb {R} .} However, for the rational numbers this supremum is not necessarily rational, so the same property does not hold on the restriction of the relation  ≤ {\displaystyle \leq } to the rational numbers.

A binary relation  R {\displaystyle R} over sets  X {\displaystyle X} and  Y {\displaystyle Y} is said to be contained in a relation  S {\displaystyle S} over  X {\displaystyle X} and  Y {\displaystyle Y} , written  R ⊆ S , {\displaystyle R\subseteq S,} if  R {\displaystyle R} is a subset of  S {\displaystyle S} , that is, for all  x ∈ X {\displaystyle x\in X} and  y ∈ Y , {\displaystyle y\in Y,} if  x R y {\displaystyle xRy} , then  x S y {\displaystyle xSy} . If  R {\displaystyle R} is contained in  S {\displaystyle S} and  S {\displaystyle S} is contained in  R {\displaystyle R} , then  R {\displaystyle R} and  S {\displaystyle S} are called equal written  R = S {\displaystyle R=S} . If  R {\displaystyle R} is contained in  S {\displaystyle S} but  S {\displaystyle S} is not contained in  R {\displaystyle R} , then  R {\displaystyle R} is said to be smaller than  S {\displaystyle S} , written  R ⊊ S . {\displaystyle R\subsetneq S.} For example, on the rational numbers, the relation  > {\displaystyle >} is smaller than  ≥ {\displaystyle \geq } , and equal to the composition  > ∘ > {\displaystyle >\circ >} .

### Matrix representation

[edit]

Binary relations over sets  X {\displaystyle X} and  Y {\displaystyle Y} can be represented algebraically by logical matrices indexed by  X {\displaystyle X} and  Y {\displaystyle Y} with entries in the Boolean semiring (addition corresponds to OR and multiplication to AND) where matrix addition corresponds to union of relations, matrix multiplication corresponds to composition of relations (of a relation over  X {\displaystyle X} and  Y {\displaystyle Y} and a relation over  Y {\displaystyle Y} and  Z {\displaystyle Z} ),[19] the Hadamard product corresponds to intersection of relations, the zero matrix corresponds to the empty relation, and the matrix of ones corresponds to the universal relation. Homogeneous relations (when  X = Y {\displaystyle X=Y} ) form a matrix semiring (indeed, a matrix semialgebra over the Boolean semiring) where the identity matrix corresponds to the identity relation.[20]

## Examples

[edit]

2nd example relation

A {\displaystyle A}

B {\displaystyle B}

| ball  | car  | doll  | cup

|
|
|
|

John  | + | − | − | −
Mary  | − | − | + | −
Venus  | − | + | − | −
1st example relation

A {\displaystyle A}

B {\displaystyle B}

| ball  | car  | doll  | cup

|
|
|
|

John  | + | − | − | −
Mary  | − | − | + | −
Ian  | − | − | − | −
Venus  | − | + | − | −

1. The following example shows that the choice of codomain is important. Suppose there are four objects  A = { ball, car, doll, cup } {\displaystyle A=\\{{\text{ball, car, doll, cup}}\\}} and four people  B = { John, Mary, Ian, Venus } . {\displaystyle B=\\{{\text{John, Mary, Ian, Venus}}\\}.} A possible relation on  A {\displaystyle A} and  B {\displaystyle B} is the relation "is owned by", given by  R = { ( ball, John ) , ( doll, Mary ) , ( car, Venus ) } . {\displaystyle R=\\{({\text{ball, John}}),({\text{doll, Mary}}),({\text{car, Venus}})\\}.} That is, John owns the ball, Mary owns the doll, and Venus owns the car. Nobody owns the cup and Ian owns nothing; see the 1st example. As a set,  R {\displaystyle R} does not involve Ian, and therefore  R {\displaystyle R} could have been viewed as a subset of  A × { John, Mary, Venus } , {\displaystyle A\times \\{{\text{John, Mary, Venus}}\\},} i.e. a relation over  A {\displaystyle A} and  { John, Mary, Venus } ; {\displaystyle \\{{\text{John, Mary, Venus}}\\};} see the 2nd example. But in that second example,  R {\displaystyle R} contains no information about the ownership by Ian.

While the 2nd example relation is surjective (see below), the 1st is not.

Oceans and continents (islands omitted) Ocean borders continent  | NA  | SA  | AF  | EU  | AS  | AU  | AA

|
|
|
|
|
|
|

Indian  | 0 | 0 | 1 | 0 | 1 | 1 | 1
Arctic  | 1 | 0 | 0 | 1 | 1 | 0 | 0
Atlantic  | 1 | 1 | 1 | 1 | 0 | 0 | 1
Pacific  | 1 | 1 | 0 | 0 | 1 | 1 | 1
2. Let  A = { Indian , Arctic , Atlantic , Pacific } {\displaystyle A=\\{{\text{Indian}},{\text{Arctic}},{\text{Atlantic}},{\text{Pacific}}\\}} , the oceans of the globe, and  B = { NA , SA , AF , EU , AS , AU , AA } {\displaystyle B=\\{{\text{NA}},{\text{SA}},{\text{AF}},{\text{EU}},{\text{AS}},{\text{AU}},{\text{AA}}\\}} , the continents. Let  a R b {\displaystyle aRb} represent that ocean  a {\displaystyle a} borders continent  b {\displaystyle b} . Then the logical matrix for this relation is:

R = ( 0 0 1 0 1 1 1 1 0 0 1 1 0 0 1 1 1 1 0 0 1 1 1 0 0 1 1 1 ) . {\displaystyle R={\begin{pmatrix}0&0&1&0&1&1&1\\\1&0&0&1&1&0&0\\\1&1&1&1&0&0&1\\\1&1&0&0&1&1&1\end{pmatrix}}.}
The connectivity of the planet Earth can be viewed through  R R T {\displaystyle RR^{\mathsf {T}}} and  R T R {\displaystyle R^{\mathsf {T}}R} , the former being a  4 × 4 {\displaystyle 4\times 4} relation on  A {\displaystyle A} , which is the universal relation ( A × A {\displaystyle A\times A} or a logical matrix of all ones). This universal relation reflects the fact that every ocean is separated from the others by at most one continent. On the other hand,  R T R {\displaystyle R^{\mathsf {T}}R} is a relation on  B × B {\displaystyle B\times B} which fails to be universal because at least two oceans must be traversed to voyage from Europe to Australia.
3. Visualization of relations leans on graph theory: For relations on a set (homogeneous relations), a directed graph illustrates a relation and a graph a symmetric relation. For heterogeneous relations a hypergraph has edges possibly with more than two nodes, and can be illustrated by a bipartite graph. Just as the clique is integral to relations on a set, so bicliques are used to describe heterogeneous relations; indeed, they are the "concepts" that generate a lattice associated with a relation. The various  t {\displaystyle t} axes represent time for observers in motion, the corresponding  x {\displaystyle x} axes are their lines of simultaneity.
4. Hyperbolic orthogonality: Time and space are different categories, and temporal properties are separate from spatial properties. The idea of simultaneous events is simple in absolute time and space since each time  t {\displaystyle t} determines a simultaneous hyperplane in that cosmology. Hermann Minkowski changed that when he articulated the notion of relative simultaneity, which exists when spatial events are "normal" to a time characterized by a velocity. He used an indefinite inner product, and specified that a time vector is normal to a space vector when that product is zero. The indefinite inner product in a composition algebra is given by

⟨ x , z ⟩ = x z ¯ + x ¯ z {\displaystyle \langle x,z\rangle =x{\bar {z}}+{\bar {x}}z\;} where the overbar denotes conjugation.
As a relation between some temporal events and some spatial events, hyperbolic orthogonality (as found in split-complex numbers) is a heterogeneous relation.[21]
5. A geometric configuration can be considered a relation between its points and its lines. The relation is expressed as incidence. Finite and infinite projective and affine planes are included. Jakob Steiner pioneered the cataloguing of configurations with the Steiner systems S ⁡ ( t , k , n ) {\displaystyle \operatorname {S} (t,k,n)} which have an n-element set  S {\displaystyle \operatorname {S} } and a set of k-element subsets called blocks, such that a subset with  t {\displaystyle t} elements lies in just one block. These incidence structures have been generalized with block designs. The incidence matrix used in these geometrical contexts corresponds to the logical matrix used generally with binary relations.

An incidence structure is a triple  D = ( V , B , I ) {\displaystyle \mathbf {D} =(V,\mathbf {B} ,I)} where  V {\displaystyle V} and  B {\displaystyle \mathbf {B} } are any two disjoint sets and  I {\displaystyle I} is a binary relation between  V {\displaystyle V} and  B {\displaystyle \mathbf {B} } , i.e.  I ⊆ V × B . {\displaystyle I\subseteq V\times \mathbf {B} .} The elements of  V {\displaystyle V} will be called points, those of  B {\displaystyle \mathbf {B} } blocks, and those of  I {\displaystyle I} flags.[22]

## Types of binary relations

[edit]

Examples of four types of binary relations over the real numbers: one-to-one (in green), one-to-many (in blue), many-to-one (in red), many-to-many (in black).

Some important types of binary relations  R {\displaystyle R} over sets  X {\displaystyle X} and  Y {\displaystyle Y} are listed below.

Uniqueness properties:

* Injective[23] (also called left-unique[24]): for all  x , y ∈ X {\displaystyle x,y\in X} and all  z ∈ Y , {\displaystyle z\in Y,} if  x R z {\displaystyle xRz} and  y R z {\displaystyle yRz} then  x = y {\displaystyle x=y} . In other words, every element of the codomain has at most one preimage element. For such a relation,  Y {\displaystyle Y} is called a primary key of  R {\displaystyle R} .[2] For example, the green and blue binary relations in the diagram are injective, but the red one is not (as it relates both  − 1 {\displaystyle -1} and  1 {\displaystyle 1} to  1 {\displaystyle 1} ), nor the black one (as it relates both  − 1 {\displaystyle -1} and  1 {\displaystyle 1} to  0 {\displaystyle 0} ).
* Functional[23][25][26] (also called right-unique[24] or univalent[27]): for all  x ∈ X {\displaystyle x\in X} and all  y , z ∈ Y , {\displaystyle y,z\in Y,} if  x R y {\displaystyle xRy} and  x R z {\displaystyle xRz} then  y = z {\displaystyle y=z} . In other words, every element of the domain has at most one image element. Such a binary relation is called a partial function or partial mapping.[28] For such a relation,  { X } {\displaystyle \\{X\\}} is called a primary key of  R {\displaystyle R} .[2] For example, the red and green binary relations in the diagram are functional, but the blue one is not (as it relates  1 {\displaystyle 1} to both  1 {\displaystyle 1} and  − 1 {\displaystyle -1} ), nor the black one (as it relates  0 {\displaystyle 0} to both  − 1 {\displaystyle -1} and  1 {\displaystyle 1} ).
* One-to-one: injective and functional. For example, the green binary relation in the diagram is one-to-one, but the red, blue and black ones are not.
* One-to-many: injective and not functional. For example, the blue binary relation in the diagram is one-to-many, but the red, green and black ones are not.
* Many-to-one: functional and not injective. For example, the red binary relation in the diagram is many-to-one, but the green, blue and black ones are not.
* Many-to-many: not injective nor functional. For example, the black binary relation in the diagram is many-to-many, but the red, green and blue ones are not.

Totality properties (only definable if the domain  X {\displaystyle X} and codomain  Y {\displaystyle Y} are specified):

* Total[23] (also called left-total[24]): for all  x ∈ X {\displaystyle x\in X} there exists a  y ∈ Y {\displaystyle y\in Y} such that  x R y {\displaystyle xRy} . In other words, every element of the domain has at least one image element. In other words, the domain of definition of  R {\displaystyle R} is equal to  X {\displaystyle X} . This property, is different from the definition of connected (also called total by some authors)[citation needed] in Properties. Such a binary relation is called a multivalued function. For example, the red and green binary relations in the diagram are total, but the blue one is not (as it does not relate  − 1 {\displaystyle -1} to any real number), nor the black one (as it does not relate  2 {\displaystyle 2} to any real number). As another example,  > {\displaystyle >} is a total relation over the integers. But it is not a total relation over the positive integers, because there is no  y {\displaystyle y} in the positive integers such that  1 > y {\displaystyle 1>y} .[29] However,  < {\displaystyle <} is a total relation over the positive integers, the rational numbers and the real numbers. Every reflexive relation is total: for a given  x {\displaystyle x} , choose  y = x {\displaystyle y=x} .
* Surjective[23] (also called right-total[24]): for all  y ∈ Y {\displaystyle y\in Y} , there exists an  x ∈ X {\displaystyle x\in X} such that  x R y {\displaystyle xRy} . In other words, every element of the codomain has at least one preimage element. In other words, the codomain of definition of  R {\displaystyle R} is equal to  Y {\displaystyle Y} . For example, the green and blue binary relations in the diagram are surjective, but the red one is not (as it does not relate any real number to  − 1 {\displaystyle -1} ), nor the black one (as it does not relate any real number to  2 {\displaystyle 2} ).

Uniqueness and totality properties (only definable if the domain  X {\displaystyle X} and codomain  Y {\displaystyle Y} are specified):

* A function (also called mapping[24]): a binary relation that is functional and total. In other words, every element of the domain has exactly one image element. For example, the red and green binary relations in the diagram are functions, but the blue and black ones are not.
* An injection: a function that is injective. For example, the green relation in the diagram is an injection, but the red one is not; the black and the blue relation is not even a function.
* A surjection: a function that is surjective. For example, the green relation in the diagram is a surjection, but the red one is not.
* A bijection: a function that is injective and surjective. In other words, every element of the domain has exactly one image element and every element of the codomain has exactly one preimage element. For example, the green binary relation in the diagram is a bijection, but the red one is not.

If relations over proper classes are allowed:

* Set-like (also called local): for all  x ∈ X {\displaystyle x\in X} , the class of all  y ∈ Y {\displaystyle y\in Y} such that  y R x {\displaystyle yRx} , i.e.  { y ∈ Y , y R x } {\displaystyle \\{y\in Y,yRx\\}} , is a set. For example, the relation  ∈ {\displaystyle \in } is set-like, and every relation on two sets is set-like.[30] The usual ordering < over the class of ordinal numbers is a set-like relation, while its inverse > is not.[citation needed]

## Sets versus classes

[edit]

Certain mathematical "relations", such as "equal to", "subset of", and "member of", cannot be understood to be binary relations as defined above, because their domains and codomains cannot be taken to be sets in the usual systems of axiomatic set theory. For example, to model the general concept of "equality" as a binary relation  = {\displaystyle =} , take the domain and codomain to be the "class of all sets", which is not a set in the usual set theory.

In most mathematical contexts, references to the relations of equality, membership and subset are harmless because they can be understood implicitly to be restricted to some set in the context. The usual work-around to this problem is to select a "large enough" set  A {\displaystyle A} , that contains all the objects of interest, and work with the restriction  = A {\displaystyle =_{A}} instead of  = {\displaystyle =} . Similarly, the "subset of" relation  ⊆ {\displaystyle \subseteq } needs to be restricted to have domain and codomain  P ( A ) {\displaystyle P(A)} (the power set of a specific set  A {\displaystyle A} ): the resulting set relation can be denoted by  ⊆ A . {\displaystyle \subseteq _{A}.} Also, the "member of" relation needs to be restricted to have domain  A {\displaystyle A} and codomain  P ( A ) {\displaystyle P(A)} to obtain a binary relation  ∈ A {\displaystyle \in _{A}} that is a set. Bertrand Russell has shown that assuming  ∈ {\displaystyle \in } to be defined over all sets leads to a contradiction in naive set theory, see Russell's paradox.

Another solution to this problem is to use a set theory with proper classes, such as NBG or Morse–Kelley set theory, and allow the domain and codomain (and so the graph) to be proper classes: in such a theory, equality, membership, and subset are binary relations without special comment. (A minor modification needs to be made to the concept of the ordered triple  ( X , Y , G ) {\displaystyle (X,Y,G)} , as normally a proper class cannot be a member of an ordered tuple; or of course one can identify the binary relation with its graph in this context.)[31] With this definition one can for instance define a binary relation over every set and its power set.

## Homogeneous relation

[edit]

Main article: Homogeneous relation

A homogeneous relation over a set  X {\displaystyle X} is a binary relation over  X {\displaystyle X} and itself, i.e. it is a subset of the Cartesian product  X × X . {\displaystyle X\times X.} [14][32][33] It is also simply called a (binary) relation over  X {\displaystyle X} .

A homogeneous relation  R {\displaystyle R} over a set  X {\displaystyle X} may be identified with a directed simple graph permitting loops, where  X {\displaystyle X} is the vertex set and  R {\displaystyle R} is the edge set (there is an edge from a vertex  x {\displaystyle x} to a vertex  y {\displaystyle y} if and only if  x R y {\displaystyle xRy} ). The set of all homogeneous relations  B ( X ) {\displaystyle {\mathcal {B}}(X)} over a set  X {\displaystyle X} is the power set 2 X × X {\displaystyle 2^{X\times X}} which is a Boolean algebra augmented with the involution of mapping of a relation to its converse relation. Considering composition of relations as a binary operation on  B ( X ) {\displaystyle {\mathcal {B}}(X)} , it forms a semigroup with involution.

Some important properties that a homogeneous relation  R {\displaystyle R} over a set  X {\displaystyle X} may have are:

* Reflexive: for all  x ∈ X , {\displaystyle x\in X,} x R x {\displaystyle xRx} . For example,  ≥ {\displaystyle \geq } is a reflexive relation but > is not.
* Irreflexive: for all  x ∈ X , {\displaystyle x\in X,} not  x R x {\displaystyle xRx} . For example,  > {\displaystyle >} is an irreflexive relation, but  ≥ {\displaystyle \geq } is not.
* Symmetric: for all  x , y ∈ X , {\displaystyle x,y\in X,} if  x R y {\displaystyle xRy} then  y R x {\displaystyle yRx} . For example, "is a blood relative of" is a symmetric relation.
* Antisymmetric: for all  x , y ∈ X , {\displaystyle x,y\in X,} if  x R y {\displaystyle xRy} and  y R x {\displaystyle yRx} then  x = y . {\displaystyle x=y.} For example,  ≥ {\displaystyle \geq } is an antisymmetric relation.[34]
* Asymmetric: for all  x , y ∈ X , {\displaystyle x,y\in X,} if  x R y {\displaystyle xRy} then not  y R x {\displaystyle yRx} . A relation is asymmetric if and only if it is both antisymmetric and irreflexive.[35] For example, > is an asymmetric relation, but  ≥ {\displaystyle \geq } is not.
* Transitive: for all  x , y , z ∈ X , {\displaystyle x,y,z\in X,} if  x R y {\displaystyle xRy} and  y R z {\displaystyle yRz} then  x R z {\displaystyle xRz} . A transitive relation is irreflexive if and only if it is asymmetric.[36] For example, "is ancestor of" is a transitive relation, while "is parent of" is not.
* Connected: for all  x , y ∈ X , {\displaystyle x,y\in X,} if  x ≠ y {\displaystyle x\neq y} then  x R y {\displaystyle xRy} or  y R x {\displaystyle yRx} .
* Strongly connected: for all  x , y ∈ X , {\displaystyle x,y\in X,} x R y {\displaystyle xRy} or  y R x {\displaystyle yRx} .
* Dense: for all  x , y ∈ X , {\displaystyle x,y\in X,} if  x R y , {\displaystyle xRy,} then some  z ∈ X {\displaystyle z\in X} exists such that  x R z {\displaystyle xRz} and  z R y {\displaystyle zRy} .

A partial order is a relation that is reflexive, antisymmetric, and transitive. A strict partial order is a relation that is irreflexive, asymmetric, and transitive. A total order is a relation that is reflexive, antisymmetric, transitive and connected.[37] A strict total order is a relation that is irreflexive, asymmetric, transitive and connected. An equivalence relation is a relation that is reflexive, symmetric, and transitive. For example, " x {\displaystyle x} divides  y {\displaystyle y} " is a partial, but not a total order on natural numbers N , {\displaystyle \mathbb {N} ,} " x < y {\displaystyle x<y} " is a strict total order on  N , {\displaystyle \mathbb {N} ,} and " x {\displaystyle x} is parallel to  y {\displaystyle y} " is an equivalence relation on the set of all lines in the Euclidean plane.

All operations defined in section § Operations also apply to homogeneous relations. Beyond that, a homogeneous relation over a set  X {\displaystyle X} may be subjected to closure operations like:

Reflexive closure
the smallest reflexive relation over  X {\displaystyle X} containing  R {\displaystyle R} ,
Transitive closure
the smallest transitive relation over  X {\displaystyle X} containing  R {\displaystyle R} ,
Equivalence closure
the smallest equivalence relation over  X {\displaystyle X} containing  R {\displaystyle R} .

## Calculus of relations

[edit]

Developments in algebraic logic have facilitated usage of binary relations. The calculus of relations includes the algebra of sets, extended by composition of relations and the use of converse relations. The inclusion  R ⊆ S , {\displaystyle R\subseteq S,} meaning that  a R b {\displaystyle aRb} implies  a S b {\displaystyle aSb} , sets the scene in a lattice of relations. But since  P ⊆ Q ≡ ( P ∩ Q ¯ = ∅ ) ≡ ( P ∩ Q = P ) , {\displaystyle P\subseteq Q\equiv (P\cap {\bar {Q}}=\varnothing )\equiv (P\cap Q=P),} the inclusion symbol is superfluous. Nevertheless, composition of relations and manipulation of the operators according to Schröder rules, provides a calculus to work in the power set of  A × B . {\displaystyle A\times B.}

In contrast to homogeneous relations, the composition of relations operation is only a partial function. The necessity of matching target to source of composed relations has led to the suggestion that the study of heterogeneous relations is a chapter of category theory as in the category of sets, except that the morphisms of this category are relations. The objects of the category Rel are sets, and the relation-morphisms compose as required in a category.[citation needed]

## Induced concept lattice

[edit]

Binary relations have been described through their induced concept lattices: A concept C ⊂ R {\displaystyle C\subset R} satisfies two properties:

* The logical matrix of  C {\displaystyle C} is the outer product of logical vectors  C i j = u i v j , u , v {\displaystyle C_{ij}=u_{i}v_{j},\quad u,v} logical vectors.[clarification needed]
* C {\displaystyle C} is maximal, not contained in any other outer product. Thus  C {\displaystyle C} is described as a non-enlargeable rectangle.

For a given relation  R ⊆ X × Y , {\displaystyle R\subseteq X\times Y,} the set of concepts, enlarged by their joins and meets, forms an "induced lattice of concepts", with inclusion  ⊑ {\displaystyle \sqsubseteq } forming a preorder.

The MacNeille completion theorem (1937) (that any partial order may be embedded in a complete lattice) is cited in a 2013 survey article "Decomposition of relations on concept lattices".[38] The decomposition is

R = f E g T {\displaystyle R=fEg^{\textsf {T}}} , where  f {\displaystyle f} and  g {\displaystyle g} are functions, called mappings or left-total, functional relations in this context. The "induced concept lattice is isomorphic to the cut completion of the partial order  E {\displaystyle E} that belongs to the minimal decomposition  ( f , g , E ) {\displaystyle (f,g,E)} of the relation  R {\displaystyle R} ."

Particular cases are considered below:  E {\displaystyle E} total order corresponds to Ferrers type, and  E {\displaystyle E} identity corresponds to difunctional, a generalization of equivalence relation on a set.

Relations may be ranked by the Schein rank which counts the number of concepts necessary to cover a relation.[39] Structural analysis of relations with concepts provides an approach for data mining.[40]

## Particular relations

[edit]

* Proposition: If  R {\displaystyle R} is a surjective relation and  R T {\displaystyle R^{\mathsf {T}}} is its transpose, then  I ⊆ R T R {\displaystyle I\subseteq R^{\textsf {T}}R} where  I {\displaystyle I} is the  m × m {\displaystyle m\times m} identity relation.
* Proposition: If  R {\displaystyle R} is a serial relation, then  I ⊆ R R T {\displaystyle I\subseteq RR^{\textsf {T}}} where  I {\displaystyle I} is the  n × n {\displaystyle n\times n} identity relation.

### Difunctional

[edit]

The idea of a difunctional relation is to partition objects by distinguishing attributes, as a generalization of the concept of an equivalence relation. One way this can be done is with an intervening set  Z = { x , y , z , … } {\displaystyle Z=\\{x,y,z,\ldots \\}} of indicators. The partitioning relation  R = F G T {\displaystyle R=FG^{\textsf {T}}} is a composition of relations using functional relations  F ⊆ A × Z  and  G ⊆ B × Z . {\displaystyle F\subseteq A\times Z{\text{ and }}G\subseteq B\times Z.} Jacques Riguet named these relations difunctional since the composition  F G T {\displaystyle FG^{\mathsf {T}}} involves functional relations, commonly called partial functions.

In 1950 Riguet showed that such relations satisfy the inclusion:[41]

R R T R ⊆ R {\displaystyle RR^{\textsf {T}}R\subseteq R}

In automata theory, the term rectangular relation has also been used to denote a difunctional relation. This terminology recalls the fact that, when represented as a logical matrix, the columns and rows of a difunctional relation can be arranged as a block matrix with rectangular blocks of ones on the (asymmetric) main diagonal.[42] More formally, a relation  R {\displaystyle R} on  X × Y {\displaystyle X\times Y} is difunctional if and only if it can be written as the union of Cartesian products  A i × B i {\displaystyle A_{i}\times B_{i}} , where the  A i {\displaystyle A_{i}} are a partition of a subset of  X {\displaystyle X} and the  B i {\displaystyle B_{i}} likewise a partition of a subset of  Y {\displaystyle Y} .[43]

Using the notation  { y ∣ x R y } = x R {\displaystyle \\{y\mid xRy\\}=xR} , a difunctional relation can also be characterized as a relation  R {\displaystyle R} such that wherever  x 1 R {\displaystyle x_{1}R} and  x 2 R {\displaystyle x_{2}R} have a non-empty intersection, then these two sets coincide; formally  x 1 ∩ x 2 ≠ ∅ {\displaystyle x_{1}\cap x_{2}\neq \varnothing } implies  x 1 R = x 2 R . {\displaystyle x_{1}R=x_{2}R.} [44]

In 1997 researchers found "utility of binary decomposition based on difunctional dependencies in database management."[45] Furthermore, difunctional relations are fundamental in the study of bisimulations.[46]

In the context of homogeneous relations, a partial equivalence relation is difunctional.

### Ferrers type

[edit]

A strict order on a set is a homogeneous relation arising in order theory. In 1951 Jacques Riguet adopted the ordering of an integer partition, called a Ferrers diagram, to extend ordering to binary relations in general.[47]

The corresponding logical matrix of a general binary relation has rows which finish with a sequence of ones. Thus the dots of a Ferrer's diagram are changed to ones and aligned on the right in the matrix.

An algebraic statement required for a Ferrers type relation R is  R R ¯ T R ⊆ R . {\displaystyle R{\bar {R}}^{\textsf {T}}R\subseteq R.}

If any one of the relations  R , R ¯ , R T {\displaystyle R,{\bar {R}},R^{\textsf {T}}} is of Ferrers type, then all of them are. [48]

### Contact

[edit]

Suppose  B {\displaystyle B} is the power set of  A {\displaystyle A} , the set of all subsets of  A {\displaystyle A} . Then a relation  g {\displaystyle g} is a contact relation if it satisfies three properties:

1. for all  x ∈ A , Y = { x }  implies  x g Y . {\displaystyle {\text{for all }}x\in A,Y=\\{x\\}{\text{ implies }}xgY.}
2. Y ⊆ Z  and  x g Y  implies  x g Z . {\displaystyle Y\subseteq Z{\text{ and }}xgY{\text{ implies }}xgZ.}
3. for all  y ∈ Y , y g Z  and  x g Y  implies  x g Z . {\displaystyle {\text{for all }}y\in Y,ygZ{\text{ and }}xgY{\text{ implies }}xgZ.}

The set membership relation,  ϵ = {\displaystyle \epsilon =} "is an element of", satisfies these properties so  ϵ {\displaystyle \epsilon } is a contact relation. The notion of a general contact relation was introduced by Georg Aumann in 1970.[49][50]

In terms of the calculus of relations, sufficient conditions for a contact relation include  C T C ¯ ⊆∋ C ¯ ≡ C ∋ C ¯ ¯ ⊆ C , {\displaystyle C^{\textsf {T}}{\bar {C}}\subseteq \ni {\bar {C}}\equiv C{\overline {\ni {\bar {C}}}}\subseteq C,} where  ∋ {\displaystyle \ni } is the converse of set membership ( ∈ {\displaystyle \in } ).[51]: 280

## Preorder R\R

[edit]

Every relation  R {\displaystyle R} generates a preorder R ∖ R {\displaystyle R\backslash R} which is the left residual.[52] In terms of converse and complements,  R ∖ R ≡ R T R ¯ ¯ . {\displaystyle R\backslash R\equiv {\overline {R^{\textsf {T}}{\bar {R}}}}.} Forming the diagonal of  R T R ¯ {\displaystyle R^{\textsf {T}}{\bar {R}}} , the corresponding row of  R T {\displaystyle R^{\textsf {T}}} and column of  R ¯ {\displaystyle {\bar {R}}} will be of opposite logical values, so the diagonal is all zeros. Then

R T R ¯ ⊆ I ¯ ⟹ I ⊆ R T R ¯ ¯ = R ∖ R {\displaystyle R^{\textsf {T}}{\bar {R}}\subseteq {\bar {I}}\implies I\subseteq {\overline {R^{\textsf {T}}{\bar {R}}}}=R\backslash R} , so that  R ∖ R {\displaystyle R\backslash R} is a reflexive relation.

To show transitivity, one requires that  ( R ∖ R ) ( R ∖ R ) ⊆ R ∖ R . {\displaystyle (R\backslash R)(R\backslash R)\subseteq R\backslash R.} Recall that  X = R ∖ R {\displaystyle X=R\backslash R} is the largest relation such that  R X ⊆ R . {\displaystyle RX\subseteq R.} Then

R ( R ∖ R ) ⊆ R {\displaystyle R(R\backslash R)\subseteq R}
R ( R ∖ R ) ( R ∖ R ) ⊆ R {\displaystyle R(R\backslash R)(R\backslash R)\subseteq R} (repeat)
≡ R T R ¯ ⊆ ( R ∖ R ) ( R ∖ R ) ¯ {\displaystyle \equiv R^{\textsf {T}}{\bar {R}}\subseteq {\overline {(R\backslash R)(R\backslash R)}}} (Schröder's rule)
≡ ( R ∖ R ) ( R ∖ R ) ⊆ R T R ¯ ¯ {\displaystyle \equiv (R\backslash R)(R\backslash R)\subseteq {\overline {R^{\textsf {T}}{\bar {R}}}}} (complementation)
≡ ( R ∖ R ) ( R ∖ R ) ⊆ R ∖ R . {\displaystyle \equiv (R\backslash R)(R\backslash R)\subseteq R\backslash R.} (definition)

The inclusion relation Ω on the power set of  U {\displaystyle U} can be obtained in this way from the membership relation ∈ {\displaystyle \in } on subsets of  U {\displaystyle U} :

Ω = ∋ ∈ ¯ ¯ =∈ ∖ ∈ . {\displaystyle \Omega ={\overline {\ni {\bar {\in }}}}=\in \backslash \in .} [51]: 283

## Fringe of a relation

[edit]

Given a relation  R {\displaystyle R} , its fringe is the sub-relation defined as  fringe ⁡ ( R ) = R ∩ R R ¯ T R ¯ . {\displaystyle \operatorname {fringe} (R)=R\cap {\overline {R{\bar {R}}^{\textsf {T}}R}}.}

When  R {\displaystyle R} is a partial identity relation, difunctional, or a block diagonal relation, then  fringe ⁡ ( R ) = R {\displaystyle \operatorname {fringe} (R)=R} . Otherwise the  fringe {\displaystyle \operatorname {fringe} } operator selects a boundary sub-relation described in terms of its logical matrix:  fringe ⁡ ( R ) {\displaystyle \operatorname {fringe} (R)} is the side diagonal if  R {\displaystyle R} is an upper right triangular linear order or strict order.  fringe ⁡ ( R ) {\displaystyle \operatorname {fringe} (R)} is the block fringe if  R {\displaystyle R} is irreflexive ( R ⊆ I ¯ {\displaystyle R\subseteq {\bar {I}}} ) or upper right block triangular.  fringe ⁡ ( R ) {\displaystyle \operatorname {fringe} (R)} is a sequence of boundary rectangles when  R {\displaystyle R} is of Ferrers type.

On the other hand,  fringe ⁡ ( R ) = ∅ {\displaystyle \operatorname {fringe} (R)=\emptyset } when  R {\displaystyle R} is a dense, linear, strict order.[51]

## Mathematical heaps

[edit]

Main article: Heap (mathematics)

Given two sets  A {\displaystyle A} and  B {\displaystyle B} , the set of binary relations between them  B ( A , B ) {\displaystyle {\mathcal {B}}(A,B)} can be equipped with a ternary operation [ a , b , c ] = a b T c {\displaystyle [a,b,c]=ab^{\textsf {T}}c} where  b T {\displaystyle b^{\mathsf {T}}} denotes the converse relation of  b {\displaystyle b} . In 1953 Viktor Wagner used properties of this ternary operation to define semiheaps, heaps, and generalized heaps.[53][54] The contrast of heterogeneous and homogeneous relations is highlighted by these definitions:

> There is a pleasant symmetry in Wagner's work between heaps, semiheaps, and generalised heaps on the one hand, and groups, semigroups, and generalised groups on the other. Essentially, the various types of semiheaps appear whenever we consider binary relations (and partial one-one mappings) between different sets  A {\displaystyle A} and  B {\displaystyle B} , while the various types of semigroups appear in the case where  A = B {\displaystyle A=B} .

> — Christopher Hollings, "Mathematics across the Iron Curtain: a history of the algebraic theory of semigroups"[55]

## See also

[edit]

* Abstract rewriting system
* Additive relation, a many-valued homomorphism between modules
* Allegory (category theory)
* Category of relations, a category having sets as objects and binary relations as morphisms
* Confluence (term rewriting), discusses several unusual but fundamental properties of binary relations
* Correspondence (algebraic geometry), a binary relation defined by algebraic equations
* Hasse diagram, a graphic means to display an order relation
* Incidence structure, a heterogeneous relation between set of points and lines
* Logic of relatives, a theory of relations by Charles Sanders Peirce
* Order theory, investigates properties of order relations

## Notes

[edit]

1. ^ Authors who deal with binary relations only as a special case of  n {\displaystyle n} -ary relations for arbitrary  n {\displaystyle n} usually write  R x y {\displaystyle Rxy} as a special case of  R x 1 … x n {\displaystyle Rx_{1}\dots x_{n}} (prefix notation).[8]

## References

[edit]

1. ^ Meyer, Albert (17 November 2021). "MIT 6.042J Math for Computer Science, Lecture 3T, Slide 2" (PDF). Archived (PDF) from the original on 2021-11-17.
2. ^ a b c d e f g h Codd, Edgar Frank (June 1970). "A Relational Model of Data for Large Shared Data Banks" (PDF). Communications of the ACM. 13 (6): 377–387\. doi:10.1145/362384.362685. S2CID 207549016. Archived (PDF) from the original on 2004-09-08. Retrieved 2020-04-29.
3. ^ "Relation definition – Math Insight". mathinsight.org. Retrieved 2019-12-11.
4. ^ Enderton 1977, Ch 3. pg. 40
5. ^ Ernst Schröder (1895) Algebra und Logic der Relative, via Internet Archive
6. ^ C. I. Lewis (1918) A Survey of Symbolic Logic, pages 269–279, via internet Archive
7. ^ Gunther Schmidt, 2010. Relational Mathematics. Cambridge University Press, ISBN 978-0-521-76268-7, Chapt. 5
8. ^ Hans Hermes (1973). Introduction to Mathematical Logic. Hochschultext (Springer-Verlag). London: Springer. ISBN 3540058192. ISSN 1431-4657. Sect.II.§1.1.4
9. ^ Suppes, Patrick (1972) [originally published by D. van Nostrand Company in 1960]. Axiomatic Set Theory. Dover. ISBN 0-486-61630-4.
10. ^ Smullyan, Raymond M.; Fitting, Melvin (2010) [revised and corrected republication of the work originally published in 1996 by Oxford University Press, New York]. Set Theory and the Continuum Problem. Dover. ISBN 978-0-486-47484-7.
11. ^ Levy, Azriel (2002) [republication of the work published by Springer-Verlag, Berlin, Heidelberg and New York in 1979]. Basic Set Theory. Dover. ISBN 0-486-42079-5.
12. ^ Schmidt, Gunther; Ströhlein, Thomas (2012). Relations and Graphs: Discrete Mathematics for Computer Scientists. Springer Science & Business Media. Definition 4.1.1. ISBN 978-3-642-77968-8.
13. ^ Christodoulos A. Floudas; Panos M. Pardalos (2008). Encyclopedia of Optimization (2nd ed.). Springer Science & Business Media. pp. 299–300\. ISBN 978-0-387-74758-3.
14. ^ a b c Michael Winter (2007). Goguen Categories: A Categorical Approach to L-fuzzy Relations. Springer. pp. x–xi. ISBN 978-1-4020-6164-6.
15. ^ G. Schmidt, Claudia Haltensperger, and Michael Winter (1997) "Heterogeneous relation algebra", chapter 3 (pages 37 to 53) in Relational Methods in Computer Science, Advances in Computer Science, Springer books ISBN 3-211-82971-7
16. ^ Jacobson, Nathan (2009), Basic Algebra II (2nd ed.) § 2.1.
17. ^ Garrett Birkhoff & Thomas Bartee (1970) Modern Applied Algebra, page 35, McGraw-Hill
18. ^ Mary P. Dolciani (1962) Modern Algebra: Structure and Method, Book 2, page 339, Houghton Mifflin
19. ^ John C. Baez (6 Nov 2001). "quantum mechanics over a commutative rig". Newsgroup: sci.physics.research. Usenet: 9s87n0$iv5@gap.cco.caltech.edu. Retrieved November 25, 2018.
20. ^ Droste, M., & Kuich, W. (2009). Semirings and Formal Power Series. Handbook of Weighted Automata, 3–28. doi:10.1007/978-3-642-01492-5_1, pp. 7-10
21. ^ Relative simultaneity at Wikibooks
22. ^ Beth, Thomas; Jungnickel, Dieter; Lenz, Hanfried (1986). Design Theory. Cambridge University Press. p. 15.. 2nd ed. (1999) ISBN 978-0-521-44432-3
23. ^ a b c d Van Gasteren 1990, p. 45.
24. ^ a b c d e Kilp, Knauer, Mikhalev 2000, p. 3.
25. ^ "Functional relation - Encyclopedia of Mathematics". encyclopediaofmath.org. Retrieved 2024-06-13.
26. ^ "functional relation in nLab". ncatlab.org. Retrieved 2024-06-13.
27. ^ Schmidt 2010, p. 49.
28. ^ Kilp, Knauer, Mikhalev 2000, p. 4.
29. ^ Yao, Y.Y.; Wong, S.K.M. (1995). "Generalization of rough sets using relationships between attribute values" (PDF). Proceedings of the 2nd Annual Joint Conference on Information Sciences: 30–33..
30. ^ Kunen, Kenneth (1980). Set theory: an introduction to independence proofs. North-Holland. p. 102\. ISBN 0-444-85401-0. Zbl 0443.03021.
31. ^ Tarski, Alfred; Givant, Steven (1987). A formalization of set theory without variables. American Mathematical Society. p. 3. ISBN 0-8218-1041-3.
32. ^ M. E. Müller (2012). Relational Knowledge Discovery. Cambridge University Press. p. 22\. ISBN 978-0-521-19021-3.
33. ^ Peter J. Pahl; Rudolf Damrath (2001). Mathematical Foundations of Computational Engineering: A Handbook. Springer Science & Business Media. p. 496\. ISBN 978-3-540-67995-0.
34. ^ Smith, Douglas; Eggen, Maurice; St. Andre, Richard (2006), A Transition to Advanced Mathematics (6th ed.), Brooks/Cole, p. 160, ISBN 0-534-39900-2
35. ^ Nievergelt, Yves (2002), Foundations of Logic and Mathematics: Applications to Computer Science and Cryptography, Springer-Verlag, p. 158.
36. ^ Flaška, V.; Ježek, J.; Kepka, T.; Kortelainen, J. (2007). Transitive Closures of Binary Relations I (PDF). Prague: School of Mathematics – Physics Charles University. p. 1\. Archived from the original (PDF) on 2013-11-02. Lemma 1.1 (iv). This source refers to asymmetric relations as "strictly antisymmetric".
37. ^ Joseph G. Rosenstein, Linear orderings, Academic Press, 1982, ISBN 0-12-597680-1, p. 4
38. ^ R. Berghammer & M. Winter (2013) "Decomposition of relations on concept lattices", Fundamenta Informaticae 126(1): 37–82 doi:10.3233/FI-2013-871
39. ^ Ki-Hang Kim (1982) Boolean Matrix Theory and Applications, page 37, Marcel Dekker ISBN 0-8247-1788-0
40. ^ Ali Jaoua, Rehab Duwairi, Samir Elloumi, and Sadok Ben Yahia (2009) "Data mining, reasoning and incremental information retrieval through non enlargeable rectangular relation coverage", pages 199 to 210 in Relations and Kleene algebras in computer science, Lecture Notes in Computer Science 5827, Springer MR2781235
41. ^ Riguet, Jacques (January 1950). "Quelques proprietes des relations difonctionelles". Comptes rendus (in French). 230: 1999–2000.
42. ^ Julius Richard Büchi (1989). Finite Automata, Their Algebras and Grammars: Towards a Theory of Formal Expressions. Springer Science & Business Media. pp. 35–37\. ISBN 978-1-4613-8853-1.
43. ^ East, James; Vernitski, Alexei (February 2018). "Ranks of ideals in inverse semigroups of difunctional binary relations". Semigroup Forum. 96 (1): 21–30\. arXiv:1612.04935. doi:10.1007/s00233-017-9846-9. S2CID 54527913.
44. ^ Chris Brink; Wolfram Kahl; Gunther Schmidt (1997). Relational Methods in Computer Science. Springer Science & Business Media. p. 200\. ISBN 978-3-211-82971-4.
45. ^ Ali Jaoua, Nadin Belkhiter, Habib Ounalli, and Theodore Moukam (1997) "Databases", pages 197–210 in Relational Methods in Computer Science, edited by Chris Brink, Wolfram Kahl, and Gunther Schmidt, Springer Science & Business Media ISBN 978-3-211-82971-4
46. ^ Gumm, H. P.; Zarrad, M. (2014). "Coalgebraic Simulations and Congruences". Coalgebraic Methods in Computer Science. Lecture Notes in Computer Science. Vol. 8446\. p. 118\. doi:10.1007/978-3-662-44124-4_7. ISBN 978-3-662-44123-7.
47. ^ J. Riguet (1951) "Les relations de Ferrers", Comptes Rendus 232: 1729,30
48. ^ Schmidt, Gunther; Ströhlein, Thomas (2012). Relations and Graphs: Discrete Mathematics for Computer Scientists. Springer Science & Business Media. p. 77\. ISBN 978-3-642-77968-8.
49. ^ Georg Aumann (1971). "Kontakt-Relationen". Sitzungsberichte der mathematisch-physikalischen Klasse der Bayerischen Akademie der Wissenschaften München. 1970 (II): 67–77.
50. ^ Anne K. Steiner (1970) Review:Kontakt-Relationen from Mathematical Reviews
51. ^ a b c Gunther Schmidt (2011) Relational Mathematics, pages 211−15, Cambridge University Press ISBN 978-0-521-76268-7
52. ^ In this context, the symbol  ∖ {\displaystyle \backslash } does not mean "set difference".
53. ^ Viktor Wagner (1953) "The theory of generalised heaps and generalised groups", Matematicheskii Sbornik 32(74): 545 to 632 MR0059267
54. ^ C.D. Hollings & M.V. Lawson (2017) Wagner's Theory of Generalised Heaps, Springer books ISBN 978-3-319-63620-7 MR3729305
55. ^ Christopher Hollings (2014) Mathematics across the Iron Curtain: a history of the algebraic theory of semigroups, page 265, History of Mathematics 41, American Mathematical Society ISBN 978-1-4704-1493-1

## Bibliography

[edit]

* Schmidt, Gunther (2010). Relational Mathematics. Berlin: Cambridge University Press. ISBN 9780511778810.
* Schmidt, Gunther; Ströhlein, Thomas (2012). "Chapter 3: Heterogeneous relations". Relations and Graphs: Discrete Mathematics for Computer Scientists. Springer Science & Business Media. ISBN 978-3-642-77968-8.
* Ernst Schröder (1895) Algebra der Logik, Band III, via Internet Archive
* Codd, Edgar Frank (1990). The Relational Model for Database Management: Version 2 (PDF). Boston: Addison-Wesley. ISBN 978-0201141924. Archived (PDF) from the original on 2022-10-09.
* Enderton, Herbert (1977). Elements of Set Theory. Boston: Academic Press. ISBN 978-0-12-238440-0.
* Kilp, Mati; Knauer, Ulrich; Mikhalev, Alexander (2000). Monoids, Acts and Categories: with Applications to Wreath Products and Graphs. Berlin: De Gruyter. ISBN 978-3-11-015248-7.
* Van Gasteren, Antonetta (1990). On the Shape of Mathematical Arguments. Berlin: Springer. ISBN 9783540528494.
* Peirce, Charles Sanders (1873). "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 (2): 317–178\. Bibcode:1873MAAAS...9..317P. doi:10.2307/25058006. hdl:2027/hvd.32044019561034. JSTOR 25058006. Retrieved 2020-05-05.
* Schmidt, Gunther (2010). Relational Mathematics. Cambridge: Cambridge University Press. ISBN 978-0-521-76268-7.

## External links

[edit]

* "Binary relation", Encyclopedia of Mathematics, EMS Press, 2001 [1994]

* v
* t
* e

Order theory

* Topics
* Glossary
* Category

Key concepts|

* Binary relation
* Boolean algebra
* Cyclic order
* Lattice
* Partial order
* Preorder
* Total order
* Weak ordering

Results|

* Boolean prime ideal theorem
* Cantor–Bernstein theorem
* Cantor's isomorphism theorem
* Dilworth's theorem
* Dushnik–Miller theorem
* Hausdorff maximal principle
* Knaster–Tarski theorem
* Kruskal's tree theorem
* Laver's theorem
* Mirsky's theorem
* Szpilrajn extension theorem
* Zorn's lemma

Properties & Types (list)|

* Antisymmetric
* Asymmetric
* Boolean algebra
* topics
* Completeness
* Connected
* Covering
* Dense
* Directed
* (Partial) Equivalence
* Foundational
* Heyting algebra
* Homogeneous
* Idempotent
* Lattice
* Bounded
* Complemented
* Complete
* Distributive
* Join and meet
* Reflexive
* Partial order
* Chain-complete
* Graded
* Eulerian
* Strict
* Prefix order
* Preorder
* Total
* Semilattice
* Semiorder
* Symmetric
* Total
* Tolerance
* Transitive
* Well-founded
* Well-quasi-ordering (Better)
* (Pre) Well-order

Constructions|

* Composition
* Converse/Transpose
* Lexicographic order
* Linear extension
* Product order
* Reflexive closure
* Series-parallel partial order
* Star product
* Symmetric closure
* Transitive closure

Topology & Orders|

* Alexandrov topology & Specialization preorder
* Ordered topological vector space
* Normal cone
* Order topology
* Order topology
* Topological vector lattice
* Banach
* Fréchet
* Locally convex
* Normed

Related|

* Antichain
* Cofinal
* Cofinality
* Comparability
* Graph
* Duality
* Filter
* Hasse diagram
* Ideal
* Net
* Subnet
* Order morphism
* Embedding
* Isomorphism
* Order type
* Ordered field
* Positive cone of an ordered field
* Ordered vector space
* Partially ordered
* Positive cone of an ordered vector space
* Riesz space
* Partially ordered group
* Positive cone of a partially ordered group
* Upper set
* Young's lattice

* v
* t
* e

Set theory

Overview|

* Set (mathematics)

Axioms|

* Adjunction
* Choice
* countable
* dependent
* global
* Constructibility (V=L)
* Determinacy
* projective
* Extensionality
* Infinity
* Limitation of size
* Pairing
* Power set
* Regularity
* Union
* Martin's axiom

* Axiom schema
* replacement
* specification

Operations|

* Cartesian product
* Complement (i.e. set difference)
* De Morgan's laws
* Disjoint union
* Identities
* Intersection
* Power set
* Symmetric difference
* Union

* Concepts
* Methods

* Almost
* Cardinality
* Cardinal number (large)
* Class
* Constructible universe
* Continuum hypothesis
* Diagonal argument
* Element
* ordered pair
* tuple
* Family
* Forcing
* One-to-one correspondence
* Ordinal number
* Set-builder notation
* Transfinite induction
* Venn diagram

Set types|

* Amorphous
* Countable
* Empty
* Finite (hereditarily)
* Filter
* base
* subbase
* Ultrafilter
* Fuzzy
* Infinite (Dedekind-infinite)
* Recursive
* Singleton
* Subset · Superset
* Transitive
* Uncountable
* Universal

Theories|

* Alternative
* Axiomatic
* Naive
* Cantor's theorem

* Zermelo
* General
* Principia Mathematica
* New Foundations
* Zermelo–Fraenkel
* von Neumann–Bernays–Gödel
* Morse–Kelley
* Kripke–Platek
* Tarski–Grothendieck

* Paradoxes
* Problems

* Russell's paradox
* Suslin's problem
* Burali-Forti paradox

Set theorists|

* Paul Bernays
* Georg Cantor
* Paul Cohen
* Richard Dedekind
* Abraham Fraenkel
* Kurt Gödel
* Thomas Jech
* John von Neumann
* Willard Quine
* Bertrand Russell
* Thoralf Skolem
* Ernst Zermelo

* v
* t
* e

Function

* History
* List of specific functions

Types by domain and codomain|

* X → 𝔹
* 𝔹 → X
* 𝔹ⁿ → X
* X → ℤ
* ℤ → X
* X → ℝ
* ℝ → X
* ℝⁿ → X
* X → ℂ
* ℂ → X
* ℂⁿ → X

Classes/properties|

* Constant
* Identity
* Linear
* Polynomial
* Rational
* Algebraic
* Analytic
* Smooth
* Continuous
* Measurable
* Injective
* Surjective
* Bijective

Constructions|

* Restriction
* Composition
* λ
* Inverse

Generalizations|

* Relation (Binary relation)
* Set-valued
* Multivalued
* Partial
* Implicit
* Space
* Higher-order
* Morphism
* Functor

* Category

*[v]: View this template
*[t]: Discuss this template
*[e]: Edit this template