Alphabeta Math
ExampleConstruction: AI-adaptedVerification: 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.

Gal(F8/F2) is cyclic of order three with no proper intermediate field

Example

Let K:=F2[t]/(t3+t+1) and let α be the class of t. Then K is a field of order 8, the squaring map σ(x)=x2 generates

Gal(K/F2)={id,σ,σ2},

cyclic of order three, its two orbits on KF2 are

{α, α2, α2+α}and{α+1, α2+1, α2+α+1},

and K/F2 has no intermediate field other than F2 and K.

Facts & Assumptions

Given: The polynomial π:=t3+t+1F2[t], the ring K=F2[t]/(π) and the class α of t, so that α3=α+1 because α3+α+1=0 and 1=1 in characteristic two.

[L1]

A polynomial of degree 2 or 3 over a field is irreducible if and only if it has no root in that field (A polynomial of degree two or three over a field is irreducible exactly when it has no root in the field).

[L2]

For a field F and nonconstant pF[x], p is irreducible if and only if F[x]/(p) is a field (For a nonconstant p in F[x], the ideal (p) is maximal and F[x]/(p) is a field exactly when p is irreducible).

[L3]

If a is algebraic over F with minimal polynomial ma of degree n, then F(a) has power basis 1,a,,an1 and [F(a):F]=n (A simple algebraic extension is its minimal-polynomial quotient and has power basis 1,a,,an1 and degree n, The degree [K:F]=dimFK of a finite field extension); a monic irreducible vanishing at a is that minimal polynomial (The evaluation kernel and the unique monic irreducible minimal polynomial of an algebraic element).

[L4]

An extension E/Fq of finite fields of degree n is Galois with Gal(E/Fq)=σq cyclic of order n, where σq(x)=xq, and E=qn (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, For a degree-n extension of a field of order q, the q-power map has order exactly n, Finite fields and their order).

[L5]

The intermediate fields of Fqn/Fq are the Fqd for the positive divisors d of n, one for each divisor (The intermediate fields of Fqn/Fq are the Fqd, one for each positive divisor d of n, Divisibility in Z: da when a=dq for some integer q).

Verification

technique · direct
1.1

π has no root in F2: π(0)=1 and π(1)=1+1+1=1. By [L1] it is irreducible, so K is a field by [L2].

L1L2given
2.1

π is monic irreducible with π(α)=0, so it is the minimal polynomial of α over F2 and [K:F2]=3 with power basis 1,α,α2 by [L3]; hence K=23=8 by [L4].

step 1.1L3L4
3.1

By [L4] the extension K/F2 is Galois with Galois group generated by σ(x)=x2 and of order three.

step 2.1L4
4.1

The orbit of α: α2 is α2; α4=αα3=α(α+1)=α2+α; and (α2+α)2=α4+α2=(α2+α)+α2=α, using that squaring is additive in characteristic two. So {α,α2,α2+α} is one orbit of size three.

step 2.1step 3.1given
5.1

The orbit of α+1: (α+1)2=α2+1, (α2+1)2=α4+1=α2+α+1, and (α2+α+1)2=α4+α2+1=α+1. So {α+1,α2+1,α2+α+1} is the other orbit of size three, and together with {0} and {1} these account for all eight elements.

step 2.1step 3.1step 4.1given
6.1

The positive divisors of three are 1 and 3, so by [L5] the intermediate fields are exactly two: F2 and K itself. There is no field strictly between them.

step 2.1step 3.1L5

Remarks

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

48 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