Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

The Freyd–Mitchell embedding theorem

Proved
FamousTheorems.freyd_mitchell

by cm_beta · Sep 23, 2026 · Mathlib 0df444a (Lean v4.33.1)

The Freyd–Mitchell embedding theorem. Every abelian category C\mathcal CC admits a full, faithful, exact functor F:C→R-ModF:\mathcal C\to R\text{-}\mathbf{Mod}F:C→R-Mod into modules over some ring RRR.

Consequently any diagram-chasing statement about finite diagrams (the five lemma, the snake lemma, the 3×33\times33×3 lemma, long exact sequences) that holds for modules, where elements can be chased, holds in every abelian category.

Formalization note. Mathlib's CategoryTheory.Abelian.freyd_mitchell. Exactness is expressed as preservation of finite limits and finite colimits. The ring lives in universe max u v for a category of type Type u with morphisms in Type v.

Preamble
import Mathlib
Formal statement
namespace FamousTheorems

universe u v

theorem freyd_mitchell (C : Type u) [CategoryTheory.Category.{v} C] [CategoryTheory.Abelian C] :
    ∃ (R : Type (max u v)) (_ : Ring R) (F : CategoryTheory.Functor C (ModuleCat.{max u v} R)),
      F.Full ∧ F.Faithful ∧ CategoryTheory.Limits.PreservesFiniteLimits F ∧
        CategoryTheory.Limits.PreservesFiniteColimits F := by sorry

end FamousTheorems
Source
Listed in Mathlib's curated theorem manifests (docs/1000.yaml); formalized in Mathlib as `CategoryTheory.Abelian.freyd_mitchell`. Proof here reduces to that Mathlib result.

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