Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-generatedPipeline-generatedjudge pass (gpt-6.1-sol)
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

Finite simplicial maps have explicit compatible triangulated mapping cylinders

Statement

Let f:K→L be a simplicial map of finite complexes; vertex identifications are allowed. Its topological mapping cylinder Mf=(∣K∣×[0,1]⊔∣L∣)/((x,0)∼f(x)) has a finite triangulation of dimension at most max⁡(dim⁡K+1,dim⁡L) and a homeomorphism H to Mf fixing both boundary copies. The triangulated cylinder retraction to ∣L∣ is piecewise linear. Before triangulating, its cells and H have the explicit formulas in the proof. For every finite collection of pairs of subcomplexes (Kj,Lj) with f(Kj)⊆Lj, the corresponding cylinders are subpolyhedra; one simultaneous subdivision makes them subcomplexes. The construction also retains the top subpolyhedron f−1(∣Lj∣) for each Lj. On each cell away from the collapsed end, H is smooth in affine coordinates; no immersion or smooth tangent-star claim is made at a collapsed end. All boundaries may be subdivided: the lemma does not promise an extension of an arbitrarily fixed boundary triangulation without subdivision.

Facts & Assumptions

Given: Finite simplicial complexes K,L, a simplicial map f:K→L, and finitely many pairs of subcomplexes (Kj,Lj) with f(Kj)⊆Lj.

[F1]

Realizations carry barycentric coordinates; for finite complexes the weak and Euclidean topologies agree, the realization is compact Hausdorff and metrizable, each ∣σ∣ is a closed convex polytope, and joins are realized as A∗C={(1−t)y+tx:y∈A,x∈C,t∈[0,1]} inside the Euclidean join of two disjoint realizations (The geometric realization of an abstract simplicial complex, Finite simplicial weak topology agrees with euclidean topology, A finite simplicial complex has a compact Hausdorff realization).

[A1]

None: the construction exhibits all cells, maps and inverse formulas explicitly, so no choice principle is used.

Proof

technique · direct
1.1F1construct

Write xv for the barycentric coordinates of a point of ∣K∣ and put fi(x)=∑f(v)=ixv, so that f(x)=(fi(x))i is a convex combination. In every simplex of K cut by the finitely many hyperplanes fi=fj and take the resulting closed convex cells and all their faces; the same arrangement intersected with a simplex gives intersections as faces, so these cells form a finite polytopal subdivision of K. For a cell C let I(C) be the set of vertices i such that fi is maximal on C; it is nonempty, and I(C)⊆I(C′) whenever C′ is a face of C. For every i∈I(C) the image of C under f lies in the star of i, and the set I(C) spans a simplex of L contained in the image simplex. For every nonempty simplex A on vertices in I(C) include the join cell A∗C in the Euclidean join of ∣L∣ and ∣K∣, and include ∣L∣ itself and every face of every such join. The join identities (A∗C)∩(A′∗C′)=(A∩A′)∗(C∩C′) and the face structure of the underlying cells make this a finite polytopal complex Tf whose upper boundary is ∣K∣ and whose lower boundary is ∣L∣. A point of its relative interior has unique join coordinates (1−t)y+tx with 0<t<1, y∈∣L∣, x∈∣K∣, and lies in Tf exactly when the support of y consists of vertices where fi(x) attains its maximum.

2.1F1step 1.1construct

Any finite polytopal complex P is triangulated by induction on dimension: for each cell choose a point in its relative interior, having already chosen one for every proper face, and cone the already triangulated boundary from that point. Each ray from the interior point meets the boundary in exactly one point, the cones over cells have disjoint relative interiors and meet along the cones over their intersections, and the constructions agree on common faces, so this is a finite simplicial complex with the same underlying subset and the same dimension. Applied to the finite list of cells of Tf (and to any finite sublist, coning subcomplexes first) it also respects unions of cells. Its dimension is at most max⁡(dim⁡K+1,dim⁡L): if C lies in a source simplex σ with image simplex τ, then f∣σ is the affine surjection onto τ, and the k−1 equations fi=fj with i,j∈I(C) (where k=∣I(C)∣) are independent on τ; hence dim⁡C≤dim⁡σ−(k−1) and dim⁡(A∗C)=k+dim⁡C≤dim⁡σ+1 for every join cell, while the remaining lower cells have dimension at most dim⁡L. For each pair (Kj,Lj) the cells with C⊆∣Kj∣ and A⊆∣Lj∣, together with ∣Lj∣, form a subcomplex: faces of such cells again satisfy those inclusions, because Kj and Lj are subcomplexes and f(Kj)⊆Lj. The top preimage f−1(∣Lj∣) is a union of source faces, since f is simplicial, hence a union of cells of the subdivision. One further barycentric subdivision makes all these subcomplexes full: its vertices are cells, and a chain all of whose vertices lie in a selected subcomplex is a chain of cells of that subcomplex.

