Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-6-sol)audited 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.

Additive characters are exactly one-dimensional complex representation characters

Statement

Let G be a finite abelian group written additively, with identity 0, and let χ:G→C× be an additive character (Additive characters of a finite abelian group).

  1. The formula ρχ(g)(z):=χ(g)z defines a one-dimensional complex representation ρχ:G→GL⁡(C) of G; it is determined by χ, and its trace character is χ: χρχ(g)=tr⁡(ρχ(g))=χ(g)(g∈G).
  2. Conversely, every one-dimensional complex representation ρ:G→GL⁡(V) of G has as its trace character g↦tr⁡(ρ(g)) an additive character of G, and this additive character does not depend on any choice of basis of V.
  3. Every irreducible complex representation of G is equivalent to ρψ for some additive character ψ of G.
  4. Every value of every additive character has modulus one: ∣χ(g)∣=1 for every g∈G.
  5. Distinct additive characters give inequivalent irreducible representations: if χ≠ψ then ρχ and ρψ are inequivalent irreducible complex representations of G.

Facts & Assumptions

Given: A finite abelian group G written additively with identity 0, an additive character χ:G→C×, and, where clause 2 is at issue, a one-dimensional complex representation of G.

[L1]

An additive character is a group homomorphism χ:G→C×, so χ(x+y)=χ(x)χ(y) for all x,y∈G, and consequently χ(0)=1 and χ(−x)=χ(x)−1 (Additive characters of a finite abelian group).

[L2]

A finite-dimensional complex representation of G is a group homomorphism ρ:G→GL⁡(V) on a finite-dimensional complex vector space V; its degree is dim⁡CV, and the associated action is g⋅v=ρ(g)v (A finite-dimensional representation ρ:G→GL⁡(V) over a field, and its degree).

[L3]

The character of a finite-dimensional complex representation is χρ(g)=tr⁡(ρ(g)), computed with the basis-independent trace, and equivalent representations have equal characters; a character is irreducible when it is the character of an irreducible representation (The character χV(g)=tr⁡(ρV(g)) of a finite-dimensional complex representation, An irreducible complex character).

[L4]

A subrepresentation is a linear subspace carried into itself by every ρ(g), and ρ is irreducible when V≠0 and its only subrepresentations are 0 and V (Subrepresentations, direct sums of representations, and irreducibility).

[L5]

C is finite-dimensional over itself with dim⁡CC=1, its standard basis being {1} (The standard list e:n→Fn with ei(i)=1F and ei(j)=0F for j≠i is an ordered basis of Fn; hence dim⁡FFn=n, and F0 is the zero space with basis ∅ and dimension 0); and for a linear subspace U of a finite-dimensional V one has dim⁡CU≤dim⁡CV, with dim⁡CU=dim⁡CV if and only if U=V (If dim⁡FV=n and U is a linear subspace of V, then U is finite-dimensional, dim⁡FU≤n, and dim⁡FU=n if and only if U=V).

[L6]

The trace of an endomorphism is the trace of its matrix in any ordered basis (The basis-independent trace of an endomorphism of a finite-dimensional vector space), and the trace of a square matrix is the sum of its diagonal entries, so the 1×1 matrix (λ) has trace λ (The trace tr⁡(A) as the sum of the diagonal entries).

[L7]

Every nonconstant complex polynomial has a complex root (Fundamental theorem of algebra: every nonconstant complex polynomial has a complex root), and a field is algebraically closed when every nonconstant polynomial over it has a root in it (An algebraically closed field: every nonconstant polynomial has a root in the field).

[L8]

Over an algebraically closed field every endomorphism of an irreducible representation is scalar (Over an algebraically closed field, every endomorphism of an irreducible representation is scalar); a field k is a splitting field for a finite group G when End⁡G(V)=k for every irreducible representation V of G over k (A splitting field for a finite group: every irreducible representation has scalar endomorphism ring); and over a splitting field every irreducible representation of a finite abelian group has degree 1 (Every irreducible representation of a finite abelian group over a splitting field is one-dimensional).

[L9]

Choosing a basis of a degree-one representation produces a homomorphism G→k×; every such homomorphism produces a normalized degree-one representation on the one-dimensional space k; and two degree-one representations are equivalent if and only if they produce the same homomorphism (Equivalence classes of degree-one representations are exactly homomorphisms G→k×; equivalently they factor through G/G′, and they form an abelian group).

[L11]

For n≥1 the n-th roots of unity in C are exactly the values exp⁡ ⁣(i2πkn) with 0≤k<n (The n-th roots of a complex number and the n distinct roots of unity for every n≥1), and every purely imaginary exponential has modulus one: ∣exp⁡(iy)∣=1 for real y (exp⁡(x+iy)=ex(cos⁡y+isin⁡y), ∣exp⁡(x+iy)∣=ex, and eiπ+1=0).

Proof

technique · direct
1.1

