Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6.1-sol)audited 2026-10-08
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.

Face coherence, global hat coordinates and a uniform star radius

Statement

Let X be an isometric polyhedral gluing with standing hypotheses (H1)-(H3) of Abstract isometric polyhedral gluings and the chain metric, with chain metric candidate d, maximal dimension D and finite model list. Write P∗:=P∖{∅} and let K be the order complex (Face poset and order complex) of P∗: its vertices are the elements of P∗ and its simplices are the finite chains in P∗.

For every p∈P∗ let bp be the barycentre of Cp, that is, the average of its vertices, the vertices of a compact convex polyhedral cell being its 0-dimensional faces. Then:

(i) Compatible barycentric triangulation. Each bp is a point of the relative interior of Cp. The canonical map Φ ⁣:∣K∣→X that sends a vertex p to bp and a simplex, that is a chain F0<⋯<Fk in P∗, affinely onto the convex hull of bF0,…,bFk inside CFk is well defined, is a bijection onto X, and is a homeomorphism from the weak topology of ∣K∣ to the weak topology of X. Consequently every point of X lies in the relative interior of exactly one of these simplices, its carrier simplex, whose dimension is at most D.

(ii) Hat coordinates and a uniform Lipschitz constant. For every vertex v∈P∗ let λv ⁣:X→[0,1] assign to x the barycentric coordinate of its carrier simplex at v; equivalently λv(Φ(α))=α(v) for α∈∣K∣ (The geometric realization of an abstract simplicial complex). Then each λv is well defined, ∑vλv(x)=1 for every x∈X with only finitely many nonzero terms, each λv is affine on every simplex of K, and there is a real constant L<∞, depending only on the finite model list, with ∣λv(x)−λv(y)∣≤L d(x,y) for all x,y∈X and every v. Explicitly, one may take for L the maximum of 1 and of the finitely many slopes 1/h of the barycentric coordinate at a vertex of a positive-dimensional simplex of the barycentric subdivision of a model cell, where h>0 is the distance from that vertex to the affine hull of the opposite face of that simplex.

Coordinates on singleton simplices are constant and contribute slope 0; if every cell is a point, take L=1.

(iii) Uniform star radius and finite stars. For every x∈X there is a vertex v with λv(x)≥1/(D+1); for such a v the open ball B(x,δ) of radius δ:=1/(2L(D+1)) is contained in the open star of v (Subcomplexes, closures, stars, and links in a simplicial complex), transported to X along Φ. Every closed star is the image under Φ of the realization of a finite subcomplex of K, and it is compact and metrizable in the weak topology; the open stars cover X; and for every vertex v only finitely many vertices lie with v in a common cell.

Facts & Assumptions

Given: An isometric polyhedral gluing X with (H1)-(H3), shape poset P, cells Cp, face isometries hp,q, chain metric candidate d, maximal dimension D; the set P∗=P∖{∅} and the order complex K of P∗.

[F1]

A compact convex polyhedral cell is a nonempty bounded set in a finite-dimensional Euclidean affine space given by finitely many affine inequalities ℓi(x)≥0; its faces are the intersections with supporting hyperplanes, and equivalently every nonempty face arises by turning some of the defining inequalities into equalities, so a face of a cell is again such a cell and faces of faces are faces. Finite convex cell complex and linear subdivision

[F2]

Every nonempty bounded finite-inequality cell has finitely many faces and a relative interior point, and its proper faces cover its relative boundary. Intersections of finite linear complexes form a convex cell complex

[F3]

Every finite convex cell complex has a compatible finite simplicial triangulation: choose one relative interior point in each nonempty cell, triangulate the boundary in increasing dimension and cone from that point; the construction agrees on every common face and preserves each cell as a subpolyhedron. A triangulation is a finite linear simplicial complex, so its cells are geometric simplices with affinely independent vertices and distinct cells have disjoint relative interiors. Finite convex cell complexes admit compatible triangulations, Finite convex cell complex and linear subdivision

[F4]

For a finite abstract simplicial complex K the weak topology on ∣K∣ agrees with the Euclidean topology, and ∣K∣ is compact, metrizable and Hausdorff; a finite subcomplex of any complex includes into its realization as a closed embedding. Finite simplicial weak topology agrees with euclidean topology, A finite simplicial complex has a compact Hausdorff realization

[F5]

A point of ∣K∣ is a function α on the vertex set with finite support, values in [0,1] and total sum 1, whose support is a simplex (The geometric realization of an abstract simplicial complex); a subset of ∣K∣ is open exactly when its trace on every simplex is relatively open, and the simplices of the order complex are the finite chains in P∗ (Face poset and order complex, An abstract simplicial complex).

[F6]

The chain length of a chain is the sum of the Euclidean distances of its steps computed in any common cells, d is the infimum of chain lengths, (H1)-(H3) hold, and D is the maximum of the dimensions of the cells. Abstract isometric polyhedral gluings and the chain metric

[F7]

The closed star of a vertex v is the union of the closed simplices containing v, and the open star is the union of their relative interiors. Subcomplexes, closures, stars, and links in a simplicial complex

