Repository · Full text

The space of Delzant polytopes is an absolute retract

Read PDF

HTML version 1 Added

Papers are listed without authors and are not intended for submission or formal publication.

Contents

The space of Delzant polytopes is an absolute retract

Abstract

For every n≥1, we prove that the space of full-dimensional Delzant polytopes in Rn, with the Hausdorff or equivalently the symmetric-difference-volume topology, is an absolute extensor for metrizable spaces. It is therefore an absolute retract and admits a strong deformation retraction onto any prescribed polytope. Its open Hausdorff balls have the same extension property. This answers the fundamental-group question of Pelayo and Santos (Adv. Math., 2025), without restrictions on the normal fans occurring in a continuous family. The proof adapts the extension method of Dugundji (Pacific J. Math., 1951): smooth projective common refinements replace unrestricted convex interpolation, and barycentric subdivision organizes the resulting labels into refinement chains. A boundary estimate independent of the number of labels gives continuity at arbitrary prescribed closed subsets, even when infinitely many normal fans accumulate there. Away from these subsets, the extensions use only finitely many normal fans locally. We also construct continuous Delzant approximations of families of full-dimensional convex bodies with any prescribed positive continuous error, proving that the Delzant locus is homotopy dense in the space of such bodies. The extension theorem applies to the corresponding metric moduli spaces of symplectic toric manifolds with fixed torus and specified moment maps.

Note. This paper was generated entirely by AI, including MiMo, using an automated research pipeline developed by Chenghua Liu and Hanyu Li.

1 Introduction

Delzant’s classification [3] identifies symplectic toric manifolds with convex polytopes whose local lattice geometry encodes smoothness. The metric topology of this class of polytopes describes continuous variation of moment images, including changes in their combinatorial type. Such changes are not controlled by the Hausdorff distance alone: arbitrarily small perturbations can introduce new facets, and a continuous family can encounter infinitely many normal fans. Understanding the topology of each fixed-fan stratum is therefore not enough to understand the full moduli space.

A full-dimensional polytope in Rn is Delzant if it is simple, its edge directions are rational, and the primitive edge vectors at each vertex form a basis of Zn. Equivalently, its normal fan is smooth: every cone is generated by part of a lattice basis. The facet support constants are arbitrary real numbers; no integrality condition is imposed on the vertices. Write Cp⁢(n) for the space of nonempty compact convex subsets of Rn with nonempty interior, and let D⁢(n)⊂Cp⁢(n) be its Delzant subspace. We consider the Hausdorff metric dH and the symmetric-difference metric

dV⁢(K,L)=Voln⁡(K⁢△⁢L).

They induce the same topology on Cp⁢(n), as recalled in Proposition 2.5.

Pelayo, Pires, Ratiu, and Sabatini [7] introduced this metric approach to toric moduli spaces. In dimension four they established connectedness and completion results and showed that the space of Delzant polygons is neither complete nor locally compact. Pelayo and Santos [8] subsequently proved path connectedness of D⁡(n) in every dimension by passing to smooth common refinements of normal fans. They also proved that loops with finitely many normal fans, and more generally locally refining loops, are null-homotopic [8, Corollary 3.37 and Theorem 3.39]. Here a loop is locally refining if the fans of its nearby values refine the fan at each given parameter value. Every loop in D⁡(2) has this property, but their three-dimensional Example 3.41 shows that it need not hold in higher dimension. Their Question 3.46 asks whether π1⁢(D⁢(n)) is nevertheless trivial. The weak contractibility proved in [8, Corollary 3.51] uses a strictly finer CW topology and does not settle this question for arbitrary metric-continuous loops.

We prove an extension theorem in the metric topology that is stronger than contractibility: every continuous map from a closed subset of a metrizable space into D⁡(n) extends to the whole space. No dimension bound on the source, and no restriction on the normal fans in the prescribed image, is required.

Definition 1.1.

A space Y is an absolute extensor for metrizable spaces if, for every metric space X, every closed subset A⊂X, and every continuous map f:A→Y, there is a continuous extension F:X→Y. A metrizable space Y is an absolute retract if every realization of Y as a closed subspace of a metrizable space admits a retraction onto Y.

The extensor property implies the retract property by extending the inverse of a closed embedding. Neither definition imposes completeness or local compactness. To formulate the local assertion, identify a convex body K with its support function

hK⁢(u)=maxx∈K⁡⟨u,x⟩,u∈Sn−1,

in the normed space En=C⁡(Sn−1,R) with the supremum norm. This identification is an isometric embedding for dH.

Theorem 1.2 (Main theorem).

For every integer n≥1, the space D⁡(n), with either dH or dV, is an absolute extensor for metrizable spaces. An extension F:X→D⁡(n) of a continuous map f:A→D⁡(n) from a closed subset of a metric space can be chosen so that every point of X∖A has a neighborhood on which only finitely many normal fans occur.

