Want to take part in these discussions? Sign in if you have an account, or apply for one below
Vanilla 1.1.10 is a product of Lussumo. More Information: Documentation, Community Support.
Theorem:
Let be a complex with combinatorial components. Then is isomorphic to the direct sum of (not but) copies of the group of integers.
Proof for one component:
As 0-cycles are synonymous with 0-chains, they have many dimensions-of-freedom for sure. How many the 0-boundaries of our component have? Since the incidence matrix is a by matrix (see my previous posting with ‘homology’ tag), they have at least many for sure. And 1 more for the rank deficiency! The proof follows from this arithmetic.
1 to 1 of 1