Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-generatedPipeline-generatedprecheck passjudge pass (gpt-6-luna)
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.

Exact gcd squarefree decomposition preserves roots and multiplicities

Statement

Let P∈Q[x] be nonzero of degree d, and put f=P/lc⁡(P), so f is monic. Set p0=f and, recursively, let pk be the monic greatest common divisor of pk−1 and pk−1′ for k≥1, with gcd⁡(1,0)=1. For 1≤k≤d, put sk=pk−1/pk and put sd+1=1. Then each qk=sk/sk+1 is a monic polynomial in Q[x], the qk are squarefree and pairwise coprime, and

f=∏k=1dqkk.

The complex roots of qk are exactly the roots of P having multiplicity k. In particular, ∏k=1dqk is squarefree and has exactly the distinct roots of P. For d=0, the product is empty and P has no roots.

Here a polynomial is called squarefree when each of its complex roots has multiplicity one.

Facts & Assumptions

Given: A nonzero rational polynomial P, its degree d, and the definitions in the Statement.

[F1]

The rationals form a field (The rationals form a totally ordered field).

[F2]

Division by a nonzero polynomial over a field has a unique quotient and remainder of smaller degree (Division algorithm for polynomials over a field).

[F3]

Formal differentiation is linear and satisfies the product rule; the derivative of a degree-n monomial is nxn−1 (Linearity, power rule, Leibniz rule and the degree bound for the formal derivative).

[F4]

Every nonconstant complex polynomial has a complex root (Fundamental theorem of algebra by Liouville's theorem).

[F5]

A polynomial vanishing at a is divisible by x−a (Factor theorem over a commutative ring).

[F6]

Degrees add under products of nonzero polynomials over a field (Over an integral domain, degrees add under multiplication of nonzero polynomials).

[F8]

The monic gcd is the unique monic common divisor divisible by every common divisor; Euclidean division terminates at its nonzero scalar associate and yields a polynomial Bezout identity. The monic greatest common divisor of two polynomials over a field, Bézout identity and the Euclidean algorithm for polynomials over a field

[F9]

For polynomials over a base field that are not both zero, their monic gcd is unchanged on extending the coefficient field. The monic gcd of two base-field polynomials is unchanged after extending the coefficient field

Proof

1.1givenF1F2F3F8construct

By [F8], the monic gcd is constructed by Euclidean division over Q, and the divisions terminate: each nonzero remainder has smaller nonnegative integer degree than the divisor by [F2]. The same argument defines pk; if deg⁡pk−1>0, then pk−1′≠0 and has smaller degree by [F3] and characteristic zero, so deg⁡pk<deg⁡pk−1. Thus pd=1, and each sk=pk−1/pk is a polynomial.

1.2givenF4F5F6F7induction

By [F4], repeated application of [F5] factors f over C: f(x)=∏α(x−α)mα, where the finite list contains each distinct root once and mα≥1. The induction is finite because each division by x−α lowers degree by one by [F6].

2.1step 1.1step 1.2F1F2F3F7F8F9

Fix a current polynomial p in the gcd chain and a root α of multiplicity m>0, so p=(x−α)mu with u(α)≠0. The product rule [F3] gives p′=(x−α)m−1(mu+(x−α)u′), whose parenthesized factor is nonzero at α because the field has characteristic zero. Hence the gcd of p and p′ has multiplicity exactly m−1 at α; a root absent from p is absent from their gcd. By [F9] for the field extension Q⊆C, the monic gcd computed over Q is exactly the monic gcd over C. Thus this root-multiplicity computation applies to each pk.

3.1step 2.1F2F7algebrainduction

Induction on k now shows that the multiplicity of α in pk is max⁡(mα−k,0). Therefore α occurs once in sk=pk−1/pk exactly when k≤mα, and it occurs in sk/sk+1 exactly when k=mα. This root factorization proves sk+1 divides sk over C[x]; division over Q[x] has the same zero remainder, so qk=sk/sk+1 lies in Q[x].

4.1step 1.2step 3.1F1algebra∎

Each complex root of f occurs in exactly one qk, with exponent one there and exponent k in qkk. The factorization in step 1.2 therefore gives f=∏k=1dqkk; it also proves that each qk is squarefree and that distinct qk have no common root, hence are pairwise coprime. The degree-zero case has f=1 and an empty root list.

Depends on

Used by

Dependency tree · two levels

42 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