For a connected finite CW complex , choose a point in each open cell . An Euler chain is a singular chain of degree one with
It exists exactly when the Euler characteristic of is zero. Necessity follows because the total coefficient sum of every one-chain boundary is zero, whereas the displayed zero-chain has coefficient sum .
For sufficiency, choose a base point and paths from to . Then has boundary equal to the required sum minus , so it works when . Connected CW complexes are path connected, which justifies choosing these paths.
With the cell points fixed, two Euler chains differ by a cycle and define the same Euler structure when that cycle is a boundary. Adding homology classes makes Euler structures a torsor for . This extra choice removes an ambiguity in Turaev torsion.[ref]

Articles by others on the same topic (0)

There are currently no matching articles.