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

A finite purely inseparable extension in characteristic p has degree a power of p

Statement

If K/F is a finite purely inseparable extension of characteristic p>0, then [K:F]=pr for some r∈N. The trivial extension gives r=0.

Facts & Assumptions

Given: A finite purely inseparable extension K/F of characteristic p>0.

[L1]

The minimal polynomial of each element has the form xpe−a and hence has p-power degree (Pure inseparability and its conjugate, embedding, and separable-degree criteria).

[L2]

The degree of a simple algebraic extension is the degree of its minimal polynomial (A simple algebraic extension is its minimal-polynomial quotient and has power basis 1,a,…,an−1 and degree n).

[L4]

A finite extension has a finite basis over its base (The degree [K:F]=dim⁡FK of a finite field extension).

Proof

technique · direct
1.1L4choose

Choose a finite basis using [L4]; its elements generate K, so adjoining them successively gives a finite tower of simple extensions.

2.1step 1.1L1L2L3

At each nontrivial step, [L1] and [L2] make the degree a power of p. The tower law [L3] makes the product, and hence [K:F], a power of p.

3.1L3∎

If K=F, the empty tower has degree 1=p0, so the boundary case is included.

Depends on

Used by

Dependency tree · two levels

19 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