A theorem stating that a system of simultaneous congruences x ≡ a_i (mod m_i) with pairwise coprime moduli m_i has a unique solution modulo M = ∏ m_i; equivalently, the ring Z/MZ is isomorphic to the product of Z/m_iZ when the m_i are pairwise coprime.

Principle

The organizing idea is that coprimality of moduli yields a bijection between residue classes modulo the product and tuples of residues modulo each modulus, enabling independent specification of residues and constructive reconstruction.

Demonstration

Example: solve x ≡ 2 (mod 3) and x ≡ 3 (mod 5). Since 3 and 5 are coprime, there is a unique solution modulo 15; one finds x ≡ 8 (mod 15), constructed by combining residues (for instance via the standard constructive algorithm using inverses).

Misapplication

Applying the theorem when moduli are not pairwise coprime; that misuse can lead to claiming a unique solution modulo the product when in fact no solution or multiple residue classes modulo the lcm may occur.

Consequence

Correct use gives an explicit constructive method to solve simultaneous congruences, underpins efficient algorithms in computational number theory and cryptography, and enables decomposition of modular arithmetic into smaller independent components.

Reversal

If the moduli share nontrivial gcds, the reverse situation is that consistency must be checked and solutions, when they exist, are only unique modulo the least common multiple rather than the product; the clean bijection fails.

Boundary

Scope: requires pairwise coprime moduli for the standard uniqueness statement modulo the product. Generalizations exist for noncoprime moduli but require compatibility conditions; the theorem concerns residues modulo integers and does not directly apply to noncommutative rings without adaptation.

Semantic Tension

Tension exists between the simple coprime version (unique solution modulo product) and the more general compatibility-based version for noncoprime moduli; people sometimes conflate the two, forgetting the necessity of pairwise coprimality for the classical statement.

Synthesis

The Chinese Remainder Theorem packages a structural bijection: pairwise coprime moduli let one encode global residues as independent local residues and reconstruct a unique global solution modulo the product, providing both theoretical decomposition and a practical constructive algorithm.