Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Post-processing a POVM by a Markov kernel is a POVM: Pρ′(B′)=∫κ(x,B′) dPρ(x)P'_\rho(B')=\int\kappa(x,B')\,dP_\rho(x)Pρ′​(B′)=∫κ(x,B′)dPρ​(x)

Proved
BosonicLearn.fockPOVM_postprocess

by Senrui Chen · Nov 13, 2026 · Mathlib 0df444a (Lean v4.33.1)

bosonic-gaussian-statesquantum-informationquantum-learning

Applying a randomized classical map to the outcome of a measurement gives another measurement.

Let III be an index set and let PPP be a POVM on ℓ2(I)\ell^2(I)ℓ2(I) with outcomes in a measurable space Ω\OmegaΩ. It consists of effects E(B)E(B)E(B) for measurable B⊆ΩB\subseteq\OmegaB⊆Ω, with 0≤E(B)≤10\le E(B)\le\mathbf 10≤E(B)≤1 and E(Ω)=1E(\Omega)=\mathbf 1E(Ω)=1, and of an outcome law PρP_\rhoPρ​ for every density operator ρ\rhoρ, a probability measure on Ω\OmegaΩ given by the Born rule Pρ(B)=Tr⁡(E(B)ρ)P_\rho(B)=\operatorname{Tr}(E(B)\rho)Pρ​(B)=Tr(E(B)ρ). Let κ\kappaκ be a Markov kernel from Ω\OmegaΩ to a measurable space Ω′\Omega'Ω′: κ(x,B′)\kappa(x,B')κ(x,B′) is the probability that the post-processed outcome lies in B′B'B′ when the measurement outcome is xxx.

Then there is a POVM P′P'P′ on ℓ2(I)\ell^2(I)ℓ2(I) with outcomes in Ω′\Omega'Ω′ such that for every density operator ρ\rhoρ and every measurable B′⊆Ω′B'\subseteq\Omega'B′⊆Ω′

Pρ′(B′)=∫Ωκ(x,B′) dPρ(x).P'_\rho(B')=\int_\Omega\kappa(x,B')\,\mathrm dP_\rho(x).Pρ′​(B′)=∫Ω​κ(x,B′)dPρ​(x).

In terms of effects, E′(B′)=∫Ωκ(x,B′) E(dx)E'(B')=\int_\Omega\kappa(x,B')\,E(\mathrm dx)E′(B′)=∫Ω​κ(x,B′)E(dx).

Role. A measurement followed by a randomized estimator is thereby a single measurement whose outcome is the estimate. Together with BosonicLearn.adaptive_scheme_product_povm it shows that an adaptive single-copy learner is a special case of a collective one, which is how the proof of Theorem 3 applies the collective lower bound of Theorem 9 to single-copy schemes.

Formalization Note PPP and P′P'P′ are FockPOVMs: the effects are coefficient arrays whose quadratic forms on finitely supported vectors lie between 000 and ∥z∥2\|z\|^2∥z∥2, and the Born rule Pρ′(B′)=Re⁡∑i∑jE′(B′)ijρjiP'_\rho(B')=\operatorname{Re}\sum_i\sum_jE'(B')_{ij}\rho_{ji}Pρ′​(B′)=Re∑i​∑j​E′(B′)ij​ρji​ is required on every density operator ρ\rhoρ, with trace-class meant in the nuclear-expansion sense of IsDensity. The law of the post-processed outcome is Measure.bind. The identity is stated for every coefficient array ρ\rhoρ; on arrays that are not densities both sides are unconstrained data, so the content is the statement on densities. The source uses this fact without stating it.

Related platform material The space ℓ2(A)\ell^2(A)ℓ2(A) used here (Hilbert A) is the same Lean type as OAI.TensorLp.H A, and ℓ2(Nn)\ell^2(\mathbb N^n)ℓ2(Nn) is the same type as OAI.EntropyPhotonNumber.Fock n. The published definitions OAI_Analysis_TensorLp (tensor products, slices and operator lifts on ℓ2(A×B)\ell^2(A\times B)ℓ2(A×B)) and OAI_MathematicalPhysics_Fock_Operators (OAI.CrossEnsemble.operator, the bounded operator ∑i∣ui⟩⟨vi∣\sum_i|u_i\rangle\langle v_i|∑i​∣ui​⟩⟨vi​∣ of a family, with hasSum_operator and entry_hasSum) are sorry-free and can be imported. The proof of BosonicLearn.traceDist_le_one contains lemmas on nuclear expansions, their sums, and truncation to finite index sets.

Preamble
import Mathlib
import Definitions.Def_BosonicLearn_FockPOVM

open MeasureTheory ProbabilityTheory
open scoped ENNReal Matrix
Formal statement
namespace BosonicLearn

/-- **Classical post-processing of a POVM is a POVM.**
Chen, Anna Mele, Anna Mele, Preskill, *When are bosonic Gaussian states classical to learn?*, arXiv:2609.26705, Eq. (105), p. 40 ("the state estimator ρ̂(x) that allows internal randomness"); used in the proof of
Theorem 3, p. 67, where a single-copy scheme followed by its estimator is treated as one measurement.

Let `P` be a POVM on `ℓ²(I)` with outcomes in a measurable space `Ω`, and let `κ` be a Markov kernel from `Ω` to a
measurable space `Ω'` (a randomized map applied to the outcome). There is a POVM `P'` on `ℓ²(I)` with outcomes in
`Ω'` whose outcome law on every state is the law of the post-processed outcome:
`P'.law ρ = ∫ κ(x, ·) d(P.law ρ)(x)`.

**Formalization Note.** `P'` is a `FockPOVM`, so its effects are bounded between `0` and `1`, are normalized, and
satisfy the Born rule `P'.law ρ B = Re Tr(E'(B) ρ)` on every density operator `ρ`. The law of the post-processed
outcome is `Measure.bind`. The identity is stated for every coefficient array `ρ`; on arrays that are not densities
both sides are unconstrained data, so the content is the statement on densities. The source uses this without
stating it. -/
theorem fockPOVM_postprocess {I Ω Ω' : Type} [DecidableEq I] [MeasurableSpace Ω] [MeasurableSpace Ω']
    (P : FockPOVM I Ω) (κ : Kernel Ω Ω') (hκ : IsMarkovKernel κ) :
    ∃ P' : FockPOVM I Ω', ∀ ρ : Matrix I I ℂ, P'.law ρ = (P.law ρ).bind κ := by sorry

end BosonicLearn
Source
Chen, Anna Mele, Anna Mele, Preskill, When are bosonic Gaussian states classical to learn?, arXiv:2609.26705, Eq. (105), p. 40 ("the state estimator ρ̂(x) that allows internal randomness"); used in the proof of Theorem 3, p. 67

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