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.
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.
Depends on
- Arithmetic Frobenius is the power map in an unramified cyclotomic field
- Galois action on the quadratic Gauss sum
- Quadratic subfield generated by the Gauss sum
- Euler's criterion: $(a/p)\equiv a^{(p-1)/2}\pmod p$
- Square of the quadratic Gauss sum
- Quadratic Gauss sum in a prime cyclotomic field
- The Legendre symbol, including its zero value
- Primes above and residue degree
- The cyclotomic extension $K(\mu_n)$ as a splitting field of $t^{n}-1$
- Arithmetic frobenius coset
Used by
- Quadratic reciprocity via Frobenius Corollary
- Frobenius restriction for p=5 and q=3 Example
Dependency tree · two levels
44 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. 8, Example 8.19 (standard reference, not scraped)
- Jerry Shurman, Math 361 Ninth Lecture, section 4 (standard reference, not scraped)
- Conrad-Landesman, Math 154 Algebraic Number Theory, Ch. 12 (standard reference, not scraped)