Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-09
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.

Mesh of iterated simplicial barycentric subdivision tends to zero

Statement

For a finite Euclidean simplicial complex K define its simplex mesh m(K) to be the maximum diameter of its nonempty simplices, with the separate convention m(K)=0 if there are none. If dimK=n1, then m(sdrK)(nn+1)rm(K)0. Every nonempty vertex star has diameter at most 2m(K). Zero-dimensional and vertex-free complexes have mesh zero. The metric is the original Euclidean metric transported through barycentric realization, not a new unit-edge metric at each subdivision.

Source locators

2.1, p.120 (complete mesh argument); Maunder 2.5.15 p.53.

Facts & Assumptions

[F1]
[F2]

Subdivided simplices have vertices in nested barycentric face chains. Barycentric face chains triangulate a geometric simplex.

[F3]

Finite weak and Euclidean topologies agree. Finite simplicial weak topology agrees with euclidean topology.

Proof

Given: A finite complex linearly realized in Euclidean space, with its inherited distance.

1.1

For points x=iaivi and y=jbjvj in a simplex, xyi,jaibjvivjmaxi,jvivj, since all weights are nonnegative and sum to 1. The maximum is attained by vertices, so it equals the diameter. A point has diameter zero; the definition of mesh assigns zero to a vertex-free complex without taking a diameter of the empty set.

F1
2.1

For nonempty nested faces FGσ, bG=(#F/#G)bF+(1#F/#G)bGF. Thus bGbF(1#F/#G)diamσn/(n+1)diamσ. Vertices of every subdivided simplex form such a chain, so the previous diameter calculation bounds its diameter by this factor. Iteration gives the asserted estimate. Since 0<n/(n+1)<1, its powers tend to zero. Zero-dimensional simplices remain points.

F2step 1.1
3.1

For any x in the open or closed vertex star of v, some simplex contains both x and v, so xvm(K). For two points x,y in that star, the triangle inequality gives xy2m(K), and taking the supremum proves the star bound. Finite weak realization topology agrees with the Euclidean topology, so these estimates use a compatible metric.

F1F3step 1.1

Depends on

Used by

Dependency tree · two levels

18 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