Mixed relation certificate validity for fixed block 16
ProvedCouret.InterIA.SingletonNecessity.mixedChunk16_validLet denote the fixed finite certificate list named mixedChunk16 in MatchingCertificateData; its entries are the specified stored tuples, with no additional input parameters.
Work in the free abelian group , with standard basis . Define seven label vectors by and for . A certificate is a tuple , where is a finite list of natural numbers, , and is a finite list of integers.
For the mixed relation system, use the ordered lists
For , let be the ordered row list beginning with
and followed by for , in increasing order of . Here is interpreted as the zero vector if . Thus ; the truncation and zero default are part of the relation-list definition.
Every certificate occurring in satisfies all the tests of the mixed validity predicate:
Equivalently, the conjunction of these tests over the named fixed block has Boolean value true. This certifies the recorded mixed relation identities for that block. The validity predicate does not separately test that is a permutation, its length, uniqueness of its entries, or coverage of any larger enumeration; such properties require separate statements.
import Definitions.Def_Couret_MatchingCertificateData_656be71337d8 import Mathlib.Algebra.BigOperators.Group.Finset.Basic import Mathlib.Algebra.Group.Pi.Basic import Mathlib.Data.Fintype.Pi import Mathlib.Data.Int.Basic import Mathlib.Data.List.Permutation import Definitions.Def_Couret_MatchingCertificateCore_fbb5abd3e874 set_option autoImplicit false set_option maxRecDepth 1000000 set_option maxHeartbeats 20000000 namespace Couret.InterIA.SingletonNecessity
theorem mixedChunk16_valid : mixedChunk16.all (valid true) = true := by sorry end Couret.InterIA.SingletonNecessity