Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Unnumbered: finite product decomposition and 79 angles

Open
QAlgorithms.Papers.Independent.Intakenext100.P42.finite_parameterization

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

prove2quantum

All local registers are nonzero and finite-dimensional. Density matrices are positive semidefinite with trace one. Entropies use natural logarithms, 0ln⁡0=00\ln0=00ln0=0, and Umegaki relative entropy S(σ∥ρ)S(\sigma\Vert\rho)S(σ∥ρ) is +∞+\infty+∞ on failure of support inclusion. The relative entropy of entanglement is ER(σ)=inf⁡ρ∈SepS(σ∥ρ)E_R(\sigma)=\inf_{\rho\in\mathrm{Sep}}S(\sigma\Vert\rho)ER​(σ)=infρ∈Sep​S(σ∥ρ), where separability is across the specified Alice:Bob cut.

For positive finite local dimensions dA,dBd_A,d_BdA​,dB​, every separable state is a convex combination of at most (dAdB)2(d_A d_B)^2(dA​dB​)2 projectors onto unit product vectors. For two qubits every separable ρ\rhoρ can be written using 79 angles in [0,2π][0,2\pi][0,2π] as

ρ=∑i=116pi2∣ui⟩⟨ui∣⊗∣vi⟩⟨vi∣,pi=sin⁡ϕi−1∏j=i15cos⁡ϕj,ϕ0=π/2.\rho=\sum_{i=1}^{16}p_i^2|u_i\rangle\langle u_i|\otimes|v_i\rangle\langle v_i|,\quad p_i=\sin\phi_{i-1}\prod_{j=i}^{15}\cos\phi_j,\quad\phi_0=\pi/2.ρ=i=1∑16​pi2​∣ui​⟩⟨ui​∣⊗∣vi​⟩⟨vi​∣,pi​=sinϕi−1​j=i∏15​cosϕj​,ϕ0​=π/2.

Here ui=cos⁡αi∣0⟩+sin⁡αieiηi∣1⟩u_i=\cos\alpha_i|0\rangle+\sin\alpha_i e^{\mathrm i\eta_i}|1\rangleui​=cosαi​∣0⟩+sinαi​eiηi​∣1⟩ and vi=cos⁡βi∣0⟩+sin⁡βieiμi∣1⟩v_i=\cos\beta_i|0\rangle+\sin\beta_i e^{\mathrm i\mu_i}|1\ranglevi​=cosβi​∣0⟩+sinβi​eiμi​∣1⟩. There are 15 mixing and 64 local angles; an empty product is one. This is a surjective parameterization and a parameter bound.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P42
Formal statement
noncomputable section

open scoped Matrix ComplexConjugate ComplexOrder ENNReal Topology

namespace QAlgorithms.Papers.Independent.Intakenext100.P42

open QAlgorithms QAlgorithms.Entanglement

open QAlgorithms.Papers.Independent.Dependency50.P21 (relativeEntropy)

open QAlgorithms.Papers.Independent.Information100.P56 (entropy)

open QAlgorithms.Papers.Independent.Information100.P04 (copies)

open QAlgorithms.Papers.Independent.Bridge50.P49 (groupedProduct)

attribute [local instance] Classical.propDecidable Classical.decEq

/-- PDF pp.20–22: at most (d_A d_B)^2 pure products, and an explicit 79-angle
surjection for two qubits. This is a parameter count, not a runtime theorem. -/
theorem finite_parameterization :
    (∀ (I J : Type) [Fintype I] [Fintype J] [Nonempty I] [Nonempty J]
      (rho : Matrix (I × J) (I × J) ℂ), IsSeparableDensity rho →
        HasPureProductDecomposition rho ((Fintype.card I * Fintype.card J)^2)) ∧
    (∀ rho : Matrix (Bool × Bool) (Bool × Bool) ℂ, IsSeparableDensity rho →
      ∃ a : Fin 79 → ℝ, (∀ i, a i ∈ Set.Icc 0 (2*Real.pi)) ∧ rho = angleState a) := by sorry

end QAlgorithms.Papers.Independent.Intakenext100.P42

end
Source
Entanglement Measures and Purification Procedures, arXiv:quant-ph/9707035v2, PDF p. 20, Unnumbered: finite product decomposition and 79 angles
Read-back

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

Two assertions hold. First, for every pair of finite nonempty types I,JI,JI,J and every separable matrix ρ\rhoρ on I×JI\times JI×J, there exist a natural number m≤(∣I∣∣J∣)2m\le(|I||J|)^2m≤(∣I∣∣J∣)2, nonnegative real weights wiw_iwi​ summing to 111, and unit vectors ai∈CIa_i\in\mathbb C^Iai​∈CI, bi∈CJb_i\in\mathbb C^Jbi​∈CJ such that ρ=∑i=0m−1wi(aiai†)⊗(bibi†)\rho=\sum_{i=0}^{m-1}w_i(a_ia_i^\dagger)\otimes(b_ib_i^\dagger)ρ=∑i=0m−1​wi​(ai​ai†​)⊗(bi​bi†​); the premise “separable” itself means a finite convex combination of tensor products of positive semidefinite trace-one matrices, without initially requiring pure factors. Second, every separable matrix ρ\rhoρ on Bool×Bool\mathrm{Bool}\times\mathrm{Bool}Bool×Bool admits 797979 real parameters a0,…,a78a_0,\ldots,a_{78}a0​,…,a78​, all in [0,2π][0,2\pi][0,2π], with the following expression: define the Boolean-indexed vector v(θ,ϕ)=(cos⁡θ,sin⁡θ eiϕ)v(\theta,\phi)=(\cos\theta,\sin\theta\,e^{i\phi})v(θ,ϕ)=(cosθ,sinθeiϕ), with the false coordinate first, and define, for 0≤i≤150\le i\le150≤i≤15,

ci={1,i=0,sin⁡ai−1,i>0∏j=i14cos⁡aj.c_i= \begin{cases} 1,&i=0,\\ \sin a_{i-1},&i>0 \end{cases} \prod_{j=i}^{14}\cos a_j.ci​={1,sinai−1​,​i=0,i>0​j=i∏14​cosaj​.

Then

ρ=∑i=015ci2(v(a15+4i,a16+4i)v(a15+4i,a16+4i)†)⊗(v(a17+4i,a18+4i)v(a17+4i,a18+4i)†).\rho=\sum_{i=0}^{15}c_i^2 \bigl(v(a_{15+4i},a_{16+4i})v(a_{15+4i},a_{16+4i})^\dagger\bigr) \otimes \bigl(v(a_{17+4i},a_{18+4i})v(a_{17+4i},a_{18+4i})^\dagger\bigr).ρ=i=0∑15​ci2​(v(a15+4i​,a16+4i​)v(a15+4i​,a16+4i​)†)⊗(v(a17+4i​,a18+4i​)v(a17+4i​,a18+4i​)†).

The product for i=15i=15i=15 is empty and equals 111; zero decomposition weights are permitted, while an empty decomposition cannot have weights summing to 111.

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