Embedding products of graphs into Euclidean spaces
For any collection of graphs , we find the minimal dimension such that the product is embeddable into . In particular, we prove that and are not embeddable into , where and are the Kuratowski graphs. This is a solution to a problem by Menger from 1929. The idea of the proof is a reduction to a problem from so-called Ramsey link theory: we show that any embedding , where is the join of copies of a -point set, has a pair of linked -dimensional spheres.
:
57Q35, 57Q45Introduction. Our main result is a solution to the Menger problem from his paper [Men29]:
Hereafter we denote by a complete graph on vertices and by a complete bipartite graph with vertices in each part. We write if a compact polyhedron is piecewise linearly embeddable into a polyhedron , i.e., there is an injective piecewise linear map . Space is viewed as a non-compact polyhedron. We get the same result on topological non-embeddability.
Menger posed this problem explicitly for but the title of his paper [Men29] suggests that he was interested in arbitrary as well. We also solve a more general problem posed by Dranishnikov [Gal92]: given a collection of graphs , find the minimal dimension such that .
The topological problem of embeddability is an important one (e. g., see [Sch84, ReSk99, ARS01, Sko07]). Our special case of the problem is interesting because the complete answer can be obtained and is stated easily, but the proof is nontrivial and contains interesting ideas. For applications of the result, see the works by Gromov [Gr10] and Lindenstrauss–Tsukamoto [LT14].
Theorem~1
Let be finite connected graphs, not homemorphic to a point, a closed interval , and a circle . The minimal dimension such that
equals
The Menger conjecture is the particular case of the theorem when or .
Hereafter a -dimensional sphere is any polyhedron that is piecewise linearly homeomorphic to the boundary of a -dimensional simplex (a slight deviation from the common notation), and .
Theorem 1 remains true in topological category, i.e., with replaced by . We write if is compact and there is an injective continuous map . We first prove Theorem 1 in piecewise linear category and then deduce the topological version from the piecewise linear one. From now and till that moment we work in the piecewise linear category. See [RS82] for an introduction to the latter.
Theorem 1 was stated (without proof) in [Gal93], cf. [Gal92]. The proof of embeddability is trivial (see below). The non-embeddability has been proved earlier in some particular cases. For example, it was known that , where is a triod (a graph homeomorphic to the letter ”Y”). A nice proof of this folklore result is presented in [Sko07], cf. [ReSk01]. Also it was known that (Tom Tucker, private communication). In [Um78] Ummel proved that and , thus solving the problem explicitly posed by Menger in [Men29]. That proof contained about 10 pages of calculations involving spectral sequences. We obtain a shorter geometric proof of this result (see Example 2 and Lemma 2 below). The proof of the non-embeddability in case (2), namely, Lemma 2, is the main point of Theorem 1 (while case (1) is reduced easily to a result of van Kampen.)
Our proof of Theorem 1 is quite elementary, in particular, we do not use any abstract algebraic topology. A popular-science introduction to the method is given in [Sko24]. We use a reduction to a problem from so-called Ramsey link theory [S81, CG83, SeSp92, RST93, RST95, LS98, Neg98, SSS98, T00, ShTa]. The classical Conway–Gordon–Sachs theorem of Ramsey link theory asserts that any embedding of into has a pair of (homologically) linked cycles. In other words, is not linklessly embeddable into . The graph has the same property (the Sachs theorem, proved in [S81]). Denote by the -skeleton of an -simplex. For a polyhedron , let be the join of copies of . In our proof of Theorem 1, we use the following higher dimensional generalization of the Sachs theorem.
Lemma 1
Any embedding has a pair of (homologically) linked -dimensional spheres.
Lemma 1 follows from Lemma below. Higher dimensional generalizations of the Conway–Gordon–Sachs theorem are known in arbitrary codimension [SeSp92, SSS98, T00]. An open question: is there an -dimensional polyhedron such that any its embedding into contains a knotted -dimensional sphere, for ?
The easy part of Theorem 1 and some heuristic considerations. First, let us prove all the assertions of Theorem 1 except for the nonembeddability in case (2).
Demonstration Proof of the embeddability in Theorem 1
We need the following two simple results:
(*) If a compact polyhedron and , then , (it is sufficient to prove this for , for which this is trivial).
(**) For any compact -dimensional polyhedron , the cylinder [RSS95].
Denote . By general position, . If , then by (**) . If, say, is planar, that is, , then by (**) and (*) we get , whence . Applying (*) repeatedly, we get the embeddability assertion in all cases considered. ∎
Demonstration Proof of the non-embeddability in Theorem 1 in case (1)
Note that any connected graph, not homemorphic to a point, , and , contains a triod . So it suffices to prove that . Since and for any polyhedra and , it follows that
If a polyhedron then the cone (because we work in piecewise linear category). So the non-embeddability in case (1) follows from , which is proved in [Kam32] (or alternatively from , which is proved in [Sko07]). ∎
We are thus left with the proof of the non-embeddability in case (2). To make it clearer, we anticipate it with considering heuristically three simplest cases. Even a more visual way to express the main idea is given in [Sko24], where the so-called linear non-embeddability in the three examples is proved.
Example 1. Let us first prove that the Kuratowski graph not planar. Suppose to the contrary that . Let be a vertex of and a small disc with the center . Then the intersection consists of 4 points. Denote them by , , , , in the order along the circle . Note that the pairs and are the endpoints of two disjoint arcs contained in , and, consequently, in . Then the cycles intersect each other “transversely” at the single point , which is impossible in the plane. So .
Example 2. Now let us outline why . (Another proof is given in [Um78].) Recall that if is a polyhedron with a fixed cell decomposition and is a vertex, then the star is the union of all closed cells of containing , and the link is the union of all cells of not containing . In our previous example, consists of 4 points and the proof is based on the fact that there are two pairs of points of linked in .
Now take . Suppose to the contrary that . Let be a vertex of and be a small disc with the center . Without loss of generality, the intersection . So by the Sachs theorem from the introduction, any embedding has a pair of linked cycles . Two linked cycles in cannot bound two disjoint non-self-intersecting surfaces in . If we construct two such surfaces in , then we get a contradiction, and thus prove that . This construction is simple; see the proof of Lemma 2 below for details.
Analogously it can be shown that (another proof is given in [Kam32].)
Example 3. Let us show that . (Another proof was given by Tom Tucker; the simplest proof is analogous to Example 2 but we wish to illustrate another idea now.) Suppose that ; then by (*) we have . But , so , which contradicts Example 2.
Proof of the non-embeddability in case (2) modulo a lemma. Let and be two polyhedra, and a cell decomposition of is fixed. We say that a map is an almost embedding [FKT94], if:
- for any two disjoint closed cells of the fixed decomposition we have ; and
- is piecewise linear on some subdivision of the fixed decomposition of .
A nontrivial example of an almost embedding is shown in Fig. 1. The following lemma is a “half” of the Menger conjecture up to replacement of “almost embeddability” by “embeddability”. Hereafter the fixed cell decomposition is obvious and is not described explicitly.
Lemma~2
(For , see [Um78]) The polyhedron is not almost embeddable into .
Demonstration Proof of the non-embeddability in case of Theorem 1 modulo Lemma 2
First we reduce the theorem to the particular case analogously to Example 3. Indeed, assume that and Theorem 1 does not hold in case (2) for a product , i.e., . Then by assertion (*) from the proof of the embeddability in Theorem 1 it follows that
The composition of the two embeddings is an embedding of a product containing no factors homeomorphic to . The existence of the latter embedding contradicts to the case of Theorem 1 because the theorem gives the dimension for the product . The obtained contradiction reduces the theorem to the particular case , which is considered now.
By the Kuratowsky graph planarity criterion any nonplanar graph contains a subgraph homeomorhic to or . So we may assume that each is either or . Now we are going to replace all the graphs by -s.
Note that is almost embeddable to (Fig. 1). Indeed, map a vertex of into the midpoint of an edge of and map the remaining four vertices bijectively onto the four vertices of not belonging to this edge. Then map each edge of onto the shortest (with respect to the number of vertices) arc in , joining the images of the endpoints of , and the almost embedding is constructed.
A product of almost embeddings is again an almost embedding, thus we get an almost embedding . Assume that there is an embedding . The composition of the almost embedding and the embedding is an almost embedding , which contradicts to Lemma 2. Thus the non-embeddability in case (2) of Theorem 1 follows from Lemma 2. ∎
Fig. 1.
A few standard auxiliary facts. For the proof of Lemma 2, we need the following notions. Let be a compact -dimensional polyhedron. Its boundary modulo , denoted , is the union of all -dimensional simplices contained in an odd number of -dimensional ones, for some triangulation. Let , be a pair of piecewise-linear maps such that and . We say that the intersection index is even (respectively, odd) and put (respectively, ), if the number of points in the set is even (respectively, odd), for a general position pair of piecewise-linear maps and close to the pair of maps and .
Let us explain the precise meaning of general position here. Take triangulations of and such that the maps , are linear, i.e., linear on each simplex of the triangulations. Identify a pair of linear maps , with a point , where is the total number of vertices in the triangulations of and . We say that is -close to if and for any vertices and . We say that a property holds for a general position pair of piecewise-linear maps close to , if there is such that for each pair of triangulations of and such that and are linear, the property holds for almost all that are -close to .
We are going to use the following simple well-known result.
Parity Lemma 3
If and are compact polyhedra of dimension with , then for any piecewise-linear maps and the intersection index is even.
The lemma just means vanishing of the intersection form in the homology of modulo 2. But it is simpler to prove it directly. See also §4.5 in [Sko24] and Remark 4.7.3c in [Sko23].
Demonstration Proof of Lemma 3
Take triangulations of and and identify pairs of linear maps , with points in . For a pair of simplices , and almost all , the set has at most one point, if , and is empty, if . Indeed, otherwise and lie in one hyperplane in , which is only possible for on certain algebraic hypersurface in . Analogously, for almost all , the set is in bijection with the set of pairs of simplices such that . In what follows we often omit the phrase “for almost all ”.
It remains to prove that has an even number of elements. Extend linearly to the cone so that the cone vertex is mapped to the origin of . The extension is still denoted by . Analogously to the above, for each pair of simplices , , the set , if nonempty, is a single straight line segment when , and a single point when ; it is empty when . Construct the following graph. The set of vertices is the set of pairs of simplices such that and . Two distinct vertices and are joined by an edge, if there are top-dimensional simplices and such that and . In this case, is the segment joining and ; in particular, the latter points are distinct (otherwise, either is non-injective and , or is non-injective, or ). There is no other vertex with because the segment has just two endpoints. Thus the set of edges is in a bijection with the set of pairs of top-dimensional simplices and such that . Hence the degree of a vertex is odd if and only if , i.e., (because and ). Thus has an even number of elements. ∎
We need a well-known formula for the change of the intersection index upon a homotopy (Lemma below). Let be the number of elements in a set . For a map , denote . Let , be piecewise-linear maps such that , (or ), and for each . We say that the intersection index of homotopies is even (respectively, odd) and put (respectively, ), if the number is even (respectively, odd), for a general position pair of piecewise-linear maps and close to and . (This number equals the number of common points of the images of the maps and in .)
Lemma $3'$
Let and be compact polyhedra of dimension . Let and be piecewise-linear maps such that for each . Then for a general position pair of piecewise-linear maps close to , we have
Moreover, the intersection index is well-defined, i.e., is always either even or odd, and therefore,
Demonstration Proof of Lemma
Eq. (3) is proved analogously to Lemma 3. Indeed, take triangulations of and and identify pairs of linear maps , with points in . For a pair of simplices , and almost all , the intersection is a single open interval of a straight line or empty when , a single point or empty when or with , for some ; and the intersection is empty otherwise. For almost all , we have . Take close enough to so that for each . Then Eq. (3) is equivalent to the set having an even number of elements. We may assume that the latter set is in bijection with the set of pairs of simplices , where or , such that . In what follows, we may impose assumptions, which are automatic for almost all , without listing them explicitly.
To show that is even, construct the following graph. The set of vertices is the set of pairs of simplices such that is a single point. Two distinct vertices and are joined by an edge, if there are top-dimensional simplices , such that and . In this case, is the segment joining and (in particular, the latter points are distinct because the images of the interiors of faces of are disjoint unless ). Thus the set of edges is in a bijection with the set of pairs of top-dimensional simplices , such that . Thus the set of vertices of odd degree is precisely . Thus is even, and (3) holds.
Eq. (3) implies that the intersection index is well-defined (if and satisfy ). Indeed, let and be constant homotopies. Take two triangulations of such that is linear on both and two maps and linear on the first and the second triangulation respectively. Extend the two triangulations to a triangulation of such that is linear and the two maps to a linear map . Construct a triangulation of and maps analogously. All pairs linear on our triangulations can be obtained by this construction. If is close to , then the right side of (3) vanishes, thus for some the number has the same parity for all triangulations of and and almost all , -close to .
As a consequence, if linear maps and intersect ’transversely’, i.e. each point of has a single -preimage and a single -preimage, both lying in the interior of top-dimensional simplices, then the intersection index .
Finally, the intersection index of homotopies is well-defined (if and satisfy the assumptions in its definition; in particular, now or ) because
for a general position pair close to . Here the first equality is the definition. The second one is obvious, where we denote and for all and . The third one follows from the previous paragraph. The last equality is obtained by applying (3) to the rectilinear homotopy between and . ∎
Completion of the proof of Theorem 1. To complete the proof, it remains to prove Lemma 2. It will be deduced from the following generalization of Lemma 1.
Lemma~$1'$
Let . Then for any almost embedding there exist two disjoint -dimensional spheres such that the intersection index is odd.
The cone is considered here instead of itself. This auxiliary cone is essentially used only in the proof of almost non-embeddability in Lemma 2, not just non-embeddability.
Demonstration Proof of Lemma 2 modulo Lemma
Assume that there exists an almost embedding . Let be a vertex of . By the well-known formulae, we get
Let be a pair of -spheres given by Lemma . Identify and . Since and are disjoint, it follows that for each the sets and are disjoint. Each of the sets and contains more than point because one of the spheres and would be a cone otherwise. Thus each of the sets consists of exactly 2 points. By definition, put and . Consider two -tori
contained in .
Clearly, , and . Since is an almost embedding, it follows that the intersection index . So is odd by the choice of and . By Parity Lemma 3 we obtain a contradiction, hence is not almost embeddable into . ∎
Demonstration Proof of Lemma
The proof is similar to that of Conway–Gordon–Sachs theorem and applies the idea of [Kam32], with a slightly more refined obstruction. The reader can restrict attention to the case when and obtain an alternative proof of the Sachs theorem. (The proof for is analogous to that for .)
We show that for any -simplex of and any almost embedding there exist a pair of disjoint -spheres such that and the intersection index is odd.
For an almost embedding , let
be the Van Kampen obstruction to linkless embeddability. Here the sum is over all pairs of disjoint -spheres such that . It suffices to prove that . Our proof is in 2 steps: first we show that does not depend on ; then we calculate for certain ‘standard’ embedding .
Let us prove that does not depend on [cf. Kam32, CG83]. Take any two almost embeddings . By general position in piecewise linear category, there exists a piecewise linear homotopy between them such that
1) there is a finite number of singular moments , i.e., such that is not an almost embedding;
2) for a singular , there is a unique pair of disjoint -simplices such that ;
3) the intersection is ’transversal in time’, i.e., consists of exactly two points, and and are smooth at those points.
Consider a singular moment and the pair of simplices given by condition 2). Conditions 3) and 1) imply that the intersection index of homotopies is odd for small enough . Then by Lemma , for a pair of disjoint -spheres , the intersection index changes with the increasing of if and only if either , or , . Such pairs satisfying the condition are called critical. If , then there are exactly critical pairs. Indeed, we have either or . Each of these two conditions determines a unique critical pair. If , then there are two distinct vertices belonging to the same copy of . Then there is an involution without fixed points on the set of critical pairs. Indeed, acts on the set of vertices of by interchanging and , and it also acts on the set of critical pairs, because . So the number of critical pairs is even, thus .
Fig. 2.
Now let us prove that for certain ‘standard’ embedding (Fig. 2). To define the standard embedding , take a general position collection of lines in . For each take a quadruple of distinct points on -th line. Taking the join of all , we obtain an embedding . The standard embedding is defined to be the cone over this embedding. Further we omit from the notation of -images.
Clearly, for a pair of disjoint -spheres , the intersection index has the same parity as the linking number in . Indeed, let be the half-space bounded by and containing the cone vertex. Take a pair of triangulations of and and a pair of linear embeddings close enough to such that , , and for each pair of simplices unless . Applying Lemma to the rectilinear homotopy between and , we get . Passing to a subdivision, if necessary, we guarantee that for each simplex there is at most one simplex such that . Then is homologous in to the sum of the boundaries of all simplices such that for some simplex . A simple computation shows that each such contributes to , hence .
Let us show that if and only if for each the 0-spheres and are linked in -th line. Indeed, if, say, the two points lie between the two points of for some , then take the segment with . The piecewise linear disk
spans and is disjoint with , hence . If and are linked for each , then take the minimal segment containing . The complement to in deformationally retracts to , thus the complement to in the simplex deformationally retracts to . Then for any -sphere in the latter complement, is a multiple of . Since there exists with , it follows that . (Another explanation is that and intersect transversely at a single point, but we avoid piecewise linear transversality.)
Now it is obvious that there exists a unique pair such that and . So , which proves the lemma. ∎
We conclude the paper by the proof of Theorem 1 in topological category (due to the referee):
Demonstration Proof of Theorem 1 in topological category
For codimension , the assertion of Theorem 1 in topological category follows from the one in piecewise linear one, because by a theorem of Bryant [Bry72] each topological embedding of a polyhedron into a piecewise-linear manifold in codimension can be approximated by a piecewise linear embedding.
The cases of codimension 1 and 2 are reduced to codimension case analogously to Example 3. Indeed, assume that Theorem 1 does not hold for a polyhedron . This means that , where is the dimension given by (1)–(2). By assertion (*),
The composition of the two embeddings is now a codimension embedding. The existence of the latter contradicts to the codimension case of Theorem 1 in topological category because . The obtained contradiction proves the theorem. ∎
Acknowledgements. The author is grateful to Arkady Skopenkov for permanent interest to this work and to the referee for useful suggestions and a remark proving one of the author’s conjectures. The author thanks Emil Alkin for a discussion that inspired the addition of proofs on p. 4–5 to the updated version.
References
- ARS01 P. Akhmetiev, D. Repovš and A. Skopenkov, Embedding products of low–dimensional manifolds in , Topol. Appl. 113 (2001), 7–12.
- Bry72 J.L. Bryant, Approximating embeddings of polyhedra in codimension 3, Trans.Amer.Math.Soc. 170 (1972), 85-95.
- CG83 J. Conway and C. Gordon, Knots and links in spatial graphs, Jour. Graph Theory 7 (1983), 445–453.
- FKT94 M. H. Freedman, V. S. Krushkal and P. Teichner, Van Kampen’s embedding obstruction is incomplete for 2-complexes in , Math. Res. Letters 1 (1994), 167–176.
- Gal92 M. Galecki, On embeddability of CW-complexes in Euclidean space, vol. , preprint, 1992.
- Gal93 M. Galecki, Enchanced Cohomology and Obstruction Theory, Doctoral Dissertation, 1993.
- Gr10 M. Gromov, Singularities, expanders and topology of maps. Part 2: From combinatorics to topology via algebraic isoperimetry, Geom. Funct. Anal. 20:2 (2010), 416–526.
- Kam32 E. R. van Kampen, Komplexe in euklidische Raumen, Abb. Math. Sem. Hamburg 9 (1932), 72–78. , berichtigung dazu, 152–153.
- LT14 E. Lindenstrauss and M. Tsukamoto, Mean dimension and an embedding problem: an example., Isr. J. Math. 199 (2014), 573–584.
- LS98 A. O. Lovasz and A. Schrijver, A Borsuk theorem for antipodal links and a spectral characterization of linklessly embeddable graphs, Proc. of AMS 126:5 (1998), 1275–1285.
- Men29 K. Menger, Über plättbare Dreiergraphen und Potenzen nicht plättbarer Graphen, Ergebnisse Math. Kolloq. 2 (1929), 30-31.
- Neg98 S. Negami, Ramsey-type theorem for spatial graphs, Graphs and Comb. 14 (1998), 75–80.
- ReSk99 D. Repovš and A. Skopenkov, New results on embeddings of polyhedra and manifolds into Euclidean spaces, Russ. Math. Surv. 54:6 (1999), 1149–1196.
- ReSk00 D. Repovš and A. B. Skopenkov, The obstruction theory for beginners, Mathematical Enlightment (Matematich-eskoye Prosveschenie) 2nd series 4 (2000), 154–180.
- ReSk01 D. Repovš and A. Skopenkov, On contractible -dimensional compacta, non-embeddable into , Proc. Amer. Math. Soc. 129 (2001), 627–628.
- RSS95 D. Repovš, A. B. Skopenkov, and E. V. Ščepin, On embeddability of into Euclidean space, Houston J. Math 21 (1995), 199–204.
- RST93 N. Robertson, P. P. Seymor, and R. Thomas, Linkless embeddings of graphs in 3-space, Bull. Amer. Math. Soc. 28:1 (1993), 84–89.
- RST95 N. Robertson, P. P. Seymor, and R. Thomas, Sach’s linkless embedding conjecture, J. Combin. Theory, Series B 64 (1995), 185–227.
- RS82 C. P. Rourke, B. J. Sanderson, Introduction to piecewise-linear topology, Springer, 1982.
- S81 H. Sachs, On spatial representation of finite graphs, in “Finite and infinite sets”, Colloq. Math. Soc. Janos Bolyai 37 (1981).
- Sch84 E. V. Ščepin, Soft mappings of manifolds, Russian Math. Surveys 39:5 (1984), 209–224.
- SSS98 J. Segal, A. Skopenkov, and S. Spiez, Embeddings of polyhedra in and the deleted product obstruction, Topol. Appl. 85 (1998), 335–344.
- SeSp92 J. Segal and S. Spiez, Quasi-embeddings and embedding of polyhedra in , Topol. Appl. 45 (1992), 275–282.
- ShTa M. Shirai, K. Taniyama, A large complete graph in a space contains a link with large link invariant, J. Knot Th. Ram. 12:7 (2003), 915–919.
- Sko23 A. Skopenkov, Algebraic topology from a geometric point of view, preprint.
- Sko24 A. Skopenkov, Realizability of hypergraphs and intrinsic linking, Mathematical Enlightment (Matematicheskoye Prosveschenie) 2nd series 32 (2024), 125–159, arXiv:1402.0658.
- Sko07 A. Skopenkov, Embedding and knotting of manifolds in Euclidean spaces, in: Surveys in Contemporary Mathematics, Ed. N. Young and Y. Choi, London Math. Soc. Lect. Notes 347 (2007), 248–342.
- T00 K. Taniyama, Higher dimensional links in a simplicial complex embedded in a sphere, Pacific J. Math. 194:2 (2000), 465–467.
- Um78 B. R. Ummel, The product of nonplanar complexes does not imbed in 4-space, Trans. Amer. Math. Soc. 242 (1978), 319–328.