Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 12

Open
QAlgorithms.Papers.Independent.Intakenext100.P56.formation_min_formula

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

prove2quantum

All systems are finite-dimensional complex Hilbert spaces with nonempty finite bases. States are positive semidefinite operators of trace one; pure kets have norm one. All marginal states below are partial traces of the stated joint state. Logarithms are natural, and spectral powers vanish on the kernel, including at exponent zero.

Let α>0\alpha>0α>0, α≠1\alpha\ne1α=1, and let ρAB\rho_{AB}ρAB​ be a state. The Rényi entanglement of formation, defined as the infimum of Hα(A∣X)H_\alpha(A|X)Hα​(A∣X) over finite pure decompositions, obeys

EαF(A;B)ρ=min⁡ρ=∑xpx∣ψx⟩⟨ψx∣α1−αlog⁡∑xpx[Tr⁡((ψAx)α)]1/α.E^F_\alpha(A;B)_\rho=\min_{\rho=\sum_xp_x|\psi_x\rangle\langle\psi_x|}\frac{\alpha}{1-\alpha}\log\sum_xp_x\left[\operatorname{Tr}((\psi_A^x)^\alpha)\right]^{1/\alpha}.EαF​(A;B)ρ​=ρ=∑x​px​∣ψx​⟩⟨ψx​∣min​1−αα​logx∑​px​[Tr((ψAx​)α)]1/α.

Each pxp_xpx​ is nonnegative, the weights sum to one, ∣ψx⟩|\psi_x\rangle∣ψx​⟩ is normalized, and ψAx=Tr⁡B∣ψx⟩⟨ψx∣\psi_A^x=\operatorname{Tr}_B|\psi_x\rangle\langle\psi_x|ψAx​=TrB​∣ψx​⟩⟨ψx​∣. The minimum is attained by some finite ensemble; no cardinality bound is asserted. The outer weights are pxp_xpx​, not pxαp_x^\alphapxα​.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P56
Formal statement
noncomputable section

open Filter Topology

open scoped Matrix ComplexConjugate ComplexOrder

namespace QAlgorithms.Papers.Independent.Intakenext100.P56

attribute [local instance] Classical.propDecidable Classical.decEq

open QAlgorithms

open QAlgorithms.Papers.Independent.Information100.P56 (IsLaw entropy average holevo)

open QAlgorithms.Papers.Independent.Information100.P71 (supportPower)

open QAlgorithms.Papers.Independent.Dependency50.P21 (channelAdjoint petz extendedLog marginalAB)

open QAlgorithms.Papers.Independent.Information100.P21 (Op FiniteLOCC)

open QAlgorithms.Papers.Independent.Dependency50.P35 (marginalAC)

open QAlgorithms.Papers.Independent.Dependency50.P07 (bipartiteProduct)

open QAlgorithms.Papers.Independent.Information100.P67 (squaredFidelity)

open QAlgorithms.Papers.Independent.Advance50.P25 (renyiEntropyNats)

variable {A B C D E X : Type}

variable [Fintype A] [Fintype B] [Fintype C] [Fintype D] [Fintype E] [Fintype X]

variable [Nonempty A] [Nonempty B] [Nonempty C] [Nonempty D] [Nonempty E] [Nonempty X]

open scoped Matrix.Norms.L2Operator

/-- arXiv:1410.1443v3, PDF pp.12–13, Proposition 12, (4.38).
The value equals an ATTAINED minimum, with no cardinality bound. -/
theorem formation_min_formula (a : ℝ) (ha : RenyiOrder a)
    (rho : Op (A × B)) (hrho : IsDensityMatrix rho) :
    ∃ ens : FinitePureDecomposition rho,
      renyiFormation a rho = (formationObjective a ens : EReal) ∧
      ∀ other : FinitePureDecomposition rho, formationObjective a ens ≤ formationObjective a other := by sorry

end QAlgorithms.Papers.Independent.Intakenext100.P56

end
Source
Rényi squashed entanglement, discord, and relative entropy differences, arXiv:1410.1443v3, PDF p. 12, Proposition 12
Read-back

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

Let A,BA,BA,B be finite register index types with decidable equality, a>0a>0a>0, a≠1a\ne1a=1, and ρ\rhoρ a positive semidefinite trace-111 matrix on A×BA\times BA×B. A finite pure decomposition consists of r∈Nr\in\mathbb Nr∈N, weights pj≥0p_j\ge0pj​≥0 with ∑j<rpj=1\sum_{j<r}p_j=1∑j<r​pj​=1, and unit vectors ψj∈CA×B\psi_j\in\mathbb C^{A\times B}ψj​∈CA×B such that ρ=∑j<rpj∣ψj⟩⟨ψj∣\rho=\sum_{j<r}p_j|\psi_j\rangle\langle\psi_j|ρ=∑j<r​pj​∣ψj​⟩⟨ψj​∣, where (∣ψ⟩⟨ψ∣)u,v=ψuψv‾(|\psi\rangle\langle\psi|)_{u,v}=\psi_u\overline{\psi_v}(∣ψ⟩⟨ψ∣)u,v​=ψu​ψv​​. For such a decomposition E\mathcal EE, let αj=Tr⁡B∣ψj⟩⟨ψj∣\alpha_j=\operatorname{Tr}_B|\psi_j\rangle\langle\psi_j|αj​=TrB​∣ψj​⟩⟨ψj​∣ and let ηE\eta_{\mathcal E}ηE​ on A×{0,…,r−1}A\times\{0,\ldots,r-1\}A×{0,…,r−1} have entries (ηE)(u,j),(v,k)=δj,kpj(αj)u,v(\eta_{\mathcal E})_{(u,j),(v,k)}=\delta_{j,k}p_j(\alpha_j)_{u,v}(ηE​)(u,j),(v,k)​=δj,k​pj​(αj​)u,v​. Write Pt(Z)P_t(Z)Pt​(Z) for spectral functional calculus assigning 000 to zero eigenvalues and xtx^txt to nonzero eigenvalues. Define

Fa(ρ)=inf⁡E[a1−alog⁡Re⁡tr⁡P1/a ⁣(Tr⁡APa(ηE))],Ja(E)=a1−alog⁡∑j<rpj(Re⁡tr⁡Pa(αj))1/a,F_a(\rho)=\inf_{\mathcal E} \left[\frac{a}{1-a}\log\operatorname{Re}\operatorname{tr} P_{1/a}\!\left(\operatorname{Tr}_A P_a(\eta_{\mathcal E})\right)\right], \qquad J_a(\mathcal E)=\frac{a}{1-a}\log \sum_{j<r}p_j\left(\operatorname{Re}\operatorname{tr}P_a(\alpha_j)\right)^{1/a},Fa​(ρ)=Einf​[1−aa​logRetrP1/a​(TrA​Pa​(ηE​))],Ja​(E)=1−aa​logj<r∑​pj​(RetrPa​(αj​))1/a,

where the first infimum is in the extended real numbers and the bracketed real values are embedded there. There exists a finite pure decomposition E\mathcal EE of ρ\rhoρ such that Fa(ρ)=Ja(E)F_a(\rho)=J_a(\mathcal E)Fa​(ρ)=Ja​(E) and Ja(E)≤Ja(E′)J_a(\mathcal E)\le J_a(\mathcal E')Ja​(E)≤Ja​(E′) for every other finite pure decomposition E′\mathcal E'E′ of ρ\rhoρ. Zero weights are allowed, all listed vectors must have norm 111, an empty decomposition cannot satisfy the weight-sum condition, and logarithms are natural.

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