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.
Additive Kan maps and the normalized fibration criterion
Statement
Every simplicial abelian group is Kan (Simplicial horns and Kan fibrations). A homomorphism of simplicial abelian groups is a Kan fibration exactly when is surjective for all . It has boundary lifting exactly when it is a Kan fibration and a quasi-isomorphism on normalized complexes (Normalized simplicial chains, prism homotopies and the abelian trivial-fibration criterion). Underlying horn and boundary lifting therefore detect precisely these classes for simplicial modules and for commutative unital or nonunital simplicial algebras. The Axiom of Choice (The Axiom of Choice) is assumed for the arbitrary-monomorphism contraction route in the boundary converse.
Facts & Assumptions
Given: A homomorphism of simplicial abelian groups, with normalized complexes and ; AC.
Horns , Kan fibrations, anodyne inclusions and the lifting translation are as defined for simplicial sets; the additive horn identities are the simplicial identities (Simplicial horns and Kan fibrations).
The normalization is an exact equivalence with explicit inverse; in particular every simplicial abelian group decomposes naturally as through the degeneracy maps, preserves finite limits and colimits and turns degreewise surjections into surjections (Dold-Kan equivalence for simplicial modules with explicit inverse).
A termwise surjective homomorphism inducing a quasi-isomorphism of associated complexes is a trivial Kan fibration, hence lifts all boundary inclusions and all monomorphisms; a homomorphism that is a homotopy equivalence of underlying simplicial sets induces a quasi-isomorphism (Normalized simplicial chains, prism homotopies and the abelian trivial-fibration criterion, Trivial simplicial fibrations lift monomorphisms and have contractible products of fibres).
Proof
Every simplicial abelian group is Kan. A horn in prescribes for with the compatibility for , . Beginning with , for replace by : the replacement fixes face because , and it preserves all earlier faces because for the identity holds and . Then for replace by , which fixes face since and preserves every already fixed face and by the same compatibility identities. The resulting fills every prescribed face, so is Kan.
Kan implies normalized surjectivity. Let be a Kan fibration and let , . Use the zero horn and target simplex ; its faces for are zero, so this is a commutative horn square. A horn lift satisfies and for , hence ; thus is surjective.
Termwise surjective additive maps are Kan. If is termwise surjective and a horn in is given, lift its target simplex to some , subtract the faces of from the prescribed horn to obtain a compatible horn in the kernel (which is a simplicial abelian group, hence Kan by step 1.1), fill that horn by step 1.1, and add the filler to . The result is a horn filler in .
Boundary lifting from Kan plus quasi-isomorphism. Suppose is Kan and is a quasi-isomorphism. Positive normalized degrees surject by step 1.2. In degree zero, given choose with the same class in and write for some ; lifting to by step 1.2 and correcting gives degree-zero surjectivity, so all normalized degrees are surjective and the Dold-Kan decomposition makes termwise surjective. The kernel of then has acyclic normalization by the exact sequence of normalized complexes, and an explicit boundary-filling argument applies: lift the target simplex, reduce to a boundary in , fill faces by successive degeneracy corrections as in step 1.1, and use acyclicity of to correct the last normalized discrepancy. For termwise surjectivity suffices. Hence has boundary lifting.
Normalized surjectivity implies Kan. Assume is surjective for all , and let be the set of simplices whose vertex component in lies in the image of ; every vertex of a simplex has the same component, since successive vertices are joined by an edge whose difference is a boundary, so is a simplicial subgroup and a union of components, and maps into . By the Dold-Kan decomposition of [F2], an element of lifts to : write it in the summands (), lift each coefficient by the hypothesis, and for the coefficient use that its component lies in the image of , choosing and with , lifting to and correcting . Hence is termwise surjective and is Kan by step 2.1. A horn square for with has a nonempty horn, so its target simplex has a vertex and therefore lies in ; filling it over by step 2.1 fills it over .
Converse. Let have boundary lifting. Then it has horn lifting, and by the boundary-lifting criterion of [F3] it lifts every monomorphism, in particular the empty inclusions (a degreewise surjectivity statement) and (giving a section of ). Lifting the inclusion with endpoints and gives a homotopy , while ; the prism and free-additive homology argument of [F3] then shows that is a quasi-isomorphism. Combining with step 2.2, boundary lifting is exactly Kan plus a quasi-isomorphism on normalized complexes, and the criterion applies to simplicial modules and to unital or nonunital simplicial algebras through their underlying additive groups.
Depends on
Used by
Dependency tree · two levels
12 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
- Goerss-Schemmerhorn, Model Categories and Simplicial Methods (standard reference, not scraped)
- The Stacks Project, Chapter 14 (Simplicial Methods) (standard reference, not scraped)