| advertise add site services publishers database health videos | ![]() | about toolbar stats live show health store more stuff JOIN/LOGIN |
This article is about intransitivity in mathematics. For the linguistics sense, see Intransitive verb. In mathematics, the term intransitivity is used for related, but different, properties of binary relations:
[edit] The property of not being transitiveA 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 intransitive if it is not transitive, i.e. Where R indicates some relationship. For instance, in food chains: wolves eat deer, and deer eat grass, but wolves do not eat grass. Thus, the eat relation among life forms is intransitive, in this sense. Another example that does not involve preference loops arises in freemasonry: lodge A recognizes lodge B, and lodge B recognizes lodge C, but lodge A does not recognize lodge C. Thus the recognition relation among Masonic lodges is intransitive. [edit] The property of being antitransitiveOften the term intransitive is used to refer to the stronger property of antitransitivity. We just saw that the eat relation is not transitive, but it still contains some transitivity: for instance: humans eat rabbits, rabbits eat carrots, and human also eat carrots. A relation is antitransitive if this never occurs at all, i.e., Many authors use the term intransitivity to mean antitransitivity.[1][2] An example of an antitransitive relation: the defeated relation in knockout tournaments. If player A defeated player B and player B defeated player C, A can have never played C, and therefore, A has not defeated C. [edit] A cycle in a binary relationThe term intransitivity is often used when speaking of scenarios in which a relation describes the relative preferences between pairs of options, and weighing several options produces a "loop" of preference:
A well-known example is the game rock, paper, scissors. Assuming no option is preferred to itself, a preference relation with a loop is not transitive. For if it is, each option in the loop is preferred to each option, including itself. This can be illustrated for this example of a loop among A, B, and C. Assume the relation is transitive. Then, since A is preferred to B and B is preferred to C, also A is preferred to C. But then, since C is preferred to A, also A is preferred to A. Therefore such a preference loop (or "cycle") is known as an intransitivity. This is not the same property as the relation not being transitive, nor is it the same as the relation being antitransitive. [edit] Occurrences of intransitivity in preferences
[edit] Likelihood of intransitivityIt has been suggested that Condorcet voting tends to eliminate "intransitive loops" when large numbers of voters participate because the overall assessment criteria for voters balances out. For instance, voters may prefer candidates on several different units of measure such as by order of social consciousness or by order of most fiscally conservative. In such cases intransitivity reduces to a broader equation of numbers of people and the weights of their units of measure in assessing candidates. Such as:
While each voter may not assess the units of measure identically, the trend then becomes a single vector on which the consensus agrees is a preferred balance of candidate criteria. [edit] ReferencesSee also Anand P (1993) Foundations of Rational Choice Under Risk, Oxford, Oxford University Press |
| ↑ top of page ↑ | about thumbshots |