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.
Vertex groups recover the fundamental group
Statement
For every , reversal gives a canonical group isomorphism Here has the published first-loop-first multiplication, while the automorphism group has categorical composition. The identity map on the underlying loop classes is an anti-isomorphism, not an isomorphism.
Facts & Assumptions
Given: A topological space and a point .
Based loops and the fundamental group defines the loop-class set, the proposed product , the constant loop , and reversal .
Loop classes form the group under concatenation proves that this product is well defined and is a group law with identity and inverse .
Fundamental groupoid of a space has the same endpoint-fixed loop classes at , but in the vertex automorphism group.
Proof
Reversal respects endpoint-fixed path homotopy, is its own inverse on classes, and sends to itself. Hence is a canonical bijection that preserves the identity and inverses.
Reversing a concatenation gives up to the standard endpoint-fixed reparametrization. By [F3], . Thus is a homomorphism.
The bijective homomorphism in steps 1.1–1.2 is the asserted group isomorphism. Without reversal, [F3] gives , which proves the final anti-isomorphism warning as well.
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
- Hatcher, Algebraic Topology, §3.H, pp.327–334 (standard reference, not scraped)