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.
Arithmetic of Q(zeta_5)
Example
For one has and . The prime is totally ramified: is a fourth power of the unique prime above , whose residue field is . The prime is unramified with a single prime above it of residue degree (residue field ) and trivial inertia group; and splits completely into four degree-one primes.
Facts & Assumptions
Given: A primitive fifth root of unity and , of degree (The cyclotomic extension as a splitting field of ).
, with integral basis (Ring of integers of every cyclotomic field).
Discriminant: for the reduced index , (Signed discriminant of a cyclotomic field).
Total ramification at a prime-power level: with , , and is the unique prime of above , with residue field (Total ramification at a prime-power cyclotomic level).
Unramified decomposition: for the reduced index and a prime , every prime above has residue degree and there are of them (Decomposition of an unramified prime in a cyclotomic field).
Complete splitting: for , the prime splits completely in if and only if (Complete splitting criterion for a cyclotomic field).
For finite Galois extensions the inertia group at a prime has order equal to the ramification exponent, , and is unramified over if and only if its inertia group is trivial (Inertia group of a prime, Orders of decomposition and inertia groups).
Verification
Since , the discriminant formula gives .
The multiplicative order of modulo is : the powers of modulo are , so .
The class is the identity of .
By [F3], with the unique prime above and residue field ; its ramification exponent is , so is totally ramified and its inertia group at has order , the full Galois group.
By [F4] and step 1.2 applied with , there is exactly prime above , of residue degree ; its residue field has elements, and since is unramified its inertia group is trivial by [F6], so with .
By [F5] and step 1.3, splits completely in : there are distinct primes above , each of ramification exponent and residue degree .
Collecting the results: with an integral basis, , the prime is totally ramified with , the prime has one prime above it of residue degree and trivial inertia, and splits into four degree-one primes.
Remarks
- Unramified decomposition has three cases. For a prime , the orders modulo are for the classes , respectively. Thus [F4] gives four degree-one primes, two degree-two primes, or one degree-four prime. In particular is inert, while gives two primes, each of residue degree .
- Frobenius orders. The arithmetic Frobenius at has order and generates the full group , while the Frobenius at is trivial, which is complete splitting in the sense of Complete splitting criterion for a cyclotomic field.
Depends on
- Ring of integers of every cyclotomic field
- Signed discriminant of a cyclotomic field
- Total ramification at a prime-power cyclotomic level
- Decomposition of an unramified prime in a cyclotomic field
- Complete splitting criterion for a cyclotomic field
- Inertia group of a prime
- Orders of decomposition and inertia groups
- 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
60 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, Proposition 6.2 and Remark 6.6(c) (standard reference, not scraped)
- Conrad-Landesman, Math 154 Algebraic Number Theory, Chs. 10-12 (standard reference, not scraped)