The same assertions hold for every nonempty intersection D⁡(n)∩W, where W⊂En is open and convex. In particular, every nonempty open Hausdorff ball in D⁡(n) is an absolute retract.

Corollary 1.3.

For every n≥1 and every P∗∈D⁡(n), there is a strong deformation retraction of D⁡(n) onto {P∗}. Consequently, D⁡(n) is path connected and locally contractible, and

πk⁢(D⁡(n),P∗)=0(k≥1).

In particular, Question 3.46 of [8] has an affirmative answer in every dimension.

Deduction from Theorem 1.2.

In the metric space X=D⁡(n)×[0,1], consider the closed subset

A=(D⁡(n)×{0,1})∪({P∗}×[0,1]).

Prescribe f⁡(P,0)=P, f⁡(P,1)=P∗, and f⁡(P∗,t)=P∗. These prescriptions agree on overlaps and define a continuous map on A by the pasting lemma for a finite closed cover. An extension is the required strong deformation retraction. Applying this argument to each open Hausdorff ball proves local contractibility. The remaining assertions follow from contractibility. ∎

The geometric obstruction to direct interpolation is that D⁡(n) is not convex under Minkowski addition. The sum of two Delzant polytopes can have a singular normal fan, already in dimension two (Example 2.4). Interpolation does remain Delzant when the normal fans form a refinement chain: a convex combination has the finest fan among its positive summands. Smooth projective common refinements also admit metric control. If S realizes such a refinement of the fans of P,P1,…,Pm, then P+t⁢S has the fan of S for every t>0 and converges to P as t↓0. These are established geometric ingredients; the use of small Minkowski perturbations in refinement arguments already appears in [8, §3.2.1 and Remark 3.42].

Our contribution is to assemble these finite choices into compatible extensions over arbitrary metric spaces. Dugundji’s extension construction [4, Theorem 4.1] interpolates values in a convex target using a partition of unity. In our setting, labels at unrelated vertices cannot be interpolated directly. Instead, we assign a label to each face of the nerve of a locally finite cover. Its fan refines those of all proper-face labels, while its support function remains close to a prescribed target value. Barycentric subdivision turns nested faces into refinement chains, on which affine interpolation is allowed. Each choice has only finitely many constraints, even when the nerve has unbounded dimension.

The remaining issue is continuity at the prescribed closed subset. There the cover is chosen at a scale comparable to the distance from that subset. As a point approaches a boundary value, all labels contributing to its image approach that same value. The error of a Minkowski convex combination is at most the largest error of its summands, independently of their number. This gives the uniform boundary control needed for arbitrary accumulations of normal fans. We formulate the argument as an extension criterion for preordered subsets of normed spaces in Theorem 3.1. Applied to families of convex bodies, it also yields continuous Delzant approximation with prescribed pointwise error and the homotopy-density theorem (Theorem 4.4). A quantitative disk filling is given in Appendix A.

2 Convex bodies and smooth refinements

Let B denote the closed Euclidean unit ball in Rn. Support functions determine compact convex sets, and

dH(K,L)=‖hK−hL‖∞,hα⁢K+β⁢L=αhK+βhL(α,β≥0).(2.1)

Here addition is Minkowski addition, and a summand with coefficient zero is {0}. The first identity follows from

K⊂L+δB⟺hK≤hL+δ,

using separation of closed convex sets. The second follows by maximizing independently in the two summands.

The subset Cp⁢(n)⊂En is convex. A convex combination has a positive coefficient, and the corresponding dilated body contains an open ball whose translate lies in the combination. We will repeatedly use the estimate

dH⁢(∑j=0kλj⁢Pj,K)≤∑j=0kλj⁢dH⁢(Pj,K)≤maxj⁡dH⁢(Pj,K),λj≥0,∑jλj=1.(2.2)

In particular, Hausdorff balls in Cp⁢(n) are convex in support-function coordinates.

For a nonempty face F of a full-dimensional polytope P, its normal cone consists of the vectors whose linear functionals are maximized on all of F. These cones form the complete pointed normal fan N⁡(P). A fan Σ′ refines Σ if each cone of Σ′ is contained in a cone of Σ. A fan is rational if its cones are generated by lattice vectors. It is polytopal, or projective, if it is the normal fan of a polytope.

A rational simplicial cone is smooth if its primitive ray generators extend to a basis of Zn. In full dimension this means that their determinant has absolute value one. A fan is smooth if all its cones are smooth; for a complete fan, it suffices to check its maximal cones.

For positive coefficients, the normal fan of a Minkowski sum is the common refinement of the normal fans of its summands:

N⁡(α⁢P+β⁢Q)=N⁡(P)∧N⁡(Q)(α,β>0).(2.3)

