Lemma 3, conditional-test bijection
OpenQAlgorithms.Papers.Independent.Intakenext100.P45.conditionalTestBijectionLet finite laws have nonempty common support , with masses , , and conditional laws . For , restriction to bijects null-admissible nonrandomized tests on with tests on . Corresponding errors satisfy
Removing doubly unobservable coordinates is essential to the bijection.
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: Lemma 3, conditional-test bijection. -/
theorem conditionalTestBijection (p q : I → ℝ) (hp : IsLaw p) (hq : IsLaw q)
(h0 : 0 < overlapMass p q) (h1 : 0 < overlapMass q p) (n : ℕ) (hn : 0 < n) :
Function.Bijective (fun f : {f : ObservableWords p q n → Bool // NullAdmissible p q f} =>
restrictTest p q f.1) ∧
(∀ f : ObservableWords p q n → Bool, NullAdmissible p q f →
observableAlpha p q f = (overlapMass p q)^n * restrictedAlpha p q f ∧
observableBeta p q f = (overlapMass q p)^n * restrictedBeta 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 . Let , and assume that both and are strictly positive. Let be a natural number, write and , and let . Restriction to is a bijection from Boolean tests on satisfying whenever and whenever , onto all Boolean tests on . Moreover, every Boolean test satisfying these conditions obeys
The hypotheses allow coordinates supported by only one law, but exclude zero common-support mass and exclude .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.