{
  "id": "discriminant",
  "title": "Discriminant",
  "lang": "en",
  "source_lang": "en",
  "summary": "A discriminant is an algebraic expression that detects repeated polynomial roots, degeneracy of forms, or arithmetic structure in number fields.",
  "category": "mathematics",
  "subcategory": "algebra",
  "type": "concept",
  "aliases": [
    "Polynomial discriminant"
  ],
  "generated_at": "2026-11-04",
  "model": "pro/gpt-6.1-sol",
  "url": "https://aiwiki.page/en/discriminant/",
  "translations": {
    "zh-Hans": {
      "url": "https://aiwiki.page/zh/discriminant/",
      "json": "https://aiwiki.page/zh/discriminant.json"
    }
  },
  "sections": [
    {
      "heading": "",
      "text": "A discriminant is an expression in the coefficients of an algebraic object that detects particular kinds of degeneracy. Most commonly, it is associated with a polynomial: its discriminant is zero exactly when the polynomial has a repeated root in a field where it splits into linear factors. For a quadratic equation \\(ax^2+bx+c=0\\), the discriminant is \\(b^2-4ac\\), whose sign determines the number of real roots. Related discriminants occur in quadratic forms, algebraic geometry, and number theory, although their definitions and normalizations depend on the setting."
    },
    {
      "heading": "Polynomial discriminant",
      "text": "Let\n\n\\[f(x)=a_nx^n+a_{n-1}x^{n-1}+\\cdots+a_0, \\qquad a_n\\ne0,\\]\n\nbe a polynomial of degree \\(n\\ge2\\) over a field. In a field containing all its roots, write\n\n\\[f(x)=a_n\\prod_{i=1}^{n}(x-r_i),\\]\n\nwhere roots are listed with their multiplicities. Its discriminant is\n\n\\[\\operatorname{Disc}(f) = a_n^{\\,2n-2} \\prod_{1\\le i<j\\le n}(r_i-r_j)^2.\\]\n\nThe squared differences make this expression independent of how the roots are ordered. Although the formula uses roots, the result is a polynomial with integer coefficients in \\(a_n,\\ldots,a_0\\). It can therefore be computed directly from the coefficients without solving the equation.\n\nThe defining property is\n\n\\[\\operatorname{Disc}(f)=0 \\quad\\Longleftrightarrow\\quad f\\text{ has a repeated root}.\\]\n\nA polynomial with no repeated roots is called separable. Thus, for a polynomial of fixed degree, a nonzero discriminant is precisely a test for separability.\n\nThe restriction to fixed degree matters when coefficients depend on parameters: if the leading coefficient becomes zero, the degree changes, and a discriminant formula derived for the original degree requires separate interpretation."
    },
    {
      "heading": "Quadratic equations",
      "text": "For\n\n\\[f(x)=ax^2+bx+c,\\qquad a\\ne0,\\]\n\nthe discriminant is\n\n\\[\\Delta=b^2-4ac.\\]\n\nOver the real numbers, the quadratic formula\n\n\\[x=\\frac{-b\\pm\\sqrt{\\Delta}}{2a}\\]\n\ngives the following classification:\n\nDiscriminant | Roots\n\\(\\Delta>0\\) | Two distinct real roots\n\\(\\Delta=0\\) | One real root of multiplicity two\n\\(\\Delta<0\\) | Two nonreal complex-conjugate roots\n\nGeometrically, these cases describe whether the parabola \\(y=ax^2+bx+c\\) crosses the horizontal axis twice, touches it once, or does not meet it.\n\nFor example,\n\n\\[x^2-5x+6\\]\n\nhas discriminant \\(25-24=1\\) and roots \\(2\\) and \\(3\\), whereas\n\n\\[x^2+2x+1\\]\n\nhas discriminant zero and equals \\((x+1)^2\\).\n\nIf \\(a,b,c\\) are rational numbers, the roots are rational exactly when \\(\\Delta\\) is a square in the rational numbers, including zero. More generally, over any field of characteristic other than \\(2\\), the quadratic splits into linear factors over that field exactly when its discriminant is a square there. The familiar quadratic formula and sign classification do not apply unchanged in characteristic \\(2\\)."
    },
    {
      "heading": "Cubic equations and real-root classification",
      "text": "For a cubic\n\n\\[f(x)=ax^3+bx^2+cx+d,\\qquad a\\ne0,\\]\n\nthe discriminant is\n\n\\[\\Delta = b^2c^2-4ac^3-4b^3d-27a^2d^2+18abcd.\\]\n\nFor the depressed cubic\n\n\\[x^3+px+q,\\]\n\nthis simplifies to\n\n\\[\\Delta=-4p^3-27q^2.\\]\n\nWhen the coefficients are real:\n\n- \\(\\Delta>0\\) means that all three roots are real and distinct.\n- \\(\\Delta<0\\) means that one root is real and the other two form a nonreal conjugate pair.\n- \\(\\Delta=0\\) means that at least two roots coincide.\n\nFor higher-degree real polynomials, the sign gives less information. If all roots are distinct and \\(s\\) is the number of nonreal conjugate pairs, then\n\n\\[\\operatorname{sgn}\\bigl(\\operatorname{Disc}(f)\\bigr)=(-1)^s.\\]\n\nThus the sign determines the parity of the number of nonreal conjugate pairs, not generally the exact number of real roots. A real quartic with positive discriminant, for example, may have either four real roots or no real roots."
    },
    {
      "heading": "Derivatives, resultants, and computation",
      "text": "A root is repeated exactly when it is also a root of the polynomial’s derivative. Consequently,\n\n\\[\\operatorname{Disc}(f)=0 \\quad\\Longleftrightarrow\\quad f\\text{ and }f'\\text{ have a common root}.\\]\n\nThis connects the discriminant to the resultant, an expression that detects whether two polynomials have a common root. With the standard resultant convention,\n\n\\[\\operatorname{Disc}(f) = (-1)^{n(n-1)/2}\\frac{\\operatorname{Res}(f,f')}{a_n}.\\]\n\nWhen \\(f'\\) has degree \\(n-1\\), the resultant is the determinant of the Sylvester matrix formed from the coefficients of \\(f\\) and \\(f'\\). This provides a coefficient-based construction and explains why the discriminant is itself a polynomial in the coefficients.\n\nFor testing repeated roots, computing the greatest common divisor of \\(f\\) and \\(f'\\), often by the Euclidean algorithm, may be more economical than evaluating the full discriminant.\n\nThese statements extend to positive characteristic, but derivative degrees can drop, or the derivative can vanish identically. For example, over a field of characteristic \\(p\\),\n\n\\[\\frac{d}{dx}x^p=0.\\]\n\nThe root-product definition remains valid and still detects repeated roots; resultant computations must account for the characteristic and actual degrees."
    },
    {
      "heading": "Transformation laws",
      "text": "The discriminant changes predictably under basic transformations. For a nonzero scalar \\(c\\),\n\n\\[\\operatorname{Disc}(cf) = c^{\\,2n-2}\\operatorname{Disc}(f).\\]\n\nTranslating the variable does not change the discriminant:\n\n\\[\\operatorname{Disc}\\bigl(f(x+v)\\bigr) = \\operatorname{Disc}(f).\\]\n\nMore generally, for \\(u\\ne0\\),\n\n\\[\\operatorname{Disc}\\bigl(f(ux+v)\\bigr) = u^{\\,n(n-1)}\\operatorname{Disc}(f).\\]\n\nTranslation leaves all root differences unchanged, while scaling changes them uniformly.\n\nFor positive-degree polynomials \\(f\\) and \\(g\\),\n\n\\[\\operatorname{Disc}(fg) = \\operatorname{Disc}(f)\\operatorname{Disc}(g) \\operatorname{Res}(f,g)^2,\\]\n\nwith the discriminant of a linear polynomial taken as \\(1\\). This identity separates three causes of repeated roots in a product: repetition within \\(f\\), repetition within \\(g\\), and a root shared by both factors."
    },
    {
      "heading": "Quadratic forms and conic sections",
      "text": "For a binary quadratic form\n\n\\[Q(x,y)=ax^2+bxy+cy^2,\\]\n\nthe classical discriminant is\n\n\\[D=b^2-4ac.\\]\n\nIts symmetric coefficient matrix is\n\n\\[A= \\begin{pmatrix} a & b/2\\\\ b/2 & c \\end{pmatrix},\\]\n\nso\n\n\\[D=-4\\det A.\\]\n\nFor real coefficients, \\(D<0\\) means that the form is definite, \\(D>0\\) means it is indefinite, and \\(D=0\\) means it is degenerate. Under an invertible change of coordinates represented by a matrix \\(M\\), the coefficient matrix becomes\n\n\\[M^{\\mathsf T}AM,\\]\n\nand its determinant is multiplied by \\((\\det M)^2\\). The sign and vanishing of the discriminant are therefore preserved under invertible real coordinate changes.\n\nFor a general conic section\n\n\\[Ax^2+Bxy+Cy^2+Dx+Ey+F=0,\\]\n\nthe expression \\(B^2-4AC\\) classifies the quadratic part. For a nondegenerate real conic with real points, negative, zero, and positive values correspond respectively to ellipse, parabola, and hyperbola types.\n\nThis expression alone does not determine whether the full conic is degenerate or has real points. Degeneracy is detected by the determinant of the full homogeneous coefficient matrix,\n\n\\[\\begin{pmatrix} A&B/2&D/2\\\\ B/2&C&E/2\\\\ D/2&E/2&F \\end{pmatrix}.\\]"
    },
    {
      "heading": "Discriminants in algebraic number theory",
      "text": "A related construction assigns a discriminant to a basis of a finite field extension. Let \\(K/\\mathbb Q\\) have degree \\(n\\), and let \\(\\alpha_1,\\ldots,\\alpha_n\\) be a rational basis of \\(K\\). Define\n\n\\[\\operatorname{disc}(\\alpha_1,\\ldots,\\alpha_n) = \\det\\left( \\operatorname{Tr}_{K/\\mathbb Q}(\\alpha_i\\alpha_j) \\right)_{i,j=1}^{n},\\]\n\nwhere the field trace \\(\\operatorname{Tr}_{K/\\mathbb Q}(\\alpha)\\) is the trace of the rational linear map given by multiplication by \\(\\alpha\\).\n\nChoosing an integral basis of the ring of integers of \\(K\\) gives the field discriminant \\(D_K\\), which is independent of the chosen integral basis.\n\nIf an algebraic integer \\(\\theta\\) generates \\(K\\), its minimal polynomial has discriminant\n\n\\[\\operatorname{Disc}(\\theta) = D_K\\,[\\mathcal O_K:\\mathbb Z[\\theta]]^2.\\]\n\nHere \\(\\operatorname{Disc}(\\theta)\\) denotes the discriminant of that minimal polynomial, and the bracketed quantity is the index of the order \\(\\mathbb Z[\\theta]\\) in the full ring of integers \\(\\mathcal O_K\\). Polynomial and field discriminants therefore need not coincide.\n\nThe prime numbers dividing \\(D_K\\) are exactly those that ramify in \\(K\\). For a quadratic field \\(K=\\mathbb Q(\\sqrt d)\\), where \\(d\\ne1\\) is a square-free integer,\n\n\\[D_K= \\begin{cases} d,&d\\equiv1\\pmod4,\\\\ 4d,&d\\not\\equiv1\\pmod4. \\end{cases}\\]"
    },
    {
      "heading": "Galois-theoretic interpretation",
      "text": "Suppose a separable polynomial over a field \\(F\\) of characteristic not \\(2\\) has degree \\(n\\). In its splitting field, the expression\n\n\\[\\delta=a_n^{\\,n-1}\\prod_{i<j}(r_i-r_j)\\]\n\nsatisfies\n\n\\[\\delta^2=\\operatorname{Disc}(f).\\]\n\nPermuting the roots multiplies \\(\\delta\\) by the sign of the permutation.\n\nConsequently, in Galois theory, the discriminant is a square in \\(F\\) exactly when the Galois group, acting on the roots, consists entirely of even permutations. Equivalently, the group lies in the alternating subgroup of the symmetric group \\(S_n\\). This provides information about the Galois group, although it does not generally determine the group completely."
    },
    {
      "heading": "Geometric and numerical significance",
      "text": "For a parameterized polynomial, setting the discriminant equal to zero defines a locus in coefficient or parameter space where roots collide. For example, the family\n\n\\[x^3+px+q\\]\n\nhas a repeated root along the curve\n\n\\[4p^3+27q^2=0.\\]\n\nAway from the discriminant locus, roots remain distinct; on it, the multiplicity pattern changes.\n\nIn numerical computation, closely spaced roots can make root recovery sensitive to coefficient perturbations. The product of squared root differences explains the connection between discriminants and such sensitivity. However, the absolute size of the discriminant is not a scale-independent measure of numerical stability: multiplying the polynomial by a constant changes the discriminant without changing any root. Reliable conditioning analysis must also consider coefficient normalization, root magnitudes, and the chosen perturbation model."
    }
  ],
  "links": [
    "polynomial",
    "quadratic-equation",
    "algebraic-geometry",
    "number-theory",
    "field-mathematics",
    "real-number",
    "parabola",
    "rational-number",
    "derivative",
    "determinant",
    "greatest-common-divisor",
    "euclidean-algorithm",
    "quadratic-form",
    "matrix",
    "conic-section",
    "field-extension",
    "prime-number",
    "galois-theory",
    "symmetric-group",
    "numerical-stability"
  ],
  "sources": [],
  "license": "https://creativecommons.org/licenses/by/4.0/"
}