I've asked the question about inductively displaying Vandermonde determinant as a product of polynomials and one of the answers I got had an important piece of information within:

From the definition of a determinant (sum of products), the expansion must be a polynomial in $x_1,x_2,\cdots x_n$, of degree $0+1+2+\cdots n-1=\dfrac{(n-1)n}2$, and the coefficient of every term is $\pm1$.

Below the answer there is an interesting comment:

Note: This requires some knowledge about the polynomial ring in 𝑛 variables -- either that it is a UFD, or at least that common multiples of distinct $x_i - x_j$'s (with $i<j$) are multiples of their product.

I do not have a good knowledge of ring-like structures (especially polynomials), but I understand the very basics, so I decided to make a separate question in case explanation might not be brief.

I know that Unique Factorization Domain (UFD) is an integral domain containing subset of non-zero non-identity elements that can be written as a product of irreducible elements. So I made a little hypothesis:

  1. The complete expansion of determinant is written in the product of $p_{ij} = x_i - x_j$s with $i < j$. Thus maybe these elements are part of UFD since they can not be reduced anymore?
  2. Perhaps the fact that least common multiples of distinct $p_{ij} = x_i - x_j$s with $i < j$s (which belong to UFD, according to point above) are multiples of their product? If so, how exactly?


Is my hypothesis above accurate by any measures? How exactly does UFD relate with representation of determinants as polynomials? Am I incorrectly understanding this concept?

Thank you and I apologize if I made basic mistakes with group-theory based statements in this answer.

  • 1
    $\begingroup$ Being a UFD is a property of the whole ring, not just of a subset. It is not enough to know that the $x_i-x_j$ are uniquely factorizable into a product of irreducibles; what you need is that the determinant of the Vandermonde matrix is uniquely factorizable into a product of irreducibles. $\endgroup$ – darij grinberg Aug 19 '19 at 17:08
  • 1
    $\begingroup$ The UFD property has no specific relation to determinants; it is just used (in a technical role) in this particular proof of the Vandermonde determinant. Other proofs of the Vandermonde determinant work fine without it. Even this proof can be put on a different footing, if one so desires: Instead of working in the polynomial ring $\mathbb{Z}\left[x_1, x_2, \ldots, x_n\right]$, you can work in the polynomial ring $A\left[x_1, x_2, \ldots, x_n\right]$ over any commutative ring $A$. This polynomial ring will not always be a UFD, but ... $\endgroup$ – darij grinberg Aug 19 '19 at 17:09
  • 1
    $\begingroup$ ... it is still true that every polynomial that is divisible by $x_i - x_j$ for all $i < j$ must be divisible by the product $\prod\limits_{i < j} \left(x_i-x_j\right)$ as well. This is Theorem 1.2 of my note Regular elements of a ring, monic polynomials and “lcm-coprimality”. But it takes some work to prove, as well. My main point was that there is a non-obvious step required for this proof, one way or another. $\endgroup$ – darij grinberg Aug 19 '19 at 17:11
  • 1
    $\begingroup$ Yes, you're getting the proof right. But a product of irreducible elements is not necessarily uniquely decomposable into a product of irreducible elements in general. Sometimes, there will be several non-equivalent factorizations. $\endgroup$ – darij grinberg Aug 19 '19 at 17:32
  • 1
    $\begingroup$ @ShellRox You can probably figure out the Factor Theorem approach yourself (hint: proceed inductively as in this proof of the Bifactor Theorem). Since this question is specifically about the UFD approach it would be off-topic to answer here about that. $\endgroup$ – Gone Aug 19 '19 at 18:54
  1. The $x_i-x_j$ belong to the ring of polynomials in $n$ indeterminates $k[x_1,x_2,\dots, x_n]$, where $k$ is the field of coefficients. It is known that the ring of polynomials in a single indeterminate over a field is a principl ideal domain (P.I.D.),, like $\mathbf Z$. In several indeterminates, it is only a unique factorisation domain (U.F.D.), which mean any polynomial can be factored as product of irreducible polynomials, and this factorisation is unique, up to the ordEr of the factors and a unit factor.
  2. The $x_i-x_l\;(i<j)$ are irreducible (essentially for degree reasons) and distinct, so their l.c.m. is their product (just like with integers). Here it happens that this product has exactly the expected degree of the determinant.
| cite | improve this answer | |

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.