Alphabeta Math
TheoremStatement: 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.

The separable degree is independent of the chosen algebraic closure

Statement

For a finite extension K/F, the number of F-embeddings of K into an algebraic closure of F is independent of the chosen algebraic closure.

Facts & Assumptions

Given: A finite extension K/F and algebraic closures Ω1/F and Ω2/F.

[L1]

Separable degree is the finite cardinality of the set of base-field embeddings into a chosen algebraic closure (The separable degree [K:F]s as a count of embeddings into an algebraic closure).

[L2]

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

[L3]

Every algebraic element has a unique monic irreducible minimal polynomial over the base (The evaluation kernel and the unique monic irreducible minimal polynomial of an algebraic element).

[L4]

A splitting field of a polynomial is generated over the base by all of its roots (Polynomials that split and splitting fields of a polynomial or a family of polynomials).

[L5]

Any two splitting fields of the same nonzero polynomial are isomorphic over the base (Any two splitting fields of a polynomial are isomorphic over the base field).

Proof

technique · direct
1.1L2L3L4choose

Choose a finite F-basis α1,…,αr of K by [L2], and let f be the product of their minimal polynomials over F from [L3]. For j=1,2, let Ej⊆Ωj be generated over F by all roots of f in Ωj. Since Ωj is algebraically closed, f splits there, and [L4] makes Ej/F a splitting field of f.

1.2L5construct

By [L5], choose an F-isomorphism θ:E1→E2. Postcomposition with θ gives a bijection Hom⁡F(K,E1)→Hom⁡F(K,E2), with inverse given by postcomposition with θ−1.

2.1step 1.1L3algebra

Every F-embedding σ:K→Ωj sends each αi to a root of its minimal polynomial, so σ(K)=F(σ(α1),…,σ(αr))⊆Ej. Hence Hom⁡F(K,Ωj)=Hom⁡F(K,Ej).

3.1step 2.1step 1.2L1∎

Steps 2.1 and 1.2 give a bijection between the embedding sets into Ω1 and Ω2. Their finite cardinalities are equal, so the value in [L1] is independent of the closure.

Depends on

Used by

Cited to discharge well-definedness by The separable degree [K:F]ₛ as a count of embeddings into an algebraic closure.

Dependency tree · two levels

18 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