Lemma I.13: For n>0, delta,epsilon>0 and ||sum rho_i/n−rhoTilde||infty≤epsilon, Tr(rho^n PiC(rhoTilde,delta+epsilon sqrt(n)))≥1−1/delta².
ProvedQAlgorithms.Papers.Independent.Renew46.P43.weakLawLet a nonzero finite system have dimension , and choose a fine orthogonal spectral resolution, including zero eigenspaces and a basis inside degeneracies. All states are normalized, , and all typicality tolerances are positive. Write for entropy in bits, , , and . A shadow is an effect with state mass at least . In the variance bounds put , , where counts the positive eigenvalues of and is their minimum, or zero on empty support. In the constant-typical bound , including . The weak-law factor states may be noncommuting, with target and operator-norm tolerance .
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
/-- Lemma I.13, PDF p.15: the printed concentration constant is dimension free.
Factor states need not commute with each other or with the target state. -/
theorem weakLaw {d n : ℕ} (target : FineResolution d) (hn : 0 < n)
(rho : Fin n → Matrix (Fin d) (Fin d) ℂ) (hrho : ∀ i, IsDensityMatrix (rho i))
(delta epsilon : ℝ) (hdelta : 0 < delta) (hepsilon : 0 < epsilon)
(hclose : complexOperatorNorm (((1 / (n : ℝ) : ℝ) : ℂ) • (∑ i, rho i) - target.state) ≤ epsilon) :
effectProb (wordTensor rho) (constantProjector target n (delta + epsilon * Real.sqrt n)) ≥
1 - 1 / 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 , let the target resolution consist of nonnegative real weights , , summing to , and a unitary complex matrix . Define and . Let , , be complex positive semidefinite matrices of trace . For any real , suppose the operator norm induced by the Euclidean norm satisfies
For a word , let count its occurrences of , and define
Then
The assumptions force ; individual target weights may be zero, and the asserted lower bound may be negative.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.