Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6.1-sol)audited 2026-10-02
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 p≠q be odd primes, let ζp be a fixed primitive p-th root of unity, let τp=∑a mod p(a/p)ζp a be the quadratic Gauss sum attached to it, and put p∗=(−1)(p−1)/2p. The arithmetic Frobenius Frob⁡q of q in Q(ζp) sends ζp⟼ζp q,τp⟼(qp)τp. Its restriction to the quadratic subfield Q(p∗) acts by τp⟼(p∗q)τp, and consequently (p∗q)=(qp).

Facts & Assumptions

Given: Distinct odd primes p and q, a fixed primitive p-th root of unity ζ=ζp, the Gauss sum τ=τp attached to it, the field K=Q(ζ), the element p∗=(−1)(p−1)/2p, and the automorphism σq∈Gal⁡(K/Q) with σq(ζ)=ζ q.

[F1]

The index p is reduced and q∤p; hence σq is the arithmetic Frobenius at every prime P of OK above q: it is the unique element of Gal⁡(K/Q) with σq(x)≡xq(modP) for all x∈OK, and it does not depend on the choice of P (Arithmetic Frobenius is the power map in an unramified cyclotomic field, Arithmetic frobenius coset).

[F2]

For every integer b not divisible by p one has σb(τ)=(b/p)τ, where σb(ζ)=ζ b; in particular σq(τ)=(q/p)τ (Galois action on the quadratic Gauss sum).

[F3]

τ2=p∗ and Q(τ)=Q(p∗) is the unique intermediate field Q⊆F⊆K with [F:Q]=2; moreover τ∈OK and τ∉Q (Square of the quadratic Gauss sum, Quadratic subfield generated by the Gauss sum, Quadratic Gauss sum in a prime cyclotomic field).

[F4]

Euler's criterion: for every integer a and the odd prime q, (a/q)≡a(q−1)/2(modq), and (a/q)∈{−1,0,1} (Euler's criterion: (a/p)≡a(p−1)/2(modp), The Legendre symbol, including its zero value).

[F5]

q∤p∗: indeed p∗=±p with q≠p, so p∗≢0(modq). [given, arithmetic]

Proof

technique · direct
1.1F1F2F3

By [F1] the automorphism σq sends ζ to ζq and is the arithmetic Frobenius at each prime above q, while by [F2] it sends σq(τ)=(q/p)τ; since (q/p)=±1, it maps τ to ±τ and therefore preserves F=Q(τ).

1.2F3F5

Let P be a prime of OK above q and let κ=OK/P be its residue field. Since τ2=p∗ and q∤p∗ by [F5], we have τ2≡p∗≢0(modP), so the residue class of τ in the field κ is nonzero.

1.3F4

Euler's criterion [F4] with a=p∗ gives (p∗)(q−1)/2≡(p∗/q)(modq).

1.4F1F3

By the congruence property of [F1] applied to x=τ∈OK, for every prime P above q one has σq(τ)≡τq(modP).

2.1F3step 1.3

In κ one has τq=τ⋅(τ2)(q−1)/2=τ⋅(p∗)(q−1)/2=(p∗/q) τ, the last equality because (p∗)(q−1)/2≡(p∗/q)(modq) by step 1.3 and P contains q.

3.1step 1.1step 1.2step 1.4step 2.1

Fix P above q. Steps 1.1, 1.4 and 2.1 compare the same element in the field κ and give (q/p)τ=σq(τ)≡τq=(p∗/q)τ(modP); the residue class of τ is nonzero by step 1.2, so cancellation gives (qp)≡(p∗q)(modP).

4.1step 3.1F4

Both (qp) and (p∗q) lie in {−1,1}; their difference lies in P∩Z, which is the prime ideal (q) because P lies above q and qZ is maximal. A difference of two elements of {−1,1} that is divisible by the odd prime q must be 0; hence (p∗q)=(qp).

5.1step 1.1step 4.1F3∎

The element τ generates F=Q(p∗) over Q by [F3], and step 1.1 together with step 4.1 gives σq(τ)=(qp)τ=(p∗q)τ; therefore the restriction of the arithmetic Frobenius to the quadratic subfield Q(p∗) acts on τ by multiplication by (p∗q), that is, it is the identity if (p∗q)=1 and the nontrivial automorphism if (p∗q)=−1.

Remarks

  • Arithmetic convention. The result uses the arithmetic Frobenius ζ↦ζq; the geometric inverse would send ζ to ζq−1, whose exponent is a different nonzero class modulo p in general, and the identity with (qp) 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

Used by

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