simple_graph_normalized_hop_group_square
The square of a baseline hop belongs to the normalized subgroup.
Statement
theorem simple_graph_normalized_hop_group_square {V : Type*} (G : SimpleGraph V) (h₀ : Equiv.Perm V) (hh₀ : simple_graph_is_hop G h₀) : h₀*h₀ ∈ simple_graph_normalized_hop_group G h₀
- 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
Classical.choiceQuot.soundpropext- Built on 3
- simple_graph_normalized_hop_groupThe subgroup generated by permutations allowed relative to a fixed baseline hop.
- simple_graph_normalized_hop_group_square_invThe inverse square of a baseline hop belongs to the normalized subgroup.
- 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 2
- simple_graph_normalized_hop_group_conjugate_invConjugation by the inverse baseline also 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…
The proof, explained
By a previous lemma, the square of the inverse hop h₀⁻¹ * h₀⁻¹ belongs to the normalized hop group. Because the normalized hop group is a subgroup, it is closed under inversion, so the inverse (h₀⁻¹ * h₀⁻¹)⁻¹ is also in the subgroup. Simplifying this inverse of a product using standard group laws yields h₀ * h₀.
The inverse of the squared inverse hop, (h₀⁻¹ * h₀⁻¹)⁻¹, belongs to the normalized hop group.
By `simple_graph_normalized_hop_group_square_inv`, the element h₀⁻¹ * h₀⁻¹ is an element of the normalized hop group. Since the normalized hop group is a subgroup, it is closed under inversion (`inv_mem`), so (h₀⁻¹ * h₀⁻¹)⁻¹ also belongs to it.
uses
inv_mem,simple_graph_normalized_hop_group_square_invhave hh := (simple_graph_normalized_hop_group G h₀).inv_mem (simple_graph_normalized_hop_group_square_inv G h₀ hh₀)The square of the hop, h₀ * h₀, belongs to the normalized hop group.
Simplifying (h₀⁻¹ * h₀⁻¹)⁻¹ using the standard group identities for inversion of products and double inversion yields h₀ * h₀. The `simpa` tactic simplifies this hypothesis and uses it to close the goal.
simpa using hh
inv_mem- If an element x belongs to an inversion-closed set (such as a subgroup), then its inverse x⁻¹ also belongs to it.
simple_graph_normalized_hop_group_square_inv- For any baseline hop h₀ of a graph G, the product h₀⁻¹ * h₀⁻¹ belongs to the normalized hop group of G and h₀.
Written by a model (gemini-3.8-flash) from the Lean proof and the goal states Lean reported at each step. Lean verified the proof; this explanation is a reading aid and is not itself machine-checked.
Lean source view module on GitHub
Choose a tactic — a marked line — to see the goals Lean had before and after it, as in Lean’s infoview. Step with ← → or j k.
theorem simple_graph_normalized_hop_group_square {V : Type*} (G : SimpleGraph V) (h₀ : Equiv.Perm V) (hh₀ : simple_graph_is_hop G h₀) : h₀*h₀ ∈ simple_graph_normalized_hop_group G h₀ := by have hh := (simple_graph_normalized_hop_group G h₀).inv_mem (simple_graph_normalized_hop_group_square_inv G h₀ hh₀) simpa using hh