Group_of_Permutations_either_All_or_Half_Even_v2
Provedeven-permutationsgroup-theoryparitypermutationsproofwiki
Let be a group of permutations. Then either ''exactly half'' of the permutations in are even, or they are ''all'' even.
Preamble
import Mathlib.Analysis.Complex.Basic import Mathlib.GroupTheory.Perm.Cycle.Type
Formal statement
theorem Group_of_Permutations_either_All_or_Half_Even_v2 {α : Type _} [DecidableEq α] [Fintype α] (G : Subgroup (Equiv.Perm α)) [Fintype G] : (∀ g : G, Equiv.Perm.sign (g : Equiv.Perm α) = 1) ∨ 2 * (Finset.univ.filter (fun g : G => Equiv.Perm.sign (g : Equiv.Perm α) = 1)).card = Fintype.card G := by sorrySource