Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-08-16
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.

Every finite field has order pn for a unique prime characteristic p and positive integer n

Statement

If F is a finite field, then there is a unique prime p and a unique positive integer n such that

∣F∣=pn.

Here p=char⁡F and n=[F:Fp].

Facts & Assumptions

Given: A finite field F.

[L1]

The order of a finite field is the cardinality of its underlying finite set (Finite fields and their order).

[L2]

The prime subfield in positive characteristic p is isomorphic to Fp (A field's prime subfield is isomorphic to Q in characteristic zero and to Fp in characteristic p).

[L3]

Extension degree is the size of a finite basis (The degree [K:F]=dim⁡FK of a finite field extension).

[L4]

Assuming the Axiom of Choice, if S⊆V spans V then there is a basis B of V with B⊆S (Every spanning subset of a vector space contains a basis).

Proof

technique · direct
1.1givenL2

The characteristic cannot be zero, because the distinct integer multiples of 1F would give infinitely many elements. Hence it is a unique prime p, and [L2] identifies the prime subfield with Fp.

1.2givenL3L4

The finite set F spans itself over Fp, so [L4] supplies a finite basis. Its size n is positive because F is not the zero vector space.

2.1step 1.2L1L5L6

By [L5], taking coordinates is a bijection from F to the functions from an n-element basis index set to Fp. Thus [L6] gives ∣F∣=pn.

3.1step 1.1step 1.2L3L7algebra∎

Steps 1.1 and 1.2 exhibit the pair (p,n) with p=char⁡F and n=[F:Fp]. For uniqueness, suppose also ∣F∣=ℓm with ℓ prime and m≥1. Then p divides ℓm, so [L7] gives p∣ℓ, and primality of ℓ forces p=ℓ. Now pn=pm with p≥2 forces n=m, since n<m would give 1=pm−n≥p≥2 and symmetrically for m<n.

Depends on

Used by

Dependency tree · two levels

60 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