For g∈G define ρχ(g):C→C by ρχ(g)(z):=χ(g)z. This map is C-linear and invertible with inverse z↦χ(g)−1z, because χ(g)∈C×; moreover ρχ(0) is the identity map, since χ(0)=1, and ρχ(g+h)=ρχ(g)∘ρχ(h) for all g,h, because χ(g+h)=χ(g)χ(h) and multiplication in C is associative. So ρχ is a group homomorphism G→GL⁡(C), hence a complex representation of G on the one-dimensional space C, and its defining formula in terms of χ determines it uniquely from χ.

L1L2L5givenconstruct
1.2

For clause 2 let ρ:G→GL⁡(V) be a one-dimensional complex representation, so dim⁡CV=1, and choose a basis vector v of V. For each g there is a unique scalar λ(g) with ρ(g)v=λ(g)v, and ρ(g) invertible forces λ(g)≠0; by [L9] the resulting map λ:G→C× is a group homomorphism, hence an additive character of G. Since ρ(g) is multiplication by the scalar λ(g) on a one-dimensional space, its trace is λ(g), so the trace character of ρ is λ; and because the trace of an endomorphism is basis-independent, the additive character so obtained does not depend on the choice of basis.

L3L6L9given
1.3

Every irreducible complex representation of G has degree 1: by [L7] the fundamental theorem of algebra makes C an algebraically closed field, so [L8] makes every endomorphism of an irreducible complex representation V of G a scalar λid⁡V; since an irreducible V is nonzero, the map λ↦λid⁡V is injective, hence End⁡G(V)=C and C is a splitting field for G, whereupon [L8] gives dim⁡CV=1 because G is abelian.

L7L8givenalgebra
1.4

For clause 4 fix g∈G and put n:=ord⁡(g); since G is finite, n is a natural number with n≥1 and gn=e. Written additively, as this page writes G, the power gn is the n-fold sum n⋅g, so n⋅g=0, and the additive reading of claim 3 of [L10] gives χ(n⋅g)=χ(g)n. Hence 1=χ(0)=χ(g)n: the value χ(g) is an n-th root of unity. By [L11] there is k with 0≤k<n and χ(g)=exp⁡(2πik/n), and the modulus formula in [L11] gives ∣χ(g)∣=∣exp⁡(i⋅2πk/n)∣=1.

L1L10L11
2.1

In the standard basis {1} of C the matrix of the endomorphism ρχ(g) is the 1×1 matrix (χ(g)), whose trace is χ(g); since the character is computed with the basis-independent trace, χρχ(g)=tr⁡(ρχ(g))=χ(g) for every g∈G. Thus the trace character of ρχ is χ, as clause 1 asserts.

L3L6step 1.1
3.1

Let W be an irreducible complex representation of G. By step 1.3 it is one-dimensional, so by step 1.2 its trace character ψ(g):=tr⁡(ρW(g)) is an additive character of G; by step 2.1 the representation ρψ attached to ψ has trace character ψ. Thus W and ρψ are degree-one representations producing the same homomorphism ψ, so [L9] makes them equivalent. This is clause 3.

step 2.1step 1.2step 1.3L9
3.2

For clause 5 let χ≠ψ be additive characters. Each ρχ is irreducible: it lives on the nonzero space C of dimension 1, and a subrepresentation U is a linear subspace with dim⁡CU≤1, so either dim⁡CU=0 and U=0, or dim⁡CU=1=dim⁡CC and U=C by [L5]; by [L4] this is exactly irreducibility, and by step 2.1 the character of ρχ is χ, so ρχ has irreducible character χ in the sense of [L3]. If ρχ and ρψ were equivalent, then their characters would be equal by the invariance clause of [L3], so step 2.1 would give χ=ψ, contrary to hypothesis; hence the two irreducible representations are inequivalent.

L3L4L5step 2.1given
4.1

Clause 1 is steps 1.1 and 2.1, clause 2 is step 1.2, clause 3 is steps 1.3 and 3.1, clause 4 is step 1.4, and clause 5 is step 3.2, so all five clauses of the statement are proved. The argument uses only finite groups, finite-dimensional complex representations and finite lists of roots, and therefore invokes no choice principle.

step 1.1step 2.1step 1.2step 3.1step 1.4step 3.2∎

Remarks

  • The bridge is the content of the item. The word "character" names two different functions before this lemma: an additive character is a homomorphism G→C×, while the character of a representation is the trace of its matrices. Steps 1.1, 2.1 and 1.2 identify the two notions in degree one, so a later page may cite either side.

  • Basis independence is the trace, not a convention. Clause 2 is stated for an arbitrary one-dimensional representation on an arbitrary one-dimensional space; it is the basis-independence of the trace, not a chosen identification of V with C, that makes the resulting additive character well defined.

  • Only finiteness of G is used for clause 4. For g of infinite order there is no exponent to force χ(g) to be a root of unity, and indeed a homomorphism Z→C× may take any nonzero value; finiteness enters at ord⁡(g) and at the splitting-field step.

Depends on

Used by

Dependency tree · two levels

95 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