Alphabeta Math
TheoremStatement: Literature-sourcedProof: Literature-sourcedSession-authored (Fable 5 assisted)precheck passaudited 2026-08-11
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.

Irreducibility after reduction modulo a prime implies irreducibility over Q\mathbb Q when the leading coefficient survives

Statement

Let fZ[x]f\in\mathbb Z[x] be primitive and of positive degree, and let pp be prime. Suppose pp does not divide the leading coefficient of ff. If the coefficientwise reduction fˉ(Z/p)[x]\bar f\in(\mathbb Z/p)[x] is irreducible, then ff is irreducible in Q[x]\mathbb Q[x].

Facts & Assumptions

Given: A primitive positive-degree polynomial fZ[x]f\in\mathbb Z[x] and a prime pp not dividing its leading coefficient.

[L1]

A rational factorization of a primitive integer polynomial clears to a factorization into primitive integer polynomials of the same positive degrees (Gauss lemma: primitive factorisations over Q\mathbb Q can be cleared to primitive factorisations over Z\mathbb Z).

[L2]
[L3]

The quotient map ZZ/pZ\mathbb Z\to\mathbb Z/p\mathbb Z has kernel pZp\mathbb Z (The canonical projection RR/IR\to R/I is a surjective ring homomorphism with kernel II).

[L5]

A prime is an integer greater than 11 with no positive divisors other than 11 and itself (Prime and composite integers: pp is prime when p>1p > 1 and its only positive divisors are 11 and pp).

[L6]

For prime pp, the ring Z/p\mathbb Z/p is a field (For every prime pp, the two operations on Z/p\mathbb{Z}/p make it a field).

Proof

technique · contradiction
1.1

Suppose for contradiction that ff is reducible over Q\mathbb Q; [L1] gives f=GHf=GH with primitive G,HZ[x]G,H\in\mathbb Z[x] of positive degree.

assume-contragivenL1
2.1

Reduce coefficients using [L2], [L3], and [L4]. Neither Gˉ\bar G nor Hˉ\bar H is zero, since primitivity forbids pp from dividing every coefficient; and because the leading coefficient of ff survives, degfˉ=degf=degG+degH\deg\bar f=\deg f=\deg G+\deg H, so both reductions retain positive degree.

step 1.1L1L2L3L4L5algebra
3.1

Thus fˉ=GˉHˉ\bar f=\bar G\bar H is a factorization into two nonunits in the polynomial ring over the field of [L6], contradicting the assumed irreducibility of fˉ\bar f; therefore ff is irreducible over Q\mathbb Q.

step 2.1L6discharge-contradiction

Depends on

Used by

Dependency tree · next 3 levels

Direct dependencies and their dependencies through the next three levels: 108 results over 23 levels. An arrow runs from a result to what uses it, and this result sits at the bottom with a heavier outline. Click the chart to enlarge it.

Sources