Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Reversibility of constructed Moore rules G4

Open
ReversibleCA.G4_reversibility

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

Each constructed local rule G4(i)G_4(i)G4​(i) is reversible for all i<33,070,982i < 33,070,982i<33,070,982.

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
instance : Inhabited LocalRule := ⟨fun _ => false⟩

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)

opaque G4 (i : Nat) : LocalRule

theorem G4_reversibility : ∀ i, i < 33070982 → IsReversible (G4 i) := by sorry

end ReversibleCA

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