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 define its simplex mesh to be the maximum diameter of its nonempty simplices, with the separate convention if there are none. If , then Every nonempty vertex star has diameter at most . 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
Diameter is the supremum of distances for nonempty bounded sets. Bounded subset, diameter, distance from a point to a set, and distance between two sets in a metric space.
Subdivided simplices have vertices in nested barycentric face chains. Barycentric face chains triangulate a geometric simplex.
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.
For points and in a simplex, , since all weights are nonnegative and sum to . 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.
For nonempty nested faces , . Thus . 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 , its powers tend to zero. Zero-dimensional simplices remain points.
For any in the open or closed vertex star of , some simplex contains both and , so . For two points in that star, the triangle inequality gives , and taking the supremum proves the star bound. Finite weak realization topology agrees with the Euclidean topology, so these estimates use a compatible metric.
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
- Allen Hatcher, Algebraic Topology (standard reference, not scraped)