Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-08-13
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 base-field isomorphism extends to an isomorphism between splitting fields of corresponding polynomials

Statement

Let σ:F→F′ be a field isomorphism, let 0≠f∈F[x], and put f′=σ∗f. If E/F is a splitting field of f and E′/F′ is a splitting field of f′, then σ extends to a field isomorphism E→E′.

Facts & Assumptions

Given: The fields, polynomial, splitting fields, and base isomorphism in the Statement.

[F1]

Strong induction permits proving the assertion from all smaller polynomial degrees (Strong (complete) induction).

[F2]

A minimal polynomial is monic irreducible and divides every polynomial vanishing at its element (The evaluation kernel and the unique monic irreducible minimal polynomial of an algebraic element).

[F3]

A base isomorphism extends uniquely across adjunctions of chosen corresponding roots of a transported irreducible polynomial (A base-field isomorphism extends across simple adjunctions of corresponding roots of an irreducible polynomial).

[F4]

Coefficient transport carries roots and factorizations to the corresponding roots and factorizations (A field isomorphism transports polynomials coefficientwise and carries roots, factorizations, and splitting to roots, factorizations, and splitting).

[F5]

For every field K, the polynomial ring K[x] is a unique factorisation domain (For every field F, F[x] is a unique factorisation domain).

[F6]

A root supplies a linear factor, and a splitting field is generated by all roots (Factor theorem over a commutative ring, Polynomials that split and splitting fields of a polynomial or a family of polynomials).

Proof

technique · strong induction on $n=\deg f$
1.1

Let P(n) assert the theorem for every such datum of degree n. If n=0, both root sets are empty, so E=F and E′=F′; the required extension is σ.

F6base
1.2

Let n≥1 and assume P(m) for all m<n. Choose a root α∈E of f, and let p be its minimal polynomial over F. By [F2], p∣f. Thus p′=σ∗p divides f′ in E′[x]. Since f′ is a product of linear factors there, unique factorisation in E′[x] from [F5] makes p′ split over E′; choose a root β∈E′ of p′.

F2F4F5F6ih
2.1

By [F3], σ extends to an isomorphism σ1:F(α)→F′(β). Factor f=(x−α)g in F(α)[x]. Applying coefficient transport by σ1 gives f′=(x−β)g′ with g′=(σ1)∗g, and deg⁡g=n−1.

F3F4F6step 1.2
3.1

The field E is a splitting field of g over F(α): it splits g, and it is generated by α together with the other roots of f, which are the roots of g. Similarly, E′ is a splitting field of g′ over F′(β). The induction hypothesis extends σ1 to an isomorphism E→E′.

F4F6step 1.2step 2.1ih
4.1

The base case and inductive step establish P(n) for all n by [F1].

F1step 1.1step 1.2step 3.1discharge-induction∎

Depends on

Used by

Dependency tree · two levels

25 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