Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Definitions for Higher gauge theory I: 2-Bundles

Definition
QAlgorithms_Papers_Independent_Intakenext100_P43

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

prove2quantum

The objects the formalized statements of Higher gauge theory I: 2-Bundles (arXiv:math/0410328) are stated in. Each was checked against the paper by a blind read-back and a moderator.

  • bundleCategoryStruct: The raw bundle-category operations of §1.3.1, PDF p. 11. Objects are arbitrary arrows to B; maps are commuting triangles.
  • IsRightAction: §1.4.3, equations (34), PDF pp. 15–16: a right action as equations on all generalized elements, equivalent to the two action diagrams. All operations are actual maps of C, so internal smoothness is retained when C is a smooth-space category.
  • RightGSpace: §1.4.4, PDF p. 16: an internal right G-space. No freeness, faithfulness, transitivity or nonemptiness condition is imposed.
  • RightGMap: §1.4.4, equation (35), PDF p. 16: a map commuting with the action. Testing on all generalized elements does not assume that C is concrete.
  • rightGSpaceCategoryStruct: The prescribed raw identities and composition from §1.4.4, p. 16. Closure uses only the commuting action squares; category laws are not assumed on the resulting objects.
  • InternalRelation: §1.1.4, PDF pp. 7–8: an internal equivalence relation, expressed using generalized elements. Joint monicity prevents extra relation witnesses.
  • CoverTheory: The five standing cover axioms, §1.1.5, PDF p. 8. This is the abstract formulation explicitly allowed by the source. It does not identify arbitrary regular epimorphisms with smooth covers.
  • CechData: The two specified pullback cones constructing U[2] and U[3], §1.1.5, PDF pp. 9–10. No global pullback-existence assumption is made.
  • cechDiagonal: The diagonal j[00], equation (17), PDF p. 9, constructed by universality.
  • cechSkip: The skip map j[02], equation (20), PDF p. 10, constructed by universality.
  • SatisfiesGamma: §1.5.1, equation (39), PDF p. 17: multiplicativity alone; the diagonal unit law is deliberately absent.
  • TwoPullbackCone: §2.1.3, equation (70), PDF p. 29: a weak pullback cone, carrying its specified invertible comparison cell.
  • TwoConeMorphism: §2.1.3, equations (71)–(72), PDF p. 30: a cone morphism with both invertible comparison cells and their pasting equation. The ambient associators are explicit.
  • IsWeakTwoPullback: §2.1.3, equations (73)–(74), PDF p. 30: the weak universal property. A lift exists, and every other lift is joined to it by a unique invertible cell compatible with both cone comparison cells.
Definition code
import Mathlib

/-!
Statements from Toby Bartels, Higher gauge theory I: 2-Bundles,
arXiv:math/0410328v3. New definitions are local to this paper.
The categorical statements use the source's explicitly permitted abstract
arrow-theoretic formulation. No concrete smooth cover realization is asserted.
-/

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]

/-- The raw bundle-category operations of §1.3.1, PDF p. 11.
Objects are arbitrary arrows to B; maps are commuting triangles. -/
def bundleCategoryStruct (B : C) : CategoryStruct (Over B) where
  Hom E Eprime := Over.Hom E Eprime
  id E := Over.homMk (𝟙 E.left) (by simp)
  comp f g := Over.homMk (f.left ≫ g.left) (by simp [Category.assoc])

/-- Sanity: the identity on a bundle is the identity on its total space. -/
example (B : C) (E : Over B) :
    ((bundleCategoryStruct B).id E).left = 𝟙 E.left := rfl

variable [CartesianMonoidalCategory C]

/-- §1.4.3, equations (34), PDF pp. 15–16: a right action as equations
on all generalized elements, equivalent to the two action diagrams.
All operations are actual maps of C, so internal smoothness is retained
when C is a smooth-space category. -/
def IsRightAction (G F : C) [GrpObj G] (r : F ⊗ G ⟶ F) : Prop :=
  (∀ (T : C) (a : T ⟶ F) (x y : T ⟶ G),
    lift (lift a x ≫ r) y ≫ r = lift a (lift x y ≫ MonObj.mul) ≫ r) ∧
  (∀ (T : C) (a : T ⟶ F),
    lift a (toUnit T ≫ MonObj.one (X := G)) ≫ r = a)

/-- Sanity: the terminal space has the trivial right action of every
internal group, including groups with a nonfaithful action on it. -/
example (G : C) [GrpObj G] :
    IsRightAction G (𝟙_ C) (toUnit ((𝟙_ C) ⊗ G)) := by
  constructor
  · intro T a x y
    exact toUnit_unique _ _
  · intro T a
    exact toUnit_unique _ _

