Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedprecheck pass
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 real polynomial vanishing at a is divisible by x−a

Statement

If p(x)=∑k<nakxk and p(a)=0, then there is a real polynomial q with p(x)=(x−a)q(x) for every real x. The conventions and prerequisite facts used below are recorded in Formal real polynomials, evaluation, degree, leading coefficient, and monic polynomials, Factorisation of bn−an, and the resulting Lipschitz estimate, Laws of finite sums and finite products.

Facts & Assumptions

Given: A polynomial p and a real root a.

Proof

technique · constructive
1.1given

For each k≥1, the power-difference factorization gives xk−ak=(x−a)∑j<kajxk−1−j.

1.2algebra

Since p(a)=0, write p(x)=∑k<nak(xk−ak).

2.1step 1.1step 1.2constructalgebradischarge-construct∎

If the displayed list has length n≤1, the root condition makes its constant evaluation zero, so choose the zero polynomial q. For n≥2, define bd=∑k=d+1n−1akak−1−d for 0≤d≤n−2. Reindexing the finite sums in steps 1.1–1.2 gives p(x)=(x−a)∑d=0n−2bdxd. If every bd vanishes choose the zero formal polynomial; otherwise truncate the list (b0,…,bn−2) after its last nonzero entry. This is a formal polynomial q with the required evaluation. In particular, when p has degree N≥1 and its actual list is (a0,…,aN), take n=N+1: then bN−1=aNa0=aN≠0, and no exponent above N−1 occurs. Thus this construction gives q of degree exactly N−1 and leading coefficient aN.

Depends on

Used by

Dependency tree · two levels

21 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