Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-generatedSession-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 a degree-n extension of a field of order q, the q-power map has order exactly n

Statement

Let Fq be a finite field of order q and let E/Fq be an extension of finite fields of degree n (The degree [K:F]=dimFK of a finite field extension). Then

E=qn,

and the relative Frobenius σq (The relative Frobenius xxq of an extension of finite fields) has order exactly n in Aut(E/Fq) (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). At n=1 this says σq is the identity, of order one.

Facts & Assumptions

Given: Finite fields FqE with Fq=q and [E:Fq]=n; the prime subfield of E is Fp with p the characteristic, and Fq has the same characteristic, its identity element being that of E.

[L1]

The relative Frobenius is σq(x)=xq, an Fq-automorphism of E, with σqi(x)=xqi (The relative Frobenius xxq of an extension of finite fields).

[L2]

If F is a field with q elements, then every aF satisfies aq=a (A field with q elements is the splitting field of xqx over its prime subfield).

[L3]

Let D be an integral domain. A nonzero polynomial fD[x] of degree n has at most n distinct roots in D (A nonzero polynomial of degree n over an integral domain has at most n distinct roots).

[L4]

If F is a finite field, then there is a unique prime p and a unique positive integer m with F=pm; here p=charF and m=[F:Fp] (Every finite field has order pn for a unique prime characteristic p and positive integer n).

[L5]

For fields FKL with K/F and L/K finite, L/F is finite and [L:F]=[L:K][K:F] (Tower law for finite extensions: [L:F]=[L:K][K:F]).

Proof

technique · direct
1.1

By [L4] applied to Fq, q=pk with k=[Fq:Fp]; by [L4] applied to E, E=pm with m=[E:Fp].

L4given
2.1

The tower FpFqE and [L5] give m=[E:Fq][Fq:Fp]=nk, so E=pnk=(pk)n=qn.

step 1.1L5algebra
3.1

Every xE satisfies xqn=x, by [L2] applied to E, whose order is qn by step 2.1; by [L1] this says σqn=idE.

step 2.1L1L2
3.2

For an integer j with 1j<n one has σqjidE: otherwise every one of the qn elements of E would be a root of the nonzero polynomial tqjtE[t], whose degree qj is smaller than qn because q2, contradicting [L3].

step 2.1L1L3algebra
4.1

The least j1 with σqj=idE is therefore j=n, that is ord(σq)=n; for n=1 steps 3.1 and 3.2 say only that σq=idE, of order one.

step 3.1step 3.2L1

Depends on

Used by

Dependency tree · two levels

34 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