Lemma 23: exchange of fixed coordinates on cuboid faces
OpenQAlgorithms.Papers.Independent.Intakethird100.P95.lemma23Let be a finite probability vector: every entry is nonnegative and the entries sum to one. Write . All logarithms have base two. A PPT operation is a completely positive, trace-preserving map such that is completely positive for arbitrary finite ancillary systems; transposes Bob in the fixed product basis. Assume in addition that all entries of are strictly positive, so is its Schmidt rank. Let , and define the quadratic function . For a set of coordinate indices, let be the closed face with for . A stationary point means a point on whose derivative vanishes in every free affine-hull direction. Let and , where are distinct and outside . If contains a stationary point and , then also contains one and
This exchanges a fixed coordinate while improving the stationary value. The hypotheses force a nonzero denominator; negative denominators are allowed.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakethird100_P95
noncomputable section
open scoped BigOperators Matrix ComplexOrder
open Filter
namespace QAlgorithms.Papers.Independent.Intakethird100.P95
attribute [local instance] Classical.propDecidable Classical.decEq
-- Exact primitives from the pinned accepted library; no local aliases.
open QAlgorithms.Papers.Independent.Claimed50.P28 (maximallyEntangledDensity)
open QAlgorithms.Papers.Independent.Information100.P27 (IsProbability)
open QAlgorithms.Papers.Independent.Information100.P63 (logTwo)
open QAlgorithms.Papers.Independent.Information100.P19 (outer)
open QAlgorithms.Papers.Independent.Dependency50.P18 (bipartiteTensor)
open QAlgorithms.Papers.Independent.Support50.P11 (Loewner)
/-- PDF pp.11–12, Lemma 23: exchanging one fixed coordinate on a closed cuboid
face. Stationarity is in the affine hull; denominator signs are not silently restricted.
Set unions in the printed statement mean unions with singletons. -/
theorem lemma23 {d : ℕ} (K : ℕ) (hK : 2 ≤ K) (lam : Fin d → ℝ)
(hprob : IsProbability lam) (hpos : ∀ i, 0 < lam i)
(C0 : Finset (Fin d)) (n1 n2 : Fin d) (hn1 : n1 ∉ C0) (hn2 : n2 ∉ C0)
(hne : n1 ≠ n2) (hgreater : lam n1 > lam n2)
(hstationary : FaceStationary K lam (C0 ∪ {n1})) :
FaceStationary K lam (C0 ∪ {n2}) ∧
faceValue K lam (C0 ∪ {n1}) ≤ faceValue K lam (C0 ∪ {n2}) := by sorry
end QAlgorithms.Papers.Independent.Intakethird100.P95
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For every natural number , integer , and strictly positive probability vector , let and let be distinct indices outside with . For any subset , call the required stationarity condition the existence of a real vector such that for every , for every , and for every . Define
If the stationarity condition holds for , then it also holds for , with an independently existentially quantified vector, and . The probability assumptions are and . No nonzero-denominator hypothesis is imposed on ; division by zero in the displayed definition has value zero.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.