Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Pullbacks of one cospan have isomorphic vertices

Proved
QAlgorithms.Papers.Independent.Intakenext100.P43.proposition1_pullbacks_isomorphic

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

prove2quantum

Let C\mathcal CC be a category and let f:X→Zf:X\to Zf:X→Z and g:Y→Zg:Y\to Zg:Y→Z be morphisms. Suppose that (P,p1,p2)(P,p_1,p_2)(P,p1​,p2​) and (Q,q1,q2)(Q,q_1,q_2)(Q,q1​,q2​) are limiting cones over this same cospan. Then

P≅Q.P\cong Q.P≅Q.

Only these two limiting cones are assumed to exist. This makes constructions using a chosen pullback independent of that choice up to isomorphism.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P43
Formal statement
namespace QAlgorithms.Papers.Independent.Intakenext100.P43

open CategoryTheory CategoryTheory.Limits

open CategoryTheory.MonoidalCategory CategoryTheory.CartesianMonoidalCategory

universe u v w

section Ordinary

variable {C : Type u} [Category.{v} C]

/-- Proposition 1, PDF p. 6: two limiting cones over the same cospan
have isomorphic vertices. No global existence of pullbacks is required. -/
theorem proposition1_pullbacks_isomorphic
    {X Y Z P Q : C} (f : X ⟶ Z) (g : Y ⟶ Z)
    (p1 : P ⟶ X) (p2 : P ⟶ Y) (q1 : Q ⟶ X) (q2 : Q ⟶ Y)
    (hp : IsPullback p1 p2 f g) (hq : IsPullback q1 q2 f g) :
    Nonempty (P ≅ Q) := by sorry

end Ordinary

end QAlgorithms.Papers.Independent.Intakenext100.P43
Source
Higher gauge theory I: 2-Bundles, arXiv:math/0410328v3, PDF p. 6, Proposition 1
Read-back

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

For any objects X,Y,Z,P,QX,Y,Z,P,QX,Y,Z,P,Q of the ambient category CCC, morphisms f:X→Zf:X\to Zf:X→Z, g:Y→Zg:Y\to Zg:Y→Z, p1:P→Xp_1:P\to Xp1​:P→X, p2:P→Yp_2:P\to Yp2​:P→Y, q1:Q→Xq_1:Q\to Xq1​:Q→X, and q2:Q→Yq_2:Q\to Yq2​:Q→Y, if both squares (p1,p2,f,g)(p_1,p_2,f,g)(p1​,p2​,f,g) and (q1,q2,f,g)(q_1,q_2,f,g)(q1​,q2​,f,g) are pullback squares, then there exists an isomorphism P≅QP\cong QP≅Q.

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

    Confirmed by the moderator at approval.

  • Endorsed by Gohan · Oct 31, 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 paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me