Binary-cover chains form a short exact sequence: local context

Project map · Chapter map · Full theorem DAG · Open textbook statement

This local map shows one dependency hop in either direction. The highlighted item is the current focus. What the colours mean

fully proved4Proved, and every prerequisite is fully proved too.

graph LR n0["The binary-cover Mayer–Vietoris chain complex"]:::fully_proved n1("Binary-cover chains form a short exact sequence"):::fully_proved n2("The binary-cover Mayer–Vietoris sequence"):::fully_proved n3("Augmented binary-cover chains form a short exact sequence"):::fully_proved n0 --> n3 n0 --> n1 n1 -.-> n3 n1 --> n2 click n0 "../../../../../roadmap/homology/computations-and-applications/mayer-vietoris/index.html#binary-cover-chain-complex" "The binary-cover Mayer–Vietoris chain complex — 1 item · 1 fully proved" class n1 focus click n1 "../../../../../roadmap/homology/computations-and-applications/mayer-vietoris/index.html#binary-cover-chain-short-exact-sequence" "Binary-cover chains form a short exact sequence — 1 item · 1 fully proved" click n2 "../../../../../roadmap/homology/computations-and-applications/mayer-vietoris/index.html#binary-cover-mayer-vietoris-sequence" "The binary-cover Mayer–Vietoris sequence — 1 item · 1 fully proved" click n3 "../../../../../roadmap/homology/computations-and-applications/mayer-vietoris/index.html#augmented-binary-cover-chain-short-exact-sequence" "Augmented binary-cover chains form a short exact sequence — 1 item · 1 fully proved"