Alphabeta Math
CorollaryStatement: Literature-sourcedProof: Literature-sourcedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-05
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 rank of RQ(G) is the number of conjugacy classes of cyclic subgroups

Statement

Let G be a finite group. The rank of the free abelian group RQ(G) equals the number of conjugacy classes of cyclic subgroups of G.

Facts & Assumptions

Given: A finite group G.

[F1]

The map x(ResCGx,1CC)(C) from RQ(G) to the product over cyclic conjugacy classes is injective (Cyclic fixed-space dimensions detect rational virtual characters).

[F2]

The induced trivial representation IndCG1C is the permutation representation of G on G/C (Inducing the trivial representation gives the permutation representation on G/H).

[F3]

The character of a permutation representation counts fixed points (The character of a permutation representation counts fixed points).

Proof

technique · direct
1.1

Choose representatives C1,,Cr of the conjugacy classes of cyclic subgroups of G. By [F1], the group RQ(G) injects into Qr, so its rank is at most r.

F1givenchoose
1.2

For each i, let Ui:=IndCiG1Ci, viewed as an element of RQ(G). Suppose that a1U1++arUr=0 with aiQ. Reorder the representatives so that C1Cr, and choose i minimal with ai0. Let gi be a generator of Ci.

F2givenchoose
2.1

If Uj(gi)0, then [F2] and [F3] show that gi fixes some coset xCj, so x1gixCj. Therefore a conjugate of the cyclic subgroup Ci=gi lies in Cj, which implies CiCj. In the relation from step 1.2, every index j<i has aj=0 by minimality of i, so only ji can contribute. For such j, the ordering gives CjCi, hence Cj=Ci. A subgroup of Cj with the same finite order as Cj must equal Cj, so the conjugate of Ci lying in Cj is all of Cj. Thus Cj is conjugate to Ci, and because C1,,Cr were chosen as distinct conjugacy-class representatives, this forces j=i. On the other hand, gi fixes the coset Ci itself, so [F2] and [F3] give Ui(gi)>0. Evaluating the relation from step 1.2 at gi therefore yields aiUi(gi)=0, a contradiction. Thus the Ui are linearly independent.

F2F3step 1.2algebra
3.1

Step 2.1 gives r linearly independent elements of RQ(G), while step 1.1 shows that the rank is at most r. Hence rankRQ(G)=r, the number of cyclic conjugacy classes.

step 1.1step 2.1algebra

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

18 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