/-- §1.4.4, PDF p. 16: an internal right G-space. No freeness,
faithfulness, transitivity or nonemptiness condition is imposed. -/
structure RightGSpace (G : C) [GrpObj G] where
  space : C
  actionMap : space ⊗ G ⟶ space
  actionLaws : IsRightAction G space actionMap

/-- §1.4.4, equation (35), PDF p. 16: a map commuting with the action.
Testing on all generalized elements does not assume that C is concrete. -/
structure RightGMap {G : C} [GrpObj G] (A D : RightGSpace G) where
  map : A.space ⟶ D.space
  equivariant : ∀ (T : C) (a : T ⟶ A.space) (x : T ⟶ G),
    (lift a x ≫ A.actionMap) ≫ map = lift (a ≫ map) x ≫ D.actionMap

/-- The prescribed raw identities and composition from §1.4.4, p. 16.
Closure uses only the commuting action squares; category laws are not
assumed on the resulting objects. -/
def rightGSpaceCategoryStruct (G : C) [GrpObj G] :
    CategoryStruct (RightGSpace G) where
  Hom A D := RightGMap A D
  id A := ⟨𝟙 A.space, by intro T a x; simp⟩
  comp f g := ⟨f.map ≫ g.map, by
    intro T a x
    calc
      (lift a x ≫ _) ≫ (f.map ≫ g.map) =
          (lift (a ≫ f.map) x ≫ _) ≫ g.map := by
        simpa only [Category.assoc] using
          congrArg (fun z => z ≫ g.map) (f.equivariant T a x)
      _ = lift (a ≫ (f.map ≫ g.map)) x ≫ _ := by
        simpa only [Category.assoc] using g.equivariant T (a ≫ f.map) x⟩

/-- Sanity: composition keeps the actual underlying maps in source order. -/
example (G : C) [GrpObj G] {A D E : RightGSpace G}
    (f : RightGMap A D) (g : RightGMap D E) :
    ((rightGSpaceCategoryStruct G).comp f g).map = f.map ≫ g.map := rfl

/-- §1.1.4, PDF pp. 7–8: an internal equivalence relation, expressed
using generalized elements. Joint monicity prevents extra relation witnesses. -/
structure InternalRelation (U : C) where
  relationSpace : C
  first : relationSpace ⟶ U
  second : relationSpace ⟶ U
  jointlyMonic : ∀ (T : C) (a b : T ⟶ relationSpace),
    a ≫ first = b ≫ first → a ≫ second = b ≫ second → a = b
  reflexive : ∀ (T : C) (x : T ⟶ U),
    ∃ a : T ⟶ relationSpace, a ≫ first = x ∧ a ≫ second = x
  euclidean : ∀ (T : C) (a b : T ⟶ relationSpace),
    a ≫ first = b ≫ first →
      ∃ c : T ⟶ relationSpace,
        c ≫ first = a ≫ second ∧ c ≫ second = b ≫ second

/-- The five standing cover axioms, §1.1.5, PDF p. 8.
This is the abstract formulation explicitly allowed by the source.
It does not identify arbitrary regular epimorphisms with smooth covers. -/
structure CoverTheory where
  covers : ∀ {U B : C}, (U ⟶ B) → Prop
  isomorphisms : ∀ {U B : C} (j : U ⟶ B), IsIso j → covers j
  composites : ∀ {U V B : C} (j : U ⟶ V) (k : V ⟶ B),
    covers j → covers k → covers (j ≫ k)
  pullbacks : ∀ {U B X : C} (j : U ⟶ B) (f : X ⟶ B), covers j →
    ∃ (P : C) (p1 : P ⟶ U) (p2 : P ⟶ X),
      IsPullback p1 p2 j f ∧ covers p2
  quotients : ∀ {U : C} (R : InternalRelation U), covers R.first →
    ∃ (Q : C) (q : U ⟶ Q) (h : R.first ≫ q = R.second ≫ q),
      covers q ∧ Nonempty (IsColimit (Cofork.ofπ q h))
  kernelQuotients : ∀ {U B P : C} (j : U ⟶ B) (p1 p2 : P ⟶ U),
    covers j → (h : IsPullback p1 p2 j j) →
      Nonempty (IsColimit (Cofork.ofπ j h.w))

/-- Sanity: all isomorphisms are covers, including the identity.
This checks that CoverTheory carries the source's first axiom. -/
example (S : CoverTheory (C := C)) (U : C) : S.covers (𝟙 U) :=
  S.isomorphisms _ (inferInstance : IsIso (𝟙 U))

