Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 5.19, p. 45 — ML ⊣ Spec is an adjoint equivalence CSLEMS ≃ MLoc

Proved
GelfandVNA.Duality.theorem_5_19

by mikedeng1 · Oct 21, 2026 · Mathlib 0df444a (Lean v4.33.1)

enhanced-measurable-spacesequivalence-of-categorieslocalesmeasure-theoryp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

The functors ML ⁣:CSLEMS→MLoc\mathsf{ML}\colon\mathsf{CSLEMS}\to\mathsf{MLoc}ML:CSLEMS→MLoc and Spec ⁣:MLoc→CSLEMS\mathrm{Spec}\colon\mathsf{MLoc}\to\mathsf{CSLEMS}Spec:MLoc→CSLEMS, with natural isomorphisms η ⁣:id→Spec∘ML\eta\colon\mathrm{id}\to\mathrm{Spec}\circ\mathsf{ML}η:id→Spec∘ML and ε ⁣:ML∘Spec→id\varepsilon\colon\mathsf{ML}\circ\mathrm{Spec}\to\mathrm{id}ε:ML∘Spec→id, form an adjoint equivalence

CSLEMS ≃ MLoc.\mathsf{CSLEMS}\ \simeq\ \mathsf{MLoc}.CSLEMS ≃ MLoc.

The statement asserts an equivalence eee implemented by ML\mathsf{ML}ML: there are order isomorphisms ι\iotaι from the measurable locale assigned to (X,M,N)(X,M,N)(X,M,N) onto M/NM/NM/N, under which the image of a morphism fff is the pull-back f∗ ⁣:M′/N′→M/Nf^*\colon M'/N'\to M/Nf∗:M′/N′→M/N:

ιX(e(f)∗ b)=f∗(ιX′(b)).\iota_{X}\big(e(f)^*\,b\big)=f^*\big(\iota_{X'}(b)\big).ιX​(e(f)∗b)=f∗(ιX′​(b)).

This is the fourth equivalence of Theorem 1.1 and the point-set measure-theoretic end of the duality.

Formalization Note The equivalence and ι\iotaι are existentially quantified; Spec\mathrm{Spec}Spec, η\etaη and ε\varepsilonε are not named.

Preamble
import Mathlib
import Definitions.Def_GelfandVNA_Duality_Locales
import Definitions.Def_GelfandVNA_Duality_EMS
Formal statement
namespace GelfandVNA.Duality

open CategoryTheory

universe u

/-- Theorem 5.19, p. 45: `ML : CSLEMS → MLoc` and `Spec : MLoc → CSLEMS` form an adjoint equivalence.
The functor is `ML`: it sends `(X, M, N)` to (an algebra order-isomorphic to) `M/N`, and a morphism
`f` to the map `f* : M'/N' → M/N` of frames. -/
theorem theorem_5_19 :
    ∃ e : CSLEMS.{u} ≌ MLoc.{u},
      ∃ ι : ∀ A : CSLEMS.{u}, (e.functor.obj A).carrier ≃o MmodN A.obj.E,
        ∀ {A B : CSLEMS.{u}} (f : A ⟶ B) (b : (e.functor.obj B).carrier),
          ι A (MLoc.frameHom (e.functor.map f) b) = pullHom f.hom (ι B b) := by sorry

end GelfandVNA.Duality
Source
Pavlov, Gelfand-type duality for commutative von Neumann algebras, arXiv:2005.05284v3, p. 45, Theorem 5.19
Human review
  • Endorsed by Shuze Chen · Oct 21, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 21, 2026

    Confirmed by the mission captain (proposal self-audit).

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 paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me