Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Definitions for Two-Categorical Bundles and Their Classifying Spaces

Definition
QAlgorithms_Papers_Independent_Intakenext100_P83

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

prove2quantum

The objects the formalized statements of Two-Categorical Bundles and Their Classifying Spaces (arXiv:math/0612549) are stated in. Each was checked against the paper by a blind read-back and a moderator.

  • CylinderCorner: The cylinder corner {0} × X ∪ I × range(i) with the subspace topology. This is the retract formulation of the homotopy extension property used in §5, PDF pp. 20–21. The interval is the closed real unit interval.
  • IsClosedCofibration: A closed cofibration is a closed embedding with the homotopy extension property. We use the equivalent cylinder-corner retraction criterion: a continuous retraction of I × X onto {0} × X ∪ I × range(i). The closed embedding ensures that the corner's subspace topology agrees with the topology used for pasting homotopies. Source: §5, PDF pp. 20–21.
  • IsLocallyEquiconnected: Definition of locally equiconnected in §5, PDF p. 20: the diagonal is a closed cofibration. No separation axiom is silently imposed.
  • IsGood: Definition of good simplicial space, PDF p. 51: every degeneracy is a closed cofibration. SimplicialObject TopCat carries every simplicial identity and continuity of all structure maps.
  • FiniteOrderedOpenCover: A finite totally ordered open cover. Section 6, PDF pp. 29–30 and 36, requires nonempty members. The index type itself may be empty when the base space is empty. We retain arbitrary finite linear orders, rather than fixing an enumeration or changing a partial order on unrelated general covers.
  • CechChain: Strictly increasing index chains of length k + 1, PDF p. 38.
  • NondegenerateCech: The nondegenerate ordered Čech space N_k, PDF p. 38. The dependent sum has the coproduct topology, and each intersection has its subspace topology. Different index chains remain different summands even if their intersections are the same subset of the base.
  • cechFace: Face map deleting the indicated vertex in a strictly increasing chain, with its underlying base point unchanged. PDF p. 38.
  • FaceImage: The union of the images of all face maps, with its subspace topology; this is the paper's L^k N, not a Reedy latching object. PDF pp. 38–39.
  • faceUnion: The canonical map from the disjoint union of the face domains onto the face-image union, PDF p. 38. Its domain uses the coproduct topology.
Definition code
import Mathlib

/-!
Statements from Baas, Bökstedt, and Kro, arXiv:math/0612549v2.
Only the four results whose complete interfaces are supplied below are drafted.
The other planned nodes are explicitly accounted for in the unit's HARD.md.
-/

open CategoryTheory
open scoped Simplicial

namespace QAlgorithms.Papers.Independent.Intakenext100.P83

universe u v

