Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Gcd reduction to reference patterns

Proved
Couret.InterIA.Catalogue.Quarter.Primitive.gcd_reference_reduction

by alexcour · Nov 8, 2026 · Mathlib c5ea003 (Lean v4.30.0)

couret-programmecouret-unification-20261108

For every positive natural qqq and x∈R=Z/(4q)Zx\in R=\mathbb Z/(4q)\mathbb Zx∈R=Z/(4q)Z outside {0,q,2q,3q}\{0,q,2q,3q\}{0,q,2q,3q}, suppose no unit uuu and v∈Rv\in Rv∈R carry Aq(x)={0,q,x,x+2q}A_q(x)=\{0,q,x,x+2q\}Aq​(x)={0,q,x,x+2q} to Bq(x)={0,q,x+q,x+3q}B_q(x)=\{0,q,x+q,x+3q\}Bq​(x)={0,q,x+q,x+3q}. There exist naturals d,b,ad,b,ad,b,a with d>0d>0d>0, b>0b>0b>0, q=dbq=dbq=db, val⁡(x)=da\operatorname{val}(x)=daval(x)=da, gcd⁡(a,b)=1\gcd(a,b)=1gcd(a,b)=1 and b mod 4=2b\bmod4=2bmod4=2 such that the images of Ab(a)A_b(a)Ab​(a) and Bb(a)B_b(a)Bb​(a) under z↦dval⁡(z)z\mapsto d\operatorname{val}(z)z↦dval(z) modulo 4q4q4q equal Aq(x)A_q(x)Aq​(x) and Bq(x)B_q(x)Bq​(x) respectively; furthermore, there exist a unit uuu modulo 4b4b4b and v∈Z/(4b)Zv\in\mathbb Z/(4b)\mathbb Zv∈Z/(4b)Z carrying the pair (Ab(a),Bb(a))(A_b(a),B_b(a))(Ab​(a),Bb​(a)) to (Ab(1),Bb(1))(A_b(1),B_b(1))(Ab​(1),Bb​(1)) in the same order or the opposite order. Here for every positive jjj, Aj(y)={0,j,y,y+2j}A_j(y)=\{0,j,y,y+2j\}Aj​(y)={0,j,y,y+2j} and Bj(y)={0,j,y+j,y+3j}B_j(y)=\{0,j,y+j,y+3j\}Bj​(y)={0,j,y+j,y+3j} in Z/(4j)Z\mathbb Z/(4j)\mathbb ZZ/(4j)Z, and val⁡\operatorname{val}val denotes the least nonnegative representative.

Preamble
import Definitions.Def_Couret_QuarterPrimitiveReduction_b041ef56a347
import Mathlib.Algebra.BigOperators.Group.Finset.Basic
import Mathlib.Algebra.BigOperators.Ring.Finset
import Mathlib.Algebra.MonoidAlgebra.Defs
import Mathlib.Algebra.MonoidAlgebra.MapDomain
import Mathlib.Data.Finset.Insert
import Mathlib.Data.Finset.Prod
import Mathlib.Data.Finset.SymmDiff
import Mathlib.Data.ZMod.Basic
import Mathlib.Data.ZMod.Units
import Mathlib.GroupTheory.OrderOfElement
import Mathlib.Tactic.Abel
import Mathlib.Tactic.LinearCombination
import Mathlib.Tactic.NormNum
import Mathlib.Tactic.Ring
import Mathlib.Tactic.Tauto
import Theorems.Thm_Couret_InterIA_Catalogue_Quarter_Primitive_gcd_support_reduction
import Theorems.Thm_Couret_InterIA_Catalogue_Quarter_Primitive_normalise_negative
import Theorems.Thm_Couret_InterIA_Catalogue_Quarter_Primitive_unit_quarter_sign
import Definitions.Def_Couret_QuarterPrimitiveReduction_b041ef56a347

set_option autoImplicit false
namespace Couret.InterIA.Catalogue.Quarter.Primitive
open Finset Couret.InterIA.Catalogue.Quarter Couret.InterIA.NormalForm
open Couret.InterIA.Catalogue.Quarter.AffineCriterion









Formal statement

theorem gcd_reference_reduction (q : ℕ) (hq : 0 < q) (x : ZMod (4*q))
    (hx : x ∉ badParameters q) (hna : ¬ AffineEquivalent (patternA q x) (patternB q x)) :
    ∃ d b a : ℕ, 0 < d ∧ 0 < b ∧ q=d*b ∧ x.val=d*a ∧ a.Coprime b ∧ b%4=2 ∧
      (patternA b (a : ZMod (4*b))).image (dilate (4*q) d)=patternA q x ∧
      (patternB b (a : ZMod (4*b))).image (dilate (4*q) d)=patternB q x ∧
      ∃ u : (ZMod (4*b))ˣ, ∃ v : ZMod (4*b),
        ((patternA b (a : ZMod (4*b))).image (fun z => (u : ZMod (4*b))*z+v)=patternA b 1 ∧
         (patternB b (a : ZMod (4*b))).image (fun z => (u : ZMod (4*b))*z+v)=patternB b 1) ∨
        ((patternA b (a : ZMod (4*b))).image (fun z => (u : ZMod (4*b))*z+v)=patternB b 1 ∧
         (patternB b (a : ZMod (4*b))).image (fun z => (u : ZMod (4*b))*z+v)=patternA b 1) := by sorry


end Couret.InterIA.Catalogue.Quarter.Primitive
Source
Alexandre Couret, Couret — Additive reconstruction: STROBO-4, singleton collisions and RECOH formal proof artifacts, https://zenodo.org/records/23980513; archive COURET_MATHEMATIQUES_20261105.zip, SHA-256 19a3b59aee930df74cab79c27b29e014843bd17179a26fef1261ed6b5a651ab7; file source-tree/research/interia/m026-hk-review-corollaries-20261103/QuarterPrimitiveNormalisation.lean, lines 67–79; source file SHA-256 887d1f22b7114913eff0206bd9fb0b0b10e19d86cf09f8c53729d69597242304; theorem Couret.InterIA.Catalogue.Quarter.Primitive.gcd_reference_reduction

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