Vacuum-amplifier families: gain ordering and time-sharing improvement
ProvedQAlgorithms.Papers.Independent.Gap48.P44.amplifier_family_comparisonWrite and for , with . Fix and . For each finite gain , put , , and . Let be the union of nonnegative with and . Let be the union of nonnegative with and . Both unions use . Then
For every , the same-budget endpoint time-sharing families are properly contained in these respective families. Their endpoints are and in CQ; CE uses , , and . CQ time sharing allows , ; CE allows , , always with . At each time-sharing family equals its corresponding coding family.
This is a comparison of the explicit inner families at the figure’s fixed budget, with consumed entanglement positive; it is not an identification of unrestricted amplifier capacity.
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.16-17, Section V and Figure 6: ordered-gain inclusion of the
N_S=200,N_B=0 displayed families, plus proper time-sharing improvement at gain>1.
At identity gain the straight-line families equal endpoint time sharing. -/
theorem amplifier_family_comparison :
(∀ k1 k2 : ℝ, 1 ≤ k1 → k1 ≤ k2 →
amplifierCQ k2 ⊆ amplifierCQ k1 ∧ amplifierCE k2 ⊆ amplifierCE k1) ∧
(∀ gain : ℝ, 1 < gain →
cqTimeSharing
(thermalEntropy (gain * 200 + gain - 1) - thermalEntropy (gain - 1))
(thermalEntropy (gain * 200 + gain - 1) -
thermalEntropy ((gain - 1) * 201)) ⊂ amplifierCQ gain ∧
ceTimeSharing
(thermalEntropy (gain * 200 + gain - 1) - thermalEntropy (gain - 1))
(thermalEntropy 200 + thermalEntropy (gain * 200 + gain - 1) -
thermalEntropy ((gain - 1) * 201)) (thermalEntropy 200) ⊂ amplifierCE gain) ∧
cqTimeSharing (thermalEntropy 200) (thermalEntropy 200) = amplifierCQ 1 ∧
ceTimeSharing (thermalEntropy 200) (2 * thermalEntropy 200) (thermalEntropy 200) =
amplifierCE 1 := by sorry
end QAlgorithms.Papers.Independent.Gap48.P44
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Define , with , and, for real , put
Define four sets of nonnegative real pairs by
The declaration asserts all of the following together: for every pair of real numbers with , one has and ; for every real , both inclusions
are proper, meaning inclusion holds and each right-hand set contains a point outside the corresponding left-hand set; and at the exact equalities
hold. All existential parameters include and , and the monotonicity assertion includes equal gains and the endpoint .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.