Alphabeta Math
CorollaryStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-08-16
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.

For monic f of degree n, Res⁡(f,f′)=(−1)n(n−1)/2Disc⁡(f)

Statement

Let F be a field and let f∈F[t] be monic of degree n. Then

Res⁡(f,f′)=(−1)n(n−1)/2Disc⁡(f).

Facts & Assumptions

Given: A monic polynomial f∈F[t] of degree n, split as f(t)=∏i=1n(t−αi) in a splitting field.

[L1]

The root-product formula gives Res⁡(f,f′)=∏if′(αi) (For monic f, Res⁡(f,g)=∏ig(αi) and it vanishes exactly when f and g have a common root).

[L2]

The discriminant root formula is Disc⁡(f)=∏i<j(αi−αj)2 (The discriminant is ∏i<j(αi−αj)2 and vanishes exactly when a monic polynomial has a repeated root).

[L3]

The formal derivative of f=∑iaixi is f′=∑i≥1iaixi−1 (The formal derivative of a polynomial).

[L4]

Over a commutative ring, formal differentiation is additive and F-linear and satisfies (fg)′=f′g+fg′ (Linearity, power rule, Leibniz rule and the degree bound for the formal derivative).

Proof

technique · direct
1.1givenL3L4algebra

Iterating the Leibniz rule of [L4] over the n factors of f=∏i=1n(t−αi) gives f′=∑i=1n∏j≠i(t−αj), since each (t−αi)′=1 by [L3]. At t=αi, every summand except the i-th contains the zero factor αi−αi, so f′(αi)=∏j≠i(αi−αj).

2.1step 1.1L1algebra

By [L1], Res⁡(f,f′)=∏i∏j≠i(αi−αj). Group the two ordered factors belonging to each unordered pair i<j.

3.1step 2.1algebra

For each i<j, (αi−αj)(αj−αi)=−(αi−αj)2. There are n(n−1)/2 unordered pairs, so step 2.1 becomes (−1)n(n−1)/2∏i<j(αi−αj)2.

4.1step 3.1L2∎

Apply [L2] to identify the remaining product with Disc⁡(f). The empty-degree cases n=0,1 give 1=1.

Depends on

Used by

Dependency tree · two levels

13 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