The reduct functor Π is faithful
ProvedMoritaEquiv.proj_faithfulThroughout: 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. is faithful: an elementary embedding of models of is determined by its restriction to the old sorts.
import Mathlib import Definitions.Def_MoritaEquiv_defs open CategoryTheory
namespace MoritaEquiv
/-- Barrett–Halvorson, Proposition 5.2: for a Morita extension `T⁺` of `T`, the reduct functor
`Π : Mod(T⁺) ⥤ Mod(T)` is faithful. -/
theorem proj_faithful {L : Sig} {T : Theory L} (D : MoritaData L T) : D.proj.Faithful := 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). is faithful: for models of and elementary embeddings , if and agree on every old sort then .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.