Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-adaptedprecheck passaudited 2026-08-16
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 real number is algebraically constructible exactly when it lies in a finite tower of real quadratic adjunctions

Statement

A real number x is algebraically constructible if and only if there is a tower

Q=K0⊆K1⊆⋯⊆Kr⊆R

with x∈Kr and, for every i, an element ai∈Ki−1 with ai>0 such that

Ki=Ki−1(ai)and[Ki:Ki−1]=2.

The tower may have length zero.

Facts & Assumptions

Given: The algebraically constructible field C⊆R.

[L1]

The field C is the smallest real subfield containing Q and closed under positive square roots (Algebraically constructible real numbers as the smallest real subfield closed under positive square roots).

[L2]

An element algebraic over a field generates a finite simple extension, with degree equal to its minimal-polynomial degree (An element is algebraic over F if and only if its simple extension F(a)/F is finite).

[L4]

The minimal polynomial of an algebraic element divides every polynomial over the base field vanishing at it (The evaluation kernel and the unique monic irreducible minimal polynomial of an algebraic element).

Proof

technique · direct
1.1givenL3

Let T be the union of all terminal fields of finite towers obtained from Q by adjoining positive square roots, omitting any adjunction whose square root is already present. The empty tower puts Q in T.

1.2L1

Conversely, induction along any such tower shows Ki⊆C: the base Q lies in C, and square-root closure puts each generator and hence its generated field in C. Thus T⊆C.

2.1step 1.1L2L4

If x,y∈T, append the generators of their two towers to one another. Any redundant adjunction is omitted; every remaining step has degree 2, because its generator a is a root of t2−a over the base, so by [L4] its minimal polynomial divides t2−a and has degree at most 2, while degree 1 would put a in the base, which the omission of redundant adjunctions excludes; [L2] then gives [Ki−1(a):Ki−1]=2. Thus x−y, xy, and x−1 for x≠0 lie in a common terminal field, so T is a subfield.

3.1step 1.1step 2.1L1L3

If 0<a∈T, append a to a tower containing a, or do nothing if it is already present. Hence T is closed under positive square roots. By minimality in [L1], C⊆T.

4.1step 3.1step 1.2∎

Therefore T=C. Membership in T is exactly the existence of a displayed finite quadratic tower, including the zero-length case.

Depends on

Used by

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