Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedSession-authored (Fable 5 assisted)precheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 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 gcd(n,q)=1 the image of Gal(Fq(μn)/Fq) in (Z/n)× is generated by [q]

Statement

Let Fq be a finite field of order q (Finite fields and their order) and let n1 with gcd(n,q)=1 (Coprime integers: gcd(a,b)=1). Then the image of the embedding

Gal(Fq(μn)/Fq)(Z/n)×

of K(μn)/K is Galois and σaσ embeds its Galois group into (Z/n)× is the cyclic subgroup generated by [q]n, and

[Fq(μn):Fq]=ord([q]n),

the multiplicative order of [q]n in (Z/n)× (The order G of a finite group and the order ord(g) of an element, with ord(g)= when no positive power of g is the identity).

Facts & Assumptions

Given: A finite field Fq of order q, of characteristic p with q a power of p (Every finite field has order pn for a unique prime characteristic p and positive integer n), and an integer n1 with gcd(n,q)=1; the extension E:=Fq(μn) (The cyclotomic extension K(μn) as a splitting field of tn1).

[L1]

For a field K and n1 with charKn, the extension K(μn)/K is finite Galois and σ[aσ]n, determined by σ(ζ)=ζaσ on a primitive n-th root of unity, is an injective homomorphism into (Z/n)× with σ(x)=xaσ for every xμn (K(μn)/K is Galois and σaσ embeds its Galois group into (Z/n)×).

[L2]

An extension L/Fq of finite fields of degree m is Galois with Gal(L/Fq)=σq cyclic of order m, where σq(x)=xq (A finite extension of a finite field of order q is Galois with cyclic Galois group generated by xxq, The relative Frobenius xxq of an extension of finite fields).

[L3]
[L4]

For a finite Galois extension L/F one has Gal(L/F)=[L:F] (Equivalent characterizations of a finite Galois extension, The degree [K:F]=dimFK of a finite field extension).

Proof

technique · direct
1.1

The characteristic p divides q, and gcd(n,q)=1, so pn; hence [L1] applies to K=Fq and E=Fq(μn) is finite Galois over Fq. Also [q]n is a unit of Z/n by [L3].

L1L3given
2.1

E is a finite field: it is a finite extension of the finite field Fq by step 1.1, so it is a finite-dimensional Fq-vector space over a finite field and therefore has finitely many elements. By [L2], Gal(E/Fq)=σq with σq(x)=xq.

step 1.1L2
3.1

The exponent attached to σq by [L1] is [q]n, since σq(ζ)=ζq for a primitive n-th root of unity ζE. Because the embedding is a homomorphism and Gal(E/Fq) is generated by σq, the image is the subgroup of (Z/n)× generated by [q]n.

step 1.1step 2.1L1
4.1

The embedding is injective, so Gal(E/Fq) equals the order of [q]n, which is ord([q]n); and [E:Fq]=Gal(E/Fq) by [L4]. Hence [E:Fq]=ord([q]n).

step 3.1L1L4

Remarks

Depends on

Used by

Dependency tree · two levels

71 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