/-- The two specified pullback cones constructing U[2] and U[3],
§1.1.5, PDF pp. 9–10. No global pullback-existence assumption is made. -/
structure CechData {U B : C} (j : U ⟶ B) where
  pairSpace : C
  first : pairSpace ⟶ U
  second : pairSpace ⟶ U
  square : IsPullback first second j j
  tripleSpace : C
  pair01 : tripleSpace ⟶ pairSpace
  pair12 : tripleSpace ⟶ pairSpace
  tripleSquare : IsPullback pair01 pair12 second first

/-- The diagonal j[00], equation (17), PDF p. 9, constructed by universality. -/
noncomputable def cechDiagonal {U B : C} {j : U ⟶ B} (K : CechData j) :
    U ⟶ K.pairSpace :=
  K.square.lift (𝟙 U) (𝟙 U) (by simp)

/-- The skip map j[02], equation (20), PDF p. 10, constructed by universality. -/
noncomputable def cechSkip {U B : C} {j : U ⟶ B} (K : CechData j) :
    K.tripleSpace ⟶ K.pairSpace :=
  K.square.lift (K.pair01 ≫ K.first) (K.pair12 ≫ K.second) (by
    calc
      (K.pair01 ≫ K.first) ≫ j = (K.pair01 ≫ K.second) ≫ j := by
        simp only [Category.assoc, K.square.w]
      _ = (K.pair12 ≫ K.first) ≫ j := by rw [K.tripleSquare.w]
      _ = (K.pair12 ≫ K.second) ≫ j := by
        simp only [Category.assoc, K.square.w])

/-- §1.5.1, equation (39), PDF p. 17: multiplicativity alone;
the diagonal unit law is deliberately absent. -/
def SatisfiesGamma {U B : C} {j : U ⟶ B} (K : CechData j)
    (G : C) [GrpObj G] (g : K.pairSpace ⟶ G) : Prop :=
  lift (K.pair01 ≫ g) (K.pair12 ≫ g) ≫ MonObj.mul = cechSkip K ≫ g

/-- Sanity: the constructed diagonal has both components equal to identity. -/
example {U B : C} {j : U ⟶ B} (K : CechData j) :
    cechDiagonal K ≫ K.first = 𝟙 U ∧ cechDiagonal K ≫ K.second = 𝟙 U := by
  constructor <;> simp [cechDiagonal]

end Ordinary

section WeakPullbacks

open CategoryTheory.Bicategory

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

/-- §2.1.3, equation (70), PDF p. 29: a weak pullback cone, carrying
its specified invertible comparison cell. -/
structure TwoPullbackCone {X Y Z : D} (f : X ⟶ Z) (g : Y ⟶ Z) where
  vertex : D
  first : vertex ⟶ X
  second : vertex ⟶ Y
  comparison : first ≫ f ≅ second ≫ g

/-- §2.1.3, equations (71)–(72), PDF p. 30: a cone morphism with
both invertible comparison cells and their pasting equation.
The ambient associators are explicit. -/
structure TwoConeMorphism {X Y Z : D} {f : X ⟶ Z} {g : Y ⟶ Z}
    (A P : TwoPullbackCone f g) where
  map : A.vertex ⟶ P.vertex
  firstCell : A.first ≅ map ≫ P.first
  secondCell : A.second ≅ map ≫ P.second
  coherence : A.comparison.hom =
    (firstCell.hom ▷ f) ≫ (α_ map P.first f).hom ≫
      (map ◁ P.comparison.hom) ≫ (α_ map P.second g).inv ≫ (secondCell.inv ▷ g)

/-- §2.1.3, equations (73)–(74), PDF p. 30: the weak universal
property. A lift exists, and every other lift is joined to it by a
unique invertible cell compatible with both cone comparison cells. -/
def IsWeakTwoPullback {X Y Z : D} {f : X ⟶ Z} {g : Y ⟶ Z}
    (P : TwoPullbackCone f g) : Prop :=
  ∀ A : TwoPullbackCone f g, ∃ u : TwoConeMorphism A P,
    ∀ uprime : TwoConeMorphism A P,
      ∃! nu : u.map ≅ uprime.map,
        u.firstCell.hom ≫ (nu.hom ▷ P.first) = uprime.firstCell.hom ∧
        u.secondCell.hom ≫ (nu.hom ▷ P.second) = uprime.secondCell.hom

/-- Sanity: comparison cells are invertible; they are not equations
between the cone's two composite 1-morphisms. -/
example {X Y Z : D} {f : X ⟶ Z} {g : Y ⟶ Z}
    (P : TwoPullbackCone f g) :
    P.comparison.hom ≫ P.comparison.inv = 𝟙 (P.first ≫ f) := by simp

end WeakPullbacks

end QAlgorithms.Papers.Independent.Intakenext100.P43
Source
Higher gauge theory I: 2-Bundles, arXiv:math/0410328v3, https://arxiv.org/abs/math/0410328v3
Read-back

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

