Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Weak 2-pullbacks of the same cospan are equivalent

Open
QAlgorithms.Papers.Independent.Intakenext100.P43.proposition11_two_pullbacks_equivalent

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

prove2quantum

Let C\mathcal CC be a bicategory, f:X→Zf:X\to Zf:X→Z and g:Y→Zg:Y\to Zg:Y→Z two 1-morphisms, and P,QP,QP,Q two specified weak 2-pullback cones for this cospan. The weak universal property is precisely that of §2.1.3: every cone admits a cone morphism to the chosen cone, and any other such lift is related to it by a unique invertible 2-cell compatible with both projection comparisons. Then there are 1-morphisms a:P→Qa:P\to Qa:P→Q and b:Q→Pb:Q\to Pb:Q→P and invertible 2-cells

a;b≅id⁡P,b;a≅id⁡Q.a;b\cong\operatorname{id}_P,\qquad b;a\cong\operatorname{id}_Q.a;b≅idP​,b;a≅idQ​.

Thus the vertices are equivalent in C\mathcal CC. All comparison cells and ambient associators are retained; no global existence of 2-pullbacks is assumed.

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 WeakPullbacks

open CategoryTheory.Bicategory

variable {D : Type u} [Bicategory.{w, v} D]

/-- Proposition 11, PDF pp. 30–31: two specified weak 2-pullbacks
are equivalent objects of the ambient bicategory. Both inverse directions
and invertible composite-to-identity cells are retained; no equality of
vertices or global existence of 2-pullbacks is asserted. -/
theorem proposition11_two_pullbacks_equivalent
    {X Y Z : D} (f : X ⟶ Z) (g : Y ⟶ Z)
    (P Q : TwoPullbackCone f g)
    (hp : IsWeakTwoPullback P) (hq : IsWeakTwoPullback Q) :
    ∃ (a : P.vertex ⟶ Q.vertex) (b : Q.vertex ⟶ P.vertex),
      Nonempty (a ≫ b ≅ 𝟙 P.vertex) ∧ Nonempty (b ≫ a ≅ 𝟙 Q.vertex) := by sorry

end WeakPullbacks

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

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

In the ambient bicategory DDD, let X,Y,ZX,Y,ZX,Y,Z be objects and let f:X→Zf:X\to Zf:X→Z, g:Y→Zg:Y\to Zg:Y→Z be 1-morphisms. Let P,QP,QP,Q each consist of a vertex VP,VQV_P,V_QVP​,VQ​, legs to XXX and YYY, and a specified invertible 2-morphism between the composites of those legs with fff and ggg. Assume the following property for each R∈{P,Q}R\in\{P,Q\}R∈{P,Q}, writing its legs as r1,r2r_1,r_2r1​,r2​ and its comparison as θR:f∘r1≅g∘r2\theta_R:f\circ r_1\cong g\circ r_2θR​:f∘r1​≅g∘r2​: for every object VAV_AVA​, legs a1:VA→Xa_1:V_A\to Xa1​:VA​→X, a2:VA→Ya_2:V_A\to Ya2​:VA​→Y, and invertible 2-morphism θA:f∘a1≅g∘a2\theta_A:f\circ a_1\cong g\circ a_2θA​:f∘a1​≅g∘a2​, there exist u:VA→VRu:V_A\to V_Ru:VA​→VR​ and invertible 2-morphisms λu:a1≅r1∘u\lambda_u:a_1\cong r_1\circ uλu​:a1​≅r1​∘u, ρu:a2≅r2∘u\rho_u:a_2\cong r_2\circ uρu​:a2​≅r2​∘u, for which θA\theta_AθA​ equals the composite of fλuf\lambda_ufλu​, the associator to (f∘r1)∘u(f\circ r_1)\circ u(f∘r1​)∘u, the whiskered comparison θRu\theta_RuθR​u, the inverse associator to g∘(r2∘u)g\circ(r_2\circ u)g∘(r2​∘u), and gρu−1g\rho_u^{-1}gρu−1​; for every other u′u'u′ equipped with such coherent invertible 2-morphisms λu′,ρu′\lambda_{u'},\rho_{u'}λu′​,ρu′​, there is exactly one invertible 2-morphism ν:u≅u′\nu:u\cong u'ν:u≅u′ satisfying (r1ν)∘λu=λu′(r_1\nu)\circ\lambda_u=\lambda_{u'}(r1​ν)∘λu​=λu′​ and (r2ν)∘ρu=ρu′(r_2\nu)\circ\rho_u=\rho_{u'}(r2​ν)∘ρu​=ρu′​, where riνr_i\nuri​ν denotes postcomposition whiskering and these equations use vertical composition. Then there exist 1-morphisms a:VP→VQa:V_P\to V_Qa:VP​→VQ​ and b:VQ→VPb:V_Q\to V_Pb:VQ​→VP​ for which there exist invertible 2-morphisms

b∘a≅id⁡VP,a∘b≅id⁡VQ.b\circ a\cong\operatorname{id}_{V_P}, \qquad a\circ b\cong\operatorname{id}_{V_Q}.b∘a≅idVP​​,a∘b≅idVQ​​.
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