Alphabeta Math
Pipeline-generated
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.

Finite Abelian Characters for Combinatorics

1 · Prerequisites

2 · Summary

This page is the library's small shared interface for characters of finite abelian groups, written additively and valued in the multiplicative group C× of nonzero complex numbers. The word "character" already means the trace function χV(g)=tr⁡ρV(g) of a complex representation on the prerequisite page characters-and-the-orthogonality-relations, so the opening definition fixes the additive notion separately and records exactly how the two are related: an additive character is a homomorphism, not an arbitrary trace function, and no isomorphism G≅G^ is built into the definition.

The second item is the bridge between the two terminologies. Every additive character determines a unique one-dimensional complex representation, and the character of that representation is the additive character again; conversely, every one-dimensional complex representation produces an additive character independent of any chosen basis. Because the fundamental theorem of algebra makes C algebraically closed and hence a splitting field for every finite group, the published theorem that irreducible representations of a finite abelian group over a splitting field are one-dimensional shows that every irreducible complex representation of G arises this way up to equivalence. Two consequences are recorded for later use: all additive-character values have modulus one, and distinct additive characters give inequivalent irreducible representations.

The third item is the orthogonality relation in the normalized form used by combinatorial consumers: the average of χ(g)ψ(g)‾ over G is 1 for equal characters and 0 otherwise, and a nontrivial additive character sums to zero. It is proved through the published first orthogonality relation for irreducible complex characters, applied to the irreducible characters supplied by the dictionary; the normalized form itself, including its linearity in the first argument, is the published inner product on class functions. The whole pair is finite, makes no choice from a family of nonempty sets, and uses no form of the axiom of choice.

The companion examples page writes out the five characters of Z/5Z and their character table, and checks the orthogonality relation there in coordinates; it requires only this page.

3 · Logical flowchart

4 · Definitions, theorems and proofs

DefinitionDefinition: AI-adaptedProof: Not applicablejudge pass (gpt-6-sol)audited 2026-09-27Open item page →

Additive characters of a finite abelian group

Definition

Let G be a finite abelian group (Group and abelian group), written additively: its operation is written +, its identity is written 0, and its underlying set is finite. Let C× be the group of units of the field C (C=R[x]/(x2+1) is a field, every element is uniquely a+bi, and every nonzero element has inverse (a−bi)/(a2+b2), The units of a ring are the invertible elements of its multiplicative monoid, and R× is a group under multiplication; 0∈R× only in the zero ring), that is, the nonzero complex numbers under multiplication.

An additive character of G is a group homomorphism (Monoid homomorphism and group homomorphism)

χ:G⟶C×,χ(x+y)=χ(x) χ(y)(x,y∈G).

Write G^ for the set of all additive characters of G. Since G and C× are groups, every additive character automatically satisfies χ(0)=1 and χ(−x)=χ(x)−1 (A group homomorphism automatically satisfies f(e)=e′ and f(g−1)=f(g)−1, and f(gn)=f(g)n for every n∈Z; for monoid homomorphisms preservation of the identity must be assumed), so multiplicativity is the whole requirement.

This is not the representation-theoretic character. The word "character" already names the function χV(g)=tr⁡(ρV(g)) attached to a finite-dimensional complex representation V of G (The character χV(g)=tr⁡(ρV(g)) of a finite-dimensional complex representation, A finite-dimensional representation ρ:G→GL⁡(V) over a field, and its degree). That function need not be multiplicative — only for a one-dimensional representation is it a homomorphism to C× — and the next item proves the precise bridge: the additive characters of a finite abelian group are exactly the characters of its one-dimensional complex representations, and exactly its irreducible ones.

Well-definedness. G^ is defined as a set of functions G→C×, so the definition itself selects nothing. In particular it chooses no decomposition of G, no enumeration of G, and no isomorphism G≅G^, and it asserts nothing here about a group structure on G^; the dictionary proved in the next item records what structure there is.

Remarks

  • The definition makes sense for an arbitrary abelian group; finiteness is kept because the page works with finite groups throughout, and it is what makes the orthogonality average of the later item a finite sum.

  • For G written multiplicatively the same condition reads χ(gh)=χ(g)χ(h). The additive notation is not a change of mathematics: it records that G is abelian and that its operation is being written as addition, so that χ is a homomorphism of the additive group G into the multiplicative group C×.

LemmaStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-6-sol)audited 2026-09-27Open item page →

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.

LemmaStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-6-sol)audited 2026-09-27Open item page →

Row orthogonality for additive characters of a finite abelian group

Statement

