HOME



picture info

Quasitransitive
The mathematical notion of quasitransitivity is a weakened version of transitivity that is used in social choice theory and microeconomics. Informally, a relation is quasitransitive if it is symmetric for some values and transitive elsewhere. The concept was introduced by to study the consequences of Arrow's theorem. Formal definition A binary relation T over a set ''X'' is quasitransitive if for all ''a'', ''b'', and ''c'' in ''X'' the following holds: : (a\operatornameb) \wedge \neg(b\operatornamea) \wedge (b\operatornamec) \wedge \neg(c\operatornameb) \Rightarrow (a\operatornamec) \wedge \neg(c\operatornamea). If the relation is also antisymmetric, T is transitive. Alternately, for a relation T, define the asymmetric or "strict" part P: :(a\operatornameb) \Leftrightarrow (a\operatornameb) \wedge \neg(b\operatornamea). Then T is quasitransitive if and only if P is transitive. Examples Preferences are assumed to be quasitransitive (rather than transitive) in some econ ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

Sorites Paradox
The sorites paradox (; sometimes known as the paradox of the heap) is a paradox that results from vague predicates. A typical formulation involves a heap of sand, from which grains are removed individually. With the assumption that removing a single grain does not cause a heap to become a non-heap, the paradox is to consider what happens when the process is repeated enough times that only one grain remains: is it still a heap? If not, when did it change from a heap to a non-heap? The original formulation and variations Paradox of the heap The word ''sorites'' ('' grc-gre, σωρείτης'') derives from the Greek word for 'heap' ('' grc-gre, σωρός''). The paradox is so named because of its original characterization, attributed to Eubulides of Miletus. The paradox is as follows: consider a heap of sand from which grains are removed individually. One might construct the argument, using premises, as follows: :'' grains of sand is a heap of sand'' (Premise 1) :''A heap of s ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  




Acyclic Relation
This is a glossary of some terms used in various branches of mathematics that are related to the fields of order, lattice, and domain theory. Note that there is a structured list of order topics available as well. Other helpful resources might be the following overview articles: * completeness properties of partial orders * distributivity laws of order theory * preservation properties of functions between posets. In the following, partial orders will usually just be denoted by their carrier sets. As long as the intended meaning is clear from the context, \,\leq\, will suffice to denote the corresponding relational symbol, even without prior introduction. Furthermore, < will denote the induced by \,\leq. __NOTOC__


A

* Acyclic. A

picture info

Transitive Relation
In mathematics, a relation on a set is transitive if, for all elements , , in , whenever relates to and to , then also relates to . Each partial order as well as each equivalence relation needs to be transitive. Definition A homogeneous relation on the set is a ''transitive relation'' if, :for all , if and , then . Or in terms of first-order logic: :\forall a,b,c \in X: (aRb \wedge bRc) \Rightarrow aRc, where is the infix notation for . Examples As a non-mathematical example, the relation "is an ancestor of" is transitive. For example, if Amy is an ancestor of Becky, and Becky is an ancestor of Carrie, then Amy, too, is an ancestor of Carrie. On the other hand, "is the birth parent of" is not a transitive relation, because if Alice is the birth parent of Brenda, and Brenda is the birth parent of Claire, then this does not imply that Alice is the birth parent of Claire. What is more, it is antitransitive: Alice can ''never'' be the birth parent of Claire. ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


Reflexive Relation
In mathematics, a binary relation ''R'' on a set ''X'' is reflexive if it relates every element of ''X'' to itself. An example of a reflexive relation is the relation " is equal to" on the set of real numbers, since every real number is equal to itself. A reflexive relation is said to have the reflexive property or is said to possess reflexivity. Along with symmetry and transitivity, reflexivity is one of three properties defining equivalence relations. Definitions Let R be a binary relation on a set X, which by definition is just a subset of X \times X. For any x, y \in X, the notation x R y means that (x, y) \in R while "not x R y" means that (x, y) \not\in R. The relation R is called if x R x for every x \in X or equivalently, if \operatorname_X \subseteq R where \operatorname_X := \ denotes the identity relation on X. The of R is the union R \cup \operatorname_X, which can equivalently be defined as the smallest (with respect to \subseteq) reflexive relation o ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

Intransitivity
In mathematics, intransitivity (sometimes called nontransitivity) is a property of binary relations that are not transitive relations. This may include any relation that is not transitive, or the stronger property of antitransitivity, which describes a relation that is never transitive. Intransitivity A relation is transitive if, whenever it relates some A to some B, and that B to some C, it also relates that A to that C. Some authors call a relation if it is not transitive, that is, (if the relation in question is named R) \lnot\left(\forall a, b, c: a R b \land b R c \implies a R c\right). This statement is equivalent to \exists a,b,c : a R b \land b R c \land \lnot(a R c). For instance, in the food chain, wolves feed on deer, and deer feed on grass, but wolves do not feed on grass. Thus, the relation among life forms is intransitive, in this sense. Another example that does not involve preference loops arises in freemasonry: in some instances lodge A recognizes lodge B ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