The common refinement on the right consists of the intersections of cones in the two fans. To obtain the identity, observe that the face exposed by a vector in the sum is the sum of the exposed faces in the summands. Equivalently, the domains of linearity of the sum of two convex support functions are the common refinement of their domains of linearity.

Lemma 2.1 (Interpolation along a chain).

Suppose P0,…,Pk∈D⁡(n) and N⁡(Pj) refines N⁡(Pi) whenever i<j. Every convex combination P=∑i=0kλi⁢Pi is Delzant. More precisely, if j=max⁡{i:λi>0}, then N⁡(P)=N⁡(Pj).

Proof.

Discard the zero coefficients. Positive dilation does not change a normal fan, and the common refinement of a finite chain of fans is its finest member. Apply (2.3) repeatedly. ∎

We next recall the resolution argument that supplies smooth projective common refinements. This is the toric resolution-of-singularities construction [2, §11.1]; the polytopal statements are recorded in [8, Proposition 2.13 and Theorem 2.15]. We include the argument to make the geometric input explicit.

Lemma 2.2 (Smooth projective refinement).

Every rational polytopal complete fan has a smooth polytopal refinement. Consequently, the normal fans of finitely many full-dimensional polytopes with rational normal directions have a common smooth polytopal refinement.

Proof.

A stellar subdivision at a new ray replaces each cone containing the ray by the cones spanned by that ray and the faces not containing it, and includes all faces of the resulting cones. Such a subdivision of a polytopal fan remains polytopal. To see this, let u be a nonzero vector on the new ray, let P realize the fan, and let F be the face on which ⟨u,⋅⟩ is maximized. Choose ϵ>0 smaller than

hP⁢(u)−⟨u,v⟩

for every vertex v outside F. Cutting P by

⟨u,x⟩≤hP⁢(u)−ϵ

retains those vertices and replaces the vertices in F by new vertices on the edges leaving F. The normal cone at each new vertex is generated by u and the normal cone of its original edge. These are precisely the maximal cones of the stellar subdivision. If the inserted ray is rational, the new fan is rational as well.

First make the fan simplicial. Choose a rational interior ray in every cone of dimension at least two, and perform the stellar subdivisions in decreasing order of dimension. The resulting barycentric subdivision is simplicial and remains polytopal.

For a maximal simplicial cone with primitive generators v1,…,vn, its multiplicity is

m=|det(v1,…,vn)|.

The half-open fundamental parallelepiped represents the m cosets of the sublattice generated by these vectors. If m>1, it therefore contains a nonzero lattice point

w=∑i=1nai⁢vi,0≤ai<1.

Let u be the primitive vector on its ray. Writing u=∑ibi⁢vi gives 0≤bi<1. Let τ be the face generated by the vi with bi>0. This face has dimension at least two: a primitive lattice vector has no nonzero lattice multiple with coefficient strictly between zero and one.

Stellar subdivision at u∈relint⁡(τ) replaces each maximal cone containing τ by cones obtained by replacing one generator vi of τ by u. Multilinearity of the determinant shows that each new multiplicity is bi times the old multiplicity, hence is a strictly smaller positive integer. The same calculation holds for every affected maximal cone, since the coefficients of u in the rays of their common face τ are unchanged.

At each step choose a cone of largest multiplicity M>1. The number of cones of multiplicity M strictly decreases, and no cone of multiplicity at least M is introduced. After finitely many steps the largest multiplicity decreases. Induction on M terminates with a smooth fan. Every step preserves projectivity.

For finitely many polytopes, start with their Minkowski sum. By (2.3), its normal fan is rational, polytopal, and refines all the given fans. Apply the preceding construction. ∎

Lemma 2.3 (Common refinements close to a target).

Let P,P1,…,Pm∈D⁡(n) and η>0. There exists Q∈D⁡(n) such that

dH⁢(Q,P)<η,N⁡(Q)⁢ refines ⁢N⁢(P),N⁡(P1),…,N⁡(Pm).

If P belongs to an open subset W⊂En, then Q can also be required to belong to W.

Proof.

Choose a polytope S whose smooth projective fan refines all the listed fans, using Lemma 2.2. For t>0, the polytope Qt=P+t⁢S has normal fan N⁡(S) by (2.3), and

dH⁢(Qt,P)=t⁢‖hS‖∞⟶0.

Thus Qt is Delzant, and sufficiently small t gives the desired error and, when required, membership in W. ∎

The approximation error can be prescribed independently of the number of cones in the common refinement. In the extension argument, this lets the fan complexity grow near the prescribed data while the metric error tends to zero.

Example 2.4 (Minkowski sums need not be Delzant).

Let

A=conv⁡{(0,0),(1,0),(0,1)},B′=conv⁡{(0,0),(−1,0),(0,1)}.

