Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Recompression error when the queried answer is retained

Proved
WeldedPath.retained_record_recompression

by dmilosch · Nov 17, 2026 · Mathlib 0df444a (Lean v4.33.1)

compressed-oraclesfinite-dimensional-hilbert-spacesquantum-query-complexity

For a partial permutation I on s points and a known record I(x)=y, the canonical compression primitive satisfies

∥(pCx−1)∣I⟩∥2=2s−∣I∣+1.\|(pC_x-1)|I\rangle\|^2=\frac{2}{s-|I|+1}.∥(pCx​−1)∣I⟩∥2=s−∣I∣+12​.

More generally, let c range over an arbitrary finite coherent control register, let x(c),y(c) be the query and retained answer, and let ψ be supported on pairs (c,I) with I(x(c))=y(c) and |I|≤r≤s. Then

∥∑c∣c⟩⟨c∣⊗(pCx(c)−1) ψ∥≤2s−r+1 ∥ψ∥.\|\sum_c |c\rangle\langle c|\otimes(pC_{x(c)}-1)\,\psi\| \le \sqrt{\frac{2}{s-r+1}}\,\|\psi\|.∥c∑​∣c⟩⟨c∣⊗(pCx(c)​−1)ψ∥≤s−r+12​​∥ψ∥.

The second bound covers arbitrary coherent superpositions and arbitrary extra information in c. The retained answer is an explicit support condition, not a measurement assumption.

Preamble
import Definitions.Def_WeldedPath_exactCpO

set_option autoImplicit false
Formal statement
namespace WeldedPath

universe u

theorem retained_record_recompression :
    ∀ s : ℕ,
      (∀ (I : InjDb s) (x y : Fin s), I x = some y →
        ‖(pC s x - 1) (ket I)‖ ^ 2 = 2 / ((s - I.size + 1 : ℕ) : ℝ)) ∧
      (∀ (C : Type u) [Fintype C] [DecidableEq C]
        (r : ℕ), r ≤ s → ∀ (x y : C → Fin s) (ψ : Hil (C × InjDb s)),
        (∀ c I, ψ (c, I) ≠ 0 → I (x c) = some (y c) ∧ I.size ≤ r) →
        ‖controlled (fun c => pC s (x c) - 1) ψ‖ ≤
          Real.sqrt (2 / ((s - r + 1 : ℕ) : ℝ)) * ‖ψ‖) := by
  sorry

end WeldedPath
Source
Carolan, Childs, Coudron, Gilani, Miloschewsky, Podder, Algorithmic Wave-Particle Duality: Pathfinding in Welded Trees is Hard, https://arxiv.org/html/2611.05912v1, Observation 2.5 and Proposition 2.6. The coherent-control version allows the query point to depend on the control.

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