Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§2.4.2: inverse and composition of partial-unitary approximations

Open
QAlgorithms.Papers.Independent.Intakethird100.P03.partial_precision

by Gohan · Nov 1, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

For partial unitaries, inversion preserves the source precision relation, including both domain and range inclusions. For two compatible chains with component precisions δ_j ≥ 0, specify initial domains N ⊆ Ntilde on which both chains are valid. In addition, require that the image of N under the exact composite is contained in the image of Ntilde under the approximate composite. Then the composites satisfy the full precision relation with precision ∑_j δ_j: both inclusions and the uniform vector bound ‖V_comp x − U_comp x‖ ≤ (∑_j δ_j)‖x‖ on N. The empty chain is the identity. The final-range assumption corrects a defect in the source extension; compatibility and factorwise range inclusions alone do not imply it.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakethird100_P03
Formal statement
noncomputable section

open scoped Matrix ComplexConjugate Kronecker

namespace QAlgorithms.Papers.Independent.Intakethird100.P03

open QAlgorithms.Papers.Independent.Renew46.P01 (cleanVector)

attribute [local instance] Classical.propDecidable

/-- PDF p.12: inversion preserves precision. Source correction for composition:
printed "Lemma 3 remains valid for partial unitary operators" omits a necessary
composite-range inclusion. We require that inclusion explicitly, while retaining
both component inclusions, valid chains and the full precision conclusion.
Reason: I on a line followed by I versus a small full-space rotation has close
factors but distinct composite range lines. Inversion is unchanged. -/
theorem partial_precision {I : Type*} [Fintype I] :
    (∀ (U V : PartialUnitary I) (d : ℝ), 0 ≤ d → PartialApprox V U d →
      PartialApprox V.inverse U.inverse d) ∧
    (∀ (L : ℕ) (U V : Fin L → PartialUnitary I) (d : Fin L → ℝ)
      (N Ntilde : Submodule ℂ (EuclideanSpace ℂ I)),
      (∀ j, 0 ≤ d j) → (∀ j, PartialApprox (V j) (U j) (d j)) →
      N ≤ Ntilde →
      (∀ j : Fin L, j.val = 0 → N ≤ (U j).domain) →
      (∀ j : Fin L, j.val = 0 → Ntilde ≤ (V j).domain) →
      (∀ i j : Fin L, j.val = i.val + 1 → (U i).range ≤ (U j).domain) →
      (∀ i j : Fin L, j.val = i.val + 1 → (V i).range ≤ (V j).domain) →
      (∀ x ∈ N, ∃ y ∈ Ntilde,
        partialRun (List.ofFn U) x = partialRun (List.ofFn V) y) →
      PartialSequenceApprox (List.ofFn V) (List.ofFn U) N Ntilde (∑ j, d j)) := by sorry

end QAlgorithms.Papers.Independent.Intakethird100.P03

end
Source
Quantum measurements and the Abelian Stabilizer Problem, arXiv:quant-ph/9511026v1, PDF p. 12, §2.4.2: inverse and composition of partial-unitary approximations
Read-back

What the Lean code literally says, in plain math · gpt-6.1-sol

For every finite index type III, possibly empty, put E=CIE=\mathbb C^IE=CI with its Euclidean norm. Write a partial unitary UUU as an isometric complex linear isomorphism u:DU→RUu:D_U\to R_Uu:DU​→RU​, and similarly write VVV as v:DV→RVv:D_V\to R_Vv:DV​→RV​. Say explicitly that VVV approximates UUU with bound ddd when DU⊆DVD_U\subseteq D_VDU​⊆DV​, RU⊆RVR_U\subseteq R_VRU​⊆RV​, and ∥v(x)−u(x)∥≤d∥x∥\|v(x)-u(x)\|\le d\|x\|∥v(x)−u(x)∥≤d∥x∥ for every x∈DUx\in D_Ux∈DU​. The theorem asserts two claims together. First, for all partial unitaries U,VU,VU,V and all real d≥0d\ge0d≥0, this approximation implies the corresponding approximation of their inverses: RU⊆RVR_U\subseteq R_VRU​⊆RV​, DU⊆DVD_U\subseteq D_VDU​⊆DV​, and ∥v−1(z)−u−1(z)∥≤d∥z∥\|v^{-1}(z)-u^{-1}(z)\|\le d\|z\|∥v−1(z)−u−1(z)∥≤d∥z∥ for every z∈RUz\in R_Uz∈RU​. Second, for every natural number LLL, every two families (Uj)0≤j<L(U_j)_{0\le j<L}(Uj​)0≤j<L​, (Vj)0≤j<L(V_j)_{0\le j<L}(Vj​)0≤j<L​ of partial unitaries, every family of real numbers (dj)0≤j<L(d_j)_{0\le j<L}(dj​)0≤j<L​, and every pair of subspaces N,N~⊆EN,\widetilde N\subseteq EN,N⊆E, assume that each dj≥0d_j\ge0dj​≥0, each VjV_jVj​ approximates UjU_jUj​ with bound djd_jdj​ as just expanded, N⊆N~N\subseteq\widetilde NN⊆N, N⊆DUjN\subseteq D_{U_j}N⊆DUj​​ and N~⊆DVj\widetilde N\subseteq D_{V_j}N⊆DVj​​ whenever j=0j=0j=0, and RUi⊆DUjR_{U_i}\subseteq D_{U_j}RUi​​⊆DUj​​ and RVi⊆DVjR_{V_i}\subseteq D_{V_j}RVi​​⊆DVj​​ whenever j=i+1j=i+1j=i+1. Also assume that for every x∈Nx\in Nx∈N there exists y∈N~y\in\widetilde Ny∈N such that running the UjU_jUj​ in increasing index order on xxx equals running the VjV_jVj​ in increasing index order on yyy. Then N⊆N~N\subseteq\widetilde NN⊆N, that same existential equality of runs holds, and

∀x∈N,∥RV(x)−RU(x)∥≤(∑j=0L−1dj)∥x∥.\forall x\in N,\qquad \|\mathcal R_V(x)-\mathcal R_U(x)\| \le \left(\sum_{j=0}^{L-1}d_j\right)\|x\|.∀x∈N,∥RV​(x)−RU​(x)∥≤(j=0∑L−1​dj​)∥x∥.

Here each run applies the relevant isomorphism after orthogonally projecting onto its domain at every step. The case L=0L=0L=0 is included: both runs are identities, the sum is zero, and the first-index and consecutive-index assumptions are vacuous.

Human review
  • Endorsed by Shuze Chen · Nov 1, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Gohan · Nov 1, 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