Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Compression rigidity for uniformly convex smooth functions of two commuting positive contractions

Proved
RybinAI2026.P02Hilbert.strongly_convex_compression_rigidity

by moona3k · Oct 4, 2026 · Mathlib c5ea003 (Lean v4.30.0)

convexityfunctional-analysishyperrigidityoperator-theorypure-math

Let HHH be a complex Hilbert space, let X,YX,YX,Y be commuting positive contractions on HHH, and let PPP be an orthogonal projection such that the compressions PXPPXPPXP and PYPPYPPYP commute. Let f:[0,1]2→Rf:[0,1]^2\to\mathbb Rf:[0,1]2→R be continuous, and suppose there are constants 0<c≤C0<c\le C0<c≤C and a map ∇:[0,1]2→R2\nabla:[0,1]^2\to\mathbb R^2∇:[0,1]2→R2 such that for all m,z∈[0,1]2m,z\in[0,1]^2m,z∈[0,1]2

c2 ∣z−m∣2  ≤  f(z)−f(m)−⟨∇(m), z−m⟩  ≤  C2 ∣z−m∣2.\frac c2\,|z-m|^2\;\le\; f(z)-f(m)-\langle \nabla(m),\,z-m\rangle\;\le\;\frac C2\,|z-m|^2 .2c​∣z−m∣2≤f(z)−f(m)−⟨∇(m),z−m⟩≤2C​∣z−m∣2.

This holds, with ∇=∇f\nabla=\nabla f∇=∇f, for every function that is C2C^2C2 near the square with c I⪯D2f⪯C Ic\,I\preceq D^2f\preceq C\,IcI⪯D2f⪯CI; the quadratic function f(x,y)=x2+y2f(x,y)=x^2+y^2f(x,y)=x2+y2 corresponds to c=C=2c=C=2c=C=2. Write f(X,Y)f(X,Y)f(X,Y) for the joint continuous functional calculus of the commuting pair. If

P f(X,Y) P  =  P f(PXP, PYP) P,P\,f(X,Y)\,P \;=\; P\,f(PXP,\,PYP)\,P ,Pf(X,Y)P=Pf(PXP,PYP)P,

then PPP reduces both operators:

PX=XPandPY=YP.PX=XP\quad\text{and}\quad PY=YP .PX=XPandPY=YP.

The space HHH may be infinite-dimensional and non-separable, and PPP may be 000 or III.

This is a partial answer to Problem 2 of the CUHK-Shenzhen AI Math Problems (source credited to Boris Bilich on the problem page), which asks the same conclusion for an arbitrary continuous strictly convex fff. The hypotheses above strictly extend the quadratic case already on the platform. In operator-algebraic terms the statement is a unique-extension (rigidity) property for the operator system spanned by 1,x,y,f1,x,y,f1,x,y,f in C([0,1]2)C([0,1]^2)C([0,1]2), in the spirit of Arveson's hyperrigidity problem. The general strictly convex case is not covered, because no two-sided quadratic control of the Bregman gap is assumed there.

Formalization Note. The gradient is carried as data rather than assuming differentiability, and the two-sided bound is required at every pair of points of the closed square. Joint calculus is the platform's jointCFC; restrictFunction restricts fff to the square. The compressions act on the original space, and both outer projections are retained, as in the original problem.

Preamble
import Definitions.Def_rybin2026_p02_joint_calculus_hilbert
Formal statement
namespace RybinAI2026.P02Hilbert

theorem strongly_convex_compression_rigidity
    (H : Type*) [NormedAddCommGroup H] [InnerProductSpace ℂ H] [CompleteSpace H]
    (f : (Fin 2 → ℝ) → ℝ) (hf : ContinuousOn f unitSquare)
    (grad : (Fin 2 → ℝ) → (Fin 2 → ℝ)) (c C : ℝ) (hc : 0 < c)
    (hlow : ∀ m ∈ unitSquare, ∀ z ∈ unitSquare,
      f m + ∑ i, grad m i * (z i - m i) + c / 2 * ∑ i, (z i - m i) ^ 2 ≤ f z)
    (hup : ∀ m ∈ unitSquare, ∀ z ∈ unitSquare,
      f z ≤ f m + ∑ i, grad m i * (z i - m i) + C / 2 * ∑ i, (z i - m i) ^ 2)
    (X Y : H →L[ℂ] H) (hX : PositiveContraction X) (hY : PositiveContraction Y)
    (hXY : X * Y = Y * X)
    (P : H →L[ℂ] H) (hPstar : star P = P) (hPidempotent : P * P = P)
    (hCompressedCommute : (P * X * P) * (P * Y * P) = (P * Y * P) * (P * X * P))
    (hEquality : P * jointCFC X Y (restrictFunction f hf) * P =
      P * jointCFC (P * X * P) (P * Y * P) (restrictFunction f hf) * P) :
    P * X = X * P ∧ P * Y = Y * P := by
  sorry

end RybinAI2026.P02Hilbert
Source
Original statement, proved in Lean by the submitter. Context: CUHK-Shenzhen AI Math Problems, Problem 2 (question of Boris Bilich), https://rybindmitry.github.io/problems/2.html, whose general strictly convex case is NOT claimed here. Quadratic case: platform theorem RybinAI2026.P02Hilbert.quadratic_compression_rigidity. Joint functional calculus: J. Dereziński, Bounded operators, Lemma 6.6, p. 43, https://www.fuw.edu.pl/~derezins/mat-o.pdf#page=43. Related: L. G. Brown, Publ. Mat. 60 (2016), 551-564 (one variable); M. Scherer, arXiv:2411.11709 (convex sets in R^2).

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