Alphabeta Math
ExampleConstruction: Literature-sourcedVerification: AI-adaptedPipeline-generatedaudited 2026-09-27
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.

Finite separable extensions have zero Omega

Example

For every finite separable field extension L/k one has ΩL/k=0. The proof differentiates the minimal polynomial of a primitive element, so the separability hypothesis is used both to obtain a primitive element and to ensure that its minimal-polynomial derivative is nonzero and hence invertible; the converse direction, that a finitely generated field extension with Ω=0 is finite and separable, is a strictly harder result and appears on the category page (Finite-type field extensions with zero Ω).

Facts & Assumptions

Given: A finite separable field extension L/k and a primitive element α∈L with L=k(α).

[F1]

Existence and generators of Kähler differentials: a Kähler differential module (ΩL/k,d) exists for the ring map k→L, the map d is a k-derivation of L, and ΩL/k is generated as an L-module by the elements df for f∈L.

[F2]

A finite extension generated by elements all but possibly one of which are separable is simple: every finite separable extension is simple, so L=k(α) for some α∈L.

[F3]

The evaluation kernel and the unique monic irreducible minimal polynomial of an algebraic element: the minimal polynomial m∈k[x] of the algebraic element α is the unique monic irreducible generator of the kernel of evaluation k[x]→L, f↦f(α); hence f(α)=0 if and only if m∣f.

[F4]

An irreducible polynomial over a field is separable exactly when its derivative is nonzero: an irreducible polynomial p over a field is separable if and only if its formal derivative p′ is not zero.

[F5]

Separable algebraic elements and separable extensions: an extension is separable when every element is separable, and an element is separable when it is algebraic with separable minimal polynomial.

[F6]

A simple algebraic extension is its minimal-polynomial quotient and has power basis 1,a,…,an−1 and degree n: every element of the simple algebraic extension k(α) is a polynomial p(α) in α with coefficients in k; evaluation k[x]→k(α), p↦p(α), is an isomorphism k[x]/(m)≅k(α).

Verification

1.1F2F5given

By [F2] there is α∈L with L=k(α); since L/k is separable, [F5] makes α separable over k, so its minimal polynomial m∈k[x] is monic, irreducible and separable.

2.1F3F4step 1.1

By [F4] the separability of the irreducible polynomial m says m′≠0, where m′ is the formal derivative; since deg⁡m′<deg⁡m=n, the minimality statement of [F3] shows m′(α)≠0: a vanishing of m′ at α would force m∣m′ and hence m′=0.

3.1F1step 1.1step 2.1

Because d is a k-derivation [F1] and m(α)=0, applying d to the relation m(α)=c0+c1α+⋯+cnαn with cn=1 and using additivity, k-linearity and the Leibniz rule gives 0=d(m(α))=∑ici d(αi)=m′(α) dα, with m′(α)∈L the value at α of the formal derivative. Since m′(α)≠0 by step 2.1 and L is a field, m′(α) is invertible in L, so dα=0.

4.1F1F6step 3.1

It follows that d vanishes on all of L: by [F6] every f∈L equals p(α) for a polynomial p∈k[x], and the Leibniz rule over the expansion of p(α) in powers of α gives dp(α)=p′(α) dα=0, since dα=0 [F1, step 3.1].

5.1F1step 4.1∎

By [F1] the module ΩL/k is generated over L by the elements df with f∈L, and step 4.1 shows that each such generator is zero; hence ΩL/k=0.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

24 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