torus_graph
abbrevoriginal
The M-by-N torus grid graph is the Cartesian box product of the cycle graph of length M and the cycle graph of length N on vertex set Fin M × Fin N.
Statement
abbrev torus_graph (m n : ℕ) : SimpleGraph (Fin m × Fin n)- Related work
- arXiv:2611.01281
- Verified
- 08 Nov 2026
- Axioms
- none listed
- Used by 2
- three_by_three_torus_moving_target_accuracy_exactOn the 3-by-3 torus C_3 □ C_3, the minimum achievable moving-target localization accuracy starting from the candidate set of all vertices…
- three_by_cycle_torus_moving_target_accuracy_le_ceilFor every integer n ≥ 3, there exists an adaptive search strategy for a moving target on the 3-by-n torus C_3 □ C_n achieving accuracy at…
Read back from the Lean
For any two natural numbers m and n, torus_graph m n is defined as the Cartesian product (box product, □) of the cycle graph on m vertices (SimpleGraph.cycleGraph m) and the cycle graph on n vertices (SimpleGraph.cycleGraph n), yielding a simple graph with vertex type Fin m × Fin 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 Cartesian box product of cycle graphs cycleGraph m and cycleGraph n on Fin m × Fin n. -/ abbrev torus_graph (m n : ℕ) : SimpleGraph (Fin m × Fin n) := SimpleGraph.cycleGraph m □ SimpleGraph.cycleGraph n