Cauchy's theorem for finite groups
ProvedFamousTheorems.cauchy_theorem_finite_groupsCauchy's theorem for finite groups. Let be a finite group and a prime dividing . Then has an element of order .
Cauchy's theorem is a partial converse to Lagrange's theorem for prime divisors. The short proof by McKay counts -tuples with product under cyclic rotation. It is a first step towards the Sylow theorems and is used throughout finite group theory, for example to show that a group of order is cyclic or dihedral.
Formalization note. Mathlib's exists_prime_orderOf_dvd_card'. The group is Finite and its order is Nat.card G. The prime is passed as the instance Fact p.Prime, and orderOf x is the order of x.
Preamble
import Mathlib
Formal statement
namespace FamousTheorems
theorem cauchy_theorem_finite_groups {G : Type*} [Group G] [Finite G] (p : ℕ) [Fact p.Prime] (hdvd : p ∣ Nat.card G) :
∃ x : G, orderOf x = p := by sorry
end FamousTheoremsSource
Listed in Mathlib's curated theorem manifests (docs/1000.yaml); formalized in Mathlib as `exists_prime_orderOf_dvd_card'`. Proof here reduces to that Mathlib result.