QAlgorithms.Papers.Independent.Intakenext100.P43.CechData

For any objects U,BU,BU,B of the ambient category CCC and any morphism j:U→Bj:U\to Bj:U→B, this defines a structure consisting of an object PPP, maps s,t:P→Us,t:P\to Us,t:P→U, a proof that (s,t,j,j)(s,t,j,j)(s,t,j,j) is a pullback square, an object HHH, maps a,b:H→Pa,b:H\to Pa,b:H→P, and a proof that (a,b,t,s)(a,b,t,s)(a,b,t,s) is a pullback square. Thus j∘s=j∘tj\circ s=j\circ tj∘s=j∘t, and for every object TTT and maps u,v:T→Uu,v:T\to Uu,v:T→U satisfying j∘u=j∘vj\circ u=j\circ vj∘u=j∘v, there is a unique w:T→Pw:T\to Pw:T→P with s∘w=us\circ w=us∘w=u and t∘w=vt\circ w=vt∘w=v; also t∘a=s∘bt\circ a=s\circ bt∘a=s∘b, and for every object TTT and maps u,v:T→Pu,v:T\to Pu,v:T→P satisfying t∘u=s∘vt\circ u=s\circ vt∘u=s∘v, there is a unique w:T→Hw:T\to Hw:T→H with a∘w=ua\circ w=ua∘w=u and b∘w=vb\circ w=vb∘w=v.

QAlgorithms.Papers.Independent.Intakenext100.P43.CoverTheory

In the ambient category CCC, this defines a structure consisting of a predicate Cov⁡(j)\operatorname{Cov}(j)Cov(j) on morphisms j:U→Bj:U\to Bj:U→B, for every pair of objects U,BU,BU,B, and proofs of the following requirements. Every isomorphism j:U→Bj:U\to Bj:U→B satisfies Cov⁡(j)\operatorname{Cov}(j)Cov(j). For all objects U,V,BU,V,BU,V,B and morphisms j:U→Vj:U\to Vj:U→V, k:V→Bk:V\to Bk:V→B, if Cov⁡(j)\operatorname{Cov}(j)Cov(j) and Cov⁡(k)\operatorname{Cov}(k)Cov(k), then Cov⁡(k∘j)\operatorname{Cov}(k\circ j)Cov(k∘j). For all objects U,B,XU,B,XU,B,X, maps j:U→Bj:U\to Bj:U→B, f:X→Bf:X\to Bf:X→B, and a hypothesis Cov⁡(j)\operatorname{Cov}(j)Cov(j), there exist an object PPP and maps p1:P→Up_1:P\to Up1​:P→U, p2:P→Xp_2:P\to Xp2​:P→X forming a pullback square of jjj and fff, with Cov⁡(p2)\operatorname{Cov}(p_2)Cov(p2​). For every object UUU and every structure consisting of RRR, s,t:R→Us,t:R\to Us,t:R→U such that, for every object TTT, the maps s,ts,ts,t jointly distinguish morphisms T→RT\to RT→R, every x:T→Ux:T\to Ux:T→U has a lift a:T→Ra:T\to Ra:T→R with s∘a=t∘a=xs\circ a=t\circ a=xs∘a=t∘a=x, and any a,b:T→Ra,b:T\to Ra,b:T→R with s∘a=s∘bs\circ a=s\circ bs∘a=s∘b admit c:T→Rc:T\to Rc:T→R with s∘c=t∘as\circ c=t\circ as∘c=t∘a and t∘c=t∘bt\circ c=t\circ bt∘c=t∘b, the hypothesis Cov⁡(s)\operatorname{Cov}(s)Cov(s) implies that there exist an object QQQ and a map q:U→Qq:U\to Qq:U→Q, together with an equality q∘s=q∘tq\circ s=q\circ tq∘s=q∘t, such that Cov⁡(q)\operatorname{Cov}(q)Cov(q) and qqq is a coequalizer of s,ts,ts,t: for every object WWW and map v:U→Wv:U\to Wv:U→W satisfying v∘s=v∘tv\circ s=v\circ tv∘s=v∘t, there is a unique d:Q→Wd:Q\to Wd:Q→W with d∘q=vd\circ q=vd∘q=v. Finally, for all objects U,B,PU,B,PU,B,P, every j:U→Bj:U\to Bj:U→B, all p1,p2:P→Up_1,p_2:P\to Up1​,p2​:P→U, a hypothesis Cov⁡(j)\operatorname{Cov}(j)Cov(j), and a pullback square (p1,p2,j,j)(p_1,p_2,j,j)(p1​,p2​,j,j), the map jjj is a coequalizer of p1,p2p_1,p_2p1​,p2​: for every object WWW and map v:U→Wv:U\to Wv:U→W satisfying v∘p1=v∘p2v\circ p_1=v\circ p_2v∘p1​=v∘p2​, there is a unique d:B→Wd:B\to Wd:B→W with d∘j=vd\circ j=vd∘j=v.

