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.
An algebraically constructible real algebraic number has degree over equal to a power of two
Statement
If a real algebraic number is algebraically constructible, then
for some .
Facts & Assumptions
Given: A real algebraic, algebraically constructible number .
The element lies in a finite tower of quadratic extensions beginning at (A real number is algebraically constructible exactly when it lies in a finite tower of real quadratic adjunctions).
Degrees multiply in finite towers (Tower law for finite extensions: ).
The degree of an intermediate field divides the total finite degree (The degree of an intermediate field divides the degree of a finite extension).
Prime factorization is unique, so a positive divisor of a power of is itself a power of (For and any injective list of primes containing every prime divisor of , one has ; the exponents are determined by , and for every prime outside the list).
Proof
Choose from [L1] a tower with and every step degree .
Repeated application of [L2] gives .
The simple field is intermediate between and , so [L3] says its degree divides .
By [L4], that positive divisor is for some .
Depends on
- A real number is algebraically constructible exactly when it lies in a finite tower of real quadratic adjunctions
- Tower law for finite extensions: $[L:F]=[L:K][K:F]$
- The degree of an intermediate field divides the degree of a finite extension
- For $n \ge 1$ and any injective list $p : r \to \mathbb{Z}$ of primes containing every prime divisor of $n$, one has $n = \prod_{i<r} p_i^{\,v_{p_i}(n)}$; the exponents are determined by $n$, and $v_q(n) = 0$ for every prime $q$ outside the list
Used by
Dependency tree · next 3 levels
Direct dependencies and their dependencies through the next three levels: 115 results over 25 levels. An arrow runs from a result to what uses it, and this result sits at the bottom with a heavier outline. Click the chart to enlarge it.
Sources
- A. W. Knapp, Basic Algebra, 2nd ed., Chapter IX, Section 5 (standard reference, not scraped)
- J. S. Milne, Fields and Galois Theory, consequence 1.41 (standard reference, not scraped)