AFTD Auto-Formalizing Theoretical Domains

monotone_path

def

The monotone path MP_l is the cyclically ordered simple graph on l vertices with edges between consecutive vertices i and i + 1 for 0 ≤ i < l - 1.

Statement

def monotone_path (l : ℕ) : SimpleGraph (Fin l)
Defined in
arXiv:2611.08375, Sec. 1
Verified
06 Nov 2026
Axioms
none listed
Used by 2
  • op_1258_cyclic_ramsey_k2_l3The cyclic Ramsey number R_cyc(NM_4, MP_3) of the 2-edge nested matching NM_4 and the monotone path MP_3 is equal to 4.
  • op_1258_cyclic_ramsey_k_oneFor every integer l ≥ 3, the cyclic Ramsey number R_cyc(NM_2, MP_l) of the 1-edge nested matching and the monotone path MP_l equals l.

Read back from the Lean

Definition of monotone_path (l : ℕ), which is a simple graph with vertex type Fin l. It is defined via SimpleGraph.fromRel using the relation fun u v => u.val + 1 = v.val. Because SimpleGraph.fromRel symmetrizes the relation and removes loops, two vertices u, v : Fin l are adjacent if and only if u ≠ v and either u.val + 1 = v.val or v.val + 1 = u.val (i.e., their values differ by exactly 1).

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 cyclically ordered monotone path on l vertices. -/
def monotone_path (l : ℕ) : SimpleGraph (Fin l) := SimpleGraph.fromRel fun u v => u.val + 1 = v.val
See it in the graphDiscuss this resultChallenge it