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.
Relative subdivision neighbourhood adjustment
Statement
Let be a finite simplicial pair, . There is a finite linear subdivision between and and a piecewise affine homotopic to the identity rel , sending an open neighbourhood of into . More precisely, let be the subcomplex of consisting of simplices with no vertex in . Then:
- for every and every vertex of outside , there is a vertex with ; if take ;
- the maximum of the diameters of the stars of vertices of lying in tends to zero.
The homotopy from the identity to stays in each original simplex. The maximum of an empty family of star diameters here is assigned zero.
Source locators
2.5.18–2.5.20 pp.54–56; Zeeman theorem proof pp.40–42.
Facts & Assumptions
The relative subdivision is full on the A vertices. Relative derived subdivision makes the fixed subcomplex full.
The finite source permits continuous affine common-carrier interpolation. The open star criterion produces a simplicial map.
Ordinary iterated mesh tends to zero and stars are bounded by twice mesh. Mesh of iterated simplicial barycentric subdivision tends to zero.
Proof
Given: A finite pair, geometrically identify all relative subdivisions with , and put .
By fullness, in the fixed complex is induced on its vertices. Let be the induced subcomplex on the other vertices. They are disjoint. Form : it subdivides just the mixed simplices of . Its new vertices are barycenters of mixed faces. The face is nonempty by mixedness and is a face by fullness; choose one of its vertices . Define to fix the vertices of and send to . All choices are finite.
For a simplex of , its base face belongs to and its additional vertices are barycenters of a nested chain of mixed faces of . Every image vertex lies in the largest face of this chain, or in the base face if the chain is empty. Hence the images span a simplex of , so extends simplicially from to . Moreover each belongs to the positive support of : this is immediate for a fixed old vertex, and a mixed barycenter is positive at every vertex of its face. If , its positive coefficient at therefore makes its coordinate positive in . Thus , which verifies the star hypothesis for the identity map and the vertex assignment . For any point in such a simplex, and lie in the same original simplex. Thus remains there. Finite simplexwise affine formulas agree on faces, so and are continuous in finite Euclidean realization, and , with .
If a simplex of contains a vertex , its base face is in , and every other vertex is a mixed-face barycenter mapped to . Its image simplex lies in , since is full in . Moreover a positive coefficient of remains positive at in the image. Therefore . The union of these open stars is an open neighbourhood of mapped into .
The full relative subdivision refines : it additionally subdivides and uses the same barycenters on the mixed faces, coning their refined boundaries. It retains the vertices of and their positive barycentric coordinates, so . If is a vertex of any further outside , its minimal carrier face in has an -vertex with positive coordinate at . Every point of has positive coefficient at in some refined simplex; the coordinate of , affine and nonnegative on that simplex, is then positive. Thus this star is contained in and its -image in . For its carrier is the vertex itself.
Let be the induced subcomplex of on vertices outside . No simplex of containing an -vertex can meet : its relative face-chain description has an base face and all outside barycenters lie on faces containing that base. Every point of such a simplex has a positive coordinate at some vertex of that base in , whereas points of have all those coordinates zero. Consequently every simplex meeting is in . For and a vertex , every simplex containing lies in a simplex meeting , hence in . Since is disjoint from , its further relative subdivisions are ordinary barycentric subdivisions. Each such star has diameter at most , which tends to zero by the mesh estimate.
If is vertex-free then , and ; the neighbourhood can be empty and the mesh estimate handles all stars. If , then , , and is vertex-free, so only the near clause occurs. These constructions also cover a vertex-free , with empty maps.
Depends on
Used by
Dependency tree · two levels
12 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
- C. R. F. Maunder, Algebraic Topology (standard reference, not scraped)