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 derived subdivision makes the fixed subcomplex full
Statement
For finite , is full in for every : the vertices of any simplex that lie in span a face of , and its geometric intersection with is exactly that face (possibly empty).
Source locators
2.5.10–2.5.12 pp.51–52.
Facts & Assumptions
Relative derived simplices have a fixed-face plus outside-face-chain form. Relative derived subdivision of a finite simplicial pair.
Proof
Given: A finite pair and at least one relative derived subdivision.
A simplex of consists of a face of and barycenters of nested faces outside , strictly containing . The only vertices in are those of : a barycenter of has support , so cannot lie in the subcomplex . Thus the vertices in span precisely .
For a point in that simplex with a positive coefficient at some , take the largest such face . All its vertex coordinates in the original simplex become positive, with no cancellation, so the original support contains . Such a point cannot belong to , since that would put its support and every subface, including , in . Conversely every point using only vertices of lies in . Therefore the intersection is exactly . The same argument applies with replaced by each . If is empty intersections are empty; if , every simplex is already in .
Depends on
Used by
Dependency tree · two levels
3 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)