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.
A continuous map need not be simplicial before subdivision
Statement refuted
False assertion: every continuous self-map of a geometric edge is the realization of a simplicial self-map in the original triangulation.
Source locators
2.5.1–2.5.6 pp.46–48.
Facts & Assumptions
A star approximation is homotopic to the continuous map. The open star criterion produces a simplicial map.
Finite-source approximation gives a simplicial representative after sufficient subdivision. Finite simplicial approximation for maps of pairs.
Counterexample
Given: The edge with vertices exactly , and .
The map takes into itself, fixes both vertices, and is continuous: on this interval. Any simplicial map whose realization equals must therefore send to and to . Its affine realization on the single edge must be .
At this affine map equals , while . Hence is not simplicial in the original triangulation, refuting the assertion. Nevertheless the identity vertex map is a star approximation: and . The star criterion therefore gives a homotopy to the identity, consistent with finite simplicial approximation. Failure of exact simpliciality is not failure of a simplicial approximation.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
11 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)