AFTD Auto-Formalizing Theoretical Domains

cycle_with_two_chords

def

The simple graph on vertices 0, ..., m - 1 obtained from the cycle graph on m vertices by adding two chords: one between vertex 0 and vertex a - 1, and one between vertex a and vertex m - 1 (corresponding to chords {1, a} and {a+1, m} in 1-based indexing).

Statement

def cycle_with_two_chords (m a : ℕ) : SimpleGraph (Fin m)
Defined in
arXiv:2610.17884 Lemma 4.1
Verified
24 Oct 2026
Axioms
none listed
Used by 1

Read back from the Lean

For natural numbers m and a, cycle_with_two_chords m a is the simple graph on vertex type Fin m defined as the union (supremum in the SimpleGraph lattice) of: 1. SimpleGraph.cycleGraph m, the cycle graph on m vertices; and 2. SimpleGraph.fromRel, which adds undirected edges between distinct vertices u and v whenever (u.val = 0 and v.val = a - 1) or (u.val = a and v.val = m - 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 m-cycle with two chords {1, a} and {a+1, m} in 1-based indexing. -/
def cycle_with_two_chords (m a : ℕ) : SimpleGraph (Fin m) :=
  SimpleGraph.cycleGraph m ⊔ SimpleGraph.fromRel fun u v =>
    (u.val = 0 ∧ v.val = a - 1) ∨ (u.val = a ∧ v.val = m - 1)
See it in the graphDiscuss this resultChallenge it