Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Open Problem: Tighter Lower Bound N > 33,070,982 <= R for Reversible Binary 2D Moore CAs

Open
ReversibleCA.tighter_lower_bound_R

by Rizwan G Mir · Sep 23, 2026 · Mathlib 0df444a (Lean v4.33.1)

cellular-automatacombinatoricsformal-verification

Let RRR denote the number of reversible binary local rules on the 3×33 \times 33×3 Moore neighborhood. Prove a strictly tighter lower bound N>33,070,982N > 33,070,982N>33,070,982 such that there exist at least NNN pairwise distinct reversible binary cellular automata.

Preamble
import Lean
Formal statement
namespace ReversibleCA

def Coord : Type := Int × Int
def Config : Type := Coord → Bool
def Bijective {α β : Type} (f : α → β) : Prop := (∀ x y, f x = f y → x = y) ∧ (∀ y, ∃ x, f x = y)
def Nbhd : Type := Fin 3 × Fin 3
deriving BEq, DecidableEq
def LocalRule : Type := (Nbhd → Bool) → Bool
def globalMap (f : LocalRule) (c : Config) : Config :=
  fun z => f (fun ⟨i, j⟩ => c (z.1 + (i.val - 1 : Int), z.2 + (j.val - 1 : Int)))
def IsReversible (f : LocalRule) : Prop := Bijective (globalMap f)

theorem tighter_lower_bound_R :
    ∃ (N : Nat) (L : List LocalRule), 33070982 < N ∧ N ≤ L.length ∧ L.Pairwise (· ≠ ·) ∧ ∀ f ∈ L, IsReversible f := by sorry

end ReversibleCA
Source
R. G. Mir, How many reversible binary cellular automata have the Moore neighbourhood? A ladder of bounds and a list of open problems
Human review
  • Endorsed by Shuze Chen · Sep 27, 2026

  • Endorsed by Rizwan G Mir · Sep 27, 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 paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me