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 path homotopy over a two-set open cover admits a finite subordinate grid
Statement
Let with and open, and let be a path homotopy. Suppose finite subdivisions of the bottom and top edges are prescribed. Then there are finite partitions
such that the horizontal partition contains every prescribed bottom and top cut, and every closed grid rectangle is mapped by wholly into or wholly into .
Facts & Assumptions
Given: The open cover, path homotopy, and the two prescribed finite boundary subdivisions in the Statement.
Every open cover of a compact metric space has a positive Lebesgue number (Every open cover of a compact metric space has a Lebesgue number: a such that every nonempty subset of diameter less than lies inside a single member of the cover).
The product topology on is the topology of the sup metric , whose balls are open boxes (For the product topology on copies of the usual topology of is the metric topology of on , and hence also of and , so as a product and as a metric space are one space).
A continuous map has open preimages of open sets (For a map of spaces the following agree: continuity at every point, preimages of open sets open, preimages of closed sets closed, preimages of subbasic open sets open, and ).
For every real there is a natural with (For every in a complete ordered field there is a natural with ).
Proof
By [F4], and form an open cover of the compact metric square . By [F1] and [F2], choose a Lebesgue number for this cover in .
Take with , using [F5]. Start with the uniform cuts in each coordinate, adjoin the finitely many prescribed bottom and top cuts to the horizontal list, and sort each resulting finite set after removing repetitions. Every gap in either partition is at most , and both lists contain and .
Each closed grid rectangle is nonempty and has -diameter at most , so [F2] places it inside or . Its image therefore lies in the corresponding cover member, and the constructed horizontal partition refines both prescribed boundary subdivisions.
Depends on
- Homotopies of continuous maps, homotopies relative to a subspace, and path homotopies relative to the endpoints
- The product set $\prod_{i \in I} X_i$ of functions choosing a point in each factor, the projections, the box topology, and the product topology as the initial topology of the projections; the empty product is a one-point space
- For $n \ge 1$ the product topology on $n$ copies of the usual topology of $\mathbb{R}$ is the metric topology of $d_\infty$ on $\mathbb{R}^n$, and hence also of $d_1$ and $d_2$, so $\mathbb{R}^n$ as a product and $\mathbb{R}^n$ as a metric space are one space
- Heine-Borel in $\mathbb{R}^n$: with the Euclidean metric a subset of $\mathbb{R}^n$ is compact if and only if it is closed and bounded, and the proof by bisection uses no choice principle; the same holds on the real line
- Every open cover of a compact metric space has a Lebesgue number: a $\delta > 0$ such that every nonempty subset of diameter less than $\delta$ lies inside a single member of the cover
- For a map of spaces the following agree: continuity at every point, preimages of open sets open, preimages of closed sets closed, preimages of subbasic open sets open, and $f(\overline{A}) \subseteq \overline{f(A)}$
- For every $\varepsilon > 0$ in a complete ordered field there is a natural $n \ge 1$ with $1/n < \varepsilon$
Used by
Dependency tree · two levels
64 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, proof of Theorem 1.20 (standard reference, not scraped)
- J. Peter May, A Concise Course in Algebraic Topology, Chapter 2, Section 7 (standard reference, not scraped)