QAlgorithms.Papers.Independent.Intakenext100.P43.InternalRelation

For an object UUU of the ambient category CCC, this defines a structure consisting of an object RRR, morphisms s,t:R→Us,t:R\to Us,t:R→U, and proofs of three conditions: for every object TTT and all a,b:T→Ra,b:T\to Ra,b:T→R, the equalities s∘a=s∘bs\circ a=s\circ bs∘a=s∘b and t∘a=t∘bt\circ a=t\circ bt∘a=t∘b imply a=ba=ba=b; for every object TTT and every x:T→Ux:T\to Ux:T→U, there exists a:T→Ra:T\to Ra:T→R such that s∘a=xs\circ a=xs∘a=x and t∘a=xt\circ a=xt∘a=x; and for every object TTT and all a,b:T→Ra,b:T\to Ra,b:T→R, if s∘a=s∘bs\circ a=s\circ bs∘a=s∘b, then there exists c:T→Rc:T\to Rc:T→R such that s∘c=t∘as\circ c=t\circ as∘c=t∘a and t∘c=t∘bt\circ c=t\circ bt∘c=t∘b.

QAlgorithms.Papers.Independent.Intakenext100.P43.IsRightAction

For objects G,FG,FG,F of the ambient category CCC, with a specified group-object structure on GGG, and a morphism r:F×G→Fr:F\times G\to Fr:F×G→F, this defines a proposition as the conjunction of two conditions. Writing μ:G×G→G\mu:G\times G\to Gμ:G×G→G for the group multiplication, e:1→Ge:1\to Ge:1→G for its unit, !T:T→1!_T:T\to1!T​:T→1 for the terminal morphism, and ⟨u,v⟩\langle u,v\rangle⟨u,v⟩ for product pairing, the conditions are that, for every object TTT, every a:T→Fa:T\to Fa:T→F, and every x,y:T→Gx,y:T\to Gx,y:T→G, r∘⟨r∘⟨a,x⟩,y⟩=r∘⟨a,μ∘⟨x,y⟩⟩r\circ\langle r\circ\langle a,x\rangle,y\rangle=r\circ\langle a,\mu\circ\langle x,y\rangle\rangler∘⟨r∘⟨a,x⟩,y⟩=r∘⟨a,μ∘⟨x,y⟩⟩, and that, for every object TTT and every a:T→Fa:T\to Fa:T→F, r∘⟨a,e∘!T⟩=ar\circ\langle a,e\circ!_T\rangle=ar∘⟨a,e∘!T​⟩=a.

QAlgorithms.Papers.Independent.Intakenext100.P43.IsWeakTwoPullback

In the ambient bicategory DDD, let X,Y,ZX,Y,ZX,Y,Z be objects, let f:X→Zf:X\to Zf:X→Z and g:Y→Zg:Y\to Zg:Y→Z be 1-morphisms, and let PPP consist of an object VPV_PVP​, legs p1:VP→Xp_1:V_P\to Xp1​:VP​→X, p2:VP→Yp_2:V_P\to Yp2​:VP​→Y, and a specified invertible 2-morphism θP:f∘p1≅g∘p2\theta_P:f\circ p_1\cong g\circ p_2θP​:f∘p1​≅g∘p2​. The proposition IsWeakTwoPullback⁡(P)\operatorname{IsWeakTwoPullback}(P)IsWeakTwoPullback(P) means that 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 specified 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 a 1-morphism u:VA→VPu:V_A\to V_Pu:VA​→VP​ and invertible 2-morphisms λu:a1≅p1∘u\lambda_u:a_1\cong p_1\circ uλu​:a1​≅p1​∘u, ρu:a2≅p2∘u\rho_u:a_2\cong p_2\circ uρu​:a2​≅p2​∘u such that θA\theta_AθA​ equals the composite obtained by whiskering λu\lambda_uλu​ with fff, applying the associator from f∘(p1∘u)f\circ(p_1\circ u)f∘(p1​∘u) to (f∘p1)∘u(f\circ p_1)\circ u(f∘p1​)∘u, whiskering θP\theta_PθP​ with uuu, applying the inverse associator to reach g∘(p2∘u)g\circ(p_2\circ u)g∘(p2​∘u), and whiskering ρu−1\rho_u^{-1}ρu−1​ with ggg; moreover, for every other 1-morphism u′:VA→VPu':V_A\to V_Pu′:VA​→VP​ equipped with invertible 2-morphisms λu′:a1≅p1∘u′\lambda_{u'}:a_1\cong p_1\circ u'λu′​:a1​≅p1​∘u′ and ρu′:a2≅p2∘u′\rho_{u'}:a_2\cong p_2\circ u'ρu′​:a2​≅p2​∘u′ satisfying that same coherence condition, there exists exactly one invertible 2-morphism ν:u≅u′\nu:u\cong u'ν:u≅u′ such that

