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.
Unique primitive ancestor of a Dirichlet character
Statement
Every Dirichlet character modulo is induced by a unique primitive character of a conductor dividing .
Facts & Assumptions
Given: A character modulo .
Reduction modulo a divisor gives the stated zero-extended induction (Induced Dirichlet characters).
CRT identifies residues modulo a product of pairwise coprime moduli with their local residues (Chinese remainder theorem for a finite pairwise-coprime list: simultaneous residues determine one class modulo the product, and the resulting bijection preserves addition and multiplication).
Proof
Write . For each , choose the least for which the local unit character factors through reduction modulo ; the finite set of possible exponents has such a least element.
CRT combines the resulting local characters into a character modulo , and [F1] shows that its induction has the same values as , including zero precisely on the nonunits modulo .
If a primitive character modulo induces , each of its local exponents must be at least ; minimality gives . If , its local character factors through a proper divisor, contradicting primitivity. Hence and CRT gives .
Depends on
Used by
- A modulus need not be a conductor Counterexample
- Primitive ancestors of small characters Example
- Finite Euler factors under character induction Theorem
Dependency tree · two levels
13 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, Theorem 16.2 (standard reference, not scraped)