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 positive-degree separable polynomial is irreducible exactly when its Galois group is transitive on the roots
Statement
A positive-degree separable polynomial is irreducible if and only if its Galois group acts transitively on its roots.
Facts & Assumptions
Given: A positive-degree separable polynomial , its splitting field , and the faithful root action of A polynomial Galois group acts faithfully on its roots; the minimal-polynomial correspondence for a simple algebraic extension (The evaluation kernel and the unique monic irreducible minimal polynomial of an algebraic element).
An isomorphism between base fields taking one polynomial to another extends to an isomorphism between their splitting fields (A base-field isomorphism extends to an isomorphism between splitting fields of corresponding polynomials).
Proof
For the forward direction, suppose is irreducible and let be roots. The rule sending to gives an -isomorphism because both have minimal polynomial associated to ; by [L1] it extends to an -automorphism of . Thus some Galois element sends any chosen root to any other, so the action is transitive. This includes degree one.
For the reverse direction, suppose the action is transitive and let be a monic irreducible factor of containing one root . For every , the coefficients of are fixed, so . Transitivity puts every root of among the roots of ; since is separable, has the full degree of , so is a scalar multiple of and is irreducible. A root equal to zero causes no exception.
Depends on
Used by
Dependency tree · two levels
14 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, Proposition 4.5 (standard reference, not scraped)
- K. Conrad, Galois Groups of Cubics and Quartics, Theorem 1.1 (standard reference, not scraped)