AFTD Auto-Formalizing Theoretical Domains

admits_sharp_cyclic_labeling

def

A simple graph G on N vertices admits a sharp cyclic labeling if there exists a bijection π from ZMod N to V(G) such that is_sharp_cyclic_labeling N G π holds.

Statement

def admits_sharp_cyclic_labeling {V : Type*} (N : ℕ) [NeZero N] (G : SimpleGraph V) [DecidableRel G.Adj] : Prop
Defined in
arXiv:2610.31807 Definition 3.12
Verified
26 Oct 2026
Axioms
none listed
Built on 1
  • is_sharp_cyclic_labelingA bijection π from ZMod N to the vertex set of a simple graph G is a sharp cyclic labeling if the two-dimensional Fourier transform of the…
Used by 4

Read back from the Lean

Given a type V, a positive natural number N ([NeZero N]), a simple graph G on V, and decidable adjacency for G ([DecidableRel G.Adj]), admits_sharp_cyclic_labeling N G asserts that there exists a bijection π : ZMod N ≃ V such that π is a sharp cyclic labeling for G with respect to N (that is, is_sharp_cyclic_labeling N G π).

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

/-- A simple graph G admits a sharp cyclic labeling if there exists a bijection π : ZMod N ≃ V that is a sharp cyclic labeling. -/
def admits_sharp_cyclic_labeling {V : Type*} (N : ℕ) [NeZero N] (G : SimpleGraph V) [DecidableRel G.Adj] : Prop := ∃ π : ZMod N ≃ V, is_sharp_cyclic_labeling N G π
See it in the graphDiscuss this resultChallenge it