§5.2, conditional rate shifts (43)
OpenQAlgorithms.Papers.Independent.Intakenext100.P45.conditionalRateShiftsFor nonorthogonal finite laws and a null-admissible nonrandomized test sequence, original error-rate limits exist exactly when the corresponding conditional limits exist. Their values satisfy
Both are positive. The shifts are finite and apply also to infinite rate limits.
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 p.23: §5.2, conditional rate shifts (43). -/
theorem conditionalRateShifts (p q : I → ℝ) (hp : IsLaw p) (hq : IsLaw q)
(h0 : 0 < overlapMass p q) (h1 : 0 < overlapMass q p)
(f : (k : ℕ) → ObservableWords p q (k+1) → Bool)
(hf : ∀ k, NullAdmissible p q (f k)) :
(∀ a : EReal,
HasRate (fun k => restrictedAlpha p q (f k)) a ↔
HasRate (fun k => observableAlpha p q (f k))
(((-Real.log (overlapMass p q) : ℝ) : EReal)+a)) ∧
(∀ b : EReal,
HasRate (fun k => restrictedBeta p q (f k)) b ↔
HasRate (fun k => observableBeta p q (f k))
(((-Real.log (overlapMass q p) : ℝ) : EReal)+b)) ∧
((∃ a, HasRate (fun k => observableAlpha p q (f k)) a) ↔
(∃ a, HasRate (fun k => restrictedAlpha p q (f k)) a)) ∧
((∃ b, HasRate (fun k => observableBeta p q (f k)) b) ↔
(∃ b, HasRate (fun k => restrictedBeta p q (f k)) 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
For every finite index type with decidable equality, let be nonnegative functions summing to , let , and assume and . For every natural number , let be a Boolean test on the words having positive probability under at least one of the product laws and ; assume that when , and when . Define observable errors and , with sums over that observable-word domain, and restricted errors
For a real sequence , “rate ” means convergence of to the extended real , where for and otherwise. For every extended real , has rate if and only if has rate ; for every extended real , has rate if and only if has rate . Furthermore, has some extended-real rate if and only if does, and has some extended-real rate if and only if does. Infinite rates are included, zero errors contribute to rate terms, and the word length is always , hence positive.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.