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.
over is not solvable by radicals
Example
The irreducible quintic
is not solvable by radicals.
Facts & Assumptions
Given: The polynomial .
Eisenstein's criterion over (Eisenstein criterion over the integers).
Every positive real has a unique positive fourth root (Existence and uniqueness of -th roots: a unique with ).
Every field of characteristic zero is perfect, and over a perfect field every nonconstant irreducible polynomial is separable (Fields of characteristic zero, finite fields, and algebraically closed fields are perfect, Perfect fields: every irreducible polynomial is separable).
A continuous real function takes every intermediate value on a closed interval (Intermediate value theorem, by bisection with a canonical left-half rule: a continuous function on takes every value between and ).
The field is algebraically closed (The complex numbers are algebraically closed).
A positive-degree separable polynomial is irreducible exactly when its Galois group acts transitively on its roots (A positive-degree separable polynomial is irreducible exactly when its Galois group is transitive on the roots).
For prime , a transitive subgroup of containing a transposition is all of (For prime , a transitive subgroup of containing a transposition is all of ).
The group is not solvable ( and for are not solvable).
In characteristic , a polynomial solvable by radicals has solvable Galois group (In characteristic , a polynomial solvable by radicals has a solvable Galois group).
A splitting field is generated over the base field by all roots of the polynomial (Polynomials that split and splitting fields of a polynomial or a family of polynomials).
Verification
The prime divides the coefficients and , does not divide the leading coefficient , and does not divide the constant term . So [L1] makes irreducible over .
Let , which exists by [L2]. For real numbers one has If or , then each of the five degree-four monomials in parentheses is at least , and at least one is strictly larger than ; hence the parenthesis is , so . If , then each of those monomials is at most , and they cannot all equal when : equality in the and terms would force , while would then give and hence . So the parenthesis is , and therefore . Thus is increasing on , decreasing on , and increasing on .
Because and , one has . Also Together with and , the continuity from [L3] and the intermediate value theorem [L5] give a root in each of the three intervals Step 1.2 shows that is monotone on each of the three corresponding regions, so there is at most one root in each. Therefore has exactly three real roots.
By [L6], choose all five roots of in and let be the subfield they generate over . Fact [L11] makes a splitting field of over . Step 2.1 shows that exactly three of those roots are real, so the remaining two roots are nonreal. Complex conjugation on fixes and preserves the root set, hence it restricts to a -automorphism of that fixes the three real roots and swaps the two nonreal roots. Thus contains a transposition.
The field has characteristic , so [L4] makes it perfect. Step 1.1 shows that is irreducible over , and therefore is separable by the defining property of a perfect field in [L4]. Fact [L7] now makes transitive on the five roots. With step 3.1, fact [L8] gives
By [L9], the group is not solvable. If were solvable by radicals, [L10] would force to be solvable, contradicting step 4.1. Hence is not solvable by radicals.
Depends on
- The complex numbers are algebraically closed
- Sums, scalar multiples, products, absolute values, maxima, minima and quotients with nonvanishing denominator of continuous functions are continuous, as are constants, the identity and every polynomial function
- Intermediate value theorem, by bisection with a canonical left-half rule: a continuous function on $[a,b]$ takes every value between $f(a)$ and $f(b)$
- Eisenstein criterion over the integers
- For prime $p$, a transitive subgroup of $S_p$ containing a transposition is all of $S_p$
- In characteristic $0$, a polynomial solvable by radicals has a solvable Galois group
- $A_5$ and $S_n$ for $n\ge5$ are not solvable
- A positive-degree separable polynomial is irreducible exactly when its Galois group is transitive on the roots
- Existence and uniqueness of $n$-th roots: a unique $a^{1/n} \ge 0$ with $(a^{1/n})^n = a$
- Polynomials that split and splitting fields of a polynomial or a family of polynomials
- Fields of characteristic zero, finite fields, and algebraically closed fields are perfect
- Perfect fields: every irreducible polynomial is separable
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
95 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
- Keith Conrad, Applications of Galois Theory, Theorem 2.1 (standard reference, not scraped)
- J. S. Milne, Fields and Galois Theory, v5.10, Sections 5 and 7 (standard reference, not scraped)