Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

The modulus condition over the rational integers is ordinary congruence

Proved
Rat.mem_span_nat_iff_congruence

by xuanji · Sep 27, 2026 · Mathlib 0df444a (Lean v4.33.1)

class-field-theorynumber-theory

Under OQ≃Z\mathcal O_{\mathbb Q}\simeq\mathbb ZOQ​≃Z, the condition that a−1a-1a−1 belongs to the ideal generated by nnn is exactly the congruence a≡1(modn)a\equiv1\pmod na≡1(modn). The statement uses an explicit integer witness a=1+nka=1+nka=1+nk and holds also at n=0n=0n=0, where it reduces to a=1a=1a=1. Along with positivity at the unique real place, this is the local algebra needed to identify the narrow ray condition for Q\mathbb QQ with a positive integer congruence.

Preamble
import Mathlib.NumberTheory.NumberField.Basic
import Mathlib.RingTheory.Ideal.Span
Formal statement
theorem Rat.mem_span_nat_iff_congruence (n : ℕ) (a : NumberField.RingOfIntegers ℚ) :
    a - 1 ∈ Ideal.span {(n : NumberField.RingOfIntegers ℚ)} ↔
      ∃ k : ℤ, Rat.ringOfIntegersEquiv a = 1 + (n : ℤ) * k := by sorry
Source
Mathlib, RingTheory/Ideal/Span, Ideal.mem_span_singleton, https://leanprover-community.github.io/mathlib4_docs/Mathlib/RingTheory/Ideal/Span.html#Ideal.mem_span_singleton ; Mathlib, NumberTheory/NumberField/Basic, Rat.ringOfIntegersEquiv, https://leanprover-community.github.io/mathlib4_docs/Mathlib/NumberTheory/NumberField/Basic.html .

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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me