A result that gives conditions for and a construction of simultaneous solutions to systems of congruences x ≡ a_i (mod m_i) when the moduli m_i are pairwise coprime; it asserts existence and uniqueness modulo the product M = ∏ m_i and provides an explicit reconstruction.

Principle

Pairwise coprimality of moduli decouples congruence constraints so that residues modulo each modulus can be combined into a single residue modulo the product, using modular inverses or constructive linear combinations.

Demonstration

Solve x ≡ 2 (mod 3) and x ≡ 3 (mod 5). Since 3 and 5 are coprime, a solution exists and is unique modulo 15; one solution is x = 8 because 8 ≡ 2 (mod 3) and 8 ≡ 3 (mod 5), so all solutions are x ≡ 8 (mod 15).

Misapplication

Applying the standard CRT formulation when moduli are not pairwise coprime; without checking compatibility the system may be inconsistent or require working modulo the least common multiple and testing congruence compatibility.

Consequence

Provides a powerful tool for modular decomposition: arithmetic modulo a composite M with coprime factors is isomorphic to the product of the smaller moduli rings, enabling parallel computations, reductions of complexity, and the design of algorithms in cryptography and coding.

Reversal

Reversal considers combined congruences with noncoprime moduli: existence requires consistency conditions and solutions are described modulo the least common multiple rather than the product, so the simple decoupling fails.

Boundary

The simplest form assumes integer moduli greater than 1 that are pairwise coprime; generalized versions treat noncoprime moduli with compatibility constraints, and analogues exist in more general rings under suitable idempotent decompositions.

Semantic Tension

Tension lies between the CRT as an existence/uniqueness theorem and its constructive algorithmic instantiation; additionally there is tension between the elementary integer statement and more abstract algebraic decompositions (ring isomorphisms and idempotents).

Synthesis

The Chinese Remainder Theorem characterizes when and how local congruence data modulo pairwise coprime integers can be fused uniquely into a single global residue modulo the product; it bridges number-theoretic existence with explicit constructive methods and algebraic decompositions.