For a finite triangulable space, its Euler characteristic isIf is a finite triangulation and is its number of -simplices, then the Euler-Poincare formula isTo prove it over , write and . Rank-nullity and giveAfter multiplying by and summing, the two boundary sums cancel, leaving the claimed equality.
The simplices in a barycentric subdivision are strict chains of nonempty faces. A tetrahedron has nonempty faces, so . Counting strict two-face chains givesA strict three-face chain amounts to choosing a terminal face and partitioning its vertices into three nonempty ordered blocks. Hencewhere denotes a Stirling number of the second kind. ThereforeEquivalently, the full subdivision has tetrahedra and Euler characteristic one, so deleting its three-dimensional simplices from the alternating count gives . This is the f-vector computation for the barycentric subdivision of a tetrahedron.
The complex is connected, so . Adding the 24 three-simplices to produces the contractible complex . Adding three-simplices does not alter , henceAlso for because is two-dimensional.
The group is a subgroup of the free group and is therefore free abelian. If its rank is , the Euler characteristic from part (i) givesso . Consequently
Yes. Let be the vertex of corresponding to the whole tetrahedron. Its link in is the 1-skeleton of the barycentric subdivision of . This connected graph has one vertex for each of the 14 nonempty proper faces and 36 edges, so
No other point has this local homology rank. At the other vertices, corresponding respectively to faces of size , the first Betti numbers of the links are . A point in the interior of an edge is incident with at most six triangles, so its local has rank at most five; a point in a triangle interior has local .
A homeomorphism preserves local homology, so it must send the unique point with local of rank to itself. Therefore every self-homeomorphism fixes , which is the fixed barycentre of the barycentric tetrahedral two-skeleton.
Articles by others on the same topic
There are currently no matching articles.