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.
Prime decomposition in Q(zeta_12)
Example
For the discriminant is . The primes and each have a unique prime of above them, with ; and a rational prime splits into four primes of residue degree when , and into two primes of residue degree when .
Facts & Assumptions
Given: A primitive twelfth root of unity and , a reduced index since (The cyclotomic extension as a splitting field of ).
Discriminant formula: for a reduced index with , (Signed discriminant of a cyclotomic field).
Prime factorisation: for the reduced index , a rational prime , and with , one has with , , , and the pairwise distinct primes of residue degree (Prime factorisation in a cyclotomic field).
For every prime above has residue degree and their number is (Decomposition of an unramified prime in a cyclotomic field).
For , the prime splits completely in if and only if (Complete splitting criterion for a cyclotomic field).
, and the unit group is , in which every element has order or : has order , while with (The unit group and Euler's totient for , The order of a finite group and the order of an element, with when no positive power of is the identity).
Verification
The data , and give .
For write , so , : , (as and ) and ; hence for the unique prime above , of residue degree .
For write , so , : , (as and ) and ; hence for the unique prime above , of residue degree .
For a prime the class of modulo is one of . If then , so by [F3] there are primes of degree , and by [F4] splits completely; if then the order is by [F5], so there are primes, each of residue degree .
Collecting steps 1.1 through 2.1: ; the primes and are ramified with a single prime each, of ; and every splits into four degree-one primes for the class , or two degree-two primes for the classes modulo .
Remarks
- Degree check. In every unramified case : four degree-one primes, or two degree-two primes, or (were the order ) one degree-four prime; the last case does not occur because has exponent .
- Ramified primes. and are exactly the prime divisors of the discriminant , consistent with the ramification criterion for the reduced index .
Depends on
- Signed discriminant of a cyclotomic field
- Prime factorisation in a cyclotomic field
- Decomposition of an unramified prime in a cyclotomic field
- Complete splitting criterion for a cyclotomic field
- The unit group $(\mathbb{Z}/n)^\times$ and Euler's totient $\varphi(n)=\lvert(\mathbb{Z}/n)^\times\rvert$ for $n\ge1$
- The order $|G|$ of a finite group and the order $\operatorname{ord}(g)$ of an element, with $\operatorname{ord}(g) = \infty$ when no positive power of $g$ is the identity
- The cyclotomic extension $K(\mu_n)$ as a splitting field of $t^{n}-1$
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
52 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
- J. S. Milne, Algebraic Number Theory, Ch. 6 and Ch. 8 (standard reference, not scraped)
- Conrad-Landesman, Math 154 Algebraic Number Theory, Chs. 10-11 (standard reference, not scraped)