Blog Archive

Sunday, December 15, 2024

Connecting Lagrange Interpolation and the Chinese Remainder Theorem in Principal Ideal Domain

The traditional Lagrange interpolating theorem looks like:

Let a1,…,an be a family of elements in R, then there exists a polynomial f(X) that satisfies f(i)=ai.

As we will see, it is just a particular case of the Chinese Remainder Theorem.

Proof. By CRT we get that

(1)R[X]↠R[X](∏i=1n(X−i))≅∏i=1nR[X](X−i)≅Rn.

Hence there exists a polynomial f(X) such that f(X)≡aimod(X−i) for i∈[n]. ◻


So let us generalize it. Let R be a PID and consider a1∈k(x1),…,an∈k(xn), where pi≠(0).

Then there exists an f∈R that satisfies f(xi)=ai.

Proof. By CRT we get that

(2)π:R↠R⋂i=1npxi≅∏i=1nRpxi≅∏i=1nk(xi).

Hence there exists an f∈R such that f(xi)=ai.

To construct it, let (pxi)=pxi. Consider fi′=∏j≠ipxj, so that fi′(xj)≠0⟺j=i. Then we can find fi(xj)=δi,j by selecting a preimage of 1fi′(xi) with respect to R↠k(xi). Let ai′ be a preimage of ai with respect to R↠k(xi), then

(3)f(x)=∑i=1nai′fi(x),

which satisfies f(xi)=ai for all i.

No comments:

Post a Comment

Popular Posts