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.
has Galois group over
Example
The polynomial has Galois group over .
Facts & Assumptions
Given: The rational-root theorem (Rational root theorem), reduction modulo a prime (Irreducibility after reduction modulo a prime implies irreducibility over when the leading coefficient survives), Gauss's lemma for monic integer polynomials (Gauss lemma: primitive factorisations over can be cleared to primitive factorisations over ), and the quartic resolvent formula (The coefficient formula and discriminant of the quartic resolvent).
An irreducible separable quartic with irreducible resolvent and square discriminant has Galois group (The five-case resolvent classification of an irreducible quartic Galois group).
Verification
No integer divisor of is a root, so there is no rational linear factor. Modulo , one has ; the cubic has no root in and is irreducible. A monic factorization into two rational quadratics would reduce to a quadratic-by-quadratic factorization modulo , contradicting the displayed irreducible factorization. Gauss's lemma therefore makes the quartic irreducible over .
The resolvent is . Modulo it is , whose values at all elements of are nonzero; hence the cubic resolvent is irreducible over .
Its discriminant, and hence the quartic discriminant, is , which is nonzero.
Steps 1.1, 1.2, and 1.3 satisfy [L1], so the quartic has Galois group .
Depends on
- Rational root theorem
- Irreducibility after reduction modulo a prime implies irreducibility over $\mathbb Q$ when the leading coefficient survives
- Gauss lemma: primitive factorisations over $\mathbb Q$ can be cleared to primitive factorisations over $\mathbb Z$
- The coefficient formula and discriminant of the quartic resolvent
- The five-case resolvent classification of an irreducible quartic Galois group
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
28 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
- K. Conrad, Galois Groups of Cubics and Quartics, Example 3.3 (standard reference, not scraped)