Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6-sol)audited 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 and centralizer transitivity are equivalent

Statement

Let H be a finite group, p a prime, and P∈Syl⁡p(H) (Sylow p-subgroups of a finite group). The following are equivalent.

(i) NH(P) controls fusion in P with respect to H: whenever x,y∈P and y=hxh−1 for some h∈H, there is u∈NH(P) with y=uxu−1. (ii) For every x∈P with x≠e, the centralizer CH(x)={h∈H:hx=xh} acts by conjugation transitively on the set Syl⁡p(H;x):={T∈Syl⁡p(H):x∈T} of Sylow p-subgroups of H containing x; that is, for any T1,T2∈Syl⁡p(H;x) there is c∈CH(x) with T2=T1c=cT1c−1.

Facts & Assumptions

Given: A finite group H, a prime p, a Sylow p-subgroup P≤H, and the notation xh=hxh−1 of The conjugacy class Cl⁡G(x) and centralizer CG(x) of an element.

[F1]

Sylow p-subgroups of H are conjugate, and the conjugate of a Sylow p-subgroup by any element of H is again a Sylow p-subgroup (Sylow II: in a finite group every p-subgroup lies in a conjugate of any Sylow p-subgroup, and the Sylow p-subgroups form a single conjugacy class, Sylow p-subgroups of a finite group).

[F3]

CH(x) and NH(P) are subgroups of H; z∈CH(x) satisfies xz=x, and u∈NH(P) satisfies Pu=P (CG(x) and NG(H) are subgroups of G, The centralizer CG(H) of a subgroup, The normalizer NG(H)={g∈G:gHg−1=H} of a subgroup, Subgroup).

[F4]

If T∈Syl⁡p(H), x∈T and h∈H, then Th∈Syl⁡p(H) and xh∈Th; hence conjugation by h carries Syl⁡p(H;x) into Syl⁡p(H;xh), and if c∈CH(x) then Tc∈Syl⁡p(H;x) for every T∈Syl⁡p(H;x) (Sylow II: in a finite group every p-subgroup lies in a conjugate of any Sylow p-subgroup, and the Sylow p-subgroups form a single conjugacy class, Sylow p-subgroups of a finite group, Conjugation x↦gxg−1 is an automorphism).

Proof

technique · direct
1.1

(ii) implies (i). Assume (ii), and let x,y∈P, h∈H with y=xh=hxh−1. If x=e then y=e=ee with e∈NH(P), so assume x≠e. Then x=yh−1 by [F2], so x∈P∩Ph−1; by [F1] and [F4] both P and Ph−1 lie in Syl⁡p(H;x), so (ii) provides c∈CH(x) with Ph−1=Pc.

F1F2F4assume-hyp
1.2

(i) implies (ii). Assume (i). Let x∈P with x≠e and let T∈Syl⁡p(H;x). By [F1] there is g∈H with T=Pg; then x∈Pg gives a:=xg−1=g−1xg∈P, and ag=x by [F2], so a and x are H-conjugate elements of P and (i) provides u∈NH(P) with au=x.

F1F2assume-hyp
2.1

The equality Ph−1=Pc says h−1Ph=cPc−1. Multiplying on the left by h and on the right by h−1 gives P=(hc)P(hc)−1, so n:=hc satisfies Pn=P, that is n∈NH(P).

F2F3step 1.1
3.1

Moreover xn=(hc)x(hc)−1=h(cxc−1)h−1=hxh−1=y, since c centralizes x. So y is conjugate to x by the element n∈NH(P), which proves (i).

F3step 2.1
4.1

Put v:=ug−1, so that v−1=gu−1 and g=v−1u. The identity au=x reads u(g−1xg)u−1=x, that is xv=x by [F2]; hence v∈CH(x). Moreover T=Pg=Pv−1u=(Pu)v−1=Pv−1 by [F2], since u∈NH(P); and v−1∈CH(x). So every member T of Syl⁡p(H;x) equals Pc for the element c:=v−1∈CH(x), which is (ii). ∎

F2F3step 1.2

Depends on

Used by

Dependency tree · two levels

23 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