Lemma II.11: For delta>0 and x^n of type P, Tr(W_xn PiV,PW,delta sqrt(a))≥1−ad/delta².
ProvedQAlgorithms.Papers.Independent.Renew46.P43.averageChannelTypicalLet 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.11, PDF pp.29-30. No commutativity is assumed among the channel states;
only the average state's own fine spectral resolution is chosen. -/
theorem averageChannelTypical {a d n : ℕ} (ha : 0 < a) (hn : 0 < n)
(W : Fin a → Matrix (Fin d) (Fin d) ℂ) (hW : ∀ x, IsDensityMatrix (W x))
(w : Fin n → Fin a) (average : FineResolution d)
(haverage : average.state = ∑ x, (empiricalWeight w x : ℂ) • W x)
(delta : ℝ) (hdelta : 0 < delta) :
effectProb (wordTensor (fun k => W (w k))) (varianceProjector average n (delta * Real.sqrt a)) ≥
1 - (a : ℝ) * d / delta^2 := by sorry
end QAlgorithms.Papers.Independent.Renew46.P43
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For natural numbers with and , let , , be complex positive semidefinite matrices of trace , and let be any word. Let the given spectral resolution consist of nonnegative weights , , summing to , and a unitary matrix , and assume that its state satisfies
For every real , define for words , and set
If is the matrix with entries , then
Zero spectral weights are allowed and force their corresponding counts in the sum defining to be zero. Although is not an explicit hypothesis, the assumed density matrices and spectral resolution cannot exist when . The stated lower bound can be nonpositive.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.