Lemma II.10: For word of type P and delta>0, conditional Pi has weight≥1−ad/delta²; sandwich exponent −nH(W|P)±Kd sqrt(a)delta sqrt(n); rank be
ProvedQAlgorithms.Papers.Independent.Renew46.P43.conditionalTypicalLet 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.10, PDF p.29: every concentration, sandwich, rank and shadow clause.
P is the word's actual empirical distribution, rather than an unconstrained free law. -/
theorem conditionalTypical {a d n : ℕ} (ha : 0 < a) (hn : 0 < n)
(S : Fin a → FineResolution d) (w : Fin n → Fin a) (delta : ℝ) (hdelta : 0 < delta) :
let Pi := conditionalVarianceProjector S w delta
let rho := wordTensor (fun k => (S (w k)).state)
let h := wordConditionalEntropy S w
let correction := varianceConstant * d * Real.sqrt a * delta * Real.sqrt n
effectProb rho Pi ≥ 1 - (a : ℝ) * d / delta^2 ∧
Below ((exp2 (-n * h - correction) : ℂ) • Pi) (Pi * rho * Pi) ∧
Below (Pi * rho * Pi) ((exp2 (-n * h + correction) : ℂ) • Pi) ∧
Pi.trace.re ≤ exp2 (n * h + correction) ∧
Pi.trace.re ≥ (1 - (a : ℝ) * d / delta^2) * exp2 (n * h - correction) ∧
∀ (B : Matrix (Fin n → Fin d) (Fin n → Fin d) ℂ) (eta : ℝ),
IsShadow rho B eta →
B.trace.re ≥ (eta - (a : ℝ) * d / delta^2) * exp2 (n * h - correction) := 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 each have nonnegative real weights , , summing to , and a complex unitary matrix ; these assumptions also force . Let be any word and let . Set , , and . On the index set , define
where uses continuous functional calculus and counts are interpreted as real numbers. Then
where means that is positive semidefinite. Moreover, for every complex matrix indexed by and every real , if and are positive semidefinite and , then
There is no additional restriction on or on the size of ; thus the displayed lower bounds may be nonpositive. Letters absent from are allowed and contribute only conditions to .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.