Transitivity of affine equivalence
ProvedCouret.InterIA.Catalogue.AffineTransport.affine_equivalent_transcouret-programmecouret-unification-20261108
For every natural and finite subsets of , if for some unit and element , and for some unit and element , then for some unit and element . This includes , when , and empty sets.
Preamble
import Definitions.Def_Couret_AffineEquivalenceTransport_fe8e73389d60 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 Definitions.Def_Couret_AffineParameterControls_321393084939 set_option autoImplicit false namespace Couret.InterIA.Catalogue.AffineTransport open Finset Couret.InterIA.NormalForm
Formal statement
theorem affine_equivalent_trans {n : ℕ} (S T U : Finset (ZMod n))
(hST : AffineEquivalent S T) (hTU : AffineEquivalent T U) : AffineEquivalent S U := by sorry
end Couret.InterIA.Catalogue.AffineTransport
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/AffineEquivalenceTransport.lean, lines 7–20; source file SHA-256 317b8b661cceb15b156cd289602ed84565c6a27bf8af9028f7e0389c60f5aab8; theorem Couret.InterIA.Catalogue.AffineTransport.affine_equivalent_trans