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.

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.

Depends on

Used by

Dependency tree · two levels

49 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