(p1ν)∘λu=λu′,(p2ν)∘ρu=ρu′.(p_1\nu)\circ\lambda_u=\lambda_{u'}, \qquad (p_2\nu)\circ\rho_u=\rho_{u'}.(p1​ν)∘λu​=λu′​,(p2​ν)∘ρu​=ρu′​.

Here piνp_i\nupi​ν denotes postcomposition whiskering, and the compositions in these two equations are vertical compositions of 2-morphisms.

QAlgorithms.Papers.Independent.Intakenext100.P43.RightGMap

For an object GGG of the ambient category CCC with a specified group-object structure, let AAA and DDD be structures consisting respectively of objects FA,FDF_A,F_DFA​,FD​ and maps rA:FA×G→FAr_A:F_A\times G\to F_ArA​:FA​×G→FA​, rD:FD×G→FDr_D:F_D\times G\to F_DrD​:FD​×G→FD​, each satisfying ri∘⟨ri∘⟨a,x⟩,y⟩=ri∘⟨a,μ∘⟨x,y⟩⟩r_i\circ\langle r_i\circ\langle a,x\rangle,y\rangle=r_i\circ\langle a,\mu\circ\langle x,y\rangle\rangleri​∘⟨ri​∘⟨a,x⟩,y⟩=ri​∘⟨a,μ∘⟨x,y⟩⟩ for every object TTT, every a:T→Fia:T\to F_ia:T→Fi​, and all x,y:T→Gx,y:T\to Gx,y:T→G, and ri∘⟨a,e∘!T⟩=ar_i\circ\langle a,e\circ!_T\rangle=ari​∘⟨a,e∘!T​⟩=a for every such T,aT,aT,a, where i∈{A,D}i\in\{A,D\}i∈{A,D}. This defines a structure consisting of a map h:FA→FDh:F_A\to F_Dh:FA​→FD​ and a proof that, for every object TTT, every a:T→FAa:T\to F_Aa:T→FA​, and every x:T→Gx:T\to Gx:T→G, h∘rA∘⟨a,x⟩=rD∘⟨h∘a,x⟩h\circ r_A\circ\langle a,x\rangle=r_D\circ\langle h\circ a,x\rangleh∘rA​∘⟨a,x⟩=rD​∘⟨h∘a,x⟩. Here μ\muμ and eee are the group multiplication and unit, !T!_T!T​ is the terminal morphism, and brackets denote product pairing.

QAlgorithms.Papers.Independent.Intakenext100.P43.RightGSpace

For an object GGG of the ambient category CCC, equipped with a specified group-object structure, this defines a structure consisting of an object FFF, a morphism r:F×G→Fr:F\times G\to Fr:F×G→F, and proofs of two conditions: for every object TTT, every a:T→Fa:T\to Fa:T→F, and all x,y:T→Gx,y:T\to Gx,y:T→G, r∘⟨r∘⟨a,x⟩,y⟩=r∘⟨a,μ∘⟨x,y⟩⟩r\circ\langle r\circ\langle a,x\rangle,y\rangle=r\circ\langle a,\mu\circ\langle x,y\rangle\rangler∘⟨r∘⟨a,x⟩,y⟩=r∘⟨a,μ∘⟨x,y⟩⟩; and for every object TTT and every a:T→Fa:T\to Fa:T→F, r∘⟨a,e∘!T⟩=ar\circ\langle a,e\circ!_T\rangle=ar∘⟨a,e∘!T​⟩=a. Here μ:G×G→G\mu:G\times G\to Gμ:G×G→G and e:1→Ge:1\to Ge:1→G are the specified multiplication and unit, !T:T→1!_T:T\to1!T​:T→1 is the terminal morphism, and brackets denote product pairing.

QAlgorithms.Papers.Independent.Intakenext100.P43.SatisfiesGamma

In the ambient category CCC, let U,BU,BU,B be objects, let j:U→Bj:U\to Bj:U→B, and let KKK consist of a pullback RRR of jjj along itself with projections p1,p2:R→Up_1,p_2:R\to Up1​,p2​:R→U, together with a pullback TTT of p2p_2p2​ and p1p_1p1​ with projections q01,q12:T→Rq_{01},q_{12}:T\to Rq01​,q12​:T→R. Let GGG be an object equipped with a group-object structure, with multiplication μ:G×G→G\mu:G\times G\to Gμ:G×G→G, and let g:R→Gg:R\to Gg:R→G. Write s:T→Rs:T\to Rs:T→R for the unique map satisfying p1∘s=p1∘q01p_1\circ s=p_1\circ q_{01}p1​∘s=p1​∘q01​ and p2∘s=p2∘q12p_2\circ s=p_2\circ q_{12}p2​∘s=p2​∘q12​. The proposition SatisfiesGamma⁡(K,G,g)\operatorname{SatisfiesGamma}(K,G,g)SatisfiesGamma(K,G,g) means exactly the equality of morphisms T→GT\to GT→G

