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.
Primitive Gauss-sum twist
Statement
If is primitive modulo , then for every integer ,
Facts & Assumptions
Given: A primitive modulo and .
The normalization of is fixed above (Gauss sum of a Dirichlet character).
Primitivity excludes induction from a proper divisor (Primitive Dirichlet characters and conductor).
Proof
If , substitution permutes the residue classes and gives the sum as .
If , choose a unit for which ; otherwise the unit character factors modulo , contrary to [F2]. Multiplication by leaves unchanged and multiplies the sum by , so the sum is zero.
In the second case , so the right side is also zero; the two cases prove the formula.
Depends on
Used by
- Norm of a primitive Gauss sum Theorem
- Twisted Poisson summation Theorem
Dependency tree · two levels
4 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
- Nickolas Andersen, Analytic Number Theory, Lemma 16.3 (standard reference, not scraped)