Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Conservation and ordering of symmetric information

Open
QAlgorithms.Papers.Independent.Intakethird100.P14.information_transform

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

prove2quantum

Let W:b↦ρbW:b\mapsto\rho_bW:b↦ρb​ be a binary-input classical–quantum channel with normalized density outputs. Construct the channels W−W^-W− and W+W^+W+ exactly by (14)–(15): apply the binary polar kernel to two independent uniform bits, average the second bit for W−W^-W−, and retain the first bit as a classical register for W+W^+W+. Their uniform-prior Holevo informations, measured in bits, satisfy

I(W−)+I(W+)=2I(W),I(W−)≤I(W+),I(W−)≤I(W)≤I(W+).I(W^-)+I(W^+)=2I(W),\qquad I(W^-)\le I(W^+),\qquad I(W^-)\le I(W)\le I(W^+).I(W−)+I(W+)=2I(W),I(W−)≤I(W+),I(W−)≤I(W)≤I(W+).

This includes both numbered assertions and the immediately displayed consequence. The channels are constructed from WWW; conservation is not a premise on arbitrary supplied channels. These identities describe movement of information away from the center while preserving total rate.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakethird100_P14
Formal statement
noncomputable section

namespace QAlgorithms.Papers.Independent.Intakethird100.P14

open Filter MeasureTheory

open scoped ENNReal NNReal ComplexOrder BigOperators

open QAlgorithms.RealRegisters (Hilbert)

open QAlgorithms.Papers.Independent.Dependency50.P33 (IsDensity)

open QAlgorithms.Papers.Independent.Dependency50.P13 (compression)

open QAlgorithms.Papers.Independent.Renew46.P44 (wordOutput)

attribute [local instance] Classical.propDecidable Classical.decEq

/-- Proposition 8 and its displayed consequence, PDF p.7; proof pp.10–11.
The minus/plus channels are computed from W, not supplied with conservation
as a hypothesis. Uniform independent bits are in (14)–(15). -/
theorem information_transform {I : Type} (W : Bit → OutputCoefficients I) (hW : IsBinaryCqChannel W) :
    symmetricInformation (channelMinus W) + symmetricInformation (channelPlus W) =
      2 * symmetricInformation W ∧
    symmetricInformation (channelMinus W) ≤ symmetricInformation (channelPlus W) ∧
    symmetricInformation (channelMinus W) ≤ symmetricInformation W ∧
    symmetricInformation W ≤ symmetricInformation (channelPlus W) := by sorry

end QAlgorithms.Papers.Independent.Intakethird100.P14

end
Source
Polar codes for classical-quantum channels, arXiv:1109.2591v3, PDF p. 7, Proposition 8: conservation and ordering of symmetric Holevo information
Read-back

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

Let III be any type and W0,W1W_0,W_1W0​,W1​ complex arrays on I×II\times II×I. Assume each array admits a nuclear expansion X(i,j)=∑rur(i)vr(j)‾X(i,j)=\sum_r u_r(i)\overline{v_r(j)}X(i,j)=∑r​ur​(i)vr​(j)​ with ur,vr∈ℓ2(I;C)u_r,v_r\in\ell^2(I;\mathbb C)ur​,vr​∈ℓ2(I;C) and ∑r∥ur∥∥vr∥<∞\sum_r\|u_r\|\|v_r\|<\infty∑r​∥ur​∥∥vr​∥<∞, every finite quadratic form of XXX is real and nonnegative, and its real diagonal is summable with sum 111. For any array XXX, let O(X)O(X)O(X) be a chosen bounded operator with coordinate coefficients XXX, or 000 if no such operator exists. Define D2(X∣Y)∈[0,∞]D_2(X\mid Y)\in[0,\infty]D2​(X∣Y)∈[0,∞] by taking the supremum over every d∈Nd\in\mathbb Nd∈N and every orthonormal ddd-tuple vvv in the relevant ℓ2\ell^2ℓ2 space: with Xv=(⟨vr,O(X)vs⟩)X_v=(\langle v_r,O(X)v_s\rangle)Xv​=(⟨vr​,O(X)vs​⟩) and Yv=(⟨vr,O(Y)vs⟩)Y_v=(\langle v_r,O(Y)v_s\rangle)Yv​=(⟨vr​,O(Y)vs​⟩), its contribution is +∞+\infty+∞ if ker⁡Yv⊈ker⁡Xv\ker Y_v\not\subseteq\ker X_vkerYv​⊆kerXv​, and otherwise is

max⁡ ⁣(0,Re⁡Tr⁡(f(Xv)−Xvlog⁡Yv−Xv+Yv)log⁡2),f(t)=tlog⁡t,\max\!\left(0,\frac{\operatorname{Re}\operatorname{Tr} \bigl(f(X_v)-X_v\log Y_v-X_v+Y_v\bigr)}{\log2}\right), \qquad f(t)=t\log t,max(0,log2ReTr(f(Xv​)−Xv​logYv​−Xv​+Yv​)​),f(t)=tlogt,

where matrix functions use the continuous functional calculus and the real logarithm has its total value log⁡0=0\log0=0log0=0. Define J(V)=12[D2(V0∣(V0+V1)/2)+D2(V1∣(V0+V1)/2)]J(V)=\tfrac12[D_2(V_0\mid(V_0+V_1)/2)+D_2(V_1\mid(V_0+V_1)/2)]J(V)=21​[D2​(V0​∣(V0​+V1​)/2)+D2​(V1​∣(V0​+V1​)/2)]. The binary arrays W−W^-W− on I×II\times II×I and W+W^+W+ on F2×(I×I)\mathbb F_2\times(I\times I)F2​×(I×I) are given by Wb−((a1,a2),(c1,c2))=12∑d∈F2Wb+d(a1,c1)Wd(a2,c2)W_b^-((a_1,a_2),(c_1,c_2))=\tfrac12\sum_{d\in\mathbb F_2}W_{b+d}(a_1,c_1)W_d(a_2,c_2)Wb−​((a1​,a2​),(c1​,c2​))=21​∑d∈F2​​Wb+d​(a1​,c1​)Wd​(a2​,c2​) and Wd+((b,(a1,a2)),(b′,(c1,c2)))=1b=b′12Wb+d(a1,c1)Wd(a2,c2)W_d^+((b,(a_1,a_2)),(b',(c_1,c_2)))=\mathbf1_{b=b'}\tfrac12W_{b+d}(a_1,c_1)W_d(a_2,c_2)Wd+​((b,(a1​,a2​)),(b′,(c1​,c2​)))=1b=b′​21​Wb+d​(a1​,c1​)Wd​(a2​,c2​), with addition modulo 222. Then

J(W−)+J(W+)=2J(W),J(W−)≤J(W+),J(W−)≤J(W),J(W)≤J(W+).J(W^-)+J(W^+)=2J(W),\qquad J(W^-)\le J(W^+),\qquad J(W^-)\le J(W),\qquad J(W)\le J(W^+).J(W−)+J(W+)=2J(W),J(W−)≤J(W+),J(W−)≤J(W),J(W)≤J(W+).

These are equalities and inequalities in the extended nonnegative reals; no finiteness hypothesis is imposed on these quantities, and the defining supremum includes the empty orthonormal family d=0d=0d=0.

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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me