AFTD Auto-Formalizing Theoretical Domains

simple_graph_leap_group

def

The leap group Λ₁(G) of a graph G: the subgroup of the symmetric group on the vertices generated by the hops of G.

Statement

def simple_graph_leap_group {V : Type*} (G : SimpleGraph V) : Subgroup (Equiv.Perm V)
Defined in
arXiv:2610.18463 (The group generated by a graph's derangements), Definition 2.1 (the leap group Λ₁(G)).
Verified
15 Oct 2026
Axioms
none listed
Built on 1
  • simple_graph_is_hopA hop (graph derangement) of a graph G is a permutation h of the vertices that sends every vertex v to a neighbour h(v) of v.
Used by 18

Lean source view module on GitHub

/-- The leap group `Λ₁(G)`: the subgroup of `Equiv.Perm V` generated by the hops of `G`. -/
def simple_graph_leap_group {V : Type*} (G : SimpleGraph V) : Subgroup (Equiv.Perm V) :=
  Subgroup.closure {h | simple_graph_is_hop G h}
See it in the graphDiscuss this resultChallenge it