Difference between revisions of "Binary relation"
(Added formal definition) |
(→Formal Definition and Notation) |
||
Line 5: | Line 5: | ||
== Formal Definition and Notation == | == Formal Definition and Notation == | ||
− | Formally, we say that a relation <math>\mathfrak{R}</math> on sets <math>A</math> and <math>B</math> is a subset of <math>A \times B</math> (the [[Cartesian product]] of <math>A</math> and <math>B</math>). We often write <math>a \, \mathfrak{R} \, b</math> instead of <math>(a,b) \in \mathfrak{R}</math>. | + | Formally, we say that a relation <math>\mathfrak{R}</math> on sets <math>A</math> and <math>B</math> is a subset of <math>A \times B</math> (the [[Cartesian product]] of <math>A</math> and <math>B</math>). We often write <math>a \, \mathfrak{R} \, b</math> instead of <math>(a,b) \in \mathfrak{R}</math>. If <math>A=B</math> (the case of most common interest), then we say that <math>\mathfrak{R}</math> is a relation on <math>A</math>. |
Thus, in the example of <math>\sim</math> above, we may let <math>\sim</math> be the set of ordered pairs of triangles in the Euclidean plane which are similar to each other. We could also define a relation <math>\leq</math> on the [[power set]] of a set <math>S</math>, so that <math>(A,B) \in \leq</math>, or <math>A\leq B</math>, if and only if <math>A</math> and <math>B</math> are [[subset]]s of <math>S</math> and <math>A</math> is a subset of <math>B</math>. This is a common example of an [[order relation]]. | Thus, in the example of <math>\sim</math> above, we may let <math>\sim</math> be the set of ordered pairs of triangles in the Euclidean plane which are similar to each other. We could also define a relation <math>\leq</math> on the [[power set]] of a set <math>S</math>, so that <math>(A,B) \in \leq</math>, or <math>A\leq B</math>, if and only if <math>A</math> and <math>B</math> are [[subset]]s of <math>S</math> and <math>A</math> is a subset of <math>B</math>. This is a common example of an [[order relation]]. |
Revision as of 11:28, 25 November 2007
A binary relation is a relation which relates pairs of objects.
Thus, the relation of triangle similarity is a binary relation over the set of triangles but the relation
which says
is a factorization of
over the positive integers is not a binary relation because it takes 3 arguments.
Formal Definition and Notation
Formally, we say that a relation on sets
and
is a subset of
(the Cartesian product of
and
). We often write
instead of
. If
(the case of most common interest), then we say that
is a relation on
.
Thus, in the example of above, we may let
be the set of ordered pairs of triangles in the Euclidean plane which are similar to each other. We could also define a relation
on the power set of a set
, so that
, or
, if and only if
and
are subsets of
and
is a subset of
. This is a common example of an order relation.
See also
This article is a stub. Help us out by expanding it.