Corollary 2.10
ProvedQAlgorithms.Papers.Independent.Support50.P12.corollary_2_10Let be positive semidefinite operators on a nonzero finite-dimensional complex Hilbert space. Let be continuous on with signed extended recession slope . Write for the paper's quantum divergence, , and for the support projection. All powers vanish on the kernel, including exponent zero. Traces are representation traces.
Let satisfy the same generator assumptions as . If for every pair of probability laws on every finite alphabet, then for every density pair on any finite quantum system,
Uniformity over all alphabets includes the product spectral alphabet of a quantum pair. Classical values therefore determine the quantum extension within this class.
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P12
noncomputable section
namespace QAlgorithms.Papers.Independent.Support50.P12
open Filter MeasureTheory Set
open QAlgorithms.Papers.Independent.Information100.P60 (Mat copies)
open QAlgorithms.Papers.Independent.Information100.P30 (MatrixMap)
open QAlgorithms.Papers.Independent.Dependency50.P28 (tr LE logNonnegativeExtended pinch)
open QAlgorithms.Papers.Independent.Dependency50.P21 (channelAdjoint spectralFunction petz relativeEntropy)
open QAlgorithms.Papers.Independent.Frontier18.P17 (hs)
open QAlgorithms.Papers.Independent.Next46.P23 (Supports)
open QAlgorithms.Papers.Independent.Support21.P03 (ExtendedConvex)
open QAlgorithms (spectralProjector)
open QAlgorithms.Learning (IsDistribution)
open QAlgorithms.Papers.Independent.Information100.P04 (absOp)
open scoped BigOperators Matrix ComplexConjugate ComplexOrder ENNReal Topology Kronecker
attribute [local instance] Classical.propDecidable Classical.decEq
open QAlgorithms.Papers.Independent.Information100.P71 (supportPower)
variable {I J K : Type} [Fintype I] [DecidableEq I] [Fintype J] [DecidableEq J]
[Fintype K] [DecidableEq K]
/-- Corollary 2.10, PDF p.7: agreement on ALL finite classical alphabets determines
agreement on all quantum states. -/
theorem corollary_2_10 [Nonempty I] (f g : ℝ → ℝ)
(hf : DivergenceGenerator f) (hg : DivergenceGenerator g)
(hc : ∀ (n : ℕ) (p q : Fin n → ℝ), IsDistribution p → IsDistribution q →
div f (Matrix.diagonal (fun i => (p i : ℂ))) (Matrix.diagonal (fun i => (q i : ℂ))) =
div g (Matrix.diagonal (fun i => (p i : ℂ))) (Matrix.diagonal (fun i => (q i : ℂ))))
(A : Alg I) (rho sigma : Mat I) (hr : AlgebraDensity A rho) (hs : AlgebraDensity A sigma) :
div f rho sigma = div g rho sigma := by sorry
end QAlgorithms.Papers.Independent.Support50.P12
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, and let each be continuous on , with and each converging in the extended real line at . For either function , define on positive semidefinite matrices
using distinct eigenvalues and orthogonal eigenspace projections, division by zero equal to zero, and the formal total extended-real limit-selection operation. Assume that for every natural number and every pair of probability distributions ,
Then, for every unital complex star subalgebra of the matrices indexed by , and every positive semidefinite of real trace one, . The assumption quantifies over as well, but there is no probability distribution on that empty alphabet; singular matrices and distributions with zero entries are allowed.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.