Decomposition of a group element into p'- and p-parts
Provedexists_commute_mul_eq_orderOf_coprime_pow_prime_pow_eq_oneLet be a prime and let be a finite group, written multiplicatively, and let . Then there exist elements such that ; and commute; the order of is coprime to ; there is a natural number with ; and both and lie in the subgroup of integer powers of (Subgroup.zpowers g). Thus every element of a finite group factors as a product of a commuting pair consisting of an element of order prime to and an element of -power order, both of them powers of the original element. The statement asserts existence only; no uniqueness of the pair is claimed, and the exponent is not tied to the -adic valuation of the order of .
This is the classical decomposition of an element of a finite group into its -regular (-) part and its -part , the group-theoretic analogue of a Jordan decomposition. It is used in Rep.eq_zero_of_forall_sum_mul_finrank_hom_res_eq_zero, where trace identities valid on -regular elements in characteristic are propagated to all elements of the group.
import Mathlib set_option maxHeartbeats 4000000 set_option synthInstance.maxHeartbeats 400000 set_option backward.isDefEq.respectTransparency.types false set_option autoImplicit false open CategoryTheory MonoidalCategory Module open scoped Classical
theorem exists_commute_mul_eq_orderOf_coprime_pow_prime_pow_eq_one
(p : ℕ) [Fact p.Prime] {G : Type} [Group G] [Finite G] (g : G) :
∃ g' u : G, g' * u = g ∧ Commute g' u ∧ (orderOf g').Coprime p ∧ (∃ a : ℕ, u ^ p ^ a = 1) ∧
g' ∈ Subgroup.zpowers g ∧ u ∈ Subgroup.zpowers g := by sorry