Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Equation (24) — joint-law symmetry, marginals and square-root validity

Proved
CompressedOracleDuality.LabelSymmetric.equation_24

by mikedeng1 · Nov 8, 2026 · Mathlib 0df444a (Lean v4.33.1)

complexity-theorycompressed-oraclep2o-batch-stoc27ap2o-gran-per-chapterp2o-plan-paperp2o-strengthenedp2o-v1quantum-information

Let GGG be a positive semidefinite trace-one matrix on compressed databases. Let p(D~,D)=∣(G)D~,D∣2p(\widetilde D,D)=|(\sqrt G)_{\widetilde D,D}|^2p(D,D)=∣(G​)D,D​∣2. Then

p(D1,D2)=p(D2,D1),∑D2p(D1,D2)=GD1,D1,∑D1p(D1,D2)=GD2,D2.p(D_1,D_2)=p(D_2,D_1),\quad\sum_{D_2}p(D_1,D_2)=G_{D_1,D_1},\quad\sum_{D_1}p(D_1,D_2)=G_{D_2,D_2}.p(D1​,D2​)=p(D2​,D1​),D2​∑​p(D1​,D2​)=GD1​,D1​​,D1​∑​p(D1​,D2​)=GD2​,D2​​.

If moreover GGG has image in the valid subspace, then so does G\sqrt GG​. Thus the two database marginals agree with the standard database distribution, and the validity constraint is available on the square root itself.

Differences from the source:

  • encoding: N = 2ⁿ with n-bit input and label registers → Fin (2^n) inputs and Qubits n labels; reason: these bases are bijective; addition on labels is bitwise XOR
  • generalization: G is the Gram matrix of a joint adversary–oracle state → any positive semidefinite trace-one matrix on databases; reason: every such matrix has a finite coefficient factorization, so it represents exactly such a state without assuming a query history
  • generalization: standing N ≥ 64 → all n ≥ 0 in this algebraic or information statement; reason: the finite matrix identity and measurement bound do not use the lower bound on N and include every source instance
  • encoding: diagonal entry G_{D,D} as a probability → real part (G D D).re; reason: diagonal entries of a positive semidefinite matrix are real
Preamble
import Definitions.Def_CompressedOracleDuality_LabelSymmetric_Database

open QAlgorithms
open scoped BigOperators MatrixOrder ComplexOrder

noncomputable section
Formal statement
namespace CompressedOracleDuality.LabelSymmetric

/-- (24), p.15, together with the validity of the square root in the same paragraph. -/
theorem equation_24 {n : ℕ} (G : DBMatrix n) (hG : G.PosSemidef)
    (htr : G.trace = 1) :
    (∀ D₁ D₂, jointLaw G (D₁, D₂) = jointLaw G (D₂, D₁)) ∧
    (∀ D₁, ∑ D₂, jointLaw G (D₁, D₂) = (G D₁ D₁).re) ∧
    (∀ D₂, ∑ D₁, jointLaw G (D₁, D₂) = (G D₂ D₂).re) ∧
    (ValidMatrix G → ValidMatrix (sqrtGram G)) := by sorry

end CompressedOracleDuality.LabelSymmetric
Source
Ding and Zhandry, Compressed Oracle Duality: A simple framework for knowing what quantum adversaries know, October 30, 2026 preprint, arXiv:submit/8306656 [quant-ph], STOC 2027 submission #94, SHA-256 6614c6a707d45eff1e475fa25c9c0d22747adf304a0680ebf79d2bd118122daa, https://github.com/sigact-stoc/stoc2027/releases/download/papers-1/94.pdf, p. 15, paragraph containing (24)
Human review
  • Endorsed by Shuze Chen · Nov 8, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Nov 8, 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 paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me