The Chinese remainder theorem
ProvedFamousTheorems.chinese_remainderThe Chinese remainder theorem, in its ring-theoretic form.
Let be a commutative ring and a finite family of pairwise coprime ideals. Then
as rings.
Taking and with the pairwise coprime recovers the classical statement: a system of congruences has a solution, unique modulo . The abstract version makes clear what is really going on — coprimality is exactly the condition for the natural map to to be surjective, and the intersection is the kernel.
The theorem appears in Sun Tzu's Sunzi Suanjing (3rd–5th century), with the general method given by Qin Jiushao in 1247. It is the reason modular arithmetic decomposes into prime-power components, underlies fast multiplication by residue number systems, Lagrange interpolation (the polynomial case), and the decomposition of a finite abelian group into its Sylow subgroups.
Formalization note. IsCoprime I J means , and ⨅ is the intersection of the family.
The equivalence is packaged as Nonempty because the Mathlib result is a ring isomorphism (data)
rather than a proposition. The result is Mathlib's Ideal.quotientInfRingEquivPiQuotient.
import Mathlib
namespace FamousTheorems
open MeasureTheory ProbabilityTheory Filter Set
open scoped Topology ENNReal NNReal
theorem chinese_remainder {R : Type*} [CommRing R] {ι : Type*} [Finite ι]
(f : ι → Ideal R) (hf : Pairwise (Function.onFun IsCoprime f)) :
Nonempty ((R ⧸ ⨅ i, f i) ≃+* ∀ i, R ⧸ f i) := by sorry
end FamousTheorems