Three-identity cycle and distance certificate
ProvedZengPryadkoConjecture18Counterexample.threeIdentityCertificateLet and be surjective binary linear maps satisfying the two chain conditions and . Suppose there are vectors with , , and . Form
In degree two of , let have matrix blocks . Then is a cycle, is not a boundary, and
Moreover the degree-two component minimum is exactly
This packages the general certificate used by the counterexample and the reduction of the conjectured right-hand side to the two middle factor distances.
import Definitions.Def_ZengPryadkoConjecture18Counterexample open ZengPryadko2019
namespace ZengPryadkoConjecture18Counterexample
theorem threeIdentityCertificate {n rX rZ : ℕ}
(D : CSSSwapProductData n rX rZ) :
tensorBoundaryAt (leftComplex D) (rightComplex D) 2
(threeIdentityElement D) = 0 ∧
threeIdentityElement D ∉ LinearMap.range
(tensorBoundaryAt (leftComplex D) (rightComplex D) 3) ∧
hammingNorm (threeIdentityElement D) = rZ + n + rX ∧
tensorProductDistanceAt (leftComplex D) (rightComplex D) 2 ≤
(rZ + n + rX : ℕ) ∧
componentDistanceMinimum (leftComplex D) (rightComplex D) 2 =
chainDistanceAt (leftComplex D) 1 *
chainDistanceAt (rightComplex D) 1 := by sorry
end ZengPryadkoConjecture18CounterexampleRead-back
What the Lean code literally says, in plain math · gpt-5.6-sol
For every and every datum consisting of two -linear maps
with , , and both and surjective, together with vectors satisfying
where each transpose is the transpose of the standard-coordinate matrix, define chain complexes and by
and
with zero groups above degree and all remaining boundary maps zero. The degree- tensor-product coordinate space consists of binary words indexed by tuples with , a coordinate of , and a coordinate of . Its boundary , for , is given on an output coordinate with by
with addition in . Let be the degree- word defined by
so its , , and blocks are respectively the coordinate identity matrices of sizes , , and . For a binary word , write for the number of its nonzero coordinates. For any such complex , define
and define by the same formula using and ; the infimum of the empty set is . Also define
with the infimum and products taken in . The theorem asserts simultaneously that
The quantification includes zero values of , in which case the corresponding coordinate sets and identity blocks are empty; it does not assert that a datum exists, so parameter choices for which the displayed hypotheses are impossible—such as , when the required empty dot product cannot equal —are covered only vacuously.
Confirmed by the mission captain (proposal self-audit).