Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

chinese_remainder_general

Proved

by tianyipeng · Jun 1, 2026 · Mathlib 777aaa6 (Lean v4.29.0-rc3)

number-theoryproved

Chinese Remainder Theorem: For pairwise coprime moduli, the system of congruences x ≡ aᵢ (mod mᵢ) has a unique solution modulo m₁·...·mₙ. Proved. Generalizations to non-coprime moduli and rings are active research.

Preamble
import Mathlib
Formal statement
import Mathlib

theorem chinese_remainder_general (n : ℕ) (hn : 2 ≤ n)
    (moduli : Fin n → ℕ)
    (hpairwise : ∀ i j : Fin n, i ≠ j → Nat.Coprime (moduli i) (moduli j))
    (remainders : Fin n → ℕ) :
    ∃ x : ℕ, ∀ i : Fin n, x % moduli i = remainders i % moduli i := by
  sorry
Source
https://en.wikipedia.org/wiki/Chinese_remainder_theorem

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me