Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 5.11 (Def 5.10), p. 42 — ML : CSLEMS → MLoc is well defined: f* : M′/N′ → M/N is a frame map

Proved
GelfandVNA.Duality.lemma_5_11

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

enhanced-measurable-spacesfunctorsmeasure-algebrasp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let f ⁣:(X,M,N)→(X′,M′,N′)f\colon(X,M,N)\to(X',M',N')f:(X,M,N)→(X′,M′,N′) be a morphism of compact strictly localizable enhanced measurable spaces (a class of premaps modulo weak equality almost everywhere). The induced map

f∗ ⁣:M′/N′→M/N,[m]↦[f∗m],f^*\colon M'/N'\to M/N,\qquad [m]\mapsto[f^*m],f∗:M′/N′→M/N,[m]↦[f∗m],

preserves binary meets, the top element and all existing suprema. Hence ML(f)\mathsf{ML}(f)ML(f) is a morphism of measurable locales, and ML ⁣:CSLEMS→MLoc\mathsf{ML}\colon\mathsf{CSLEMS}\to\mathsf{MLoc}ML:CSLEMS→MLoc, the restriction of WeakML\mathsf{WeakML}WeakML, is well defined (its value on objects is localizable by Proposition 4.54).

Compactness of the source is necessary: Remark 5.12 gives a morphism between a σ-finite and a strictly localizable space whose f∗f^*f∗ does not preserve suprema.

Formalization Note The map is pullHom of the EMS module applied to the underlying EMS morphism of fff.

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

open CategoryTheory

universe u

/-- Lemma 5.11 with Definition 5.10, p. 42: `ML : CSLEMS → MLoc` is well defined on morphisms: for a
morphism `f` of compact strictly localizable enhanced measurable spaces, the induced map
`f* : M'/N' → M/N` preserves binary meets, the top element and all existing suprema, i.e. it is a
map of frames. -/
theorem lemma_5_11 {A B : CSLEMS.{u}} (f : A ⟶ B) :
    (∀ a b c : MmodN B.obj.E, IsGLB {a, b} c →
      IsGLB {pullHom f.hom a, pullHom f.hom b} (pullHom f.hom c)) ∧
    (∀ a : MmodN B.obj.E, IsGreatest Set.univ a → IsGreatest Set.univ (pullHom f.hom a)) ∧
    ∀ (s : Set (MmodN B.obj.E)) (a : MmodN B.obj.E), IsLUB s a →
      IsLUB (pullHom f.hom '' s) (pullHom f.hom a) := by sorry

end GelfandVNA.Duality
Source
Pavlov, Gelfand-type duality for commutative von Neumann algebras, arXiv:2005.05284v3, p. 42, Definition 5.10, Lemma 5.11
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