A subnormal Hall subgroup is normal
ProvedSubnormalCover.normal_of_isSubnormal_of_coprimeLet be a finite group and let be a Hall subgroup of , i.e. one with . If is subnormal in , then is normal in . This is immediate from Lemma 2.2: , so no prime divisor of divides , forcing . Formalization note: "Hall" is spelled Nat.Coprime (Nat.card H) H.index, which is the standard meaning in a finite group because Nat.card ↥H * H.index = Nat.card G; the conclusion is the Prop-valued class Subgroup.Normal used directly as the goal.
import Mathlib
namespace SubnormalCover
/-- **Sun, Corollary 2.1.**
A subnormal Hall subgroup of a finite group is normal. A Hall subgroup is one whose order is
coprime to its index, which in a finite group is spelled `Nat.Coprime (Nat.card H) H.index`
since `Nat.card H * H.index = Nat.card G`. -/
theorem normal_of_isSubnormal_of_coprime {G : Type*} [Group G] [Finite G] (H : Subgroup G)
(hsn : H.IsSubnormal) (hHall : Nat.Coprime (Nat.card H) H.index) :
H.Normal := by
sorry
end SubnormalCoverRead-back
What the Lean code literally says, in plain math · claude-opus-5
Setting. Let be a type in an arbitrary universe with a group structure and with the typeclass assumption that is finite (Finite G, i.e. is in bijection with some ; note this is a finiteness assumption, not a decidability or explicit-cardinality one). Let be a subgroup of .
Hypotheses. Two ordinary hypotheses:
- is subnormal in (
Subgroup.IsSubnormal): the inductive predicate generated by " is subnormal" and "if with subnormal and normal as a subgroup of , then is subnormal"; equivalently there is a finite chain with each term normal in the next. - and are coprime: , where is the number of elements of the subtype (its order; finite and positive here because is finite) and is the number of left cosets, which under the finiteness assumption is likewise finite and positive. This is the only sense in which "Hall" enters; no assumption is made about -sets, Sylow subgroups, or solvability.
Conclusion. is a normal subgroup of : for all and all , (Mathlib's Subgroup.Normal, a Prop-valued class).
Degenerate cases. The hypotheses are satisfiable and include trivial instances: has order , is subnormal, and ; has index , is subnormal, and ; in both cases the conclusion holds trivially. Note that the coprimality is between the order of and its index, in that order of arguments (Nat.Coprime is symmetric, so the direction is immaterial), and that no relation such as is stated as a hypothesis — it is a consequence of being finite, not part of the assertion. The statement uses only standard Mathlib notions; none of the accompanying platform definitions appear in it.
Confirmed by the mission captain (proposal self-audit).