Find your next learning step
Finite truncations record homotopy groups only up to a chosen degree. A Postnikov tower assembles all those finite views. Hypercompletion forces maps that are invisible to every truncation to become equivalences. Left completeness asks whether an object can be recovered as the limit of its truncation tower. These ideas meet often, but they are not interchangeable without hypotheses.
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. Build the Postnikov tower one truncation at a time
For an object X in an ∞-topos or suitable presentable ∞-category, τ≤nX forgets homotopy information above degree n. The maps …→τ≤2X→τ≤1X→τ≤0X form its Postnikov tower.
Each stage preserves the lower homotopy sheaves and discards higher ones. The tower is an approximation system, not yet a convergence theorem. Recovering X requires comparing it with the inverse limit of all stages.
CHAPTER 2 OF 12 · DEFINE THE DECISION
2. Define left completeness by the comparison map
A t-structured stable category is left complete when the natural map X→limₙτ≤nX is an equivalence for every X, with indexing conventions adjusted to the chosen t-structure. In an ∞-topos one similarly asks whether Postnikov towers converge.
Completeness is therefore about an infinite limit. Agreement at every finite stage does not by itself identify the original object if the ambient category admits nontrivial infinitely connective phenomena.
CHAPTER 3 OF 12 · WORK THE LEDGERS
3. Work a truncation ledger
Consider an object whose first nonzero homotopy sheaves occur in degrees 1, 3 and 6. The ledger records which stages can see each layer.
| Stage | Visible homotopy layers | Still hidden | Map to next stage |
|---|---|---|---|
| τ≤0X | π₀ only | π₁, π₃, π₆ | Adds degree 1 next |
| τ≤1X | π₀, π₁ | π₃, π₆ | No new layer at 2 |
| τ≤3X | π₀ through π₃ | π₆ | Adds degree 3 layer |
| τ≤6X | π₀ through π₆ | Higher layers | Matches listed data |
CHAPTER 4 OF 12 · WORK THE LEDGERS
4. See what hypercompletion changes
A map is ∞-connective when every finite truncation sees it as an equivalence. Hypercomplete objects are local with respect to such maps, and hypercompletion is the left-exact localisation that inverts them.
This enforces a higher Whitehead principle: no difference invisible to all homotopy sheaves remains detectable by a hypercomplete object. The ordinary ∞-topos can contain non-hypercomplete objects on sufficiently complicated sites.
CHAPTER 5 OF 12 · WORK THE LEDGERS
5. Change the ambient category and test convergence
In ordinary spaces, Postnikov towers converge. In a general ∞-topos, hypercompleteness and Postnikov completeness are closely related but need careful formulation. In a stable derived setting, left completeness depends on the t-structure and exactness of countable limits.
| Setting | Finite truncations available | Automatic recovery? | Question to prove |
|---|---|---|---|
| Spaces | Yes | Yes in the usual setting | Standard Postnikov convergence |
| General ∞-topos | Yes | Not always | Hypercompleteness / convergence |
| Hypercomplete ∞-topos | Yes | Often under stated theorem | Postnikov completeness |
| Stable t-category | Yes | Not always | Left completeness of t-structure |
CHAPTER 6 OF 12 · TRANSFER THE METHOD
6. Keep k-invariants and limits in view
Homotopy sheaves alone do not determine how layers are glued. Postnikov k-invariants and transition maps encode that extension data. A list of πₙ values is therefore weaker than the entire tower.
Even a compatible tower may not be the tower of its inverse limit unless the ambient reconstruction theorem applies. Limit-preservation, derived inverse-limit effects and accessibility hypotheses can all matter.
CHAPTER 7 OF 12 · TRANSFER THE METHOD
7. Connect the established descent routes
The hypercovers guide explains why higher covers detect more than a Čech nerve. The coskeleta guide shows how bounded matching data controls truncated coefficients.
Use the descent spectral-sequence guide for totalisation and convergence bookkeeping and the Čech and Leray guide for ordinary-cover comparisons.
CHAPTER 8 OF 12 · TRANSFER THE METHOD
8. Use hyperdescent as an operational test
An object satisfying descent for every hypercover is hypercomplete. For truncated objects, hyperdescent can often reduce to finitely bounded matching information; for unbounded objects, the infinite totalisation and its convergence cannot be ignored.
This is why finite-stage agreement may be enough for an n-truncated coefficient but insufficient for a spectrum or unbounded complex. State the truncation bound before shortening the descent check.
CHAPTER 9 OF 12 · CHECK LIMITS AND EVIDENCE
9. Know the limits and common misconceptions
Hypercomplete does not mean contractible, and hypercompletion does not simply “add missing homotopy groups.” It localises away distinctions invisible to all finite homotopy sheaves.
Postnikov completeness, hypercompleteness and left completeness are related properties in different frameworks. A theorem in one setting cannot be imported by vocabulary alone, and indexing directions for t-structures can reverse.
CHAPTER 10 OF 12 · CHECK LIMITS AND EVIDENCE
10. Use a proof and source routine
Record ambient ∞-category, site or topos, truncation convention, t-structure, tower transition maps, k-invariants, comparison map to the inverse limit, exactness of limits, hypercover descent condition, localisation class and the theorem connecting these ingredients.
Lurie’s Higher Topos Theory develops truncations, hypercovers and Postnikov towers in ∞-topoi. Mondal and Reinecke prove Postnikov completeness for hypercomplete ∞-topoi associated with replete topoi, illustrating that the convergence conclusion is a theorem with hypotheses.
CHAPTER 11 OF 12 · ASK AND CONTINUE
11. Frequently asked questions
If all homotopy sheaves vanish, is the object terminal?
That conclusion is valid in a hypercomplete setting; without hypercompleteness, infinitely connective differences may remain.
Does the list of homotopy sheaves determine X?
Not alone. The Postnikov transition maps and k-invariants encode how the layers are attached.
Is every t-structure left complete?
No. Recovery from truncations is an additional property that must be proved.
CHAPTER 12 OF 12 · ASK AND CONTINUE
12. Continue with a tower transfer check
Using the ledger, add a nonzero π₉ layer and mark the first stage that can detect it. Then compare two objects with the same listed homotopy sheaves but different k-invariants. Explain why a group-by-group checklist cannot certify equivalence, and identify the comparison map a completeness proof must study.
Continue through the Topology root, the Gold Standard of Education and the How X Works hub.
Top · Contents · Previous · How X Works