Both polygons are Delzant. The primitive outward rays of the normal fan of A+B′, in counterclockwise order, are

(1,0),(1,1),(−1,1),(−1,0),(0,−1).

The adjacent pair (1,1),(−1,1) has determinant 2, so A+B′ is not Delzant. Taking products gives Delzant three-dimensional polytopes P=A×[0,1] and Q=B′×[0,1] whose sum is not Delzant.

Insert the planar ray (0,1). All six consecutive determinants are then one, and the resulting smooth fan is realized by the hexagon

T=conv⁡{(2,−2),(2,1),(1,2),(−1,2),(−2,1),(−2,−2)}.

Equivalently, T is given by

−2≤x≤2,−2≤y≤2,x+y≤3,−x+y≤3.

Thus S=T×[0,1] has a smooth fan refining those of both P and Q. For every t>0, the polytope Rt=P+t⁢S is Delzant and its fan refines both given fans, whereas

dH⁢(Rt,P)=t⁢‖hS‖∞=3⁢t.

Indeed, maxx∈S⁡‖x‖=3, attained at (2,−2,1). This gives an explicit instance of Lemma 2.3.

2.1 Comparison of the metrics

The following equivalence connects the support-function description with the symmetric-difference topology used for toric moduli spaces; see [8, Proposition 3.3] and [9].

Proposition 2.5.

The Hausdorff metric and the volume-of-symmetric-difference metric induce the same topology on Cp⁢(n).

Proof.

Fix K∈Cp⁢(n) and translate so that r⁢B⊂K for some r>0. If δ=dH⁢(K,L)<r, then hK−δ≤hL≤hK+δ and hK≥r. Hence

(1−δ/r)⁢K⊂L⊂(1+δ/r)⁢K,

and therefore

dV⁢(K,L)≤((1+δ/r)n−(1−δ/r)n)⁢Voln⁡(K).

This tends to zero as δ→0.

Conversely, suppose dV⁢(K,Lj)→0. Let c>0 be the volume of a cap of r⁢B cut off by a hyperplane at distance r/2 from its center. If (r/2)⁢B were not contained in Lj, separation would give a unit vector u with hLj⁢(u)<r/2. The cap

r⁢B∩{x:⟨u,x⟩>r/2}

would lie in K∖Lj, contradicting dV⁢(K,Lj)<c. Thus r0⁢B⊂Lj eventually, where r0=r/2.

The volumes of these Lj are uniformly bounded because Voln⁡(Lj)≤Voln⁡(K)+dV⁢(K,Lj). For any nonzero x∈Lj, the convex hull of x and the radius-r0 disk in the hyperplane x⟂ through the origin lies in Lj. Its volume is

κn−1⁢r0n−1⁢‖x‖n,

where κj denotes the volume of the unit j-ball and κ0=1. Thus all sufficiently large Lj, and K, lie in a fixed ball R⁢B.

For two bodies K1,K2 with r0⁢B⊂K1,K2⊂R⁢B, put δ=dH⁢(K1,K2). If δ>0, interchange them if necessary and choose a unit vector u and x∈K1 such that

⟨u,x⟩=hK1⁢(u)=hK2⁢(u)+δ.

Set λ=δ/(2⁢(R+r0)). Since 0<δ≤2⁢R, we have 0<λ<1. By convexity, the ball

(1−λ)⁢x+λ⁢r0⁢B

is contained in K1. Every point of this ball has u-coordinate at least

hK1⁢(u)−λ⁡(R+r0)=hK2⁢(u)+δ/2,

so the ball is disjoint from K2. Consequently,

dV⁢(K1,K2)≥κn⁢(r0⁢dH⁢(K1,K2)2⁢(R+r0))n.

Apply this to K and Lj to obtain dH⁢(K,Lj)→0. Convergence of sequences therefore agrees for the two metrics, which proves equality of their topologies. ∎

The common interior ball is essential in this comparison. All bodies and all prescribed limiting values in this paper are full-dimensional.

3 Extension along refinement chains

We now isolate the topological argument. It replaces convexity of the whole target in Dugundji’s construction [4] by convexity along chains in a preorder. A preorder is a reflexive, transitive relation; antisymmetry is not required.

Theorem 3.1 (Extension by refinement chains).

Let Y be a nonempty subset of a real normed vector space E, with its subspace topology, and let ⪯ be a preorder on Y. Suppose the following conditions hold.

  1. (i)

    For every finite collection y1,…,ym∈Y, every y∈Y, and every η>0, there exists z∈Y such that yi⪯z for all i and ‖z−y‖<η.

  2. (ii)

    For every finite chain y0⪯⋯⪯yk, its entire convex hull is contained in Y.

Then Y is an absolute extensor for metrizable spaces.

