Unnumbered (44)–(45): pure-state operator coefficients and support lower bound
ProvedQAlgorithms.Papers.Independent.Gap48.P36.pure_coefficientsAll Hilbert spaces have positive finite dimension. Channels are completely positive and trace preserving; conjugates use the same normalized pure-environment dilation. Let be a basis of unitaries on , including , with . For a density matrix define , with the identity label. Then
For pure , , so at least coefficients are nonzero. Every finite set containing their support, and any subgroup generated by it when a label group is given, has at least elements. The printed intermediate factor is corrected to .
import Definitions.Def_QAlgorithms_Papers_Independent_Gap48_P36
noncomputable section
namespace QAlgorithms.Papers.Independent.Gap48.P36
open scoped BigOperators Matrix Kronecker ComplexConjugate ComplexOrder ENNReal
open QAlgorithms.Papers.Independent.Claimed50.P48
open QAlgorithms.Papers.Independent.Information100.P67 (receiverChannel complementaryChannel)
open QAlgorithms.Papers.Independent.Information100.P56 (entropy normalizedChoi)
open QAlgorithms.Papers.Independent.Information100.P50 (schattenNorm)
open QAlgorithms.Papers.Independent.Information100.P03 (convexRoof)
open QAlgorithms.Papers.Independent.Dependency50.P45 (holevoCapacity)
attribute [local instance] Classical.propDecidable Classical.decEq
variable {A B C D E K L A2 B2 C2 : Type*}
variable [Fintype A] [DecidableEq A] [Fintype B] [DecidableEq B]
variable [Fintype C] [DecidableEq C] [Fintype D] [DecidableEq D]
variable [Fintype E] [DecidableEq E] [Fintype K] [DecidableEq K]
variable [Fintype L] [DecidableEq L] [Fintype A2] [DecidableEq A2]
variable [Fintype B2] [DecidableEq B2] [Fintype C2] [DecidableEq C2]
/-- Unnumbered (44)–(45), PDF p.17: expansion, bounds, pure basisCoefficient mass and support.
Correction: orthogonality gives Tr(rho^2)=(1/d) sum |v_m|^2; the preceding
printed 1/d^2 is inconsistent with both (44) and (45). -/
theorem pure_coefficients [Nonempty A] [Nonempty K]
(T : UnitaryBasis A K) (rho : Matrix A A ℂ) (hrho : IsDensityMatrix rho) :
rho = (Fintype.card A : ℂ)⁻¹ • (∑ k, basisCoefficient T.matrix rho k • T.matrix k) ∧
basisCoefficient T.matrix rho T.identityLabel = 1 ∧
(∀ k, ‖basisCoefficient T.matrix rho k‖ ≤ 1) ∧
(∀ psi : EuclideanSpace ℂ A, IsState psi → rho = pureDensity psi →
(∑ k ∈ Finset.univ.erase T.identityLabel, ‖basisCoefficient T.matrix rho k‖^2) =
(Fintype.card A : ℝ) - 1 ∧
Fintype.card A ≤ (Finset.univ.filter (fun k => basisCoefficient T.matrix rho k ≠ 0)).card ∧
(∀ S : Finset K, (∀ k, basisCoefficient T.matrix rho k ≠ 0 → k ∈ S) → Fintype.card A ≤ S.card) ∧
(∀ groupStructure : AddGroup K,
letI : AddGroup K := groupStructure
Fintype.card A ≤ Nat.card
(AddSubgroup.closure {k | basisCoefficient T.matrix rho k ≠ 0}))) := by sorry
end QAlgorithms.Papers.Independent.Gap48.P36
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be finite nonempty types with decidable equality, put , and let matrices on , with distinguished label , satisfy , , , and if and otherwise. For every positive semidefinite complex matrix on with , define . Then
For every norm-one vector such that , all the following additionally hold:
Every finite subset containing every label with satisfies ; and for every choice of additive group structure on the underlying type , is at most the cardinality of the smallest additive subgroup containing . No compatibility between this group structure and the matrices is required. The assertions include , where the sum excluding is empty.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.