## Relation between combinatorial manifolds and PL manifolds

### Remember to vote up questions/answers you find interesting or helpful (requires 15 reputation points)

In

W. W. Boone, W. Haken, and V. Poenaru, On Recursively Unsolvable Problems in Topology and Their Classification, Contributions to Mathematical Logic (H. Arnold Schmidt, K. Schütte, and H. J. Thiele, eds.), North-Holland, Amsterdam, 1968.

a combinatorial manifold is defined as a simplicial complex with the property that the star of every vertex is combinatorially equivalent to the standard $n$-simplex. (two simplicial complexes are combinatorially equivalent if they possess linear subdivisions, the associated abstract simplicial complexes of which are isomorphic) This is equivalent to the condition that the link of every vertex be a combinatorial $(n-1)$-sphere (=boundary of the standard $n$-simplex) if the underlying manifold has no boudnary.

However, in

A. Ranicki (ed.), The Hauptvermutung Book, K-Monographs in Mathematics, vol. 1, Kluwer Academic Publishers, Dordrecht, Boston, London, 2010.

on page 4, this condition is used to define the term

combinatorial manifold (or PL manifold)''.

I find this very weird; a PL manifold should be defined as a topological manifold with a maximal atlas of homeomorphisms with PL coordinate changes (and I know a lot of authors who use this definition).
The obvious question now is: Is a simplicial complex, the vertices of which have $S^{n-1}$ as link, the same as a topological manifold with a maximal atlas of homeomorphisms piecewise linear coordinate changes? Of course, Ranickis nomenclature implies that it does.

Obviously, the condition on the links can be used to construct such an atlas. However, the converse puzzles me, as it seems to be equivalent to the question if every manifold with a maximal PL atlas admits a triangulation.

If anyone could point me to an article where this problem is addressed, I would be thrilled.

Best regards, Malte

-

3
Perhaps I'm missing something but this seems clear to me. take a locally finite PL atlas and triangulate each chart linearly on some compact polyhedral domains that still cover M. Since the transition maps are PL and the cover is locally finite you can subdivide the triangulations to make the transition maps linear on simplexes. The resulting triangulation will obviously have spheres as links of vertices. – Vitali Kapovitch Jan 13 2012 at 18:54
This looks like a fine idea. I was wondering for a moment why this wouldn't work with an arbitrary atlas, but this is required as the intersection of two simplices $f_0: \Delta_0 \rightarrow M$ and $f_1: \Delta_1 \rightarrow M$ might otherwise be ``non-linear'' (I guess this is what you mean by ``make the transition maps linear''). Anyway, you're a very sweet man, thanks a lot! – Malte Jan 14 2012 at 20:01

## 2 Answers

It is claimed here that "A PL manifold is easily shown to be PL homeomorphic to a simplicial complex that is a so-called combinatorial manifold [37]", [37] being Hudson's Piecewise Linear Topology. I think the whole thing is worked out in Chapter 3 of that book.

-

### You can accept an answer to one of your own questions by clicking the check mark next to it. This awards 15 reputation points to the person who answered and 2 reputation points to you.

Take a look at MR0271956 (42 #6837) Siebenmann, L. C. Are nontriangulable manifolds triangulable? 1970 Topology of Manifolds (Proc. Inst., Univ. of Georgia, Athens, Ga., 1969) pp. 77–84 Markham, Chicago, Ill.57.01

-

1
Thank you for pointing out this article, I didn't know about it. However, it doesn't seem to answer the question. – Malte Jan 14 2012 at 20:01
I agree. It only reinforces it. I thought it might have some relevant information, but I am not surprised that it does not. In the meanwhile, Vitali's response has me fairly convinced that the two definitions are equivalent, but I have not thought it through. – Matt Brin Jan 15 2012 at 5:25
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 6, "mathjax_display_tex": 0, "mathjax_asciimath": 1, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "github"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "english_confidence": 0.9213438034057617, "perplexity_flag": "middle"}