GOLD STANDARD · TOPOLOGY · HOW X WORKS
Track a failed coherence condition through refinement—and separate a removable choice defect from an invariant obstruction
A residual around one refinement diamond may depend on chosen models and comparison maps. To call it an invariant obstruction, one must show how it changes when the indexing system is refined or the choices are replaced. Conjugacy can preserve the essential defect when coordinates change, while a coboundary-like correction can reveal that the original mismatch was only a choice artefact.
This guide connects the Gold Standard of Topology, Gold Standard of Education, and How X Works hub.
Chapter contents and reading routes
Choose the route closest to your present task. Every teaching chapter remains expanded, so the article also reads naturally from start to finish.
Define transport
Compute choice change
Test invariance
Transfer and qualify
Use FAQs, sources and connected routes
CHAPTER 1 OF 12 · DEFINE TRANSPORT
1. An obstruction is first a defect in a declared diagram
Let a finite refinement system have chosen objects Xi and comparison maps φij. Around a diamond from A through B or C to D, compare the two composites. If they are invertible on the relevant boundary, the residual can be written r=(φCDφAC)−1(φBDφAB).
This residual belongs to the chosen D-model and the stated category. Before calling it topological, record domains, protected subsets, hypotheses and the equivalence relation being tested.
CHAPTER 2 OF 12 · DEFINE TRANSPORT
2. Refinement adds comparisons; it does not erase the old defect automatically
A refined indexing family may replace one diamond with several smaller ones or introduce a common comparison object. The old residual must be related to the new residuals through explicit maps. Merely drawing a finer diagram does not prove coherence.
State whether transport is equality, conjugacy, homotopy, induced cohomology class or another named relation. The required strength follows the downstream theorem.
CHAPTER 3 OF 12 · CHANGE CHOICES
3. Represent a choice change by comparison maps
Suppose Xi is replaced by X′i with an isomorphism ui:Xi→X′i. A compatible transported arrow would be φ′ij=ujφijui−1. When every arrow changes this way, residuals at D transform by conjugation with uD.
| Situation | Comparison | What may be preserved | What is not proved |
|---|---|---|---|
| Strict relabelling | φ′=uφu⁻¹ | Identity versus nonidentity residual | Canonical choice |
| Relative isotopy | Maps related through fixed-set isotopy | Relative isotopy class | Literal equality |
| Cohomologous cocycles | Defects differ by a coboundary | Cohomology class | Chosen representative |
| Noninvertible witness | Span or common target | Mapped defect if functorial | Conjugacy formula |
| Changed hypotheses | No valid comparison | Nothing without a new theorem | Invariance |
If a choice-change map fails to preserve the protected subset, even a correct conjugacy on the ambient boundary may be irrelevant to the theorem.
CHAPTER 4 OF 12 · CHANGE CHOICES
4. Use a coboundary test when defects form cocycle data
In an abelian cochain model, changing local choices can add a coboundary to a cocycle. The representative changes while its cohomology class stays fixed. This is a model for the distinction between repairable bookkeeping and an invariant obstruction.
Do not import that conclusion into a nonabelian or merely set-valued system without construction. First identify the cochains, differential, cocycle condition and equivalence relation.
CHAPTER 5 OF 12 · WORK THE TRANSPORT
5. Work a two-choice diamond
For one chosen system, let the residual on D be r. Replace the four models by uA,uB,uC,uD and transport every arrow compatibly. Cancelling the intermediate u maps gives r′=uDruD−1.
| Observed result | Interpretation | Permitted conclusion |
|---|---|---|
| r=id | Original diamond strictly commutes | No defect for this choice |
| r≠id but r′ is conjugate to r | Coordinate change only | Nontriviality survives compatible relabelling |
| r changes to id after an allowed arrow correction | Choice defect may be removable | Need global compatibility check |
| Images agree under selected invariant | Invariant-level defect vanishes | Not full diagram coherence |
| No u map satisfies hypotheses | Transport unavailable | Do not compare obstruction labels |
After repairing one arrow, rerun every adjacent face. A local correction can move the defect rather than remove it globally.
CHAPTER 6 OF 12 · TEST INVARIANCE
6. Demand compatibility along refinement maps
Let a fine system map to a coarse one. Compute the fine residuals and apply the induced comparison to the coarse target. An invariant defect needs a commuting transport statement: the mapped fine defect equals the coarse defect in the declared quotient or relation.
If only some faces transport, bound the claim to them. A limit construction requires compatibility across the directed family, not a collection of unrelated residuals.
CHAPTER 7 OF 12 · TEST INVARIANCE
7. Separate vanishing, representative independence and completeness
Vanishing means the selected obstruction is trivial. Representative independence means allowed choices give the same class. Completeness means vanishing is sufficient for the desired coherent structure. These are three different theorems.
An invariant may detect a defect without detecting every defect. State necessity, sufficiency or both. This avoids turning a useful obstruction record into an unsupported classification.
CHAPTER 8 OF 12 · TRANSFER THE METHOD
8. Changed-context transfer: atlases, bundles and chain models
Changing coordinates in a bundle conjugates transition data; changing local cochain choices can alter cocycles by coboundaries; chain-level refinements may preserve only chain-homotopy classes. Each setting separates representative from invariant information.
Transfer the typed transport question—what maps the old defect to the new one?—but not a conjugacy or cohomology formula unless the required algebra exists.
CHAPTER 9 OF 12 · QUALIFY THE RESULT
9. Higher coherence can carry higher obstructions
Making every diamond commute up to a chosen homotopy may create a new compatibility problem among those homotopies. A 1-categorical residual calculation does not establish a homotopy-coherent system of all dimensions.
Specify the coherence level the proof consumes. If only an induced homology map must be route-independent, prove that narrower statement instead of claiming a canonical refinement system.
CHAPTER 10 OF 12 · QUALIFY THE RESULT
10. Limits and common misconceptions
A nonidentity residual may reflect arbitrary incompatible choices. Conjugate residuals need not be equal, and conjugacy is meaningful only for invertible maps in a common group-like setting. A refined diagram can reveal, split or relocate a defect.
Choice independence alone does not make an obstruction complete. Likewise, a vanishing invariant can coexist with a nontrivial defect invisible to that invariant. Preserve the exact relation and theorem scope.
CHAPTER 11 OF 12 · CHECK AND CONTINUE
11. Questions readers often ask
If two residuals are conjugate, are they the same obstruction?
They represent the same conjugacy-class information, including identity versus nonidentity, if conjugacy is the approved choice-change relation. They are not necessarily the same map, and another theorem may require more than conjugacy.
Can refinement make an obstruction vanish?
It can make a representative vanish, expose a repair or map a defect to zero. To claim the original obstruction was not invariant, show the allowed transport and why vanishing in the refined system reflects the same problem rather than loss of information.
CHAPTER 12 OF 12 · CHECK AND CONTINUE
12. Evidence, connected routes and the next check
Daverman and Gu’s hierarchy for closed n-cell-complements defines the Wn comparison setting and preserved attributes. Sewings of crumpled cubes revisited shows that mismatch properties differ in strength and require explicit hypotheses. Čech cocycles for differential characteristic classes provides a specialist example in which cocycle refinements and obstruction problems must be organised at the correct categorical level.
Continue through cocycle conditions, diamond coherence and obstruction records, finite refinement systems and limits of canonical choice, and common comparison targets and choice-change naturality. The next check is to write the exact map that transports one residual into the next system.