The tensor product of chain complexes is a basic construction in homological algebra and in the theory of quantum CSS codes. If and are finite based chain complexes over a finite field, their tensor product is graded by total degree,
Each complex carries a basis-dependent homological distance: is the least Hamming weight of a degree- cycle that is not a boundary, with when the degree- homology vanishes. A natural candidate for the distance of the tensor product is therefore
Every nonzero pair of homology classes in complementary degrees gives a pure-tensor class of the corresponding product weight, so one always has . The substantive question is whether this upper bound is always sharp.
In the preprint Higher-Dimensional Quantum Hypergraph-Product Codes with Finite Rates, posted in 2018 and subsequently published in Physical Review Letters, Zeng and Pryadko proved that the bound is sharp when one factor is a binary one-complex. Their exact formula is Eq. (13) of the arXiv version and is the capstone theorem of the Prove2Me mission Higher-Dimensional Quantum Hypergraph-Product Codes with Finite Rates. The present formalization is a direct sequel: it retains the same definitions and degree conventions while examining what happens when the one-complex restriction is removed.
Zeng and Pryadko later considered arbitrary finite chain complexes over arbitrary finite fields in Minimal distances for certain quantum product codes and tensor products of chain complexes, published in 2020. In the corresponding arXiv preprint, Conjecture 18 asserts the unrestricted equality
The conjecture is appealing because it would make tensor-product distance completely compositional: the degreewise distances of the two factors would determine the distance of their product. The obstruction is that a homology class in need not have a minimum-weight representative supported in a single bidegree. A representative spread across several summands of the total complex can be lighter than every pure-tensor representative. The purpose of this formalization is to turn that observation into a concrete, machine-checked counterexample to Conjecture 18 while preserving the valid one-complex theorem as a sharply delimited special case.
The common foundation is recorded in the Prove2Me entry Based binary chain complexes and homological distance. In particular, the boundary in degree is a map , and
The one-complex result is separately available as Eq. (13) — Exact distance with a one-complex. The construction below uses exactly the same notion of distance, but both tensor factors are genuine three-term complexes.
Begin with binary CSS check maps
assumed surjective and satisfying . Suppose there are logical vectors such that
The check maps determine two dual three-term complexes
Their degree-two tensor space has three bidegree summands, corresponding to , , and . Under the natural matrix identifications, consider the element whose three blocks are
The CSS orthogonality relations make this element a cycle. Its pairing with the chosen logical vectors certifies that it is not a boundary. Its Hamming weight is exactly , whereas the componentwise candidate in degree two reduces to
Consequently, any CSS datum satisfying
produces the strict inequality . For orientation, a binary quantum Golay CSS presentation with parameters has , giving the numerical comparison . The formal proof must supply an explicit CSS instance and verify its algebraic and distance properties, rather than relying on the parameter notation alone.
The first milestone proves the general certificate: for every CSS datum satisfying the hypotheses above, the element is a nontrivial degree-two cycle of weight , and the componentwise minimum is .
The second milestone constructs and verifies one explicit CSS datum for which . This is the step that turns the general mechanism into an actual counterexample.
The capstone packages the construction as the direct existential statement
Thus the final theorem is not conditional on the existence of suitable code data: it exhibits finite based binary chain complexes for which the equality proposed in Conjecture 18 fails.
The counterexample concerns only the unrestricted passage from a one-complex factor to two arbitrary bounded complexes. It does not conflict with Zeng and Pryadko's Eq. (13), whose one-complex hypothesis rules out the three-bidegree interaction used here.
The broader literature also indicates why additional structure matters. Bravyi and Hastings introduced homological-product codes and analyzed logical representatives in product constructions; Audoux and Couvreur developed tensor products of CSS codes through chain-complex methods. More recently, Akhmechet et al. discussed the Zeng–Pryadko conjecture in the structured setting of complexes derived from Khovanov homology, while Berthusen et al. restated it as Conjecture 5.1 in their study of automorphism gadgets. Golowich and Guruswami obtained strong distance guarantees for iterated homological products under expansion and local-testability hypotheses. These results are compatible with the proposed counterexample: they concern special families or impose hypotheses that are absent from Conjecture 18.
Besides settling the unrestricted statement, the formalization isolates a reusable obstruction. It shows precisely how a low-weight class assembled across several bidegrees can evade a formula based only on the degreewise distances of the factors. This distinction should help guide corrected formulations in which an exact product formula, or a useful lower bound, is recovered from additional geometric, expansion, or local-testability assumptions.
The main formal issues are mathematically substantive rather than presentational: the proof must respect the endpoint conventions for the boundary maps, distinguish a cycle from a non-boundary, compare finite weights with -valued distances, and verify a concrete strict-gap instance. Making each of these points explicit is especially important here, because an indexing shift or a merely conditional existence statement would no longer constitute a refutation of the conjecture as stated.
namespace ZengPryadkoConjecture18Counterexample
theorem refutation :
∃ (A B : BasedBinaryChainComplex),
tensorProductDistanceAt A B 2 <
componentDistanceMinimum A B 2 := by sorry
end ZengPryadkoConjecture18CounterexampleThere exist two finite-length based binary chain complexes and for which the homological distance of their full tensor product in degree two is strictly smaller than the minimum of the products of complementary factor distances:
Thus the universal equality proposed as Conjecture 18 by Zeng and Pryadko fails already for finite based chain complexes over in total degree two. The theorem does not concern the one-complex special case covered by their Eq. (13).
No open leaves. Every sub-goal is proved or awaiting decomposition.