Alphabeta Math
CounterexampleConstruction: Literature-sourcedVerification: 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.

The sign of a quadratic Gauss sum needs a chosen primitive root

Statement refuted

"For a fixed odd prime p the quadratic Gauss sum τp is independent of the choice of the primitive p-th root of unity used to define it, so that its sign is a function of p alone."

Facts & Assumptions

Given: The prime p=3, a primitive third root of unity ζ with ζ≠1, the second primitive third root ζ′:=ζ2, and the Gauss sums τ=∑a mod 3(a/3)ζa and τ′=∑a mod 3(a/3)(ζ′)a attached to them (Quadratic Gauss sum in a prime cyclotomic field).

[F1]

In the cyclic group μ3 of third roots of unity the elements ζ and ζ2 are the two primitive third roots of unity, and Q(ζ′)=Q(ζ) (The n-th roots of a complex number and the n distinct roots of unity for every n≥1, The cyclotomic extension K(μn) as a splitting field of tn−1).

[F2]

Gal⁡(Q(ζ)/Q)≅(Z/3)× acts by σb(ζ)=ζb for b=1,2, so σ2 is an automorphism of Q(ζ) and σ2(ζ)=ζ2=ζ′ ([Q(ζn):Q]=φ(n) and Gal⁡(Q(μn)/Q)≅(Z/n)×).

[F3]

For every integer b not divisible by 3, the automorphism σb of Q(ζ) satisfies σb(τ)=(b/3)τ (Galois action on the quadratic Gauss sum); and (2/3)=−1 while (1/3)=1 (The Legendre symbol, including its zero value).

[F4]

For every odd prime p, τp2=p∗=(−1)(p−1)/2p; at p=3 this is τ2=−3, and the corresponding statement holds for τ′ because ζ′ is again a primitive third root of unity (Square of the quadratic Gauss sum).

[F5]

For an odd prime p, Q(τp)=Q(p∗) is the unique intermediate field of Q(ζp)/Q of degree 2 (Quadratic subfield generated by the Gauss sum); at p=3 this is Q(τ)=Q(τ′)=Q(−3)=Q(ζ).

[F6]

For the standard complex root ζ3=e2πi/3 one has τ3=ζ3−ζ32=i3 (Quadratic Gauss sum at p=3).

Counterexample

technique · direct
1.1F1F2

Replacing the primitive root ζ by ζ′=ζ2 rewrites the attached Gauss sum as τ′=∑a mod 3(a/3)(ζ2)a=∑a mod 3(a/3)σ2(ζ)a=σ2(τ), where σ2∈Gal⁡(Q(ζ)/Q); the two sums are formed from two different primitive third roots of unity of the same field.

1.2F3

(2/3)=−1: the nonzero square class modulo 3 is 1, and 2≡−1 is a nonresidue modulo 3.

1.3F4

By [F4], τ2=(τ′)2=−3≠0, so τ≠0 and τ′≠0; in particular τ′=−τ will mean τ′≠τ.

2.1F3step 1.1step 1.2

Applying [F3] with b=2 gives τ′=σ2(τ)=(2/3)τ=−τ, so the Gauss sum changes sign when the primitive root is replaced by its square.

3.1F5F6step 1.3step 2.1∎

Steps 1.3 and 2.1 show τ′≠τ, yet τ′2=τ2=−3 and Q(τ′)=Q(τ)=Q(−3); thus the square of the Gauss sum and the field it generates are unchanged, while the sign of the sum depends on the chosen primitive root. In the standard complex embedding, ζ=e2πi/3 gives τ=i3 by [F6], while the same computation with ζ′=ζ2 gives τ′=−i3; the value differs and no root-independent sign is well defined.

Remarks

  • What remains canonical. Only the square τp2=p∗ and the field Q(τp)=Q(p∗) are independent of the chosen primitive root; the element itself is determined only up to the sign (b/p) of the automorphism relating two chosen roots.
  • No contradiction with the analytic sign theorem. Statements that fix a standard complex root ζp=e2πi/p (or an embedding together with a root) do determine the sign, e.g. τ3=i3 here; the counterexample only refutes root-independence.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

43 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