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.

The p-prime core of a finite group

Definition

Let G be a finite group (Group and abelian group, The cardinality ∣A∣ of a finite set) and let p be a prime (Prime and composite integers: p is prime when p>1 and its only positive divisors are 1 and p).

p-element terminology. An element g∈G of finite order is a p-element when ord⁡(g) is a power of p, and a p′-element when p∤ord⁡(g) (The order ∣G∣ of a finite group and the order ord⁡(g) of an element, with ord⁡(g)=∞ when no positive power of g is the identity, A finite p-group has order pn for a prime p and some n∈N). A subgroup K≤G is a p-subgroup when ∣K∣ is a power of p, and a p′-subgroup when p∤∣K∣; the trivial subgroup is both. The terminology is used without further comment throughout the normal-complement material of this page.

The p′-core. Call a subgroup N≤G of G a normal p′-subgroup when N⊴G and p∤∣N∣ (Normal subgroup: invariance under conjugation). The p′-core of G is

Op′(G):=⟨ ⋃{N≤G:N⊴G, p∤∣N∣} ⟩,

the subgroup generated by all normal p′-subgroups of G (The subgroup ⟨S⟩ generated by a subset, the cyclic subgroup ⟨g⟩, and cyclic groups). It is the unique largest normal p′-subgroup of G: it is normal in G, its order is prime to p, and every normal p′-subgroup of G is contained in it.

Why the definition is well posed. The family S={N≤G:N⊴G, p∤∣N∣} is nonempty ({1}∈S, since p∤1) and finite: every member is a subset of the finite set G, and G has finitely many subsets (The cardinality ∣A∣ of a finite set, ∣P(A)∣=2∣A∣ for finite A). Write S={N1,…,Nr}.

Products stay in the family. If M,N∈S, then MN is a subgroup of G (If H≤G and N⊴G, then HN is a subgroup and H∩N⊴H), it is normal because g(MN)g−1=gMg−1 gNg−1=MN for every g∈G (Normal subgroup: invariance under conjugation, Conjugation x↦gxg−1 is an automorphism), and its order divides ∣M∣ ∣N∣: by the second isomorphism theorem M/(M∩N)≅MN/N, so ∣MN∣=∣M∣ ∣N∣/∣M∩N∣ (Second isomorphism theorem for groups: H/(H∩N)≅HN/N, Lagrange's theorem: ∣G∣=[G:H]∣H∣ for every subgroup H of a finite group G). A divisor of the p′-number ∣M∣ ∣N∣ is again prime to p: if the prime p divided ∣MN∣ it would divide ∣M∣ ∣N∣ and hence, by Euclid's lemma, one of ∣M∣, ∣N∣ (Euclid's lemma: if p is prime and p∣ab then p∣a or p∣b, Divisibility is reflexive and transitive on Z, and is linear: if d∣a and d∣b then d∣ax+by for all integers x,y; also d∣a implies d∣ac, −d∣a and d∣−a). So MN∈S.

The generated subgroup is a member. By the product closure just proved, T:=N1⋯Nr belongs to S, by finite induction. This subgroup contains each Ni (insert identities in all other factors), hence contains ⟨⋃S⟩ by the defining minimality of the generated subgroup (The subgroup ⟨S⟩ generated by a subset, the cyclic subgroup ⟨g⟩, and cyclic groups). Conversely every factor Ni lies in that generated subgroup, so their product T does too. Thus Op′(G)=T∈S; in particular Op′(G)=⋃S, because T is itself a member of the family and contains every member.

Largest and unique. As a member of S, Op′(G) is a normal p′-subgroup of G, and it contains every N∈S by construction; a normal p′-subgroup is by definition a member of S. Hence Op′(G) is the largest normal p′-subgroup, and it is the only one with that property, since two normal p′-subgroups each contain the other.

Depends on

Used by

Dependency tree · two levels

63 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