Reindexing the right triple preserves its support
ProvedCouret.InterIA.SingletonNecessity.supportRight_reindexcouret-programmecouret-unification-20261108
Let be an abelian group. Let and let be a map on their six indices such that . Then
This transports support data under a triple-preserving reindexing.
Preamble
import Definitions.Def_Couret_RelabelBasics_a474d20b9d5f
import Mathlib.Algebra.BigOperators.Group.Finset.Basic
import Mathlib.Algebra.BigOperators.Ring.Finset
import Mathlib.Algebra.Group.Pi.Basic
import Mathlib.Data.Finset.Insert
import Mathlib.Data.Finset.Prod
import Mathlib.Data.Finset.SymmDiff
import Mathlib.Data.Fintype.Pi
import Mathlib.Data.Int.Basic
import Mathlib.Data.List.Permutation
import Mathlib.Data.ZMod.Basic
import Mathlib.Tactic.Abel
import Mathlib.Tactic.FinCases
import Mathlib.Tactic.NormNum
import Mathlib.Tactic.Ring
import Mathlib.Tactic.Tauto
import Definitions.Def_Couret_ExtractionBasics_37ec1603f738
set_option autoImplicit false
namespace Couret.InterIA.SingletonNecessity
open Finset
variable {G : Type*} [AddCommGroup G] [DecidableEq G]
Formal statement
theorem supportRight_reindex (x : Fin 6 → G) (p : Fin 6 → Fin 6)
(hp : ({3,4,5}:Finset (Fin 6)).image p={3,4,5}) :
supportRight (reindex x p)=supportRight x := by sorry
end Couret.InterIA.SingletonNecessity
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/abelian-singleton-necessity-20261104/formal/RelabelBasics.lean, lines 33–39; source file SHA-256 ad051970dc8003cca85b8ddbc013f1c47aae55ee0fcba53af030e41581191f05; theorem Couret.InterIA.SingletonNecessity.supportRight_reindex