μ∘⟨g∘q01, g∘q12⟩=g∘s,\mu\circ\left\langle g\circ q_{01},\,g\circ q_{12}\right\rangle=g\circ s,μ∘⟨g∘q01​,g∘q12​⟩=g∘s,

where ⟨−,−⟩\langle-,-\rangle⟨−,−⟩ denotes the map into the product with the specified components.

QAlgorithms.Papers.Independent.Intakenext100.P43.TwoConeMorphism

In the ambient bicategory DDD, let X,Y,ZX,Y,ZX,Y,Z be objects, let f:X→Zf:X\to Zf:X→Z and g:Y→Zg:Y\to Zg:Y→Z be 1-morphisms, and let A,PA,PA,P each consist of a vertex VA,VPV_A,V_PVA​,VP​, legs a1:VA→Xa_1:V_A\to Xa1​:VA​→X, a2:VA→Ya_2:V_A\to Ya2​:VA​→Y, p1:VP→Xp_1:V_P\to Xp1​:VP​→X, p2:VP→Yp_2:V_P\to Yp2​:VP​→Y, and specified invertible 2-morphisms θA:f∘a1≅g∘a2\theta_A:f\circ a_1\cong g\circ a_2θA​:f∘a1​≅g∘a2​ and θP:f∘p1≅g∘p2\theta_P:f\circ p_1\cong g\circ p_2θP​:f∘p1​≅g∘p2​. A TwoConeMorphism⁡(A,P)\operatorname{TwoConeMorphism}(A,P)TwoConeMorphism(A,P) consists of a 1-morphism u:VA→VPu:V_A\to V_Pu:VA​→VP​ and invertible 2-morphisms λ:a1≅p1∘u\lambda:a_1\cong p_1\circ uλ:a1​≅p1​∘u and ρ:a2≅p2∘u\rho:a_2\cong p_2\circ uρ:a2​≅p2​∘u, satisfying the following coherence condition: the underlying 2-morphism of θA\theta_AθA​ equals the composite

f∘a1⇒ fλ f∘(p1∘u)⇒ associator (f∘p1)∘u⇒ θPu (g∘p2)∘u⇒ inverse associator g∘(p2∘u)⇒ gρ−1 g∘a2.f\circ a_1 \xRightarrow{\,f\lambda\,} f\circ(p_1\circ u) \xRightarrow{\,\text{associator}\,} (f\circ p_1)\circ u \xRightarrow{\,\theta_P u\,} (g\circ p_2)\circ u \xRightarrow{\,\text{inverse associator}\,} g\circ(p_2\circ u) \xRightarrow{\,g\rho^{-1}\,} g\circ a_2.f∘a1​fλ​f∘(p1​∘u)associator​(f∘p1​)∘uθP​u​(g∘p2​)∘uinverse associator​g∘(p2​∘u)gρ−1​g∘a2​.

Here fλf\lambdafλ and gρ−1g\rho^{-1}gρ−1 denote postcomposition whiskering, θPu\theta_PuθP​u denotes precomposition whiskering, and the associators are those of DDD.

QAlgorithms.Papers.Independent.Intakenext100.P43.TwoPullbackCone

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 and g:Y→Zg:Y\to Zg:Y→Z be 1-morphisms. A TwoPullbackCone⁡(f,g)\operatorname{TwoPullbackCone}(f,g)TwoPullbackCone(f,g) consists of an object VVV, 1-morphisms p:V→Xp:V\to Xp:V→X and q:V→Yq:V\to Yq:V→Y, and a specified invertible 2-morphism f∘p≅g∘qf\circ p\cong g\circ qf∘p≅g∘q.

QAlgorithms.Papers.Independent.Intakenext100.P43.bundleCategoryStruct

For each object BBB of the ambient category CCC, this defines morphisms, identities, and composition on the objects of the slice over BBB. An object is a morphism e:E→Be:E\to Be:E→B; a morphism from e:E→Be:E\to Be:E→B to e′:E′→Be':E'\to Be′:E′→B is a morphism h:E→E′h:E\to E'h:E→E′ satisfying e′∘h=ee'\circ h=ee′∘h=e. The identity of eee has underlying morphism id⁡E\operatorname{id}_EidE​, and the composite of morphisms with underlying maps h:E→E′h:E\to E'h:E→E′ and k:E′→E′′k:E'\to E''k:E′→E′′ has underlying map k∘hk\circ hk∘h. This definition supplies these operations without including proofs of the category laws.

