§5.2, null-admissible reduction
ProvedQAlgorithms.Papers.Independent.Intakenext100.P45.nullAdmissibleDominationFor finite laws , , and any nonrandomized test on the observable sample space , there is a null-admissible test , accepting on and on , such that
Here are the positive supports and . Thus null admissibility loses no attainable error performance in this nonrandomized setting.
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.22,23: §5.2, null-admissible reduction. -/
theorem nullAdmissibleDomination (p q : I → ℝ) (hp : IsLaw p) (hq : IsLaw q) (n : ℕ) (hn : 0 < n)
(f : ObservableWords p q n → Bool) :
∃ g : ObservableWords p q n → Bool, NullAdmissible p q g ∧
observableAlpha p q g ≤ observableAlpha p q f ∧
observableBeta p q g ≤ observableBeta p q f := 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 , and let be a natural number with . For a word , put and , and let
For every Boolean test , there exists a Boolean test on the same domain such that, for every , implies , and implies , while
No common-support assumption is imposed; words having zero probability under both laws are absent from the test domain, and is excluded.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.