Iid pinched information-spectrum lower tail
OpenQAlgorithms.Papers.Independent.Intakethird100.P05.iid_pinched_lower_tailLet be a channel from a finite alphabet to density operators on a finite-dimensional complex Hilbert space, and let be any input probability law. Write , in nats, , and . Let , where pinching preserves the full eigenspaces corresponding to distinct eigenvalues. For every real ,
The braces denote the nonpositive spectral projector, including zero eigenvalues. Both occurrences of the output state inside the trace expression are pinched. Singular output states and zero input weights are allowed. This lower-tail limit links iid information to coding.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakethird100_P05
noncomputable section
namespace QAlgorithms.Papers.Independent.Intakethird100.P05
open scoped Matrix ComplexConjugate ComplexOrder BigOperators
open Filter Topology QAlgorithms
open QAlgorithms.Papers.Independent.Information100.P60 (Mat copies)
open QAlgorithms.Papers.Independent.Information100.P07 (positiveProjection)
open QAlgorithms.Papers.Independent.Dependency50.P28 (tr pinch typeI accept)
open QAlgorithms.Papers.Independent.Claimed50.P45 (pinchedTest)
open QAlgorithms.Papers.Independent.Information100.P58 (Distribution)
open QAlgorithms.Papers.Independent.Information100.P27 (average)
open QAlgorithms.Papers.Independent.Dependency50.P07 (wordProb)
open QAlgorithms.Papers.Independent.Dependency50.P35 (directSum)
open QAlgorithms.Papers.Independent.Renew46.P44 (wordOutput)
attribute [local instance] Classical.propDecidable Classical.decEq
variable {X I : Type} [Fintype X] [DecidableEq X] [Fintype I] [DecidableEq I]
/-- PDF p.4, Lemma 1, (16): the iid pinched lower tail, including spectral ties,
tends to zero for every real a < I(p). Singular states and zero input weights
are permitted. The quantity is constructed from W and p, not a free sequence. -/
theorem iid_pinched_lower_tail (W : DensityOutputChannel X I) (p : Distribution X)
(a : ℝ) (ha : a < channelInformationNats W p) :
Tendsto (fun k : ℕ => pinchedLowerTail W p (k + 1) a) atTop (𝓝 0) := by sorry
end QAlgorithms.Papers.Independent.Intakethird100.P05
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For finite index types with decidable equality, let be positive semidefinite complex matrices of trace , and let with . Set and , where , , using continuous functional calculus and natural logarithms. For , define , , and . Let , where the sum ranges over the distinct eigenvalues of and is its spectral projection at . For a Hermitian matrix , let be the orthogonal projection onto the range of applied to . For every real ,
Zero eigenvalues are excluded from , and may be negative.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.