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: a polynomial solvable by radicals must have abelian Galois group
Statement
False claim: a polynomial solvable by radicals must have abelian Galois group.
Facts & Assumptions
Given: The polynomial and its splitting field .
The polynomial is solvable by radicals ( over is solvable by radicals although it is a quintic).
Eisenstein's criterion proves that a primitive integer polynomial satisfying its prime-divisibility conditions is irreducible over (Eisenstein criterion over the integers).
The rational cyclotomic field is Galois of degree , with automorphisms for ( and ).
If one of two finite extensions is Galois, the degree of their compositum is the product of their degrees divided by the degree of their intersection (For finite Galois and finite inside a common field, ).
Degrees multiply in finite towers (Tower law for finite extensions: ).
Embeddings of a simple algebraic extension correspond to roots of the generator's minimal polynomial (-embeddings of into an algebraically closed field correspond to the distinct roots of ).
Refutation
Let , , and . By [L2] with the prime , is irreducible and . By [L3], is Galois of degree . The degree of divides both and by [L5], so . Hence [L4] gives , , and .
The minimal polynomial of over is therefore . Since is another root in , [L6] gives an -automorphism of with and ; it has order . Similarly, shows that the minimal polynomial of over is the degree-four cyclotomic polynomial. Its root therefore gives by [L6] an -automorphism with and ; it has order .
These automorphisms do not commute: So the Galois group of is nonabelian, even though [L1] makes the polynomial solvable by radicals. This disproves the claim.
Depends on
- $x^5-2$ over $\mathbb Q$ is solvable by radicals although it is a quintic
- Eisenstein criterion over the integers
- $[\mathbb Q(\zeta_n):\mathbb Q]=\varphi(n)$ and $\operatorname{Gal}(\mathbb Q(\mu_n)/\mathbb Q)\cong(\mathbb Z/n)^\times$
- For $E/F$ finite Galois and $L/F$ finite inside a common field, $[EL:F]=[E:F][L:F]/[E\cap L:F]$
- Tower law for finite extensions: $[L:F]=[L:K][K:F]$
- $F$-embeddings of $F(\alpha)$ into an algebraically closed field correspond to the distinct roots of $m_{\alpha}$
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
33 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)