Search results
Results from the WOW.Com Content Network
In mathematics, a relation denotes some kind of relationship between two objects in a set, which may or may not hold. [1] As an example, " is less than " is a relation on the set of natural numbers ; it holds, for instance, between the values 1 and 3 (denoted as 1 < 3 ), and likewise between 3 and 4 (denoted as 3 < 4 ), but not between the ...
A relation R is called intransitive if it is not transitive, that is, if xRy and yRz, but not xRz, for some x, y, z. In contrast, a relation R is called antitransitive if xRy and yRz always implies that xRz does not hold. For example, the relation defined by xRy if xy is an even number is intransitive, [13] but not antitransitive. [14]
In mathematics, an equivalence relation is a binary relation that is reflexive, symmetric and transitive. The equipollence relation between line segments in geometry is a common example of an equivalence relation. A simpler example is equality. Any number is equal to itself (reflexive).
Mathematical relations fall into various types according to their specific properties, often as expressed in the axioms or definitions that they satisfy. Many of these types of relations are listed below.
Standard examples of posets arising in mathematics include: The real numbers , or in general any totally ordered set, ordered by the standard less-than-or-equal relation ≤, is a partial order. On the real numbers R {\displaystyle \mathbb {R} } , the usual less than relation < is a strict partial order.
In mathematics, a recurrence relation is an equation according to which the th term of a sequence of numbers is equal to some combination of the previous terms. Often, only previous terms of the sequence appear in the equation, for a parameter that is independent of ; this number is called the order of the relation.
An example of a left quasi-reflexive relation is a left Euclidean relation, which is always left quasi-reflexive but not necessarily right quasi-reflexive, and thus not necessarily quasi-reflexive. An example of a coreflexive relation is the relation on integers in which each odd number is related to itself and there are no other relations. The ...
For example, the relation over the integers in which each odd number is related to itself is a coreflexive relation. The equality relation is the only example of a both reflexive and coreflexive relation, and any coreflexive relation is a subset of the identity relation. Left quasi-reflexive for all x, y ∈ X, if xRy then xRx. Right quasi ...