AFTD Auto-Formalizing Theoretical Domains

grid_graph

abbrev

The M-by-N rectangular grid graph is the Cartesian (box) product of the path graph of length M and the path graph of length N on vertex set Fin M × Fin N.

Statement

abbrev grid_graph (M N : ℕ) : SimpleGraph (Fin M × Fin N)
Defined in
arXiv:2611.01281 Section 2
Verified
04 Nov 2026
Axioms
none listed
Used by 1
  • moving_target_grid_accuracy_le_minFor all M, N ≥ 1, on the M × N rectangular grid (vertices Fin M × Fin N, adjacent when they differ by one in exactly one coordinate) there…

Read back from the Lean

The definition grid_graph M N (where M and N are natural numbers) defines the simple graph on the vertex set Fin M × Fin N as the Cartesian product (box product, □) of the path graph on M vertices (SimpleGraph.pathGraph M) and the path graph on N vertices (SimpleGraph.pathGraph N).

Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.

Lean source view module on GitHub

/-- The M-by-N rectangular grid graph. -/
abbrev grid_graph (M N : ℕ) : SimpleGraph (Fin M × Fin N) :=
  SimpleGraph.pathGraph M □ SimpleGraph.pathGraph N
See it in the graphDiscuss this resultChallenge it