/-- The cylinder corner `{0} × X ∪ I × range(i)` with the subspace topology.
This is the retract formulation of the homotopy extension property used in §5,
PDF pp. 20–21. The interval is the closed real unit interval. -/
abbrev CylinderCorner {A : Type u} {X : Type v} (i : A → X) :=
  {p : unitInterval × X // p.1 = 0 ∨ p.2 ∈ Set.range i}

/-- A closed cofibration is a closed embedding with the homotopy extension
property. We use the equivalent cylinder-corner retraction criterion: a
continuous retraction of `I × X` onto `{0} × X ∪ I × range(i)`.
The closed embedding ensures that the corner's subspace topology agrees with
the topology used for pasting homotopies. Source: §5, PDF pp. 20–21. -/
def IsClosedCofibration {A : Type u} {X : Type v}
    [TopologicalSpace A] [TopologicalSpace X] (i : A → X) : Prop :=
  Topology.IsClosedEmbedding i ∧
    ∃ r : C(unitInterval × X, CylinderCorner i),
      ∀ z : CylinderCorner i, r z.val = z

/-- Definition of locally equiconnected in §5, PDF p. 20: the diagonal is a
closed cofibration. No separation axiom is silently imposed. -/
def IsLocallyEquiconnected (X : Type u) [TopologicalSpace X] : Prop :=
  IsClosedCofibration (fun x : X => (x, x))

/-- Definition of good simplicial space, PDF p. 51: every degeneracy is a
closed cofibration. `SimplicialObject TopCat` carries every simplicial identity
and continuity of all structure maps. -/
def IsGood (Z : SimplicialObject TopCat.{u}) : Prop :=
  ∀ (n : ℕ) (i : Fin (n + 1)),
    IsClosedCofibration (Z.σ i : Z _⦋n⦌ → Z _⦋n + 1⦌)

/-- Sanity check for the cylinder-corner definition: identity inclusions have
HEP, including on the empty space. -/
example (X : Type u) [TopologicalSpace X] :
    IsClosedCofibration (id : X → X) := by
  refine ⟨Topology.IsClosedEmbedding.id, ?_⟩
  refine ⟨⟨fun p => ⟨p, Or.inr ⟨p.2, rfl⟩⟩,
    continuous_id.subtype_mk _⟩, ?_⟩
  intro z
  apply Subtype.ext
  rfl

/-- A finite totally ordered open cover. Section 6, PDF pp. 29–30 and 36,
requires nonempty members. The index type itself may be empty when the base
space is empty. We retain arbitrary finite linear orders, rather than fixing
an enumeration or changing a partial order on unrelated general covers. -/
structure FiniteOrderedOpenCover (X : Type u) [TopologicalSpace X]
    (Index : Type v) [LinearOrder Index] [Fintype Index] where
  member : Index → Set X
  openMember : ∀ a, IsOpen (member a)
  nonemptyMember : ∀ a, (member a).Nonempty
  covers : ∀ x : X, ∃ a, x ∈ member a

/-- Strictly increasing index chains of length `k + 1`, PDF p. 38. -/
abbrev CechChain (Index : Type v) [LinearOrder Index] (k : ℕ) :=
  {a : Fin (k + 1) → Index // StrictMono a}

/-- The nondegenerate ordered Čech space `N_k`, PDF p. 38. The dependent sum
has the coproduct topology, and each intersection has its subspace topology.
Different index chains remain different summands even if their intersections
are the same subset of the base. -/
abbrev NondegenerateCech {X : Type u} [TopologicalSpace X]
    {Index : Type v} [LinearOrder Index] [Fintype Index]
    (U : FiniteOrderedOpenCover X Index) (k : ℕ) :=
  Σ a : CechChain Index k, {x : X // ∀ j, x ∈ U.member (a.val j)}

/-- Face map deleting the indicated vertex in a strictly increasing chain,
with its underlying base point unchanged. PDF p. 38. -/
def cechFace {X : Type u} [TopologicalSpace X]
    {Index : Type v} [LinearOrder Index] [Fintype Index]
    (U : FiniteOrderedOpenCover X Index) {k : ℕ} (i : Fin (k + 2))
    (x : NondegenerateCech U (k + 1)) : NondegenerateCech U k :=
  ⟨⟨fun j => x.1.val (i.succAbove j),
      x.1.property.comp (Fin.strictMono_succAbove i)⟩,
    ⟨x.2.val, fun j => x.2.property (i.succAbove j)⟩⟩

/-- The union of the images of all face maps, with its subspace topology;
this is the paper's `L^k N`, not a Reedy latching object. PDF pp. 38–39. -/
def FaceImage {X : Type u} [TopologicalSpace X]
    {Index : Type v} [LinearOrder Index] [Fintype Index]
    (U : FiniteOrderedOpenCover X Index) (k : ℕ) : Set (NondegenerateCech U k) :=
  {x | ∃ (i : Fin (k + 2)) (y : NondegenerateCech U (k + 1)), cechFace U i y = x}

/-- The canonical map from the disjoint union of the face domains onto the
face-image union, PDF p. 38. Its domain uses the coproduct topology. -/
def faceUnion {X : Type u} [TopologicalSpace X]
    {Index : Type v} [LinearOrder Index] [Fintype Index]
    (U : FiniteOrderedOpenCover X Index) (k : ℕ)
    (y : Σ _i : Fin (k + 2), NondegenerateCech U (k + 1)) : FaceImage U k :=
  ⟨cechFace U y.1 y.2, ⟨y.1, y.2, rfl⟩⟩

/-- Sanity check for the Čech face maps: deleting a vertex preserves the
underlying point of the base space. -/
example {X : Type u} [TopologicalSpace X]
    {Index : Type v} [LinearOrder Index] [Fintype Index]
    (U : FiniteOrderedOpenCover X Index) {k : ℕ} (i : Fin (k + 2))
    (x : NondegenerateCech U (k + 1)) :
    (cechFace U i x).2.val = x.2.val := by
  rfl

end QAlgorithms.Papers.Independent.Intakenext100.P83
Source
Two-Categorical Bundles and Their Classifying Spaces, arXiv:math/0612549v2, https://arxiv.org/abs/math/0612549v2
Read-back

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

QAlgorithms.Papers.Independent.Intakenext100.P83.CechChain

For a linearly ordered type III and any natural number k≥0k\geq0k≥0, a Čech chain of degree kkk is a function a:{0,…,k}→Ia:\{0,\ldots,k\}\to Ia:{0,…,k}→I that is strictly increasing: whenever j<ℓj<\ellj<ℓ, one has a(j)<a(ℓ)a(j)<a(\ell)a(j)<a(ℓ). Equivalently, it is an ordered tuple a0<⋯<aka_0<\cdots<a_ka0​<⋯<ak​. Finiteness of III is not assumed. For k=0k=0k=0, the strict increase condition is vacuous and a chain is a single element of III; if III is empty there are no such chains in any degree, and if III is finite with fewer than k+1k+1k+1 elements there are no chains of degree kkk.

QAlgorithms.Papers.Independent.Intakenext100.P83.CylinderCorner

For arbitrary types AAA and XXX and a function i:A→Xi:A\to Xi:A→X, the cylinder corner is the subtype

Ki={(t,x)∈[0,1]×X:t=0 or ∃a∈A, i(a)=x}.K_i=\{(t,x)\in[0,1]\times X:t=0\ \text{or}\ \exists a\in A,\ i(a)=x\}.Ki​={(t,x)∈[0,1]×X:t=0 or ∃a∈A, i(a)=x}.

Thus it consists of the entire bottom {0}×X\{0\}\times X{0}×X, together with [0,1]×i(A)[0,1]\times i(A)[0,1]×i(A). No topology, continuity, injectivity, or nonemptiness is assumed. If AAA is empty, this is just {0}×X\{0\}\times X{0}×X; if XXX is empty, it is empty.

QAlgorithms.Papers.Independent.Intakenext100.P83.FaceImage

Let XXX be a topological space, III a finite linearly ordered type, and U=(Ua)a∈IU=(U_a)_{a\in I}U=(Ua​)a∈I​ a cover of XXX by nonempty open subsets. For any natural number k≥0k\geq0k≥0, the face image in degree kkk is the set of all pairs ((a0<⋯<ak),x)((a_0<\cdots<a_k),x)((a0​<⋯<ak​),x), where x∈Uajx\in U_{a_j}x∈Uaj​​ for every jjj, for which there exist an index i∈{0,…,k+1}i\in\{0,\ldots,k+1\}i∈{0,…,k+1} and a pair ((b0<⋯<bk+1),y)((b_0<\cdots<b_{k+1}),y)((b0​<⋯<bk+1​),y), with y∈Ubjy\in U_{b_j}y∈Ubj​​ for every jjj, such that deleting the entry in position iii from the bbb-tuple gives exactly the aaa-tuple and y=xy=xy=x. Existence is required, without uniqueness of either the deletion index or the longer tuple. This includes k=0k=0k=0; if there are no such longer pairs, the face image is empty.

QAlgorithms.Papers.Independent.Intakenext100.P83.FiniteOrderedOpenCover

For a topological space XXX and a finite type III equipped with a linear order, a finite ordered open cover consists of a family of subsets (Ua)a∈I(U_a)_{a\in I}(Ua​)a∈I​ such that each UaU_aUa​ is open, each UaU_aUa​ is nonempty, and every x∈Xx\in Xx∈X belongs to at least one UaU_aUa​. Distinct indices are allowed to specify the same subset. The index type is not required to be nonempty: if III is empty, the covering condition forces XXX to be empty; if XXX is empty, the nonemptiness condition on each member forces III to be empty.

QAlgorithms.Papers.Independent.Intakenext100.P83.IsClosedCofibration

For arbitrary topological spaces AAA and XXX and a function i:A→Xi:A\to Xi:A→X, the predicate “iii is a closed cofibration” means that iii is a topological embedding with closed image and that there exists a continuous map

R:[0,1]×X⟶Ki,Ki={(t,x):t=0 or ∃a∈A, i(a)=x},R:[0,1]\times X\longrightarrow K_i,\qquad K_i=\{(t,x):t=0\ \text{or}\ \exists a\in A,\ i(a)=x\},R:[0,1]×X⟶Ki​,Ki​={(t,x):t=0 or ∃a∈A, i(a)=x},

where KiK_iKi​ has the subspace topology, such that R(t,x)=(t,x)R(t,x)=(t,x)R(t,x)=(t,x) as a point of KiK_iKi​ for every (t,x)∈Ki(t,x)\in K_i(t,x)∈Ki​. In particular, this map fixes every bottom point and every point whose XXX-coordinate lies in the image of iii. Empty spaces are permitted; when AAA is empty the required retract is onto {0}×X\{0\}\times X{0}×X, and when XXX is empty the retraction condition is vacuous.

QAlgorithms.Papers.Independent.Intakenext100.P83.IsGood

For a simplicial object ZZZ in topological spaces, write ZnZ_nZn​ for its space in degree nnn. The predicate “ZZZ is good” means that, for every natural number n≥0n\geq0n≥0 and every index i∈{0,…,n}i\in\{0,\ldots,n\}i∈{0,…,n}, the degeneracy map si:Zn→Zn+1s_i:Z_n\to Z_{n+1}si​:Zn​→Zn+1​ is a topological embedding with closed image and there exists a continuous map

Rn,i:[0,1]×Zn+1⟶Kn,i,Kn,i={(t,z):t=0 or ∃w∈Zn, si(w)=z},R_{n,i}:[0,1]\times Z_{n+1}\longrightarrow K_{n,i},\qquad K_{n,i}=\{(t,z):t=0\ \text{or}\ \exists w\in Z_n,\ s_i(w)=z\},Rn,i​:[0,1]×Zn+1​⟶Kn,i​,Kn,i​={(t,z):t=0 or ∃w∈Zn​, si​(w)=z},

where the codomain has its subspace topology, which fixes every point of Kn,iK_{n,i}Kn,i​. The quantification includes n=0n=0n=0, with its single degeneracy index i=0i=0i=0, and does not require any of the degree spaces to be nonempty.

QAlgorithms.Papers.Independent.Intakenext100.P83.IsLocallyEquiconnected

For any topological space XXX, the predicate “XXX is locally equiconnected” means that the diagonal map ΔX:X→X×X\Delta_X:X\to X\times XΔX​:X→X×X, given by ΔX(x)=(x,x)\Delta_X(x)=(x,x)ΔX​(x)=(x,x), is a topological embedding with closed image, and that there exists a continuous map

R:[0,1]×(X×X)⟶DX,DX={(t,(x,y)):t=0 or x=y},R:[0,1]\times(X\times X)\longrightarrow D_X,\qquad D_X=\{(t,(x,y)):t=0\ \text{or}\ x=y\},R:[0,1]×(X×X)⟶DX​,DX​={(t,(x,y)):t=0 or x=y},

with the product and subspace topologies, which fixes every point of DXD_XDX​. Explicitly, R(t,(x,y))=(t,(x,y))R(t,(x,y))=(t,(x,y))R(t,(x,y))=(t,(x,y)) whenever t=0t=0t=0 or x=yx=yx=y. The space XXX may be empty, in which case the diagonal has empty closed image and the required map has empty domain and codomain.

QAlgorithms.Papers.Independent.Intakenext100.P83.NondegenerateCech

Let XXX be a topological space, let III be a finite linearly ordered type, and let U=(Ua)a∈IU=(U_a)_{a\in I}U=(Ua​)a∈I​ be a family of nonempty open subsets of XXX covering XXX. For any natural number k≥0k\geq0k≥0, the type of nondegenerate Čech elements in degree kkk consists of pairs

((a0<⋯<ak),x)withx∈X,x∈Uaj for every j∈{0,…,k}.\bigl((a_0<\cdots<a_k),x\bigr) \quad\text{with}\quad x\in X,\qquad x\in U_{a_j}\ \text{for every }j\in\{0,\ldots,k\}.((a0​<⋯<ak​),x)withx∈X,x∈Uaj​​ for every j∈{0,…,k}.

Thus it is the disjoint union, over all strictly increasing tuples of k+1k+1k+1 indices, of the corresponding intersections Ua0∩⋯∩UakU_{a_0}\cap\cdots\cap U_{a_k}Ua0​​∩⋯∩Uak​​, retaining the tuple as part of each element. For k=0k=0k=0, its elements are pairs (a,x)(a,x)(a,x) with x∈Uax\in U_ax∈Ua​. An empty intersection contributes no elements, and the whole type is empty whenever there are fewer than k+1k+1k+1 indices.

QAlgorithms.Papers.Independent.Intakenext100.P83.cechFace

Let XXX be a topological space, III a finite linearly ordered type, and U=(Ua)a∈IU=(U_a)_{a\in I}U=(Ua​)a∈I​ a cover of XXX by nonempty open subsets. For any natural number k≥0k\geq0k≥0, any index i∈{0,…,k+1}i\in\{0,\ldots,k+1\}i∈{0,…,k+1}, and any pair ((a0<⋯<ak+1),x)((a_0<\cdots<a_{k+1}),x)((a0​<⋯<ak+1​),x) with x∈Uajx\in U_{a_j}x∈Uaj​​ for every j∈{0,…,k+1}j\in\{0,\ldots,k+1\}j∈{0,…,k+1}, the iii-th Čech face is defined by

di((a0<⋯<ak+1),x)=((a0<⋯<ai^<⋯<ak+1),x).d_i\bigl((a_0<\cdots<a_{k+1}),x\bigr) = \bigl((a_0<\cdots<\widehat{a_i}<\cdots<a_{k+1}),x\bigr).di​((a0​<⋯<ak+1​),x)=((a0​<⋯<ai​​<⋯<ak+1​),x).

Here the hat means that the entry in position iii is deleted and the remaining entries are reindexed in their existing order; the point xxx is unchanged and belongs to every remaining cover member. The case k=0k=0k=0 deletes one entry from a two-entry tuple. If no input pair exists, this is a function with empty domain.

QAlgorithms.Papers.Independent.Intakenext100.P83.faceUnion

Let XXX be a topological space, III a finite linearly ordered type, and U=(Ua)a∈IU=(U_a)_{a\in I}U=(Ua​)a∈I​ a cover of XXX by nonempty open subsets. For any natural number k≥0k\geq0k≥0, the face-union map has as its domain the disjoint union of copies of the degree-(k+1)(k+1)(k+1) pairs, one copy for each i∈{0,…,k+1}i\in\{0,\ldots,k+1\}i∈{0,…,k+1}; an input is therefore a tagged pair (i,((a0<⋯<ak+1),x))\bigl(i,((a_0<\cdots<a_{k+1}),x)\bigr)(i,((a0​<⋯<ak+1​),x)), where xxx belongs to every UajU_{a_j}Uaj​​. It sends this input to

((a0<⋯<ai^<⋯<ak+1),x),\bigl((a_0<\cdots<\widehat{a_i}<\cdots<a_{k+1}),x\bigr),((a0​<⋯<ai​​<⋯<ak+1​),x),

regarded as an element of the set of degree-kkk pairs obtainable by deleting one entry from a degree-(k+1)(k+1)(k+1) pair while retaining its point. Its membership in that set is witnessed by the supplied index iii and the supplied longer pair. The definition includes k=0k=0k=0; if no longer pair exists, both its domain and its codomain are empty.

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