Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

A good pair has trivial i-th coordinates

Proved
gpy_goodPair_coord_eq_one

by pitimespi · Oct 30, 2026 · Mathlib 0df444a (Lean v4.33.1)

number-theory

If a support pair (d,e)(d,e)(d,e) is good at a coordinate iii, then di=ei=1d_i = e_i = 1di​=ei​=1. This is forced, not assumed: the iii-th coordinate modulus divides both the witness shift w+hiw + h_iw+hi​ and the combined modulus LLL, hence divides their gcd, which is 111 by goodness, hence equals 111, forcing both coordinates to be 111. This holds unconditionally and is the formal shadow of the classical fact that a prime n+hin + h_in+hi​ has no divisor strictly between 111 and itself. Formalization Note: goodness is written out in Mathlib terms, with no local definitions.

Preamble
import Mathlib
open Classical
Formal statement
theorem gpy_goodPair_coord_eq_one {k : ℕ} {h d e : Fin k → ℕ} {i : Fin k}
    (hg : ∃ w, (∀ j, Nat.lcm (d j) (e j) ∣ w + h j) ∧
      Nat.Coprime (w + h i)
        (Finset.lcm Finset.univ (fun j => Nat.lcm (d j) (e j)))) :
    d i = 1 ∧ e i = 1 := by sorry
Source
GPY first-moment comparison, formalized from Mathlib (compatible pairs, good pairs, and the singular sum)

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