Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 3, conditional-test bijection

Open
QAlgorithms.Papers.Independent.Intakenext100.P45.conditionalTestBijection

by Gohan · Oct 31, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

Let finite laws p,qp,qp,q have nonempty common support BBB, with masses ψ0=p(B)>0\psi_0=p(B)>0ψ0​=p(B)>0, ψ1=q(B)>0\psi_1=q(B)>0ψ1​=q(B)>0, and conditional laws p~,q~\widetilde p,\widetilde qp​,q​. For n≥1n\ge1n≥1, restriction to BnB^nBn bijects null-admissible nonrandomized tests on D0n∪D1nD_0^n\cup D_1^nD0n​∪D1n​ with tests on BnB^nBn. Corresponding errors satisfy

αn=ψ0nα~n,βn=ψ1nβ~n.\alpha_n=\psi_0^n\widetilde\alpha_n,\qquad\beta_n=\psi_1^n\widetilde\beta_n.αn​=ψ0n​αn​,βn​=ψ1n​β​n​.

Removing doubly unobservable coordinates is essential to the bijection.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P45
Formal statement
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
Source
Asymptotic Error Rates in Quantum Hypothesis Testing, arXiv:0708.4282v1, PDF p. 23, Lemma 3, conditional-test bijection
Read-back

What the Lean code literally says, in plain math · gpt-6.1-sol

For every finite index type III with decidable equality, let p,q:I→Rp,q:I\to\mathbb Rp,q:I→R be nonnegative functions summing to 111. Let C={i:pi>0 and qi>0}C=\{i:p_i>0\ \text{and}\ q_i>0\}C={i:pi​>0 and qi​>0}, and assume that both P=∑i∈CpiP=\sum_{i\in C}p_iP=∑i∈C​pi​ and Q=∑i∈CqiQ=\sum_{i\in C}q_iQ=∑i∈C​qi​ are strictly positive. Let n>0n>0n>0 be a natural number, write p(n)(x)=∏j=0n−1pxjp^{(n)}(x)=\prod_{j=0}^{n-1}p_{x_j}p(n)(x)=∏j=0n−1​pxj​​ and q(n)(x)=∏j=0n−1qxjq^{(n)}(x)=\prod_{j=0}^{n-1}q_{x_j}q(n)(x)=∏j=0n−1​qxj​​, and let On={x∈In:p(n)(x)>0 or q(n)(x)>0}O_n=\{x\in I^n:p^{(n)}(x)>0\ \text{or}\ q^{(n)}(x)>0\}On​={x∈In:p(n)(x)>0 or q(n)(x)>0}. Restriction to Cn⊆OnC^n\subseteq O_nCn⊆On​ is a bijection from Boolean tests fff on OnO_nOn​ satisfying f(x)=falsef(x)=\mathrm{false}f(x)=false whenever q(n)(x)=0q^{(n)}(x)=0q(n)(x)=0 and f(x)=truef(x)=\mathrm{true}f(x)=true whenever p(n)(x)=0p^{(n)}(x)=0p(n)(x)=0, onto all Boolean tests on CnC^nCn. Moreover, every Boolean test fff satisfying these conditions obeys

∑x∈Onf(x)=truep(n)(x)=Pn∑x∈Cnf(x)=true∏j=0n−1pxjP,∑x∈Onf(x)=falseq(n)(x)=Qn∑x∈Cnf(x)=false∏j=0n−1qxjQ.\sum_{\substack{x\in O_n\\f(x)=\mathrm{true}}}p^{(n)}(x) = P^n\sum_{\substack{x\in C^n\\f(x)=\mathrm{true}}} \prod_{j=0}^{n-1}\frac{p_{x_j}}P, \qquad \sum_{\substack{x\in O_n\\f(x)=\mathrm{false}}}q^{(n)}(x) = Q^n\sum_{\substack{x\in C^n\\f(x)=\mathrm{false}}} \prod_{j=0}^{n-1}\frac{q_{x_j}}Q.x∈On​f(x)=true​∑​p(n)(x)=Pnx∈Cnf(x)=true​∑​j=0∏n−1​Ppxj​​​,x∈On​f(x)=false​∑​q(n)(x)=Qnx∈Cnf(x)=false​∑​j=0∏n−1​Qqxj​​​.

The hypotheses allow coordinates supported by only one law, but exclude zero common-support mass and exclude n=0n=0n=0.

Human review
  • Endorsed by Shuze Chen · Oct 31, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Gohan · Oct 31, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me