Lemma I.11: There is 0≤K_H(d)≤max{(log2 3)²,(log2 d)²}, uniformly for all state lists and delta>0: Tr(rho^n PiH)≥1−K_H/delta².
ProvedQAlgorithms.Papers.Independent.Renew46.P43.entropyTypicalLet 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.11, PDF pp.13-14: K_H depends only on dimension and precedes the
block length, all factor states and the positive tolerance. -/
theorem entropyTypical (d : ℕ) (hd : 0 < d) :
∃ K : ℝ, 0 ≤ K ∧ K ≤ entropyConstant d ∧ K = entropyConstant d ∧
∀ (n : ℕ), 0 < n → ∀ (S : Fin n → FineResolution d) (delta : ℝ), 0 < delta →
effectProb (wordTensor (fun i => (S i).state)) (entropyProjector S delta) ≥ 1 - K / 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 every positive integer , put . There exists a real satisfying , , and , such that the following holds for every positive integer , every family , and every real : each consists of nonnegative real weights , , summing to one, together with a complex unitary matrix . Define , , and , where is applied by continuous functional calculus. Let
Then, with , whose entries are ,
The weights may be zero, but words using a zero weight are excluded from ; the asserted lower bound may be negative.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.