Gcd reduction to reference patterns
ProvedCouret.InterIA.Catalogue.Quarter.Primitive.gcd_reference_reductioncouret-programmecouret-unification-20261108
For every positive natural and outside , suppose no unit and carry to . There exist naturals with , , , , and such that the images of and under modulo equal and respectively; furthermore, there exist a unit modulo and carrying the pair to in the same order or the opposite order. Here for every positive , and in , and 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