Lemma I.12: (1−K_H/delta²)2^(sum H−delta sqrt(n))≤Tr PiH≤2^(sum H+delta sqrt(n)); eta-shadow trace≥(eta−K_H/delta²)2^(sum H−delta sqrt(n)).
ProvedQAlgorithms.Papers.Independent.Renew46.P43.entropyTypicalRankLet 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.12, PDF p.14: both rank estimates and the shadow lower bound,
using the same advertised dimension-only K_H as Lemma I.11. -/
theorem entropyTypicalRank {d n : ℕ} (S : Fin n → FineResolution d) (hn : 0 < n)
(delta : ℝ) (hdelta : 0 < delta) :
let h := ∑ i, vnEntropy (S i).state
let e := delta * Real.sqrt n
(1 - entropyConstant d / delta^2) * exp2 (h - e) ≤ (entropyProjector S delta).trace.re ∧
(entropyProjector S delta).trace.re ≤ exp2 (h + e) ∧
∀ (B : Matrix (Fin n → Fin d) (Fin n → Fin d) ℂ) (eta : ℝ),
IsShadow (wordTensor (fun i => (S i).state)) B eta →
B.trace.re ≥ (eta - entropyConstant d / delta^2) * exp2 (h - e) := 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 each , , consist of nonnegative real weights , , summing to , and a unitary complex matrix . These assumptions force . Define , , and , with zero-weight terms equal to zero. For every real , put , , and . Let
Then
Moreover, for every complex matrix indexed by these length- words and every real , if and are positive semidefinite and , then
Neither lower-bound prefactor is assumed nonnegative.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.