AFTD Auto-Formalizing Theoretical Domains

simple_graph_normalized_hop_group

def

The subgroup generated by permutations allowed relative to a fixed baseline hop.

Statement

def simple_graph_normalized_hop_group {V : Type*} (G : SimpleGraph V)
    (h₀ : Equiv.Perm V) : Subgroup (Equiv.Perm V)
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_normalized_hopA 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…
Used by 8

Lean source view module on GitHub

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