Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

OAI.Kadison.HilbertPadding.amplified_extension_commutator_norm: intermediate lemma from OpenAI, Kadison's similarity theorem through uniform derivation estimates (result family 288)

Proved
OAI.Kadison.HilbertPadding.amplified_extension_commutator_norm

by dbenbenn · Oct 28, 2026 · Mathlib 0df444a (Lean v4.33.1)

openai-math

An intermediate lemma of the split of OpenAI's proof of OAI.Kadison.uniform_commutator, carved from OpenAI's openai/math development for this platform. The statement and its proof are OpenAI's (OpenAI, Kadison's similarity theorem through uniform derivation estimates (result family 288), OpenAI Math Release, September 23, 2026, result family 288, github.com/openai/math, Apache License 2.0), ported to Lean 4.33.1 and Mathlib 0df444a.

The statement, as published (namespace OAI.Kadison.HilbertPadding, with open scoped BigOperators InnerProductSpace, open ContinuousLinearMap, open OperatorAmplification CyclicColumns):

theorem amplified_extension_commutator_norm (E : H →ₗᵢ[ℂ] K)
    (ρ : A →⋆ₐ[ℂ] (H →L[ℂ] H)) (σ : A →⋆ₐ[ℂ] (K →L[ℂ] K))
    (hE : ∀ a,(σ a).comp E.toContinuousLinearMap=E.toContinuousLinearMap.comp (ρ a))
    (Y : H →L[ℂ] H) (X : CStarMatrix ι ι A) :
    ‖diagonal (H:=K) ι (extend E Y)*matrixRepresentation σ X-
      matrixRepresentation σ X*diagonal (H:=K) ι (extend E Y)‖=
    ‖diagonal (H:=H) ι Y*matrixRepresentation ρ X-
      matrixRepresentation ρ X*diagonal (H:=H) ι Y‖

Definitions. The statement is written with OAI.Kadison.OperatorAmplification.SumSpace and OAI.Kadison.OperatorAmplification.diagonal (definitions bundle OAIQ039C002 of this split); OAI.Kadison.CyclicColumns.instDecidableEq_solutions (definitions bundle OAIQ039C004 of this split); OAI.Kadison.HilbertPadding.extend (definitions bundle OAIQ039C012 of this split); OAI.Kadison.CyclicColumns.matrixRepresentation (definitions bundle OAIQ039C022 of this split).

Used by. The proofs of OAI.Kadison.MatrixTower.rectangular_contraction_after_average and OAI.Kadison.MatrixTower.square_contraction_after_average of this split import it.

Preamble
import Mathlib
import Definitions.Def_OAIQ039C012
import Definitions.Def_OAIQ039C022
Formal statement
section

attribute [-instance] _root_.OAI.Kadison.ConcreteCorner.closedCarrier _root_.OAI.Kadison.VonNeumannCStar.cstarAlgebra _root_.OAI.Kadison.VonNeumannCStar.isClosed _root_.OAI.Kadison.VonNeumannCStar.smulMemClass _root_.OAI.Kadison.VonNeumannCStar.starOrderedRing
set_option linter.all false
set_option linter.unusedVariables false
set_option linter.unusedTactic false
set_option linter.unreachableTactic false

namespace OAI

noncomputable section

section

noncomputable section

open scoped BigOperators InnerProductSpace

open ContinuousLinearMap

namespace Kadison.HilbertPadding

open OperatorAmplification CyclicColumns

variable {A H K : Type*} [CStarAlgebra A] [PartialOrder A] [StarOrderedRing A]
  [NormedAddCommGroup H] [InnerProductSpace ℂ H] [CompleteSpace H]
  [NormedAddCommGroup K] [InnerProductSpace ℂ K] [CompleteSpace K]

variable (ι : Type*) [Fintype ι]

theorem amplified_extension_commutator_norm (E : H →ₗᵢ[ℂ] K)
    (ρ : A →⋆ₐ[ℂ] (H →L[ℂ] H)) (σ : A →⋆ₐ[ℂ] (K →L[ℂ] K))
    (hE : ∀ a,(σ a).comp E.toContinuousLinearMap=E.toContinuousLinearMap.comp (ρ a))
    (Y : H →L[ℂ] H) (X : CStarMatrix ι ι A) :
    ‖diagonal (H:=K) ι (extend E Y)*matrixRepresentation σ X-
      matrixRepresentation σ X*diagonal (H:=K) ι (extend E Y)‖=
    ‖diagonal (H:=H) ι Y*matrixRepresentation ρ X-
      matrixRepresentation ρ X*diagonal (H:=H) ι Y‖ := by
  sorry

end Kadison.HilbertPadding

end

end
end

end OAI
end
Source
OpenAI, Kadison's similarity theorem through uniform derivation estimates (result family 288), OpenAI Math Release, September 23, 2026, https://github.com/openai/math (result family 288; paper: https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Kadisons-similarity-theorem-through-uniform-derivation-estimates-September-23-2026/paper.pdf; Apache License 2.0)

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