Alphabeta Math
CorollaryStatement: Literature-sourcedProof: AI-adaptedSession-authored (Fable 5 assisted)precheck 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(n1)/2Disc(f)

Statement

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

Res(f,f)=(1)n(n1)/2Disc(f).

Facts & Assumptions

Given: A monic polynomial fF[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=i1iaixi1 (The formal derivative of a polynomial).

[L4]

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

Proof

technique · direct
1.1

Iterating the Leibniz rule of [L4] over the n factors of f=i=1n(tαi) gives f=i=1nji(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)=ji(αiαj).

givenL3L4algebra
2.1

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

step 1.1L1algebra
3.1

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

step 2.1algebra
4.1

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

step 3.1L2

Depends on

Used by

Dependency tree · next 3 levels

Direct dependencies and their dependencies through the next three levels: 31 results over 10 levels. An arrow runs from a result to what uses it, and this result sits at the bottom with a heavier outline. Click the chart to enlarge it.

Sources