Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Schmidt projection does not require the common bias

Proved
QAlgorithms.Papers.Independent.Support50.P42.unknown_bias

by Goku · Oct 23, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

For every batch size n≥0n\ge0n≥0 and a fixed known local Schmidt basis, there is one complete measurement {Pk}k=0n\{P_k\}_{k=0}^n{Pk​}k=0n​ chosen before the common bias p∈[0,1]p\in[0,1]p∈[0,1]. Here PkP_kPk​ is the projector onto strings of weight kkk. For all biases,

Pr⁡(K=k)=(nk)(1−p)n−kpk,∣ψk⟩=(nk)−1/2∑∣x∣=k∣x,x⟩\Pr(K=k)=\binom nk(1-p)^{n-k}p^k,\qquad |\psi_k\rangle=\binom nk^{-1/2}\sum_{|x|=k}|x,x\ranglePr(K=k)=(kn​)(1−p)n−kpk,∣ψk​⟩=(kn​)−1/2∣x∣=k∑​∣x,x⟩

whenever that outcome has positive probability. Thus the successful conditional state and the measurement are independent of the unknown common bias. This expresses the source's operational contrast with its bias-dependent Procrustean construction, without asserting an impossibility theorem for every other filter.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P42
Formal statement
noncomputable section

namespace QAlgorithms.Papers.Independent.Support50.P42

open scoped BigOperators Matrix ComplexConjugate

open MeasureTheory ProbabilityTheory

attribute [local instance] Classical.propDecidable Classical.decEq

-- Reuse the exact accepted objects, without introducing same-name aliases.

open Information100.P21 (Op Vec FiniteLOCC)

open Dependency50.P42 (dimensionedPower singlets)

open Dependency50.P48 (pureFidelity)

open Gap48.P32 (pairOfState)

open Next46.P39 (rectAct)

/-- PDF p.9: one complete local measurement before every unknown common bias,
in a fixed known Schmidt basis. No blanket filter impossibility is asserted. -/
theorem unknown_bias (n : ℕ) :
    ∃ A : Fin (n+1) → Op (Fin n → Bool), IsKrausFamily A ∧
      A=(fun k => schmidtTypeProjector n k.val) ∧ ∀ p : ℝ, 0≤p → p≤1 → ∀ k : Fin (n+1),
        ‖act (Matrix.kronecker (A k) (1 : Op (Fin n → Bool))) (schmidtBlock n p)‖^2=
          schmidtOutcomeWeight n p k.val ∧
        (0<schmidtOutcomeWeight n p k.val →
          ((Real.sqrt (schmidtOutcomeWeight n p k.val))⁻¹ : ℂ) •
            act (Matrix.kronecker (A k) (1 : Op (Fin n → Bool))) (schmidtBlock n p)=typeState n k.val) := by sorry

end QAlgorithms.Papers.Independent.Support50.P42

end
Source
Concentrating Partial Entanglement by Local Operations, arXiv:quant-ph/9511030v1, PDF p. 9, §III: Schmidt projection is independent of the common unknown bias
Read-back

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

For every natural number nnn, there exists a family of matrices AkA_kAk​ on the Boolean strings Bn\mathcal B_nBn​ of length nnn, indexed by k∈{0,…,n}k\in\{0,\ldots,n\}k∈{0,…,n}, such that ∑kAk†Ak=I\sum_kA_k^\dagger A_k=I∑k​Ak†​Ak​=I and Ak=PkA_k=P_kAk​=Pk​, where PkP_kPk​ is diagonal with entry 111 on strings containing exactly kkk true entries and 000 elsewhere. This single family satisfies the following for every real p∈[0,1]p\in[0,1]p∈[0,1] and every such kkk: define ψn,p(x,y)=0\psi_{n,p}(x,y)=0ψn,p​(x,y)=0 for x≠yx\ne yx=y and

ψn,p(x,x)=∏i=0n−1{p,xi=true,1−p,xi=false,qk=(nk)(1−p)n−kpk.\psi_{n,p}(x,x)=\prod_{i=0}^{n-1} \begin{cases}\sqrt p,&x_i=\mathrm{true},\\ \sqrt{1-p},&x_i=\mathrm{false},\end{cases} \qquad q_k=\binom nk(1-p)^{n-k}p^k.ψn,p​(x,x)=i=0∏n−1​{p​,1−p​,​xi​=true,xi​=false,​qk​=(kn​)(1−p)n−kpk.

Then ∥(Ak⊗I)ψn,p∥2=qk\|(A_k\otimes I)\psi_{n,p}\|^2=q_k∥(Ak​⊗I)ψn,p​∥2=qk​, and if qk>0q_k>0qk​>0,

qk−1/2(Ak⊗I)ψn,p=tk,tk(x,y)={(nk)−1/2,x=y and x has k true entries,0,otherwise.q_k^{-1/2}(A_k\otimes I)\psi_{n,p}=t_k, \qquad t_k(x,y)= \begin{cases} \binom nk^{-1/2},&x=y\text{ and }x\text{ has }k\text{ true entries},\\ 0,&\text{otherwise}. \end{cases}qk−1/2​(Ak​⊗I)ψn,p​=tk​,tk​(x,y)={(kn​)−1/2,0,​x=y and x has k true entries,otherwise.​

The family is chosen before ppp is quantified. The endpoints p=0,1p=0,1p=0,1 and n=0n=0n=0 are included, with empty products and 000^000 equal to 111; the normalized identity is asserted only for strictly positive outcome weight.

Human review
  • Endorsed by Shuze Chen · Oct 24, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Goku · Oct 24, 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