AFTD Auto-Formalizing Theoretical Domains

hn_graph

def

For each natural number n, hn_graph n is the simple graph on the vertex set Fin (3 * n) defined via SimpleGraph.fromRel from the relation where u and v are related if (u.val < n - 1 and v.val ≥ n - 1) or (n - 1 ≤ u.val and u.val < 2 * n - 1 and 2 * n - 1 ≤ v.val and v.val < 3 * n - 1).

Statement

def hn_graph (n : ℕ) : SimpleGraph (Fin (3 * n))
Defined in
arXiv:2610.18636 Definition 3
Verified
23 Oct 2026
Axioms
none listed
Used by 1
  • hn_spectrumFor every integer n ≥ 2, there exist real numbers l1 > l2 > l3 such that 1/2 < l1 < 2n, 0 < l2 < 1/2, -n < l3 < 0, hn_poly n =…

Read back from the Lean

For each natural number n, hn_graph n is the SimpleGraph on the vertex set Fin (3 * n) constructed via SimpleGraph.fromRel from the relation r u v, which holds if and only if either: 1. u.val < n - 1 and v.val ≥ n - 1, or 2. n - 1 ≤ u.val < 2 * n - 1 and 2 * n - 1 ≤ v.val < 3 * n - 1. Because SimpleGraph.fromRel r defines adjacency as u ≠ v ∧ (r u v ∨ r v u), two distinct vertices u, v : Fin (3 * n) are adjacent in hn_graph n if and only if: - One vertex has value < n - 1 and the other has value ≥ n - 1; or - One vertex has value in [n - 1, 2 * n - 1) and the other has value in [2 * n - 1, 3 * n - 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 competitor graph H_n on Fin (3 * n). -/
def hn_graph (n : ℕ) : SimpleGraph (Fin (3 * n)) :=
  SimpleGraph.fromRel fun u v =>
    (u.val < n - 1 ∧ v.val ≥ n - 1) ∨
    (n - 1 ≤ u.val ∧ u.val < 2 * n - 1 ∧ 2 * n - 1 ≤ v.val ∧ v.val < 3 * n - 1)
See it in the graphDiscuss this resultChallenge it