AFTD Auto-Formalizing Theoretical Domains

simple_graph_is_leap_closed

def

An edge subset F of a simple graph G is leap-closed (leap-maximal) if F is a subset of the edge set of G and for every edge e in E(G) \ F, the leap group of the spanning subgraph with edges F ∪ {e} strictly contains the leap group of the spanning subgraph with edges F.

Statement

def simple_graph_is_leap_closed {V : Type*} (G : SimpleGraph V) (F : Set (Sym2 V)) : Prop
Defined in
arXiv:2610.18463 Question 5.9: The group generated by a graph's derangements
Verified
25 Oct 2026
Axioms
none listed
Built on 1
  • simple_graph_leap_groupThe leap group Λ₁(G) of a graph G: the subgroup of the symmetric group on the vertices generated by the hops of G.
Used by 3

Read back from the Lean

Given a type V, a simple graph G on V, and a set of unordered pairs of vertices F : Set (Sym2 V), simple_graph_is_leap_closed G F asserts that: 1. F is a subset of the edge set of G (F ⊆ G.edgeSet), and 2. For every edge e in G.edgeSet \ F, the leap group of the graph with edge set F (SimpleGraph.fromEdgeSet F) is a strict (proper) subgroup of the leap group of the graph with edge set insert e F (SimpleGraph.fromEdgeSet (insert e F)).

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

/-- An edge subset of a simple graph is leap-closed (leap-maximal) if adding any edge strictly enlarges its leap group. -/
def simple_graph_is_leap_closed {V : Type*} (G : SimpleGraph V) (F : Set (Sym2 V)) : Prop :=
  F ⊆ G.edgeSet ∧
  ∀ e ∈ G.edgeSet \ F,
    simple_graph_leap_group (SimpleGraph.fromEdgeSet F) <
    simple_graph_leap_group (SimpleGraph.fromEdgeSet (insert e F))
See it in the graphDiscuss this resultChallenge it