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.
Cyclotomic Arithmetic and Reciprocity via Frobenius
1 · Prerequisites
- Algebraic Closure, Embeddings, and Separability
- Algebraic Extensions, Extension Degree, and Finite Fields
- Artinian Rings and Length
- Binary Operations, Monoids, Groups and Subgroups
- Chain Conditions, Semisimple Modules and the Wedderburn–Artin Theorem
- Congruences, the Integers Modulo n and the Chinese Remainder Theorem
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Cyclic Groups and Direct Products
- Decomposition Inertia and Frobenius
- Determinants of Matrices over a Commutative Ring
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- Divisibility, Greatest Common Divisors and Bézout's Identity
- Eigenvalues, Eigenvectors and the Characteristic Polynomial
- Exterior Powers, Orientation and Hodge Duality
- Finite Counting, Factorials and Binomial Coefficients
- Finite Fields and Cyclotomic Extensions
- Foundations of the Real Numbers for Analysis
- Free Modules, Exact Sequences, Projective and Injective Modules
- Gaussian Elimination, Elementary Matrices and Reduced Row Echelon Form
- Group Actions, Orbits, Stabilisers and Cayley's Theorem
- Group Homomorphisms and the Isomorphism Theorems
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Integral Extensions and Going Up
- Linear Independence, Bases and Dimension
- Linear Transformations, Rank-Nullity and Quotient Spaces
- Matrices, the Matrix of a Linear Map, and Change of Basis
- Modules over a Principal Ideal Domain and the Canonical Forms
- Modules, Submodules, Quotient Modules and the Isomorphism Theorems
- Noetherian Rings and Hilbert Basis
- Normal Subgroups and Quotient Groups
- Number Fields Rings of Integers and Discriminants
- Order, Zorn's Lemma, and the Axiom of Choice
- Polynomial Rings, the Division Algorithm and Roots
- Prime Ideal Decomposition Ramification and the Different
- Primes, Euclid's Lemma and the Fundamental Theorem of Arithmetic
- Primitive Roots and Unit Groups Modulo N
- Quadratic Residues and the Legendre Symbol
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Roots, Rational Powers, and Classical Inequalities
- Simple Field Extensions and the Construction of the Complex Numbers
- Solvability by Radicals and Kummer Theory
- Splitting Fields
- Symmetric Groups, Cycle Decomposition and the Sign Homomorphism
- Tensor Products of Modules
- The Determinant of a Linear Operator, Cofactors and Cramer's Rule
- The Field of Fractions and Localisation
- The Fundamental Theorem of Finite Abelian Groups
- The Galois Correspondence
- The ZFC Axioms and the Basic Set Constructions
- Triangularisation, Generalised Eigenspaces and Jordan Canonical Form
- Vector Spaces, Linear Subspaces, Span and Direct Sums
2 · Summary
This page develops the arithmetic of the full cyclotomic fields for reduced indices: an index is reduced when it is odd or divisible by . The single excluded shape is not intrinsic, because is a primitive -th root of unity for odd , so ; the conductor theorem identifies the least admissible index of each cyclotomic field and makes the reduced-index convention precise.
The ring of integers is throughout. The prime-power case is handled first, by the relation up to a unit; the general ring-of-integers result then follows from a coprime-discriminant compositum step. These results give the discriminant formula. For prime decomposition, a choice-free monogenic factorisation lemma starts from the published choice-free ideal-factorisation theorem and compares local nilpotency indices with the multiplicities in the reduction of modulo . The resulting prime factorisation gives the ramification criterion ( ramifies exactly when ); for it gives residue degree , the count of primes, and complete splitting exactly when .
The second half passes to the quadratic Gauss sum , whose Galois action is the Legendre symbol, whose square is , and which generates the unique quadratic subfield of . Computing the restriction of the arithmetic Frobenius to that subfield in two ways identifies with . Together with the first supplement, this proves quadratic reciprocity; the first and second supplements are also derived from the Frobenius power map and Euler's criterion. The Gauss sum itself is attached to a chosen primitive root and has no root-independent sign; only its square and its field are canonical.
3 · Logical flowchart
4 · Definitions, theorems and proofs
Cyclotomic conductor of a full cyclotomic field
Definition
Let and let be a cyclotomic extension of of order (The cyclotomic extension as a splitting field of ): a splitting field of over . When a primitive -th root of unity is fixed, .
A positive integer is admissible for when there is a -algebra embedding into a splitting field of over . The cyclotomic conductor of is the least admissible positive integer,
Well-definedness. The set is nonempty, since the identity of exhibits and is a splitting field of ; by the well-ordering of the positive integers it therefore has a least element (The well-ordering principle). The value depends only on the -isomorphism class of : if is an isomorphism of splitting fields of and is an embedding, then composing with exhibits , so and have the same admissible integers. In particular the conductor is unchanged by the choice of splitting field (Any two splitting fields of a polynomial are isomorphic over the base field).
Conductors are compared inside a common field. Every assertion below about an inclusion is read inside one fixed algebraic closure of , in which one copy of each cyclotomic field has been chosen; by the previous paragraph this loses no information, because conductor statements are invariant under the -isomorphisms relating the choices.
Scope. This is a conductor of a full cyclotomic field only. It is not the Artin conductor of a Dirichlet character, not a conductor assigned to an arbitrary abelian number field, and no Kronecker-Weber premise is used or implied: the definition does not assert that an arbitrary abelian field lies in some . Admissibility of does not make the least admissible integer; identifying the least one is the content of Conductor of a full cyclotomic field.
Prime-power cyclotomic ring, discriminant support and p factor
Statement
For a prime and an integer put , and . Then the power basis is an integral basis of , and the discriminant of that basis is a signed power of with absolute value .
Facts & Assumptions
Given: A prime , an integer , , a primitive -th root of unity in a fixed algebraic closure of , the field , the element , the subring , the polynomial , and the index of the order in the ring of integers of .
is monic of degree , , and (, and is Eisenstein at ).
is irreducible over ( is irreducible in for every ), so is the minimal polynomial of over , , , and is a -basis of (The cyclotomic extension as a splitting field of ).
is Galois and via ; in particular for every integer coprime to there is with ( and ).
is integral over , being a root of the monic polynomial , and the integral elements form a subring; hence (Integral elements over a commutative ring and algebraic integers, Integral elements over a nonzero base ring form a subring). A unital subring of that is free of rank as a -module is an order, every order has an integral basis and finite additive index in , and itself is free of rank (Order in a number field, Orders have integral bases and finite index, The ring of integers has rank the degree). Consequently is an order in , is finite, and : the quotient group is finite of order and every element of a finite group of order has order dividing (The order of every element of a finite group divides the order of the group).
Since is Galois of degree , for the norm is and if then (Norm and trace from embeddings, with the inseparable exponent in the norm formula, The rational algebraic integers are exactly the integers).
(Power-basis and polynomial discriminants), this is the discriminant of the order , and with a nonzero integer (Discriminant of a basis and order, Order-index discriminant formula, Number-field discriminant is well-defined and nonzero).
: a rational number that is a root of a monic polynomial in lies in (The rational algebraic integers are exactly the integers).
Proof
by [F1], so is a root of the degree- monic , which is irreducible by [F2]; hence has degree over , the powers form a -basis of , and is an order in with finite index satisfying .
For every integer coprime to the element is a root of : its order is , so while , and [F1] then forces ; the elements with are pairwise distinct, so comparison with the monic degree- polynomial gives and .
Each factor of the product in step 1.2 is a unit multiple of inside : after replacing by its least positive residue modulo the quotient lies in , and if satisfies then and ; the two quotients are inverse to each other, so . Hence for some , and consequently .
Taking the product formula of [F5] over the Galois group identified in [F3] and substituting step 1.2 gives ; moreover by [F5] and , so , since the only integers whose -th power is are .
For one has : the element is a primitive -th root of unity in , the computation of step 2.2 with replaced by gives , and the embedding formula of [F5] applied to the tower gives , since by [F2].
: step 2.1 gives with , so and ; conversely, if , then by step 2.1, say with , and by [F7], so divides in and hence divides , that is .
: the inclusion is clear; for let and expand with , which is possible because makes a -basis of as well. We show for all by induction: if with , then and by step 2.1, so and ; on the other hand , the bracket lying in . Hence by step 3.2, and subtracting from leaves for the next index. Thus all coefficients are multiples of and .
Differentiating the identity of [F1] gives , and evaluating at , where and , yields . Taking norms with the product formula of [F5] and using multiplicativity of the norm together with step 3.1 at and from step 2.2 gives , so [F6] gives with .
Since by [F6] and both and are nonzero integers, divides in , so the positive index is for some integer .
: if and , then by step 4.1, say with , and cancelling in the domain gives ; the reverse inclusion is trivial.
By induction on one has : the case is trivial and the case is step 5.2; if and satisfies , then with , so the induction hypothesis gives , and then step 5.2 gives .
By step 5.1 write the finite index as with ; then by step 1.1, so for any we get and step 6.1 with gives . Hence , and the equality with from step 2.1 is an equality of principal ideals in ; in particular the power basis is an integral basis of whose discriminant, by step 4.2, equals . For one has , , and exponent , in agreement with the general computation.
Remarks
- Both halves of the index argument are needed. The order-index formula alone gives only that the index is a power of ; the descent through the coefficients of in steps 4.1 and 5.2 is what forces . The unit identity of step 2.1 is used in both places, through .
- The boundary case has , and discriminant ; the formulas and are consistent with the general computation in step 4.2, whose exponent is there.
Integral basis and discriminant of a coprime-discriminant compositum
Statement
Let and be number fields inside a common algebraic closure, with compositum , let , let and be integral bases of and , and suppose . Then
the products form an integral basis of , and
Facts & Assumptions
Given: Number fields inside a fixed algebraic closure of , with , , compositum , , integral bases of and of , and .
and are free -modules of ranks and , freely generated by the given integral bases (The ring of integers has rank the degree, Integral and power integral bases); is free of rank .
Degrees multiply in a tower and equal the dimension of the top field over the bottom one (Tower law for finite extensions: , The degree of a finite field extension): and because and .
The algebraic integers form a subring of (Integral elements over a nonzero base ring form a subring, Integral elements over a commutative ring and algebraic integers); if is a root of a monic polynomial in then so is for every field homomorphism fixing , because commutes with the polynomial expression.
is the integral closure of in (Ring of integers, Integral closure in an extension ring and integrally closed domains), and it is integrally closed in (The integral closure of a domain in a field extension is integrally closed). Hence , an element of has integer coordinates in the integral basis , and a rational algebraic integer is an integer (The rational algebraic integers are exactly the integers).
For a number field of degree a -basis has discriminant , the determinant being taken over the distinct embeddings (Embedding determinant formula); for an integral basis this number is the well-defined nonzero integer (Discriminant of a basis and order, Number-field discriminant is well-defined and nonzero). In particular for and .
If is an -basis of and is a -basis of , then the products form an -basis of (Products of bases form a basis in a tower of finite extensions).
If an -dimensional vector space has a spanning list of vectors, then that list is a basis: a dependence lets one vector be solved for in terms of the others, leaving an -element spanning set, which cannot span a space containing an independent -element basis by the finite-bound corollary. A basis is an independent spanning set (If has a spanning set with elements, then every linearly independent subset of is finite with at most elements; in particular has no linearly independent subset equinumerous with , Basis of a vector space: a linearly independent spanning subset; and ordered basis: an injective finite list whose image is a basis).
If a positive integer and a finite list of integers have no common prime divisor, then repeated applications of integer Bézout give integers with . Also, gives integers with (Bézout's identity: for integers not both zero, is the least positive element of ; in particular has an integer solution).
has characteristic zero and is perfect (Fields of characteristic zero, finite fields, and algebraically closed fields are perfect), so the finite extension is simple: for some , with minimal polynomial of degree and (Every finite extension of a perfect field is simple, The evaluation kernel and the unique monic irreducible minimal polynomial of an algebraic element).
for endomorphisms of a finite-dimensional space (Determinant multiplicativity follows from the top exterior power), and simultaneous reordering of the rows and columns of a square matrix does not change its determinant, being a similarity by a permutation matrix (Similar matrices over a commutative ring have the same determinant). The determinant of a matrix is given by the Leibniz sum (For , the determinant over a commutative ring by the Leibniz formula, and for a real matrix).
Proof
By [F1] the given bases are -bases of and , and [F2] gives and .
Every embedding extends to an embedding with . Indeed, by [F9] write with minimal polynomial of degree ; then , and shows that has no factor of intermediate degree over , so is irreducible over and as -algebras. The evaluation homomorphism , , kills because fixes and ; it therefore induces the required under the isomorphism .
Put . Since are a -basis of , each product is a -linear combination of them; the same structure constants lie in , so is closed under multiplication. Also , and contains both and . It is finite-dimensional over . For each nonzero , multiplication by is an injective -linear map , because lies in the field ; finite dimensionality makes the map surjective, so some satisfies . Thus is a field containing and , hence . By [F2] it has -dimension . Its elements span ; if they were dependent, a nonzero coefficient in a dependence relation could be inverted in to express one in terms of the others, so the remaining vectors would still span . But an -element basis of is an independent subset of a space with that -element spanning set, contradicting [F7]. Thus the are independent and spanning, hence an -basis by [F7]. The symmetric argument with shows that form a -basis of by the same finite argument.
Applying [F6] to the tower with the -basis of and the -basis of , the products form a -basis of ; in particular they are -linearly independent and there are of them.
Let . By step 2.1 there are unique with . Each lies in , so there are integers and a positive integer with ; dividing out common factors, we may assume that no prime divides and all simultaneously.
Let be the distinct embeddings of into and let extend as in step 1.2. Applying to and using together with gives the linear system , . Its coefficient matrix has determinant with by [F5]; the entries of are algebraic integers, and so are the entries , by [F3] applied to the integral elements and .
Cramer's rule applied to the system of step 4.1 gives , where is the determinant of a matrix with algebraic-integer entries; hence and every are algebraic integers by [F3], and is an algebraic integer, where is a nonzero integer.
By step 3.2, lies in , so by step 5.1 and [F4]. As is an integral basis, the rational numbers are integers; equivalently for all .
The denominator was reduced in step 3.2, so no prime divides and every ; therefore their common gcd is . By [F8], choose integers with . Multiplying by and using from step 6.1 shows that every term on the left is divisible by , hence .
Regroup the same expansion from step 3.2 as , where . The symmetric trace-matrix argument, now using the -basis and the -basis from step 2.1, gives for every same coefficient . The same reduced-denominator identity of [F8] therefore gives . Together with step 7.1 and , this implies . Thus for every , proving .
Conversely : products and sums of integral elements are integral by [F3], and they lie in . With step 8.1 this gives , and since the products are -linearly independent by step 3.1 and span over by construction, they form an integral basis of .
The restrictions of the distinct embeddings of into to and to define a map ; it is injective, because an embedding of is determined by its restrictions to and to , which together generate over . Both sides have elements by [F5], so the map is a bijection. Order rows by pairs and columns by pairs , with the first index slow in each order. The embedding matrix of the integral basis of step 9.1 then has entries .
The embedding matrix of step 10.1 is : summing over the intermediate pair gives . Here and . By [F10], . In the first-index-slow ordering of step 10.1, is block diagonal with blocks , so . For , reorder both its rows and its columns by the same perfect shuffle from to and from to . These are the same permutation of positions, so their determinant signs multiply to ; in the resulting ordering is block diagonal with blocks . Hence , using [F10] and the Leibniz formula for block diagonal matrices.
By [F5], , using and from [F5] and , . This completes the proof.
Ring of integers of every cyclotomic field
Statement
For every , with a primitive -th root of unity in a fixed algebraic closure of , and is an integral basis of .
Facts & Assumptions
Given: An integer and a primitive -th root of unity in a fixed algebraic closure of . When , write with pairwise distinct primes and , put and , and put . For put and .
is monic of degree , , and is irreducible in (The recursion defines a unique monic , of degree , is irreducible in for every ). Hence is the minimal polynomial of , so and are linearly independent over , and is a cyclotomic extension of of order (The cyclotomic extension as a splitting field of ).
Euler's totient is multiplicative on coprime arguments, so by induction on one has (Euler's totient is multiplicative: implies for positive ).
For each prime power the prime-power cyclotomic structure theorem gives with an integral basis of , and with the field discriminant satisfying for the integer (Prime-power cyclotomic ring, discriminant support and p factor).
Coprime-discriminant compositum: if are number fields inside a common algebraic closure with and , then , the products of an integral basis of and an integral basis of form an integral basis of , and (Integral basis and discriminant of a coprime-discriminant compositum).
Bézout: if have , there is with (Bézout's identity: for integers not both zero, is the least positive element of ; in particular has an integer solution, Coprime integers: ).
If satisfy , and , then ; consequently, if finitely many pairwise coprime integers each divide , their product divides (If and then ; and if , and then ).
An integral basis of is an ordered -basis of (Integral and power integral bases, Ring of integers).
Proof
For one has , , and , so and the single element is a -basis. For we keep the notation of the Given; each has order , because has order ; hence is a primitive -th root of unity and is a prime-power cyclotomic field as in [F4].
By induction on the compositum is and : for this is with degree by [F1]; and if it holds for , then by [F2] because , while by [F1] and [F3]. In particular and inside .
The two rings agree: . Indeed each lies in , which gives the inclusion . Conversely, for each the numbers and are coprime, so [F6] provides with ; since for , the integer is divisible by every , and these are pairwise coprime with product , so by [F7]. Hence , that is , giving the reverse inclusion.
Applying step 1.2 and the compositum theorem [F5] inductively on gives , with the products of the individual power bases as an integral basis, and is a product of powers of the distinct primes . Indeed, for this is [F4]; and for the induction step satisfies the degree hypothesis by step 1.2, while because the first discriminant is a product of powers of and the second is by [F4], so [F5] converts into and preserves the basis statement.
By steps 1.2, 1.3 and 2.1 with , . Every power is a -linear combination of : this is clear for , and the monic relation of degree expresses as such a combination, after which induction on handles all larger powers; hence spans the -module , and by [F1] these elements are also linearly independent over , hence over . A linearly independent spanning set of a -module is a -basis (Basis of a vector space: a linearly independent spanning subset; and ordered basis: an injective finite list whose image is a basis), so is an ordered -basis of , that is, an integral basis by [F8].
Remarks
- Where coprimality is used. The prime-power discriminants are (up to sign) powers of the distinct primes , so the coprime-discriminant hypothesis of the compositum theorem holds at every step. The degree hypothesis is supplied by the compositum identity together with multiplicativity of on coprime arguments; neither hypothesis is automatic.
- The Bezout step is the only place where the product structure of enters additively. It shows that is a monomial in the , so the ring generated by all the local roots is already .
Signed discriminant of a cyclotomic field
Statement
Let be a reduced index, that is is odd or , and let for a primitive -th root of unity . Then the signed field discriminant is the product being over the primes dividing ; for one has . The conductor theorem later identifies the reduced index with the intrinsic conductor of .
Facts & Assumptions
Given: A reduced index and a primitive -th root of unity in a fixed algebraic closure of , with and . In the main case , write with pairwise distinct primes and , put and , and for put and .
has ring of integers with the power basis as an integral basis, and (Prime-power cyclotomic ring, discriminant support and p factor).
Coprime-discriminant compositum: for number fields with and , the ring of integers satisfies and (Integral basis and discriminant of a coprime-discriminant compositum).
For every , and is an integral basis (Ring of integers of every cyclotomic field); the discriminant of an order is independent of the chosen integral basis, so it may be computed from this basis (Discriminant of a basis and order, Power-basis and polynomial discriminants).
inside the fixed algebraic closure, with : this is the compositum identity together with irreducibility of the cyclotomic polynomials and multiplicativity of on coprime arguments (, is irreducible in for every , Euler's totient is multiplicative: implies for positive , The cyclotomic extension as a splitting field of ).
For an ordered -basis of a number field with distinct embeddings one has and the determinant is nonzero (Embedding determinant formula).
A real number that is a root of unity is , of multiplicative order or (The group of -th roots of unity in a field, and primitive -th roots of unity). The signature of a number field satisfies (Archimedean embeddings and signature).
Proof
In the main case , each is at least : if is odd this is clear, and if then because is reduced, so . Hence each has degree , and by multiplicativity of on the coprime factors .
For every the power-basis computation of [F1] gives with , and the p_i-adic exponent of the claimed formula is .
The field has no real embedding: if for an embedding , then is a root of unity whose order is exactly , because if and only if if and only if ; but by [F6] a real root of unity has order or , a contradiction. Hence , complex conjugation acts on the embeddings as a fixed-point-free involution, and by [F6].
In the separate case from the Statement with , one has , and [F3] gives the integral basis of . Its trace Gram matrix is the matrix , so its determinant is ; by the discriminant definition in [F3], .
By induction on , : for , and the exponent is ; for , [F4] gives and with , the discriminants and are coprime because one is a product of powers of and the other is , and [F2] then gives .
With respect to the integral basis of [F3], the determinant of [F5] is nonzero and . Complex conjugation permutes the index set of the embeddings by a product of transpositions by step 1.3, so and therefore ; since , the sign of is .
Taking absolute values in the induction of step 2.1 with and using and gives .
Combining the sign of step 2.2 with the absolute value of step 3.1 gives for the given reduced index ; the separate case has by step 1.4. These are the cases in the Statement.
Remarks
- Sign and absolute value are computed separately. The absolute value comes from the prime-power absolute discriminants and the coprime-discriminant compositum formula; the sign comes from the pairing of complex embeddings. Neither the different ideal nor its positive norm is used.
- Reduced index. For an unreduced index with odd one has , and the formula must be applied to the reduced index ; the statements of this pair therefore exclude .
Total ramification at a prime-power cyclotomic level
Statement
For a prime and an integer , put and . Then and the principal ideal is the unique prime ideal of lying above , with residue field .
Facts & Assumptions
Given: A prime , an integer , , a primitive -th root of unity , , and .
and ; moreover is an integral basis of (Prime-power cyclotomic ring, discriminant support and p factor, Ring of integers of every cyclotomic field).
is monic of degree and (, and is Eisenstein at ).
Division by the monic polynomial in writes every uniquely as with and constant remainder (Division by a monic polynomial over a commutative ring); hence the evaluation homomorphism , , is a surjective ring homomorphism with kernel , so (First isomorphism theorem for rings: ).
An ideal of a commutative ring is maximal if and only if is a field ( is a field if and only if is a maximal ideal), and every maximal ideal is prime (Every maximal ideal of a commutative ring is prime). Also is a field (For every prime , the two operations on make it a field).
A nonzero prime of lies above when , and its residue degree is (Primes above and residue degree).
Proof
Under the presentation with , the element corresponds to the class of , so ; sending to via [F3] identifies this quotient with .
Since is a field, is a maximal and hence prime ideal of , and it is proper; consequently is a proper ideal of containing (as by [F1]) and therefore equals , so lies above with residue field , of residue degree .
If is any prime ideal of with , then , so because is prime, hence ; as is maximal and is proper, . Thus is the unique prime above .
Combining [F1] with steps 2.1 and 3.1, and is the unique prime of above , with residue field . For , this reads , , , and is the unique prime above with residue field .
Remarks
- Total ramification. The exponent equals the degree , and the residue degree is , so is totally ramified; the equality exhibits the ramification index without invoking any general ramification theory beyond the definitions.
- The quotient computation is the only place where is used, and it also shows that no prime other than can contain .
Choice-free prime factorisation for a monogenic number ring
Statement
Let be a number field with , and let be the monic minimal polynomial of . For a rational prime , factor the image of in as into distinct monic irreducibles. Let be the coefficientwise lift of with coefficients in . Then
The ideal is independent of the integer lift, since two lifts differ by a polynomial in . The are distinct primes of with residue degrees . This proof uses no Axiom of Choice.
Facts & Assumptions
Given: A number field with , its monic minimal polynomial , a rational prime , and a factorisation in into distinct monic irreducibles , where and , and their coefficientwise integer lifts as in the Statement.
Evaluation at identifies with (The evaluation kernel and the unique monic irreducible minimal polynomial of an algebraic element, First isomorphism theorem for rings: , The quotient ring with ). Reducing this presentation modulo gives .
Since is prime, is a field (For every prime , the two operations on make it a field). The powers are pairwise comaximal in , so the Chinese remainder theorem gives Each factor has unique prime ideal generated by the image of , and its residue field is (Bézout identity and the Euclidean algorithm for polynomials over a field, Chinese remainder theorem for pairwise comaximal ideals, For every field , is a unique factorisation domain).
Every nonzero integral ideal of a number field's ring of integers has a unique finite factorisation into powers of distinct nonzero prime ideals; the finite construction uses no Choice (Integral ideal factorisation in a number field, in ZF).
If is a prime ideal, is the localisation at the multiplicative set , and its maximal ideal is (Localisation at a prime ideal: , is local with unique maximal ideal ). Localisation commutes with quotient rings (Localisation commutes with quotient rings: ).
A prime lies above when , and its residue degree is (Primes above and residue degree).
Proof
Put . By [F1],
Since , apply [F3] to write with distinct nonzero primes and positive exponents .
Under this isomorphism, [F2] decomposes as the product of the local rings . The unique prime of is generated by and has residue field ; therefore the primes of containing are exactly the distinct inverse images .
It follows that , a field of degree over . Thus each is a nonzero prime above with residue degree by [F5].
The finite ring is the product in [F2], so every prime containing is maximal. Each contains and hence equals one of the by step 2.1. Conversely, each contains ; its primality implies for some , and maximality makes . Hence the list is exactly the list , with one exponent attached to each .
Fix and put and . Each other contains an element outside , which becomes a unit, so By [F4], is local with maximal ideal ; it is a domain because it is a localisation of the domain . Also , so each power of is finitely generated by the monomials in these two generators.
The ideal is nonzero: it contains . If , then . Among finite generating lists of , take one of minimum length , say . The equality gives with . Since is a unit in the local ring , this expresses in terms of the first generators, contradicting minimality. Hence . In the maximal ideal therefore has nilpotency index exactly , including .
By [F1] and [F4], Writing with , each factor of is a unit in . Thus the displayed local ring is . Its maximal ideal is generated by and has nilpotency index exactly : its -th power vanishes, while , since cancellation in the polynomial localisation domain would otherwise make the nonunit a unit. Comparing its nilpotency index with step 5.1 gives .
Substituting into the factorisation of step 1.2 yields The residue degrees are those proved in step 3.1, and . The polynomial factorisation and its CRT decomposition are finite; the only ideal-factorisation input [F3] explicitly uses finite least-coded choices and no Choice.
Remarks
- Repeated factors are retained. The multiplicities are recovered by localising the polynomial quotient at and comparing its nilpotency index with the local exponent in the ideal factorisation.
- Supplier route. This proof uses the published choice-free ideal-factorisation theorem Integral ideal factorisation in a number field, in ZF for existence of the ideal factorisation. The exact local nilpotency index is proved here using the explicit finite generators and a minimal generating list. It therefore no longer claims to avoid general ideal-factorisation theory.
- The monogenic hypothesis is essential. It identifies with the explicit quotient ; for a non-monogenic order, reduction of a minimal polynomial does not by itself describe the primes of .
Arithmetic Frobenius is the power map in an unramified cyclotomic field
Statement
Let be a reduced index, that is is odd or , let be a rational prime with , let be a primitive -th root of unity and . Let be the automorphism of with . Then for every prime of above , the element is the arithmetic Frobenius : it is the unique with and for all . In particular it does not depend on the chosen prime above , the Galois group being abelian.
Facts & Assumptions
Given: A reduced index , a rational prime with , a primitive -th root of unity , the field , and the automorphism with .
, and is an integral basis (Ring of integers of every cyclotomic field).
is the monic minimal polynomial of over and has degree ( is irreducible in for every , The recursion defines a unique monic , of degree ).
is Galois with via ; this group is abelian and every automorphism has this form ( and ).
For , the reduction of in is a product of pairwise distinct monic irreducibles, each of degree (For the reduction of in is a product of distinct monic irreducibles, each of degree the order of modulo ).
Since , applying the monogenic factorisation lemma to gives where are distinct primes above , each of residue degree , where is the coefficientwise lift of with coefficients in (Choice-free prime factorisation for a monogenic number ring, Primes above and residue degree).
Over a field whose characteristic does not divide , the roots of in a splitting field of are exactly the primitive -th roots of unity. For the residue field , take a splitting field of over it; its natural field embedding is injective and preserves the multiplicative order of each element. Since has characteristic and , the theorem applies to the image of there (Over a field whose characteristic does not divide , the roots of are exactly the primitive roots of unity, The cyclotomic extension as a splitting field of ).
For a prime above an unramified rational prime in a finite Galois extension, there is a unique arithmetic Frobenius in the decomposition group satisfying for all algebraic integers (Unramified frobenius element exists uniquely).
Proof
By [F1] and [F2], the ring of integers is , the minimal polynomial of is , and its degree is . By [F3], is abelian and each automorphism is for a unit class modulo , in particular exists. If , then and the unique prime over is ; the trivial automorphism is its arithmetic Frobenius.
Since , [F4] and [F5] give with distinct primes , each of residue degree . Thus is unramified and these are all the primes above it.
Fix . By [F7] the prime has an arithmetic Frobenius satisfying the -power congruence. Evaluating it at gives
The residue class is a root of the reduction of , since . Embed the residue field into a splitting field of over it. By [F6], the image of has multiplicative order exactly there; injectivity of the field embedding gives the same order for in the residue field.
Write using [F3]. Reducing the congruence in step 1.3 gives Since has order by step 1.4, ; hence . This comparison is made directly in the residue field at , so it does not require to stabilise in advance.
The argument applies to every prime above , and each gives the same automorphism . Thus this arithmetic Frobenius is independent of the prime above , as also follows from the abelian Galois group in [F3].
Remarks
- Reduced index. The hypothesis that is odd or is the standing reduced-index convention of this pair; for the present lemma the essential hypothesis is , which makes separable modulo .
- Power map, not inverse. The identification uses the arithmetic convention ; the geometric inverse would send to and agrees with the arithmetic map exactly when , since is a unit modulo .
Prime factorisation in a cyclotomic field
Statement
Let be a reduced index, that is, is odd or . Let be a rational prime, write with (so is the -adic valuation of , , and when ), and put , , the multiplicative order of modulo , and , with the conventions and . Let be a primitive -th root of unity and . Then with pairwise distinct primes of residue degree , and .
Facts & Assumptions
Given: A reduced index , a rational prime , the factorisation with , the numbers , , (with the conventions and ), a primitive -th root of unity , the field , and, for , the image of in .
is monic of degree with , its roots in a field of characteristic not dividing are exactly the primitive -th roots of unity, and is irreducible over ; hence is the minimal polynomial of over , and is a cyclotomic extension of order (The recursion defines a unique monic , of degree , Over a field whose characteristic does not divide , the roots of are exactly the primitive roots of unity, is irreducible in for every , The cyclotomic extension as a splitting field of ).
Monogenic factorisation: if is a number field with and monic minimal polynomial of , and if the image of in factors as into distinct monic irreducibles, then with pairwise distinct primes of residue degree , where is the coefficientwise lift of with coefficients in ; the argument uses no Axiom of Choice (Choice-free prime factorisation for a monogenic number ring, Primes above and residue degree).
For every , in , and is monic of degree ; in particular (The recursion defines a unique monic , of degree , The cyclotomic polynomials , defined by ).
Finite-field factorisation: if and , then is a product of pairwise distinct monic irreducible polynomials in , each of degree , and there are of them (For the reduction of in is a product of distinct monic irreducibles, each of degree the order of modulo , The order of a finite group and the order of an element, with when no positive power of is the identity, The unit group and Euler's totient for ).
Euler's totient is multiplicative on coprime arguments: when (Euler's totient is multiplicative: implies for positive ).
is an integral domain (indeed a unique factorisation domain), so a product identity with implies (For every field , is a unique factorisation domain).
Total ramification in a prime-power cyclotomic field: for , with , and is the unique prime above , with residue field (Total ramification at a prime-power cyclotomic level).
Proof
Assume . Since , the divisors of are exactly the with and ; reducing the product identity of [F4] at and at modulo and using in therefore gives and . The second product is the part of the first, and , so cancelling this common factor in the domain gives .
Applied to , which is coprime to , [F5] gives with , where the are pairwise distinct monic irreducible elements of of degree ; in particular .
Claim: for our fixed , in for every with . This is proved by strong induction on . For , step 1.1 with gives , while by [F4], so . For , assume the claim for every proper divisor , ; step 1.1 with gives , and [F4] gives , so substituting for the proper divisors yields ; the common factor is a nonzero product of nonzero monic polynomials, so cancellation in the domain gives .
Since , [F6] gives , so .
In all cases one has in , a product of pairwise distinct monic irreducibles of degree with common multiplicity : if this is step 2.1 at combined with step 1.2, and if then and , so the same formula is step 1.2 itself.
By [F1], [F2] the element has and monic minimal polynomial , so the monogenic factorisation [F3] applies with to the factorisation of step 3.1: with pairwise distinct primes of residue degree , where is the coefficientwise integer lift modulo , and .
Edge cases. If then , , and , so steps 3.1 and 4.1 give , and step 2.2 gives ; if and then and , so , while [F8] with , gives with the unique prime above ; the two descriptions agree by uniqueness of the prime above .
Remarks
- Where reducedness enters. The factorisation argument itself only uses ; the reduced-index hypothesis is the standing convention for cyclotomic conductors in this pair, and it is exactly what excludes the degenerate shape with odd, where yet and is unramified, so the companion ramification criterion needs the reduced index as stated.
- Unramified case. When the theorem specialises to with primes of residue degree , the form in which the unramified-decomposition corollary of this page reads off the residue degree of the arithmetic Frobenius (Decomposition of an unramified prime in a cyclotomic field).
- Choice. The proof's only structural inputs are the choice-free monogenic reduction [F3] and finite polynomial arithmetic; the monograph-level finite field factorisation [F5] is quoted as a published interface.
Ramification primes of a reduced cyclotomic conductor
Statement
Let be a reduced index, that is, is odd or , and let . A rational prime ramifies in — that is, in the factorisation of some prime ideal occurs with exponent at least — if and only if .
Facts & Assumptions
Given: A reduced index , a primitive -th root of unity , the field , a rational prime , and the factorisation with (so is the -adic valuation of and exactly when ).
By the prime factorisation theorem for reduced indices, with pairwise distinct primes ; in particular every prime above has exponent exactly in , so is unramified in if and only if (Prime factorisation in a cyclotomic field).
For a prime and , , and ; hence for one has exactly when and (For a prime and , ).
Since is reduced, is odd or ; consequently, if then , so the exponent is not — it is either or at least . [definition of reduced index, arithmetic]
Proof
If then , while if then holds exactly for , ; hence if and only if , or and .
If then ; if moreover then by [F3], so the exceptional case , of step 1.1 cannot occur for the reduced index .
Combining steps 1.1 and 2.1: when we have and , and when we have with , hence .
By [F1] the ramification behaviour of is read off from the single exponent : is unramified exactly when and ramified exactly when . Step 3.1 therefore gives: implies and unramified, while implies and ramified. Hence ramifies in if and only if .
Remarks
- Reducedness is essential for the converse. For the non-reduced index one has and divides although is unramified; the exclusion of indices is exactly what makes "" equivalent to ramification here.
- Prime divisors of the conductor. Once the companion conductor theorem identifies the reduced index with the conductor (Cyclotomic conductor of a full cyclotomic field) of , the corollary reads: the ramified primes are exactly the prime divisors of the conductor, and away from them the Frobenius is the power map by Arithmetic Frobenius is the power map in an unramified cyclotomic field.
Conductor of a full cyclotomic field
Statement
Let and let be the -th cyclotomic field. The cyclotomic conductor of is In particular for odd , and for one has of conductor .
Facts & Assumptions
Given: An integer ; for every the index and the number . Also a primitive -th root of unity for each .
Conductor: the cyclotomic conductor of a full cyclotomic field is the least positive that is admissible, meaning that there is a -algebra embedding into a splitting field of over (Cyclotomic conductor of a full cyclotomic field). Splitting fields of over are unique up to -isomorphism and is one, so is admissible for exactly when embeds in (Any two splitting fields of a polynomial are isomorphic over the base field, The cyclotomic extension as a splitting field of ).
For a primitive -th root , the polynomial is its monic minimal polynomial over and its roots are exactly the primitive -th roots of unity ( is irreducible in for every , Over a field whose characteristic does not divide , the roots of are exactly the primitive roots of unity); hence a -algebra embedding into a field sends to a primitive -th root of unity , and is the splitting field of over inside , that is, a copy of .
If is odd then and , so is a primitive -th root of unity; hence the splitting field of over is , that is, (The cyclotomic extension as a splitting field of ).
Prime factorisation in a reduced cyclotomic field: for a reduced index and a rational prime , writing with , one has with pairwise distinct primes ; in particular every prime of above occurs with exponent in (Prime factorisation in a cyclotomic field).
Tower of ramification groups: for a tower of number fields with and finite Galois and primes , the restriction maps fit in the exact sequence (Decomposition and inertia in towers); and for a finite Galois extension the inertia group order is the ramification exponent, (Orders of decomposition and inertia groups).
Euler totient of prime powers: and, for , for every prime (For a prime and , ); hence is strictly increasing on , and for except for , .
For every the extension is Galois with group isomorphic to ( and , The cyclotomic extension as a splitting field of ).
A nonzero prime of a number-field ring of integers lies above a prime of the base ring when its contraction is exactly (Primes above and residue degree).
Proof
For every the index is reduced and : this is immediate by definition when is odd or , and if with odd then is odd and [F3] gives .
If is a -algebra embedding into a field , then the image of is a primitive -th root of unity and the subfield is a splitting field of inside , hence a copy of ; in particular an embedding exhibits as a subfield of .
By step 1.1, is a splitting field of over that contains , so the identity embedding shows that is admissible for ; hence the conductor of is at most .
Let be admissible for and put . By step 1.1, is reduced and , so admissibility gives a -algebra embedding , i.e., since by step 1.1, an embedding ; step 1.2 then makes a subfield of .
Let be a prime with , and write and , so step 2.2 gives . By [F4], choose a prime of above ; define . The inclusion makes the inverse image of the prime , hence is prime. Since , one has , so ; moreover , so [F8] says lies above . By [F4], the ramification exponents of these primes are and (with allowed and ). By [F7], both and are Galois, so [F5] applies to and makes a quotient of ; therefore divides .
For every prime the exponents of in the reduced indices and lie in when is odd and in when ; by [F6] the function is strictly increasing on these sets and satisfies for and for odd , so implies . Step 3.1 therefore gives for every prime — vacuously when — so ; and equals or , so and hence .
Step 2.1 shows that is admissible and step 4.1 shows that every admissible satisfies ; hence the least admissible index — the conductor of — equals . Consequently the conductor is when is odd or and is when ; in particular for odd by step 1.1, and for the conductor is , with .
Remarks
- Dependency reconciliation (Step 3a observation). The comparison of ramification exponents inside the inclusion is supplied here by the published tower theorem Decomposition and inertia in towers together with Orders of decomposition and inertia groups; the local monogenic/DVR route sketched in the scaffold is not needed, and no use is made of any general ideal factorisation theorem beyond the pair's own Prime factorisation in a cyclotomic field.
- The excluded shape. For with odd one has , so is never the conductor; Remark 11.7 of Conrad-Landesman makes the same point via and .
Decomposition of an unramified prime in a cyclotomic field
Statement
Let be the conductor of the cyclotomic field , and let be a rational prime with . Then every prime of above has residue degree the multiplicative order of modulo , and there are exactly such primes.
Facts & Assumptions
Given: A cyclotomic field presented by its conductor , so that is the least admissible index for (Cyclotomic conductor of a full cyclotomic field), a rational prime with , and the factorisation with (so and under the hypothesis ).
The conductor of a full cyclotomic field is a reduced index: it is odd or divisible by (Conductor of a full cyclotomic field, Cyclotomic conductor of a full cyclotomic field).
Prime factorisation in a reduced cyclotomic field: for the reduced index , a rational prime , and with , with the pairwise distinct primes of residue degree ; here (Prime factorisation in a cyclotomic field).
For the arithmetic Frobenius at every prime above is the automorphism with (Arithmetic Frobenius is the power map in an unramified cyclotomic field).
Proof
By [F1], is a reduced index; as the -adic valuation is , so and .
Applying [F2] with , , the ideal factors as with pairwise distinct primes of residue degree , so is unramified and these are exactly the primes above .
Therefore every prime above has residue degree and their number is . This degree also equals the order of the arithmetic Frobenius in [F3]: for , , so, since has order and generates , exactly when . The least such is , including for .
Remarks
- Conductor versus displayed index. The statement is about the conductor ; for an unreduced displayed index such as the count and degrees are those of the reduced index , as recorded in The reduced conductor of Q(zeta_6) ↗.
- Order-one convention. For one has and the formula gives the single prime , consistent with .
Complete splitting criterion for a cyclotomic field
Statement
Let be the conductor of the cyclotomic field , and let be a rational prime with . Then splits completely in if and only if
Facts & Assumptions
Given: The cyclotomic field presented by its conductor (Cyclotomic conductor of a full cyclotomic field), and a rational prime , so and the class of lies in .
Unramified decomposition: for the conductor and , every prime of above has residue degree and there are exactly of them; in particular is unramified (Decomposition of an unramified prime in a cyclotomic field).
Splitting terminology: a rational prime splits completely in if it is unramified in and every prime of above it has residue degree (Splitting and ramification terminology).
For a positive integer and an integer with , the order of the class equals if and only if (The order of a finite group and the order of an element, with when no positive power of is the identity, The unit group and Euler's totient for ).
( and ).
Proof
By [F1] the prime is unramified in and every prime above it has residue degree , so the primes above number .
By [F3], holds if and only if .
By [F2] and step 1.1, splits completely in if and only if every prime above has residue degree , i.e., if and only if ; equivalently (step 1.1) the number of primes above is then by [F4].
Combining steps 1.2 and 2.1: splits completely in if and only if , if and only if .
Remarks
- Consistency of counts. Complete splitting gives primes of residue degree , matching the decomposition count and the degree .
- Unramified hypothesis. The equivalence is stated for ; for the prime is ramified and the Frobenius element is not defined, by Ramification primes of a reduced cyclotomic conductor.
Quadratic Gauss sum in a prime cyclotomic field
Definition
Let be an odd prime, let be a fixed primitive -th root of unity (The cyclotomic extension as a splitting field of ), and let be the Legendre symbol (The Legendre symbol, including its zero value). The quadratic Gauss sum attached to is
The sum lies in and is an algebraic integer. The term vanishes because , so the sum is finite over the classes ; each is a root of and hence integral over (Integral elements over a commutative ring and algebraic integers), and the integral elements of form a subring, so is an algebraic integer lying in (Ring of integers).
The chosen root is part of the data. The notation always refers to the sum built from the explicitly chosen . Replacing by another primitive -th root changes up to a sign: indeed gives for every . The square and the field are unchanged by that replacement (Square of the quadratic Gauss sum, Quadratic subfield generated by the Gauss sum), but the sign of is not fixed until the primitive root (equivalently, a complex embedding) is fixed.
Galois action on the quadratic Gauss sum
Statement
Let be an odd prime, let be a fixed primitive -th root of unity, let be the quadratic Gauss sum attached to , and let be an integer not divisible by . For the automorphism of with one has
Facts & Assumptions
Given: An odd prime , a fixed primitive -th root of unity in a fixed algebraic closure of , the Gauss sum , and an integer with .
, because the term of the defining sum carries the factor (Quadratic Gauss sum in a prime cyclotomic field, The Legendre symbol, including its zero value).
is Galois over , and via ; every such fixes and hence acts on by -th powers of ( and ).
The Legendre symbol is multiplicative for all integer numerators: for all (The Legendre symbol is multiplicative for all integer numerators); moreover and for , so by multiplicativity applied to .
Proof
Applying the automorphism of [F2] to the finite sum of [F1] gives , since fixes the rational integers .
Multiplication by permutes the nonzero residue classes modulo , so substituting rewrites the sum as , where denotes an inverse of modulo .
By multiplicativity of the Legendre symbol the coefficient factors as , and because and . Therefore .
Remarks
- No analytic sign is used. The argument is a finite rearrangement of the defining sum together with the multiplicativity of the Legendre symbol; it never chooses a complex embedding of or a sign of . Later, together with the theorem that , this identity shows that exactly the square classes fix , which identifies the quadratic subfield generated by .
- Convention. As in the definition, is the arithmetic power map. Its inverse has the same action on , since by [F3].
Square of the quadratic Gauss sum
Statement
For every odd prime and every primitive -th root of unity , with ,
Facts & Assumptions
Given: An odd prime , a fixed primitive -th root of unity in a fixed algebraic closure of , and the Gauss sum .
, the term vanishing because (Quadratic Gauss sum in a prime cyclotomic field, The Legendre symbol, including its zero value).
The Legendre symbol is multiplicative for all integer numerators: for all (The Legendre symbol is multiplicative for all integer numerators).
Restricted to the Legendre symbol is a surjective homomorphism onto with kernel the nonzero square classes (On the units, the Legendre symbol is the unique nontrivial homomorphism to ); hence , because choosing with and substituting permutes the nonzero classes and multiplies the sum by , forcing it to be .
First supplement: (First supplement: ).
For an element with and one has , so ; and has order , so exactly when (The group of -th roots of unity in a field, and primitive -th roots of unity).
Proof
Squaring the sum of [F1] and multiplying out the finite product of sums gives .
For every integer the inner geometric sum over is when , while for it equals .
Multiplication by permutes the nonzero classes modulo , so substituting in the double sum of step 1.1 rewrites it as , using multiplicativity of the Legendre symbol in the last equality.
Substituting the two evaluations of step 1.2, the contribution of is and every other contributes ; hence , since the character sum vanishes by [F3].
By the first supplement [F4], , so .
Remarks
- Only finite sums and the first supplement are used. Neither quadratic reciprocity nor any analytic determination of the sign of enters; the square is insensitive to replacing by another primitive -th root, since that multiplies by .
- Nonvanishing. Since in the domain , the identity shows that , which is what makes the fixed field computation in Quadratic subfield generated by the Gauss sum possible.
Quadratic subfield generated by the Gauss sum
Statement
For an odd prime , the unique intermediate field with is where is the quadratic Gauss sum attached to a chosen primitive -th root of unity . At the field itself has degree two over , so the intermediate field of degree two may equal the full cyclotomic field.
Facts & Assumptions
Given: An odd prime , a fixed primitive -th root of unity in a fixed algebraic closure of , and the Gauss sum .
, the term vanishing, and the chosen root is part of the data (Quadratic Gauss sum in a prime cyclotomic field, The Legendre symbol, including its zero value).
For every integer not divisible by , the automorphism satisfies ; consequently the Gauss sum built from another primitive -th root equals and generates the same field as (Galois action on the quadratic Gauss sum).
is a finite Galois extension of with group ; the embedding taking with to is an isomorphism, and . The group is cyclic of order , so is cyclic of order ( and , For every prime , the multiplicative group is cyclic, The cyclotomic extension as a splitting field of ).
In a finite cyclic group of order , every positive divisor of is the order of exactly one subgroup, and every subgroup is the unique subgroup of its own order; in particular the cyclic group of [F4] has exactly one subgroup of order (A finite cyclic group has exactly one subgroup of each order dividing its own).
Fundamental theorem of finite Galois theory: for a finite Galois extension with group , the maps and are mutually inverse bijections between subgroups of and intermediate fields, and ; in particular intermediate fields of degree two over correspond bijectively to subgroups of index two (The fundamental theorem of finite Galois theory).
Lagrange's theorem: for a finite group and a subgroup one has (Lagrange's theorem: for every subgroup of a finite group ).
The Legendre symbol on is a homomorphism onto , so for every nonzero class (On the units, the Legendre symbol is the unique nontrivial homomorphism to ).
Proof
The sum is an element of , hence of , and it satisfies .
If is any primitive -th root of unity, then the Gauss sum built from is , a nonzero multiple of ; hence it generates the same subfield .
The rational number is not a square in : if in lowest terms had , then ; for the exponent of on the left side of is , while on the right it is , which is odd, a contradiction, and for the left side is positive while is negative.
Since , we have , and by step 1.3; as is a root of the degree-two polynomial , the degree divides and is not , so it equals , and by step 1.1. Moreover is a square root of , so and .
Let be any intermediate field with and put . By [F6] the subgroup has index in , so [F7] together with from [F4] gives . As is a positive divisor of , [F5] shows that the cyclic group has exactly one subgroup of order , so is that same subgroup for every such ; the bijection [F6] then gives , the same field for every such . Since step 2.1 exhibits as one of them, is the unique degree-two intermediate field.
Combining steps 1.2 and 3.1 with the identification of step 2.1: the unique degree-two intermediate field is , independently of the chosen primitive -th root, and for one has by [F4], so the unique degree-two intermediate field there is itself.
Remarks
- Nonvanishing is the decisive input. Without the element might generate only ; the square computation of Square of the quadratic Gauss sum is what makes the generated field quadratic.
- The sign of is not needed. Replacing by multiplies by the Legendre sign , which leaves both the square and the generated field unchanged; this is the content of the sign counterexample on the companion examples page.
Quadratic reciprocity as a Frobenius restriction identity
Statement
Let be odd primes, let be a fixed primitive -th root of unity, let be the quadratic Gauss sum attached to it, and put . The arithmetic Frobenius of in sends Its restriction to the quadratic subfield acts by and consequently
Facts & Assumptions
Given: Distinct odd primes and , a fixed primitive -th root of unity , the Gauss sum attached to it, the field , the element , and the automorphism with .
The index is reduced and ; hence is the arithmetic Frobenius at every prime of above : it is the unique element of with for all , and it does not depend on the choice of (Arithmetic Frobenius is the power map in an unramified cyclotomic field, Arithmetic frobenius coset).
For every integer not divisible by one has , where ; in particular (Galois action on the quadratic Gauss sum).
and is the unique intermediate field with ; moreover and (Square of the quadratic Gauss sum, Quadratic subfield generated by the Gauss sum, Quadratic Gauss sum in a prime cyclotomic field).
Euler's criterion: for every integer and the odd prime , , and (Euler's criterion: , The Legendre symbol, including its zero value).
: indeed with , so . [given, arithmetic]
Proof
By [F1] the automorphism sends to and is the arithmetic Frobenius at each prime above , while by [F2] it sends ; since , it maps to and therefore preserves .
Let be a prime of above and let be its residue field. Since and by [F5], we have , so the residue class of in the field is nonzero.
Euler's criterion [F4] with gives .
By the congruence property of [F1] applied to , for every prime above one has .
In one has , the last equality because by step 1.3 and contains .
Fix above . Steps 1.1, 1.4 and 2.1 compare the same element in the field and give ; the residue class of is nonzero by step 1.2, so cancellation gives .
Both and lie in ; their difference lies in , which is the prime ideal because lies above and is maximal. A difference of two elements of that is divisible by the odd prime must be ; hence .
The element generates over by [F3], and step 1.1 together with step 4.1 gives ; therefore the restriction of the arithmetic Frobenius to the quadratic subfield acts on by multiplication by , that is, it is the identity if and the nontrivial automorphism if .
Remarks
- Arithmetic convention. The result uses the arithmetic Frobenius ; the geometric inverse would send to , whose exponent is a different nonzero class modulo in general, and the identity with would then read with the inverse symbol.
- No prior reciprocity. Neither this theorem nor its supplier Square of the quadratic Gauss sum uses quadratic reciprocity: the comparison is between two independently computed signs for the same residue class.
Quadratic reciprocity via Frobenius
Statement
For distinct odd primes and ,
Facts & Assumptions
Given: Distinct odd primes and , and .
Quadratic Frobenius restriction identity: for distinct odd primes , (Quadratic reciprocity as a Frobenius restriction identity).
Legendre symbol multiplicativity: for all integers ; consequently for every integer , and with exactly when (The Legendre symbol is multiplicative for all integer numerators, The Legendre symbol, including its zero value).
First supplement: (First supplement: ).
, so and hence (The Legendre symbol, including its zero value).
Proof
By [F2], gives .
By [F3], , the exponent being an integer because and are even.
Since , the symbol is , so .
Substituting step 1.2 into step 1.1 gives .
Combining with [F1], .
Multiplying both sides of step 3.1 by and using from step 1.3 yields .
Remarks
- The earlier reciprocity theorem is not used. The only inputs are the Frobenius restriction identity, Legendre multiplicativity and the first supplement; in particular neither the published quadratic reciprocity theorem nor an analytic Gauss-sum sign is a supplier.
- Symmetry check. is symmetric in and , as the product form must be; the two special values and the case are excluded, the latter being exactly the case covered by the second supplement Second supplement from Frobenius on Q(zeta_8).
First supplement from Frobenius on Q(i)
Statement
For every odd prime , the arithmetic Frobenius of in the quadratic field sends to so it acts on by the quadratic sign .
Facts & Assumptions
Given: An odd prime , the element , a primitive fourth root of unity, and the field of degree over .
The index is reduced, and ; hence the arithmetic Frobenius of in is the power map (Arithmetic Frobenius is the power map in an unramified cyclotomic field, The cyclotomic extension as a splitting field of ).
, and , so for odd (Ring of integers of every cyclotomic field).
Euler's criterion: for every integer and odd prime , (Euler's criterion: , The Legendre symbol, including its zero value); the Legendre symbol satisfies .
Proof
By [F1] the Frobenius of acts on as the power map on , and by [F2] this is .
By Euler's criterion with , ; both and are elements of , so their difference is or , and a multiple of the odd prime ; hence the difference is and .
Therefore the arithmetic Frobenius acts on by multiplication by the quadratic sign , that is .
Remarks
- Independence from the earlier supplement. The sign is computed here from the power map and Euler's criterion; the published first-supplement theorem is not used as a supplier, so no circularity arises with the quadratic reciprocity corollary that consumes this item.
Second supplement from Frobenius on Q(zeta_8)
Statement
For every odd prime , the element satisfies , so is a quadratic subfield of , and the arithmetic Frobenius of acts on it by
Facts & Assumptions
Given: An odd prime , a primitive eighth root of unity , and the element .
The index is reduced, and ; hence the arithmetic Frobenius of in is the power map (Arithmetic Frobenius is the power map in an unramified cyclotomic field, The cyclotomic extension as a splitting field of ).
has order , so and ; in particular is a square root of and is a degree-two subfield of (Ring of integers of every cyclotomic field, The cyclotomic extension as a splitting field of ).
For every odd integer , writing the residue of modulo gives when and when , because and . For residues the integer is even, and for residues it is odd. Thus . [F1, algebra]
Euler's criterion: for every integer and odd prime , , and (Euler's criterion: , The Legendre symbol, including its zero value).
Proof
By [F2], generates the quadratic field inside , and .
By [F3] there is a sign with , namely .
Since is the arithmetic Frobenius, for every prime above ; here , and because and is odd. Hence as integers.
Euler's criterion with gives ; since both and lie in and their difference is divisible by the odd prime , they are equal. Therefore .
Finally , the exponent being an integer for odd and even exactly when , which matches the sign computed in step 1.2.
Remarks
- The quadratic field is a subfield of because up to sign; no uniqueness statement for the quadratic subfield is needed for the Frobenius restriction.
- Consistency of the two signs. The combinatorial sign in step 1.2 and the Legendre sign in step 3.1 are computed by different means and then compared modulo ; this is what fixes without invoking the earlier second-supplement theorem.
5 · Examples, counterexamples and false statements
None yet.
Sources
- J. S. Milne, Algebraic Number Theory, Ch. 6, Remark 6.6
- Conrad-Landesman, Math 154 Algebraic Number Theory, Ch. 11, Remark 11.7
- J. S. Milne, Algebraic Number Theory, Proposition 6.2 and proof, pp. 96-98
- Conrad-Landesman, Math 154 Algebraic Number Theory, Theorem 10.1 with Lemmas 10.2, 10.3, 10.5 and 10.6
- J. S. Milne, Algebraic Number Theory, Ch. 6, Lemma 6.5 and Remark 6.6(c)
- Conrad-Landesman, Math 154 Algebraic Number Theory, Theorem 11.9 and Warning 11.10
- J. S. Milne, Algebraic Number Theory, Ch. 6, Theorem 6.4 and Remark 6.6
- Conrad-Landesman, Math 154 Algebraic Number Theory, Theorem 11.6 with Lemma 11.8 and Theorem 11.9
- J. S. Milne, Algebraic Number Theory, Remark 6.6(c) and Proposition 6.2(d)
- Conrad-Landesman, Math 154 Algebraic Number Theory, Theorem 11.6 and Remark 11.7
- J. S. Milne, Algebraic Number Theory, Proposition 6.2(c) and proof, pp. 96-97
- Conrad-Landesman, Math 154 Algebraic Number Theory, Corollary 10.7
- J. S. Milne, Algebraic Number Theory, Theorem 3.41 and proof, pp. 62-63
- J. S. Milne, Algebraic Number Theory, Ch. 8, Example 8.18 and Ch. 6 Remark 6.6
- Conrad-Landesman, Math 154 Algebraic Number Theory, Chs. 11-12
- J. S. Milne, Algebraic Number Theory, Ch. 3 and Ch. 6
- J. S. Milne, Algebraic Number Theory, Ch. 8, Example 8.18
- Conrad-Landesman, Math 154 Algebraic Number Theory, Chs. 10-11
- Conrad-Landesman, Math 154 Algebraic Number Theory, Ch. 11, Theorem 11.6 and Remark 11.7
- J. S. Milne, Algebraic Number Theory, Ch. 1, Theorem 1.1 and Ch. 6
- Conrad-Landesman, Math 154 Algebraic Number Theory, Ch. 11, Theorem 11.6
- Jerry Shurman, Math 361 Ninth Lecture, sections 2-3
- J. S. Milne, Algebraic Number Theory, Ch. 8, Example 8.19
- Jerry Shurman, Math 361 Ninth Lecture, section 2
- Jerry Shurman, Math 361 Ninth Lecture, section 4
- Conrad-Landesman, Math 154 Algebraic Number Theory, Ch. 12
- J. S. Milne, Algebraic Number Theory, Ch. 6, Remark 6.3(a) and Ch. 8
- Jerry Shurman, Math 361 Ninth Lecture, sections 3-4