Discriminating group: Difference between revisions

From Groupprops
(Created page with "{{semistddef}} {{group property}} ==Definition== A group <math>G</math>is termed a '''discriminating group''' if for any collection of words <math>w_1,w_2,\dots,w_m</mat...")
 
No edit summary
 
Line 10: Line 10:


Another way of formulating this is that whenever a disjunction of words is satisfied in the group, one of the words must be satisfied in the group.
Another way of formulating this is that whenever a disjunction of words is satisfied in the group, one of the words must be satisfied in the group.
==Facts==
* [[Discriminating and finite iff trivial]]: There is no nontrivial finite discriminating group.


==References==
==References==


* {{paperlink|Bryantverbal}}, Page 341 (Page 2 of the PDF)
* {{paperlink|Bryantverbal}}, Page 341 (Page 2 of the PDF)

Latest revision as of 20:27, 27 July 2013

This article defines a term that has been used or referenced in a journal article or standard publication, but may not be generally accepted by the mathematical community as a standard term.[SHOW MORE]

This article defines a group property: a property that can be evaluated to true/false for any given group, invariant under isomorphism
View a complete list of group properties
VIEW RELATED: Group property implications | Group property non-implications |Group metaproperty satisfactions | Group metaproperty dissatisfactions | Group property satisfactions | Group property dissatisfactions

Definition

A group is termed a discriminating group if for any collection of words all in the letters , the following are equivalent:

  1. For every , there exists with such that is the identity element of .
  2. There exists with such that for every , is the identity element of .

Another way of formulating this is that whenever a disjunction of words is satisfied in the group, one of the words must be satisfied in the group.

Facts

References