Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Separating example: the two theories are not Morita equivalent

Proved
MoritaEquiv.thm52_not_morita

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

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

The theories T1,T2T_1,T_2T1​,T2​ of the separating example are not Morita equivalent: no two finite chains of Morita extensions starting at T1T_1T1​ and T2T_2T2​ end in logically equivalent theories over a common signature (up to renaming).

Preamble
import Mathlib
import Definitions.Def_MoritaEquiv_defs

open CategoryTheory
Formal statement
namespace MoritaEquiv

/-- Barrett–Halvorson, Theorem 5.2 (second half): the categorically equivalent theories
`Thm52.T1` and `Thm52.T2` are not Morita equivalent. Hence categorical equivalence does not
entail Morita equivalence. -/
theorem thm52_not_morita : ¬ MoritaEquivalent Thm52.T1 Thm52.T2 := 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), §5, Theorem 5.2 (second half of the proof)
Read-back

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

Over one sort and unary predicates p0,p1,p2,…p_0,p_1,p_2,\dotsp0​,p1​,p2​,…, let T1={∃x ∀y (y=x)}T_1=\{\exists x\,\forall y\,(y=x)\}T1​={∃x∀y(y=x)} and T2=T1∪{∀y (p0(y)→pi(y)):i∈N}T_2=T_1\cup\{\forall y\,(p_0(y)\to p_i(y)) : i\in\mathbb N\}T2​=T1​∪{∀y(p0​(y)→pi​(y)):i∈N}. Then T1T_1T1​ and T2T_2T2​ are not Morita equivalent: there are no finite chains of Morita extensions T1⇝T1′T_1\rightsquigarrow T_1'T1​⇝T1′​, T2⇝T2′T_2\rightsquigarrow T_2'T2​⇝T2′​ and signature map FFF from the signature of T1′T_1'T1′​ to that of T2′T_2'T2′​, bijective on sorts and on symbols of each profile, such that a structure is a model of T2′T_2'T2′​ iff its FFF-reduct is a model of T1′T_1'T1′​.

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