Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-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.

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 p ⁣:X→Y of simplicial sets and, where needed, a degreewise injective map Z→W of simplicial sets and a vertex y∈Y0.

[F1]

A map p ⁣:X→Y is a trivial Kan fibration when every square with left side ∂Δ[n]↪Δ[n], n≥0, admits a diagonal lift; the boundary consists of the non-surjective maps, ∂Δ[0]=∅, and in degree zero the condition is surjectivity of p0 (Simplicial sets, homotopies and trivial Kan fibrations).

[F2]

A simplicial homotopy from f to g is a map H ⁣:X×Δ[1]→Y restricting to f and g 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).

[F3]

AC: every family of nonempty sets indexed by a set has a choice function (The Axiom of Choice).

Proof

1.1F1givenconstruct

Unique nondegenerate ancestors. Every simplex x of a simplicial set has a unique expression x=α∗y with α surjective and y nondegenerate. For the first assertion, if α∗y=β∗z with α,β surjective and y,z nondegenerate, choose an order-preserving section ξ of β; factor αξ as a surjection followed by an injection. A nonidentity surjective factor would express z=(αξ)∗y as degenerate, so nondegeneracy forces αξ to be injective, hence dim⁡z≤dim⁡y, 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 j may be included in such a section (choose j in its fibre of β and any position in each other ordered fibre), so α(j)=β(j) for all j. Thus α=β, and applying a section recovers y=z. 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.

1.2F1F3given

Stability under pullback and products. If Y′→Y is a map of simplicial sets, the pullback p′ ⁣:X×YY′→Y′ lifts any boundary square because a lift of the corresponding square for p, composed with the projection, provides a lift for p′ by the universal property. For a set-indexed family (pi ⁣:Xi→Yi) 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.

2.1F1F3step 1.1

Lifting monomorphisms. Let Z⊆W be a degreewise injective map and let f ⁣:Z→X, g ⁣:W→Y satisfy pf=g∣Z. Well-order the nondegenerate simplices of W not lying in Z 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 W→X lifting along p and extending f. This proves lifting against every monomorphism. AC is used exactly in the well-ordering and in the transfinite selection of lifts.

3.1F1F2step 2.1step 1.2

Fibres are trivial fibrations over a point. The fibre F=Xy=p−1(y) over a vertex y∈Y0, defined as the pullback of p along the map Δ[0]→Y with value y, is a trivial Kan fibration over Δ[0] by step 1.2; in particular F0 is nonempty by degree-zero surjectivity [F1]. Choose a vertex of F, which gives a section q ⁣:Δ[0]→F; the existence of one vertex follows from degree-zero surjectivity and needs only a single choice. The inclusion of the boundary F×∂Δ[1]⊆F×Δ[1] has prescribed maps idF on F×{0} and q∘pF on F×{1}, where pF ⁣:F→Δ[0]; lifting this square by step 2.1 (the inclusion is degreewise injective) yields a homotopy from idF to the constant map, and the composite pF∘q=idΔ[0], so F 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.

4.1F2step 2.1discharge-construct∎

Homotopy equivalence. Lifting the inclusion X×∂Δ[1]⊆X×Δ[1] with the prescribed maps idX on X×{0} and q′ ⁣p on X×{1}, where q′ ⁣:Y→X is a section of p obtained by lifting the empty subobject of Y (AC supplies the simultaneous choices over the simplex set of Y, using step 2.1 with Z=∅), gives a homotopy from idX to q′ ⁣p, while pq′=idY; hence p is a simplicial homotopy equivalence.

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