Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Lemma 23: exchange of fixed coordinates on cuboid faces

Open
QAlgorithms.Papers.Independent.Intakethird100.P95.lemma23

by Gohan · Nov 1, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

Let λ=(λ1,…,λd)\lambda=(\lambda_1,\ldots,\lambda_d)λ=(λ1​,…,λd​) be a finite probability vector: every entry is nonnegative and the entries sum to one. Write ρλ=∑i,jλiλj∣ii⟩⟨jj∣\rho_\lambda=\sum_{i,j}\sqrt{\lambda_i\lambda_j}|ii\rangle\langle jj|ρλ​=∑i,j​λi​λj​​∣ii⟩⟨jj∣. All logarithms have base two. A PPT operation is a completely positive, trace-preserving map LLL such that ΓoutLΓin\Gamma_{\rm out}L\Gamma_{\rm in}Γout​LΓin​ is completely positive for arbitrary finite ancillary systems; Γ\GammaΓ transposes Bob in the fixed product basis. Assume in addition that all entries of λ\lambdaλ are strictly positive, so ddd is its Schmidt rank. Let K≥2K\ge2K≥2, and define the quadratic function Δ(x)=∑i>jxixj/(K−1)−∑i≥jxixj/(K+1)\Delta(x)=\sum_{i>j}x_ix_j/(K-1)-\sum_{i\ge j}x_ix_j/(K+1)Δ(x)=∑i>j​xi​xj​/(K−1)−∑i≥j​xi​xj​/(K+1). For a set CCC of coordinate indices, let FCF_CFC​ be the closed face ∣xi∣≤λi|x_i|\le\sqrt{\lambda_i}∣xi​∣≤λi​​ with xi=λix_i=\sqrt{\lambda_i}xi​=λi​​ for i∈Ci\in Ci∈C. A stationary point means a point on FCF_CFC​ whose derivative vanishes in every free affine-hull direction. Let C1=C0∪{n1}C_1=C_0\cup\{n_1\}C1​=C0​∪{n1​} and C2=C0∪{n2}C_2=C_0\cup\{n_2\}C2​=C0​∪{n2​}, where n1,n2n_1,n_2n1​,n2​ are distinct and outside C0C_0C0​. If FC1F_{C_1}FC1​​ contains a stationary point and λn1>λn2\lambda_{n_1}>\lambda_{n_2}λn1​​>λn2​​, then FC2F_{C_2}FC2​​ also contains one and

ΔC2≥ΔC1,ΔC=K(K2−1)(K+∣C∣−d)[(∑i∈Cλi)2−(K+∣C∣−d)∑i∈Cλi].\Delta_{C_2}\ge\Delta_{C_1},\qquad\Delta_C=\frac{K}{(K^2-1)(K+|C|-d)}\left[\left(\sum_{i\in C}\sqrt{\lambda_i}\right)^2-(K+|C|-d)\sum_{i\in C}\lambda_i\right].ΔC2​​≥ΔC1​​,ΔC​=(K2−1)(K+∣C∣−d)K​​(i∈C∑​λi​​)2−(K+∣C∣−d)i∈C∑​λi​​.

This exchanges a fixed coordinate while improving the stationary value. The hypotheses force a nonzero denominator; negative denominators are allowed.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakethird100_P95
Formal statement
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
Source
Pure-state transformations and catalysis under operations that completely preserve positivity of partial transpose, arXiv:0801.4322v2, PDF p. 11, Lemma 23: exchange of fixed coordinates on cuboid faces
Read-back

What the Lean code literally says, in plain math · gpt-6.1-sol

For every natural number ddd, integer K≥2K\ge2K≥2, and strictly positive probability vector λ∈Rd\lambda\in\mathbb R^dλ∈Rd, let C0⊆{0,…,d−1}C_0\subseteq\{0,\ldots,d-1\}C0​⊆{0,…,d−1} and let n1,n2n_1,n_2n1​,n2​ be distinct indices outside C0C_0C0​ with λn1>λn2\lambda_{n_1}>\lambda_{n_2}λn1​​>λn2​​. For any subset CCC, call the required stationarity condition the existence of a real vector x∈Rdx\in\mathbb R^dx∈Rd such that ∣xi∣≤λi|x_i|\le\sqrt{\lambda_i}∣xi​∣≤λi​​ for every iii, xi=λix_i=\sqrt{\lambda_i}xi​=λi​​ for every i∈Ci\in Ci∈C, and ∑ixi−Kxj=0\sum_i x_i-Kx_j=0∑i​xi​−Kxj​=0 for every j∉Cj\notin Cj∈/C. Define

F(C)=K(K2−1)(K+∣C∣−d)[(∑i∈Cλi)2−(K+∣C∣−d)∑i∈Cλi].F(C)= \frac{K}{(K^2-1)(K+|C|-d)} \left[ \left(\sum_{i\in C}\sqrt{\lambda_i}\right)^2 -(K+|C|-d)\sum_{i\in C}\lambda_i \right].F(C)=(K2−1)(K+∣C∣−d)K​​(i∈C∑​λi​​)2−(K+∣C∣−d)i∈C∑​λi​​.

If the stationarity condition holds for C0∪{n1}C_0\cup\{n_1\}C0​∪{n1​}, then it also holds for C0∪{n2}C_0\cup\{n_2\}C0​∪{n2​}, with an independently existentially quantified vector, and F(C0∪{n1})≤F(C0∪{n2})F(C_0\cup\{n_1\})\le F(C_0\cup\{n_2\})F(C0​∪{n1​})≤F(C0​∪{n2​}). The probability assumptions are λi>0\lambda_i>0λi​>0 and ∑iλi=1\sum_i\lambda_i=1∑i​λi​=1. No nonzero-denominator hypothesis is imposed on K+∣C∣−dK+|C|-dK+∣C∣−d; division by zero in the displayed definition has value zero.

Human review
  • Endorsed by Shuze Chen · Nov 1, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Gohan · Nov 1, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me