Lemma 3: smooth max-entropy of the pass-conditioned key pair
OpenQAlgorithms.Papers.Independent.Intakethird100.P01.smoothMaxEntropyAfterPassingLet be positive integers and . Give two -bit strings an arbitrary normalized joint law. Independently choose a uniform -subset of positions for testing and retain the complementary positions in their original order. Let denote the test relative Hamming distance. For , condition on and assume . Let be the resulting normalized marginal of the complementary key strings, without an additional test-statistic register. For , define
With purified-distance smoothing over subnormalized quantum states,
Here on , with , and for . If , the zero substate is allowed and the extended smooth max-entropy is .
This bounds the residual uncertainty of the key strings after a successful random-sample test; it makes no independent-bit assumption.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakethird100_P01
namespace QAlgorithms.Papers.Independent.Intakethird100.P01
open scoped BigOperators ComplexConjugate ComplexOrder
-- Accepted extended entropy: the finite-real smoothing helper excludes radius >= 1.
open QAlgorithms.Papers.Independent.Information100.P67
(IsSubnormalized purifiedDistance conditionalMaxEntropy smoothConditionalMaxEntropyExtended)
noncomputable section
/-- PDF pp.13--14, Lemma 3, Eq.(S15): smooth max-entropy of the key-pair marginal
conditioned on passing, with epsilon_prime=epsilon/sqrt(p_pass). No Lambda register is
retained. For epsilon_prime>=1 the extended entropy allows the zero substate.
Source correction (printed / changed / why): S15 prints only epsilon>0; the referenced
entropy definition [53, Definition 10] restricts the smoothing radius below one at a
normalized center. We use 0<epsilon<=1 (the real domain of sqrt(log(1/epsilon))) and
explicitly extend the full subnormalized smoothing ball to all radii with EReal values.
This agrees with the referenced entropy below radius one and gives minus infinity at
radius>=1, preserving the printed epsilon_prime without an extra epsilon<sqrt(p_pass)
hypothesis. All constants and the displayed entropy inequality are unchanged. -/
theorem smoothMaxEntropyAfterPassing (n k : ℕ) (hn : 0 < n) (hk : 0 < k)
(P : StringPair (n + k) → ℝ) (hP : ∀ z, 0 ≤ P z) (hPsum : ∑ z, P z = 1)
(Q : ℝ) (hQ0 : 0 ≤ Q) (hQ1 : Q ≤ 1) (hpass : 0 < passProbability P Q)
(epsilon : ℝ) (hepsilon0 : 0 < epsilon) (hepsilon1 : epsilon ≤ 1) :
smoothConditionalMaxEntropyExtended (classicalDensity (keyLawGivenPass P Q))
(epsilon / Real.sqrt (passProbability P Q)) ≤
((n : ℝ) * truncatedBinaryEntropy (Q + samplingDeviation n k epsilon) : ℝ) := by sorry
end
end QAlgorithms.Papers.Independent.Intakethird100.P01
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For all positive natural numbers , let be a real function on pairs of Boolean strings of length with , and give every triple with weight . For every , let be the total weight of triples for which . Restrict both strings to the complement of , listing its indices in increasing order, and let be the total weight of passing triples producing the length- strings , divided by . Let be the diagonal complex matrix with diagonal . For every real , put
The assertion is
as an inequality of extended real numbers, with the real right-hand side embedded into them. Here
and , while for ,
The matrix is indexed by the second length- string, and acts on the first; matrix square roots are defined by continuous functional calculus. The function equals for and equals for , with and for negative . The smoothing infimum permits , which contributes whenever it satisfies the distance bound; in particular this occurs when . No assumption that or that is imposed.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.