# Difference between revisions of "Relation"

(New page: The notion of relations (also known as predicates) is one of the most important fundamental concepts of set theory. The most common of these are the binary relations, so we begin with them...) |
|||

Line 1: | Line 1: | ||

− | + | A '''relation''' is a simple structure that can be placed on a pair or collection of [[set]]s to give a notion of "relatedness" to the [[element]]s of those sets. | |

+ | |||

+ | Examples of relations include the relation of [[similarity]] on the set of [[triangle]]s in a [[plane]], the relation on the [[real number]]s that indicates that a first number is exactly one larger than a second number, or the relation betweem the [[integer]]s and the set <math>\{0, 1, 2, \ldots, m - 1 \}</math> that the two numbers are congruent [[modulo]] <math>m</math>. | ||

+ | |||

+ | Relations (also known as predicates) are one of the most important fundamental concepts of set theory. The most common kind of relations (including all of those mentioned in the preceding paragraph) are the [[binary relations]], so we begin with them. | ||

== Binary Relations == | == Binary Relations == | ||

− | A binary relation <math>\mathfrak{R}</math> between a | + | A binary relation <math>\mathfrak{R}</math> between a set <math>A</math> and a set <math>B</math> is formally defined as a subset of the [[Cartesian product]] <math>A \times B</math>. If <math>a \in A</math> and <math>b \in B</math>, we say <math>a</math> is ''related to'' <math>b</math> under <math>\mathfrak{R}</math> if <math>(a, b) \in \mathfrak{R}</math>. We write this as <math>\mathfrak{R}(a,b)</math>, or, more commonly, <math>a\mathfrak{R}b</math>. If <math>(a, b) \not \in \mathfrak{R}</math>, we say that <math>a</math> and <math>b</math> are not related under <math>\mathfrak{R}</math>. |

For a more detailed treatment, see [[Binary relation]]. | For a more detailed treatment, see [[Binary relation]]. | ||

− | == n-ary Relations == | + | == <math>n</math>-ary Relations == |

+ | |||

+ | An <math>n</math>-ary relation <math>\mathfrak{R}</math> over the sets <math>A_1,\ldots,A_n</math> is a subset of the Cartesian product <math>A_1 \times A_2 \times \ldots \times A_n</math>. If <math>a_i \in A_i</math> for <math>i=1,\ldots,n</math>, we say <math>a_1, \ldots, a_n</math> are related under <math>\mathfrak{R}</math>, and write <math>\mathfrak{R}(a_1,...,a_n)</math> (unfortunately though, the other short hand breaks down here) if <math>(a_1,\ldots,a_n) \in \mathfrak{R}</math>. If <math>A_1 = \ldots = A_n = A</math>, we say <math>\mathfrak{R}</math> is an <math>n</math>-ary relation ''over'' <math>A</math>. | ||

− | |||

− | A very common example of an <math>n</math>-ary relation is a linear constraint over a vector space <math>\mathbb{F}^n</math> for some field <math>\mathbb{F}</math>: | + | A very common example of an <math>n</math>-ary relation is a linear constraint over a [[vector space]] <math>\mathbb{F}^n</math> for some [[field]] <math>\mathbb{F}</math>: |

<math>\sum^n_{i=1}c_ix_i = c</math>, | <math>\sum^n_{i=1}c_ix_i = c</math>, | ||

where <math>(x_1,...,x_n)</math> is an element of the vector space and <math>c_1,...,c_n,c</math> are scalars. | where <math>(x_1,...,x_n)</math> is an element of the vector space and <math>c_1,...,c_n,c</math> are scalars. |

## Latest revision as of 08:16, 21 August 2009

A **relation** is a simple structure that can be placed on a pair or collection of sets to give a notion of "relatedness" to the elements of those sets.

Examples of relations include the relation of similarity on the set of triangles in a plane, the relation on the real numbers that indicates that a first number is exactly one larger than a second number, or the relation betweem the integers and the set that the two numbers are congruent modulo .

Relations (also known as predicates) are one of the most important fundamental concepts of set theory. The most common kind of relations (including all of those mentioned in the preceding paragraph) are the binary relations, so we begin with them.

## Binary Relations

A binary relation between a set and a set is formally defined as a subset of the Cartesian product . If and , we say is *related to* under if . We write this as , or, more commonly, . If , we say that and are not related under .

For a more detailed treatment, see Binary relation.

## -ary Relations

An -ary relation over the sets is a subset of the Cartesian product . If for , we say are related under , and write (unfortunately though, the other short hand breaks down here) if . If , we say is an -ary relation *over* .

A very common example of an -ary relation is a linear constraint over a vector space for some field :
,
where is an element of the vector space and are scalars.