Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 7 — two endpoints with different decoded labels

Proved
SpaceReset.Hardness.theorem_7

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

dimension-boundsp2o-batch-stoc27ap2o-gran-per-chapterp2o-plan-paperp2o-v1quantum-information

Let E0,E1,YE_0,E_1,YE0​,E1​,Y be finite-dimensional, di=dim⁡Eid_i=\dim E_idi​=dimEi​. Let ξx≥0\xi_x\ge0ξx​≥0 (x∈[A]x\in[A]x∈[A]) act on E0E_0E0​ with ∑xTr⁡ξx=1\sum_x\operatorname{Tr}\xi_x=1∑x​Trξx​=1, and let V:E0→Y⊗E1V:E_0\to Y\otimes E_1V:E0​→Y⊗E1​ be an isometry. Let f:[A]→[B]f:[A]\to[B]f:[A]→[B] have exactly A/BA/BA/B preimages of every element, and let {Ex}x∈[A]\{E_x\}_{x\in[A]}{Ex​}x∈[A]​, {Fz}z∈[B]\{F_z\}_{z\in[B]}{Fz​}z∈[B]​ be POVMs on E0E_0E0​, E1E_1E1​. Put

e0=1−∑xTr⁡(Exξx),e1=1−∑xTr⁡((IY⊗Ff(x))VξxV†).e_0=1-\sum_x\operatorname{Tr}(E_x\xi_x),\qquad e_1=1-\sum_x\operatorname{Tr}\big((I_Y\otimes F_{f(x)})V\xi_xV^\dagger\big).e0​=1−x∑​Tr(Ex​ξx​),e1​=1−x∑​Tr((IY​⊗Ff(x)​)Vξx​V†).

Let ρx\rho_xρx​ be states on YYY with ∥ρx∥∞≤1/M\|\rho_x\|_\infty\le1/M∥ρx​∥∞​≤1/M, and

ΩXY=∑x∣x⟩⟨x∣⊗Tr⁡E1(VξxV†),τXY=1A∑x∣x⟩⟨x∣⊗ρx,δ=12∥Ω−τ∥1.\Omega_{XY}=\sum_x|x\rangle\langle x|\otimes\operatorname{Tr}_{E_1}(V\xi_xV^\dagger),\quad \tau_{XY}=\frac1A\sum_x|x\rangle\langle x|\otimes\rho_x,\quad \delta=\tfrac12\|\Omega-\tau\|_1.ΩXY​=x∑​∣x⟩⟨x∣⊗TrE1​​(Vξx​V†),τXY​=A1​x∑​∣x⟩⟨x∣⊗ρx​,δ=21​∥Ω−τ∥1​.

Then

d0d1 ≥ ABM [1−32δ−e0−e1]+.\sqrt{d_0d_1}\ \ge\ \sqrt{ABM}\,\Big[1-\tfrac32\delta-\sqrt{e_0}-\sqrt{e_1}\Big]_+ .d0​d1​​ ≥ ABM​[1−23​δ−e0​​−e1​​]+​.

No relation between ExE_xEx​ and Ff(x)F_{f(x)}Ff(x)​ and no rank or spectral assumption on the initializer is required. This robust two-time dimension bound is the converse engine of the space–discard frontier.

Differences from the source:

  • encoding: ‖ρ_x‖_∞ ≤ 1/M → ρ_x ≤ (1/M)·I in the Loewner order, with 0 < M; reason: for positive semidefinite ρ_x the two are equivalent; 1/M presupposes M > 0
  • encoding: f has exactly C = A/B preimages of every element → every fibre of f has size c with c·B = A; reason: same condition, stated without natural division
Preamble
import Mathlib
import Definitions.Def_WildeQIT_traceNorm
import Definitions.Def_SpaceReset_Hardness_Quantum

set_option autoImplicit false

open Matrix
open scoped MatrixOrder ComplexOrder Kronecker
Formal statement
namespace SpaceReset.Hardness

/-- Theorem 7 (Two endpoints with different decoded labels), §2.3, pp. 13–14, eq. (6). -/
theorem theorem_7 {E₀ E₁ Y : Type} [Fintype E₀] [DecidableEq E₀] [Fintype E₁] [DecidableEq E₁]
    [Fintype Y] [DecidableEq Y] (A B : ℕ) (M : ℝ) (hM : 0 < M)
    (ξ : Fin A → Matrix E₀ E₀ ℂ) (hξ : ∀ x, (ξ x).PosSemidef) (hξ1 : ∑ x, (ξ x).trace = 1)
    (V : Matrix (Y × E₁) E₀ ℂ) (hV : Vᴴ * V = 1)
    (f : Fin A → Fin B) (hf : ∀ z : Fin B, (Finset.univ.filter (fun x => f x = z)).card * B = A)
    (Ex : Fin A → Matrix E₀ E₀ ℂ) (hEx : IsPOVM Ex)
    (Fz : Fin B → Matrix E₁ E₁ ℂ) (hFz : IsPOVM Fz)
    (ρ : Fin A → Matrix Y Y ℂ) (hρ : ∀ x, IsDensity (ρ x))
    (hρM : ∀ x, ρ x ≤ ((1 / M : ℝ) : ℂ) • (1 : Matrix Y Y ℂ)) :
    let e₀ : ℝ := 1 - (∑ x, (Ex x * ξ x).trace).re
    let e₁ : ℝ := 1 - (∑ x, (((1 : Matrix Y Y ℂ) ⊗ₖ Fz (f x)) * (V * ξ x * Vᴴ)).trace).re
    let Ω : Matrix (Fin A × Y) (Fin A × Y) ℂ :=
      fun p p' => if p.1 = p'.1 then ptraceRight (V * ξ p.1 * Vᴴ) p.2 p'.2 else 0
    let τ : Matrix (Fin A × Y) (Fin A × Y) ℂ :=
      fun p p' => if p.1 = p'.1 then ((1 : ℂ) / (A : ℂ)) * ρ p.1 p.2 p'.2 else 0
    let δ : ℝ := WildeQIT.traceNorm (Ω - τ) / 2
    Real.sqrt (Fintype.card E₀ * Fintype.card E₁) ≥
      Real.sqrt (A * B * M) * max 0 (1 - (3 / 2) * δ - Real.sqrt e₀ - Real.sqrt e₁) := by sorry

end SpaceReset.Hardness
Source
Rinka Miura, STOC 2027 submission #1715 (October 2026), Theorem 7, §2.3, pp. 13–14 (eq. (6))
Human review
  • Endorsed by Shuze Chen · Nov 11, 2026

    Confirmed by the moderator at approval.

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