We first describe the interpolation used in the proof. Let {Vi}i∈I be a locally finite open cover of a metric space Z, and choose a locally finite partition of unity {φi}i∈I subordinate to it. Thus φi≥0, ∑iφi=1, and φi⁢(x)>0 implies x∈Vi. Such refinements and partitions exist by paracompactness of metric spaces [6].

The nerve K has a simplex for every nonempty finite set σ⊂I with ⋂i∈σVi≠∅. Its barycentric subdivision has a vertex

bσ=1|σ|⁢∑i∈σei

for each such simplex, where ei are the formal coordinate vertices. Its simplices are the flags σ0⊊⋯⊊σk. Suppose that labels qσ∈Y have been chosen so that

qτ⪯qσ(∅≠τ⊊σ).(3.1)

Send bσ to qσ and interpolate affinely on each subdivided simplex. The definitions agree on common faces, and condition (ii) puts every interpolated value in Y. Evaluate this interpolation at

p⁡(x)=∑iφi⁢(x)⁢ei

to obtain a map G:Z→Y.

Only finite subcomplexes are needed to interpret this construction locally. Near any point of Z, a neighborhood meets only finitely many cover elements, so p and the interpolation factor through the subdivision of a finite subcomplex. There the interpolation is an ordinary continuous piecewise affine map. It follows that G is continuous, without a dimension bound or local-finiteness assumption on the nerve itself.

We also record which labels can contribute at a point. If qσ has positive coefficient in the interpolated value G⁡(x), then

σ⊂I⁡(x):={i:φi⁢(x)>0}.(3.2)

Indeed, the coordinates of bσ are strictly positive on σ and nonnegative elsewhere. A positive coefficient of bσ cannot contribute to a zero coordinate of p⁡(x). In particular, x∈Vi for every i∈σ.

The interpolation has an explicit formula. List the positive partition weights at x in decreasing order as a1≥⋯≥am>0, put am+1=0, and let Ij be the indices of the first j weights. Then

G⁡(x)=∑j=1mj⁡(aj−aj+1)⁢qIj.(3.3)

The coefficients are nonnegative and sum to ∑jaj=1. Moreover, the coordinate with weight aℓ in the corresponding sum of barycenters equals ∑j=ℓm(aj−aj+1)=aℓ. At a tie aj=aj+1, the potentially order-dependent term has coefficient zero. Thus the formula is independent of the ordering within ties and agrees across the subdivided simplices.

q{0}q{1}q{2}q{0,1}q{0,2}q{1,2}q{0,1,2}
Figure 1: Labels on a subdivided triangle. On the shaded simplex they form the chain q{0}⪯q{0,1}⪯q{0,1,2}. Unrelated labels at the original vertices are not directly interpolated.
Proof of Theorem 3.1.

Let A be closed in a metric space (X,d), and let f:A→Y be continuous. If A is empty, take a constant extension. If A=X, take F=f. Otherwise put Z=X∖A and r⁡(z)=d⁡(z,A)>0 for z∈Z.

Cover Z by the open balls Bd⁢(z,r⁢(z)/4) and take a locally finite open refinement {Vi}i∈I. Choose zi∈Z so that, writing ri=d⁡(zi,A), we have

Vi⊂Bd⁢(zi,ri/4).(3.4)

Choose ai∈A satisfying

d⁡(zi,ai)<2⁢ri.(3.5)

Such a point exists by the definition of the distance to A. Choose a subordinate partition of unity and let K be the nerve of the cover.

For every nonempty simplex σ, choose an index i⁡(σ)∈σ. Inductively over its dimension, choose qσ∈Y satisfying

‖qσ−f⁡(ai⁡(σ))‖<ri⁡(σ),(3.6)
qτ⪯qσ(∅≠τ⊊σ).(3.7)

For a vertex, take the target itself as its label. For each higher-dimensional simplex, condition (i) applies to the finitely many proper-face labels. Thus the choices are possible in every dimension, even if K has unbounded dimension.

The interpolation just described gives a continuous map G:Z→Y. Define F=G on Z and F=f on A. It remains to prove continuity at A.

If x∈Vi, the fact that distance to A is 1-Lipschitz gives

d⁡(x,A)>ri−ri/4=3⁢ri/4.

Together with (3.5), this implies

ri<43⁢d⁢(x,A),d⁡(x,ai)<94⁢ri<3⁢d⁢(x,A).(3.8)

Fix a∈A and x∈Z. Every label qσ contributing positively to G⁡(x) has x∈Vi⁡(σ), by (3.2). Therefore

‖qσ−f⁡(ai⁡(σ))‖<43⁢d⁢(x,a),(3.9)
d⁡(ai⁡(σ),a)<4⁢d⁢(x,a).(3.10)

By continuity of f at a, the values f⁡(ai⁡(σ)) are uniformly close to f⁡(a) over all contributing labels when x is close to a. The other error in (3.9) also tends to zero. Since G⁡(x) is a convex combination of these labels, its error is bounded by the largest of their errors.

