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.
Unbased homotopic based maps need not induce the same based homotopy map without basepoint transport
Statement refuted
Freely homotopic based maps always induce equal endomorphisms of the fundamental group at the fixed basepoint.
Facts & Assumptions
A vertex inclusion in a finite CW complex has unbased HEP. Finite cw basepoints have explicit homotopy extension
Moving homotopies induce the transport relation, with conjugation by the first-traversed loop. Higher homotopy basepoint transport and moving homotopies
The fundamental group of the two-circle wedge is free on its two standard loops. The fundamental group of a finite wedge of circles is free of that rank
Different reduced words are different elements of the free group. Reduced words form the free group on an alphabet
Counterexample
Given: The spaces, maps, and hypotheses in the statement above.
Let W be the wedge of two quotient circles, with vertex w and standard loops a,b. It has one vertex and two attached 1-cells, hence is a finite CW complex. By F1 the loop a:w×I→W extends to a homotopy with H(-,0)=id. Set g=H(-,1). Since a(0)=a(1)=w, both id and g are based; H is a free homotopy between them with basepoint track a.
F2 gives and . Applying it to b and multiplying in the free group yields . By F3 and F4 this is the reduced three-letter word a inverse, b, a; it has no adjacent cancellation and differs from the one-letter reduced word b. Therefore , although the maps are freely homotopic.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
22 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
- Hatcher, Algebraic Topology, Chapter 4 (standard reference, not scraped)