Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Monotonicity and positive interior derivative of the raw profiles

Open
QAlgorithms.Papers.Independent.Intakethird100.P21.profile_monotonicity

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

prove2quantum

Fix an integer d≥2d\ge2d≥2. Let qdq_dqd​ be the minimum constrained Schmidt tangle at overlap FFF, and let cd=qdc_d=\sqrt{q_d}cd​=qd​​. Both functions are nondecreasing on [1/d,1][1/d,1][1/d,1], and qd(1/d)=cd(1/d)=0q_d(1/d)=c_d(1/d)=0qd​(1/d)=cd​(1/d)=0. For every F∈(1/d,1)F\in(1/d,1)F∈(1/d,1), with γd(F)=F/d+(d−1)(1−F)/d\gamma_d(F)=\sqrt{F/d}+\sqrt{(d-1)(1-F)/d}γd​(F)=F/d​+(d−1)(1−F)/d​ and δd(F)=F/d−(1−F)/(d(d−1))\delta_d(F)=\sqrt{F/d}-\sqrt{(1-F)/(d(d-1))}δd​(F)=F/d​−(1−F)/(d(d−1))​,

qd′(F)=4d/F γd(F)δd(F)(γd(F)+δd(F))>0.q_d'(F)=4\sqrt{d/F}\,\gamma_d(F)\delta_d(F)\bigl(\gamma_d(F)+\delta_d(F)\bigr)>0.qd′​(F)=4d/F​γd​(F)δd​(F)(γd​(F)+δd​(F))>0.

The derivative assertion is restricted to the interior; it does not apply a total two-sided derivative to a singular endpoint formula.

This monotonicity is the profile property used to simplify the arbitrary-state fidelity bound.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakethird100_P21
Formal statement
noncomputable section

namespace QAlgorithms.Papers.Independent.Intakethird100.P21

open scoped Matrix ComplexConjugate

open Filter

open QAlgorithms

open QAlgorithms.Papers.Independent.Information100.P03
  (PureEnsemble convexRoof pureConcurrence concurrence SchmidtData schmidtVector)

attribute [local instance] Classical.propDecidable Classical.decEq

/-- PDF pp.9--10, (3.35): both raw profiles are monotone on the closed domain;
the displayed positive derivative is asserted only in its open interior. -/
theorem profile_monotonicity (d : ℕ) (hd : 2 ≤ d) :
    MonotoneOn (constrainedSchmidtTangle d) (Set.Icc (1 / (d : ℝ)) 1) ∧
    MonotoneOn (rawC d) (Set.Icc (1 / (d : ℝ)) 1) ∧
    constrainedSchmidtTangle d (1 / (d : ℝ)) = 0 ∧ rawC d (1 / (d : ℝ)) = 0 ∧
    ∀ F ∈ Set.Ioo (1 / (d : ℝ)) 1,
      HasDerivAt (constrainedSchmidtTangle d)
        (4 * Real.sqrt ((d : ℝ) / F) * minimizingLargeAmplitude d F * minimizingSmallAmplitude d F *
          (minimizingLargeAmplitude d F + minimizingSmallAmplitude d F)) F ∧
      0 < 4 * Real.sqrt ((d : ℝ) / F) * minimizingLargeAmplitude d F * minimizingSmallAmplitude d F *
        (minimizingLargeAmplitude d F + minimizingSmallAmplitude d F) := by sorry

end QAlgorithms.Papers.Independent.Intakethird100.P21

end
Source
I-concurrence and tangle for isotropic states, arXiv:quant-ph/0208002v1, PDF p. 10, §3.3, (3.35): monotonicity of the raw profiles
Read-back

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

For every natural number d≥2d\ge2d≥2, define Pd(F)P_d(F)Pd​(F) as the infimum of 2(1−∑i=0d−1μi2)2(1-\sum_{i=0}^{d-1}\mu_i^2)2(1−∑i=0d−1​μi2​) over real vectors satisfying μi≥0\mu_i\ge0μi​≥0, ∑iμi=1\sum_i\mu_i=1∑i​μi​=1, and ∑iμi=dF\sum_i\sqrt{\mu_i}=\sqrt{dF}∑i​μi​​=dF​, put rd(F)=Pd(F)r_d(F)=\sqrt{P_d(F)}rd​(F)=Pd​(F)​, and define

ad(F)=Fd+(d−1)(1−F)d,bd(F)=Fd−1−Fd(d−1).a_d(F)=\sqrt{\frac Fd}+\sqrt{\frac{(d-1)(1-F)}d}, \qquad b_d(F)=\sqrt{\frac Fd}-\sqrt{\frac{1-F}{d(d-1)}}.ad​(F)=dF​​+d(d−1)(1−F)​​,bd​(F)=dF​​−d(d−1)1−F​​.

Both PdP_dPd​ and rdr_drd​ are nondecreasing on the closed interval [1/d,1][1/d,1][1/d,1]: whenever x,yx,yx,y belong to that interval and x≤yx\le yx≤y, their respective values at xxx are no larger than at yyy. They satisfy Pd(1/d)=rd(1/d)=0P_d(1/d)=r_d(1/d)=0Pd​(1/d)=rd​(1/d)=0. For every FFF in the open interval (1/d,1)(1/d,1)(1/d,1), the function PdP_dPd​, considered as a function on all real numbers, has derivative

Pd′(F)=4dF ad(F)bd(F)(ad(F)+bd(F)),P_d'(F)=4\sqrt{\frac dF}\,a_d(F)b_d(F)\bigl(a_d(F)+b_d(F)\bigr),Pd′​(F)=4Fd​​ad​(F)bd​(F)(ad​(F)+bd​(F)),

and this displayed derivative value is strictly positive. No derivative assertion is made at either endpoint.

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