Transitivity: Difference between revisions
Appearance
Content deleted Content added
+section |
+merge |
||
Line 1: | Line 1: | ||
{{Incomplete disambiguation|date=May 2011}}{{mergeto|Transitivity#In logic and mathematics}} |
|||
{{Wiktionarypar|transitivity}} |
|||
In [[mathematics]], the word '''''transitive''''' admits at least four distinct meanings: |
|||
'''Transitivity''' may refer to: |
|||
* A [[group (mathematics)|group]] ''G'' acts '''transitively''' on a [[Set (mathematics)|set]] ''S'' if for any ''x'', ''y'' ∈ ''S'', there is some ''g'' ∈ ''G'' such that ''gx'' = ''y''. See [[group action]]. A somewhat related meaning is explained at [[ergodic theory]]. |
|||
==In grammar== |
|||
* A [[binary relation]] is '''transitive''' if whenever A is related to B and B is related to C, then A is related to C, for all A, B, and C in the domain of the relation. See [[transitive relation]]. |
|||
* [[Intransitive verb]] |
|||
* A '''[[transitive set]]''' is a [[Set (mathematics)|set]] A such that whenever ''x'' ∈ ''A'', and ''y'' ∈ ''x'', then ''y'' ∈ ''A''. The smallest transitive set containing a set A is called the [[transitive closure]] of A. |
|||
* [[Transitive verb]], when a verb takes an object |
|||
* A [[discrete dynamical system]] ''f'' is [[Topological transitivity#Topological mixing|topologically transitive]] if every open subset ''U''' of the phase space intersects every other open subset ''V'', when going along trajectory, i.e. there exists an integer ''n'', for which <math>f^n(U)\cap V\neq\emptyset</math>. |
|||
* [[Transitivity (grammar)]] |
|||
==See also== |
|||
==In logic and mathematics== |
|||
* [[Arc-transitive graph]] |
|||
* [[Edge-transitive graph]] |
|||
* [[Ergodic theory]], a group action that is metrically transitive |
|||
* [[Topological transitivity]], a property of dynamical systems |
|||
* [[Transitive group action]] |
|||
* [[Transitive relation]], a binary relation |
|||
* [[Transitive set]] |
|||
* [[Vertex-transitive graph]] |
|||
* [[intransitivity]] |
|||
==Other== |
|||
* Transitive Corporation, a computer software firm that developed [[QuickTransit]] |
|||
{{ |
{{mathdab}} |
||
⚫ | |||
[[uk:Транзитивність]] |
|||
⚫ | |||
[[es:Transitividad]] |
|||
[[fr:Transitivité]] |
|||
[[fi:Transitiivisuus]] |
Revision as of 17:58, 8 October 2011
This page appears to be an incomplete disambiguation. (May 2011) |
It has been suggested that this article be merged into Transitivity#In logic and mathematics. (Discuss) |
In mathematics, the word transitive admits at least four distinct meanings:
- A group G acts transitively on a set S if for any x, y ∈ S, there is some g ∈ G such that gx = y. See group action. A somewhat related meaning is explained at ergodic theory.
- A binary relation is transitive if whenever A is related to B and B is related to C, then A is related to C, for all A, B, and C in the domain of the relation. See transitive relation.
- A transitive set is a set A such that whenever x ∈ A, and y ∈ x, then y ∈ A. The smallest transitive set containing a set A is called the transitive closure of A.
- A discrete dynamical system f is topologically transitive if every open subset U' of the phase space intersects every other open subset V, when going along trajectory, i.e. there exists an integer n, for which .