§3.4 (3.53)–(3.54): angular triangle and quasi-convexity
OpenQAlgorithms.Papers.Independent.Intakenext100.P07.purified_angles_and_mixturesAll 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 is squared algebraic fidelity, is squared generalized fidelity, is purified distance, and .
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.
This result records the source’s operational or structural relation, with the stated endpoint and attainment clauses retained.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P07
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
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be a finite nonempty index type with decidable equality. Call a matrix subnormalized when and , and define, with matrix square roots taken by continuous functional calculus,
Two assertions hold. First, for every three subnormalized matrices and real numbers satisfying , if and , then
Second, for every four subnormalized matrices and every real ,
Subnormalized matrices include the zero matrix, and the mixture assertion includes both endpoints of .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.