Assembling a primitive from a central decomposition and classical vanishing
ProvedOAI.BoundedHochschild.KadisonRingrose.primitive_of_published_inputsThroughout, is a unital C*-algebra with a partial order making it star-ordered, is a complex Banach space, and is an isometric conjugate-linear isomorphism, so is a von Neumann algebra with predual (the Lean hypothesis e). A family converges in the predual sense to (PredualTendsto) when for every . A cochain of degree is a bounded complex -linear map , and (differentialValue) is the Hochschild differential . Assume a central decomposition of (CentralDecompositionInput M): orthogonal central projections indexed by Option Index that separate points, where the corner at none has no type II central summand and each other corner is tracial of type II (TracialTypeII). Assume also classical vanishing (ClassicalVanishingInput: every W*-algebra with no type II summand has primitives for all bounded cocycles of degree ). Then every bounded cocycle of degree on has a bounded primitive.
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.
import Mathlib
import Definitions.Def_KadisonRingroseSupport2
namespace OAI
noncomputable section
namespace BoundedHochschild
namespace KadisonRingrose
open HochschildCorners
open scoped ComplexOrder
universe u
variable {M X : Type u} [CStarAlgebra M] [PartialOrder M] [StarOrderedRing M]
[NormedAddCommGroup X] [NormedSpace ℂ X] [CompleteSpace X]
theorem primitive_of_published_inputs (e : StrongDual ℂ X ≃ₗᵢ⋆[ℂ] M)
(hdecomp : CentralDecompositionInput M) (hclassical : ClassicalVanishingInput.{u})
{n : ℕ} (f : Cochain M (n + 2)) (hf : ∀ x, differentialValue f x = 0) :
∃ g : Cochain M (n + 1), ∀ x, differentialValue g x = f x := by
sorry
end KadisonRingrose
end BoundedHochschild
end
end OAI