Optimal binary answers give a bijection
ProvedCouret.InterIA.Fibres.probeAnswers_bijectivecouret-programmecouret-unification-20261108
Let have decidable equality, be a family of finite subsets, and a list of positions. If has finite cardinality and its membership answers at separate its members, then
given by those answers is bijective. This includes .
Preamble
import Definitions.Def_Couret_FixedMembershipProbes_e6019f9e3a1b import Mathlib.Algebra.BigOperators.Group.Finset.Basic import Mathlib.Algebra.BigOperators.Ring.Finset import Mathlib.Algebra.Field.ZMod import Mathlib.Algebra.MonoidAlgebra.Defs import Mathlib.Algebra.MonoidAlgebra.MapDomain import Mathlib.Data.Fin.Tuple.Basic import Mathlib.Data.Finset.Insert import Mathlib.Data.Finset.Prod import Mathlib.Data.Finset.SymmDiff import Mathlib.Data.Fintype.EquivFin import Mathlib.Data.Set.Card import Mathlib.Data.ZMod.Basic import Mathlib.Data.ZMod.Units import Mathlib.FieldTheory.Finiteness import Mathlib.GroupTheory.OrderOfElement import Mathlib.LinearAlgebra.AffineSpace.AffineSubspace.Defs import Mathlib.Tactic.Abel import Mathlib.Tactic.FinCases import Mathlib.Tactic.NormNum import Mathlib.Tactic.Ring import Mathlib.Tactic.Tauto import Definitions.Def_Couret_BinaryAffineFibre_5ba9c7ff8364 import Mathlib.Data.Fin.Tuple.Basic import Mathlib.Data.Fintype.EquivFin set_option autoImplicit false namespace Couret.InterIA.Fibres open Finset Couret.InterIA.Parity
Formal statement
theorem probeAnswers_bijective {α : Type*} [DecidableEq α] {d : ℕ}
(P : Set (Finset α)) (q : Fin d → α) (hc : P.ncard=2^d) (hq : ProbeSeparates P q) :
Function.Bijective (fun T : P => probeAnswers q T.val) := by sorry
end Couret.InterIA.Fibres
Source
Alexandre Couret, Complete four-point convolution fibres and predictive observations on C12: supplementary proof archive, https://zenodo.org/records/23981750; archive Couret_Supplement_Fibres_Cayley_20261105.zip, SHA-256 a12dde197808771ce3beb81d9e6ff1ab2074db9b06695b6816b0f28adbe8be8b; file fibres/lean/FixedMembershipProbes.lean, lines 160–172; source file SHA-256 ad66985fbc01dce4c10be3faf60eae345c3ccda9af3d563dfd2ae2e57262cb82; theorem Couret.InterIA.Fibres.probeAnswers_bijective