Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck 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.

Division by a monic polynomial over a commutative ring

Statement

Let R be a commutative ring and let g∈R[x] be monic. For every f∈R[x] there are unique q,r∈R[x] such that

f=qg+r,r=0 or deg⁡r<deg⁡g.

This includes the zero dividend and a constant monic divisor.

Facts & Assumptions

Given: A commutative ring R, a monic polynomial g of degree d, and a polynomial f.

[L1]

For nonzero polynomials over a commutative ring, degrees of sums and products are at most the corresponding support bounds, and the coefficient at the sum of the degrees is the product of leading coefficients (Degree inequalities for sums and products over a commutative ring).

[L2]

A monic polynomial has leading coefficient 1, and the zero polynomial has no degree (Degree, leading coefficient and monic polynomial, with the zero polynomial having no degree).

[L3]

Strong induction allows the case at degree n once all smaller degrees have been established (Strong (complete) induction).

Proof

technique · induction
1.1

If d=0, monicity gives g=1, so q=f,r=0 works for every f. Hence suppose d>0; for the zero dividend, q=r=0 works.

basegivenL2construct
1.2

Let f≠0 have degree n and assume, as the strong induction hypothesis, that division exists for every zero polynomial or nonzero polynomial of degree below n. If n<d, take q=0,r=f.

ihgivenL1L2construct
2.1

If instead n≥d, put a=lc⁡(f); the polynomial f1=f−axn−dg has its degree-n coefficient cancelled and is zero or has degree below n. The induction hypothesis gives f1=q1g+r with r=0 or deg⁡r<d, whence f=(q1+axn−d)g+r.

step 1.2L1L2construct
3.1

Steps 1.1–2.1 and strong induction [L3] prove existence for every dividend.

step 1.1step 1.2step 2.1L3
4.1

If f=qg+r=q′g+r′ are two such expressions, then (q−q′)g=r′−r; if q−q′≠0, the leading coefficient of (q−q′)g equals the nonzero leading coefficient of q−q′ because g is monic, so [L1] gives degree at least d, whereas r′−r is zero or has degree below d, a contradiction. Thus q=q′ and then r=r′, proving uniqueness and completing the induction proof.

step 3.1L1L2algebradischarge-induction∎

Depends on

Used by

Dependency tree · two levels

8 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