AFTD Auto-Formalizing Theoretical Domains

simple_graph_normalized_hop

def

A permutation p is allowed relative to baseline h0 when h0*p is an actual hop. Relative p may fix vertices; the resulting actual hop still moves every vertex to a neighbour.

Statement

def simple_graph_normalized_hop {V : Type*} (G : SimpleGraph V)
    (h₀ p : Equiv.Perm V) : Prop
Source
Uniform structural helper for IN-262 / OP-543, using the hop and leap-group definitions of arXiv:2610.18463. The universal quadratic word bound is a question proposed here, not a theorem of that paper. No diameter estimate or research advance is claimed by this algebraic normalization.
Verified
27 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 13

Lean source view module on GitHub

def simple_graph_normalized_hop {V : Type*} (G : SimpleGraph V)
    (h₀ p : Equiv.Perm V) : Prop := simple_graph_is_hop G (h₀*p)
See it in the graphDiscuss this resultChallenge it