Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-08-11
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.

Every nontrivial finite p-group has nontrivial center, in fact p divides ∣Z(P)∣

Statement

If P is a nontrivial finite p-group, then

p∣∣Z(P)∣.

In particular, the center Z(P) contains a nonidentity element.

Facts & Assumptions

Given: A nontrivial finite p-group P.

[L1]

Nontriviality means ∣P∣=pn with n≥1 (A finite p-group has order pn for a prime p and some n∈N).

[L2]

For an action of P on a finite set X, ∣X∣≡∣XP∣(modp) (If a finite p-group P acts on a finite set X, then ∣X∣≡∣XP∣(modp)).

[L4]

A homomorphism into a symmetric group defines an action (Actions of G on X correspond exactly to homomorphisms G→Sym⁡(X)).

[L5]

The center is the set of elements commuting with every element of P (The center Z(G) of a group).

Proof

technique · direct
1.1

By [L3] and [L4], P acts on itself by conjugation. An element is fixed by all conjugations exactly when it lies in Z(P) by [L5].

L3L4L5
2.1

Applying [L2] to this action gives ∣P∣≡∣Z(P)∣(modp).

step 1.1L2
3.1

By [L1], p divides ∣P∣. Hence [L6] and step 2.1 show that p divides ∣Z(P)∣. Since Z(P) contains the identity and its cardinality is a positive multiple of p>1, it also contains a nonidentity element.

step 2.1L1L5L6algebra∎

Depends on

Used by

Dependency tree · two levels

26 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