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.

Square of the quadratic Gauss sum

Statement

For every odd prime p and every primitive p-th root of unity ζp, with τp=∑a mod p(a/p)ζp a, τp2=p∗=(−1)(p−1)/2p.

Facts & Assumptions

Given: An odd prime p, a fixed primitive p-th root of unity ζ=ζp in a fixed algebraic closure of Q, and the Gauss sum τ:=τp=∑a mod p(a/p)ζa.

[F1]

τ=∑s=1p−1(s/p)ζs∈Z[ζ], the term a=0 vanishing because (0/p)=0 (Quadratic Gauss sum in a prime cyclotomic field, The Legendre symbol, including its zero value).

[F2]

The Legendre symbol is multiplicative for all integer numerators: (uv/p)=(u/p)(v/p) for all u,v∈Z (The Legendre symbol is multiplicative for all integer numerators).

[F3]

Restricted to (Z/p)× the Legendre symbol is a surjective homomorphism onto {±1} with kernel the nonzero square classes (On the units, the Legendre symbol is the unique nontrivial homomorphism to {±1}); hence ∑u=1p−1(u/p)=0, because choosing v with (v/p)=−1 and substituting u↦vu permutes the nonzero classes and multiplies the sum by −1, forcing it to be 0.

[F4]

First supplement: (−1/p)=(−1)(p−1)/2 (First supplement: (−1/p)=(−1)(p−1)/2).

[F5]

For an element x with xp=1 and x≠1 one has ∑s=0p−1xs=xp−1x−1=0, so ∑s=1p−1xs=−1; and ζ has order p, so ζ1+u≠1 exactly when u≢−1(modp) (The group μn(K) of n-th roots of unity in a field, and primitive n-th roots of unity).

Proof

technique · direct
1.1F1

Squaring the sum of [F1] and multiplying out the finite product of sums gives τ2=∑s=1p−1∑t=1p−1(s/p)(t/p)ζs+t.

1.2F5

For every integer u≢0(modp) the inner geometric sum over s is ∑s=1p−1ζs(1+u)=−1 when u≢−1(modp), while for u≡−1(modp) it equals ∑s=1p−11=p−1.

2.1F2step 1.1

Multiplication by u permutes the nonzero classes modulo p, so substituting t≡su(modp) in the double sum of step 1.1 rewrites it as τ2=∑u=1p−1∑s=1p−1(s/p)(su/p)ζs(1+u)=∑u=1p−1(u/p)∑s=1p−1ζs(1+u), using multiplicativity of the Legendre symbol in the last equality.

3.1F3step 1.2step 2.1

Substituting the two evaluations of step 1.2, the contribution of u≡−1(modp) is (−1/p)(p−1) and every other u contributes −(u/p); hence τ2=(−1/p)(p−1)−(∑u=1p−1(u/p)−(−1/p))=p (−1/p)−∑u=1p−1(u/p)=p (−1/p), since the character sum vanishes by [F3].

4.1F4step 3.1∎

By the first supplement [F4], (−1/p)=(−1)(p−1)/2, so τ2=(−1)(p−1)/2p=p∗.

Remarks

  • Only finite sums and the first supplement are used. Neither quadratic reciprocity nor any analytic determination of the sign of τp enters; the square p∗ is insensitive to replacing ζp by another primitive p-th root, since that multiplies τp by ±1.
  • Nonvanishing. Since p∗=±p≠0 in the domain Z[ζp], the identity shows that τp≠0, which is what makes the fixed field computation in Quadratic subfield generated by the Gauss sum possible.

Depends on

Used by

Dependency tree · two levels

24 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