Alphabeta Math
ExampleConstruction: Literature-sourcedVerification: 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.

The splitting field of x2−2 over Q is Q(2), with roots ±2

Example

The splitting field of x2−2 over Q is Q(2), and its roots are 2 and −2. Moreover, 1,2 is a Q-basis.

Facts & Assumptions

Given: The polynomial x2−2∈Q[x] and the positive real square root 2.

[F1]

The rationals form a field (The rationals form a field).

[F2]

The nonnegative real number 2 has a unique nonnegative square root 2 with (2)2=2 (Square roots exist: a unique a≥0 with (a)2=a; the positives are {x2:x≠0}).

[F3]

Eisenstein's criterion proves a primitive integer polynomial irreducible when a prime divides every nonleading coefficient, its square does not divide the constant coefficient, and it does not divide the leading coefficient (Eisenstein criterion over the integers).

[F4]

A simple extension by an algebraic element whose minimal polynomial has degree n has power basis through degree n−1 (A simple algebraic extension is its minimal-polynomial quotient and has power basis 1,a,…,an−1 and degree n).

[F5]

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

[F6]

The minimal polynomial of an algebraic element is the unique monic irreducible polynomial that vanishes at it (The evaluation kernel and the unique monic irreducible minimal polynomial of an algebraic element).

Verification

technique · direct
1.1

By [F2], x2−2=(x−2)(x+2) over R. Its two roots are ±2, and both lie in Q(2).

F1F2algebra
1.2

Eisenstein's criterion [F3] with the prime 2 makes x2−2 irreducible over Q. It is monic and vanishes at 2, so [F6] identifies it as the minimal polynomial; [F4] then gives the basis 1,2.

F2F3F4F6
2.1

The field generated by both roots is Q(2,−2)=Q(2), so [F5] identifies it as the splitting field.

F5step 1.1∎

Depends on

Used by

Dependency tree · two levels

30 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