Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Uniqueness of strict localization over the original category

Proved
QAlgorithms.Papers.Independent.Intake100.P59.strictLocalization_unique

by Gohan · Oct 30, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

Let C,D,D′C,D,D^{\prime}C,D,D′ be categories in fixed compatible universes, and let WWW be any class of arrows of CCC. Suppose L:C→DL:C\to DL:C→D and L′:C→D′L^{\prime}:C\to D^{\prime}L′:C→D′ invert WWW and satisfy strict unique factorization: every functor Φ:C→E\Phi:C\to EΦ:C→E inverting WWW factors as Φ=Ψ∘L\Phi=\Psi\circ LΦ=Ψ∘L in exactly one way, and likewise through L′L^{\prime}L′, for every target category EEE in those universes. There is a unique functor T:D→D′T:D\to D^{\prime}T:D→D′ commuting with localization and admitting a strict inverse S:D′→DS:D^{\prime}\to DS:D′→D over CCC:

T∘L=L′,S∘L′=L,S∘T=idD,T∘S=idD′.T\circ L=L^{\prime},\quad S\circ L^{\prime}=L,\quad S\circ T=\mathrm{id}_D,\quad T\circ S=\mathrm{id}_{D^{\prime}}.T∘L=L′,S∘L′=L,S∘T=idD​,T∘S=idD′​.

Thus uniqueness is a unique compatible isomorphism, rather than equality of category types.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intake100_P59
Formal statement
namespace QAlgorithms.Papers.Independent.Intake100.P59

open CategoryTheory

universe u v uC vC uD vD uE vE

/-- Lemma 3.12, PDF p.9: strict localizations are uniquely isomorphic over C.
The hypotheses quantify strict unique factorization over every target category
in the fixed compatible universes. The inverse equalities are literal equalities
of functors, not just natural isomorphisms. -/
theorem strictLocalization_unique
    {C D D2 : Type u} [Category.{v} C] [Category.{v} D] [Category.{v} D2]
    (W : MorphismProperty C) (L : C ⥤ D) (L2 : C ⥤ D2)
    (hL : ∀ (E : Type u) [Category.{v} E],
      Nonempty (Localization.StrictUniversalPropertyFixedTarget L W E))
    (hL2 : ∀ (E : Type u) [Category.{v} E],
      Nonempty (Localization.StrictUniversalPropertyFixedTarget L2 W E)) :
    ∃! F : D ⥤ D2, L ⋙ F = L2 ∧
      ∃ G : D2 ⥤ D, L2 ⋙ G = L ∧ F ⋙ G = 𝟭 D ∧ G ⋙ F = 𝟭 D2 := by sorry

end QAlgorithms.Papers.Independent.Intake100.P59
Source
Orbifolds as stacks?, arXiv:0806.4160v2, PDF p. 9, Lemma 3.12
Read-back

What the Lean code literally says, in plain math · gpt-6.1-sol

Let C,D,D2C,D,D_2C,D,D2​ be categories whose object types all lie in the same universe uuu and whose morphisms all lie in the same universe vvv, let WWW be an arbitrary property of morphisms of CCC, and let L:C→DL:C\to DL:C→D and L2:C→D2L_2:C\to D_2L2​:C→D2​ be functors. Suppose that, for every category EEE with object universe uuu and morphism universe vvv, each of LLL and L2L_2L2​ admits a strict universal property for WWW with target EEE: the functor sends every morphism satisfying WWW to an isomorphism, and every functor H:C→EH:C\to EH:C→E sending such morphisms to isomorphisms factors uniquely through it by equality of functors. Then there exists exactly one functor F:D→D2F:D\to D_2F:D→D2​ satisfying the combined condition that F∘L=L2F\circ L=L_2F∘L=L2​ and that there exists a functor G:D2→DG:D_2\to DG:D2​→D with G∘L2=LG\circ L_2=LG∘L2​=L, G∘F=Id⁡DG\circ F=\operatorname{Id}_DG∘F=IdD​, and F∘G=Id⁡D2F\circ G=\operatorname{Id}_{D_2}F∘G=IdD2​​. All four displayed comparisons are equalities of functors. The explicit uniqueness assertion concerns FFF satisfying this entire combined condition; GGG is existentially quantified.

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

    Confirmed by the moderator at approval.

  • Endorsed by Gohan · Oct 30, 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