Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Every model of T expands uniquely to a model of T⁺

Proved
MoritaEquiv.expansion_exists_unique

by Alien60 · Oct 10, 2026 · Mathlib 0df444a (Lean v4.33.1)

category-theorydefinabilitymany-sorted-logicmodel-theorymorita-equivalencephilosophy-of-sciencetheoretical-equivalence

Throughout: many-sorted first-order logic with nonempty sorts; Mod(T)\mathrm{Mod}(T)Mod(T) has the models of TTT as objects and elementary embeddings as arrows; DDD is a Morita extension of the Σ\SigmaΣ-theory TTT (new product, coproduct, subsort and quotient sorts and explicitly defined symbols, with admissibility in every model of TTT), T+T^+T+ the extended theory and Π:Mod(T+)→Mod(T)\Pi:\mathrm{Mod}(T^+)\to\mathrm{Mod}(T)Π:Mod(T+)→Mod(T) the reduct functor. For every M∈Mod(T)M\in\mathrm{Mod}(T)M∈Mod(T) there is N∈Mod(T+)N\in\mathrm{Mod}(T^+)N∈Mod(T+) with ΠN≅M\Pi N\cong MΠN≅M, and any two N,N′N,N'N,N′ with ΠN≅M≅ΠN′\Pi N\cong M\cong\Pi N'ΠN≅M≅ΠN′ are isomorphic in Mod(T+)\mathrm{Mod}(T^+)Mod(T+).

Preamble
import Mathlib
import Definitions.Def_MoritaEquiv_defs

open CategoryTheory
Formal statement
namespace MoritaEquiv

/-- Barrett–Halvorson, Theorem 4.1 (with Proposition 5.1): if `T⁺` is a Morita extension of `T`,
every model `M` of `T` has an expansion that is a model of `T⁺` (a model `N` of `T⁺` whose reduct
`Π N = N|Σ` is isomorphic to `M`), and this expansion is unique up to isomorphism. -/
theorem expansion_exists_unique {L : Sig} {T : Theory L} (D : MoritaData L T) (M : Model T) :
    (∃ N : Model D.ext, Nonempty (D.proj.obj N ≅ M)) ∧
      ∀ N N' : Model D.ext, (D.proj.obj N ≅ M) → (D.proj.obj N' ≅ M) → Nonempty (N ≅ N') := by sorry

end MoritaEquiv
Source
T. W. Barrett, H. Halvorson, Morita Equivalence, Rev. Symb. Logic 9 (2016) 556-582, https://arxiv.org/abs/1506.04675 (numbering as in arXiv v1), §4.2, Theorem 4.1 (with Prop. 5.1)
Read-back

What the Lean code literally says, in plain math · claude-opus-5-5

Let Σ\SigmaΣ be a signature, TTT a Σ\SigmaΣ-theory, DDD a Morita extension datum over TTT with extended signature Σ+\Sigma^+Σ+, extended theory T+T^+T+ and reduct functor Π:Mod(T+)→Mod(T)\Pi:\mathrm{Mod}(T^+)\to\mathrm{Mod}(T)Π:Mod(T+)→Mod(T) (sorts nonempty; arrows are elementary embeddings). For every model MMM of TTT: (a) there is a model NNN of T+T^+T+ with an isomorphism ΠN≅M\Pi N\cong MΠN≅M in Mod(T)\mathrm{Mod}(T)Mod(T); (b) for all models N,N′N,N'N,N′ of T+T^+T+, if ΠN≅M\Pi N\cong MΠN≅M and ΠN′≅M\Pi N'\cong MΠN′≅M then N≅N′N\cong N'N≅N′ in Mod(T+)\mathrm{Mod}(T^+)Mod(T+).

Human review
  • Endorsed by Shuze Chen · Oct 11, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Alien60 · Oct 11, 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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me