Find your next learning step
A truncated simplicial object contains data only through degree n. Its coskeleton extends that partial object by filling each higher degree with every boundary-compatible configuration forced by the known data. The matching object in degree n+1 is the object of compatible faces. A hypercover asks the actual (n+1)-simplices to cover that matching object. Truncated hyperdescent is useful only after the coefficient object’s truncation and the relevant descent theorem are made explicit.
Open the chapter contents · Topology root · Gold Standard of Education · How X Works
Chapter contents
Choose the route closest to the decision, or read from Chapter 1. The chapters remain open; these grouped routes are a navigable index.
Route 1 · Define the decision
Route 2 · Work the ledgers
Route 3 · Transfer the method
Route 4 · Check limits and evidence
Route 5 · Ask and continue
CHAPTER 1 OF 12 · DEFINE THE DECISION
1. Separate skeleton, truncation and coskeleton
The n-skeleton keeps the simplices generated by information through degree n. An n-truncation simply records degrees up to n with the available face and degeneracy maps. The n-coskeleton is the right Kan extension that reconstructs higher degrees by compatible maps from truncated standard simplices.
Skeleton adds no new nondegenerate information above n; coskeleton imposes all higher simplices determined by lower boundaries. They are adjoint constructions, not inverse operations on every simplicial object.
CHAPTER 2 OF 12 · DEFINE THE DECISION
2. Read a matching object as a boundary object
The matching object M_{n+1} collects all (n+1)-simplex faces that agree on their shared lower faces. The canonical map X_{n+1}→M_{n+1} sends an actual simplex to its boundary data.
Surjectivity, covering or equivalence of this map has different meanings in sets, sites, model categories and higher categories. State the ambient category and its notion of cover before saying that every compatible boundary can be filled.
CHAPTER 3 OF 12 · WORK THE LEDGERS
3. Work a low-degree matching ledger
Low degrees expose the pattern. Degree zero supplies objects, degree one supplies arrows or overlaps, and degree two tests compatibility among three edges. Degeneracies insert identities and repeated pieces.
| Stage | Known data | Matching object asks for | A filler supplies |
|---|---|---|---|
| 0→1 | Vertices X₀ | Compatible source and target | An edge in X₁ |
| 1→2 | Vertices and edges | Three edges with matching endpoints | A triangle in X₂ |
| 2→3 | Faces through degree 2 | Four compatible triangles | A tetrahedral 3-simplex |
| n→n+1 | Degrees ≤n | Compatible n-dimensional faces | An (n+1)-simplex |
CHAPTER 4 OF 12 · WORK THE LEDGERS
4. See coskeleton as forced completion
For a truncated object X_{≤n}, the degree m part of cosk_n X is built from maps sk_n Δ[m]→X_{≤n}. Each such map labels every visible face consistently. No extra higher homotopy choice is inserted beyond what lower data forces.
If an original simplicial object X satisfies X≅cosk_n sk_n X, it is n-coskeletal: every higher simplex is uniquely determined by its n-skeleton data. Many objects are not n-coskeletal, so replacement by a coskeleton can discard genuine higher choices.
CHAPTER 5 OF 12 · WORK THE LEDGERS
5. Change the coefficient truncation and shorten the test
A coefficient object truncated above degree n cannot detect arbitrarily high homotopy information in the same way as an untruncated object. Under the appropriate hypotheses, hyperdescent can then be checked using a bounded stage or an n-hypercover construction.
| Coefficient or object | Potential finite control | What still needs proof | Failure risk |
|---|---|---|---|
| Set-valued sheaf | Low categorical degrees | Ordinary sheaf descent | Confusing covers with hypercovers |
| Groupoid / 1-truncated object | Objects, arrows and coherence | Effective descent theorem | Ignoring 2-cocycle data |
| n-truncated object | Finite matching stages | Precise truncation bound | Off-by-one conventions |
| Unbounded complex or spectrum | Usually no fixed finite stage | Convergence and completeness | Premature truncation |
CHAPTER 6 OF 12 · TRANSFER THE METHOD
6. Build a hypercover degree by degree
Start with X₀ covering the target. At the next stage, choose X₁ covering the matching object determined by pairs over the target. Continue by covering the next matching object rather than arbitrarily adding simplices.
A Čech nerve is the special case where the relevant matching maps are isomorphisms after the initial cover. General hypercovers allow new covering data at higher stages, which is why they can resolve obstructions invisible to one ordinary cover.
CHAPTER 7 OF 12 · TRANSFER THE METHOD
7. Connect the established descent routes
The hypercovers guide introduces refinements and degree-by-degree descent. The descent spectral-sequence guide shows how simplicial and cohomological degrees assemble.
Use the Čech and Leray guide for ordinary cover computations and the Mayer–Vietoris spectral-sequence guide for differential and convergence bookkeeping.
CHAPTER 8 OF 12 · TRANSFER THE METHOD
8. Track limits, covers and uniqueness separately
Matching objects are limits, so their existence needs the relevant finite limits. A hypercover condition usually asks X_{n+1}→M_{n+1} to be a cover, not an isomorphism. A coskeletal condition asks for the stronger reconstruction map to be an isomorphism or equivalence.
These distinctions separate existence of local fillers, global uniqueness of fillers and higher coherent choices. Collapsing them turns a flexible descent resolution into an incorrectly rigid object.
CHAPTER 9 OF 12 · CHECK LIMITS AND EVIDENCE
9. Know the limits and common misconceptions
Coskeleton is not a free construction; as a right adjoint it is a compatibility completion. Matching objects do not themselves prove that fillers exist. An n-truncated coefficient object is not the same as an n-truncated hypercover.
Off-by-one conventions vary: some statements index the matching map at n and others at n+1. Reconstruct the first three degrees explicitly before transferring a formula.
CHAPTER 10 OF 12 · CHECK LIMITS AND EVIDENCE
10. Use a proof and source routine
Record the simplex category, ambient category, finite limits, truncation functor, skeleton and coskeleton convention, matching object formula, augmentation, cover notion, degree of each matching map, coefficient truncation, descent theorem, convergence or totalisation and comparison with a Čech nerve.
The Stacks Project section on hypercoverings defines the maps K_{n+1}→(cosk_n sk_n K)_{n+1} and identifies Čech hypercovers. Its Verdier hypercovering section explains how coskeleta support cohomological descent calculations.
CHAPTER 11 OF 12 · ASK AND CONTINUE
11. Frequently asked questions
What does the matching object contain?
It contains compatible collections of faces—the boundary data that an actual simplex would have to realise.
Is every hypercover a Čech nerve?
No. A Čech nerve is a special hypercover; a general hypercover may introduce new covers at higher matching stages.
When may descent checks stop after finitely many degrees?
When a precise truncation or hypercompleteness theorem gives that bound for the coefficient object and site.
CHAPTER 12 OF 12 · ASK AND CONTINUE
12. Continue with a boundary transfer check
Draw three vertices and three compatible edges, form the degree-two matching datum and identify what a triangle filler adds. Then delete one edge and explain why the remaining data is not an element of the same matching object. Repeat one degree higher using four triangular faces.
Continue through the Topology root, the Gold Standard of Education and the How X Works hub.
Top · Contents · Previous · How X Works