Subject 02 / 12

Irreducibility methods

methodStart hereQ

Reduction modulo primes

Factoring modulo primes gives restrictions on the degrees of rational factors. Incompatible restrictions prove irreducibility.

Article
methodIntermediateQ

Newton polygons and Galois groups

Coefficient valuations determine root valuations and restrict factor degrees. Suitable Newton slopes also imply containment of the alternating group.

Article

References

  1. Von denjenigen Moduln, welche Potenzen von Primzahlen sind. (Fortsetzung)Schönemann, Theodor · 1846

    Precedes Eisenstein’s treatment of the criterion now often called Schönemann–Eisenstein. Cox’s historical account explains the role of higher congruences and translates the statement into modern polynomial language.

  2. Über die Irreductibilität und einige andere Eigenschaften der Gleichung, von welcher die Theilung der ganzen Lemniscate abhängtEisenstein, Gotthold · 1850

    Develops Eisenstein’s criterion in connection with division of the lemniscate and Gaussian integers. For an integer polynomial, the familiar criterion requires a prime dividing every nonleading coefficient but not the leading coefficient, with its square not dividing the constant coefficient.

  3. Sulla riduttibilità della funzione x^n-A in un campo qualunque di razionalitàCapelli, Alfredo · 1901

    Classical reference for the binomial irreducibility criterion, including the exceptional fourth-power obstruction when the exponent is divisible by four. Distinguish this binomial criterion from the related Capelli composition lemma; the note itself points back to Capelli's 1897 and 1898 work.

  4. Sur quelques cas d'irréductibilité des polynômes à coefficients rationnelsDumas, Gustave · 1906

    Uses Newton polygons to restrict possible factor degrees. In the one-edge case, coprime horizontal and vertical increments give an irreducibility criterion; the polygon-product rule applies to more general factorization questions.

  5. Neue Kriterien für die Irreduzibilität algebraischer GleichungenPerron, Oskar · 1907

    Classical criteria based on coefficient dominance and the location of complex roots. A standard application is a monic integer polynomial with nonzero constant term and next-to-leading coefficient larger in absolute value than one plus the sum of the lower coefficient magnitudes.

Comments

Any comments are welcome. Comments appear after the site owner approves them. Privacy policy.