Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§I/§V, unnumbered: symmetry of optimal costs

Proved
QAlgorithms.Papers.Independent.Gap48.P38.timeReversalCosts

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

prove2quantum

Let ∣ψ⟩ABCD|\psi\rangle^{ABCD}∣ψ⟩ABCD be a unit vector on nonempty finite complex registers. All entropies refer to its actual reduced density matrices and are measured in bits. Define the forward corner expressions by Q→∗=I(C;D∣B)/2Q_\to^*=I(C;D\mid B)/2Q→∗​=I(C;D∣B)/2 and E→∗=[I(A;C)−I(B;C)]/2E_\to^*=[I(A;C)-I(B;C)]/2E→∗​=[I(A;C)−I(B;C)]/2, and define the reverse expressions by exchanging the sender and receiver side information: Q←∗=I(C;D∣A)/2Q_\leftarrow^*=I(C;D\mid A)/2Q←∗​=I(C;D∣A)/2 and E←∗=[I(B;C)−I(A;C)]/2E_\leftarrow^*=[I(B;C)-I(A;C)]/2E←∗​=[I(B;C)−I(A;C)]/2. Then

I(C;D∣A)=I(C;D∣B),Q←∗=Q→∗,E←∗=−E→∗.I(C;D\mid A)=I(C;D\mid B),\qquad Q_\leftarrow^*=Q_\to^*,\qquad E_\leftarrow^*=-E_\to^*.I(C;D∣A)=I(C;D∣B),Q←∗​=Q→∗​,E←∗​=−E→∗​.

These are the explicitly stated symmetry relations for the corner values in equation (2). No additional claim that the finite protocol consists of globally dimension-preserving isometries is included.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Gap48_P38
Formal statement
noncomputable section

open MeasureTheory

open scoped Matrix ComplexConjugate ComplexOrder Matrix.Norms.Elementwise

attribute [local instance] Classical.propDecidable Classical.decEq

namespace QAlgorithms.Papers.Independent.Gap48.P38

/-- Sections I/V, PDF pp.2,9--10: the explicitly stated entropy identity,
symmetry of the corner qubit expression, and antisymmetry of the signed ebit
expression. No globally dimension-preserving protocol implementation is inferred. -/
theorem timeReversalCosts
    (I : Fin 4 → Type) [∀ i, Fintype (I i)] [∀ i, Nonempty (I i)]
    (psi : EuclideanSpace ℂ (∀ i, I i)) (hpsi : ‖psi‖ = 1) :
    let rho := pureDensity psi
    registerCMI I rho {2} {3} {0} = registerCMI I rho {2} {3} {1} ∧
    registerCMI I rho {2} {3} {0} / 2 = cornerQ I rho ∧
    registerMutualInfo I rho {1} {2} / 2 - registerMutualInfo I rho {0} {2} / 2 =
      -cornerE I rho := by sorry

end QAlgorithms.Papers.Independent.Gap48.P38

end
Source
Optimal quantum source coding with quantum information at the encoder and decoder, arXiv:0706.2907v2, PDF p. 2, §I/§V, unnumbered: symmetry of optimal costs
Read-back

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

For every family of four finite, nonempty index sets I0,I1,I2,I3I_0,I_1,I_2,I_3I0​,I1​,I2​,I3​, allowing singleton sets, and every complex vector ψ\psiψ indexed by ∏i=03Ii\prod_{i=0}^3 I_i∏i=03​Ii​ with ∥ψ∥=1\|\psi\|=1∥ψ∥=1, put ρxy=ψ(x)ψ(y)‾\rho_{xy}=\psi(x)\overline{\psi(y)}ρxy​=ψ(x)ψ(y)​. For each register set AAA, define ρA(x,y)=∑zρ(x,z),(y,z)\rho_A(x,y)=\sum_z\rho_{(x,z),(y,z)}ρA​(x,y)=∑z​ρ(x,z),(y,z)​, summing over assignments to the complementary registers, and let HA=−Re⁡tr⁡(f(ρA))H_A=-\operatorname{Re}\operatorname{tr}(f(\rho_A))HA​=−Retr(f(ρA​)), where f(t)=tlog⁡2tf(t)=t\log_2 tf(t)=tlog2​t is applied by continuous functional calculus and f(0)=0f(0)=0f(0)=0; digit strings denote register sets. The following three equalities hold simultaneously:

H02+H03−H0−H023=H12+H13−H1−H123,H02+H03−H0−H0232=H12+H13−H1−H1232,H1+H2−H122−H0+H2−H022=−(H0+H2−H022−H1+H2−H122).\begin{aligned} H_{02}+H_{03}-H_0-H_{023} &=H_{12}+H_{13}-H_1-H_{123},\\ \frac{H_{02}+H_{03}-H_0-H_{023}}2 &=\frac{H_{12}+H_{13}-H_1-H_{123}}2,\\ \frac{H_1+H_2-H_{12}}2-\frac{H_0+H_2-H_{02}}2 &=-\left(\frac{H_0+H_2-H_{02}}2-\frac{H_1+H_2-H_{12}}2\right). \end{aligned}H02​+H03​−H0​−H023​2H02​+H03​−H0​−H023​​2H1​+H2​−H12​​−2H0​+H2​−H02​​​=H12​+H13​−H1​−H123​,=2H12​+H13​−H1​−H123​​,=−(2H0​+H2​−H02​​−2H1​+H2​−H12​​).​
Human review
  • Endorsed by Shuze Chen · Oct 22, 2026

    Confirmed by the moderator at approval.

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