order_of_mul_comm
For any two elements x and y in a group G, the element orders of x * y and y * x are equal.
Statement
theorem order_of_mul_comm {G : Type*} [Group G] (x y : G) : orderOf (x * y) = orderOf (y * x)
- Source
- folklore
- Verified
- 25 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Used by 1
- positive_binary_identity_bound_of_perm_coverLet k ≥ 1 be an integer, and let C be a finite set of natural numbers covering the element orders of Equiv.Perm (Fin k) (satisfying…
Read back from the Lean
Let $G$ be a group. For all elements $x, y \in G$, the order of $x * y$ is equal to the order of $y * x$.
Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.
The proof, explained
The elements $x * y$ and $y * x$ are conjugates in $G$, specifically related by conjugation by $y$: $y * x = y * (x * y) * y⁻¹$. Because inner automorphisms are group isomorphisms and therefore preserve the orders of elements, $\operatorname{orderOf}(x * y)$ and $\operatorname{orderOf}(y * x)$ are equal.
$y * x = \operatorname{MulAut.conj}(y)(x * y)$
Express $y * x$ as the conjugate of $x * y$ by $y$. Expanding the definition of inner conjugation via `MulAut.conj_apply` yields $y * (x * y) * y⁻¹$, which simplifies to $y * x$ after regrouping products with `mul_assoc` and canceling $y * y⁻¹$.
uses
MulAut.conj_apply,mul_assochave h : y * x = MulAut.conj y (x * y) := by simp [MulAut.conj_apply, mul_assoc]
$\operatorname{orderOf}(x * y) = \operatorname{orderOf}(y * x)$
Substitute $y * x$ with its conjugate form $\operatorname{MulAut.conj}(y)(x * y)$ using $h$. Since conjugation by $y$ is a group automorphism, it preserves element orders by `MulEquiv.orderOf_eq`, concluding that $\operatorname{orderOf}(\operatorname{MulAut.conj}(y)(x * y)) = \operatorname{orderOf}(x * y)$.
uses
MulEquiv.orderOf_eqrw [h, MulEquiv.orderOf_eq]
MulAut.conj_apply- Conjugation of an element $h$ by $g$ evaluates to $g * h * g⁻¹$.
mul_assoc- Multiplication in a semigroup is associative: $(a * b) * c = a * (b * c)$.
MulEquiv.orderOf_eq- A multiplicative equivalence (isomorphism) preserves the order of elements: $\operatorname{orderOf}(e(x)) = \operatorname{orderOf}(x)$.
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.
/-- Conjugate elements `x * y` and `y * x` in a group have the same order. -/theorem order_of_mul_comm {G : Type*} [Group G] (x y : G) : orderOf (x * y) = orderOf (y * x) := by have h : y * x = MulAut.conj y (x * y) := by simp [MulAut.conj_apply, mul_assoc] rw [h, MulEquiv.orderOf_eq]