More explicitly, for x∈Z sufficiently close to a,

‖F⁡(x)−f⁡(a)‖≤43⁢d⁢(x,a)+supb∈Ad⁡(b,a)<4⁢d⁢(x,a)‖f⁡(b)−f⁡(a)‖.(3.11)

The supremum is finite near a and tends to zero as x→a. Thus F⁡(x)→f⁡(a) from Z; continuity on A handles approaches within A. This proves continuity of the extension on X. ∎

The estimate (3.11) does not depend on the number of labels contributing at x. Local finiteness is needed only away from A, where it makes the interpolation finite and continuous.

4 Delzant extensions and approximation

Proof of Theorem 1.2.

The space D⁡(n) is nonempty, since it contains the unit cube. Using the support-function embedding, define a preorder on it by

P⪯Q⟺N(Q) refines N(P).

Distinct polytopes can have the same fan, so antisymmetry is neither asserted nor needed. Lemma 2.3 gives condition (i) of Theorem 3.1, and Lemma 2.1 gives condition (ii). The criterion proves the absolute extensor assertion for the Hausdorff topology.

On each subdivided simplex, the interpolated polytopes have only normal fans among those of its labels, by Lemma 2.1. Near each point of X∖A, the construction involves only a finite subcomplex and hence finitely many labels. Only finitely many normal fans therefore occur on that neighborhood. The constant extension when A is empty has this property as well.

Now let W⊂En be open and convex, with Y=D⁡(n)∩W≠∅. By Lemma 2.3, a common upper bound can be chosen sufficiently close to a target in Y to remain in W. Convex combinations along chains remain in W by convexity. The same criterion and construction therefore apply to Y. An open Hausdorff ball is the intersection with an open norm ball in En, so it is a particular case.

Finally, Proposition 2.5 identifies the Hausdorff and symmetric-difference topologies. The extension and retract properties are topological, so the conclusions hold for both metrics. ∎

Corollary 4.1 (Filling arbitrary spheres).

Every continuous map f:Sk→D⁡(n), for k≥0, extends to a continuous map F:Bk+1→D⁡(n), where Bk+1 is the closed unit ball. The extension can be chosen so that only finitely many normal fans occur on each compact subset of int⁡Bk+1. If f⁡(Sk) lies in an open Hausdorff ball, the filling can be chosen in that ball.

Proof.

Apply Theorem 1.2 with the sphere as the prescribed closed subset, using either D⁡(n) or the indicated open Hausdorff ball as target. A compact subset of the interior is covered by finitely many neighborhoods on each of which only finitely many fans occur. ∎

4.1 Approximation of families of convex bodies

The same interpolation permits arbitrary convex bodies as target values. The density of Delzant polytopes in Cp⁢(n) is already part of [8, Theorem 3.18]. We need approximation compatible with finitely many prescribed fans; the resulting parametric construction will then produce a continuous approximating family.

Lemma 4.2.

Given K∈Cp⁢(n), finitely many polytopes P1,…,Pm∈D⁡(n), and η>0, there exists Q∈D⁡(n) with dH⁢(Q,K)<η whose fan refines every N⁡(Pi). The collection of prescribed polytopes may be empty.

Proof.

Choose a finite η/4-net in K and add n+1 affinely independent points of K. The convex hull of these points lies in K and is at Hausdorff distance less than η/4 from K. Perturb the points to rational points by less than η/4, with a smaller perturbation if needed to preserve affine independence. The resulting polytope R is full-dimensional and has rational vertices, and dH⁢(R,K)<η/2.

The normal fan of R+P1+⋯+Pm is rational and polytopal. By Lemma 2.2, choose a polytope S realizing a smooth projective refinement of this fan. Then Q=R+t⁢S has normal fan N⁡(S) for every t>0, and

dH⁢(Q,R)=t⁢‖hS‖∞.

Choose t so that this is less than η/2. The resulting Q has the required approximation and refinement properties. ∎

Proposition 4.3 (Controlled approximation).

Let X be a metric space, f:X→Cp⁢(n) continuous, and ϵ:X→(0,∞) continuous. There exists a continuous map g:X→D⁡(n) such that

dH⁢(g⁡(x),f⁡(x))<ϵ⁡(x)(x∈X).

Every point of X has a neighborhood on which the values of g have only finitely many normal fans.

Proof.

For each a∈X, choose an open neighborhood Ua such that

dH(f(x),f(a))<ϵ(a)/8,ϵ(x)>ϵ(a)/2(x∈Ua).

Take a locally finite open refinement {Vi}, with Vi⊂Uai, and a subordinate partition of unity. For each nonempty simplex σ of the nerve, choose an index i⁡(σ)∈σ. Inductively choose a label Qσ whose normal fan refines those of all proper-face labels and such that

