Alphabeta Math
TheoremStatement: 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.

The chain metric is a metric, its topology is the weak topology, and the space is proper and complete

Statement

Let X be an isometric polyhedral gluing with standing hypotheses (H1)-(H3) of Abstract isometric polyhedral gluings and the chain metric, let d be its chain metric candidate, and let L and δ be the constants of Face coherence, global hat coordinates and a uniform star radius for this gluing. Then:

(1) Well-definedness and metric. The length of a chain does not depend on the cells chosen to measure its steps, every two points of X are joined by a chain, and d ⁣:X×X→[0,∞) is a metric on X: for all x,y,z∈X, d(x,x)=0, d(x,y)=d(y,x), d(x,y)>0 whenever x≠y, and d(x,z)≤d(x,y)+d(y,z) (Metric space: d(x,y)=0 iff x=y, symmetry, and the triangle inequality; pseudometric and ultrametric).

(2) Topology. The metric topology of d (The metric topology: a set is open when every one of its points has a ball around it inside the set; closed means open complement) coincides with the weak topology of the gluing: a subset of X is open in the metric topology if and only if its trace on every closed cell is relatively open.

(3) Properness and completeness. Every closed d-bounded subset of X is compact (Open cover, subcover, compact metric space, and compact subset of a metric space); in particular (X,d) is complete (Complete metric space: every Cauchy sequence converges in the space) and every closed ball is compact. No bound on the number of cells meeting a vertex is needed beyond local finiteness.

Facts & Assumptions

Given: An isometric polyhedral gluing X with (H1)-(H3), its chain metric candidate d, and the constants L≥1 and δ=1/(2L(D+1))>0 of the star lemma.

[F1]

The gluing data: cells Cp with affine face isometries hp,q, the intersection condition, the weak topology, (H1)-(H3), the maximum dimension D; the chain metric candidate d is the infimum of lengths of chains, where a chain's length is the sum over its steps of the Euclidean distance in any cell containing the two consecutive points. Abstract isometric polyhedral gluings and the chain metric

[F2]

The order complex K of P∗ and the map Φ ⁣:∣K∣→X: Φ is a homeomorphism from the weak topology of ∣K∣ to the weak topology of X; every point of X lies in the relative interior of exactly one simplex of K; the hat coordinates λv satisfy ∑vλv=1, are affine on every simplex, and satisfy ∣λv(x)−λv(y)∣≤L d(x,y); for every x there is v with λv(x)≥1/(D+1) and B(x,δ) lies in the open star of v; every closed star is the image under Φ of the realization of a finite subcomplex of K, hence compact and metrizable; the open stars cover X; and each vertex has only finitely many vertices in a common cell with it. Face coherence, global hat coordinates and a uniform star radius

[F4]

A compact metric space is complete; a closed subset of a compact metric space is compact; a continuous bijection from a compact metric space onto a metric space has continuous inverse; a Cauchy sequence with a convergent subsequence converges to that subsequential limit. A compact metric space is complete and totally bounded, and neither implication uses any choice principle, A closed subset of a compact metric space is compact, A continuous bijection from a compact metric space onto a metric space carries open sets to open sets, so its inverse is continuous, A Cauchy sequence in a metric space with a convergent subsequence converges to that subsequence’s limit

[F5]

For a finite abstract simplicial complex the weak topology on its realization agrees with the Euclidean topology and the realization is a compact metric space; a finite subcomplex of any complex includes into its realization as a closed embedding with that topology. Finite simplicial weak topology agrees with euclidean topology

Proof

Given: The gluing X with (H1)-(H3), its chain metric candidate d, the constants L,δ, the order complex K and the map Φ.

1.1F1

The length of a chain is independent of the chosen cells and is finite, so d is a symmetric real-valued function with d(x,x)=0 and the triangle inequality. If xi,xi+1 lie in cells Cp and Cq, then by the intersection condition of [F1] both points lie in Cp∧q, and the affine face isometries identify the three cells on their common points, so the Euclidean distances computed in Cp and in Cq agree; hence every choice gives the same sum. For finiteness, fix x and let A be the set of points joined to x by a chain; if a cell Cp meets A, say in y, then any z∈Cp is joined to x by the given chain followed by a one-step chain, so Cp⊆A: thus the trace of A on every closed cell is either that cell or empty, and A is open and closed in the weak topology of [F1]; as X is connected, A=X. Therefore every two points are joined by a chain, each chain has finite length, and 0≤d(x,y)<∞ for all x,y. Reversing a chain shows d(x,y)=d(y,x), the one-term chain shows d(x,x)=0, and concatenating chains at y and passing to the infimum shows the triangle inequality.

1.2F2algebra

