Alphabeta Math
CorollaryStatement: AI-generatedProof: AI-generatedSession-authored (Fable 5 assisted)precheck passaudited 2026-08-26
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.

For an odd prime p, Q(ζp) has exactly one intermediate field of degree two over Q

Statement

Let p be an odd prime (Prime and composite integers: p is prime when p>1 and its only positive divisors are 1 and p) and let ζ be a primitive p-th root of unity (The group μn(K) of n-th roots of unity in a field, and primitive n-th roots of unity) in Q(μp) (The cyclotomic extension K(μn) as a splitting field of tn1). Then there is exactly one intermediate field F with

QFQ(ζ),[F:Q]=2

(The degree [K:F]=dimFK of a finite field extension).

Intermediate, not proper. At p=3 the Galois group has order two, the unique subgroup of index two is the trivial one, and the field it names is Q(ζ3) itself. Reading the statement as "proper subfield" would make it false at the smallest case in scope.

Facts & Assumptions

Given: An odd prime p and a primitive p-th root of unity ζ in the cyclotomic extension Q(μp)=Q(ζ); write G:=Gal(Q(μp)/Q).

[L2]

Every finite subgroup of the unit group of an integral domain is cyclic (Every finite subgroup of the unit group of an integral domain is cyclic); Z/p is a field (For every prime p, the two operations on Z/p make it a field, Field), hence an integral domain, and (Z/p)× is its group of units (The unit group (Z/n)× and Euler's totient φ(n)=(Z/n)× for n1).

[L4]

In a cyclic group of finite order m there is exactly one subgroup of each order dividing m, and every subgroup has that form (A finite cyclic group has exactly one subgroup of each order dividing its own).

[L5]

For K/F finite Galois with G=Gal(K/F), the maps HKH and EGal(K/E) are mutually inverse bijections between subgroups and intermediate fields, and [KH:F]=[G:H] (The fundamental theorem of finite Galois theory).

[L6]

For a finite group G and HG, G=[G:H]H (Lagrange's theorem: G=[G:H]H for every subgroup H of a finite group G).

Proof

technique · direct
1.1

By [L1] the group G is isomorphic to (Z/p)×, which is cyclic by [L2] and has order p1 by [L3]; so G is cyclic of order p1.

L1L2L3
2.1

Since p is odd, p1 is even, so 2 divides p1 and (p1)/2 is a positive divisor of p1 (Divisibility in Z: da when a=dq for some integer q). By [L4] there is exactly one subgroup HG with H=(p1)/2.

step 1.1L4given
2.2

By [L5] and [L6], an intermediate field F of Q(μp)/Q has [F:Q]=[G:H]=G/H for its corresponding subgroup H, so [F:Q]=2 holds exactly when H=(p1)/2.

step 1.1L5L6
3.1

The correspondence of [L5] is a bijection, so the intermediate fields of degree two over Q are in bijection with the subgroups of order (p1)/2, of which there is exactly one by step 2.1. Hence there is exactly one such field.

step 2.1step 2.2L5

Remarks

  • Which field it is, is a different question. The argument counts intermediate fields; it produces no generator of the one it counts, and no claim is made here about identifying it. Naming that field concretely requires a computation this proof does not carry out.

  • Oddness is needed. At p=2 the field Q(μ2) is Q itself, of degree φ(2)=1, and it has no intermediate field of degree two at all; the step that fails is step 2.1, where p1=1 is odd.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

79 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