Alphabeta Math
ExampleConstruction: Literature-sourcedVerification: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 2026-08-29
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 character table of a finite cyclic group over C

Example

For G=⟨g⟩ cyclic of order n and ζ a primitive n-th root of unity, the character table has rows χk and columns gm with entry ζkm (0≤k,m≤n−1). Both orthogonality relations hold, and the squared degrees sum to n=∣G∣.

Facts & Assumptions

Given: A cyclic group G=⟨g⟩ of order n≥1 and a primitive n-th root of unity ζ.

[F1]

The irreducible characters are χk(gm)=ζkm for 0≤k≤n−1, pairwise distinct (The irreducible complex characters of a finite cyclic group are the n powers of a primitive nth root).

[F2]

Vieta's formulas: if the monic f(t)=tn+a1tn−1+⋯+an splits as ∏i=1n(t−αi), then a1=−∑iαi (Vieta's formulas identify the coefficients of a split monic polynomial with elementary symmetric functions of its roots).

[F3]

The first orthogonality relation reads ⟨χi,χj⟩=δij (The first orthogonality relation for irreducible complex characters).

[F4]

The second orthogonality relation reads ∑iχi(g)χi(h)‾=∣CG(g)∣ when h is conjugate to g and 0 otherwise (The second orthogonality relation for irreducible complex characters).

[A1]

In C[x], tn−1=∏m=0n−1(t−ζm), because the two sides have the same degree, the same roots, and are monic.

Verification

technique · direct
1.1F1given

By [F1] the entry in row χk and column gm is ζkm, so the table has the stated shape.

1.2F2A1givenalgebra

If n=1, then G is trivial and ∑m=0n−1ζkm=1 for the unique value k=0. Assume now that n>1. Then the polynomial tn−1 has coefficient 0 at tn−1, so [A1] and [F2] give ∑m=0n−1ζm=0. More generally, if k≡0(modn) then ∑m=0n−1ζkm=n; if 0<k<n, the element η=ζk has order n/d, where d=gcd⁡(k,n), so ∑m=0n−1ζkm=d∑r=0n/d−1ηr. Here n/d>1, and the inner sum vanishes by the same Vieta argument applied to tn/d−1. Thus ∑m=0n−1ζkm is n when k≡0(modn) and 0 otherwise.

2.1F3step 1.1step 1.2algebra

Row orthogonality: by [F3] and step 1.1, δkl=⟨χk,χl⟩=1n∑mζkmζlm‾=1n∑mζ(k−l)m, and the last sum is n when k≡l(modn) and 0 otherwise by step 1.2, which matches δkl.

2.2F4step 1.1step 1.2algebra

Column orthogonality: by [F4] and step 1.1, ∑kχk(gm)χk(gm′)‾=∑kζk(m−m′), which is n when m≡m′(modn) and 0 otherwise by step 1.2; since G is abelian every centralizer is G, so this is exactly ∣CG(g)∣δmm′.

3.1F1step 1.1algebra∎

All n degrees are 1, so ∑knk2=n=∣G∣.

Depends on

Used by

Dependency tree · two levels

19 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