dH⁢(Qσ,f⁡(ai⁡(σ)))<ϵ⁡(ai⁡(σ))/8.

Lemma 4.2 supplies every choice, including vertex labels when there are no refinement constraints. Interpolate on the barycentric subdivision as in Section 3.

Every label contributing at x satisfies x∈Vi⁡(σ), so its distance from f⁡(x) is less than

ϵ⁡(ai⁡(σ))/4<ϵ⁡(x)/2.

The convex-combination estimate (2.2) gives the required error bound for g⁡(x). Locally, the interpolation involves only finitely many labels and is piecewise affine, proving continuity. Each interpolated value has the fan of one of those labels by Lemma 2.1, which proves the last assertion. ∎

A subset Y of a space Z is homotopy dense if there is a homotopy H:Z×[0,1]→Z with H⁡(z,0)=z and H⁡(z,t)∈Y whenever t>0. In the present setting, the homotopy can be chosen with a uniform metric bound.

Theorem 4.4 (Homotopy density).

There exists a continuous map

H:Cp⁢(n)×[0,1]⟶Cp⁢(n)

such that H⁡(K,0)=K and, for every t>0,

H⁡(K,t)∈D⁡(n),dH⁢(H⁡(K,t),K)<t.
Proof.

Apply Proposition 4.3 on X=Cp⁢(n)×(0,1] to the projection (K,t)↦K, with error function ϵ⁡(K,t)=t. Set H⁡(K,0)=K. For any K0∈Cp⁢(n) and t>0,

dH⁢(H⁡(K,t),K0)<t+dH⁢(K,K0),

which proves joint continuity at (K0,0). Continuity elsewhere is part of the approximation construction. ∎

This also gives a direct contraction of D⁡(n). Fix P∗∈D⁡(n) and put