[F8]

A continuous real-valued function on a nonempty compact metric space attains its maximum. A continuous real-valued function on a nonempty compact metric space is bounded and attains a greatest and a least value

Proof

Given: An isometric polyhedral gluing X with (H1)-(H3), cells Cp, chain metric candidate d, and the order complex K of P∗.

1.1F1F2F8algebra

Every nonempty face p has finitely many vertices and at least one, and its barycentre bp lies in the relative interior of Cp. By [F2] the cell Cp has finitely many faces, and a 0-dimensional face is a singleton by [F1]. If dim⁡Cp=0 the cell is its own only face. If dim⁡Cp≥1, then not all defining inequalities of Cp are constant on its affine span, since otherwise Cp would be that whole affine space, which is unbounded in positive dimension, or empty; so some defining inequality ℓ is nonconstant on Cp and satisfies ℓ≥0 there. In orthonormal affine coordinates ℓ=c+∑i=1naixi satisfies ∣ℓ(x)−ℓ(y)∣≤(∑i∣ai∣)∥x−y∥2, so it is continuous. Its maximum M>0 is attained on the nonempty compact cell Cp by [F8], and the set G={x∈Cp:ℓ(x)=M} is a face of Cp by [F1], nonempty, bounded and closed, and of dimension strictly smaller than dim⁡Cp because it lies in the proper affine subspace {ℓ=M}∩aff⁡Cp. Iterating this construction strictly decreases the dimension, so it produces a 0-dimensional face, which is a face of Cp by [F1]. This gives the vertices, and their average bp is defined. If bp were not relatively interior, then by [F2] it would lie in a proper face G of Cp, cut out by some active defining inequalities by [F1], and since G is proper some active inequality ℓ is not identically zero on Cp; then ℓ≥0 on Cp and 0=ℓ(bp) is an average of nonnegative numbers, so ℓ vanishes at every vertex of Cp. But ℓ is nonconstant on Cp, so its maximum face {ℓ=max⁡Cpℓ} is a face of Cp on which ℓ>0, and by the previous paragraph that face contains a vertex of Cp, where ℓ would have to vanish: a contradiction. Hence bp∈relint⁡Cp.

2.1F1F3step 1.1

Fix p. The faces of Cp, together with the empty set, form a finite convex cell complex: by [F1] each face is again a cell, faces of faces are faces, and the intersection of two faces is a face of both because it is obtained by activating the union of their defining equalities. Applying [F3] to this complex with the relative interior points bF of [step 1.1] gives a compatible finite simplicial triangulation of Cp. By induction on dimension over the coning construction its simplices are exactly the convex hulls conv⁡(bF0,…,bFk) for strict chains F0>F1>⋯>Fk of nonempty faces of Cp, and two such simplices with the same top face meet in the simplex of the common subchain. Moreover the construction only uses the faces and their barycentres, so for r≤p the triangulations of Cp and of Cr agree on the common face hr,p(Cr), transported by the affine isometry hr,p.

3.1F5F6step 2.1

The family of all convex hulls conv⁡(bF0,…,bFk) over strict chains F0>⋯>Fk in P∗ is a well-defined family of subsets of X, the map Φ ⁣:∣K∣→X that is affine on each simplex of K with the corresponding vertex values is well defined, and it is a bijection. Each such hull lies in the cell CF0 and is computed there; if the same chain is regarded inside a larger cell the hull is unchanged because all its points lie in the face CF0 and that face is convex, so the subset of X is unambiguous. The images of the simplices of K are exactly the simplices of the triangulations of the cells of [step 2.1], so they cover X, and distinct ones have disjoint relative interiors: within one cell this is the triangulation property of [step 2.1]; and if x lies in the relative interior of simplices with top faces F and G, then x∈relint⁡F∩relint⁡G by the coning description of [step 2.1], while x∈CF∩CG=CF∧G by the intersection condition of [F6]; as CF∧G is a face of CF containing x and x is relatively interior in F, that face must be F itself, and likewise G⊆CF∧G, so F and G are faces of one cell with a common relative interior point and hence coincide by [F2]; then the two simplices are two cells of one triangulation with a common relative interior point and hence coincide. Therefore every point of X is in the relative interior of exactly one of the simplices, so Φ is bijective, and its carrier is unique.

3.2F3F5F6step 2.1

There is a real L with 1≤L<∞, depending only on the finite model list, such that for every simplex of K and every vertex v the function λv restricted to that simplex is L-Lipschitz for the Euclidean metric of its image. On a singleton simplex all coordinates are constant, with slope 0. On a positive-dimensional simplex of K with chain F0>⋯>Fk the function λv either vanishes identically, when v is not one of the Fi, or equals the barycentric coordinate at bv; its linear part has norm 1/h, where h>0 is the distance from bv to the affine hull of the remaining barycentres, because its gradient is perpendicular to that affine hull and the coordinate changes from 0 there to 1 over the perpendicular displacement of length h. Each such configuration is isometric to a configuration in a model cell, because the cells of X fall into finitely many isometry classes and the face isometries are affine and isometric, so the positive-dimensional model simplices supply only finitely many positive numbers h. Take L to be the maximum of 1 and their reciprocals; when no such simplex exists take L=1. This bounds every coordinate slope.

