Bounded channel-tree root-fidelity and information martingales
OpenQAlgorithms.Papers.Independent.Intakethird100.P14.channel_tree_martingalesLet be a binary-input classical–quantum channel with normalized density outputs. On a probability space, let be independent fair Bernoulli bits. Let , with trivial. Starting from , obtain from by the bad transform when and by the good transform when . Equivalently, the first bits select the split-channel index minus one in binary. Put and , with information measured in bits. Then
Both processes are integrable and the extended information is finite before conversion to a real process. In Lean the IID hypothesis is expressed equivalently by measurable bits and probability for every length- prefix cylinder. This is the stochastic form of the actual channel recursion, not a statement about freely supplied bounded processes.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakethird100_P14
noncomputable section
namespace QAlgorithms.Papers.Independent.Intakethird100.P14
open Filter MeasureTheory
open scoped ENNReal NNReal ComplexOrder BigOperators
open QAlgorithms.RealRegisters (Hilbert)
open QAlgorithms.Papers.Independent.Dependency50.P33 (IsDensity)
open QAlgorithms.Papers.Independent.Dependency50.P13 (compression)
open QAlgorithms.Papers.Independent.Renew46.P44 (wordOutput)
attribute [local instance] Classical.propDecidable Classical.decEq
/-- Lemma 11, PDF p.8: actual tree processes, with the filtration generated
by exactly the first n IID fair bits. The finite-history cylinder law is
equivalent to independence and Bernoulli(1/2) marginals. Corrects the prose
B_n to B_(n+1) after time n and the displayed missing root in the F_n law.
Finiteness, pointwise [0,1] bounds and integrability are conclusions. -/
theorem channel_tree_martingales {I Omega : Type} [MeasurableSpace Omega]
(mu : Measure Omega) [IsProbabilityMeasure mu]
(W : Bit → OutputCoefficients I) (hW : IsBinaryCqChannel W) (B : ℕ → Omega → Bool)
(hB : ∀ k, Measurable (B k))
(hfair : ∀ n (h : Fin n → Bool),
mu {w | ∀ k : Fin n, B k.val w = h k} = (1 / 2 : ℝ≥0∞) ^ n) :
(∀ n w, symmetricInformation (splitChannel W n (branchIndex B n w)) ≠ ⊤) ∧
(∀ n w, 0 ≤ fidelityProcess W B n w ∧ fidelityProcess W B n w ≤ 1 ∧
0 ≤ informationProcess W B n w ∧ informationProcess W B n w ≤ 1) ∧
(∀ n, Integrable (informationProcess W B n) mu) ∧
Supermartingale (fidelityProcess W B) (bitFiltration B hB) mu ∧
Martingale (informationProcess W B) (bitFiltration B hB) mu := by sorry
end QAlgorithms.Papers.Independent.Intakethird100.P14
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be any type, let be any probability space, and let , , be density coefficient arrays: each admits with , , real nonnegative finite quadratic forms, and summable real diagonal of sum . Let be measurable for every , and assume that for every and every ,
For an array , let be a chosen bounded operator having coefficients , or if none exists; let be a chosen positive bounded square root, or if none exists; and put , the total infinite sum. Define . Define as the supremum over all finite orthonormal families , including the empty family, of if , and otherwise of , where , , , and matrix functions use continuous functional calculus; set . For each , put , encode by , where , , and reverses bits. Write ; let be its uniform average over full -bit words used to fill coordinates after a fixed prefix and bit at ; and set . Let
where the conversion to a real number sends to . Let be the sigma-algebra generated by , so is the bottom sigma-algebra. Then for every , and and for every ; every is integrable; is a supermartingale with respect to and ; and is a martingale with respect to the same filtration and measure. Thus the processes are adapted and integrable, with almost everywhere and almost everywhere whenever ; the displayed bounds and finiteness conclusion are pointwise, including at .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.