Theorem 1: unrestricted REE border minimizer
OpenQAlgorithms.Papers.Independent.Intakenext100.P46.ree_borderLet be an entangled density operator on a bipartite separable complex Hilbert space, with each component of dimension at least two. Finite and infinite dimensions are both allowed. Let be the trace-norm closed convex hull of product densities, and let be extended Umegaki relative entropy in nats. There is a state on the boundary of relative to normalized states such that
In infinite dimensions this boundary may be the entire separable set; the attainment clause remains substantive. The result has no Gaussian or energy restriction.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P46
noncomputable section
namespace QAlgorithms.Papers.Independent.Intakenext100.P46
open scoped BigOperators ENNReal ComplexOrder Matrix
attribute [local instance] Classical.propDecidable Classical.decEq
open QAlgorithms.RealRegisters (Hilbert)
open QAlgorithms.Papers.Independent.Dependency50.P33 (State IsSeparable)
open QAlgorithms.Papers.Independent.Dependency50.P13
(finiteRelativeEntropy compression entropyWeight)
open QAlgorithms.Papers.Independent.Claimed50.P47
(Occupation bipartiteCharacteristic bipartiteWeyl gaussianStateCharacteristic)
-- These accepted definitions have the same completed Hilbert-space meaning.
open QAlgorithms.Papers.Independent.Next46.P13 (coordinateBasis)
open QAlgorithms.Papers.Independent.Frontier18.P18 (operatorCoeff boundedOperator)
open QAlgorithms.Papers.Independent.Claimed50.P41 (IsDiagonal)
/-- Chen, Theorem 1, PDF p.4: an entangled state has an attaining separable
minimizer on the relative trace-norm boundary of normalized states. In infinite
dimensions the boundary can equal the whole separable set; attainment remains. -/
theorem ree_border {I J : Type} [Countable I] [Countable J]
[Nontrivial I] [Nontrivial J] (rho : State (I × J))
(hentangled : ¬ IsSeparable rho.coefficients) :
∃ sigma : State (I × J), IsSeparable sigma.coefficients ∧
StateBorder sigma ∧ operatorRelativeEntropy rho sigma = ree rho := by sorry
end QAlgorithms.Papers.Independent.Intakenext100.P46
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be countable types, each having at least two distinct elements, and let be a state on . For any label set , a state here means a complex kernel admitting an expansion with and , with every finite quadratic form real and nonnegative and with summable real diagonal of sum . Define as the infimum in of the expansion sums for , with empty infimum . Let be the set of states on whose coefficients can, for every , be approximated within -distance less than by a finite convex combination of product kernels of states on and , where . Equip the state space with the topology generated by all sets centered at states with . Assuming , the theorem asserts that there exists which belongs to the frontier in this topology and satisfies
Here, for states ,
where denotes a chosen bounded operator with coefficient kernel if such an operator exists, and otherwise; if , while otherwise
These matrix functions use continuous functional calculus with , and as an extended nonnegative real. The supremum includes the empty orthonormal family . The conclusion asserts existence of a minimizing boundary state, without asserting uniqueness or that the attained value is finite.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.