Point-set topology as diagram chasing computations: Lifting property as negation
Misha Gavrilovich

TL;DR
This paper reveals that many fundamental topological properties can be understood as lifting properties, framing them as diagram chasing computations, which offers a new perspective on their logical structure and potential implications for AI.
Contribution
It introduces the idea that key topological definitions are essentially lifting properties relative to simple counterexamples, connecting topology with diagram chasing computations.
Findings
Many topological properties are lifting properties.
Some arguments in topology resemble diagram chasing computations.
Potential links between topology, logic, and AI cognition are discussed.
Abstract
We observe that some natural mathematical definitions are lifting properties relative to simplest counterexamples, namely the definitions of surjectivity and injectivity of maps, as well as of being connected, separation axioms and in topology, having dense image, induced (pullback) topology, and every real-valued function being bounded (on a connected domain). We also offer a couple of brief speculations on cognitive and AI aspects of this observation, particularly that in point-set topology some arguments read as diagram chasing computations with finite preorders.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsConstraint Satisfaction and Optimization · Logic, Reasoning, and Knowledge · Computability, Logic, AI Algorithms
