Define the arc complex as follows. Its vertices are isotopy classes, relative to the punctures, of unoriented essential simple proper arcs. A set of vertices spans a -dimensional simplex when the classes have representatives with pairwise disjoint interiors. Every orientation-preserving homeomorphism sends such representatives to such representatives, and isotopic homeomorphisms induce the same permutation of classes. Hence
by simplicial automorphisms.
The Snake lemma associates to a commutative diagram with exact rows an exact sequence
For , apply it degree by degree to the short exact sequence of chain complexes
The 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 . Then
and the Mayer--Vietoris boundary is
It 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 boundary
is a nonzero map between copies of and sends the fundamental class to the oriented boundary torus, hence is an isomorphism. Exactness then gives
The next part of the sequence is
Since , it follows that
. The degree-zero sequence makes connected. Therefore
The strictly positive case states that a real square matrix with has a positive simple eigenvalue and positive left and right eigenvectors, with all other eigenvalues strictly smaller in modulus. The Brouwer fixed-point theorem applied to on the nonnegative unit simplex gives and . For another eigenvector , maximize ; the triangle inequality gives . Equality forces every modulus ratio and complex argument to agree because every entry is positive, so is proportional to and . Apply the same argument to for a positive left eigenvector; its positive pairing with rules out a generalized eigenvector at , establishing algebraic simplicity. For merely nonnegative matrices a nonnegative leading eigenvector exists. An irreducible nonnegative matrix has a positive leading eigenvector and simple Perron eigenvalue; a primitive nonnegative matrix has the strict modulus gap.
Tetrahedron 2026-09-29
A tetrahedron is the three-dimensional simplex, with four vertices, six edges, and four triangular faces.