C⁡(P,s)={H⁡((1−s)⁢P+s⁢P∗,s⁡(1−s)),0<s<1,P,s=0,P∗,s=1.

For 0<s<1 its values are Delzant. The approximation bound and continuity of Minkowski addition give continuity at both endpoints. This contraction need not fix P∗ at intermediate times; the strong contraction is supplied by Corollary 1.3.

5 Symplectic toric moduli

Fix a torus Tn, its integral lattice, and a lattice-compatible identification t∗≅Rn. A symplectic toric manifold here consists of a compact connected symplectic 2⁢n-manifold (M,ω), an effective Hamiltonian Tn-action, and a specified moment map μ:M→t∗. Isomorphisms are equivariant symplectomorphisms preserving the specified moment maps.

The Atiyah–Guillemin–Sternberg convexity theorem and Delzant’s classification [1, 5, 3] imply that

[(M,ω,Tn,μ)]⟼μ⁡(M)

is a bijection from the moduli set M⁡(2⁢n) of these isomorphism classes to D⁡(n). The existence direction starts with facet inequalities ⟨x,ui⟩≥λi, where ui are primitive inward normals. The lattice map Zm→Zn, ei↦ui, is surjective because the normals at a vertex form a lattice basis. Its torus kernel is therefore a subtorus of Tm. Delzant’s construction reduces Cm by this subtorus at the level determined by the λi. The basis condition gives freeness on the reduction level and hence smoothness; boundedness of the polytope gives compactness. The real support constants are symplectic parameters, explaining why the vertices need not be integral.

As in [7, 8], endow M⁡(2⁢n) with the pullback metric

dM⁢([M],[M′])=Voln⁡(μ⁡(M)⁢△⁢μ′⁢(M′)).

The Delzant correspondence is then an isometry.

Corollary 5.1.

For every n≥1, the metric space M⁡(2⁢n) with fixed torus and specified moment maps is an absolute extensor for metrizable spaces and is an absolute retract. It strongly deformation retracts onto any specified isomorphism class. Every continuous map from a sphere into this moduli space extends to a ball, with only finitely many normal fans on each compact subset of its interior. In particular, π1⁢(M⁢(6))=0.

Proof.

Transport Theorems 1.2, 1.3 and 4.1 through the Delzant correspondence. ∎

For the associated toric varieties, refinement of normal fans gives a proper toric birational morphism [2]. The stellar subdivisions used above are toric modifications, and the perturbation P+t⁢S supplies a strictly convex support function on the common refinement. Thus the finite geometric step is a resolution of the fan of a Minkowski sum, followed by a choice of its support function.

The metric topology concerns isomorphism classes with the fixed torus and moment-map data. Along a continuous path, facets may appear or disappear and the underlying differentiable manifold may change; such a path is not, in general, a smooth family on a fixed manifold or a smooth fiber bundle. The construction is not claimed to be equivariant under changes of lattice coordinates. No conclusion about a further affine-unimodular quotient is asserted here.

References

  • [1] M. F. Atiyah, Convexity and commuting Hamiltonians, Bull. London Math. Soc. 14 (1982), no. 1, 1–15. doi:10.1112/blms/14.1.1.
  • [2] D. A. Cox, J. B. Little, and H. K. Schenck, Toric Varieties, Graduate Studies in Mathematics, vol. 124, American Mathematical Society, Providence, RI, 2011.
  • [3] T. Delzant, Hamiltoniens périodiques et images convexes de l’application moment, Bull. Soc. Math. France 116 (1988), no. 3, 315–339. Numdam article.
  • [4] J. Dugundji, An extension of Tietze’s theorem, Pacific J. Math. 1 (1951), no. 3, 353–367. Original article.
  • [5] V. Guillemin and S. Sternberg, Convexity properties of the moment mapping, Invent. Math. 67 (1982), no. 3, 491–513. doi:10.1007/BF01398933.
  • [6] J. R. Munkres, Topology, second edition, Prentice Hall, Upper Saddle River, NJ, 2000.
  • [7] Á. Pelayo, A. R. Pires, T. S. Ratiu, and S. Sabatini, Moduli spaces of toric manifolds, Geom. Dedicata 169 (2014), 323–341. doi:10.1007/s10711-013-9858-x. arXiv:1207.0092.
  • [8] Á. Pelayo and F. Santos, Moduli spaces of Delzant polytopes and symplectic toric manifolds, Adv. Math. 482, Part B (2025), 110624. doi:10.1016/j.aim.2025.110624. arXiv:2303.02369v2. Numbered references to this work use the cited arXiv version.
  • [9] G. C. Shephard and R. J. Webster, Metrics for sets of convex bodies, Mathematika 12 (1965), no. 1, 73–88. doi:10.1112/S0025579300005179.

Appendix A A quantitative disk filling

For loops, the extension can be carried out on a countable triangulation of the open disk. We give the details to express the boundary estimate directly in terms of the modulus of continuity of the loop. The construction works in every dimension n.

Write a loop as f:R/Z→D⁡(n) and define

ωf⁢(δ)=supdR/Z⁢(θ,ϕ)≤δdH⁢(f⁡(θ),f⁡(ϕ)),

where dR/Z is the quotient distance induced by the usual metric on R. Compactness of the circle gives ωf⁢(δ)→0 as δ↓0. Use polar coordinates x=(1−s)⁢e2⁢π⁢i⁢θ, with s=0 on the boundary, and set

sk=2−k,Nk=2k+2(k≥1).

On the circle s=sk, use the vertices θ=j/Nk. In each parameter rectangle

[j/Nk,(j+1)/Nk]×[sk+1,sk],

join the midpoint of its outer side s=sk+1 to both corners of its inner side s=sk. The resulting three triangles agree with the doubled subdivision on the next circle. Identify θ=0 with θ=1, and fill the central disk s≥s1 by coning its subdivided boundary to the center. This is a locally finite topological triangulation of the open disk: every compact subset meets only finitely many triangles. Affine coordinates are taken in the parameter triangles and the central cone triangles.

Label each circle vertex by f⁡(θ), and label the center by any P∗∈D⁡(n). For every edge e, choose a Delzant label Qe whose fan refines the fans of its endpoint labels. If the minimum of the circle levels of its endpoints is k, require Qe to be within 2−k of the value of f at one of its endpoints. For an edge incident to the center, use any positive error and the target at its other endpoint. These choices are possible by Lemma 2.3.

For each triangle T in the kth annulus, choose a label QT whose fan refines those of all its proper-face labels and which is within 2−k of the value of f at one of its vertices. For central triangles choose any positive error and a target at one of their circle vertices. Again Lemma 2.3 applies. Interpolate on the barycentric subdivision. Every small triangle corresponds to a flag

vertex⊂edge⊂triangle,

so Lemma 2.1 makes the resulting map F:int⁡B2→D⁡(n) well defined and continuous.

Suppose x=(1−s)⁢e2⁢π⁢i⁢θ lies in the kth annulus. Every contributing label is within 2−k of a value of f at angular distance at most 1/Nk from θ; vertex labels have zero error, and edges on the outer circle have the smaller error 2−(k+1). By (2.2),

dH⁢(F⁡((1−s)⁢e2⁢π⁢i⁢θ),f⁡(θ))≤2−k+ωf⁢(1/Nk)≤2⁢s+ωf⁢(s/2).(A.1)

For the last inequality, use s≥2−(k+1) and 1/Nk=2−(k+2). The bound tends to zero uniformly in θ as s↓0. Defining F⁡(e2⁢π⁢i⁢θ)=f⁡(θ) therefore extends F continuously to the closed disk. Only finitely many labels, and hence finitely many normal fans, occur on every compact subset of its interior.