Alphabeta Math
CorollaryStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 2026-08-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.

The algebraic numbers in C form an algebraic closure of Q

Statement

Let A:={z∈C:z is algebraic over Q}. Then A is an algebraic closure of Q.

Facts & Assumptions

Given: The subset A⊆C of elements algebraic over Q.

[L1]

The algebraic elements in an extension form a subfield (The elements of an extension algebraic over the base field form a subfield).

[L2]

The field C is algebraically closed (The complex numbers are algebraically closed).

[L3]

A field generated by finitely many algebraic elements over the base field is finite over that base (An extension generated by finitely many algebraic elements is finite).

[L4]

An element is algebraic over a field if and only if its simple extension over that field is finite (An element is algebraic over F if and only if its simple extension F(a)/F is finite).

[L6]

Every element of a finite extension is algebraic over the base field (Every finite field extension is algebraic).

[L7]

An algebraic closure of a field is an algebraic extension whose top field is algebraically closed (An algebraic closure of a field).

Proof

technique · direct
1.1L1

By [L1], the set A is a subfield of C containing Q.

1.2L2

Let f(x)=anxn+⋯+a0∈A[x] be nonconstant. Since C is algebraically closed by [L2], the polynomial f has a root z∈C.

2.1L3L4L5L6step 1.2

The coefficients a0,…,an are algebraic over Q, so F:=Q(a0,…,an) is a finite extension of Q by [L3]. The element z is a root of a nonzero polynomial over F, so it is algebraic over F; therefore [L4] makes F(z)/F finite. By [L5], the extension F(z)/Q is finite, and then [L6] makes z algebraic over Q. Hence z∈A.

3.1L7step 2.1∎

Step 2.1 shows that every nonconstant polynomial in A[x] has a root in A, so A is algebraically closed. Since every element of A is algebraic over Q by definition, [L7] makes A an algebraic closure of Q.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

27 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