Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§3.4 (3.53)–(3.54): angular triangle and quasi-convexity

Open
QAlgorithms.Papers.Independent.Intakenext100.P07.purified_angles_and_mixtures

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

prove2quantum

All quantum systems below are finite-dimensional complex Hilbert spaces of positive dimension, and logarithms are binary. A normalized state is positive semidefinite with trace one; a subnormalized state has trace at most one. Marginals are partial traces. Here FFF is squared algebraic fidelity, F∗F_*F∗​ is squared generalized fidelity, P=1−F∗P=\sqrt{1-F_*}P=1−F∗​​ is purified distance, and Δ(ρ,τ)=max⁡0≤M≤I∣Tr⁡((ρ−τ)M)∣\Delta(\rho,\tau)=\max_{0\le M\le I}|\operatorname{Tr}((\rho-\tau)M)|Δ(ρ,τ)=max0≤M≤I​∣Tr((ρ−τ)M)∣.

For positive angles with sum≤π/2, P(ρ,σ)≤sinφ and P(σ,τ)≤sinθ imply P(ρ,τ)≤sin(φ+θ)<sinφ+sinθ. Also P(λρ1+(1−λ)ρ2,λτ1+(1−λ)τ2)≤max_i P(ρi,τi) for 0≤λ≤1.

P(ρ,τ)≤sin⁡(φ+ϑ)<sin⁡φ+sin⁡ϑ,P(λρ1+(1−λ)ρ2,λτ1+(1−λ)τ2)≤max⁡iP(ρi,τi).P(\rho,\tau)\le\sin(\varphi+\vartheta)<\sin\varphi+\sin\vartheta,\qquad P(\lambda\rho_1+(1-\lambda)\rho_2,\lambda\tau_1+(1-\lambda)\tau_2)\le\max_iP(\rho_i,\tau_i).P(ρ,τ)≤sin(φ+ϑ)<sinφ+sinϑ,P(λρ1​+(1−λ)ρ2​,λτ1​+(1−λ)τ2​)≤imax​P(ρi​,τi​).

This result records the source’s operational or structural relation, with the stated endpoint and attainment clauses retained.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P07
Formal statement
noncomputable section

open Filter

open scoped BigOperators Matrix ComplexConjugate ComplexOrder Matrix.Norms.L2Operator Topology

namespace QAlgorithms.Papers.Independent.Intakenext100.P07

attribute [local instance] Classical.propDecidable Classical.decEq

variable {I J A B C D X Y Z : Type*}

variable [Fintype I] [DecidableEq I] [Fintype J] [DecidableEq J]

variable [Fintype A] [DecidableEq A] [Fintype B] [DecidableEq B]

variable [Fintype C] [DecidableEq C] [Fintype D] [DecidableEq D]

variable [Fintype X] [DecidableEq X] [Fintype Y] [DecidableEq Y]

variable [Fintype Z] [DecidableEq Z]

/-- NODE paper:1504.00233#3.purifiedquasiconvex
§3.4 (3.53)–(3.54): angular triangle and quasi-convexity, arXiv:1504.00233v5, PDF p.48. -/
theorem purified_angles_and_mixtures [Nonempty I] :
    (∀ r s t : paperMat I, paperSubnormalized r → paperSubnormalized s → paperSubnormalized t →
      ∀ a b : ℝ, 0 < a → 0 < b → a+b ≤ Real.pi/2 → purified r s ≤ Real.sin a → purified s t ≤ Real.sin b →
      purified r t ≤ Real.sin (a+b) ∧ Real.sin (a+b) < Real.sin a+Real.sin b) ∧
    (∀ r s t u : paperMat I, paperSubnormalized r → paperSubnormalized s → paperSubnormalized t → paperSubnormalized u →
      ∀ a : ℝ, a ∈ Set.Icc 0 1 → purified (paperMix a r s) (paperMix a t u) ≤ max (purified r t) (purified s u)) := by sorry

end QAlgorithms.Papers.Independent.Intakenext100.P07

end
Source
Quantum Information Processing with Finite Resources -- Mathematical Foundations, arXiv:1504.00233v5, PDF p. 48, §3.4 (3.53)–(3.54): angular triangle and quasi-convexity
Read-back

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

Let III be a finite nonempty index type with decidable equality. Call a matrix vvv subnormalized when v⪰0v\succeq0v⪰0 and Re⁡tr⁡v≤1\operatorname{Re}\operatorname{tr}v\le1Retrv≤1, and define, with matrix square roots taken by continuous functional calculus,

R(v,w)=Re⁡tr⁡v wv,P(v,w)=1−(R(v,w)+(1−Re⁡tr⁡v)(1−Re⁡tr⁡w))2.R(v,w)=\operatorname{Re}\operatorname{tr}\sqrt{\sqrt v\,w\sqrt v}, \qquad P(v,w)=\sqrt{1-\left(R(v,w)+ \sqrt{(1-\operatorname{Re}\operatorname{tr}v) (1-\operatorname{Re}\operatorname{tr}w)}\right)^2}.R(v,w)=Retrv​wv​​,P(v,w)=1−(R(v,w)+(1−Retrv)(1−Retrw)​)2​.

Two assertions hold. First, for every three subnormalized matrices r,s,tr,s,tr,s,t and real numbers a,b>0a,b>0a,b>0 satisfying a+b≤π/2a+b\le\pi/2a+b≤π/2, if P(r,s)≤sin⁡aP(r,s)\le\sin aP(r,s)≤sina and P(s,t)≤sin⁡bP(s,t)\le\sin bP(s,t)≤sinb, then

P(r,t)≤sin⁡(a+b)andsin⁡(a+b)<sin⁡a+sin⁡b.P(r,t)\le\sin(a+b) \quad\text{and}\quad \sin(a+b)<\sin a+\sin b.P(r,t)≤sin(a+b)andsin(a+b)<sina+sinb.

Second, for every four subnormalized matrices r,s,t,ur,s,t,ur,s,t,u and every real a∈[0,1]a\in[0,1]a∈[0,1],

P(ar+(1−a)s,  at+(1−a)u)≤max⁡{P(r,t),P(s,u)}.P\bigl(ar+(1-a)s,\;at+(1-a)u\bigr) \le\max\{P(r,t),P(s,u)\}.P(ar+(1−a)s,at+(1−a)u)≤max{P(r,t),P(s,u)}.

Subnormalized matrices include the zero matrix, and the mixture assertion includes both endpoints of [0,1][0,1][0,1].

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