Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Remark 3: strict and tight examples exist

Open
QAlgorithms.Papers.Independent.Intakethird100.P97.strict_and_tight_examples

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

prove2quantum

Let ρABCD\rho_{ABCD}ρABCD​ be a positive semidefinite complex density matrix of trace one on four finite-dimensional tensor factors A,B,C,DA,B,C,DA,B,C,D, each of positive dimension (dimension one is allowed). Every S(X)S(X)S(X) is the base-two von Neumann entropy of the actual XXX marginal of this same state, with 0log⁡20=00\log_2 0=00log2​0=0. For disjoint groups write S(X∣Y)=S(XY)−S(Y)S(X\mid Y)=S(XY)-S(Y)S(X∣Y)=S(XY)−S(Y), I(X;Y)=S(X)+S(Y)−S(XY)I(X;Y)=S(X)+S(Y)-S(XY)I(X;Y)=S(X)+S(Y)−S(XY), and I(X;Z∣Y)=S(XY)+S(YZ)−S(XYZ)−S(Y)I(X;Z\mid Y)=S(XY)+S(YZ)-S(XYZ)-S(Y)I(X;Z∣Y)=S(XY)+S(YZ)−S(XYZ)−S(Y). There exists a state obeying I(A;C∣B)=I(B;C∣A)=I(A;B∣D)=0I(A;C\mid B)=I(B;C\mid A)=I(A;B\mid D)=0I(A;C∣B)=I(B;C∣A)=I(A;B∣D)=0 for which the inequality is strict, and there exists a state obeying the same constraints for which it is tight:

∃ρ: I(C;D)>I(C;AB),∃σ: I(C;D)=I(C;AB).\exists\rho:\ I(C;D)>I(C;AB),\qquad \exists\sigma:\ I(C;D)=I(C;AB).∃ρ: I(C;D)>I(C;AB),∃σ: I(C;D)=I(C;AB).

The two existential states may use different finite local dimensions. This demonstrates both behaviors within the constrained class.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakethird100_P97
Formal statement
noncomputable section

namespace QAlgorithms.Papers.Independent.Intakethird100.P97

attribute [local instance] Classical.propDecidable Classical.decEq

local notation "A" => ({0} : Finset (Fin 4))

local notation "B" => ({1} : Finset (Fin 4))

local notation "C" => ({2} : Finset (Fin 4))

local notation "D" => ({3} : Finset (Fin 4))

/-- PDF p.5, Remark 3: both strictness and equality occur among states obeying
all three constraints. The witnesses may have different finite local dimensions. -/
theorem strict_and_tight_examples :
    (∃ q : FourPartyState, Constraints (fourPartyEntropyBits q) ∧
      mutualValue (fourPartyEntropyBits q) C (A ∪ B) < mutualValue (fourPartyEntropyBits q) C D) ∧
    (∃ q : FourPartyState, Constraints (fourPartyEntropyBits q) ∧
      mutualValue (fourPartyEntropyBits q) C (A ∪ B) = mutualValue (fourPartyEntropyBits q) C D) := by sorry

end QAlgorithms.Papers.Independent.Intakethird100.P97

end
Source
A new inequality for the von Neumann entropy, arXiv:quant-ph/0406162v1, PDF p. 5, Remark 3
Read-back

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

A four-party state qqq consists of positive natural-number dimensions did_idi​, indexed by Ω={0,1,2,3}\Omega=\{0,1,2,3\}Ω={0,1,2,3}, and a positive semidefinite complex matrix ρ\rhoρ of trace 111 on the register ∏i{0,…,di−1}\prod_i\{0,\ldots,d_i-1\}∏i​{0,…,di​−1}; dimensions equal to 111 are permitted. Define Hsq=−Re⁡tr⁡f(ρs)H_s^q=-\operatorname{Re}\operatorname{tr}f(\rho_s)Hsq​=−Retrf(ρs​), where ρs\rho_sρs​ is obtained by summing equal row and column coordinates outside sss, and f(u)=ulog⁡2uf(u)=u\log_2uf(u)=ulog2​u is applied by functional calculus, with 0log⁡20=00\log_2 0=00log2​0=0. Here A,B,C,DA,B,C,DA,B,C,D are the fixed subsets of Ω\OmegaΩ referenced in the declaration, whose elements are not supplied, and concatenated subscripts denote unions. The theorem asserts both of the following existence statements, with the state chosen separately in each:

∃q:HABq+HBCq−HABCq−HBq=0,HABq+HACq−HABCq−HAq=0,HADq+HBDq−HABDq−HDq=0,HCq+HABq−HABCq<HCq+HDq−HCDq;∃q:HABq+HBCq−HABCq−HBq=0,HABq+HACq−HABCq−HAq=0,HADq+HBDq−HABDq−HDq=0,HCq+HABq−HABCq=HCq+HDq−HCDq.\begin{aligned} &\exists q:\quad H_{AB}^q+H_{BC}^q-H_{ABC}^q-H_B^q=0,\quad H_{AB}^q+H_{AC}^q-H_{ABC}^q-H_A^q=0,\quad H_{AD}^q+H_{BD}^q-H_{ABD}^q-H_D^q=0,\\[-2pt] &\hspace{55mm} H_C^q+H_{AB}^q-H_{ABC}^q < H_C^q+H_D^q-H_{CD}^q;\\[4pt] &\exists q:\quad H_{AB}^q+H_{BC}^q-H_{ABC}^q-H_B^q=0,\quad H_{AB}^q+H_{AC}^q-H_{ABC}^q-H_A^q=0,\quad H_{AD}^q+H_{BD}^q-H_{ABD}^q-H_D^q=0,\\[-2pt] &\hspace{55mm} H_C^q+H_{AB}^q-H_{ABC}^q = H_C^q+H_D^q-H_{CD}^q. \end{aligned}​∃q:HABq​+HBCq​−HABCq​−HBq​=0,HABq​+HACq​−HABCq​−HAq​=0,HADq​+HBDq​−HABDq​−HDq​=0,HCq​+HABq​−HABCq​<HCq​+HDq​−HCDq​;∃q:HABq​+HBCq​−HABCq​−HBq​=0,HABq​+HACq​−HABCq​−HAq​=0,HADq​+HBDq​−HABDq​−HDq​=0,HCq​+HABq​−HABCq​=HCq​+HDq​−HCDq​.​
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