Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Local packet measurements update the residual common-phase law by Bayes rule

Open
QAlgorithms.Papers.Independent.Intakenext100.P33.bayesianPackets_update

by Gohan · Oct 31, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

Let a≥0a\ge0a≥0, and start with ρK+M(a)\rho_{K+M}(a)ρK+M​(a). On each of the first KKK packets perform a finite-outcome local quantum measurement, specified by bounded Kraus operators Ai,d,rA_{i,d,r}Ai,d,r​ with a countable internal index rrr and strong completeness ∑d,rAi,d,r†Ai,d,r=I\sum_{d,r}A_{i,d,r}^{\dagger}A_{i,d,r}=I∑d,r​Ai,d,r†​Ai,d,r​=I. Fix an observed outcome string D=(di)i<KD=(d_i)_{i<K}D=(di​)i<K​. Construct its effects Ei,di=∑rAi,di,r†Ai,di,rE_{i,d_i}=\sum_r A_{i,d_i,r}^{\dagger}A_{i,d_i,r}Ei,di​​=∑r​Ai,di​,r†​Ai,di​,r​ from their convergent occupation sums. Write Pθ=∣aeiθ⟩⟨aeiθ∣P_\theta=|ae^{i\theta}\rangle\langle ae^{i\theta}|Pθ​=∣aeiθ⟩⟨aeiθ∣ and define the actual Born likelihood and evidence by

LD(θ)=∏i<Ktr⁡(Ei,diPθ),Z=∫02πLD(θ)dθ2π.L_D(\theta)=\prod_{i<K}\operatorname{tr}(E_{i,d_i}P_\theta),\qquad Z=\int_0^{2\pi}L_D(\theta)\frac{d\theta}{2\pi}.LD​(θ)=i<K∏​tr(Ei,di​​Pθ​),Z=∫02π​LD​(θ)2πdθ​.

Assume Z>0Z>0Z>0. Apply the tensor Kraus instrument to the first KKK packets, leaving MMM packets untouched, sum its internal branches in trace norm, and trace out the measured packets. This constructs an unnormalized residual RDR_DRD​; the actual outcome probability is ZZZ, and

RD=∫02πLD(θ)Pθ⊗Mdθ2π,RDZ=∫Pθ⊗M dλD(θ),dλD=LDZdθ2π.R_D=\int_0^{2\pi}L_D(\theta)P_\theta^{\otimes M}\frac{d\theta}{2\pi},\qquad \frac{R_D}{Z}=\int P_\theta^{\otimes M}\,d\lambda_D(\theta), \quad d\lambda_D=\frac{L_D}{Z}\frac{d\theta}{2\pi}.RD​=∫02π​LD​(θ)Pθ⊗M​2πdθ​,ZRD​​=∫Pθ⊗M​dλD​(θ),dλD​=ZLD​​2πdθ​.

All integral, Kraus-sum, effect and partial-trace constructions are genuine trace-class or bounded-operator realizations. The posterior law has mass one and RD/ZR_D/ZRD​/Z is a normalized density. Each effect's Born weight equals its convergent sum of Kraus output norm squares. The residual consequently depends only on effects, regardless of their local Kraus realization.

This is finite-data quantum conditioning, with no exact finite-data phase identification or purity conclusion. The empty measurement string has likelihood one; M=0M=0M=0 means a scalar residual.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P33
Formal statement
noncomputable section

namespace QAlgorithms.Papers.Independent.Intakenext100.P33

open Filter MeasureTheory

open scoped Topology Matrix ComplexConjugate

attribute [local instance] Classical.propDecidable

open QAlgorithms.Papers.Independent.Dependency50.P39

-- Accepted scalar phase; positive exponential, differing only by commuting scalars.

open QAlgorithms.Papers.Independent.Information100.P75 (phase)

