One common photon-sharing parameter for block ensembles
OpenQAlgorithms.Papers.Independent.Gap48.P44.pureLoss_common_parameterWrite and for , with . Assume Strong Conjecture 2: for every positive number of modes, among normalized states of a given entropy, mixing with independent vacuum minimizes output entropy at the product thermal state of that entropy. Fix , , , and any normalized finite ensemble of arbitrary, possibly entangled, -mode Fock states. Its unconditional mean total photon number is at most . Write , for spectral entropy in bits, for the memoryless vacuum beam-splitter channel, and for its fixed other-output complement. There exists one such that
All weighted entropy sums are formed as extended nonnegative quantities before any conversion to real, so zero-mass labels may have infinite individual entropy. This is the announced four-bound result, rather than the different exponential bounds requested by a consuming paper.
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.11-12, announced (60)-(63): ONE common lambda for arbitrary
normalized, possibly entangled block states, under Strong Conjecture 2.
No individual entropy finiteness is imposed on zero-probability labels.
The finite unconditional budget is averaged across all n positive uses. Every RHS
has its announced factor n; inconsistent intermediate proof lines are not reused. -/
theorem pureLoss_common_parameter (hconjecture : Fock.StrongConjecture2)
(n : ℕ) (hn : 0 < n) (eta budget : ℝ)
(heta0 : (1 / 2 : ℝ) ≤ eta) (heta1 : eta ≤ 1) (hbudget : 0 ≤ budget)
{X : Type*} [Fintype X] (e : BlockEnsemble X n)
(henergy : e.energy ≤ ENNReal.ofReal ((n : ℝ) * budget)) :
∃ share ∈ Set.Icc (0 : ℝ) 1,
e.entropyAverage id ≤ ENNReal.ofReal ((n : ℝ) * thermalEntropy (share * budget)) ∧
blockEntropy (Fock.pureLoss n eta e.average) ≤
ENNReal.ofReal ((n : ℝ) * thermalEntropy (eta * budget)) ∧
e.entropyAverage (Fock.pureLoss n eta) ≤
ENNReal.ofReal ((n : ℝ) * thermalEntropy (eta * share * budget)) ∧
ENNReal.ofReal ((n : ℝ) * thermalEntropy ((1 - eta) * share * budget)) ≤
e.entropyAverage (lossComplement n eta) := by sorry
end QAlgorithms.Papers.Independent.Gap48.P44
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Write , regarded as a nonnegative extended real when necessary, and put and , with . The following notation specifies the kernels and entropy appearing in the assertion. For each number of modes , let , including indices with zero coordinates. A density kernel means that there exist with and , every finite quadratic form is real and nonnegative, and with summable real diagonal. Define to be the infimum, in , of
over all sequences and such that with summable weights, whenever , distinct positive-weight vectors are orthogonal, and . Zero-weight vectors need not be normalized or orthogonal, and an empty set of such resolutions gives . Put . Let be if and otherwise, and let
For real , define
where natural-number subtraction truncates at zero and powers with exponent zero equal . For pairs and in , set
The complex infinite sums here are the total sums in the declaration, which take value zero when the corresponding family is not summable. Assume the following universal hypothesis: for every integer , every , and every ,
and every density kernel with satisfies . Now let be a natural number, let and be real, and let be any finite type equipped with a probability mass function and a density kernel on for every , including labels of probability zero. Write
If , there exists one common such that
All four inequalities are in and use extended-real arithmetic; the hypotheses include and , and the witness may be or . The probability mass function requires the finite label type to be nonempty.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.