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.

Local sylow conjugacy ascent for fusion

Statement

Let G be a finite group, p a prime and P∈Syl⁡p(G). Suppose that for every nontrivial p-subgroup S≤P and every x∈S with x≠e, the centralizer CNG(S)(x) acts transitively on the Sylow p-subgroups of NG(S) containing x (P local normalizer for normal complement theory). Then NG(P) controls fusion in P with respect to G: any two G-conjugate elements of P are conjugate by an element of NG(P) (Control of fusion in a sylow p subgroup).

Facts & Assumptions

Given: A finite group G, a prime p, a Sylow p-subgroup P≤G, and the hypothesis that 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.

[F2]

The local hypothesis says that for every nontrivial p-subgroup S≤P, every x∈S∖{e} and all Sylow p-subgroups T1,T2 of NG(S) containing x, there is c∈CNG(S)(x) with T2=T1c (P local normalizer for normal complement theory).

[F4]

Conjugation z↦gzg−1 is an automorphism, (za)b=zba, equivalently zab=(zb)a; CG(x) and all normalizers are subgroups; v∈NG(T) gives Tv=T, and v∈CG(x) gives xv=x; also S≤NG(S) (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, CG(x) and NG(H) are subgroups of G, The centralizer CG(H) of a subgroup, The conjugacy class Cl⁡G(x) and centralizer CG(x) of an element, Subgroup).

[F5]

Orders: all Sylow p-subgroups of a finite group X have the same order, equal to the exact power of p dividing ∣X∣; a subgroup's order divides the group's order (Sylow p-subgroups of a finite group, Lagrange's theorem: ∣G∣=[G:H]∣H∣ for every subgroup H of a finite group G, Every subgroup of a finite p-group has order a power of p).

[F6]

Strong induction on the positive integer m(Q,R):=∣P∣/∣Q∩R∣, for Sylow p-subgroups Q,R of G: ∣Q∩R∣ divides ∣Q∣=∣P∣ by [F5], so m(Q,R) is a positive integer, and m(Q,R)=1 exactly when Q=R (Strong (complete) induction, Lagrange's theorem: ∣G∣=[G:H]∣H∣ for every subgroup H of a finite group G).

Proof

technique · direct
1.1

Let x∈P, x≠e, and let Ω be the set of Sylow p-subgroups of G containing x. We prove by strong induction on m(Q,R) that any two members Q,R∈Ω are conjugate by an element of CG(x); the case m(Q,R)=1, that is Q=R, is trivial by [F6].

F6given
1.2

The hypothesis extends to every nontrivial p-subgroup of G, not only to those inside P: let S≤G be a nontrivial p-subgroup and choose d∈G with Sd≤P by [F1], so that NG(Sd)=NG(S)d and conjugation by d carries Sylow p-subgroups of NG(S) to Sylow p-subgroups of NG(Sd). If x∈S∖{e} and T1,T2 are Sylow p-subgroups of NG(S) containing x, then xd∈Sd∖{e} and T1d,T2d are Sylow p-subgroups of NG(Sd) containing xd, so [F2] applied to the nontrivial p-subgroup Sd≤P provides c′∈CNG(Sd)(xd) with (T1d)c′=T2d. Then c:=c′d−1 normalizes S and centralizes x, so c∈CNG(S)(x), and conjugating the displayed equality by d−1 gives T1c=T2; hence the form [F2] of the hypothesis holds for S.

F1F2F4algebra
2.1

For the induction step let Q,R∈Ω with S:=Q∩R and m(Q,R)>1, so that S<Q and S<R by [F6]; note x∈S, so S is a nontrivial p-subgroup, being a subgroup of the p-group Q by [F5]. By [F3] there are NQ(S) and NR(S) with S<NQ(S)≤Q and S<NR(S)≤R.

F3F5F6step 1.1
3.1

Put N:=NG(S), which is a p-local normalizer; by [F1] there is a Sylow p-subgroup TQ of N with NQ(S)≤TQ and a Sylow p-subgroup TR of N with NR(S)≤TR; then x∈S<NQ(S)≤TQ and x∈S<NR(S)≤TR by [F4]. By [F2] in the form of step 1.2, applied to the nontrivial p-subgroup S of step 2.1, the element x∈S and the Sylows TQ,TR of NG(S) containing x, there is c∈CNG(S)(x) with TQc=TR.

F1F2F4step 2.1step 1.2
4.1

By [F1] choose Sylow p-subgroups Q∗,R∗ of G with TQ≤Q∗ and TR≤R∗. Then x∈TQ≤Q∗ and x∈TR≤R∗, so Q∗,R∗∈Ω. Moreover S<NQ(S)≤Q∩Q∗ and S<NR(S)≤R∩R∗, and since TR=TQc≤(Q∗)c also TR≤(Q∗)c∩R∗ with ∣TR∣≥∣NR(S)∣>∣S∣. Hence m(Q,Q∗)<m(Q,R), m(R,R∗)<m(Q,R) and m((Q∗)c,R∗)<m(Q,R) by [F5] and [F6].

F1F5F6step 2.1step 3.1
5.1

Also (Q∗)c∈Ω because xc=x and x∈Q∗, and c∈CG(x), so (Q∗)c is CG(x)-conjugate to Q∗.

F4step 3.1step 4.1
6.1

The induction hypothesis of step 1.1 applies to the pairs (Q,Q∗), ((Q∗)c,R∗) and (R∗,R), all of whose measures are smaller than m(Q,R): Q is CG(x)-conjugate to Q∗, (Q∗)c to R∗, and R∗ to R. Since CG(x)-conjugacy is an equivalence relation, and since (Q∗)c is CG(x)-conjugate to Q∗ by step 5.1, the element Q is CG(x)-conjugate to R, completing the induction.

step 1.1step 4.1step 5.1algebra
7.1

We have shown that for every x∈P with x≠e, CG(x) acts transitively on the Sylow p-subgroups of G containing x; by Fusion control and centralizer transitivity are equivalent applied with H:=G, the normalizer NG(P) controls fusion in P with respect to G. ∎

step 1.1step 6.1

Depends on

Used by

Dependency tree · two levels

59 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