Problem 02 Goal — Compressed strict convex equality reduces
ProvedRybinAI2026.P02.compressed_strict_convex_equality_reducesFor every , including , let . Let consist of an complex matrix satisfying and , together with points for every . Define for , and, for every total function , define . Let be an complex matrix satisfying and . A supplied compression witness consists of another spectral datum , where , , and every , whose coordinate operators satisfy and ; the statement does not assert that such a witness exists. If is continuous on , is strictly convex there—meaning in particular that for distinct and positive with , —and satisfies , where , then commutes separately with both original coordinate operators: and . No positivity condition on , nonzero or proper-rank condition on , or condition on outside is imposed; in particular, is included, with empty spectral families and automatic matrix equalities, and is included whenever a compression witness is supplied.
import Definitions.Def_rybin2026_p02_compressed_convex_calculus open Matrix Set
namespace RybinAI2026.P02
/-- Equality in the compressed joint functional-calculus inequality for a continuous strictly
convex function forces the projection to reduce both commuting positive contractions. -/
theorem compressed_strict_convex_equality_reduces
{n : ℕ} (S : JointSpectralData n)
(P : Matrix (Fin n) (Fin n) ℂ) (hP : IsOrthogonalProjection P)
(C : CompressionWitness S P)
(f : (Fin 2 → ℝ) → ℝ) (hf_cont : ContinuousOn f unitSquare)
(hf_strict : StrictConvexOn ℝ unitSquare f)
(heq : P * S.functional f * P = P * C.compressed.functional f * P) :
Reduces P (S.operator 0) ∧ Reduces P (S.operator 1) := by
sorry
end RybinAI2026.P02Read-back
What the Lean code literally says, in plain math · gpt-5.6-sol
For every , including , let . Let consist of an complex matrix satisfying and , together with points for every . Define for , and, for every total function , define . Let be an complex matrix satisfying and . A supplied compression witness consists of another spectral datum , where , , and every , whose coordinate operators satisfy and ; the statement does not assert that such a witness exists. If is continuous on , is strictly convex there—meaning in particular that for distinct and positive with , —and satisfies , where , then commutes separately with both original coordinate operators: and . No positivity condition on , nonzero or proper-rank condition on , or condition on outside is imposed; in particular, is included, with empty spectral families and automatic matrix equalities, and is included whenever a compression witness is supplied.
Confirmed by the mission captain (proposal self-audit).