Lemma II.14: Conditional entropy-low projector has rank≤(n+1)^(ad)2^(nL), weight≥1−(n+1)^(ad)2^(−n inf_(H(V|P)>L)D(V||W|P)); entropy-high proje
ProvedQAlgorithms.Papers.Independent.Renew46.P43.entropyThresholdBoundsLet finite input and output sizes be , let , and choose fine spectral resolutions. The input word has its actual empirical law ; . In conditional variance bounds, , and , where . A shadow is an effect with state mass at least . Exact-type statements use a simultaneous fine basis of the commuting states , and require the indicated projector to be nonzero. Entropy-threshold projectors use finite sums of realizable count types, with arbitrary real threshold ; empty infima are and exponential tails at infinity are zero.
This is the source result with its stated operational or information-theoretic domain.
import Definitions.Def_QAlgorithms_Papers_Independent_Renew46_P43
noncomputable section
namespace QAlgorithms.Papers.Independent.Renew46.P43
open scoped BigOperators Matrix ComplexConjugate ComplexOrder ENNReal Matrix.Norms.L2Operator
open Filter MeasureTheory
open QAlgorithms.Papers.Independent.Information100.P08 (IsPure)
open QAlgorithms.Papers.Independent.Information100.P06 (Below)
open QAlgorithms.Papers.Independent.Information100.P60 (copies relativeBits)
open QAlgorithms.Papers.Independent.Dependency50.P19 (count both)
open QAlgorithms.Papers.Independent.Information100.P22 (coherentInformation)
attribute [local instance] Classical.propDecidable Classical.decEq
open QAlgorithms.Papers.Independent.Claimed50.P40 (InBlocks)
attribute [local instance] QAlgorithms.Papers.Independent.Renew46.P43.matrixMeasurableSpace
/-- Lemma II.14, PDF p.31: all three inequalities, for arbitrary REAL L. Empty
entropy constraints give +infinity, and all spectral sums range only over realizable types. -/
theorem entropyThresholdBounds {a d n : ℕ} (ha : 0 < a) (hd : 0 < d) (hn : 0 < n)
(W : FiniteChannel a (fullAlgebra d hd)) (S : Fin a → FineResolution d)
(hS : ∀ x, (S x).state = W.state x) (rho : FineResolution d)
(w : Fin n → Fin a) (P : PMF (Fin a))
(htype : ∀ x, empiricalWeight w x = (P x).toReal) (L : ℝ) :
(lowConditionalProjector S w L).trace.re ≤ (n+1 : ℝ)^(a*d) * exp2 (n * L) ∧
effectProb (wordTensor (fun i => W.state (w i))) (lowConditionalProjector S w L) ≥
1 - (n+1 : ℝ)^(a*d) * divergenceTail n (individualExponent W P L) ∧
effectProb (copies n rho.state) (highEntropyProjector rho n L) ≥
1 - (n+1 : ℝ)^d * divergenceTail n (lowEntropyDivergence rho.state L) := by sorry
end QAlgorithms.Papers.Independent.Renew46.P43
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be positive integers. Let , for , be density matrices on ; these constitute the supplied finite channel into the system whose block label is constant, so no additional vanishing of entries is required. For each , let specify a probability vector and a unitary basis such that , where . Independently, let the resolution denoted by specify a probability vector and a unitary basis , and put , where . Let be a length- word over , let be a probability mass function on that alphabet, and assume for every , where and is the real probability of . Let be any real number. Define by summing over words whose count array satisfies , where for and otherwise. Define by summing over words whose counts satisfy . Then all three bounds hold:
where
Here for under continuous functional calculus; for density matrices , unless , and otherwise equals , with . The infima and weighted divergence sums are in , with empty infimum and . Finally, and for finite . Zero probabilities are permitted; the individual-divergence constraint is strict, whereas both projector thresholds and the low-entropy constraint include equality.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.