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
- simple_graph_normalized_hop_two_wordEvery normalized allowed permutation is the product of exactly two actual hops on an undirected graph. No vertex is allowed to wait during…
- 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_oneThe identity is allowed relative to any baseline hop.
- simple_graph_normalized_hop_group_square_invThe inverse square of a baseline hop belongs to the normalized subgroup.
- simple_graph_normalized_hop_groupThe subgroup generated by permutations allowed relative to a fixed baseline hop.
- simple_graph_normalized_hop_inverse_two_wordThe inverse of a normalized allowed permutation also has a two-hop realization, although it need not itself be normalized allowed.
- 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_recombineIf p is allowed relative to a baseline hop h0, and a PERMUTATION q chooses p(v) or v at each vertex, then q is also allowed relative to…
- simple_graph_normalized_hop_group_leFor a fixed baseline hop, its normalized subgroup is contained in the original leap group.
- simple_graph_normalized_cycle_factor_two_wordEvery individual disjoint cycle factor of a normalized allowed permutation can be isolated as a product of two actual hops. The…
- simple_graph_normalized_word_to_hop_wordEvery signed normalized word lifts to an actual hop word with exactly twice its length and the same product.
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)