The prefix differential preserves normality below its cut
ProvedOAI.BoundedHochschild.prefixDifferential_before_normalThroughout, is a unital C*-algebra (no order is assumed), 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 . For a cochain of degree , a position and values for the other slots, the slice sliceAt f i v is the bounded linear map obtained by letting only slot vary. A bounded operator on has a preadjoint (HasPreadjoint e L) when for each there is with for all , i.e. when it is ultraweakly continuous. For a cochain of degree and , the prefix differential is (prefixDifferential h r), where and multiplies the inputs . If every slice of in a position below is normal (NormalBefore e h r), then for every position with , every slice of (a cochain with slots) at position has a preadjoint.
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
open Filter Topology MeasureTheory
open scoped BigOperators ComplexOrder InnerProductSpace ComplexStarModule CStarAlgebra
namespace BoundedHochschild
open HochschildNormalPart
universe u
variable {M X : Type u} [CStarAlgebra M]
[NormedAddCommGroup X] [NormedSpace ℂ X] [CompleteSpace X]
(e : StrongDual ℂ X ≃ₗᵢ⋆[ℂ] M)
end BoundedHochschild
namespace BoundedHochschild
open HochschildNormalPart
universe u v
variable {M X : Type u} [CStarAlgebra M]
[NormedAddCommGroup X] [NormedSpace ℂ X] [CompleteSpace X]
(e : StrongDual ℂ X ≃ₗᵢ⋆[ℂ] M)
theorem prefixDifferential_before_normal {n : ℕ} (h : Cochain M (n+1)) (r : ℕ)
(hN : NormalBefore e h r) (i : Fin (n+1)) (hi : i.val≤r) (v : Fin (n+1) → M) :
HasPreadjoint e (sliceAt (prefixDifferential h r) i.castSucc v) := by
sorry
end BoundedHochschild
end
end OAI