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.
Trivial simplicial fibrations lift monomorphisms and have contractible products of fibres
Statement
Assume the Axiom of Choice (AC) (The Axiom of Choice). A trivial Kan fibration of simplicial sets (Simplicial sets, homotopies and trivial Kan fibrations) lifts every degreewise injective map. It is stable under pullback and under set-indexed products. Every fibre over a vertex of a constant target is nonempty and contractible, and every set-indexed product of such fibres is nonempty and contractible. In particular, a trivial Kan fibration is a simplicial homotopy equivalence.
Facts & Assumptions
Given: AC; a trivial Kan fibration of simplicial sets and, where needed, a degreewise injective map of simplicial sets and a vertex .
A map is a trivial Kan fibration when every square with left side , , admits a diagonal lift; the boundary consists of the non-surjective maps, , and in degree zero the condition is surjectivity of (Simplicial sets, homotopies and trivial Kan fibrations).
A simplicial homotopy from to is a map restricting to and at the two vertices; a simplicial set is contractible when it is homotopy equivalent to the one-point constant simplicial set (Simplicial sets, homotopies and trivial Kan fibrations).
AC: every family of nonempty sets indexed by a set has a choice function (The Axiom of Choice).
Proof
Unique nondegenerate ancestors. Every simplex of a simplicial set has a unique expression with surjective and nondegenerate. For the first assertion, if with surjective and nondegenerate, choose an order-preserving section of ; factor as a surjection followed by an injection. A nonidentity surjective factor would express as degenerate, so nondegeneracy forces to be injective, hence , and symmetry gives equality of the dimensions. For every order-preserving section of , the map is then an order-preserving injection between equally sized finite ordinals, hence the identity. Every position may be included in such a section (choose in its fibre of and any position in each other ordered fibre), so for all . Thus , and applying a section recovers . Existence follows by repeatedly applying degeneracy operators backwards until the dimension drops and the resulting simplex is nondegenerate. Consequently, adjoining a missing simplex of smallest dimension together with its degeneracies is exactly the pushout of a simplex along its boundary, and no two such adjunctions conflict.
Stability under pullback and products. If is a map of simplicial sets, the pullback lifts any boundary square because a lift of the corresponding square for , composed with the projection, provides a lift for by the universal property. For a set-indexed family of trivial Kan fibrations, a boundary square into the product has coordinate boundary squares; by [F3] choose one lift in each coordinate simultaneously and combine them by the universal property of the product. The empty product is the one-point simplicial set, and the statement holds vacuously.
Lifting monomorphisms. Let be a degreewise injective map and let , satisfy . Well-order the nondegenerate simplices of not lying in first by dimension and then within each dimension, using [F3]. Adjoin them one at a time: at each stage the new nondegenerate simplex has boundary lying in the already constructed part (by the minimality of the ordering), so the lifting property of the trivial Kan fibration supplies a lift of that simplex over the prescribed boundary; at limit stages take the union. Step 1.1 ensures that the degenerate simplices generated along the way receive compatible values, so the construction produces a map lifting along and extending . This proves lifting against every monomorphism. AC is used exactly in the well-ordering and in the transfinite selection of lifts.
Fibres are trivial fibrations over a point. The fibre over a vertex , defined as the pullback of along the map with value , is a trivial Kan fibration over by step 1.2; in particular is nonempty by degree-zero surjectivity [F1]. Choose a vertex of , which gives a section ; the existence of one vertex follows from degree-zero surjectivity and needs only a single choice. The inclusion of the boundary has prescribed maps on and on , where ; lifting this square by step 2.1 (the inclusion is degreewise injective) yields a homotopy from to the constant map, and the composite , so is contractible. The product of a set-indexed family of fibres is itself a trivial Kan fibration over a point by step 1.2, so the same argument applies to it and gives nonemptiness and contractibility.
Homotopy equivalence. Lifting the inclusion with the prescribed maps on and on , where is a section of obtained by lifting the empty subobject of (AC supplies the simultaneous choices over the simplex set of , using step 2.1 with ), gives a homotopy from to , while ; hence is a simplicial homotopy equivalence.
Depends on
Used by
- Additive Kan maps and the normalized fibration criterion Lemma
- Independence of the cotangent complex from the chosen simplicial resolution Lemma
- Replacement-invariant derived enriched mapping spaces Lemma
- The boundary and horn product has a finite horn attachment Lemma
- Variable-base cotensor corners and path objects Lemma
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
- The Stacks Project, Chapter 14 (Simplicial Methods) (standard reference, not scraped)