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 subfield generated by the Gauss sum

Statement

For an odd prime p, the unique intermediate field Q⊆F⊆Q(ζp) with [F:Q]=2 is Q(τp)=Q(p∗),p∗=(−1)(p−1)/2p, where τp is the quadratic Gauss sum attached to a chosen primitive p-th root of unity ζp. At p=3 the field Q(ζ3) itself has degree two over Q, so the intermediate field of degree two may equal the full cyclotomic field.

Facts & Assumptions

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

[F1]

τ=∑a=1p−1(a/p)ζa∈Z[ζ]⊆Q(ζ), the term a=0 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).

[F2]

τ2=p∗=(−1)(p−1)/2p (Square of the quadratic Gauss sum).

[F3]

For every integer b not divisible by p, the automorphism σb(ζ)=ζb satisfies σb(τ)=(b/p)τ; consequently the Gauss sum built from another primitive p-th root ζb equals (b/p)τ and generates the same field as τ (Galois action on the quadratic Gauss sum).

[F4]

Q(ζp) is a finite Galois extension of Q with group G:=Gal⁡(Q(ζp)/Q); the embedding G→(Z/p)× taking σ with σ(ζ)=ζb to b is an isomorphism, and [Q(ζp):Q]=p−1. The group (Z/p)× is cyclic of order p−1, so G is cyclic of order p−1 ([Q(ζn):Q]=φ(n) and Gal⁡(Q(μn)/Q)≅(Z/n)×, For every prime p, the multiplicative group (Z/pZ)× is cyclic, The cyclotomic extension K(μn) as a splitting field of tn−1).

[F5]

In a finite cyclic group of order n, every positive divisor d of n is the order of exactly one subgroup, and every subgroup is the unique subgroup of its own order; in particular the cyclic group G of [F4] has exactly one subgroup of order (p−1)/2 (A finite cyclic group has exactly one subgroup of each order dividing its own).

[F6]

Fundamental theorem of finite Galois theory: for a finite Galois extension K/F with group G, the maps H↦KH and E↦Gal⁡(K/E) are mutually inverse bijections between subgroups of G and intermediate fields, and [KH:F]=[G:H]; in particular intermediate fields of degree two over F correspond bijectively to subgroups of index two (The fundamental theorem of finite Galois theory).

[F7]

Lagrange's theorem: for a finite group G and a subgroup H≤G one has ∣G∣=[G:H] ∣H∣ (Lagrange's theorem: ∣G∣=[G:H]∣H∣ for every subgroup H of a finite group G).

[F8]

The Legendre symbol on (Z/p)× is a homomorphism onto {±1}, so (b/p)−1=(b/p) for every nonzero class b (On the units, the Legendre symbol is the unique nontrivial homomorphism to {±1}).

Proof

technique · direct
1.1F1F2

The sum τ is an element of Z[ζ], hence of Q(ζ), and it satisfies τ2=p∗=(−1)(p−1)/2p.

1.2F1F3F8

If ζ′=ζb is any primitive p-th root of unity, then the Gauss sum built from ζ′ is ∑a=1p−1(a/p)ζab=σb(τ)=(b/p)τ, a nonzero multiple of τ; hence it generates the same subfield Q(τ).

1.3F2

The rational number p∗=±p is not a square in Q: if x=a/b in lowest terms had x2=p∗, then a2=p∗b2; for p∗=p the exponent of p on the left side of a2=pb2 is 2vp(a), while on the right it is 1+2vp(b), which is odd, a contradiction, and for p∗=−p the left side a2/b2 is positive while −p is negative.

2.1step 1.1step 1.3

Since τ2=p∗≠0, we have τ≠0, and τ∉Q by step 1.3; as τ is a root of the degree-two polynomial X2−p∗∈Q[X], the degree [Q(τ):Q] divides 2 and is not 1, so it equals 2, and Q(τ)⊆Q(ζ) by step 1.1. Moreover τ is a square root of p∗, so τ=±p∗ and Q(τ)=Q(p∗).

3.1F4F5F6F7step 2.1

Let F⊆Q(ζp) be any intermediate field with [F:Q]=2 and put H:=Gal⁡(Q(ζp)/F). By [F6] the subgroup H has index [G:H]=[F:Q]=2 in G, so [F7] together with ∣G∣=p−1 from [F4] gives ∣H∣=(p−1)/2. As (p−1)/2 is a positive divisor of p−1, [F5] shows that the cyclic group G has exactly one subgroup of order (p−1)/2, so H is that same subgroup for every such F; the bijection [F6] then gives F=Q(ζp)H, the same field for every such F. Since step 2.1 exhibits Q(τ) as one of them, Q(τ) is the unique degree-two intermediate field.

4.1F4step 1.2step 2.1step 3.1∎

Combining steps 1.2 and 3.1 with the identification of step 2.1: the unique degree-two intermediate field is Q(τp)=Q(p∗), independently of the chosen primitive p-th root, and for p=3 one has [Q(ζ3):Q]=p−1=2 by [F4], so the unique degree-two intermediate field there is Q(ζ3) itself.

Remarks

  • Nonvanishing is the decisive input. Without τp2=p∗≠0 the element τp might generate only Q; the square computation of Square of the quadratic Gauss sum is what makes the generated field quadratic.
  • The sign of τp is not needed. Replacing ζp by ζp b multiplies τp by the Legendre sign (b/p), which leaves both the square and the generated field unchanged; this is the content of the sign counterexample on the companion examples page.

Depends on

Used by

Dependency tree · two levels

56 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