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 five characters of Z/5Z and their orthogonality
Example
Put (The complex exponential by its power series). For and a class with representative (The congruence class and the quotient set ), put The five functions are exactly the additive characters (Additive characters of a finite abelian group) of , their character table has entries , and the entries satisfy
Facts & Assumptions
Given: The group and .
An additive character is a group homomorphism , so and (Additive characters of a finite abelian group).
Additive characters of a finite abelian group are exactly its irreducible complex characters: each is the trace character of a one-dimensional irreducible representation, every irreducible representation arises this way up to equivalence, all values have modulus one, and distinct additive characters give inequivalent representations (Additive characters are exactly one-dimensional complex representation characters).
Row orthogonality: for a finite abelian group and additive characters of , equals when and otherwise (Row orthogonality for additive characters of a finite abelian group).
In classes satisfy exactly when (The congruence class and the quotient set ); the map is a bijection from onto , so (For , every class in has one representative with , so ; while is in bijection with ); addition is given by , independently of representatives (Addition and multiplication on by and ), and makes an abelian group with identity (For every natural , is an abelian group, multiplication is a commutative monoid operation, and both distributive laws hold).
The complex exponential satisfies for all (, and the complex exponential extends the real exponential), and its kernel and fibres are given by and exactly when (, and exactly when ).
The -th roots of unity in are precisely the values with , for (The -th roots of a complex number and the distinct roots of unity for every ), and for every real (, , and ).
For every the sum of all -th roots of unity is (For , the sum of all -th roots of unity is zero).
Complex conjugation is an involutive real-field automorphism; it fixes , and for every one has with , while (Conjugation is an involutive real-field automorphism, , and modulus is definite, multiplicative, and subadditive).
Verification
Compute : iterating the addition law [L5] gives , because ; and , since otherwise would give , which is false. So is a fifth root of unity different from , and by [L6] the fifth roots of unity are exactly the five distinct values , .
Well-definedness. Suppose in , so by [L4]; write with . Then the integer power laws together with give , so the prescription does not depend on the chosen representative and defines a function for each .
The five are distinct and exhaustive. If , evaluating at gives , that is , and [L5] gives , so ; as this forces . Conversely let be any additive character and put ; five applications of multiplicativity in [L1], together with in [L4], give , so is a fifth root of unity and by step 1.1 there is a unique with . For one has , whence ; therefore , and every additive character of occurs among the five.
Each is an additive character. By [L4], , so ; every value is one of the fifth roots of unity listed in step 1.1 and hence nonzero. So is a group homomorphism, that is, an additive character of , by [L1].
The table and its orthogonality. By [L2] the five additive characters are exactly the irreducible complex characters of , so the array of values is the character table of the group: its rows, for , are , , , and . By [L4] the group has order and its five elements are , so row orthogonality [L3] applied to and gives exactly . As a direct check of an off-diagonal entry, for and the summands are , and by [L7], since step 1.1 lists as the five fifth roots of unity; on the diagonal by [L6] and [L8], so each diagonal average is .
Steps 2.1 and 3.1 show that each is a well-defined additive character, step 2.2 that they are pairwise distinct and are all of them, and step 3.2 computes the table and verifies its orthogonality; this proves every claim of the example.
Depends on
- Additive characters of a finite abelian group
- Additive characters are exactly one-dimensional complex representation characters
- Row orthogonality for additive characters of a finite abelian group
- The congruence class $[a]_n$ and the quotient set $\mathbb{Z}/n$
- For $n\ge 1$, every class in $\mathbb{Z}/n$ has one representative $r$ with $0\le r<n$, so $\lvert\mathbb{Z}/n\rvert=n$; while $\mathbb{Z}/0$ is in bijection with $\mathbb{Z}$
- Addition and multiplication on $\mathbb{Z}/n$ by $[a]_n+[b]_n=[a+b]_n$ and $[a]_n[b]_n=[ab]_n$
- For every natural $n$, $(\mathbb{Z}/n,+)$ is an abelian group, multiplication is a commutative monoid operation, and both distributive laws hold
- $\ker(\exp)=2\pi i\mathbb Z$, and $\exp z=\exp w$ exactly when $z-w\in2\pi i\mathbb Z$
- $\exp(z+w)=\exp z\,\exp w$, and the complex exponential extends the real exponential
- The complex exponential by its power series
- The $n$-th roots of a complex number and the $n$ distinct roots of unity for every $n\ge1$
- $\exp(x+iy)=e^x(\cos y+i\sin y)$, $|\exp(x+iy)|=e^x$, and $e^{i\pi}+1=0$
- For $n\ge2$, the sum of all $n$-th roots of unity is zero
- Conjugation is an involutive real-field automorphism, $z\overline z=|z|^2$, and modulus is definite, multiplicative, and subadditive
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
79 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
- Peter Webb, A Course in Finite Group Representation Theory, Proposition 4.1.1 (standard reference, not scraped)
- Pavel Etingof et al., Introduction to Representation Theory, Section 3.3 Example 1 (standard reference, not scraped)