§6.2.1: compact convex smoothing balls
OpenQAlgorithms.Papers.Independent.Intakenext100.P07.ball_propertiesAll 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 . The symbols and denote conditional min- and max-entropy, with values and at zero. Smoothing optimizes over all subnormalized states in the purified-distance ball; every entropy radius satisfies .
For the source radius domain the subnormalized purified-distance ball is compact, convex, nested in ε, and B^0(ρ)={ρ}.
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#6.ballproperties
§6.2.1: compact convex smoothing balls, arXiv:1504.00233v5, PDF p.98. -/
theorem ball_properties [Nonempty I] (r : paperMat I) (hr : paperSubnormalized r) (e ep : ℝ)
(he : Radius r e) (hep : Radius r ep) :
IsCompact (paperBall r e) ∧ Convex ℝ (paperBall r e) ∧ (e < ep → paperBall r e ⊆ paperBall r ep) ∧ paperBall r 0 = {r} := 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 type with decidable equality, and let be a complex matrix on with , where . Let satisfy and ; thus these hypotheses exclude zero trace. Define , with matrix square roots obtained by spectral functional calculus, and
Then is compact in the finite-dimensional matrix topology and convex over ; if , then ; and . The radii and are allowed, and the inclusion is asserted conditionally on the strict inequality .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.