3.1F1F2step 1.1step 2.1algebraconstruct

For x∈C and i∈I(C) put Pi(x)v=xv/fi(x) when f(v)=i and Pi(x)v=0 otherwise. Since f(x) is a point of the simplex τ⊆L, some coordinate fi(x) is at least 1/N with N the number of vertices of L, so the denominators are bounded below on every cell and Pi is continuous on C with values in the face of the source simplex over i. Define H on the join cell A∗C by H((1−t)y+tx)=[u,t], where u=t x+(1−t)∑i∈AyiPi(x) and the bracket denotes the class in Mf of the point (u,t)∈∣K∣×[0,1]. The vector u is a convex combination of points of the source simplex, so it lies in ∣K∣, and f(u)=t f(x)+(1−t)y. For 0<t<1 the join coordinates of a point are unique, and on intersections A∗C∩A′∗C′ the representation has y∈A∩A′, x∈C∩C′, so the values agree; at t=1 the value is [x,1] and at t=0 it is [u,0]=f(u)=y, the lower point itself, so the formula is well defined and fixes both boundary copies. It is continuous on each closed cell, because the Pi are continuous and the map (u,t)↦[u,t] is the composite of a continuous map with the quotient projection; by the finite closed-cover form of [F2] it is continuous on all of Tf.

4.1F1F2step 1.1step 3.1algebraconstruct

Define a map Ψ on ∣K∣×[0,1]⊔∣L∣ as follows: Ψ is the identity on ∣L∣; for u∈∣K∣ and 0<t<1 put z=f(u) and let m=m(u,t)>0 be the unique number with ∑imin⁡(zi,m)=t (unique because the left side is continuous, vanishes at m=0, is strictly increasing while below ∑izi=1, and t<1), and set vi=min⁡(zi,m)/t for t>0, yi=(zi−m)+/(1−t), and xw=(vf(w)/zf(w))uw when zf(w)>0 and xw=0 otherwise; at t=0 define Ψ(u,0)=f(u) directly, and at t=1 define Ψ(u,1)=u on the upper copy. Then z=t v+(1−t)y with v,y probability vectors, f(x)=v, and x lies in every source simplex containing u; moreover xw=uw/t when zf(w)≤m and xw=m uw/(t zf(w)) when zf(w)≥m, so the formulas are continuous on their finitely many closed regions with denominators bounded below by t/N on each collar t≥t0>0 and extend continuously to t=0 with value y=f(u) and to t=1 with value x=u. Hence Ψ is continuous and satisfies Ψ(u,0)=f(u)=Ψ(f(u)), so it respects the equivalence relation and descends to a continuous map Φ:Mf→Tf. The two constructions are inverse: substituting H's formula into the threshold equations recovers ∑imin⁡(zi,m)=t and returns the given [u,t], while for a join point (1−t)y+tx∈Tf and u=t x+(1−t)∑yiPi(x) one computes zi=tfi(x)+(1−t)yi≤tmax⁡jfj(x)=:m when yi=0, and zi=m+(1−t)yi with fi(x)=max⁡jfj(x) when yi>0; the threshold equation then determines m=tmax⁡jfj(x), and the normalized coordinates of u recover x and y as (t+(1−t)yi/fi(x))xw=uw. So H∘Φ=id and Φ∘H=id, and the continuous bijection H is a homeomorphism with inverse Φ.

5.1F1step 3.1step 4.1∎

The retraction R of the cylinder onto ∣L∣, read through H, is R((1−t)y+tx)=(1−t)y+t f(x) on each join cell, an affine map that is piecewise linear after step 2.1. For a pair (Kj,Lj), if x∈∣Kj∣ then each Pi(x) has support in the same source simplex, hence u∈∣Kj∣. Conversely the inverse formula has supp⁡(x)⊆supp⁡(u), so u∈∣Kj∣ implies x∈∣Kj∣; the collapsed end is precisely the chosen ∣Lj∣. Thus the preimage of the mapping cylinder of f∣Kj:Kj→Lj is exactly the subcomplex described in step 2.1. Separately, f−1(∣Lj∣) is a source subcomplex and is retained on the top boundary, as proved in step 2.1. Finally, on each join cell with t bounded away from zero the map H is given by rational functions of the affine coordinates with denominators bounded away from zero, hence is smooth there in the ambient affine coordinates; nothing is asserted about differentiability at the collapsed end t=0, where the quotient is not a manifold chart. This proves all asserted clauses.

Remarks

  • The lemma concerns a simplicial map that has already been constructed, and it supplies no triangulation or simpliciality statement for arbitrary algebraic maps. The simultaneous subdivision in step 2.1 may change an initially chosen boundary triangulation, which is why no extension claim for an arbitrary fixed boundary triangulation is made.

Depends on

Used by

Dependency tree · two levels

26 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources