Theorem 2.31 proof — support of positive convex summands
OpenWatrousTQI.psd_convex_summand_rangeLet be positive semidefinite complex matrices, , and let . If
then
Both coefficients are strictly positive; no invertibility or fixed rank is assumed. This isolates the support-containment step used for Choi matrices of channels in a proper convex decomposition.
import Mathlib set_option autoImplicit false noncomputable section open scoped Matrix ComplexConjugate ComplexOrder BigOperators
namespace WatrousTQI
theorem psd_convex_summand_range {n : ℕ} (hn : 0 < n)
(P Q₀ Q₁ : Matrix (Fin n) (Fin n) ℂ)
(h₀ : Q₀.PosSemidef) (h₁ : Q₁.PosSemidef)
(t : ℝ) (ht₀ : 0 < t) (ht₁ : t < 1)
(hP : P = t • Q₀ + (1 - t) • Q₁) :
LinearMap.range Q₀.mulVecLin ≤ LinearMap.range P.mulVecLin ∧
LinearMap.range Q₁.mulVecLin ≤ LinearMap.range P.mulVecLin := by sorry
end WatrousTQI
Read-back
What the Lean code literally says, in plain math · GPT-6 (exact model identifier unavailable)
For every positive natural number , all complex matrices , and every real number , if and are positive semidefinite, , and , then the column space of is contained in the column space of and the column space of is contained in the column space of . The column space is the range of matrix multiplication as a complex-linear map, and positive semidefiniteness means Hermitian symmetry and nonnegative quadratic form on every complex column vector. The real coefficients act by scalar multiplication on complex matrices. The conclusion is the conjunction of the two inclusions, not equality of any of these spaces. The case and the weights are excluded; zero and singular matrices are allowed, and no separate positive semidefiniteness hypothesis is imposed on beyond the displayed equality and the assumptions on the two summands.