Bourbaki

Exercise 19, § 5

Tag 041C, permanent. Cite it as [Bourbaki, Tag 041C].

Algebraic Topology, IV, p. 468

Let G be a graph; denote by S the set of its vertices, by A that of its oriented edges and by ∣G∣|G| its geometric realization. Denote by j:S→∣G∣j: S\rightarrow |G| and p:I×A→∣G∣p:\mathbf{I}\times A\rightarrow |G| the canonical mappings. Suppose that the sets S and A are finite.

We say that a mapping f:∣G∣→Rnf:|G| \rightarrow \mathbf{R}^n is affine (resp. piecewise affine) if, for every edge a∈Aa\in A, the mapping t↦f∘p(a,t)t\mapsto f\circ p(a, t) is affine (resp. piecewise affine). (Cf. III, p. 331, exerc. 6.)

(a) Prove that there exists an injective and piecewise affine mapping of ∣G∣|G| into R3\mathbf{R}^3. (Begin by proving that there exists an integer n⩾1n\geqslant 1 and an injective and piecewise affine mapping of ∣G∣|G| into Rn.\mathbf{R}^n.) (b) For every continuous injective mapping f:∣G∣→Rnf:|G| \rightarrow \mathbf{R}^n, prove that there exists a continuous injective mapping g:∣G∣→Rng:|G| \rightarrow \mathbf{R}^n which is piecewise affine and homotopic to ff.

(c) Suppose that the mapping (o,t):A→S×S(o, t): A\rightarrow S\times S is injective. Let ff be an injective map from S into R\mathbf{R}. Prove that there exists a unique affine mapping F from ∣G∣|G| into R3\mathbf{R}^3 which maps every vertex s∈Ss\in S onto the point (f(s),f(s)2,f(s)3)(f(s), f(s)^2, f(s)^3) of R3\mathbf{R}^3. Prove that F is injective.

We say that the graph G is planar if there exists a continuous injective mapping of ∣G∣|G| into R2\mathbf{R}^2.

(d) Suppose that the graph G is planar and that the mapping (o,t):A→(o, t): A\rightarrow S×SS\times S is injective. Let f:∣G∣→R2f:|G| \rightarrow \mathbf{R}^2 be a continuous injective mapping. Prove that there exists an injective affine mapping g:∣G∣→R2g:|G| \rightarrow \mathbf{R}^2 which is homotopic to ff.

Solution

No solution has been written yet.

Cited by

Nothing.

Cites

Nothing.

Machine translation of the English, by gpt-5-mini. Not checked by a person. That model is a cut down version of the one the rest of this language was written by.