A group action has this property if it is possible to find an element of the group that takes any element of the set to any other. This adjective precedes the word "closure" to describe a graph that contains edges between any two vertices that are connected. Like reflexivity, this property of binary relations is an essential quality to both preorders and par- tially ordered sets. One of the three properties of equivalence relations, it also applies to relations such as implication, set containment, and inequality; the other two properties of equivalence relations are reflexivity and symmetry. Name this property, an example of which is the statement that if x equals y and y equals z, then x equals z.
A group action has this property if it is possible to find an element of the group that takes any element of the set to any other. This adjective precedes the word "closure" to describe a graph that contains edges between any two vertices that are connected. Like reflexivity, this property of binary relations is an essential quality to both preorders and par- tially ordered sets. One of the three properties of equivalence relations, it also applies to relations such as implication, set containment, and inequality; the other two properties of equivalence relations are reflexivity and symmetry. Name this property, an example of which is the statement that if x equals y and y equals z, then x equals z.
A group action has this property if it is possible to find an element of the group that takes any element of the set to any other.
{transitive} property [accept word forms, {e.g. transitivity} ]