Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

The prefix differential preserves normality below its cut

Proved
OAI.BoundedHochschild.prefixDifferential_before_normal

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

bounded-hochschild-cohomologyoai-math

Throughout, MMM is a unital C*-algebra (no order is assumed), 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. For a cochain fff of degree n+1n+1n+1, a position iii and values vvv for the other slots, the slice sliceAt f i v is the bounded linear map obtained by letting only slot iii vary. A bounded operator LLL on MMM has a preadjoint (HasPreadjoint e L) when for each z∈Xz\in Xz∈X there is z′∈Xz'\in Xz′∈X with e−1(L(a))(z)=e−1(a)(z′)e^{-1}(L(a))(z)=e^{-1}(a)(z')e−1(L(a))(z)=e−1(a)(z′) for all aaa, i.e. when it is ultraweakly continuous. For a cochain hhh of degree n+1n+1n+1 and r∈Nr\in\mathbb Nr∈N, the prefix differential is drh=hleft+∑j≤n, j<r(−1)j+1hjmidd_rh=h^{\mathrm{left}}+\sum_{j\le n,\ j<r}(-1)^{j+1}h^{\mathrm{mid}}_jdr​h=hleft+∑j≤n, j<r​(−1)j+1hjmid​ (prefixDifferential h r), where hleft(v0,… )=v0h(v1,… )h^{\mathrm{left}}(v_0,\dots)=v_0h(v_1,\dots)hleft(v0​,…)=v0​h(v1​,…) and hjmidh^{\mathrm{mid}}_jhjmid​ multiplies the inputs vj,vj+1v_j,v_{j+1}vj​,vj+1​. If every slice of hhh in a position below rrr is normal (NormalBefore e h r), then for every position i≤ni\le ni≤n with i≤ri\le ri≤r, every slice of drhd_rhdr​h (a cochain with n+2n+2n+2 slots) at position iii 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.

Preamble
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)

Formal statement
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
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.BoundedHochschild.prefixDifferential_before_normal`, https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/lean/OAI/Analysis/TracialCohomology/SlotHomotopy.lean#L533

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