Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicablePipeline-generated
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

Simplicial horns and Kan fibrations

Definition

Work with the standard simplices Δ[n] (Simplicial sets, homotopies and trivial Kan fibrations). For n≥1 and 0≤k≤n the k-th horn Λk[n] is the union of the codimension-one faces ∂iΔ[n]≅Δ[n−1], i≠k, inside Δ[n]; equivalently, Λk[n]m consists of those order-preserving [m]→[n] that factor through a face [n−1]→[n] omitting an index i≠k. The inclusion Λk[n]↪Δ[n] is the horn inclusion; for n=1 the two horns are the two vertices and the inclusions are the vertex inclusions, and for n=0 there is no horn.

A Kan fibration is a map p ⁣:X→Y of simplicial sets with the right lifting property against every horn inclusion: every commutative square Λk[n]⟶X↓↓Δ[n]⟶Y with n≥1, 0≤k≤n admits a diagonal lift. A simplicial set X is Kan when its unique map X→Δ[0] to a point is a Kan fibration, i.e. every horn in X extends to a simplex. A trivial Kan fibration in the sense of Simplicial sets, homotopies and trivial Kan fibrations is a map with the same lifting property for all boundary inclusions ∂Δ[n]↪Δ[n], n≥0; a trivial Kan fibration is in particular a Kan fibration. For a horn lifting problem in dimension n, the prescribed faces specify the entire boundary of its missing (n−1)-face: intersect that face with the other faces. First use boundary lifting in dimension n−1 to supply the missing face over the corresponding face of the target simplex (for n=1 this is the degree-zero lift of a vertex). The now-complete boundary lifts in dimension n, producing the required horn filler.

For inclusions i ⁣:K→L and j ⁣:K′→L′ of simplicial sets, their pushout product is i □ j ⁣:(K×L′) ∪K×K′ (L×K′)⟶L×L′, the map from the pushout of the two inclusions K×L′→L×L′ and L×K′→L×L′. A map is anodyne here when it is a composite of maps obtained by cobase change (pushout) from coproducts ∐α(Λkα[nα]↪Δ[nα]) of horn inclusions. A map with the horn lifting property lifts against every anodyne map by successive lifting along the defining composites and coproduct factors; when the defining family is set-indexed, the simultaneous choice of lifts uses the Axiom of Choice (The Axiom of Choice), while finitely presented composites require no choice. These are lifting and construction definitions; they do not assert that a model structure on simplicial sets has been constructed.

Depends on

Used by

Dependency tree · two levels

5 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources