6 Global variance of the points measurements
Throughout this chapter, \((\psi ,A,B,L)\) is an \((\varepsilon ,\delta ,\gamma )\)-good symmetric strategy for the \((m,q,d)\) low individual degree test.
Let \(G \in \mathrm{PolySub}(m,q,d)\). On the axis-parallel line-test distribution,
Expand the \(\approx _{md/q}\) norm on the weighted vector \((I\otimes (G_g)^{1/2})\lvert \psi \rangle \). Because \(B^\ell \) is a projective measurement, only those line polynomials \(f\) with \(f\ne g|_\ell \) and \(f(u)=g(u)\) contribute. Lemma 3.9 is the univariate Schwartz–Zippel wrapper used in Lean for this line-restriction event; it supplies the paper’s \(md/q\) loss, and the remaining operator sum is bounded by the fact that \(G\) is a submeasurement.
The paper proof of Lemma 6.1 bounds the collision event directly by the Schwartz–Zippel estimate. The following conditional variants instead assume this collision estimate, or one of the reindexing identities that implies it, as an explicit hypothesis. These conditional statements make explicit the intermediate estimates still needed for this route; they are not additional hypotheses in the paper statement of Lemma 6.1.
Let \(G \in \mathrm{PolySub}(m,q,d)\). On the hypercube edge distribution \((u,v) \sim C\),
Fix \(g\) and keep the weight \((G_g)^{1/2}\) on the second tensor factor throughout. On the vector \((I\otimes (G_g)^{1/2})\lvert \psi \rangle \) one has the six-step chain
The first, second, fifth, and sixth comparisons use Lemma 3.21 together with Theorem 3.25 and the good-strategy hypotheses, and the middle pair is Lemma 6.1. Lemma 3.27 sums these six weighted transports.
The local-variance bound for the point measurements is
This is the squared-norm expansion of Lemma 6.3 after summing over the polynomial outcome \(g\). The Lean proof expands the weighted operator difference, telescopes the six transports in the local variance proof, sums the resulting bounds over \(g\), and absorbs the transport-chain error into \(24\left(\varepsilon +\delta +\frac{md}{q}\right)\).
The three referenced declarations and Lemma 6.4 together provide the full polynomial-sum (cardinality-free) chain proving the equation. The chain assembly lemma localVarianceDeviation_sum_le_localVarianceOfPointsError telescopes the six operator differences via ev_sum_conjTranspose_mul_sum_le, sums over \(g\), and applies the six individual _sum bounds (including the reverse generalizeB sum) to avoid the per-polynomial cardinality blow-up.
Let \(G \in \mathrm{PolySub}(m,q,d)\). On the uniform distribution over independent \(u,v \in \mathbb {F}_q^m\),
We want to bound
For each \(g \in \mathcal{P}(m,q,d)\), define
Then
Applying Lemma 5.12 gives
The last quantity is at most \(m \cdot 24\left(\varepsilon +\delta +\frac{md}{q}\right)\) by Lemma 6.4, which is exactly 3.