Prove2Me
Navigate
DiscoverFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Three-identity cycle and distance certificate

Proved
ZengPryadkoConjecture18Counterexample.threeIdentityCertificate

by Rui Chao · Sep 11, 2026 · Mathlib 0df444a (Lean v4.33.1)

codingtheorycounterexamplehomologicalalgebraquantumerrorcorrectiontensorproducts

Let HX:F2n→F2rXH_X:\mathbb F_2^n\to\mathbb F_2^{r_X}HX​:F2n​→F2rX​​ and HZ:F2n→F2rZH_Z:\mathbb F_2^n\to\mathbb F_2^{r_Z}HZ​:F2n​→F2rZ​​ be surjective binary linear maps satisfying the two chain conditions HXHZT=0H_XH_Z^T=0HX​HZT​=0 and HZHXT=0H_ZH_X^T=0HZ​HXT​=0. Suppose there are vectors x,z∈F2nx,z\in\mathbb F_2^nx,z∈F2n​ with HZx=0H_Zx=0HZ​x=0, HXz=0H_Xz=0HX​z=0, and x⋅z=1x\cdot z=1x⋅z=1. Form

A: F2rX←HXF2n←HZTF2rZ,B: F2rZ←HZF2n←HXTF2rX.A:\ \mathbb F_2^{r_X}\xleftarrow{H_X}\mathbb F_2^n\xleftarrow{H_Z^T}\mathbb F_2^{r_Z}, \qquad B:\ \mathbb F_2^{r_Z}\xleftarrow{H_Z}\mathbb F_2^n\xleftarrow{H_X^T}\mathbb F_2^{r_X}.A: F2rX​​HX​​F2n​HZT​​F2rZ​​,B: F2rZ​​HZ​​F2n​HXT​​F2rX​​.

In degree two of A⊗BA\otimes BA⊗B, let ccc have matrix blocks (IrZ,In,IrX)(I_{r_Z},I_n,I_{r_X})(IrZ​​,In​,IrX​​). Then ccc is a cycle, ccc is not a boundary, and

wt⁡(c)=rZ+n+rX,d2(A⊗B)≤rZ+n+rX.\operatorname{wt}(c)=r_Z+n+r_X, \qquad d_2(A\otimes B)\le r_Z+n+r_X.wt(c)=rZ​+n+rX​,d2​(A⊗B)≤rZ​+n+rX​.

Moreover the degree-two component minimum is exactly

m2(A,B)=d1(A)d1(B).m_2(A,B)=d_1(A)d_1(B).m2​(A,B)=d1​(A)d1​(B).

This packages the general certificate used by the counterexample and the reduction of the conjectured right-hand side to the two middle factor distances.

Preamble
import Definitions.Def_ZengPryadkoConjecture18Counterexample

open ZengPryadko2019
Formal statement
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 ZengPryadkoConjecture18Counterexample
Source
Rui Chao, counterexample construction (unpublished note, 2026), based on the full bounded tensor-product setting of Zeng--Pryadko Conjecture 18, https://arxiv.org/abs/2007.12152v3
Read-back

What the Lean code literally says, in plain math · gpt-5.6-sol

For every n,rX,rZ∈Nn,r_X,r_Z\in\mathbb Nn,rX​,rZ​∈N and every datum DDD consisting of two F2\mathbb F_2F2​-linear maps

X:F2 n→F2 rX,Z:F2 n→F2 rZ,X:\mathbb F_2^{\,n}\to\mathbb F_2^{\,r_X}, \qquad Z:\mathbb F_2^{\,n}\to\mathbb F_2^{\,r_Z},X:F2n​→F2rX​​,Z:F2n​→F2rZ​​,

with XZT=0XZ^{\mathsf T}=0XZT=0, ZXT=0ZX^{\mathsf T}=0ZXT=0, and both XXX and ZZZ surjective, together with vectors ℓX,ℓZ∈F2 n\ell_X,\ell_Z\in\mathbb F_2^{\,n}ℓX​,ℓZ​∈F2n​ satisfying

ZℓX=0,XℓZ=0,∑i∈Fin⁡(n)ℓX(i)ℓZ(i)=1in F2=Z/2Z,Z\ell_X=0,\qquad X\ell_Z=0,\qquad \sum_{i\in\operatorname{Fin}(n)}\ell_X(i)\ell_Z(i)=1 \quad\text{in }\mathbb F_2=\mathbb Z/2\mathbb Z,ZℓX​=0,XℓZ​=0,i∈Fin(n)∑​ℓX​(i)ℓZ​(i)=1in F2​=Z/2Z,

where each transpose is the transpose of the standard-coordinate matrix, define chain complexes AAA and BBB by

(A0,A1,A2)=(F2 rX,F2 n,F2 rZ),∂1A=X,∂2A=ZT,(A_0,A_1,A_2)=(\mathbb F_2^{\,r_X},\mathbb F_2^{\,n},\mathbb F_2^{\,r_Z}), \quad \partial^A_1=X,\quad \partial^A_2=Z^{\mathsf T},(A0​,A1​,A2​)=(F2rX​​,F2n​,F2rZ​​),∂1A​=X,∂2A​=ZT,

