2024-07-21

684: Polynomials Ring over Integral Domain Is Integral Domain

<The previous article in this series | The table of contents of this series | The next article in this series>

description/proof of that polynomials ring over integral domain is integral domain

Topics


About: ring

The table of contents of this article


Starting Context



Target Context


  • The reader will have a description and a proof of the proposition that any polynomials ring over any integral domain is an integral domain.

Orientation


There is a list of definitions discussed so far in this site.

There is a list of propositions discussed so far in this site.


Main Body


1: Structured Description


Here is the rules of Structured Description.

Entities:
R: { the integral domains }
R[x]: = the polynomials ring over R
//

Statements:
R[x]: { the integral domains }
//


2: Natural Language Description


For any integral domain, R, the polynomials ring over R, R[x], is an integral domain.


3: Proof


Whole Strategy: Step 1: see that R[x] is a nonzero commutative ring; Step 2: prove the qualification that the multiplication of any 2 elements being 0 implies that one of the elements is 0.

Step 1:

As R is nonzero, R[x] is nonzero, because any nonzero element of R is contained in R[x] as the constant.

R[x] is a commutative ring, as is shown in Note for the definition of polynomials ring of commutative ring.

Step 2:

Let us prove that for each p(x),p(x)R[x] such that p(x)p(x)=0, p(x)=0 or p(x)=0.

Step 2 Strategy: Step 2-1: suppose that p(x) is with certain coefficients with n-degree with 0n and p(x)0 and p(x) is with certain coefficients with m-degree, and see that p(x)=0; Step 2-2: suppose that p(x) is with certain coefficients with m-degree with 0m and p(x)0 and p(x) is with certain coefficients with n-degree, and see that p(x)=0.

In fact, Step 2-2 is not necessary by the known fact that R[x] is commutative, but we do it anyway for a fun.

Step 2-1:

Let us suppose that p(x)=pnxn+...+p0 with pn0 and p(x)=pmxm+...+p0. pn may be p0 when n=0. The supposition for p(x) means that p(x) is equal to or smaller than m degree, which does not lose any generality.

pnpm has to be 0, because that is the coefficient of the n+m degree, which implies that pm=0, because pn0 and R is an integral domain.

Then, pnpm1 has to be 0, because that is the coefficient of the n+m1 degree, which implies that pm1=0, because pn0 and R is an integral domain.

And so on, after all, pnp0 has to be 0, because that is the coefficient of the n degree, which implies that p0=0, because pn0 and R is an integral domain.

So, all the coefficients of p(x) are 0, so, p(x)=0.

Step 2-2:

Let us suppose that p(x)=pmxm+...+p0 with pm0 and p(x)=pnxn+...+p0. pm may be p0 when m=0. The supposition for p(x) means that p(x) is equal to or smaller than n degree, which does not lose any generality.

pnpm has to be 0, because that is the coefficient of the n+m degree, which implies that pn=0, because pm0 and R is an integral domain.

Then, pn1pm has to be 0, because that is the coefficient of the n1+m degree, which implies that pn1=0, because pm0 and R is an integral domain.

And so on, after all, p0pm has to be 0, because that is the coefficient of the m degree, which implies that p0=0, because pm0 and R is an integral domain.

So, all the coefficients of p(x) are 0, so, p(x)=0.


References


<The previous article in this series | The table of contents of this series | The next article in this series>