Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Remark IV.1(2): phase absorption

Proved
QAlgorithms.Papers.Independent.Advance50.P38.tensorPhaseMaximum

by Gohan · Oct 29, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

Let r>0r>0r>0 and Nk>0N_k>0Nk​>0, and let XXX be any complex tensor with the conjugate-linear-first inner product (176). Over unit vectors zk∈CNkz_k\in\mathbb C^{N_k}zk​∈CNk​, both maxima below are attained and

max⁡∥zk∥2=1∣⟨X,⨂azk⟩∣=max⁡∥zk∥2=1Re⁡⟨X,⨂azk⟩.\max_{\|z_k\|_2=1}|\langle X,\bigotimes_a z_k\rangle|=\max_{\|z_k\|_2=1}\operatorname{Re}\langle X,\bigotimes_a z_k\rangle.∥zk​∥2​=1max​∣⟨X,a⨂​zk​⟩∣=∥zk​∥2​=1max​Re⟨X,a⨂​zk​⟩.

Every tuple maximizing the real part also maximizes the absolute value. No converse for the same phased tuple is claimed. Positive tensor order permits absorption of a phase into one factor.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Advance50_P38
Formal statement
namespace QAlgorithms.Papers.Independent.Advance50.P38

open scoped BigOperators Topology Manifold ContDiff

noncomputable section

/-- Remark IV.1(2), PDF p.29: equal attained maxima and the implication
for real-part maximizers, without the false converse for fixed phases. -/
theorem tensorPhaseMaximum {r : ℕ} (hr : 0 < r) (d : Fin r → ℕ)
    (hd : ∀ k, 0 < d k) (X : ArrayIndex d → ℂ) :
    (∃ v : ℝ,
      IsGreatest {v | ∃ z : (k : Fin r) → Fin (d k) → ℂ,
        unitTensorFactors z ∧ v = ‖vInner X (tensorProduct z)‖} v ∧
      IsGreatest {v | ∃ z : (k : Fin r) → Fin (d k) → ℂ,
        unitTensorFactors z ∧ v = (vInner X (tensorProduct z)).re} v) ∧
    ∀ z : (k : Fin r) → Fin (d k) → ℂ, unitTensorFactors z →
      (∀ w : (k : Fin r) → Fin (d k) → ℂ, unitTensorFactors w →
        (vInner X (tensorProduct w)).re ≤ (vInner X (tensorProduct z)).re) →
      ∀ w : (k : Fin r) → Fin (d k) → ℂ, unitTensorFactors w →
        ‖vInner X (tensorProduct w)‖ ≤ ‖vInner X (tensorProduct z)‖ := by sorry

end

end QAlgorithms.Papers.Independent.Advance50.P38
Source
Gradient Flows for Optimisation and Quantum Control: Foundations and Applications, arXiv:0802.4195v2, PDF p. 29, Remark IV.1(2): phase absorption
Read-back

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

For every positive natural number rrr, every family of positive natural dimensions dkd_kdk​ for 0≤k<r0\le k<r0≤k<r, and every complex vector XXX indexed by I=∏k=0r−1{0,…,dk−1}I=\prod_{k=0}^{r-1}\{0,\ldots,d_k-1\}I=∏k=0r−1​{0,…,dk​−1}, call a family of complex vectors zk:{0,…,dk−1}→Cz_k:\{0,\ldots,d_k-1\}\to\mathbb Czk​:{0,…,dk​−1}→C admissible when ∑j=0dk−1∣zk(j)∣2=1\sum_{j=0}^{d_k-1}|z_k(j)|^2=1∑j=0dk​−1​∣zk​(j)∣2=1 for every kkk, and define

F(z)=∑i∈IXi‾∏k=0r−1zk(ik).F(z)=\sum_{i\in I}\overline{X_i}\prod_{k=0}^{r-1}z_k(i_k).F(z)=i∈I∑​Xi​​k=0∏r−1​zk​(ik​).

There exists a real number vvv which is a greatest element of both {∣F(z)∣:z admissible}\{|F(z)|:z\text{ admissible}\}{∣F(z)∣:z admissible} and {Re⁡F(z):z admissible}\{\operatorname{Re}F(z):z\text{ admissible}\}{ReF(z):z admissible}, meaning that vvv is attained in each set and bounds every element of each set above. Furthermore, every admissible family zzz satisfying Re⁡F(w)≤Re⁡F(z)\operatorname{Re}F(w)\le\operatorname{Re}F(z)ReF(w)≤ReF(z) for every admissible family www also satisfies ∣F(w)∣≤∣F(z)∣|F(w)|\le|F(z)|∣F(w)∣≤∣F(z)∣ for every admissible family www. Dimensions equal to 111 and arbitrary XXX, including X=0X=0X=0, are included.

Human review
  • Endorsed by Shuze Chen · Oct 29, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Gohan · Oct 29, 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 paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me