and

(B0,B1,B2)=(F2 rZ,F2 n,F2 rX),∂1B=Z,∂2B=XT,(B_0,B_1,B_2)=(\mathbb F_2^{\,r_Z},\mathbb F_2^{\,n},\mathbb F_2^{\,r_X}), \quad \partial^B_1=Z,\quad \partial^B_2=X^{\mathsf T},(B0​,B1​,B2​)=(F2rZ​​,F2n​,F2rX​​),∂1B​=Z,∂2B​=XT,

with zero groups above degree 222 and all remaining boundary maps zero. The degree-jjj tensor-product coordinate space consists of binary words indexed by tuples (p,q,a,b)(p,q,a,b)(p,q,a,b) with p+q=jp+q=jp+q=j, aaa a coordinate of ApA_pAp​, and bbb a coordinate of BqB_qBq​. Its boundary δj\delta_jδj​, for j≥1j\ge 1j≥1, is given on an output coordinate with p+q=j−1p+q=j-1p+q=j−1 by

(δju)p,q,a,b=(∂p+1A(a′↦up+1,q,a′,b))a+(∂q+1B(b′↦up,q+1,a,b′))b,(\delta_j u)_{p,q,a,b} = \left(\partial^A_{p+1} \bigl(a'\mapsto u_{p+1,q,a',b}\bigr)\right)_a + \left(\partial^B_{q+1} \bigl(b'\mapsto u_{p,q+1,a,b'}\bigr)\right)_b,(δj​u)p,q,a,b​=(∂p+1A​(a′↦up+1,q,a′,b​))a​+(∂q+1B​(b′↦up,q+1,a,b′​))b​,

with addition in F2\mathbb F_2F2​. Let eee be the degree-222 word defined by

ep,q,a,b={1,if the natural-number values of a and b are equal,0,otherwise,e_{p,q,a,b}= \begin{cases} 1,&\text{if the natural-number values of }a\text{ and }b\text{ are equal},\\ 0,&\text{otherwise}, \end{cases}ep,q,a,b​={1,0,​if the natural-number values of a and b are equal,otherwise,​

so its (2,0)(2,0)(2,0), (1,1)(1,1)(1,1), and (0,2)(0,2)(0,2) blocks are respectively the coordinate identity matrices of sizes rZr_ZrZ​, nnn, and rXr_XrX​. For a binary word uuu, write wt⁡(u)\operatorname{wt}(u)wt(u) for the number of its nonzero coordinates. For any such complex KKK, define

dj(K)=sInf⁡{w∈N∪{∞} | ∃u∈Kj, ∂jKu=0, u∉im⁡(∂j+1K), w=wt⁡(u)},d_j(K)=\operatorname{sInf} \left\{ w\in\mathbb N\cup\{\infty\}\ \middle|\ \exists u\in K_j,\ \partial^K_j u=0,\ u\notin\operatorname{im}(\partial^K_{j+1}),\ w=\operatorname{wt}(u) \right\},dj​(K)=sInf{w∈N∪{∞} ​ ∃u∈Kj​, ∂jK​u=0, u∈/im(∂j+1K​), w=wt(u)},

and define d2(A⊗B)d_2(A\otimes B)d2​(A⊗B) by the same formula using δ2\delta_2δ2​ and δ3\delta_3δ3​; the infimum of the empty set is ∞\infty∞. Also define

m2(A,B)=sInf⁡{d0(A)d2(B), d1(A)d1(B), d2(A)d0(B)},m_2(A,B)=\operatorname{sInf} \left\{ d_0(A)d_2(B),\ d_1(A)d_1(B),\ d_2(A)d_0(B) \right\},m2​(A,B)=sInf{d0​(A)d2​(B), d1​(A)d1​(B), d2​(A)d0​(B)},

with the infimum and products taken in N∪{∞}\mathbb N\cup\{\infty\}N∪{∞}. The theorem asserts simultaneously that

δ2e=0,e∉im⁡(δ3),wt⁡(e)=rZ+n+rX,\delta_2e=0,\qquad e\notin\operatorname{im}(\delta_3),\qquad \operatorname{wt}(e)=r_Z+n+r_X,δ2​e=0,e∈/im(δ3​),wt(e)=rZ​+n+rX​, d2(A⊗B)≤rZ+n+rX,m2(A,B)=d1(A)d1(B).d_2(A\otimes B)\le r_Z+n+r_X, \qquad m_2(A,B)=d_1(A)d_1(B).d2​(A⊗B)≤rZ​+n+rX​,m2​(A,B)=d1​(A)d1​(B).

The quantification includes zero values of n,rX,rZn,r_X,r_Zn,rX​,rZ​, in which case the corresponding coordinate sets and identity blocks are empty; it does not assert that a datum DDD exists, so parameter choices for which the displayed hypotheses are impossible—such as n=0n=0n=0, when the required empty dot product cannot equal 111—are covered only vacuously.

Human review
  • Endorsed by Shuze Chen · Sep 11, 2026

  • Endorsed by Rui Chao · Sep 11, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me