Transitivity: Difference between revisions
Appearance
Content deleted Content added
Arthur Rubin (talk | contribs) m Added link to requested article. |
|||
Line 1: | Line 1: | ||
In [[mathematics]], the word '''''transitive''''' admits at least two distinct meanings: |
|||
* |
* A [[group (mathematics)|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]]. |
||
==See also== |
|||
* In [[set theory]], a set is '''transitive''' if it contains all [[Element (mathematics)|element]]s of its elements. See [[transitive set]]. |
|||
* [[transitive closure]] |
|||
* [[intransitivity]] |
|||
{{disambig}} [[Category:Mathematical disambiguation]] |
|||
* [[Transitive Corporation]] is a [[computer software]] firm based in [[Manchester, England]] and [[Los Gatos]], [[California]]. |
|||
[[de:Transitivit%C3%A4t_%28Mathematik%29]] |
|||
[[uk:Транзитивність]] |
|||
{{disambig}} |
|||
[[de:Transitivität]] |
Revision as of 06:51, 20 August 2005
In mathematics, the word transitive admits at least two 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.