Conditional single-letter and activated weak locking capacity formulas
OpenQAlgorithms.Papers.Independent.Intakenext100.P63.conditional_singleLetter_and_activationAssume either the global constrained minimum-output Arimoto Renyi entropy additivity conjecture (16), for every pair of finite POVMs and normalized constraint states at every order , or the uniform IID smooth conditional min-entropy relation (17): for every finite normalized ensemble, , and slack , eventually every collective POVM satisfies . All smoothing uses normalized states and half trace-norm distance.
For a channel with a cq complementary channel in a fixed input basis,
where optimizes every finite normalized mixed ensemble. Furthermore, for any finite-dimensional channel with its fixed normalized Stinespring dilation,
All spaces are nonzero, rates are in bits, and ordinary locking capacity permits only a sublinear preshared independent uniform secret. Both conclusions retain the conjectural premise. The finite-ensemble maximum defining the upper information is attained. The activated formula charges for the noiseless factor and does not equate ordinary and activated capacities in general.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P63
noncomputable section
namespace QAlgorithms.Papers.Independent.Intakenext100.P63
open QAlgorithms Filter
open QAlgorithms.Papers.Independent.Information100.P63 (Mat)
open QAlgorithms.Papers.Independent.Information100.P04 (Measurement)
open QAlgorithms.Papers.Independent.Information100.P27 (shannon labelInformation)
open QAlgorithms.Papers.Independent.Information100.P71 (channelPower dilationMap SupportIncluded)
open QAlgorithms.Papers.Independent.Bridge50.P47 (SymmetricIndex universalSymmetricDilation)
open QAlgorithms.Learning (IsDistribution)
open scoped Matrix ComplexConjugate ComplexOrder
attribute [local instance] Classical.propDecidable Classical.decEq
/-- PDF pp.14–15, Theorem 15: BOTH clauses retain the global conjectural premise.
Activated keyedCapacity is distinct from ordinary weak locking keyedCapacity. -/
theorem conditional_singleLetter_and_activation
(hconj : ConstrainedRenyiAdditivity ∨ IIDUncertainty) :
(∀ (a b e : ℕ), 0 < a → 0 < b → 0 < e →
∀ V : Matrix (Fin b × Fin e) (Fin a) ℂ, Vᴴ * V = 1 →
∀ rho : Fin a → Mat (Fin e), CqComplement (environment V) rho →
keyedCapacity (dilationMap V) (environment V) true = optimizedEquivocation rho ∧
optimizedEquivocation rho = upperInformation (dilationMap V) (environment V)) ∧
(∀ (a b e : ℕ), 0 < a → 0 < b → 0 < e →
∀ V : Matrix (Fin b × Fin e) (Fin a) ℂ, Vᴴ * V = 1 →
activatedCapacity (dilationMap V) (environment V) = regularizedUpper (dilationMap V) (environment V) ∧
keyedCapacity (dilationMap V) (environment V) true ≤ activatedCapacity (dilationMap V) (environment V) ∧
(∃ (m : ℕ) (p : Fin m → ℝ) (sigma : Fin m → Mat (Fin a)),
IsDistribution p ∧ (∀ i, IsDensityMatrix (sigma i)) ∧
upperInformation (dilationMap V) (environment V) =
labelInformation p (fun i => dilationMap V (sigma i)) - shannon p +
accessibleEquivocation p (fun i => environment V (sigma i)))) := by sorry
end QAlgorithms.Papers.Independent.Intakenext100.P63
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Assume at least one of the following two propositions. The first states that for all positive integers , all natural numbers , measurements on and consisting of positive semidefinite effects summing to the identity, density matrices on these respective spaces, and every , one has , where
The second proposition states that for all positive integers , every probability vector on , every family of density matrices on , every , and every , there exists such that for all and all measurements on with a positive finite number of outcomes,
Here, for any finite ensemble, is the infimum over measurements with a positive finite number of outcomes of
and is the supremum over density matrices satisfying of the real conversion of
with this inner supremum taken in the extended real line and either infinity converted to ; . To state the conclusions, define , with the supremum over probability priors, , for the continuous functional calculus function , and . For maps , put
Define as the real supremum of nonnegative rates attained by sequences of keyed codes of lengths , each with positive message and key counts , density matrices , and for every key a decoding measurement . Such sequences must satisfy , average error , and, for every , eventually . They must also satisfy, for every , eventually that every finite measurement with a positive number of outcomes on the environment output admits a probability vector with
For , define on the input space enlarged by through
and set and . Under the stated disjunctive assumption, for every positive and every matrix satisfying , put and . For every density-matrix family satisfying when and otherwise, the conclusions are
For every such isometry , without an additional condition on its complementary map, the conclusions are
and there exist , a probability vector on , and density matrices on such that
Every density matrix in these definitions is positive semidefinite with trace ; probability weights may be zero. The natural-number indices are not explicitly required to be positive, although their probability-vector requirements exclude zero. Logarithms and quotients are total real operations, including and division by zero equal to zero.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.