Complete proof of Chinese Remainder Theorem


Statement:

If we take t number of integers a1,a2,a3,…,a and   m1,m2,m3,…,mt  be coprime (i.e gcd of two numbers is 1) then there is a number x with the property that, 
ยบ ai (mod mi)   £ i £ t   ......(1)
The number x is unique in the following sense: 
Let M be the product of all the mi¢s, 
M = m1.m2...mt 
and y satisfies the system of congruences (1). Then, 
ยบ x ( mod M)  

Proof:

We will use induction to prove this,
           For x=a1         here x is unique so, the result is true For t=1,

Now, by the induction hypothesis,
we assume it to be true for t=k  

We will proof if the result is true for t=k+1 

Consider the system of congruences, x ยบ a1 (mod m1 ) 
ยบ a2 (mod m2 ) 
.                           
.                           
.                           
ยบ ak (mod mk ) 
      x ยบ ak+1 (mod mk+1 ) 

Where the modulus is relatively prime to each other.
By induction, there is a number x¢ satisfying the first k congruences. Note that the product of m1,m2,…, mk and mk+1 are coprime i.e.,
 
gcd( mr , mk+1)=1 , 

where  mr is the product m1.m2.m3….. mk. 

Otherwise, there would be a common prime factor p. Since p divides mr it must divide one of the factors say mj where 1 £ j £ k. then,
 p £ gcd( mj , mk+1). 

This contradicts the assumption that moduli are coprime.
 

Since m1,m2,m3,…..,mk and mk+1 are coprime there exist integers u and v such that, 

u.m2.m3….. mk +v. mk+1=1
 
Multiplying both sides by ( ak+1-x¢), we get, 

( ak+1-x¢).u.m2.m3….. mk+( ak+1-x¢).v. mk+1=( ak+1-x¢) 

Taking u¢¢= u.( ak+1-x¢) and v¢¢-v.( ak+1-x¢)
 
It gives,  
x¢+u¢¢.m1.m2….. mk = ak+1+v¢¢.mk+1 
Let’s denote x¢¢=x¢+u¢¢.m1.m2….. mk this gives us, 
x¢¢= ak+1+v¢¢ mk+1 

Rewriting the equivalence equation as
 
x¢¢= ak+1 ยบ (mod mk+1)
Since,                x¢ ยบ ai(mod mi)    ,1 £ i £ k                          
Thus,               x¢¢ ยบ x¢ ยบ ai(mod mi)    ,1 £ i £ k                
 
The induction step is completed as x¢¢ satisfies all of the original k+1congruences since the first congruence follows by the definition of x¢ ¢and the second is due to the choice of  x¢. To prove uniqueness, consider two numbers x1 and x2 satisfying (1). 

Thus,             x1 ยบ x2(mod mi) ,i=1,2,...,t  
                 
from which the relation x1 ยบ x2(mod M) immediately follows, by the definition of congruence and by our assumption that these are coprime.
 
This completes the proof.

     

Comments

Recent blogs

Topology

Integration = Area under the curve?

Types of Topology

Examples based on Chinese Remainder Theorem

Chinese Remainder Theorem

Riemann Sums and Integral