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 be a commutative ring and let be monic. For every there are unique such that
This includes the zero dividend and a constant monic divisor.
Facts & Assumptions
Given: A commutative ring , a monic polynomial of degree , and a polynomial .
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).
A monic polynomial has leading coefficient , and the zero polynomial has no degree (Degree, leading coefficient and monic polynomial, with the zero polynomial having no degree).
Strong induction allows the case at degree once all smaller degrees have been established (Strong (complete) induction).
Proof
If , monicity gives , so works for every . Hence suppose ; for the zero dividend, works.
Let have degree and assume, as the strong induction hypothesis, that division exists for every zero polynomial or nonzero polynomial of degree below . If , take .
If instead , put ; the polynomial has its degree- coefficient cancelled and is zero or has degree below . The induction hypothesis gives with or , whence .
Steps 1.1–2.1 and strong induction [L3] prove existence for every dividend.
If are two such expressions, then ; if , the leading coefficient of equals the nonzero leading coefficient of because is monic, so [L1] gives degree at least , whereas is zero or has degree below , a contradiction. Thus and then , proving uniqueness and completing the induction proof.
Depends on
Used by
- Factor theorem over a commutative ring Corollary
- Total ramification at a prime-power cyclotomic level Corollary
- A nonradical ideal need not enlarge every tangent space Counterexample
- Division with a degree-small remainder can fail over ℤ when the leading coefficient of the divisor is not a unit Counterexample
- Quasi-finite does not imply finite Counterexample
- The equation must define the intended scheme Counterexample
- The cyclotomic polynomials Φₙ∈ℤ[t], defined by ∏_d∣ nΦ_d=tⁿ-1 Definition
- Coideals, ring ideals, Hopf ideals, and subbialgebras Example
- Different singularities can share a tangent cone Example
- Normalization of a nodal affine plane curve Example
- Normalizing the cuspidal plane curve Example
- Normalizing the nodal plane curve Example
- The cusp retains a doubled tangent line Example
- The finite dual of the primitive polynomial Hopf algebra Example
- The tangent space of the parabola at a general point and the local parameter Example
- Φ₁ through Φ₁₂ computed from the divisor recursion Example
- Constructible images for finite-presentation affine maps Lemma
- Evaluation at a point has kernel (x₁-a₁,..., xₙ-aₙ) Lemma
- If p is a prime not dividing n, a rational minimal polynomial of a primitive n-th root of unity also kills its p-th power Lemma
- One-variable integral correction after leading-coefficient localization Lemma
- Reducing f modulo gᵢ(xᵢ)=∏_s∈ Sᵢ(xᵢ-s) lowers each deg_xᵢ below | Sᵢ|, preserves the values on the grid, and preserves any top-degree coefficient whose exponents stay below the grid sizes Lemma
- The inverse of one plus the generator in the truncated mod-two polynomial ring Lemma
- Unique Laurent decomposition for the Jones–Vassiliev basis Lemma
- Flatness does not force isomorphic or smooth fibres Remark
- Division algorithm for polynomials over a field Theorem
- Gaussian quadrature is exact through degree 2m−1 and has positive weights Theorem
- The recursion defines a unique monic Φₙ∈ℤ[t], of degree φ(n) Theorem
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
- Neil Donaldson, Math 120B Notes, Theorem 23.14 (standard reference, not scraped)