AFTD Auto-Formalizing Theoretical Domains

monotone_cycle

def

The monotone cycle MC_k is the ordered simple graph on Fin k with edges {i, i+1} for 0 ≤ i < k-1 and the edge {0, k-1}.

Statement

def monotone_cycle (k : ℕ) : SimpleGraph (Fin k)
Defined in
arXiv:2611.08375 "New results on cyclic and ordered Ramsey numbers", Section 1
Verified
06 Nov 2026
Axioms
none listed
Used by 3

Read back from the Lean

The function 'monotone_cycle' defines, for any natural number k, an undirected simple graph on the vertex type Fin k via 'SimpleGraph.fromRel' applied to the binary relation relating a to b if and only if a.val + 1 = b.val or (a.val = 0 and b.val + 1 = k).

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 monotone cycle MC_k on Fin k with edges between consecutive vertices and between 0 and k-1. -/
def monotone_cycle (k : ℕ) : SimpleGraph (Fin k) := SimpleGraph.fromRel (fun a b => a.val + 1 = b.val ∨ (a.val = 0 ∧ b.val + 1 = k))
See it in the graphDiscuss this resultChallenge it