4.1F4F5step 3.1

The bijection Φ of [step 3.1] is a homeomorphism from the weak topology of ∣K∣ to the weak topology of X. A subset V⊆X is weakly open in X exactly when its trace on every closed cell is relatively open, and by [F4] applied to the finite triangulation of a cell this holds exactly when its trace on every simplex of the triangulation of every cell is relatively open. By [step 2.1] those simplices are the images under Φ of the simplices of K, affinely and hence homeomorphically, so this is exactly the condition that Φ−1(V) has relatively open trace on every simplex of K, which by [F5] is openness in ∣K∣. Hence Φ and Φ−1 carry open sets to open sets.

4.2F2F6step 3.1

Every point of X lies in the relative interior of exactly one simplex of K, its carrier, of dimension at most D. Uniqueness and existence are [step 3.1]. A simplex of K is a strict chain F0>⋯>Fk of nonempty faces; passing from Fi+1 to Fi is passing to a proper face, which by [F2] lies in a supporting hyperplane, so the dimensions strictly increase along the chain: k≤dim⁡F0≤D; the simplex therefore has k+1≤D+1 vertices and dimension at most D.

4.3F5step 3.1

Define λv(x):=α(v) where x=Φ(α), using the bijection of [step 3.1]. Each λv is well defined, takes values in [0,1] by [F5], is affine on every simplex of K because α↦α(v) is affine on each simplex and Φ is affine there, and satisfies ∑vλv(x)=1: the sum is over the support of the carrier of x, a finite set, with total 1 by [F5].

4.4step 3.2step 2.1

Let x,y lie in a common cell Cp, whose Euclidean metric is dp. Then ∣λv(x)−λv(y)∣≤L dp(x,y) for every v. The segment [x,y] lies in Cp by convexity, and it is covered by the finitely many simplices of the triangulation of Cp; its intersection with a simplex is convex, hence a point or a subsegment, and on each nondegenerate subsegment λv is L-Lipschitz by [step 3.2]. Summing over the finitely many subsegments gives ∣λv(x)−λv(y)∣≤L dp(x,y).

5.1F6step 4.4algebra

For all x,y∈X and every vertex v one has ∣λv(x)−λv(y)∣≤L d(x,y). Let x=x0,…,xm=y be a chain as in [F6]; each consecutive pair lies in a common cell, so [step 4.4] gives ∣λv(xi−1)−λv(xi)∣≤L dpi(xi−1,xi), and summing the at most m inequalities and using the triangle inequality for real numbers gives ∣λv(x)−λv(y)∣≤L ℓ(x0,…,xm). Taking the infimum over all chains from x to y gives the claim, since L>0.

6.1F7step 5.1step 4.2

Let x∈X with carrier simplex σ and let δ:=1/(2L(D+1))>0, which is legitimate because L≥1. By [step 4.2] the carrier has at most D+1 vertices and the coordinates (λv(x))v of the carrier are nonnegative and sum to 1 over them, so some vertex v of σ satisfies λv(x)≥1/(D+1). For every y∈X with d(x,y)<δ we get λv(y)≥λv(x)−L d(x,y)>1/(D+1)−1/(2(D+1))>0 by [step 5.1]; so the support of the carrier of y contains v, which means that y lies in the relative interior of a simplex containing v, that is, in the open star of v by [F7]. Hence B(x,δ) is contained in the open star of v.

7.1F4F6F7step 4.1step 4.4step 5.1∎

For every vertex v the closed star of v is compact and metrizable, and its open star is open and hence a neighbourhood of each of its own points. The closed star is Φ(∣S∣) where S is the subcomplex of K consisting of every simplex containing v together with all its faces: the simplices containing v are chains in P∗ containing v, and the elements of P∗ comparable with v are finitely many, because P≤v is finite by the shape condition of [F6] and the faces q≥v are finitely many by (H2) of [F6] (a cell Cq meets the relative interior of Cv exactly when v≤q). There are finitely many such chains, and each has finitely many faces, so S is a finite subcomplex, ∣S∣ is compact and metrizable by [F4], and its image under the homeomorphism of [step 4.1] is compact and metrizable. The open star is the union of the relative interiors of precisely the simplices containing v, not of all faces in S. Equivalently it is {x:λv(x)>0}, which is open: on each cell the coordinate is continuous by step 4.4, or for the chain metric it is Lipschitz by step 5.1. It is contained in the closed star and is a neighbourhood of each of its own points; and every x∈X lies in the relative interior of its carrier, which has at least one vertex, so the open stars cover X. Finally, if a vertex w lies in a common cell with v, then w≤q for some q≥v; there are finitely many such q as just shown and each P≤q is finite, so only finitely many such w exist.

Depends on

Used by

Dependency tree · two levels

44 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