Remark 2.13
ProvedQAlgorithms.Papers.Independent.Support50.P12.remark_2_13Let 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.
Assume and . Let be unit vectors with and no proportional to . Set , . Then
The divergences therefore fail to converge to the value at . This witnesses why the finite-slope assumption is essential.
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]
/-- Remark 2.13, PDF p.9: nonproportional rank-one approximants witness failure
of second-input continuity at either infinite recession slope. -/
theorem remark_2_13 (hI : 2 ≤ Fintype.card I) (f : ℝ → ℝ) (hf : DivergenceGenerator f)
(hw : recessionSlope f = ⊤ ∨ recessionSlope f = ⊥) (x : I → ℂ) (seq : ℕ → I → ℂ)
(hx : ∑ i, ‖x i‖ ^ 2 = 1) (hseq : ∀ n, ∑ i, ‖seq n i‖ ^ 2 = 1)
(hlim : Tendsto seq atTop (𝓝 x))
(hn : ∀ n, ¬ ∃ c : ℂ, seq n = c • x) :
let A : Mat I := fun i j => x i * conj (x j)
let B : ℕ → Mat I := fun n i j => seq n i * conj (seq n j)
Tendsto B atTop (𝓝 A) ∧ div f A A = (f 1 : EReal) ∧
(∀ n, div f A (B n) = recessionSlope f) ∧
¬ Tendsto (fun n => div f A (B n)) atTop (𝓝 (div f A A)) := 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 index type with decidable equality and . Let be continuous on , with converging at to . Let and a sequence satisfy , for every , and , and assume that for every there is no with . Put and . For positive semidefinite , let equal
when , and otherwise equal the formal total extended-real limit-selection value of this expression with replaced by as ; spectra use distinct eigenvalues, are orthogonal eigenspace projections, and division by zero is zero. Then , , and for every , while does not converge to in the extended real line.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.