TOPICS
Search

Sofic Group


A sofic group is a countable group for which every finite portion of the multiplication table can be approximated arbitrarily accurately by permutations of a finite set. Products must agree on all but an arbitrarily small fraction of the set, while distinct group elements must act differently on almost every element. The notion was introduced by Gromov (1999), and the term was introduced by Weiss (2000).

Every sofic group is a surjunctive group (Gromov 1999, Weiss 2000).

Every sofic group is a hyperlinear group. Passing from a permutation to its permutation matrix changes normalized Hamming distance d_H to normalized Hilbert-Schmidt norm distance d_2 according to d_2^2=2d_H (Pestov 2008).


See also

Countable Set, Group, Kaplansky Direct-Finiteness Conjecture, Multiplication Table, Permutation, Soficity Conjecture, Surjunctive Group

Explore with Wolfram|Alpha

References

Gromov, M. "Endomorphisms of Symbolic Algebraic Varieties." J. Eur. Math. Soc. 1, 109-197, 1999. https://doi.org/10.1007/PL00011162.Pestov, V. G. "Hyperlinear and Sofic Groups: A Brief Guide." Bull. Symbolic Logic 14, 449-480, 2008. https://doi.org/10.2178/bsl/1231081461.Weiss, B. "Sofic Groups and Dynamical Systems." Sankhyā Ser. A 62, 350-359, 2000.

Cite this as:

Weisstein, Eric W. "Sofic Group." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/SoficGroup.html

Subject classifications