Stable finiteness of monoid algebras and surjunctivity
Abstract
A monoid M is said to be surjunctive if every injective cellular automaton with finite alphabet over M is surjective. We show that monoid algebras of surjunctive monoids are stably finite. In other words, given any field K and any surjunctive monoid M, every one-sided invertible square matrix with entries in the monoid algebra K[M] is two-sided invertible. Our proof uses first-order model theory.
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.