Relation (mathematics): Difference between revisions

From Citizendium
Jump to navigation Jump to search
imported>Richard Pinch
(sections on order, equivalence relation)
imported>Richard Pinch
(→‎Relations on a set: crossref to directed graph)
Line 21: Line 21:
* ''R'' is ''antisymmetric'' if <math>(x,y) \in R \Rightarrow (y,x) \not\in R</math>; that is, ''R'' and its transpose are disjoint.
* ''R'' is ''antisymmetric'' if <math>(x,y) \in R \Rightarrow (y,x) \not\in R</math>; that is, ''R'' and its transpose are disjoint.
* ''R'' is ''transitive'' if <math>(x,y), (y,z) \in R \Rightarrow (x,z)</math>; that is, <math>R \circ R \subseteq R</math>.
* ''R'' is ''transitive'' if <math>(x,y), (y,z) \in R \Rightarrow (x,z)</math>; that is, <math>R \circ R \subseteq R</math>.
A relation on a set ''X'' is equivalent to a [[directed graph]] with vertex set ''X''.


==Equivalence relation==
==Equivalence relation==

Revision as of 13:39, 3 November 2008

This article is developing and not approved.
Main Article
Discussion
Related Articles  [?]
Bibliography  [?]
External Links  [?]
Citable Version  [?]
 
This editable Main Article is under development and subject to a disclaimer.

A relation between sets X and Y is a subset of the Cartesian product, . We write to indicate that , and say that x "stands in the relation R to" y, or that x "is related by R to" y.

The composition of a relation R between X and Y and a relation S between Y and Z is

The transpose of a relation R between X and Y is the relation between Y and X defined by

More generally, we may define an n-ary relation to be a subset of the product of n sets .


Relations on a set

A relation R on a set X is a relation between X and itself, that is, a subset of .

  • R is reflexive if for all .
  • R is irrreflexive if for all .
  • R is symmetric if ; that is, .
  • R is antisymmetric if ; that is, R and its transpose are disjoint.
  • R is transitive if ; that is, .

A relation on a set X is equivalent to a directed graph with vertex set X.

Equivalence relation

An equivalence relation on a set X is one which is reflexive, symmetric and transitive. The identity relation X is the diagonal .

Order

A (strict) partial order is which is irreflexive, antisymmetric and transitive. A weak partial order is the union of a strict partial order and the identity. The usual notations for a partial order are or for weak orders and or for strict orders.

A total or linear order is one which has the trichotomy property: for any x, y exactly one of the three statements , , holds.

Functions

We say that a relation R is functional if it satisfies the condition that every occurs in exactly one pair . We then define the value of the function at x to be that unique y. We thus identify a function with its graph.