AFTD Auto-Formalizing Theoretical Domains

cone_necklace_graph

deforiginal

For each natural m, the simple graph on vertices 0 through 2m has apex 2m adjacent to every other vertex. For each i from 0 to m−1, it also has a base triangle on cycle vertex i, cycle vertex (i+1) mod m, and private vertex m+i. There are no other edges and no loops.

Statement

open Sym2 in
def cone_necklace_graph (m : ℕ) : SimpleGraph (Fin (2 * m + 1))
Related work
Explicit graph construction for simple_graph_stable_min_two_triangles_odd_conflict_cycle_family; see experiments 16959–16961 and 17491.
Verified
06 Nov 2026
Axioms
none listed
Used by 4

Read back from the Lean

cone_necklace_graph m defines a simple graph on the vertex type Fin (2 * m + 1) for any natural number m. With the following distinguished vertices and maps: - apex : Fin (2 * m + 1) is the vertex with index 2 * m; - cycle : Fin m → Fin (2 * m + 1) maps i to the vertex with index i.val; - privateVertex : Fin m → Fin (2 * m + 1) maps i to the vertex with index m + i.val; - next : Fin m → Fin m maps i to (i.val + 1) % m; the graph is defined via SimpleGraph.fromEdgeSet from the set of unordered pairs e : Sym2 (Fin (2 * m + 1)) satisfying either: 1. ∃ v : Fin (2 * m + 1), v ≠ apex and e = s(apex, v) (edges connecting the apex to every other vertex); or 2. ∃ i : Fin m, such that at least one of the following holds: - e = s(cycle i, cycle (next i)) - e = s(cycle i, privateVertex i) - e = s(cycle (next i), privateVertex i)

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

open Sym2 in
def cone_necklace_graph (m : ℕ) : SimpleGraph (Fin (2 * m + 1)) :=
  let apex : Fin (2 * m + 1) := ⟨2 * m, by omega⟩
  let cycle : Fin m → Fin (2 * m + 1) := fun i => ⟨i.val, by omega⟩
  let privateVertex : Fin m → Fin (2 * m + 1) := fun i => ⟨m + i.val, by omega⟩
  let next : Fin m → Fin m := fun i =>
    ⟨(i.val + 1) % m, Nat.mod_lt _ (by have := i.isLt; omega)⟩
  SimpleGraph.fromEdgeSet {e |
    (∃ v : Fin (2 * m + 1), v ≠ apex ∧ e = s(apex, v)) ∨
    ∃ i : Fin m,
      e = s(cycle i, cycle (next i)) ∨
      e = s(cycle i, privateVertex i) ∨
      e = s(cycle (next i), privateVertex i)}
See it in the graphDiscuss this resultChallenge it