Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Dyadic matrix systems force noncommuting corners

Proved
OAI.PopaTypeII.noAbelianCorners_of_matrices

by wurtle · Nov 4, 2026 · Mathlib 0df444a (Lean v4.33.1)

bounded-hochschild-cohomologyoai-math

Throughout, MMM is a unital C*-algebra with a partial order making it star-ordered, XXX is a complex Banach space, and e:X∗→Me:X^*\to Me:X∗→M is an isometric conjugate-linear isomorphism, so MMM is a von Neumann algebra with predual XXX (the Lean hypothesis e). A family (ai)(a_i)(ai​) converges in the predual sense to bbb (PredualTendsto) when e−1(ai)(z)→e−1(b)(z)e^{-1}(a_i)(z)\to e^{-1}(b)(z)e−1(ai​)(z)→e−1(b)(z) for every z∈Xz\in Xz∈X. Here τ\tauτ is a positive linear functional on MMM with τ(1)=1\tau(1)=1τ(1)=1 that lies in the predual (TraceInPredual: τ(x)=e−1(x)(z)‾\tau(x)=\overline{e^{-1}(x)(z)}τ(x)=e−1(x)(z)​ for some z∈Xz\in Xz∈X), is tracial, and is faithful (τ(a∗a)=0\tau(a^*a)=0τ(a∗a)=0 implies a=0a=0a=0), and ∥x∥2=τ(x∗x)1/2\|x\|_2=\tau(x^*x)^{1/2}∥x∥2​=τ(x∗x)1/2 is the norm of τ.toPreGNS x. The map EEE (average) sends aaa to a central element E(a)E(a)E(a), chosen by Classical.choose from exists_central_average, with ∥E(a)∥≤∥a∥\|E(a)\|\le\|a\|∥E(a)∥≤∥a∥ and whose 222-norm vector lies in the 222-norm closed convex hull of the unitary conjugates of aaa. A projection ppp is homogeneous (Homogeneous) when E(p)=Re⁡τ(p)⋅1E(p)=\operatorname{Re}\tau(p)\cdot 1E(p)=Reτ(p)⋅1. A matrix system of size nnn under a projection ppp (System n p) is a family (eij)i,j<n(e_{ij})_{i,j<n}(eij​)i,j<n​ in MMM with eij∗=ejie_{ij}^*=e_{ji}eij∗​=eji​, eijekl=δjkeile_{ij}e_{kl}=\delta_{jk}e_{il}eij​ekl​=δjk​eil​ and ∑ieii=p\sum_ie_{ii}=p∑i​eii​=p. Suppose that for every kkk there is a matrix system of size 2k+12^{k+1}2k+1 under 111. Then NoAbelianCorners M holds: for every nonzero projection ppp, the corner algebra {a:pa=a=ap}\{a:pa=a=ap\}{a:pa=a=ap} contains two noncommuting elements.

Formalization Note The statement is verbatim from OpenAI's Lean development, with the listed Definitions imported in place of the upstream modules; the definitions are supporting code for this statement. Only the keyword lemma, where used upstream, becomes theorem, and a leading include ... in or omit ... in moves to the preamble. It is a step of the Lean proof of the vanishing of higher bounded Hochschild cohomology.

Preamble
import Mathlib
import Definitions.Def_KadisonRingroseSupport2

namespace OAI

noncomputable section

open Filter Topology
open scoped ComplexOrder
namespace PopaCenter
open PopaMatrices PopaCorners.CornerIso PopaPatching
open BoundedHochschild HochschildRigidity HochschildDiffuse PopaTypeII
universe u
variable {M X : Type u} [CStarAlgebra M] [PartialOrder M] [StarOrderedRing M]
  [NormedAddCommGroup X] [NormedSpace ℂ X] [CompleteSpace X]
variable (e : StrongDual ℂ X ≃ₗᵢ⋆[ℂ] M) (τ : M →ₚ[ℂ] ℂ)
  (hτ : TraceInPredual e τ) (htr : ∀ a b : M, τ (a*b)=τ (b*a))
  (hfaith : ∀ a : M, τ (star a*a)=0 → a=0) (h1 : τ 1=1)

end PopaCenter

open scoped ComplexOrder
namespace PopaTypeII
open PopaCorners PopaCorners.CornerIso
variable {M : Type*} [CStarAlgebra M] [PartialOrder M] [StarOrderedRing M]

end PopaTypeII

open scoped ComplexOrder
namespace PopaCenter
open BoundedHochschild HochschildRigidity PopaMatrices
universe u
variable {M X : Type u} [CStarAlgebra M] [PartialOrder M] [StarOrderedRing M]
  [NormedAddCommGroup X] [NormedSpace ℂ X] [CompleteSpace X]
variable (e : StrongDual ℂ X ≃ₗᵢ⋆[ℂ] M) (τ : M →ₚ[ℂ] ℂ)
  (hτ : TraceInPredual e τ) (htr : ∀ a b : M, τ (a*b)=τ (b*a))
  (hfaith : ∀ a : M, τ (star a*a)=0 → a=0) (h1 : τ 1=1)

end PopaCenter

open scoped ComplexOrder
namespace PopaTypeII
open BoundedHochschild PopaCenter PopaMatrices PopaCorners
universe u
variable {M X : Type u} [CStarAlgebra M] [PartialOrder M] [StarOrderedRing M]
  [NormedAddCommGroup X] [NormedSpace ℂ X] [CompleteSpace X]
variable (e : StrongDual ℂ X ≃ₗᵢ⋆[ℂ] M) (τ : M →ₚ[ℂ] ℂ)
  (hτ : TraceInPredual e τ) (htr : ∀ a b : M, τ (a*b)=τ (b*a))
  (hfaith : ∀ a : M, τ (star a*a)=0 → a=0) (h1 : τ 1=1)
include e hτ htr hfaith h1

Formal statement
theorem noAbelianCorners_of_matrices
    (hmat : ∀ k : ℕ, Nonempty (System (2^(k+1)) (1:M))) : NoAbelianCorners M := by
  sorry

end PopaTypeII
end
end OAI
Source
OpenAI, Vanishing of higher bounded Hochschild cohomology, September 23, 2026, https://github.com/openai/math (paper: preprints/Vanishing-of-higher-bounded-Hochschild-cohomology-September-23-2026/paper.pdf; Apache License 2.0); Lean declaration `OAI.PopaTypeII.noAbelianCorners_of_matrices`, https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/lean/OAI/Analysis/TracialCohomology/CentralMatrices.lean#L305

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