Theorem 4, classical HBCL for arbitrary laws
OpenQAlgorithms.Papers.Independent.Intakenext100.P45.arbitraryClassicalHBCLFor arbitrary finite probability laws , the full HBCL achievability and strict converse hold with the extended exponent defined by (42). In particular,
where and . Infinite exponents at are achievable with identically zero type-I error. Orthogonal laws require no conditional distribution on an empty overlap.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P45
noncomputable section
namespace QAlgorithms.Papers.Independent.Intakenext100.P45
open QAlgorithms Filter
open scoped Matrix ComplexConjugate ComplexOrder ENNReal BigOperators Topology
open QAlgorithms.Papers.Independent.Information100.P07
(support positivePart positiveProjection IsProjection)
open QAlgorithms.Papers.Independent.Information100.P56 (IsLaw)
open QAlgorithms.Papers.Independent.Information100.P60 (Mat copies)
open QAlgorithms.Papers.Independent.Dependency50.P28 (logNonnegativeExtended relativeEntropy)
open QAlgorithms.Papers.Independent.Claimed50.P15 (positiveMatrixRpow)
attribute [local instance] Classical.propDecidable Classical.decEq
variable {I J : Type} [Fintype I] [DecidableEq I] [Fintype J] [DecidableEq J]
/-- arXiv:0708.4282v1, PDF pp.24,25: Theorem 4, classical HBCL for arbitrary laws. -/
theorem arbitraryClassicalHBCL (p q : I → ℝ) (hp : IsLaw p) (hq : IsLaw q) :
ClassicalHBCL p q ∧
(∀ r : ℝ, 0 ≤ r → (r : EReal) < -logNonnegativeExtended (overlapMass q p) →
classicalExponent p q r=⊤) ∧
(∀ r : ℝ, 0 < r → classicalExponent p q r=⊤ →
∃ f : ClassicalTestSequence I, ∃ b : EReal,
(∀ k, alphaSeq p f k=0) ∧ HasRate (betaSeq q f) b ∧ (r : EReal) ≤ b) := by sorry
end QAlgorithms.Papers.Independent.Intakenext100.P45
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be a finite type with decidable equality, and let be nonnegative laws of total mass one. Set for and otherwise, and define
using extended-real arithmetic and real powers with . A test sequence is a family , with errors and ; a sequence has rate when in the extended reals. The declaration asserts that, for every , some test sequence has -rate and -rate , and that every test sequence having rates satisfies whenever and . It also asserts, with , that for every real satisfying , and that whenever and , there exists a test sequence with for every and with a -rate . There is no positive-overlap hypothesis: is included, in which case and the stated threshold condition holds for every finite .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.