/-- arXiv:quant-ph/0111157v1, PDF p.5, Eqs.(22)–(23).
Actual local quantum instruments on the first K packets give the computed
likelihood, evidence and posterior on M untouched packets. Arbitrary countable
internal Kraus realizations are allowed; after tracing the measured packets,
the answer depends only on the selected effects. Evidence must be positive.
K=0 and M=0 respectively mean no data and the scalar residual density. -/
theorem bayesianPackets_update {K M O : ℕ} (a : ℝ) (ha : 0 ≤ a)
    (A : Fin K → FockLocalInstrument O) (d : Fin K → Fin O)
    (hZ : 0 < packetEvidence A d a) :
    (∀ i : Fin K,
      HasFockMatrix (localEffect (A i) (d i)) (fun m n => ∑' k : ℕ × ℕ,
        star ((A i).kraus (d i) k.1 (fockKet m) k.2) *
          (A i).kraus (d i) k.1 (fockKet n) k.2) ∧
      (∀ theta, Summable (fun r : ℕ =>
        ‖(A i).kraus (d i) r (coherentKet ((a : ℂ) * phase theta))‖ ^ 2) ∧
        (inner (𝕜 := ℂ) (coherentKet ((a : ℂ) * phase theta))
          (localEffect (A i) (d i) (coherentKet ((a : ℂ) * phase theta)))).re =
        ∑' r : ℕ, ‖(A i).kraus (d i) r (coherentKet ((a : ℂ) * phase theta))‖ ^ 2)) ∧
    (∀ r, HasPacketMatrix (eventKraus M A d r) (fun m n =>
      if (m ∘ Fin.natAdd K) = (n ∘ Fin.natAdd K) then
        ∏ i : Fin K, (A i).kraus (d i) (r i)
          (fockKet (n (Fin.castAdd M i))) (m (Fin.castAdd M i)) else 0)) ∧
    TraceHasSum (eventTerm M A d a) (eventOutput M A d a) ∧
    (Summable (fun q => eventOutput M A d a (packetBasis q) q) ∧
      (∑' q, eventOutput M A d a (packetBasis q) q).re = packetEvidence A d a) ∧
    (∀ m n, Summable (fun q : Fin K → ℕ =>
      eventOutput M A d a (packetBasis (Fin.append q n)) (Fin.append q m))) ∧
    HasPacketMatrix (packetResidual M A d a) (fun m n => ∑' q : Fin K → ℕ,
      eventOutput M A d a (packetBasis (Fin.append q n)) (Fin.append q m)) ∧
    TraceIntegral phaseLaw (fun theta => (packetLikelihood A d a theta : ℂ) •
      packetProjector (fun _ : Fin M => (a : ℂ) * phase theta))
      (packetResidual M A d a) ∧
    IsProbabilityMeasure (posteriorPhaseLaw A d a) ∧
    IsPacketDensity (((packetEvidence A d a)⁻¹ : ℂ) • packetResidual M A d a) ∧
    TraceIntegral (posteriorPhaseLaw A d a)
      (fun theta => packetProjector (fun _ : Fin M => (a : ℂ) * phase theta))
      (((packetEvidence A d a)⁻¹ : ℂ) • packetResidual M A d a) := by sorry

end QAlgorithms.Papers.Independent.Intakenext100.P33

end
Source
The Quantum State of a Propagating Laser Field, arXiv:quant-ph/0111157v1, PDF p. 5, IID, Eqs.(22)–(23)
Read-back

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

Let K,M,O∈NK,M,O\in\mathbb NK,M,O∈N, let a≥0a\ge0a≥0 be real, and work on F=ℓ2(N;C)\mathcal F=\ell^2(\mathbb N;\mathbb C)F=ℓ2(N;C), with basis ene_nen​, and HL=ℓ2(NL;C)\mathcal H_L=\ell^2(\mathbb N^L;\mathbb C)HL​=ℓ2(NL;C), with basis eqe_qeq​. For each i<Ki<Ki<K, suppose an instrument consists of bounded operators Ai,o,rA_{i,o,r}Ai,o,r​ on F\mathcal FF, indexed by o<Oo<Oo<O and r∈Nr\in\mathbb Nr∈N, satisfying, for every v∈Fv\in\mathcal Fv∈F,

∑(o,r)∈{0,…,O−1}×NAi,o,r∗Ai,o,rv=v\sum_{(o,r)\in\{0,\ldots,O-1\}\times\mathbb N} A_{i,o,r}^*A_{i,o,r}v=v(o,r)∈{0,…,O−1}×N∑​Ai,o,r∗​Ai,o,r​v=v

as a sum of vectors; fix outcomes di<Od_i<Odi​<O. In what follows, selecting an operator from a prescribed matrix means choosing a bounded operator having that matrix if one exists, and returning zero otherwise. Let uzu_zuz​ be a selected ℓ2\ell^2ℓ2 vector with coefficients e−∣z∣2/2zn/n!e^{-|z|^2/2}z^n/\sqrt{n!}e−∣z∣2/2zn/n!​, or zero if no such vector exists; let CL(z)C_L(z)CL​(z) have the product of these coefficients over its LLL modes when square summable, and zero otherwise; write PL(z)=∣CL(z)⟩⟨CL(z)∣P_L(z)=|C_L(z)\rangle\langle C_L(z)|PL​(z)=∣CL​(z)⟩⟨CL​(z)∣, where ∣u⟩⟨v∣x=⟨v,x⟩u|u\rangle\langle v|x=\langle v,x\rangle u∣u⟩⟨v∣x=⟨v,x⟩u; and let λ=(2π)−1Leb∣[0,2π)\lambda=(2\pi)^{-1}\mathrm{Leb}|_{[0,2\pi)}λ=(2π)−1Leb∣[0,2π)​. Define EiE_iEi​ by selecting the operator with matrix

(Eien)m=∑(r,k)∈N2(Ai,di,rem)k‾(Ai,di,ren)k,(E_ie_n)_m= \sum_{(r,k)\in\mathbb N^2} \overline{(A_{i,d_i,r}e_m)_k}(A_{i,d_i,r}e_n)_k,(Ei​en​)m​=(r,k)∈N2∑​(Ai,di​,r​em​)k​​(Ai,di​,r​en​)k​,

and define

w(θ)=∏i<KRe⁡⟨uaeiθ,Eiuaeiθ⟩,Z=∫w(θ) dλ(θ),RL=∫PL((aeiθ)j<L) dλ(θ).w(\theta)=\prod_{i<K} \operatorname{Re}\langle u_{ae^{i\theta}},E_i u_{ae^{i\theta}}\rangle, \qquad Z=\int w(\theta)\,d\lambda(\theta), \qquad R_L=\int P_L((ae^{i\theta})_{j<L})\,d\lambda(\theta).w(θ)=i<K∏​Re⟨uaeiθ​,Ei​uaeiθ​⟩,Z=∫w(θ)dλ(θ),RL​=∫PL​((aeiθ)j<L​)dλ(θ).

Assume Z>0Z>0Z>0. For r∈NKr\in\mathbb N^Kr∈NK, let BrB_rBr​ be selected from the matrix

(Bren)m={∏i<K(Ai,di,rieni)mi,(mK,…,mK+M−1)=(nK,…,nK+M−1),0,otherwise,(B_re_n)_m= \begin{cases} \displaystyle\prod_{i<K} (A_{i,d_i,r_i}e_{n_i})_{m_i}, & (m_K,\ldots,m_{K+M-1})=(n_K,\ldots,n_{K+M-1}),\\ 0,&\text{otherwise}, \end{cases}(Br​en​)m​=⎩⎨⎧​i<K∏​(Ai,di​,ri​​eni​​)mi​​,0,​(mK​,…,mK+M−1​)=(nK​,…,nK+M−1​),otherwise,​

on HK+M\mathcal H_{K+M}HK+M​; put Xr=BrRK+MBr∗X_r=B_rR_{K+M}B_r^*Xr​=Br​RK+M​Br∗​, let Y=∑r∈NKXrY=\sum_{r\in\mathbb N^K}X_rY=∑r∈NK​Xr​ be the totalized sum in the bounded-operator space, and select SSS from the matrix

(Sen)m=∑q∈NK(Ye(q,n))(q,m).(Se_n)_m=\sum_{q\in\mathbb N^K}(Ye_{(q,n)})_{(q,m)}.(Sen​)m​=q∈NK∑​(Ye(q,n)​)(q,m)​.

Call an operator nuclear when it has an operator-norm-convergent expansion ∑j∣uj⟩⟨vj∣\sum_j|u_j\rangle\langle v_j|∑j​∣uj​⟩⟨vj​∣ with ∑j∥uj∥∥vj∥<∞\sum_j\|u_j\|\|v_j\|<\infty∑j​∥uj​∥∥vj​∥<∞, and let ν\nuν be the real infimum of these sums, with value zero if there are no expansions. Write Iη(f,T)\mathcal I_\eta(f,T)Iη​(f,T) to mean that fff is Bochner integrable with integral TTT, that TTT is nuclear and fff is nuclear almost everywhere, and that there exist finite-range Bochner-integrable sjs_jsj​ for which sjs_jsj​ and f−sjf-s_jf−sj​ are nuclear almost everywhere, ν(f−sj)\nu(f-s_j)ν(f−sj​) is integrable, and ∫ν(f−sj) dη→0\int\nu(f-s_j)\,d\eta\to0∫ν(f−sj​)dη→0. Then every EiE_iEi​ has exactly its displayed matrix, and for every i<Ki<Ki<K and θ∈R\theta\in\mathbb Rθ∈R, the squared norms ∥Ai,di,ruaeiθ∥2\|A_{i,d_i,r}u_{ae^{i\theta}}\|^2∥Ai,di​,r​uaeiθ​∥2 form a summable family with sum Re⁡⟨uaeiθ,Eiuaeiθ⟩\operatorname{Re}\langle u_{ae^{i\theta}},E_i u_{ae^{i\theta}}\rangleRe⟨uaeiθ​,Ei​uaeiθ​⟩. Every BrB_rBr​ has exactly its displayed matrix. The operator YYY, every finite partial sum ∑r∈FXr\sum_{r\in F}X_r∑r∈F​Xr​, and every difference ∑r∈FXr−Y\sum_{r\in F}X_r-Y∑r∈F​Xr​−Y are nuclear, and ν(∑r∈FXr−Y)→0\nu(\sum_{r\in F}X_r-Y)\to0ν(∑r∈F​Xr​−Y)→0 along all finite subsets F⊆NKF\subseteq\mathbb N^KF⊆NK. The complex diagonal of YYY is summable and

Re⁡∑q(Yeq)q=Z.\operatorname{Re}\sum_q(Ye_q)_q=Z.Req∑​(Yeq​)q​=Z.

For every m,n∈NMm,n\in\mathbb N^Mm,n∈NM, the defining series for (Sen)m(Se_n)_m(Sen​)m​ is summable, and SSS has exactly that matrix. Furthermore,

Iλ ⁣(θ↦w(θ)PM((aeiθ)j<M), S)\mathcal I_\lambda\!\left( \theta\mapsto w(\theta)P_M((ae^{i\theta})_{j<M}),\,S\right)Iλ​(θ↦w(θ)PM​((aeiθ)j<M​),S)

holds. The measure η\etaη with density ofReal⁡(w(θ)/Z)\operatorname{ofReal}(w(\theta)/Z)ofReal(w(θ)/Z) relative to λ\lambdaλ, where ofReal⁡\operatorname{ofReal}ofReal truncates negative values to zero, is a probability measure; Z−1SZ^{-1}SZ−1S is nuclear and self-adjoint, satisfies Re⁡⟨v,Z−1Sv⟩≥0\operatorname{Re}\langle v,Z^{-1}Sv\rangle\ge0Re⟨v,Z−1Sv⟩≥0 for every vvv, and has summable complex diagonal with sum one; and

Iη ⁣(θ↦PM((aeiθ)j<M), Z−1S)\mathcal I_\eta\!\left( \theta\mapsto P_M((ae^{i\theta})_{j<M}),\,Z^{-1}S\right)Iη​(θ↦PM​((aeiθ)j<M​),Z−1S)

holds. The quantifiers include K=0K=0K=0 and M=0M=0M=0, with empty products equal to one and N0\mathbb N^0N0 a singleton; if O=0O=0O=0 and K>0K>0K>0, no outcome function ddd of the required type exists.

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

    Confirmed by the moderator at approval.

  • Endorsed by Gohan · Oct 31, 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