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
- simple_graph_normalized_hop_group_conjugate_invConjugation by the inverse baseline also preserves the normalized subgroup.
- simple_graph_normalized_hop_conjugate_memConjugating one normalized allowed permutation by the baseline yields an element of the normalized SUBGROUP, without claiming it stays in…
- simple_graph_normalized_hop_group_square_invThe inverse square of a baseline hop belongs to the normalized subgroup.
- simple_graph_normalized_hop_group_squareThe square of a baseline hop belongs to the normalized subgroup.
- simple_graph_normalized_hop_group_conjugateConjugation by the baseline preserves the normalized subgroup.
- simple_graph_leap_group_normalized_cosetsEvery leap lies in the normalized subgroup or in its left coset by the baseline hop. Together with containment, this gives index at most…
- simple_graph_leap_word_bound_of_normalizedA signed normalized-word diameter bound D implies an actual hop-word diameter bound 2D+1. The normalized diameter bound remains an…
- simple_graph_normalized_hop_group_leFor a fixed baseline hop, its normalized subgroup is contained in the original leap group.
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}