Prove2Me
Navigate
DiscoverFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Residually finite groups are surjunctive (Lawton)

Proved
GottschalkSurjunctivity.isSurjunctive_of_residuallyFinite

by Lucas · Sep 30, 2026 · Mathlib 0df444a (Lean v4.33.1)

cellular-automatadynamical-systemsgroup-theory

Theorem (Lawton; reported by Gottschalk, 1973). Every residually finite group is surjunctive. Here GGG is residually finite if for every g≠1g \neq 1g=1 there is a normal subgroup N⊴GN \trianglelefteq GN⊴G of finite index with g∉Ng \notin Ng∈/N.

This covers, for example, all finitely generated linear groups and all free groups.

Preamble
import Mathlib
import Definitions.Def_GottschalkSurjunctivity_Defs
Formal statement
namespace GottschalkSurjunctivity

theorem isSurjunctive_of_residuallyFinite (G : Type) [Group G]
    (hG : IsResiduallyFinite G) : IsSurjunctive G := by sorry

end GottschalkSurjunctivity
Source
Formal Conjectures project, file `SurjunctiveGroup.lean` (Gottschalk's surjunctivity conjecture); W. H. Gottschalk, Some general dynamical notions, LNM 318 (1973), pp. 120-125, https://doi.org/10.1007/BFb0061728; T. Ceccherini-Silberstein, M. Coornaert, Cellular Automata and Groups, Springer 2010, https://doi.org/10.1007/978-3-642-14034-1, Chapter 3
Read-back

What the Lean code literally says, in plain math · Aristotle (Harmonic) — same agent as the drafter; non-blind

Disclosure — non-blind read-back. This read-back is not independent testimony. It was written by the same agent (Aristotle, by Harmonic) that drafted the Lean statements of this proposal, with full knowledge of the source material and of the intended meaning. It was not produced by a blind auditor, and reviewers should not treat it as an independent check of faithfulness.

For every group GGG in universe 000: if GGG is residually finite — meaning that for every g∈Gg\in Gg∈G with g≠1g\neq 1g=1 there is a normal subgroup NNN of finite index in GGG with g∉Ng \notin Ng∈/N — then GGG is surjunctive. Here a group GGG is called surjunctive when the following holds: for every finite, nonempty set AAA (a type in the lowest universe, equipped with a chosen finite enumeration and with a topology that is assumed to be discrete), and for every map τ:AG→AG\tau : A^G \to A^Gτ:AG→AG (where AGA^GAG is the set of all functions G→AG \to AG→A, carrying the product topology), if τ\tauτ is continuous, shift-equivariant and injective, then τ\tauτ is surjective. Shift-equivariant means τ(g⋅x)=g⋅τ(x)\tau(g\cdot x) = g\cdot \tau(x)τ(g⋅x)=g⋅τ(x) for every g∈Gg \in Gg∈G and every x∈AGx \in A^Gx∈AG, where the left shift is (g⋅x)(h)=x(g−1h)(g\cdot x)(h) = x(g^{-1}h)(g⋅x)(h)=x(g−1h) for h∈Gh \in Gh∈G.

Human review
  • Endorsed by Shuze Chen · Sep 30, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Lucas · Sep 30, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me