B. H. Neumann's lemma on coset coverings
ProvedFamousTheorems.neumann_coset_cover_6bB. H. Neumann's lemma on coset coverings. Let be a group covered by finitely many left cosets of subgroups . Then at least one has finite index, and in fact for some .
B. H. Neumann proved this in 1954. It shows that a group cannot be covered by finitely many cosets of infinite-index subgroups, so, for example, is not a finite union of cosets of cyclic subgroups. It is used in the theory of FC-groups, in model theory and in combinatorial group theory.
Formalization note. Mathlib's Subgroup.exists_index_le_card_of_leftCoset_cover. The cover is indexed by a finite set , g i • (H i : Set G) is the left coset , and FiniteIndex together with index ≤ s.card gives .
Preamble
import Mathlib
Formal statement
namespace FamousTheorems
open Pointwise
theorem neumann_coset_cover_6b {G ι : Type*} [Group G] {H : ι → Subgroup G} {g : ι → G} {s : Finset ι}
(hcovers : ⋃ i ∈ s, g i • (H i : Set G) = Set.univ) :
∃ i ∈ s, (H i).FiniteIndex ∧ (H i).index ≤ s.card := by sorry
end FamousTheoremsSource
Listed in Mathlib's curated theorem manifests (docs/1000.yaml); formalized in Mathlib as `Subgroup.exists_index_le_card_of_leftCoset_cover`. Proof here reduces to that Mathlib result.