Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-generatedaudited 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.

Control of fusion in a sylow p subgroup

Definition

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). Following the convention xg=gxg−1 of The conjugacy class Cl⁡G(x) and centralizer CG(x) of an element, we say that

P controls fusion in P with respect to G

when, for all x,y∈P, the existence of g∈G with y=xg implies the existence of u∈P with y=xu. Equivalently: any two elements of P that are G-conjugate are already conjugate by an element of P; equivalently, the conjugacy class of x in G meets P in exactly the conjugacy class of x under P (Subgroup, The normalizer NG(H)={g∈G:gHg−1=H} of a subgroup).

What is and is not claimed. This is a statement about element fusion only: it says nothing about when two subgroups of P are conjugate in G, and nothing about elements of G outside P. It is a property of the pair (G,P), and it is invariant under conjugating P: if g∈G and the Sylow P controls fusion in P with respect to G, then Pg=gPg−1 controls fusion in Pg with respect to G, because y=xu implies yg=(xg)gug−1 and gug−1∈Pg whenever u∈P. Control by P implies control by NG(P), since P≤NG(P): every conjugating element supplied inside P also belongs to NG(P). When NG(P)=P the two conditions are identical, but this equality alone does not assert that either condition holds.

Depends on

Used by

Dependency tree · two levels

11 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