Definitions for Two-Categorical Bundles and Their Classifying Spaces
DefinitionQAlgorithms_Papers_Independent_Intakenext100_P83The 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 ofI × Xonto{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 TopCatcarries 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 lengthk + 1, PDF p. 38.NondegenerateCech: The nondegenerate ordered Čech spaceN_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'sL^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.
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
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 and any natural number , a Čech chain of degree is a function that is strictly increasing: whenever , one has . Equivalently, it is an ordered tuple . Finiteness of is not assumed. For , the strict increase condition is vacuous and a chain is a single element of ; if is empty there are no such chains in any degree, and if is finite with fewer than elements there are no chains of degree .
QAlgorithms.Papers.Independent.Intakenext100.P83.CylinderCorner
For arbitrary types and and a function , the cylinder corner is the subtype
Thus it consists of the entire bottom , together with . No topology, continuity, injectivity, or nonemptiness is assumed. If is empty, this is just ; if is empty, it is empty.
QAlgorithms.Papers.Independent.Intakenext100.P83.FaceImage
Let be a topological space, a finite linearly ordered type, and a cover of by nonempty open subsets. For any natural number , the face image in degree is the set of all pairs , where for every , for which there exist an index and a pair , with for every , such that deleting the entry in position from the -tuple gives exactly the -tuple and . Existence is required, without uniqueness of either the deletion index or the longer tuple. This includes ; if there are no such longer pairs, the face image is empty.
QAlgorithms.Papers.Independent.Intakenext100.P83.FiniteOrderedOpenCover
For a topological space and a finite type equipped with a linear order, a finite ordered open cover consists of a family of subsets such that each is open, each is nonempty, and every belongs to at least one . Distinct indices are allowed to specify the same subset. The index type is not required to be nonempty: if is empty, the covering condition forces to be empty; if is empty, the nonemptiness condition on each member forces to be empty.
QAlgorithms.Papers.Independent.Intakenext100.P83.IsClosedCofibration
For arbitrary topological spaces and and a function , the predicate “ is a closed cofibration” means that is a topological embedding with closed image and that there exists a continuous map
where has the subspace topology, such that as a point of for every . In particular, this map fixes every bottom point and every point whose -coordinate lies in the image of . Empty spaces are permitted; when is empty the required retract is onto , and when is empty the retraction condition is vacuous.
QAlgorithms.Papers.Independent.Intakenext100.P83.IsGood
For a simplicial object in topological spaces, write for its space in degree . The predicate “ is good” means that, for every natural number and every index , the degeneracy map is a topological embedding with closed image and there exists a continuous map
where the codomain has its subspace topology, which fixes every point of . The quantification includes , with its single degeneracy index , and does not require any of the degree spaces to be nonempty.
QAlgorithms.Papers.Independent.Intakenext100.P83.IsLocallyEquiconnected
For any topological space , the predicate “ is locally equiconnected” means that the diagonal map , given by , is a topological embedding with closed image, and that there exists a continuous map
with the product and subspace topologies, which fixes every point of . Explicitly, whenever or . The space 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 be a topological space, let be a finite linearly ordered type, and let be a family of nonempty open subsets of covering . For any natural number , the type of nondegenerate Čech elements in degree consists of pairs
Thus it is the disjoint union, over all strictly increasing tuples of indices, of the corresponding intersections , retaining the tuple as part of each element. For , its elements are pairs with . An empty intersection contributes no elements, and the whole type is empty whenever there are fewer than indices.
QAlgorithms.Papers.Independent.Intakenext100.P83.cechFace
Let be a topological space, a finite linearly ordered type, and a cover of by nonempty open subsets. For any natural number , any index , and any pair with for every , the -th Čech face is defined by
Here the hat means that the entry in position is deleted and the remaining entries are reindexed in their existing order; the point is unchanged and belongs to every remaining cover member. The case 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 be a topological space, a finite linearly ordered type, and a cover of by nonempty open subsets. For any natural number , the face-union map has as its domain the disjoint union of copies of the degree- pairs, one copy for each ; an input is therefore a tagged pair , where belongs to every . It sends this input to
regarded as an element of the set of degree- pairs obtainable by deleting one entry from a degree- pair while retaining its point. Its membership in that set is witnessed by the supplied index and the supplied longer pair. The definition includes ; if no longer pair exists, both its domain and its codomain are empty.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.