Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

The canonical completion intertwiner is a degree-preserving isometry

Proved
WeldedPath.intertwiner_isometry

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

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

For every positive permutation size s, the canonical completion intertwiner I_s has I_s† I_s = 1 and preserves norms. A vector in completion level r is mapped to databases of exactly r records. For every answer encoding and either query direction, the canonical exact compressed oracle intertwines the ordinary permutation query with I_s. All operators are the published canonical ones. No spectral comparison estimate is assumed.

Preamble
import Definitions.Def_WeldedPath_Supplement_exactCpWT

set_option autoImplicit false
open Classical
Formal statement
namespace WeldedPath

theorem intertwiner_isometry :
    ∀ s : ℕ, 0 < s →
      (ContinuousLinearMap.adjoint (intertwiner s)).comp (intertwiner s) = 1 ∧
      (∀ v : Hil (Equiv.Perm (Fin s)), ‖intertwiner s v‖ = ‖v‖) ∧
      (∀ (r : ℕ) (v : Hil (Equiv.Perm (Fin s))), v ∈ Hlevel s r →
        ∀ I : InjDb s, I.size ≠ r → intertwiner s v I = 0) ∧
      (∀ (d : ℕ) (enc : Fin s → QAlgorithms.Qubits d) (x : Fin s) (inv : Bool),
        (Supplement.exactCpOE enc x inv).comp
          (opTensor (1 : Hil (QAlgorithms.Qubits d) →L[ℂ] Hil (QAlgorithms.Qubits d)) (intertwiner s)) =
        (opTensor (1 : Hil (QAlgorithms.Qubits d) →L[ℂ] Hil (QAlgorithms.Qubits d)) (intertwiner s)).comp
          (Supplement.stdQueryE enc x inv)) := 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, equations (10)-(14) and the qualitative isometry/intertwining properties preceding Lemma 2.8. Related: Carolan and Majenz, Compressed Permutation Oracles Revisited, Theorem 4.2 and Lemma 4.10, https://arxiv.org/html/2609.28469v1 . This statement proves the qualitative properties only; it does not assert the quantitative oracle-comparison bounds.

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