On sofic groups, Kaplansky's conjectures, and endomorphisms of pro-algebraic groups

Abstract

Let G be a group. Let X be a connected algebraic group over an algebraically closed field K. Denote by A=X(K) the set of K-points of X. We study a class of endomorphisms of pro-algebraic groups, namely algebraic group cellular automata over (G,X,K). They are cellular automata τ AG AG whose local defining map is induced by a homomorphism of algebraic groups XM X where M⊂ G is a finite memory set of τ. Our first result is that when G is sofic, such an algebraic group cellular automaton τ is invertible whenever it is injective and char(K)=0. As an application, we prove that if G is sofic and the group X is commutative then the group ring R[G], where R=End(X) is the endomorphism ring of X, is stably finite. When G is amenable, we show that an algebraic group cellular automaton τ is surjective if and only if it satisfies a weak form of pre-injectivity called ()-pre-injectivity. This yields an analogue of the classical Moore-Myhill Garden of Eden theorem. We also introduce the near ring R(K,G) which is K[Xg: g ∈ G] as an additive group but the multiplication is induced by the group law of G. The near ring R(K,G) contains naturally the group ring K[G] and we extend Kaplansky's conjectures to this new setting. Among other results, we prove that when G is an orderable group, then all one-sided invertible elements of R(K,G) are trivial, i.e., of the form aXg+b for some g∈ G, a∈ K*, b∈ K. This allows us to show that when G is locally residually finite and orderable (e.g. Zd or a free group), and char(K)=0, all injective algebraic cellular automata τ CG CG are of the form τ(x)(h)= a x(g-1h) +b for all x∈ CG, h ∈ G for some g∈ G, a∈ C*, b∈ C.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…