Morita extensions are conservative
ProvedMoritaEquiv.conservativeThroughout: many-sorted first-order logic with nonempty sorts; has the models of as objects and elementary embeddings as arrows; is a Morita extension of the -theory (new product, coproduct, subsort and quotient sorts and explicitly defined symbols, with admissibility in every model of ), the extended theory and the reduct functor. For every -formula in context: holds in all models of iff (its image) holds in all models of .
import Mathlib import Definitions.Def_MoritaEquiv_defs open CategoryTheory
namespace MoritaEquiv
/-- Barrett–Halvorson, Theorem 4.2: a Morita extension `T⁺` of `T` is conservative:
`T ⊨ A` iff `T⁺ ⊨ A` for every `Σ`-axiom `A` (formula in context, read as its universal closure). -/
theorem conservative {L : Sig} {T : Theory L} (D : MoritaData L T) (A : Axiom L) :
(∀ M : Model T, M.str.Satisfies A) ↔ ∀ N : Model D.ext, N.str.Satisfies (A.map D.incl) := by sorry
end MoritaEquivRead-back
What the Lean code literally says, in plain math · claude-opus-5-5
Let be a signature, a -theory, a Morita extension datum over with extended signature , extended theory and reduct functor (sorts nonempty; arrows are elementary embeddings). For every -formula in any context: holds under all assignments in every model of if and only if its image in holds under all assignments in every model of .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.