exists_complete_mapping_stabilizing_sylow_two_of_normal
Let G be a finite group, N a normal subgroup and P a Sylow 2-subgroup of G. If N has a complete mapping stabilizing P ∩ N and G/N has a complete mapping stabilizing PN/N, then G has a complete mapping stabilizing P.
Statement
theorem exists_complete_mapping_stabilizing_sylow_two_of_normal {G : Type*} [Group G] [Finite G] (N : Subgroup G) [N.Normal] (P : Sylow 2 G) (hN : ∃ φ : N → N, group_is_complete_mapping φ ∧ φ '' {x : N | (x : G) ∈ (P : Subgroup G)} = {x : N | (x : G) ∈ (P : Subgroup G)}) (hQ : ∃ θ : G ⧸ N → G ⧸ N, group_is_complete_mapping θ ∧ θ '' ((P : Subgroup G).map (QuotientGroup.mk' N) : Set (G ⧸ N)) = ((P : Subgroup G).map (QuotientGroup.mk' N) : Set (G ⧸ N))) : ∃ θ : G → G, group_is_complete_mapping θ ∧ θ '' ((P : Subgroup G) : Set G) = ((P : Subgroup G) : Set G)
- Formalizes
- arXiv:2610.17631 (Complete mappings stabilizing Sylow 2-subgroups in central quotients of special linear groups), Lemma 3.2.
- Verified
- 16 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 1
- group_is_complete_mappingA complete mapping of a group G is a permutation θ of G such that x ↦ xθ(x) is also a permutation of G.
The proof, explained
The proof constructs a complete mapping θ on G stabilizing P by extending the given complete mappings φ on N and τ on G/N. Coset representatives x(t) for t ∈ G/N are chosen in P whenever t belongs to the projection π(P). Two bijections A, B : (G/N) × N → G are defined such that their product is also bijective, allowing θ = B ∘ A⁻¹ to serve as a complete mapping on G. A careful containment check shows θ(P) ⊆ P, from which injectivity and finiteness imply θ(P) = P.
Obtain complete mappings φ on N and τ on G/N, and record that they map elements of P ∩ N into P and cosets in π(P) into π(P).
From the hypotheses hN and hQ, we extract complete mappings φ : N → N and τ : G/N → G/N stabilizing P ∩ N and π(P) respectively. Since φ(P ∩ N) = P ∩ N and τ(π(P)) = π(P), any n ∈ P ∩ N satisfies φ(n) ∈ P, and any coset t ∈ π(P) satisfies τ(t) ∈ π(P).
classical obtain ⟨φ, ⟨hφ, hφc⟩, hφP⟩ := hN obtain ⟨τ, ⟨hτ, hτc⟩, hτP⟩ := hQ have hφP' : ∀ n : N, (n : G) ∈ (P : Subgroup G) → (φ n : G) ∈ (P : Subgroup G) := by intro n hn have : φ n ∈ φ '' {x : N | (x : G) ∈ (P : Subgroup G)} := ⟨n, hn, rfl⟩ rw [hφP] at this exact this have hτP' : ∀ t, t ∈ (P : Subgroup G).map (QuotientGroup.mk' N) → τ t ∈ (P : Subgroup G).map (QuotientGroup.mk' N) := by intro t ht have : τ t ∈ τ '' ((P : Subgroup G).map (QuotientGroup.mk' N) : Set (G ⧸ N)) := ⟨t, ht, rfl⟩ rw [hτP] at this exact this
Choose coset representatives x : G/N → G such that x(t) ∈ P whenever t ∈ π(P), and note that elements of N project to 1 in G/N.
For each coset t ∈ G/N, if t lies in the projection π(P), we choose a representative in P; otherwise, by surjectivity of the quotient map, we pick an arbitrary representative in G. The axiom of choice yields a selection function x : G/N → G satisfying π(x(t)) = t and x(t) ∈ P when t ∈ π(P). We also note that elements of N project to 1 in G/N.
uses
Subgroup.mem_map.1,QuotientGroup.mk_surjective,QuotientGroup.eq_one_iff-- representatives, chosen in P over the image of P have hrep : ∀ t : G ⧸ N, ∃ g : G, (g : G ⧸ N) = t ∧ (t ∈ (P : Subgroup G).map (QuotientGroup.mk' N) → g ∈ (P : Subgroup G)) := by intro t by_cases ht : t ∈ (P : Subgroup G).map (QuotientGroup.mk' N) · obtain ⟨p, hp, rfl⟩ := Subgroup.mem_map.1 ht exact ⟨p, rfl, fun _ => hp⟩ · obtain ⟨g, rfl⟩ := QuotientGroup.mk_surjective t exact ⟨g, rfl, fun h => absurd h ht⟩ choose x hx hxP using hrep have hmkN : ∀ n : N, ((n : G) : G ⧸ N) = 1 := fun n => (QuotientGroup.eq_one_iff (n : G)).2 n.2
Define coordinate maps A, B : (G/N) × N → G and compute their projections to G/N and their product.
We define A(t, n) = x(t) * x(τ(t)) * n * (x(τ(t)))⁻¹ and B(t, n) = x(τ(t)) * φ(n). In the quotient G/N, since elements of N project to 1, we compute π(A(t, n)) = t and π(B(t, n)) = τ(t). Group simplification shows that the product is A(t, n) * B(t, n) = x(t) * x(τ(t)) * (n * φ(n)).
uses
QuotientGroup.mk_mul,QuotientGroup.mk_inv,mul_one,Subgroup.coe_mullet A : (G ⧸ N) × N → G := fun p => x p.1 * x (τ p.1) * (p.2 : G) * (x (τ p.1))⁻¹ let B : (G ⧸ N) × N → G := fun p => x (τ p.1) * (φ p.2 : G) have hAmk : ∀ p, ((A p : G) : G ⧸ N) = p.1 := by intro p simp only [A, QuotientGroup.mk_mul, QuotientGroup.mk_inv, hx, hmkN] group have hBmk : ∀ p, ((B p : G) : G ⧸ N) = τ p.1 := by intro p simp only [B, QuotientGroup.mk_mul, hx, hmkN, mul_one] have hAB : ∀ p, A p * B p = x p.1 * x (τ p.1) * ((p.2 * φ p.2 : N) : G) := by intro p simp only [A, B, Subgroup.coe_mul] group
The maps A, B, and p ↦ A(p) * B(p) are all bijections between (G/N) × N and G.
Lagrange's theorem shows |G| = |G/N| * |N| = |(G/N) × N|. To show A is injective, if A(t, n) = A(t', n'), projecting to G/N gives t = t', and then group cancellation yields n = n'. For B, projecting to G/N gives τ(t) = τ(t'), so t = t' by injectivity of τ, and cancelling x(τ(t)) gives φ(n) = φ(n'), whence n = n' by injectivity of φ. For A * B, projecting to G/N gives t * τ(t) = t' * τ(t'), so t = t' because τ is a complete mapping; then n * φ(n) = n' * φ(n') implies n = n' because φ is a complete mapping. Since the domain and codomain are finite of the same size, injectivity implies bijectivity for all three maps.
uses
Nat.card_prod,Subgroup.card_eq_card_quotient_mul_card_subgroup,mul_left_inj,mul_right_inj,Prod.ext,Subtype.ext,congrArg,QuotientGroup.mk_mulhave hcard : Nat.card G ≤ Nat.card ((G ⧸ N) × N) := by rw [Nat.card_prod, ← Subgroup.card_eq_card_quotient_mul_card_subgroup] have hAinj : Function.Injective A := by rintro ⟨t, n⟩ ⟨t', n'⟩ h have ht : t = t' := by have e1 := hAmk (t, n) have e2 := hAmk (t', n') rw [h] at e1 exact e1.symm.trans e2 subst ht simp only [A, mul_left_inj, mul_right_inj] at h exact Prod.ext rfl (Subtype.ext h) have hBinj : Function.Injective B := by rintro ⟨t, n⟩ ⟨t', n'⟩ h have ht : t = t' := hτ.1 (by rw [← hBmk (t, n), ← hBmk (t', n'), h]) subst ht simp only [B, mul_right_inj] at h exact Prod.ext rfl (hφ.1 (Subtype.ext h)) have hCinj : Function.Injective fun p => A p * B p := by rintro ⟨t, n⟩ ⟨t', n'⟩ h have h' : A (t, n) * B (t, n) = A (t', n') * B (t', n') := h have ht : t = t' := by apply hτc.1 have e1 := hAmk (t, n) have e2 := hBmk (t, n) have e3 := hAmk (t', n') have e4 := hBmk (t', n') have := congrArg (fun g : G => (g : G ⧸ N)) h' simp only [QuotientGroup.mk_mul] at this rw [e1, e2, e3, e4] at this exact this subst ht rw [hAB, hAB] at h' simp only [mul_right_inj] at h' exact Prod.ext rfl (hφc.1 (Subtype.ext h')) have hAbij : Function.Bijective A := hAinj.bijective_of_nat_card_le hcard have hBbij : Function.Bijective B := hBinj.bijective_of_nat_card_le hcard have hCbij : Function.Bijective fun p => A p * B p := hCinj.bijective_of_nat_card_le hcard
The map θ = B ∘ A⁻¹ : G → G is a complete mapping on G.
Using the bijection A to form an equivalence eA : (G/N) × N ≃ G, we define θ(g) = B(eA.symm(g)). As a composition of bijections B and eA.symm, θ is bijective. Furthermore, g * θ(g) = A(eA.symm(g)) * B(eA.symm(g)) = (p ↦ A(p) * B(p))(eA.symm(g)), which is also a composition of bijections and thus bijective. Hence θ is a complete mapping on G.
uses
Equiv.ofBijective,Function.complet eA := Equiv.ofBijective A hAbij have heA : ∀ g, A (eA.symm g) = g := fun g => eA.apply_symm_apply g refine ⟨fun g => B (eA.symm g), ⟨hBbij.comp eA.symm.bijective, ?_⟩, ?_⟩ · have : (fun g => g * B (eA.symm g)) = (fun p => A p * B p) ∘ eA.symm := by funext g simp only [Function.comp, heA] rw [this] exact hCbij.comp eA.symm.bijective
The complete mapping θ maps the subgroup P into itself: θ(P) ⊆ P.
Let g ∈ P and write g = A(t, n) with (t, n) = eA.symm(g). Projecting to G/N gives t = π(g) ∈ π(P). By our choice of coset representatives, x(t) ∈ P, and since τ stabilizes π(P), τ(t) ∈ π(P), which gives x(τ(t)) ∈ P. Solving for n gives n = (x(t) * x(τ(t)))⁻¹ * g * x(τ(t)), which lies in P because g, x(t), and x(τ(t)) all belong to P. Thus n ∈ P ∩ N, so φ(n) ∈ P because φ stabilizes P ∩ N. It follows that θ(g) = B(t, n) = x(τ(t)) * φ(n) is a product of elements of P, hence in P.
uses
Subgroup.mem_map_of_mem,mul_mem,inv_mem· have hsub : (fun g => B (eA.symm g)) '' ((P : Subgroup G) : Set G) ⊆ ((P : Subgroup G) : Set G) := by rintro _ ⟨g, hg, rfl⟩ set p := eA.symm g with hp have hAp : A p = g := heA g have hq : p.1 ∈ (P : Subgroup G).map (QuotientGroup.mk' N) := by rw [← hAmk p, hAp] exact Subgroup.mem_map_of_mem _ hg have h1 := hxP _ hq have h2 := hxP _ (hτP' _ hq) have hn : ((p.2 : N) : G) ∈ (P : Subgroup G) := by have : ((p.2 : N) : G) = (x p.1 * x (τ p.1))⁻¹ * g * x (τ p.1) := by rw [← hAp] simp only [A] group rw [this] exact mul_mem (mul_mem (inv_mem (mul_mem h1 h2)) hg) h2 exact mul_mem h2 (hφP' _ hn)
The mapping θ stabilizes P, that is, θ(P) = P.
Since θ is injective, the image θ(P) has the same finite cardinality as P. Because θ(P) ⊆ P and P is finite, this implies θ(P) = P.
uses
Set.eq_of_subset_of_ncard_le,Set.ncard_image_of_injectivehave hinj : Function.Injective fun g => B (eA.symm g) := hBinj.comp eA.symm.injective exact Set.eq_of_subset_of_ncard_le hsub (by rw [Set.ncard_image_of_injective _ hinj])
Prod.ext- Two pairs are equal if and only if both their first components and their second components are equal.
QuotientGroup.mk_inv- The canonical projection from a group to a quotient group preserves inverses: π(a⁻¹) = π(a)⁻¹.
QuotientGroup.mk_mul- The canonical projection from a group to a quotient group preserves multiplication: π(a b) = π(a) π(b).
mul_one- Multiplying by the identity on the right leaves an element unchanged: a * 1 = a.
QuotientGroup.mk_surjective- The canonical projection from a group to a quotient group is surjective.
QuotientGroup.eq_one_iff- An element projects to the trivial element in the quotient group G/N if and only if it belongs to N.
Subgroup.coe_mul- The coercion of a product of subgroup elements to the ambient group equals the product of their coercions: ↑(x * y) = ↑x * ↑y.
Nat.card_prod- The cardinality of the Cartesian product of two types is the product of their cardinalities: |α × β| = |α| * |β|.
Subgroup.card_eq_card_quotient_mul_card_subgroup- Lagrange's index formula: for any subgroup N of a group G, |G| = |G/N| * |N|.
mul_left_inj- In a group, right multiplication by an element is injective: b * a = c * a ↔ b = c.
mul_right_inj- In a group, left multiplication by an element is injective: a * b = a * c ↔ b = c.
Subtype.ext- Two subtype elements are equal if their underlying values are equal.
congrArg- Equal arguments yield equal function values: if a = b then f(a) = f(b).
Equiv.ofBijective- A bijective function can be promoted to a two-sided type equivalence (a bijection with an inverse).
Function.comp- The definition of function composition: (f ∘ g)(x) = f(g(x)).
Subgroup.mem_map_of_mem- If x belongs to a subgroup K, its image f(x) belongs to the image subgroup f(K).
mul_mem- A subgroup is closed under multiplication: if a ∈ S and b ∈ S, then a * b ∈ S.
inv_mem- A subgroup is closed under inverses: if x ∈ S, then x⁻¹ ∈ S.
Set.eq_of_subset_of_ncard_le- If s ⊆ t and |t| ≤ |s| for a finite set t, then s = t.
Set.ncard_image_of_injective- An injective function preserves the cardinality of any set: |f '' s| = |s|.
Subgroup.mem_map.1- An element belongs to the image of a subgroup under f if and only if it is of the form f(x) for some x in the subgroup.
Written by a model (gemini-3.8-flash) from the Lean proof and the goal states Lean reported at each step. Lean verified the proof; this explanation is a reading aid and is not itself machine-checked.
Lean source view module on GitHub
Choose a tactic — a marked line — to see the goals Lean had before and after it, as in Lean’s infoview. Step with ← → or j k.
theorem exists_complete_mapping_stabilizing_sylow_two_of_normal {G : Type*} [Group G] [Finite G] (N : Subgroup G) [N.Normal] (P : Sylow 2 G) (hN : ∃ φ : N → N, group_is_complete_mapping φ ∧ φ '' {x : N | (x : G) ∈ (P : Subgroup G)} = {x : N | (x : G) ∈ (P : Subgroup G)}) (hQ : ∃ θ : G ⧸ N → G ⧸ N, group_is_complete_mapping θ ∧ θ '' ((P : Subgroup G).map (QuotientGroup.mk' N) : Set (G ⧸ N)) = ((P : Subgroup G).map (QuotientGroup.mk' N) : Set (G ⧸ N))) : ∃ θ : G → G, group_is_complete_mapping θ ∧ θ '' ((P : Subgroup G) : Set G) = ((P : Subgroup G) : Set G) := by classical obtain ⟨φ, ⟨hφ, hφc⟩, hφP⟩ := hN obtain ⟨τ, ⟨hτ, hτc⟩, hτP⟩ := hQ have hφP' : ∀ n : N, (n : G) ∈ (P : Subgroup G) → (φ n : G) ∈ (P : Subgroup G) := by intro n hn have : φ n ∈ φ '' {x : N | (x : G) ∈ (P : Subgroup G)} := ⟨n, hn, rfl⟩ rw [hφP] at this exact this have hτP' : ∀ t, t ∈ (P : Subgroup G).map (QuotientGroup.mk' N) → τ t ∈ (P : Subgroup G).map (QuotientGroup.mk' N) := by intro t ht have : τ t ∈ τ '' ((P : Subgroup G).map (QuotientGroup.mk' N) : Set (G ⧸ N)) := ⟨t, ht, rfl⟩ rw [hτP] at this exact this -- representatives, chosen in P over the image of P have hrep : ∀ t : G ⧸ N, ∃ g : G, (g : G ⧸ N) = t ∧ (t ∈ (P : Subgroup G).map (QuotientGroup.mk' N) → g ∈ (P : Subgroup G)) := by intro t by_cases ht : t ∈ (P : Subgroup G).map (QuotientGroup.mk' N) · obtain ⟨p, hp, rfl⟩ := Subgroup.mem_map.1 ht exact ⟨p, rfl, fun _ => hp⟩ · obtain ⟨g, rfl⟩ := QuotientGroup.mk_surjective t exact ⟨g, rfl, fun h => absurd h ht⟩ choose x hx hxP using hrep have hmkN : ∀ n : N, ((n : G) : G ⧸ N) = 1 := fun n => (QuotientGroup.eq_one_iff (n : G)).2 n.2 let A : (G ⧸ N) × N → G := fun p => x p.1 * x (τ p.1) * (p.2 : G) * (x (τ p.1))⁻¹ let B : (G ⧸ N) × N → G := fun p => x (τ p.1) * (φ p.2 : G) have hAmk : ∀ p, ((A p : G) : G ⧸ N) = p.1 := by intro p simp only [A, QuotientGroup.mk_mul, QuotientGroup.mk_inv, hx, hmkN] group have hBmk : ∀ p, ((B p : G) : G ⧸ N) = τ p.1 := by intro p simp only [B, QuotientGroup.mk_mul, hx, hmkN, mul_one] have hAB : ∀ p, A p * B p = x p.1 * x (τ p.1) * ((p.2 * φ p.2 : N) : G) := by intro p simp only [A, B, Subgroup.coe_mul] group have hcard : Nat.card G ≤ Nat.card ((G ⧸ N) × N) := by rw [Nat.card_prod, ← Subgroup.card_eq_card_quotient_mul_card_subgroup] have hAinj : Function.Injective A := by rintro ⟨t, n⟩ ⟨t', n'⟩ h have ht : t = t' := by have e1 := hAmk (t, n) have e2 := hAmk (t', n') rw [h] at e1 exact e1.symm.trans e2 subst ht simp only [A, mul_left_inj, mul_right_inj] at h exact Prod.ext rfl (Subtype.ext h) have hBinj : Function.Injective B := by rintro ⟨t, n⟩ ⟨t', n'⟩ h have ht : t = t' := hτ.1 (by rw [← hBmk (t, n), ← hBmk (t', n'), h]) subst ht simp only [B, mul_right_inj] at h exact Prod.ext rfl (hφ.1 (Subtype.ext h)) have hCinj : Function.Injective fun p => A p * B p := by rintro ⟨t, n⟩ ⟨t', n'⟩ h have h' : A (t, n) * B (t, n) = A (t', n') * B (t', n') := h have ht : t = t' := by apply hτc.1 have e1 := hAmk (t, n) have e2 := hBmk (t, n) have e3 := hAmk (t', n') have e4 := hBmk (t', n') have := congrArg (fun g : G => (g : G ⧸ N)) h' simp only [QuotientGroup.mk_mul] at this rw [e1, e2, e3, e4] at this exact this subst ht rw [hAB, hAB] at h' simp only [mul_right_inj] at h' exact Prod.ext rfl (hφc.1 (Subtype.ext h')) have hAbij : Function.Bijective A := hAinj.bijective_of_nat_card_le hcard have hBbij : Function.Bijective B := hBinj.bijective_of_nat_card_le hcard have hCbij : Function.Bijective fun p => A p * B p := hCinj.bijective_of_nat_card_le hcard let eA := Equiv.ofBijective A hAbij have heA : ∀ g, A (eA.symm g) = g := fun g => eA.apply_symm_apply g refine ⟨fun g => B (eA.symm g), ⟨hBbij.comp eA.symm.bijective, ?_⟩, ?_⟩ · have : (fun g => g * B (eA.symm g)) = (fun p => A p * B p) ∘ eA.symm := by funext g simp only [Function.comp, heA] rw [this] exact hCbij.comp eA.symm.bijective · have hsub : (fun g => B (eA.symm g)) '' ((P : Subgroup G) : Set G) ⊆ ((P : Subgroup G) : Set G) := by rintro _ ⟨g, hg, rfl⟩ set p := eA.symm g with hp have hAp : A p = g := heA g have hq : p.1 ∈ (P : Subgroup G).map (QuotientGroup.mk' N) := by rw [← hAmk p, hAp] exact Subgroup.mem_map_of_mem _ hg have h1 := hxP _ hq have h2 := hxP _ (hτP' _ hq) have hn : ((p.2 : N) : G) ∈ (P : Subgroup G) := by have : ((p.2 : N) : G) = (x p.1 * x (τ p.1))⁻¹ * g * x (τ p.1) := by rw [← hAp] simp only [A] group rw [this] exact mul_mem (mul_mem (inv_mem (mul_mem h1 h2)) hg) h2 exact mul_mem h2 (hφP' _ hn) have hinj : Function.Injective fun g => B (eA.symm g) := hBinj.comp eA.symm.injective exact Set.eq_of_subset_of_ncard_le hsub (by rw [Set.ncard_image_of_injective _ hinj])