Cluster k0298
Irreducibility criteria for Galois representations and permutation counts
Files aiming to show that a matrix representation of a group cannot be split into smaller ones, using only its characteristic polynomial data. The main statement gives a criterion in terms of a "good tuple" of polynomials. Supporting files include a theorem that a solvable transitive permutation group cannot contain a cycle of prime length in a certain range, that the alternating group on five or more points is not solvable, a count of permutations with a given cycle type, and local estimates summing weights of polynomials. The group theory and the counting estimates are different jobs under one goal.
4 import steps from the main theorem.
Proof status: on 21 Nov 2026 the Lean FRO and the Mathlib Initiative certified the Lean statement and proof (latest check). Names and descriptions on this map are written by Claude from samples of the code and may be wrong.
Prerequisite concepts
Groups and homomorphismsLinear algebraPolynomialsFinite sets and countingGroup actions: orbits, stabilizers, fixed pointsCosets, normalizers and quotient groups
References
John Dixon and Brian Mortimer, Permutation Groups · ch. 3 (Jordan's theorem on primitive groups)Background reading suggested by the AI namer · unchecked
Uses
Used by
69 Lean files, main folder Formalism.PadicSubsetSums.StableGradedCounts.