Arthur742Ramos/finite-graph-fundamental-group
Formalizes the fundamental group of a finite connected graph, represented as a finite weakly connected directed multigraph with its standard interval-cell quotient realization. The main result identifies the topological fundamental group at a chosen vertex with `FreeGroup (Fin (E + 1 - V))`. The proof compares the topological group with the endomorphism group at the root in Mathlib's free groupoid, whose explicit spanning-tree basis supplies the non-tree-edge generators. The development also proves the cycle-rank identities, root-change equivalences, the tree/triviality criterion, and the…
Comments and reviews
No comments yet.
API
curl /api/v1/records/palomar/PALOMAR-2026-08-27-000004
curl -X POST /api/v1/records/palomar/PALOMAR-2026-08-27-000004/vote -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"value": 1, "emoji": "🤔", "note": "optional"}'
curl -X POST /api/v1/records/palomar/PALOMAR-2026-08-27-000004/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"body": "…", "review": true}'