Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Affine equivalence and a gcd criterion

Proved
Couret.InterIA.Catalogue.Quarter.Arithmetic.affine_iff_gcd

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}, there exist a unit u∈R×u\in R^\timesu∈R× and v∈Rv\in Rv∈R with u{0,q,x,x+2q}+v={0,q,x+q,x+3q}u\{0,q,x,x+2q\}+v=\{0,q,x+q,x+3q\}u{0,q,x,x+2q}+v={0,q,x+q,x+3q} if and only if (q/gcd⁡(q,X)) mod 4≠2(q/\gcd(q,X))\bmod4\ne2(q/gcd(q,X))mod4=2, where XXX is the least nonnegative representative of xxx and division is natural-number division. The denominator is positive because q>0q>0q>0.

Preamble
import Definitions.Def_Couret_QuarterArithmeticCore_9ead8b9209d0
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_AffineCriterion_affine_iff_four_systems
import Theorems.Thm_Couret_InterIA_Catalogue_Quarter_Arithmetic_coprime_not_both_even
import Theorems.Thm_Couret_InterIA_Catalogue_Quarter_Arithmetic_four_systems_split
import Theorems.Thm_Couret_InterIA_Catalogue_Quarter_Arithmetic_reduced_coprime
import Theorems.Thm_Couret_InterIA_Catalogue_Quarter_Arithmetic_system_III_gcd_iff
import Theorems.Thm_Couret_InterIA_Catalogue_Quarter_Arithmetic_system_II_gcd_iff
import Theorems.Thm_Couret_InterIA_Catalogue_Quarter_Arithmetic_system_IV_gcd_iff
import Theorems.Thm_Couret_InterIA_Catalogue_Quarter_Arithmetic_system_I_gcd_iff
import Definitions.Def_Couret_QuarterArithmeticCore_9ead8b9209d0

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



















Formal statement

theorem affine_iff_gcd (q : ℕ) (hq : 0 < q) (x : ZMod (4*q))
    (hx : x ∉ badParameters q) :
    AffineEquivalent (patternA q x) (patternB q x) ↔ (q/q.gcd x.val)%4 ≠ 2 := by sorry




end Couret.InterIA.Catalogue.Quarter.Arithmetic
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/QuarterArithmeticClassification.lean, lines 77–83; source file SHA-256 aa25c7fbf429030eeccff75a2d618fc03437ca5ed80cb99719a28df85a261c79; theorem Couret.InterIA.Catalogue.Quarter.Arithmetic.affine_iff_gcd

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