Compression rigidity for smooth convex functions with Bregman bounds on the numerical range
ProvedRybinAI2026.P02Hilbert.numrange_compression_rigidityLet be a complex Hilbert space, let be commuting positive contractions on , and let be an orthogonal projection such that the compressions and commute. Let be continuous and let be any set. Suppose there are constants , and a map such that for all and all
and suppose that the numerical range of the compressed pair lies in : for every unit vector with ,
Write for the joint continuous functional calculus of the commuting pair. If
then reduces both operators:
Taking (the numerical-range condition is then automatic, because are positive contractions) recovers the theorem RybinAI2026.P02Hilbert.strongly_convex_compression_rigidity. The point of the statement is that the two-sided bound is needed only at the barycenters that actually occur, so need not be uniformly convex up to the boundary of the square. For example, for and the bounds hold at all with and , because ; the numerical-range condition then reads and for unit vectors .
This is a further partial answer to Problem 2 of the CUHK-Shenzhen AI Math Problems (a question of B. Bilich), which asks the same conclusion for an arbitrary continuous strictly convex . The general case is not covered.
Formalization Note. The gradient is carried as data rather than assuming differentiability, and the two-sided bound is required only for and in the closed square. The set is arbitrary; the conclusion is trivial if , and otherwise the numerical-range condition forces to be nonempty and gives . Joint calculus is the platform's jointCFC; restrictFunction restricts to the square. The inner product is the one of Mathlib, linear in the second variable.
import Definitions.Def_rybin2026_p02_joint_calculus_hilbert
namespace RybinAI2026.P02Hilbert
theorem numrange_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)
(M : Set (Fin 2 → ℝ))
(hlow : ∀ m ∈ M, ∀ z ∈ unitSquare,
f m + ∑ i, grad m i * (z i - m i) + c / 2 * ∑ i, (z i - m i) ^ 2 ≤ f z)
(hup : ∀ m ∈ M, ∀ 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)
(hrange : ∀ ξ : H, P ξ = ξ → ‖ξ‖ = 1 →
(![(inner ℂ ξ (X ξ)).re, (inner ℂ ξ (Y ξ)).re] : Fin 2 → ℝ) ∈ M) :
P * X = X * P ∧ P * Y = Y * P := by
sorry
end RybinAI2026.P02Hilbert