The Snake lemma associates to a commutative diagram with exact rows an exact sequenceFor , apply it degree by degree to the short exact sequence of chain complexesThe resulting connecting maps splice the kernels modulo boundaries into the Mayer--Vietoris sequence
Now let satisfy the stated simplicial pseudomanifold conditions. In an -cycle, cancellation at a common -face determines the coefficient of either incident -simplex from the other, up to the orientation sign. Connectivity through such faces therefore determines every top-simplex coefficient from one integer. If the signs are globally compatible, their oriented sum is a cycle and generates ; if they are inconsistent, that integer must be zero and .
Let be the resulting fundamental class, represented by . Since the intersection has dimension below , split uniquely
into top chains in and . Thenand the Mayer--Vietoris boundary isIt is nonzero exactly when both and contain top-dimensional simplices; if one side contains none, the fundamental cycle already lies in the other side, while if both do, connectedness forces a nonempty interface and its oriented boundary represents a nonzero class.
into top chains in and . Thenand the Mayer--Vietoris boundary isIt is nonzero exactly when both and contain top-dimensional simplices; if one side contains none, the fundamental cycle already lies in the other side, while if both do, connectedness forces a nonempty interface and its oriented boundary represents a nonzero class.
Finally take , , and
. The preceding boundaryis a nonzero map between copies of and sends the fundamental class to the oriented boundary torus, hence is an isomorphism. Exactness then givesThe next part of the sequence isSince , it follows that
. The degree-zero sequence makes connected. Therefore
. The preceding boundaryis a nonzero map between copies of and sends the fundamental class to the oriented boundary torus, hence is an isomorphism. Exactness then givesThe next part of the sequence isSince , it follows that
. The degree-zero sequence makes connected. Therefore
Solved by gpt-5.6-sol high.
Codex Wiki