Let G be a finite abelian group and let χ,ψ:G→C× be additive characters of G (Additive characters of a finite abelian group). Then 1∣G∣∑g∈Gχ(g) ψ(g)‾={1χ=ψ,0χ≠ψ, the sum being the finite sum over G of complex-valued terms (A finite sum in a commutative monoid indexed by an arbitrary finite set). In particular, if χ is not the trivial additive character then ∑g∈Gχ(g)=0. The normalized inner product is linear in its first argument, exactly as on the published representation-character page (The standard inner product on cf(G)).

Facts & Assumptions

Given: A finite abelian group G and additive characters χ,ψ:G→C×.

[L1]

Each additive character is the trace character of an irreducible one-dimensional complex representation, distinct additive characters give inequivalent irreducible representations, and every irreducible complex representation of G arises this way up to equivalence (Additive characters are exactly one-dimensional complex representation characters).

[L2]

A complex character is irreducible when it is the character χV(g)=tr⁡(ρV(g)) of an irreducible representation V, and the character depends only on the equivalence class of V (An irreducible complex character).

[L3]

First orthogonality relation: for irreducible complex characters χ1,…,χr of a finite group, one from each equivalence class, ⟨χi,χj⟩=δij (The first orthogonality relation for irreducible complex characters).

[L4]

The standard inner product on the complex class functions of G is ⟨φ,ψ⟩=1∣G∣∑g∈Gφ(g)ψ(g)‾, a finite sum over G of complex-valued terms; this assignment is an inner product in the exact sense of the published definition, with the inner product linear in the first argument (The standard inner product on cf(G), A finite sum in a commutative monoid indexed by an arbitrary finite set).

[L5]

A function f:G→C is a class function when f(gxg−1)=f(x) for all g,x∈G; these functions form the complex vector space cf(G) carrying the inner product of [L4] (Class functions and the complex vector space cf(G)), and a group is abelian when its operation is commutative (Group and abelian group).

[L6]

An additive character of G is a group homomorphism G→C×; the constant function 1 is such a homomorphism, and for every additive character θ one has θ(e)=1 for the identity e of G (Additive characters of a finite abelian group).

[L7]

Proof

technique · direct
1.1

Every additive character of G is an irreducible complex character of G: by [L1] the character χ is the trace character of the irreducible one-dimensional representation ρχ, and by [L2] the character of an irreducible representation is an irreducible complex character; the same holds for ψ.

L1L2
1.2

Both χ and ψ lie in cf(G), the space on which [L4] and [L3] are stated: since G is abelian, gxg−1=x for all g,x∈G (in the additive writing used for G on this page, g+x−g=x), so every function G→C, in particular χ and ψ, is constant on conjugacy classes, which is the defining property in [L5].

L4L5given
1.3

Let χ1,…,χr be irreducible complex characters of G, one from each equivalence class, as in [L3]. By [L2] a character depends only on the equivalence class of its representation and by [L1] the representation ρχ is irreducible, so χ=χi for some index i; likewise ψ=χj for some index j.

L1L2L3
1.4

The normalized inner product of [L4] is linear in its first argument, as that published definition records of the form ⟨φ,ψ⟩=1∣G∣∑g∈Gφ(g)ψ(g)‾ on class functions; this is the statement's final sentence.

L4
2.1

If χ=ψ, then χ=χi for an index i as in step 1.3, and [L3] applied to the pair (i,i) gives ⟨χ,ψ⟩=⟨χi,χi⟩=δii=1.

L3step 1.3
2.2

If χ≠ψ, then the indices of step 1.3 satisfy i≠j: equality i=j would give χ=χi=χj=ψ, a contradiction. Hence [L3] applied to the pair (i,j) gives ⟨χ,ψ⟩=⟨χi,χj⟩=δij=0.

L3step 1.3given
3.1

By [L4] the inner product just computed is the displayed normalized sum, ⟨χ,ψ⟩=1∣G∣∑g∈Gχ(g)ψ(g)‾; combining with steps 2.1 and 2.2, this quantity is 1 when χ=ψ and 0 otherwise, which is the orthogonality clause of the statement.

L4step 2.1step 2.2
4.1

Let χ0(g):=1 for every g∈G. Then χ0 is an additive character, by [L6], and it is the trivial additive character. If χ≠χ0, then step 3.1 with ψ=χ0 gives 1∣G∣∑g∈Gχ(g)χ0(g)‾=0; since χ0(g)‾=1‾=1 by [L7], this reads 1∣G∣∑g∈Gχ(g)=0, and multiplying by the nonzero complex number ∣G∣ gives ∑g∈Gχ(g)=0. That is the zero-sum clause.

L6L7step 3.1given
5.1

Step 3.1 proves the orthogonality values, step 4.1 the vanishing sum for a nontrivial character, and step 1.4 the linear-first convention; these are all the claims of the statement.

step 3.1step 4.1step 1.4∎

Remarks

  • Two independent routes exist; the one above is the representation route. The published orthogonality relation [L3] is applied to the irreducible complex characters supplied by the dictionary [L1], so the proof inherits the Maschke-and-Schur machinery behind [L3]. A self-contained alternative computes S=∑gχ(g)ψ(g)‾ directly: for θ:=χψ‾ with θ(a)≠1 one has S=θ(a)S by reindexing g↦g+a, and for χ=ψ every summand is 1. That route needs the linearity of C-valued finite sums under scalar multiplication, which this page does not cite, so it is not used here.

  • The trivial character's vanishing sum is Corollary 4.1.4 of Webb's book in spirit. It is the ψ=1 case of row orthogonality and is the form in which combinatorial consumers use "sum of a nontrivial additive character".

  • No Choice. The orthogonality relation [L3] is a published theorem of the representation-character page, whose own contract is choice-free, and no selection is made here; the finite complex-valued sums over G are those of A finite sum in a commutative monoid indexed by an arbitrary finite set.

5 · Examples, counterexamples and false statements

None yet.

Sources