Converse Relation
In mathematics, the converse relation, or transpose, of a binary relation is the relation that occurs when the order of the elements is switched in the relation. For example, the converse of the relation 'child of' is the relation 'parent of'. In formal terms, if X and Y are sets and L \subseteq X \times Y is a relation from X to Y, then L^ is the relation defined so that yL^x if and only if xLy. In set-builder notation, :L^ = \. The notation is analogous with that for an inverse function. Although many functions do not have an inverse, every relation does have a unique converse. The unary operation that maps a relation to the converse relation is an involution, so it induces the structure of a semigroup with involution on the binary relations on a set, or, more generally, induces a dagger category on the category of relations as detailed below. As a unary operation, taking the converse (sometimes called conversion or transposition) commutes with the order-relat ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

Complementary Relation
In set theory, the complement of a set , often denoted by (or ), is the set of elements not in . When all sets in the universe, i.e. all sets under consideration, are considered to be members of a given set , the absolute complement of is the set of elements in that are not in . The relative complement of with respect to a set , also termed the set difference of and , written B \setminus A, is the set of elements in that are not in . Absolute complement Definition If is a set, then the absolute complement of (or simply the complement of ) is the set of elements not in (within a larger set that is implicitly defined). In other words, let be a set that contains all the elements under study; if there is no need to mention , either because it has been previously specified, or it is obvious and unique, then the absolute complement of is the relative complement of in : A^\complement = U \setminus A. Or formally: A^\complement = \. The absolute complement of is u ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

Cartesian Product
In mathematics, specifically set theory, the Cartesian product of two sets ''A'' and ''B'', denoted ''A''×''B'', is the set of all ordered pairs where ''a'' is in ''A'' and ''b'' is in ''B''. In terms of set-builder notation, that is : A\times B = \. A table can be created by taking the Cartesian product of a set of rows and a set of columns. If the Cartesian product is taken, the cells of the table contain ordered pairs of the form . One can similarly define the Cartesian product of ''n'' sets, also known as an ''n''-fold Cartesian product, which can be represented by an ''n''-dimensional array, where each element is an ''n''-tuple. An ordered pair is a 2-tuple or couple. More generally still, one can define the Cartesian product of an indexed family of sets. The Cartesian product is named after René Descartes, whose formulation of analytic geometry gave rise to the concept, which is further generalized in terms of direct product. Examples A deck of cards ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

Universal Relation
In mathematics, a homogeneous relation (also called endorelation) over a set ''X'' is a binary relation over ''X'' and itself, i.e. it is a subset of the Cartesian product . This is commonly phrased as "a relation on ''X''" or "a (binary) relation over ''X''". An example of a homogeneous relation is the relation of kinship, where the relation is over people. Common types of endorelations include orders, graphs, and equivalences. Specialized studies order theory and graph theory have developed understanding of endorelations. Terminology particular for graph theory is used for description, with an ordinary graph presumed to correspond to a symmetric relation, and a general endorelation corresponding to a directed graph. An endorelation ''R'' corresponds to a logical matrix of 0s and 1s, where the expression ''xRy'' corresponds to an edge between ''x'' and ''y'' in the graph, and to a 1 in the square matrix of ''R''. It is called an adjacency matrix in graph terminology. Particu ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


Coreflexive Relation
In mathematics, a binary relation ''R'' on a set ''X'' is reflexive if it relates every element of ''X'' to itself. An example of a reflexive relation is the relation " is equal to" on the set of real numbers, since every real number is equal to itself. A reflexive relation is said to have the reflexive property or is said to possess reflexivity. Along with symmetry and transitivity, reflexivity is one of three properties defining equivalence relations. Definitions Let R be a binary relation on a set X, which by definition is just a subset of X \times X. For any x, y \in X, the notation x R y means that (x, y) \in R while "not x R y" means that (x, y) \not\in R. The relation R is called if x R x for every x \in X or equivalently, if \operatorname_X \subseteq R where \operatorname_X := \ denotes the identity relation on X. The of R is the union R \cup \operatorname_X, which can equivalently be defined as the smallest (with respect to \subseteq) reflexive relation on ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

Empty Relation
In mathematics, a homogeneous relation (also called endorelation) over a set ''X'' is a binary relation over ''X'' and itself, i.e. it is a subset of the Cartesian product . This is commonly phrased as "a relation on ''X''" or "a (binary) relation over ''X''". An example of a homogeneous relation is the relation of kinship, where the relation is over people. Common types of endorelations include orders, graphs, and equivalences. Specialized studies order theory and graph theory have developed understanding of endorelations. Terminology particular for graph theory is used for description, with an ordinary graph presumed to correspond to a symmetric relation, and a general endorelation corresponding to a directed graph. An endorelation ''R'' corresponds to a logical matrix of 0s and 1s, where the expression ''xRy'' corresponds to an edge between ''x'' and ''y'' in the graph, and to a 1 in the square matrix of ''R''. It is called an adjacency matrix in graph terminology. Part ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]