QAlgorithms.Papers.Independent.Intakenext100.P43.cechDiagonal

In the ambient category CCC, let U,BU,BU,B be objects, let j:U→Bj:U\to Bj:U→B, and let KKK consist of objects R,TR,TR,T, maps p1,p2:R→Up_1,p_2:R\to Up1​,p2​:R→U exhibiting RRR as a pullback of jjj along itself, and maps q01,q12:T→Rq_{01},q_{12}:T\to Rq01​,q12​:T→R exhibiting TTT as a pullback of p2:R→Up_2:R\to Up2​:R→U and p1:R→Up_1:R\to Up1​:R→U. The morphism cechDiagonal⁡(K):U→R\operatorname{cechDiagonal}(K):U\to RcechDiagonal(K):U→R is the unique morphism δ\deltaδ satisfying p1∘δ=id⁡Up_1\circ\delta=\operatorname{id}_Up1​∘δ=idU​ and p2∘δ=id⁡Up_2\circ\delta=\operatorname{id}_Up2​∘δ=idU​, obtained from the first pullback using the two identity maps of UUU.

QAlgorithms.Papers.Independent.Intakenext100.P43.cechSkip

In the ambient category CCC, let U,BU,BU,B be objects, let j:U→Bj:U\to Bj:U→B, and let KKK consist of objects R,TR,TR,T, maps p1,p2:R→Up_1,p_2:R\to Up1​,p2​:R→U exhibiting RRR as a pullback of jjj along itself, and maps q01,q12:T→Rq_{01},q_{12}:T\to Rq01​,q12​:T→R exhibiting TTT as a pullback of p2p_2p2​ and p1p_1p1​. Thus j∘p1=j∘p2j\circ p_1=j\circ p_2j∘p1​=j∘p2​ and p2∘q01=p1∘q12p_2\circ q_{01}=p_1\circ q_{12}p2​∘q01​=p1​∘q12​. The morphism cechSkip⁡(K):T→R\operatorname{cechSkip}(K):T\to RcechSkip(K):T→R is the unique morphism sss satisfying p1∘s=p1∘q01p_1\circ s=p_1\circ q_{01}p1​∘s=p1​∘q01​ and p2∘s=p2∘q12p_2\circ s=p_2\circ q_{12}p2​∘s=p2​∘q12​; the displayed pullback equalities ensure that these two prescribed maps to UUU have equal composites with jjj.

QAlgorithms.Papers.Independent.Intakenext100.P43.rightGSpaceCategoryStruct

For an object GGG of the ambient category CCC with a specified group-object structure, this defines morphisms, identities, and composition on structures (F,r)(F,r)(F,r), where FFF is an object and r:F×G→Fr:F\times G\to Fr:F×G→F satisfies, for every object TTT, every a:T→Fa:T\to Fa:T→F, and all x,y:T→Gx,y:T\to Gx,y:T→G, r∘⟨r∘⟨a,x⟩,y⟩=r∘⟨a,μ∘⟨x,y⟩⟩r\circ\langle r\circ\langle a,x\rangle,y\rangle=r\circ\langle a,\mu\circ\langle x,y\rangle\rangler∘⟨r∘⟨a,x⟩,y⟩=r∘⟨a,μ∘⟨x,y⟩⟩, and, for every T,aT,aT,a, r∘⟨a,e∘!T⟩=ar\circ\langle a,e\circ!_T\rangle=ar∘⟨a,e∘!T​⟩=a. A morphism from (FA,rA)(F_A,r_A)(FA​,rA​) to (FD,rD)(F_D,r_D)(FD​,rD​) consists of a map h:FA→FDh:F_A\to F_Dh:FA​→FD​ together with a proof that h∘rA∘⟨a,x⟩=rD∘⟨h∘a,x⟩h\circ r_A\circ\langle a,x\rangle=r_D\circ\langle h\circ a,x\rangleh∘rA​∘⟨a,x⟩=rD​∘⟨h∘a,x⟩ for every object TTT, a:T→FAa:T\to F_Aa:T→FA​, and x:T→Gx:T\to Gx:T→G. The identity has underlying map id⁡FA\operatorname{id}_{F_A}idFA​​, and the composite of morphisms with underlying maps hhh and kkk has underlying map k∘hk\circ hk∘h, with proofs that these maps satisfy the required equation. Here μ\muμ and eee are the group multiplication and unit, !T!_T!T​ is the terminal morphism, and brackets denote product pairing; the definition supplies these operations without including proofs of the category laws.

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