Graph centered on Chain map, showing the selected concept and its surrounding relations.Preparing the interactive atlas…

Keyboard graph navigation: press N for concepts or E for relations; use arrow keys, Home, and End to move; Enter selects; Shift plus Enter selects and centers; plus and minus zoom; zero fits; Escape clears the selection. Use the visible viewport buttons as alternatives to dragging, wheel, and pinch gestures.

Curated starting points

Stories & Views

Relationship-aware analysis

Compare concepts

Choose two concepts to compare or connect.
Reading the graph

Guide to the Atlas

Canonical static concept record

Chain map

Open this concept in the interactive graphRead the Markdown equivalent

Summary

A degree-preserving morphism between chain complexes that commutes with the differentials.

Record metadata

Carrier(s)

Data

Axioms / constraints

Canonically induces

Notes

The analogous definition for cochain complexes uses the same commuting-square condition with cohomological grading.

Concept sources

Incoming relations (arrows to this concept)

Each relation below ends at this concept.

two chain complexes + degreewise morphisms(construction junction)Chain map

Permalink to relation

This is an authored directed relation from the source endpoint to the target endpoint.

Authored explanation

Require the degreewise maps to satisfy the chain-map squares dDf=fdCd_Df=fd_C.

How to interpret this relation type

Feed several structures into a construction junction and impose compatibility between them.

Relation sources

Outgoing relations (arrows from this concept)

Each relation below starts at this concept.

Chain mapMapping cone

Permalink to relation

This is an authored directed relation from the source endpoint to the target endpoint.

Authored explanation

For a chain map f:CDf:C\to D, the mapping cone combines DnD_n with Cn1C_{n-1} and uses a differential incorporating both the original differentials and ff.

How to interpret this relation type

Apply a standard functorial or canonical construction whose output is not merely a reduct of the input and is not generally an equivalent presentation of the same object.

Relation sources

Chain mapQuasi-isomorphism

Permalink to relation

This is an authored directed relation from the source endpoint to the target endpoint.

Authored explanation

Require the induced morphism on every homology object to be an isomorphism.

How to interpret this relation type

Keep the existing data and select the subclass satisfying an additional law, existence condition, finiteness condition, or other property.

Relation sources