Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passaudited 2026-09-27
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

Fusion control forces trivial Sylow intersection with the p residual

Statement

Let G be a finite group, p a prime and P∈Syl⁡p(G) a Sylow p-subgroup (Sylow p-subgroups of a finite group), and put K:=Op(G), the p-residual (P residual of a finite group). Suppose that P controls fusion in P with respect to G (Control of fusion in a sylow p subgroup) and set Q:=P∩K. Then Q={1}: that is, P∩Op(G)={1}.

More precisely, if Q≠{1}, then the transfer V ⁣:K→Q/[Q,P] of the quotient map Q→Q/[Q,P] (Transfer homomorphism for a finite index subgroup, Transfer is a homomorphism, Subgroup commutators and the lower central series) is a nontrivial homomorphism onto a nontrivial finite abelian p-group, so Op(K)<K; since Op(Op(G))=Op(G) by P residual is generated by p prime elements and idempotent, this is a contradiction.

Facts & Assumptions

Given: A finite group G, a prime p, a Sylow p-subgroup P≤G controlling fusion in P with respect to G, and K:=Op(G), Q:=P∩K≠{1}.

[F1]

K⊴G, G/K is a finite p-group, KP=G, and Q=P∩K is a Sylow p-subgroup of K; in particular K is finite and [K:Q]=∣K∣/∣Q∣ is prime to p, since ∣Q∣ is the exact power of p dividing ∣K∣ (P residual of a finite group, Sylow subgroups of a normal subgroup are intersections with Sylow subgroups, Sylow p-subgroups of a finite group, If [G:N] is finite then ∣G/N∣=[G:N]; for finite G this equals ∣G∣/∣N∣, Lagrange's theorem: ∣G∣=[G:H]∣H∣ for every subgroup H of a finite group G).

[F2]

Q⊴P: for u∈P one has uQu−1=u(P∩K)u−1=uPu−1∩uKu−1=P∩K=Q, because uPu−1=P and K⊴G (Normal subgroup: invariance under conjugation, Subgroup, Conjugation x↦gxg−1 is an automorphism).

[F3]

Commutators: [a,b]=aba−1b−1, [A,B]=⟨[a,b]:a∈A,b∈B⟩, and [P,Q]=[Q,P] as subgroups because [p,q]=[q,p]−1; if A≤B and D≤C with A,B≤C then [A,D]≤[B,D] (Subgroup commutators and the lower central series, Commutators [g,h]=ghg−1h−1 and the commutator subgroup [G,G], The subgroup ⟨S⟩ generated by a subset, the cyclic subgroup ⟨g⟩, and cyclic groups, Subgroup, In a group e−1=e, (g−1)−1=g and (gh)−1=h−1g−1, the order of the last product being essential).

[F4]

Both P and Q are finite p-groups, Q≠{1} and Q⊴P; so by Normal p subgroup has proper commutator in a p group the commutator [Q,P] satisfies [Q,P]<Q and [Q,P]⊴Q (A finite p-group has order pn for a prime p and some n∈N, Every subgroup of a finite p-group has order a power of p).

[F7]

For q∈Q and u∈P one has quq−1=[u,q]∈[Q,P] and therefore φ(qu)=φ(q) (The conjugacy class Cl⁡G(x) and centralizer CG(x) of an element, Commutators [g,h]=ghg−1h−1 and the commutator subgroup [G,G], [F3], [F6]).

[F8]

The transfer of the homomorphism φ ⁣:Q→A is a group homomorphism V:=Vφ ⁣:K→A, independent of the transversal (Transfer homomorphism for a finite index subgroup, Transfer is a homomorphism, Transfer is independent of the transversal), and it is computed by the cycle decomposition of Transfer cycle decomposition formula: for x∈K the right cosets Q\K split into orbits C1,…,Cr of right multiplication by ⟨x⟩ of lengths ni, with representatives ti, and V(x)=∏i=1rφ(tixniti−1), where tixniti−1∈Q. The orbits partition the finite set Q\K, which has [K:Q] elements, so n1+⋯+nr=[K:Q] (The coset set G/H and the index [G:H] of a subgroup, Left and right cosets gH and Hg of a subgroup, Left group actions, transitive actions, and faithful actions, The orbits of a group action are the equivalence classes of x∼y iff y=g⋅x for some g, and hence partition the acted-on set, The orbit G⋅x and stabilizer Gx of a point in a group action).

[F10]

Every homomorphism from K to a finite p-group has Op(K) in its kernel, and Op(K)=K when K=Op(G) (P residual of a finite group, P residual is generated by p prime elements and idempotent).

Proof

technique · direct
1.1

Q is a nontrivial normal subgroup of the finite p-group P by [F1], [F2] and [F5]; so, with the commutator subgroup [Q,P] as in [F3], Normal p subgroup has proper commutator in a p group applies and gives [Q,P]<Q together with [Q,P]⊴Q. Hence A:=Q/[Q,P] is a nontrivial finite abelian p-group, and the quotient map φ ⁣:Q→A is a surjective homomorphism with ker⁡φ=[Q,P].

F3F4F5F6
2.1

Let V ⁣:K→A be the transfer of φ; by [F8] it is a group homomorphism, and for x∈K and each orbit Ci of the cycle decomposition the factor tixniti−1 lies in Q.

F8step 1.1
3.1

Fix x∈Q. For each i, the element tixniti−1=(xni)ti with ti∈K is K-conjugate to xni∈Q; both lie in Q⊆P, so the fusion-control hypothesis provides ui∈P with tixniti−1=(xni)ui. By [F7] and [F6], φ(tixniti−1)=φ(xni)=φ(x)ni.

F7F8givenstep 2.1
4.1

Consequently V(x)=∏i=1rφ(x)ni=φ(x)n1+⋯+nr=φ(x)[K:Q], the middle step because A is abelian and the last by [F8].

F5F8step 3.1
5.1

Since [Q,P]<Q, choose x∈Q∖[Q,P]; then φ(x)≠1 by [F6]. Put m:=[K:Q], which is prime to p by [F1]. If φ(x)m=1, then ord⁡(φ(x)) divides both m and ∣A∣, which is a power of p, so by [F9] ord⁡(φ(x))=1, that is φ(x)=1, a contradiction. Hence V(x)=φ(x)m≠1, and V is not the trivial homomorphism. Moreover a↦am is an endomorphism of the finite abelian group A with trivial kernel by the same order argument, so it is bijective. Since φ:Q→A is onto, step 4.1 gives V(Q)=A and therefore V:K→A is onto.

F1F6F9step 4.1
6.1

On the other hand V maps K to the finite p-group A, so Op(K)≤ker⁡V by [F10]; since K=Op(G), [F10] also gives Op(K)=K, hence K≤ker⁡V and V is trivial, contradicting step 5.1. Therefore the assumption Q≠{1} is false: Q=P∩K=P∩Op(G)={1}. ∎

F10step 5.1

Depends on

Used by

Dependency tree · two levels

95 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources