Direct pinched tests with finite-block type-II bound
OpenQAlgorithms.Papers.Independent.Intakethird100.P05.direct_pinched_testsLet and be arbitrary density operators on the same finite-dimensional complex Hilbert space. Use the support-aware Umegaki relative entropy in nats, equal to when the support of is not contained in that of . For a real , set
where braces denote the strict positive spectral projection. These are valid effects and satisfy
Here and . Every finite real is permitted when the entropy is infinite. This assertion identifies a particular sequence of tests and retains a bound at each positive blocklength.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakethird100_P05
noncomputable section
namespace QAlgorithms.Papers.Independent.Intakethird100.P05
open scoped Matrix ComplexConjugate ComplexOrder BigOperators
open Filter Topology QAlgorithms
open QAlgorithms.Papers.Independent.Information100.P60 (Mat copies)
open QAlgorithms.Papers.Independent.Information100.P07 (positiveProjection)
open QAlgorithms.Papers.Independent.Dependency50.P28 (tr pinch typeI accept)
open QAlgorithms.Papers.Independent.Claimed50.P45 (pinchedTest)
open QAlgorithms.Papers.Independent.Information100.P58 (Distribution)
open QAlgorithms.Papers.Independent.Information100.P27 (average)
open QAlgorithms.Papers.Independent.Dependency50.P07 (wordProb)
open QAlgorithms.Papers.Independent.Dependency50.P35 (directSum)
open QAlgorithms.Papers.Independent.Renew46.P44 (wordOutput)
attribute [local instance] Classical.propDecidable Classical.decEq
variable {X I : Type} [Fintype X] [DecidableEq X] [Fintype I] [DecidableEq I]
/-- PDF p.9, (52),(54),(56): the specific sigma-pinched strict spectral tests
have vanishing type-I error for a < D(rho||sigma), and the type-II bound at
EVERY positive length. Support mismatch gives D=+infinity. Lemma 4's unpinned
negative powers are not added as assumptions or used in the statement. -/
theorem direct_pinched_tests (rho sigma : Mat I)
(hrho : IsDensityMatrix rho) (hsigma : IsDensityMatrix sigma)
(a : ℝ) (ha : (a : EReal) <
(QuantumLoss.umegakiEntropy rho sigma hrho hsigma : EReal)) :
Tendsto (fun k : ℕ => typeI rho (k + 1) (pinchedTest rho sigma (k + 1) a))
atTop (𝓝 0) ∧
(∀ n : ℕ, 1 ≤ n →
IsEffect (pinchedTest rho sigma n a) ∧
accept sigma n (pinchedTest rho sigma n a) ≤ Real.exp (-(n : ℝ) * a)) := by sorry
end QAlgorithms.Papers.Independent.Intakethird100.P05
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For every finite type with decidable equality, let be positive semidefinite complex matrices on , each of trace . Define as follows: if , then
where both matrix functions use continuous functional calculus and the real logarithm has its total value ; otherwise . Let satisfy , with this comparison made in the extended real numbers. For each , define and , let , summing over the distinct eigenvalues of with their spectral projections, and let be the orthogonal projection onto the range of the positive part of . Then
and, for every natural number , both and are positive semidefinite and
No support inclusion is assumed: when it fails, the threshold hypothesis holds for every finite real . The theorem makes no assertion at block length .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.