Pure-loss CQ coding properly improves endpoint time sharing
ProvedQAlgorithms.Papers.Independent.Gap48.P44.pureLoss_cq_beats_timeSharingWrite and for , with . For , fix . Let and . Let consist of all nonnegative pairs satisfying , for some . Let be the union over of the nonnegative pairs satisfying and . Then
This compares the figure’s two displayed endpoint codes at the same budget, with generated rates discardable. Proper inclusion permits shared endpoints.
import Definitions.Def_QAlgorithms_Papers_Independent_Gap48_P44
noncomputable section
namespace QAlgorithms.Papers.Independent.Gap48.P44
open Filter
open scoped ENNReal Topology
open QAlgorithms.Papers.Independent.Claimed50.P39 (g)
open QAlgorithms.Papers.Independent.Information100.P54 (thermalEntropy)
/-- PDF pp.6,8, Figure 2(a): proper improvement over the displayed same-budget
HSW/coherent-information endpoint codes, allowing common endpoints. -/
theorem pureLoss_cq_beats_timeSharing (eta : ℝ)
(heta0 : (1 / 2 : ℝ) < eta) (heta1 : eta < 1) :
let budget := 50 / (1 - eta)
cqTimeSharing (thermalEntropy (eta * budget))
(thermalEntropy (eta * budget) - thermalEntropy ((1 - eta) * budget)) ⊂
lossCQ eta budget := by sorry
end QAlgorithms.Papers.Independent.Gap48.P44
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For every real with , put and , with . The set of nonnegative real pairs for which there exists satisfying
is a proper subset of the set of nonnegative real pairs for which there exists satisfying
Thus every pair in the first explicitly defined set belongs to the second, and at least one pair belongs to the second but not the first.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.