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.
FALSE: every irreducible quintic over is insoluble by radicals
Statement
False claim: every irreducible quintic over is insoluble by radicals.
Facts & Assumptions
Given: The polynomial .
Eisenstein's criterion over (Eisenstein criterion over the integers).
Every nonconstant polynomial has a root in some extension field (Every nonconstant polynomial over a field has a root in some field extension).
A polynomial is solvable by radicals when its splitting field is contained in a radical extension of the base field (A polynomial is solvable by radicals when its splitting field lies in a radical extension).
Refutation
Eisenstein at the prime shows that is irreducible over , so it is an irreducible quintic.
By [L2], choose with , choose over with and choose with . Put Then , , and therefore Using , this implies Since , we get , so is a primitive fifth root of unity. Thus every root of has the form with , and all of them lie in
The field tower adjoins successively a square root of , a square root of , and a fifth root of . So is a radical extension. Step 1.2 shows that the splitting field of is contained in , and [L3] therefore makes solvable by radicals.
Hence is an irreducible quintic over that is solvable by radicals, so the universal claim is false.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
13 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
- J. S. Milne, Fields and Galois Theory, v5.10, Section 7 (standard reference, not scraped)
- J. Ash, Basic Abstract Algebra, Section 6.8 (standard reference, not scraped)