Validity of mixed integer-lattice certificates in block 75
ProvedCouret.InterIA.SingletonNecessity.mixedChunk75_validEvery certificate in the fixed explicit list Couret.InterIA.SingletonNecessity.mixedChunk75 in MatchingCertificateData satisfies the mixed certificate validity test; this list contains 64 records. A certificate is a quadruple (p,i,j,c), with p a list of natural-number indices, i,j natural numbers and c a list of integers. Work in the integer lattice ℤ⁶ with standard basis e₀,…,e₅, and put ℓ₀=0 and ℓᵣ₊₁=eᵣ for 0≤r<6. Define the ordered lists L=(e₀,e₁,e₂,e₀+e₁,e₀+e₂,e₁+e₂,2e₀) and R=(e₃,e₄,e₅,e₃+e₄,e₃+e₅,e₄+e₅,2e₃), indexed from zero. The relation list A(p) begins with 2(e₀−e₁), 2(e₃−e₄), 2(e₂−e₅), followed, in order, by Lₜ−Rₚₜ for entries of the zipped lists L and p. In this fixed block every p has seven entries in {0,…,6}, so A(p) has ten rows. For every record in the block, all three requirements hold: i<j<7; the coefficient list c has the same length as A(p); and the integer linear combination ∑ᵣ cᵣA(p)ᵣ equals ℓᵢ−ℓⱼ in ℤ⁶. These are precisely the tests in valid(true); permutation validity is not an additional test in that predicate. Equivalently, the Boolean conjunction obtained by applying valid(true) to the entire specified list is true.
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 mixedChunk75_valid : mixedChunk75.all (valid true) = true := by sorry end Couret.InterIA.SingletonNecessity