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.

P automizer condition implies fusion control

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). Suppose that for every subgroup Q with 1≠Q≤P the quotient

NG(Q)/CG(Q)

of the normalizer by the centralizer of Q (The normalizer NG(H)={g∈G:gHg−1=H} of a subgroup, The centralizer CG(H) of a subgroup, The quotient group G/N and coset product (gN)(hN)=ghN) is a p-group (A finite p-group has order pn for a prime p and some n∈N), where CG(Q)⊴NG(Q) by The centralizer of a normal subgroup is normal. Then P controls fusion in P with respect to G (Control of fusion in a sylow p subgroup): whenever x,y∈P and y=xg=gxg−1 for some g∈G, there is v∈P with y=xv.

Facts & Assumptions

Given: A finite group G, a prime p, a Sylow p-subgroup P≤G, and the hypothesis that NG(Q)/CG(Q) is a p-group for every subgroup Q with 1≠Q≤P.

[F1]

The hypothesis is conjugation invariant: for a subgroup R≤G and g∈G one has NG(Rg)=NG(R)g and CG(Rg)=CG(R)g, and conjugation by g induces an isomorphism NG(R)/CG(R)→NG(Rg)/CG(Rg). Since every nontrivial p-subgroup of G is conjugate into P (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), the hypothesis therefore holds for every nontrivial p-subgroup R≤G (Conjugation x↦gxg−1 is an automorphism, First isomorphism theorem for groups: G/ker⁡f≅im⁡f, Group isomorphisms, automorphisms and the set Aut⁡(G), The normalizer NG(H)={g∈G:gHg−1=H} of a subgroup, The centralizer CG(H) of a subgroup).

[F2]

If R≤G is a subgroup then CG(R)⊴NG(R), so NG(R)/CG(R) is a quotient group of NG(R) (The centralizer of a normal subgroup is normal, Normal subgroup: invariance under conjugation, The quotient group G/N and coset product (gN)(hN)=ghN).

[F3]

If S is a nontrivial p-subgroup of a finite group H and NH(S)/CH(S) is a p-group, then CH(S) acts transitively on the Sylow p-subgroups of NH(S); in particular, for each x∈S, CNH(S)(x) is transitive on those Sylow subgroups containing x (The local automizer condition gives centralizer conjugacy of Sylow subgroups).

[F4]

Local Sylow conjugacy ascent: if for every nontrivial p-subgroup S≤P and every x∈S∖{e} the centralizer CNG(S)(x) acts transitively on the Sylow p-subgroups of NG(S) containing x, then NG(P) controls fusion in P with respect to G (Local sylow conjugacy ascent for fusion, Control of fusion in a sylow p subgroup).

[F5]

If C⊴N and N/C is a p-group and T∈Syl⁡p(N), then N=TC (Sylow times normal subgroup covers when the index is a p-power, Sylow p-subgroups of a finite group).

[F8]

Conjugation laws and subgroups: xg=gxg−1, (xa)b=xba, equivalently xab=(xb)a; CG(x), CG(R) and all normalizers are subgroups, and c∈CG(R) centralizes every element of R (Conjugation x↦gxg−1 is an automorphism, In a group e−1=e, (g−1)−1=g and (gh)−1=h−1g−1, the order of the last product being essential, The conjugacy class Cl⁡G(x) and centralizer CG(x) of an element, CG(x) and NG(H) are subgroups of G, Subgroup).

Proof

technique · direct
1.1

The hypothesis holds for every nontrivial p-subgroup of G: if R≤G is a nontrivial p-subgroup, [F1] provides g∈G with Rg≤P, so NG(Rg)/CG(Rg) is a p-group and, by [F1], NG(R)/CG(R) is isomorphic to it, hence is a p-group.

F1F6
1.2

If P={1} then the only element of P is e=ee, so P controls fusion in P trivially. Assume now P≠{1}; then the hypothesis applies to the nontrivial subgroup Q:=P≤P, so NG(P)/CG(P) is a p-group, while CG(P)⊴NG(P) by [F2] and P∈Syl⁡p(NG(P)) by [F7]; hence [F5] applies with N=NG(P), C=CG(P) and the Sylow p-subgroup P, giving NG(P)=P CG(P).

F2F5F7given
1.3

Let S≤P be a nontrivial p-subgroup, put N:=NG(S) and C:=CG(S), and let x∈S∖{e}. The hypothesis directly gives that N/C is a p-group, so [F3] applies to the subgroup S≤G and gives that CN(x) acts transitively on the Sylow p-subgroups of N containing x.

F2F3given
2.1

Since S≤P and x∈S∖{e} were arbitrary, step 1.3 verifies the local centralizer-transitivity hypothesis of [F4]. Thus NG(P) controls fusion in P with respect to G.

F4step 1.3
3.1

Equivalently, for every pair a,b∈P with b=ag for some g∈G, step 2.1 supplies an element u∈NG(P) such that b=au.

F4step 2.1
4.1

Finally let x,y∈P and g∈G with y=xg. By step 3.1 there is u∈NG(P) with y=xu; by step 1.2 write u=vc with v∈P and c∈CG(P). Then, by the conjugation law of [F8], y=xvc=(xc)v=xv, because c centralizes x by [F8] and v∈P. Hence P controls fusion in P with respect to G. In this last step the hypothesis at Q=P, not only at the smaller subgroups, is what makes the conjugation action of NG(P) on P inner through the decomposition NG(P)=P CG(P) of step 1.2; for P={1} the statement is vacuous (Control of fusion in a sylow p subgroup). ∎

F8step 3.1step 1.2

Depends on

Used by

Dependency tree · two levels

69 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