For every x0∈X and real r>0 the closed ball Bˉ(x0,r) is contained in a finite union of closed stars. Call two vertices v,w adjacent when they lie in a common cell; by [F2] each vertex has only finitely many adjacent vertices. Choose v0 with B(x0,δ)⊆st⁡(v0) and let Sr be the finite set of vertices reachable from v0 by a walk of at most K:=⌈2(r+1)/δ⌉ steps of the adjacency relation; then Bˉ(x0,r)⊆⋃v∈Srst⁡ˉ(v). Indeed, let z∈Bˉ(x0,r). If z=x0, it already lies in the starting star. Otherwise choose a chain x0=y0,…,ym=z of length 0<ℓ<r+1, delete consecutive repeated points, and traverse each remaining step at unit speed in its cell to obtain a map γ ⁣:[0,ℓ]→X with γ(0)=x0, γ(ℓ)=z and d(γ(s),γ(s′))≤∣s−s′∣, because the sub-chain between two parameter values has length at most the parameter difference. Put h:=δ/2 and let 0=s0<s1<⋯<sN=ℓ be the parameters obtained by steps of size h, the last gap being at most h; then N≤K. For each j choose a vertex vj with B(γ(sj),δ)⊆st⁡(vj), taking v0 for j=0. Since d(γ(sj),γ(sj+1))≤h<δ, the point γ(sj+1) lies both in B(γ(sj),δ)⊆st⁡(vj) and in B(γ(sj+1),δ)⊆st⁡(vj+1), so the two open stars meet and vj,vj+1 lie in a common cell, that is, they are adjacent. By induction vN∈Sr, and z=γ(sN) lies in st⁡(vN)⊆st⁡ˉ(vN).

2.1F2F3step 1.1

d is a metric: if d(x,y)=0 then x=y. Suppose d(x,y)=0. By the Lipschitz clause of [F2], ∣λv(x)−λv(y)∣≤L d(x,y)=0 for every vertex v, so λv(x)=λv(y) for all v. Since x and y correspond under the bijection Φ of [F2] to the functions λ(x),λ(y) on the vertex set (their values on the carrier), this gives Φ−1(x)=Φ−1(y) and hence x=y. With [step 1.1] this gives all the metric axioms of [F3].

2.2F1F3step 1.1

Every metric ball is weakly open: the metric topology is contained in the weak topology of [F1]. Fix x∈X and a cell Cp with its Euclidean metric dp. For u,v∈Cp the reverse triangle inequality gives ∣d(x,u)−d(x,v)∣≤d(u,v), and the one-step chain gives d(u,v)≤dp(u,v); hence d(x,⋅) is 1-Lipschitz, in particular continuous, on Cp. Therefore the trace of any open ball B(x,r) on Cp is relatively open, and as p was arbitrary each ball is weakly open.

3.1F2F3F4step 1.2step 2.2

Every closed bounded subset of X is compact. Let A⊆X be closed and bounded; if A=∅ this is [F3]. Otherwise A⊆B(x0,r)⊆Bˉ(x0,r) for some x0 and r>0. The ball Bˉ(x0,r) is closed, since y↦d(x0,y) is 1-Lipschitz and hence continuous, and by [step 1.2] it is contained in the union of the finitely many closed stars st⁡ˉ(v), v∈Sr; each of those is compact in the weak topology by [F2] and therefore compact for the metric subspace topology by step 2.2: any metric-open cover is also weakly open on the star and thus has a finite subcover. Their finite union is metric compact, since an open cover has a finite subcover on each of the finitely many stars, and Bˉ(x0,r), being a closed subset of that compact metric space, is compact by [F4]. Finally A, closed in X, is closed in the subspace Bˉ(x0,r) and therefore compact by [F4].

3.2F2F3F4F5step 2.2

The weak topology is contained in the metric topology. Let W⊆X be weakly open and let x∈W. By [F2] choose a vertex v with λv(x)≥1/(D+1) and B(x,δ) contained in the open star of v; the closed star Sˉ of v is the image under Φ of the realization ∣S∣ of a finite subcomplex S of K. The map Φ∣S ⁣:∣S∣→Sˉ is a continuous bijection from the compact metric space ∣S∣ of [F5] onto Sˉ with the weak topology, and the identity on Sˉ towards the metric subspace topology is continuous by [step 2.2], so the composite is a continuous bijection from a compact metric space onto a metric space; by [F4] the weak and metric topologies agree on Sˉ. Hence W∩Sˉ is open in the metric subspace Sˉ: there is ε>0 with B(x,ε)∩Sˉ⊆W. Taking ε′:=min⁡{ε,δ}>0 and using B(x,δ)⊆st⁡(v)⊆Sˉ we obtain B(x,ε′)=B(x,ε′)∩Sˉ⊆W. Therefore every weakly open set is metric open, and with [step 2.2] the two topologies coincide.

4.1F3F4step 3.1∎

Every closed ball is compact by [step 3.1], since a closed ball is closed and bounded. For completeness, let (xk) be a Cauchy sequence in X; by [F3] fix an index N with d(xm,xk)<1 for all m,k≥N. The finitely many terms x0,…,xN−1 have finite distances from xN, so there is a real ρ>0 with d(xk,xN)≤ρ for every k, and hence the sequence lies in the closed ball Bˉ(xN,ρ), which is compact by [step 3.1] and therefore complete by [F4]; being Cauchy in X and lying in this complete subspace, (xk) converges to a point of it, so (X,d) is complete.

Depends on

Used by

Cited to discharge well-definedness by Abstract isometric polyhedral gluings and the chain metric.

Dependency tree · two levels

63 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