EPnI implies the centered-pure-input vacuum minimizer
OpenQAlgorithms.Papers.Independent.Support50.P06.epni_implies_moe1Assume EPnI for every positive number of modes, every transmissivity in , and every pair of independent normalized input port densities with finite input entropies. Let , and finite . Let the input be any normalized pure -mode state whose annihilation-field expectation in each mode exists and is zero, and let the independent input be . Then
The vacuum input attains this minimum: its actual output is and has exactly the displayed entropy. No finite-photon-energy or Gaussian assumption is imposed on the optimized pure input. The formal centered predicate uses convergent sums, rather than interpreting a divergent sum as zero.
Thus global EPnI implies minimum output entropy conjecture 1 with its attained value.
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P06
noncomputable section
namespace QAlgorithms.Papers.Independent.Support50.P06
open MeasureTheory Filter
open scoped ENNReal BigOperators Topology
open QAlgorithms.RealRegisters (Hilbert)
open QAlgorithms.Papers.Independent.Dependency50.P33 (State IsDensity rankOne)
open QAlgorithms.Papers.Independent.Next46.P32
(NumberString FockKernel identicalThermalKernel vacuum productCoherentKernel
jointMix bobMarginal charlieMarginal pureLoss broadcast mixedOutput
spectralEntropyNats FockPOVM realFockTracePair modeEnergy complexNormal
StrongConjecture2)
open QAlgorithms.Papers.Independent.Claimed50.P39 (g)
open QAlgorithms.Papers.Independent.Claimed50.P11 (thermalEntropyInverse)
attribute [local instance] Classical.propDecidable Classical.decEq
/-- PDF pp.4–5, Conjecture 1 and (25): a conditional implication with the
vacuum attained value n*g((1-eta)*K). Pure means norm one; centered means
convergent annihilation expectations, with no finite-energy restriction. -/
theorem epni_implies_moe1 (hepni : EntropyPhotonNumberInequality) :
MinimumOutputEntropyConjecture1 := by sorry
end QAlgorithms.Papers.Independent.Support50.P06
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Assume the entropy photon number inequality specified below. The notation and its meaning are as follows. For each positive integer , let , and regard a kernel as a complex matrix indexed by . A density kernel is a kernel admitting sequences such that is summable and , whose every finite quadratic form is real and nonnegative, and whose real diagonal entries are summable with sum . Define to be the infimum of over all representations
where the nonnegative real sequence is summable with sum , , every with has norm , and distinct vectors with positive weights are orthogonal; vectors with zero weights have no such restrictions. Here denotes the nonnegative part of a real number, embedded in , and an infimum over no such representations is . Put , with the total real logarithm convention . Define for , and otherwise
The real infimum defining uses value if its set is empty. To define the mixing operation, for nonnegative integers , let unless , and otherwise let
All subtraction in natural-number exponents and indices is truncated at zero. For pairs of number strings, set , and define
These unrestricted complex series use the total sum convention, with value for a nonsummable series. Let equal when , and otherwise, and let
The assumed inequality says that for every positive integer , every , and every pair of density kernels with ,
with operations in . Under this assumption, for every positive integer , every , and every real , all three of the following hold:
and, for every unit vector satisfying, for each coordinate , the convergent unordered-sum condition
one has
The coordinate sums required of must actually converge to zero; a total sum assigned zero through nonsummability does not meet that requirement. The quantifiers exclude and include and both endpoints .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.