Pairwise-Skew Block Statistics Do Not Control Parity Value¶
Claim/Theorem¶
Keep the notation of [[exact-optimal-quotient-family-problem-reduces-to-linear-matroid-block-packing.md]]. Let L \sqcup R = Q be a qubit cut, and consider the represented-matroid block-packing instance on the local quotient blocks W_v(L).
Then pairwise block statistics are too weak to force a large block-packing or linear-matroid-parity value.
More precisely:
-
Pairwise skewness of
2-dimensional blocks does not imply that they form a direct-sum family. There exist2-dimensional subspaces\[ U,V,W \le \mathbf F_2^4 \]such that
\[ U\cap V = U\cap W = V\cap W = \{0\}, \]but
\[ W \subseteq U+V, \]so
\[ \dim(U+V+W)=4<6=\dim U+\dim V+\dim W. \]Thus the maximum direct-sum packing weight on
{U,V,W}is only4, not6. -
Consequently, no criterion that depends only on pairwise block intersections can force linear
\nu_H(L). In particular, the following are all insufficient by themselves:- the pairwise-intersection graph of the blocks;
- counts of pairwise-skew blocks;
- bounded multiplicity of
1-dimensional quotient directions.
The counterexample above has the strongest possible pairwise behavior:
- the pairwise-intersection graph is empty;
- every quotient line is contained in at most one block;
- yet the full block family is not direct-sum.
-
Therefore the exact missing invariant on the represented block instance is not pairwise but higher-order:
\[ H_{\mathrm{union}}(\beta): \]for every
\beta-balanced cutL, one has a construction-controlled lower bound on the ranks of unions of quotient blocks strong enough to force a direct-sum block family of total weight\Omega(|Q|).Equivalently, what is still missing is a Hall/Rado-type union-rank expansion statement for the block family, not another pairwise packing proxy.
-
The current explicit Quantum Tanner low-cut data fit this boundary exactly:
D_6does admit a saturating family of six2-dimensional blocks on its current low-lambdawitness, by [[nu-saturation-yields-adapted-triangular-basis.md]];D_4andD_8already require mixed1- and2-dimensional saturating families on their current low-lambdawitnesses, again by that node.
So a pure criterion phrased only in terms of pairwise-skew
2-blocks is already too narrow for the frontier, even before one asks for a family theorem.
Concrete counterexample:
Then:
U\cap V=\{0\}is immediate.-
If
x\in U\cap W, then\[ x=a e_1 + b e_2 = c(e_1+e_3)+d(e_2+e_4). \]Comparing
e_3ande_4coordinates givesc=d=0, hencex=0. SoU\cap W=\{0\}. - The same argument givesV\cap W=\{0\}. - But every vector ofWis already a sum of one vector fromUand one fromV, so\[ W\subseteq U+V. \]
Hence the three blocks are pairwise skew but not globally direct-sum.
This isolates the parity frontier more sharply than the previous node:
- the represented-matroid block-packing formulation is correct;
- pairwise-skew or bounded-line-multiplicity heuristics are not enough;
- the genuinely missing object is a higher-order union-rank expansion rule on block families.
Dependencies¶
- [[exact-optimal-quotient-family-problem-reduces-to-linear-matroid-block-packing.md]]
- [[packed-quotient-images-already-attain-global-cut-rank-on-small-quantum-tanner-instances.md]]
- [[nu-saturation-yields-adapted-triangular-basis.md]]
- [[local-quotient-image-span-controls-rank-accumulation.md]]
Conflicts/Gaps¶
- This node is an obstruction to pairwise criteria, not a lower-bound theorem for
\nu_H(L). - It does not prove that the explicit Quantum Tanner quotient-block instances actually realize the same higher-order concentration mechanism; it proves only that current pairwise statistics cannot rule it out.
- The node therefore sharpens the missing invariant but does not yet produce a family-level quantitative bound.
- What remains missing is a source-grounded or construction-grounded union-rank criterion on the actual Quantum Tanner quotient blocks.
Sources¶
10.48550/arXiv.2206.0757110.48550/arXiv.2508.0509510.1016/0095-8956(80)90066-0