Arthur742Ramos/TopologicalComputationalPaths
A Lean formalization of topological semantics for endpoint-varying computational paths. It constructs both the canonical final composable quotient and the ordinary pullback of quotient arrows. The selected result proves that the canonical comparison is a continuous bijection and characterizes exactly when it is quotient, a homeomorphism, and an induced topology agreement; under these equivalent conditions ordinary composition is continuous. It also records discontinuity as an obstruction and proves compact--Hausdorff and discrete sufficient cases. The selected certificate additionally…
Comments and reviews
No comments yet.
API
curl /api/v1/records/palomar/PALOMAR-2026-08-29-000005
curl -X POST /api/v1/records/palomar/PALOMAR-2026-08-29-000005/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-29-000005/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"body": "…", "review": true}'